Ethereum Ditches Merkle Patricia Tries for Verkle Trees

The Ethereum network is undergoing significant changes with the implementation of Verkle trees, which will reduce data requirements by a factor of 23. This change will allow for a move to statelessness and improve node efficiency.

Verkle trees use polynomial commitments instead of standard hashing, enabling a single commitment to represent up to 256 children. This results in witness sizes of only 1-2 KB per proof or 200 bytes per account, down from the current 3.5 MB for Merkle Patricia Tries.

The transition to Verkle trees will require node operators to manage higher CPU and RAM requirements due to polynomial commitment operations. To mitigate this, developers are implementing an Overlay tree to migrate state, which will move 1 billion key-values from the Merkle Patricia Tree to the new Verkle Tree.

According to the protocol's specifications, node operators will require at least 8 cores and 16 threads for validators, with a single thread rating of 3500 or more. A recommended setup costing $1000 using a NUC or Minisforum meets these needs.