Verkle Trees Enable Stateless Ethereum Clients via Compact Polynomial Commitments
Verkle Trees replace Merkle proofs with polynomial commitments, reducing state witness size by 30x, unlocking truly scalable and decentralized stateless clients.
Asynchronous Accumulators Decouple State and Ordering for High-Throughput Consensus
A multi-proposer architecture with asynchronous state commitments achieves 5 gigagas throughput by decoupling transaction ordering from state verification.
