Ethereum Overhaul: Vitalik Proposes Two-Part Plan to Enhance Proof Efficiency

Ethereum's Vitalik Buterin has outlined a comprehensive plan to revamp the blockchain's execution layer. The goal of this overhaul is to improve scaling and compatibility with zero-knowledge proofs. According to Buterin, the current hexary Merkle Patricia Tree used for state is a major bottleneck in proof efficiency.

The first part of the plan involves restructuring Ethereum's state tree using a binary tree. This change would utilize more efficient hash functions, shorten Merkle branches, and reduce inclusion proof sizes. As a result, bandwidth needs and costs associated with light clients and zk-provers will decrease.

The second part of the plan is more ambitious: transitioning Ethereum from its current EVM to a new virtual machine like RISC-V that is designed to be friendly with proofs. This change would enable faster and more efficient proof generation for zk-circuits, which are essential for rollups and other scaling solutions.

While this transition may seem daunting, Buterin emphasizes that it's still in its conceptual phase and requires further discussion among the Ethereum community.