与「KB국민은행」相关的搜索结果

别再傻傻地去买昂贵的海外 API Key 跑模型了！ GitHub 登顶双榜第 1 的 dsh-our-free-model 搞了个相当霸道的本地网关方案：不让你填任何 Key，不让你绑定信用卡，直接把 DeepSeek V4.1 Flash、Kimi K3 和 GLM 5.3 打包成零门槛的免费前沿车道！ 最绝的是它解决了深度思考模型最大的那个死穴：一旦思考时间太长断连，它能在本地 900 秒内自动触发有界恢复，把正文无缝补全。再加上 RTK 算法对 40KB 的 git diff 直接就地重写压缩 90% 冗余，上下文效率直接拉满。 别在繁琐的注册和订阅上浪费时间，把它挂进本地 CLI，白嫖免费前沿模型才是硬道理。

Any Telegram message can now become an app. ⚡ Downloads instantly (less than 4 KB)
🎨 Interactive and natively rendered
💸 Payments and viral mechanics built in 🛠️ Build your own. More info and docs for devs:

听说这个项目很屌，在 ESP32-C3 上实现 Pi-hole 级别的 DNS 广告拦截。 把 537,000 个域名以 40 位 FNV-1a 哈希的形式排序存在 flash 里，用二分查找匹配，查询时整个进程只吃掉约 50 KB RAM，10 ms 内对命中域名回 0.0.0.0，没命中就转给上游。 控制面是自带的 Web 面板，能按客户端看拦截数、封客户端、加白加黑；固件和黑名单都走 WiFi OTA，黑名单还能指向 GitHub Actions 每周更新。

一块 2 美元的开发板，刷成了 DNS 广告拦截器，并且开源了。 ESP32-C3 Super Mini，400KB 内存、4MB 闪存、自带 WiFi，加一个 USB 转接头和一个 3D 打印外壳。 不要订阅。 不要浏览器扩展。 不要独立电源。 插在路由器的 USB 口取电，WiFi 连上，设成你家的 DNS 服务器。列表里的广告和追踪域名，在这一层全部拦掉。 为了压住内存，域名用 40 位哈希存。带一个网页面板，能看到拦了什么，也能自己加域名。 作者 ZedAxis，东西叫 ESP32-C3 AdBlock。 补一个原作者没展开说的点： 这种 DNS 拦截，和你手机上装拦截 App，不是一回事。 手机端只对那一台设备生效，换个 App 或者走 DoH 就漏了。 DNS 层是全家一起生效——手机、平板、电视、孩子的设备，还有那些根本装不了东西的智能家电。 代价是它拦不了加密流量里的广告。比如 YouTube 的贴片广告，那是同一个域名下混在正文流里的，DNS 层看不见。 但网站上的横幅、跳转、追踪脚本，基本都挡得住。 2 美元，插上就不管了。

如果你掉进黑洞，会看到什么？ Claude Opus 5.5 用一个 100KB 的单文件html写了个黑洞渲染器，每个像素的光线都按广义相对论一步步算出来，配乐也是它用代码生成的。 先是 72 秒的坠落，最后整个宇宙缩成头顶一个光圈；看完可以自己拖动视角，绕着黑洞转。 在线体验和源码见回复

一个 18 KB 的 HTML 文件，没有一张图片。 山川、海洋、云、大气、夜里的城市灯火、星环、月亮，全在你显卡上实时算出来。 按空格换一颗，十万颗星球，每一颗都有编号可以分享。

A note on recursive STARK mempools (EIP-8288) This is an EIP that I am hoping we can get included in I-star (the fork after Hegota) that you can think of as the next step after Frames, that would unlock extreme amounts of power. Particularly: * Ultra-cheap quantum-safe signatures (SPHINCS-). Much of the cost savings comes from the fact that the signature data (~3 kB) does not have to go onchain * Ultra-cheap quantum-safe privacy protocols. Status quo minimum cost for private txs is ~300k if you engineer very well (no one does), status quo quantum-safe is ~10M gas, this could reduce it to low tens of thousands. * Universal support for your favorite new signature or proof scheme without needing EVM changes. Whatever you use (Falcon, ML-DSA, some other lattice-based thing, something code-based or isogeny-based or even more esoteric), you can just wrap it client-side in a STARK, onchain gas cost low tens of thousands just like privacy protocols. Hopefully, Ethereum will never need "please support my favorite cryptographic algo" politics again. * Private account abstraction: keep your account logic private, and in a private location onchain. Then you can make one transaction to change the ownership of all your onchain state - accounts, defi positions, privacy protocol notes, everything - without revealing which objects' ownership you're changing. Here's how it works. Your transaction can include a type of frame that we call a "dependency frame". The frame is a list of statements, asserting claims like "message hash M was signed by SPHINCS- public key P" and "data hash D was proven to satisfy a statement defined by verification key V". When you send your transaction, you send it in an envelope, which includes a signature or a STARK for each statement in a dependency frame. Once the transaction reaches the mempool, nodes aggregate them. Each node runs a loop: wait one tick (eg. 500ms), aggregate all new envelopes (either single-tx or multi-tx) that you've seen, remove any transactions that are expired, generate a STARK recursively proving all dependencies, and send a new multi-tx envelope containing that STARK. Hence, the bandwidth load is bounded: each node's outbound is one STARK (~100-300 kB) per tick, plus each transaction getting broadcasted through the network once (as happens already). The block builder acts as "yet another mempool node", receiving envelopes from the mempool (plus any side channels), generates its own STARK covering the subset of transactions it intends to include in the block, and adds that STARK to the block. Total onchain overhead: one STARK (100-300 kB), plus 96 bytes for each statement being proven. This is what I've called before ( ) "The Proof Singularity". Today, we have all the ingredients to actually implement it. As a developer, this requires a somewhat different workflow than you are used to, but it is conceptually simple. Any signatures or STARKs, you put into a separate frame. Then the main logic that today is verifying a signature or STARK, you replace with checking for the existence of a frame that includes the correct statement as a dependency. Examples of useful statements: * [tx sighash] verifies against [the pubkey at sload(0)] * there exists a secret and a merkle branch such that hashing secret+0 and applying the merkle branch outputs (public) root R, and hashing secret+1 outputs (public) nullifier N * there exists a secret address A, salt S and signature Z such that sload(0) = hash(A, S) and a merkle proof of address A inside a recent ethereum state contains some pubkey D where [tx sighash] was signed by D [this is private account abstraction; all variables except [tx sighash] and sload(0) are private; you can also make D a STARK verification key] * there exists an ML-DSA signature signing [tx sighash], that verifies against an ML-DSA pubkey whose hash is sload(0) At the core, this is moving any compute and data other than bookkeeping "business logic" outside the core path of Ethereum execution, sharding and parallelizing it via the mempool. Notice also that this requires agreeing on a _language_ (aka. an ISA) for the recursive STARKs to define statements in. The current leading candidate is RISC-V. So this would also de-facto be Ethereum adding RISC-V (or something else we decide on) as a canonical ISA - a big decision that should be done carefully, but that I think will be necessary to drive Ethereum forward.

人人网 多么古早的回忆 当年通过人人网给自己的以为高中女同学写了一封情书，当然我也很快的收到了回复 对方say no... 不过年少无知的我对此并没有太多的感觉，只是我那封1KB的txt情书不知道躺在哪个废弃机房里面的某台服务器硬盘上了 我想很难重见天日吧 多年后，在深圳小区碰到一位同年级的女生，细聊之下发现她认识我那高中女同学 一来二去我们又加上了微信，有时间聊几句 年少的情愫早已烟消云散，剩下只有对往昔的追忆 后面除了每年过年固定的互相祝福，就很少联系了 我有时候回老家会发一些吃过的馆子，建议她有机会尝尝，每次发完都会收到一些羡慕的回应 因为她嫁到了遥远的北方，一个吃面食的地方，对于湖北人而言，这简直是噩梦吧

人人网 多么古早的东西 记得当年用人人网发了一封情书给我高中同学 对方say no 🤣🤣🤣 当时我倒也没有太多的感觉，只是不知道那封 1kb 的txt文本是否还躺在某台废弃的服务器的硬盘里 时光易逝 前几年在自己住的小区里面碰到了高中时候的同年级同学，一聊之下居然发现她认识我那高中同学 我随即又在QQ里面跟她发消息，后面又加了微信，没什么联系了 不过当年情愫早已成遥远的回忆，现在的仅有的交流只有每年过年固定的互相祝福了 不过我在老家的时候有时候会多发点，比如老家哪个餐厅不错，建议她有几乎去尝尝 因为她在遥远的北方，几乎不怎么回老家....