Ethereum Unveils Scalability Roadmap with Verkle Trees and Danksharding

The Ethereum network is shifting towards a more efficient and scalable architecture. Two key initiatives, Verkle trees and Danksharding, are being implemented to reduce congestion on the network. Verkle trees aim to decrease the size of state proofs by using 32-byte keys with a 31-byte stem and a 1-byte suffix. This reduces the tree depth and enables low-power devices like laptops to process blocks.

The current Merkle Patricia Trie requires nodes to store the full state database, leading to high hardware costs for validators. In contrast, Verkle trees use polynomial commitments to replace sibling nodes, but this increases CPU load during proof generation. A function called MapToScalarField converts child commitments into numbers for the parent vector.

Danksharding focuses on increasing block space for rollups by introducing blobs that consensus clients delete after 4096 epochs (approximately 18 days). Full Danksharding expands the blob limit from 6 to 64, while PeerDAS increases the capacity from 6 to 48 blobs per block. This expansion helps lower rollup fees.