๐ค AI Summary
Forkless Layer-1 blockchains suffer from excessive StateDB storage overhead and low transaction throughput due to conventional database designs that retain redundant fork-support mechanisms. Method: This paper introduces the first state database architecture explicitly tailored for forkless consensus. It abandons legacy fork-compatible design patterns and instead integrates state compression, lazy state updates, and a versioned state trieโleveraging the deterministic, fork-free execution environment inherent to forkless chains to optimize data structures. Contribution/Results: Experimental evaluation against the Geth-based Fantom client demonstrates a 100ร reduction in storage footprint and a 10ร improvement in transaction throughput. Crucially, this work establishes the first systematic decoupling of database design from fork assumptions, thereby proposing a novel paradigm for high-performance, lightweight Layer-1 node implementations.
๐ Abstract
Operating nodes in an L1 blockchain remains costly despite recent advances in blockchain technology. One of the most resource-intensive components of a node is the blockchain database, also known as StateDB, that manages balances, nonce, code, and the persistent storage of accounts/smart contracts. Although the blockchain industry has transitioned from forking to forkless chains due to improved consensus protocols, forkless blockchains still rely on legacy forking databases that are suboptimal for their purposes. In this paper, we propose a forkless blockchain database, showing a 100x improvement in storage and a 10x improvement in throughput compared to the geth-based Fantom Blockchain client.