Problem
Research questions and friction points this paper is trying to address.
Verkle Trie
storage efficiency
high-throughput blockchain
state database
commitment computation
SonicDB S6: A Storage-Efficient Verkle Trie for High-Throughput Blockchains
🤖 AI Summary
This work addresses the inefficiency of Ethereum’s Merkle Patricia Trie (MPT) in supporting high-throughput, short-block-interval blockchains due to its large witness size and high storage overhead. To overcome these limitations, the authors design and implement a Rust-based, high-performance Verkle Trie database for the Sonic blockchain. Leveraging Verkle Trie’s fork-free property, they introduce an occupancy-aware node specialization strategy and Delta nodes that record only modified slots, reducing active and archival storage overhead by 98% and 95%, respectively. Further optimizations—including dynamic programming–guided specialization selection, batched updates, multi-threaded commitment computation, and homomorphic Pedersen caching—enable the system to achieve a 2.85× throughput improvement over a persistent Geth Verkle baseline while maintaining a 300-millisecond block interval.
📝 Abstract
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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Verkle Trie
storage efficiency
delta nodes
homomorphic Pedersen caching
high-throughput blockchain
🔎 Similar Papers
No similar papers found.
