AI 中文总结
本文提出区块更新摘要（BUD）机制，通过认证每区块写日志实现高效历史认证读取，指数层级压缩证明，在50倍状态增长下路径开销仅增1.24倍，显著优于传统Merkle树。
AI 中文摘要
区块链通常通过维护一个覆盖整个状态的结构来为认证读取付费。我们展示了验证者如何通过认证每个区块的写入来支持历史成员资格和排除证明。区块更新摘要（BUD）提交一个写日志，其前驱指针链接每个键的连续修改。超级BUD（SuperBUD）汇总一个窗口内的最后写入；一个指数层级将长时间不变的时间间隔转换为短证明。摘要数量在层级范围内与间隔成对数关系，超出范围后每个顶层窗口额外增加一个摘要。我们证明了在对抗性证明者和最多f个拜占庭验证者存在下的可靠性，以及对于由部署后修改锚定的查询的完备性，假设存档、证明和委员会证据可用。在状态大小增加50倍的情况下，测量的基础BUD路径仅增加1.24倍，而内存和缓存受限的磁盘支持Merkle Patricia树的路径分别增加3.1倍和69.5倍。在合成轨迹上，双摘要读取层负载保持在800字节以下，暖哈希路径验证在p99时最多耗时146微秒。
英文摘要
Blockchains usually pay for authenticated reads by maintaining a structure that spans the entire state. We show how validators can support historical membership and exclusion proofs by authenticating each block's writes instead. A Block Update Digest (BUD) commits a write log whose predecessor pointers link successive modifications of each key. A SuperBUD summarizes last writes over a window; an exponential hierarchy turns long unchanged intervals into short proofs. The digest count is logarithmic in the gap within the hierarchy's range, with one additional digest per top-level window beyond it. We prove soundness against adversarial provers and up to f Byzantine validators, and completeness for queries anchored by a post-deployment modification, assuming archive, attestation, and committee evidence is available. Across a 50x increase in state size, the measured base-BUD path rises by 1.24x, compared with 3.1x and 69.5x for in-memory and cache-bounded disk-backed Merkle Patricia tries. On the synthetic trace, two-digest read-layer payloads stay below 800 bytes, and warm hash-path verification takes at most 146 microseconds at p99.
