While whale metrics deteriorate, Ethereum’s architect calls for structural change. Vitalik Buterin argues that incremental upgrades cannot sustain long-term scaling demands.
Developers continue pushing toward rollups and advanced zero-knowledge proving systems. Still, the underlying architecture struggles to match the pace. That mismatch creates friction and raises complexities in verification.
At the center of the debate stands the Ethereum State Tree. This structure manages accounts, balances, and the storage of smart contracts. It relies on Merkle Patricia trees, which feature intricate branch logic and hashing rules.
As zero-knowledge rollups expand, proving costs increase sharply. Provers must process complex branch paths and large data structures. That workload consumes hardware resources and time.
Read More: Best Ethereum Alternatives to Watch in 2026
Buterin proposes replacing the current model with Binary State Trees. These trees use simple two-child nodes instead of multi-branch structures. As a result, proof generation becomes more straightforward.
In addition, he suggests introducing a RISC-V virtual machine to reduce complexity and eliminate EVM-proving bottlenecks. Binary state trees align more closely with modern zero-knowledge systems. Provers would manage simpler paths and fewer edge cases.
This proposal targets structural inefficiencies rather than surface adjustments. If implemented, proof sizes could shrink, and processing could become more predictable as Ethereum evolves under the rising demands for scalability.