Why the Ethereum Foundation research pivot to Verkle trees matters

Validators face significant hardware requirements because they must store the entire Ethereum state. Current clients need around 50 GB for the state alone and over 150 GB including all Merkle proofs. This storage requirement increases as the network grows. A witness for 1,000 leaves in a Merkle trie is 3.5 MB, but a Verkle tree witness for the same data is only 150 kB, which provides a 23x reduction in the required data. This reduction helps solve the problem of large witnesses that are too big to broadcast within a 12-second slot. You already know that Merkle proofs require providing all sibling nodes along the path to the root. In Merkle Patricia Tries, hashes of all account states make up the leaves and inner nodes hold the hash of their children. The size of a block witness scales linearly with the tree arity and the number of accounts. In the current hexary Merkle Patricia Trie, each node can have up to 16 children. Verkle trees eliminate the need for sibling nodes by using vector commitments. These trees use keys consisting of a 31-byte stem and a 1-byte suffix.

The research pivot to binary trees

In 2026, Ethereum researchers shifted focus from EIP-6800 to binary tree designs under EIP-7864. Verkle trees use polynomial commitments like KZG or IPA to manage wide branching. These trees can have a width of 256 or even 1024 children per node. However, these commitments rely on elliptic curve cryptography. This makes Verkle trees theoretically vulnerable to quantum computing attacks. Binary trees using hash-based commitments offer quantum resistance. The Ethereum Foundation supports this research through the 2025 Academic Grants Round and the 2026 PhD Fellowship Program. The 2025 grants round builds on the success of the 2023 and 2024 rounds, which received 300 applications from 25 different countries. The 2026 program awards 9 to 10 fellowships with $24,000 USD stipends to support academic work over a one-year period. The 2026 fellowships focus on disciplines like computer science, economics, and formal verification. Researchers can also focus on networking, P2P, and client engineering. These programs aim to empower researchers to explore new frontiers and deliver impactful work.

Achieving statelessness

Stateless clients remain a primary goal for the Ethereum roadmap. Stateless clients allow nodes to verify blocks without storing the full state database. They use a witness to provide the necessary state data for transaction execution. Verkle trees enable these small witnesses to move across the network easily. This capability lowers the hardware barrier for new validators. A laptop with a decent internet connection could realistically validate Ethereum. As the network grows, the inefficiencies in Merkle trees become more pronounced. The transition to Verkle trees requires a new data structure, a new gas accounting model, and a comprehensive strategy to migrate the existing state from the MPT to the VKT as it is accessed. This transition is part of the Hegota upgrade in the second half of 2026. The upgrade follows the Glamsterdam upgrade in the first half of 2026. This migration involves a new set of cryptography primitives and new fields at the block level. This process allows the old Patricia trie to become immutable. Will the community favor quantum resistance over the efficiency of Verkle trees?