Ethereum plans to cut redundant work to scale

In a Sept. 27 essay, Ethereum co-founder Vitalik Buterin outlined an architecture that would reduce redundant computation on the network. He described a “cryptographic world computer” in which some participants perform computation and others check short proofs that the work was done correctly.

Under the current model, every node downloads transactions and repeats the same execution to reach consensus. The proposed architecture would shift execution to dedicated provers that generate succinct cryptographic proofs, including zero-knowledge proofs and recursive proofs. Validators would then verify those proofs instead of re-running every transaction.

Proposals referenced in the essay include an L1 zkEVM, where a prover executes a block and produces a compact proof of correct execution for other nodes to verify cheaply. Buterin noted that many of the underlying technologies remain under active research and have not been integrated into production Ethereum clients.

Buterin set a long-term timeline for the overhaul, suggesting that by about 2030 Ethereum could look qualitatively different from earlier blockchain designs. Nearer-term work on the protocol roadmap includes Hegotá, currently planned for 2027, which he described as potentially the network’s last fork that feels like the older era. He cited PeerDAS as an example of early projects exploring the new approach.

The essay also pointed to several parallel research efforts: optimizing proof-of-stake consensus, dividing block construction among multiple participants, exploring quantum-resistant cryptography, and using automated formal verification to reduce client risk. These efforts aim to change how work is produced and checked across the network.

Buterin warned that making execution cheap to verify does not remove the need for the underlying data. State — account balances, contract storage and other on-chain data — remains necessary for computation. He highlighted weak statelessness as one approach under study, where most validators verify blocks without maintaining the full state while block producers keep the state needed to construct blocks and create witnesses.

Technical challenges remain. Researchers and developers must build reliable systems to store, retrieve and parallelize access to state as computation is distributed. Proof systems continue to face performance and implementation hurdles before widespread deployment. Designs for state management and proofs will need to develop alongside the applications that use them.

On the potential benefits of the shift, the essay stated: “Perhaps the most important shift is that decentralization can in some cases become a performance strength rather than just a safety cost.” The piece described a hybrid model that retains broad verification while allowing specialized infrastructure to perform more computation and storage.