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-grade 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 $\mathcal{O}(k n^2)$ dynamic program, reduce live storage by 97.8\%. Delta nodes that record only changed slots reduce archive storage by 95\%. Batched updates, multi-threaded commitment computation, and homomorphic Pedersen caching yield $3.2\times$ higher throughput than a persistent Geth Verkle baseline while sustaining production block-rate performance.

翻译：以太坊状态数据库采用Merkle Patricia Trie（MPT），其存在见证证明体积庞大与存储开销高昂的问题。Verkle Trie被提出作为替代方案，通过向量承诺和内积论证聚合技术可将见证证明压缩至150字节以下。然而，将Verkle Trie部署于Sonic这类每300毫秒产块的高通量短出块时间区块链时，会面临存储效率、承诺计算成本以及实时服务实时与历史状态查询需求等重大工程挑战。我们提出面向Sonic区块链的生产级Rust语言Verkle Trie数据库SonicDB S6，该方案利用其无分叉特性实现激进的存储优化。通过$\mathcal{O}(k n^2)$动态规划算法选取的占用感知节点特化技术，将实时存储降低97.8%；仅记录变更槽位的增量节点将归档存储缩减95%。批处理更新、多线程承诺计算与同态Pedersen缓存机制，使吞吐量相较持久化Geth Verkle基线提升3.2倍，同时保持生产级出块速率性能。