The Ethereum state database uses Merkle Patricia Trie (MPT), which suffers from large witness proof sizes and high storage overhead. Verkle Tries have been proposed as a replacement, offering witness proofs below 150 bytes through vector commitments and Inner Product Argument aggregation. However, deploying a Verkle Trie in a high-throughput, short block-time blockchain such as Sonic, which produces a block every 300 milliseconds, introduces substantial engineering challenges related to storage efficiency, commitment computation costs, and the need to serve both live and historical state queries in real time. We present SonicDB S6, a production Rust Verkle Trie database for the Sonic blockchain, which leverages its non-forking property to enable aggressive storage optimizations. Occupancy-aware node specializations, selected via an O(kn2) dynamic program, reduce live storage by 98%. Delta nodes that record only changed slots reduce archive storage by 95%. Batched updates, multi-threaded commitment computation, and homomorphic Pedersen caching yield 2.85x higher throughput than a persistent Geth Verkle baseline while sustaining production block-rate performance.

翻译：以太坊状态数据库采用默克尔帕特里夏字典树（MPT），其存在见证证明体积庞大且存储开销过高的问题。Verkle Trie被提出作为替代方案，通过向量承诺与内积论证聚合技术，可将见证证明压缩至150字节以下。然而，在高吞吐、短出块时间的区块链（如Sonic，每300毫秒产生一个区块）中部署Verkle Trie，面临着存储效率、承诺计算成本以及需实时响应活跃状态与历史状态查询等重大工程挑战。我们提出SonicDB S6——面向Sonic区块链的生产级Rust Verkle Trie数据库，该方案利用其无分叉特性实现了激进的存储优化。通过O(kn²)动态规划算法选择的占用感知节点特化方案，将活跃存储占用降低98%；仅记录变更槽位的增量节点机制，使归档存储缩减95%。批量更新、多线程承诺计算与同态Pedersen缓存技术相结合，在保持产块级性能的同时，相较持久化Geth Verkle基准实现2.85倍的吞吐量提升。