Ethereum Abandons Verkle Trees for Binary Trees and STARK Proofs

Ethereum's roadmap has shifted once again as researchers abandon plans to implement Verkle trees in favor of binary trees paired with STARK proofs. The decision, announced by Vitalik Buterin on March 3, 2026, follows years of development and testing.

Verkle trees were designed to address the growing problem of state proof size, which has become increasingly expensive as the Ethereum network expands. State proofs are required for full nodes to verify transactions and ensure data integrity.

Merkle trees, currently used by Ethereum, rely on hash-based commitment structures. They have been a cornerstone of blockchain technology since Ralph Merkle patented the concept in 1979. However, they become inefficient as the state grows, necessitating the development of more efficient solutions like Verkle trees.