AlDBaran: Towards Blazingly Fast State Commitments for Blockchains
Bernhard Kauer, Aleksandr Petrosyan, Benjamin Livshits

TL;DR
AlDBaran introduces a highly efficient authenticated data structure for blockchains, enabling multi-million TPS state updates with support for historical proofs, surpassing existing solutions in speed and simplicity.
Contribution
It presents AlDBaran, a novel authenticated data structure that eliminates disk I/O, employs prefetching, and refines Merkle tree updates for ultra-fast blockchain state commitments.
Findings
Handles 48 million updates/sec on high-end hardware
Achieves 8 million updates/sec on portable hardware
Supports historical state proofs for new blockchain applications
Abstract
The fundamental basis for maintaining integrity within contemporary blockchain systems is provided by authenticated databases. Our analysis indicates that a significant portion of the approaches applied in this domain fail to sufficiently meet the stringent requirements of systems processing transactions at rates of multi-million TPS. AlDBaran signifies a substantial advancement in authenticated databases. By eliminating disk I/O operations from the critical path, implementing prefetching strategies, and refining the update mechanism of the Merkle tree, we have engineered an authenticated data structure capable of handling state updates efficiently at a network throughput of 50 Gbps. This throughput capacity significantly surpasses any empirically documented blockchain throughput, guaranteeing the ability of even the most high-throughput blockchains to generate state commitments…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
