Vitalik Buterin proposes separating Ethereum transaction execution from verification

Vitalik Buterin outlined what he characterized as a potentially major evolution of Ethereum's transaction architecture, according to U.Today. The proposal separates transaction processing into two distinct components: 'actions,' which are the effects a transaction has, and 'dependencies,' which are the verification conditions that must be satisfied before execution.

Buterin credits recent work on account abstraction, state design, and cryptographic proof aggregation as enabling a clearer conceptual model. Research surrounding EIP-8141, alternative state models, keyed nonces, and recursive STARK-based mempools has produced what Buterin sees as a more explicit framework, per U.Today.

The motivation is optimization. Dependencies have properties that make them particularly suitable for efficiency gains, Buterin argues. Many dependencies can be checked in parallel. Some can be examined by the mempool before the transaction reaches a block. Some do not require access to Ethereum state at all. Dependencies that meet these criteria, which Buterin calls 'pure' dependencies, could potentially be checked once by the mempool and then never executed again by every validator, according to U.Today.

The scaling benefit would compound. Large collections of pure dependency checks could eventually be replaced by a single STARK proof, which is a type of cryptographic proof that can summarize the correctness of many computations in a compact form. This would reduce the amount of redundant validation work every node must perform.

Validation and execution are traditionally intertwined: nodes receive transactions, validate the required information, and eventually execute them. Separating actions from dependencies would allow developers to optimize them using entirely different approaches, per Buterin's reasoning as reported by U.Today. No implementation timeline or testnet deployment has been announced.