2020是庚子年，新冠疫情大爆发，大概两三年时间控制住了。 今年底12月是庚子月，鼠疫应该12月才会爆发，子本身在十二地支里也代表鼠。 全球政府对疫情处理已经很有经验了，预计两三个月时间就收拾干净，倒也不必恐慌。 历史总是惊人的相似，己亥、庚子、辛丑本身可以代表污秽混浊的意思，丑也代表容器，承载细菌病毒的载体，所以2021年辛丑年是新冠管控的爆发期。 为什么说这次鼠疫不会那么严重，丙午纯火年，12月庚子月天克地冲，雷声大雨点小。2027年1月辛丑月，丑午穿把容器穿坏了。 爆发到收拾干净不会超过3个月，虽然时间很短，但该做的防护还是得做，君子不立危墙之下。

冰露理论才是版本答案 零售大水以怡宝为例，2.5块1.5升，折合1.67/升，冰露折合1.29/升，此为一胜 大水需要几次喝完，但冰露一次一瓶喝完就能扔，不会剩，此乃二胜 冰露喝完瓶子能崩一下，这是三胜 冰露能塞进迪卡侬 8.99的腰包，四胜 冰露泡蛋白粉，冷萃茶，冰浓缩浓缩, 分量都刚刚好，五胜 三胜对一胜，冰露才是版本答案

Anthropic 这份报告里，另一个很有意思的案例是： 两个本科生，已经可以参与一套 24 小时不停机的 Agent 网络攻击系统。 Anthropic 追踪到一个可能位于长沙的中文网络行动团队 （案例号GTG-10007），其中两名操作者被确认是湖南某大学计算机与通信工程学院本科生。 其中一人还曾在深信服实习，并正在面试奇安信的攻击性网络行动岗位。 这群人把 Claude 当成整个攻击系统的工程和编排层，自动反编译固件、寻找漏洞、生成 exploit、测试、失败后继续修改。 其中一条自动化 workflow，一个月就产出了十多个潜在 0day漏洞。 所谓的0day漏洞是指尚未被公开披露、官方没有修复补丁，且软件或硬件供应商通常不知晓的安全漏洞。 安全维护人员在面对这类漏洞时，修复和响应的时间为零天（也就是无法防御）。 同时，他们还运行了 13 个常驻 AI Agent，持续收集美国军方、政府网站、采购信息和社交媒体内容，再自动整理成情报。 最有意思的是，这些 Agent 在人不在线的时候也会继续工作。 过去需要一个安全团队持续投入的事情，现在已经开始变成一条 24 小时自动运行的生产线。 这个案例已经很能说明 Agent 对个人和小团队能力边界的放大了。

A note on recursive STARK mempools (EIP-8288) eips.ethereum.org/EIPS/eip-8… 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 ( youtube.com/watch?v=TSLUpOps… ) "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.

ETHShanghai 2026 将于9月22日在上海开启，以“以太坊的文艺复兴”为核心主题，重寻以太坊价值坐标。🥳🚀 活动由@ETHPanda_Org、@PANewsCN、The Excited Few 联合主办；@WXblockchain、@GCCofCommons、@LXDAO_Official、@ethereumhkhub、@Web3BuidlerTech 特别支持。 🔗注册：luma.com/365uky1b