Vitalik Buterin has outlined a new conceptual model for Ethereum transactions that separates what a transaction does from what must be verified before it runs. He argues the split, built on recent account-abstraction and proof-aggregation research, could open the door to major scaling gains.
Ethereum co-founder Vitalik Buterin has outlined what he sees as a potentially major evolution of Ethereum's transactions. He says recent work on account abstraction, state design, and cryptographic proof aggregation is producing a clearer separation between what transactions do and what must be proven before they can do it.
Buterin pointed to research on EIP-8141, alternative state models, keyed nonces, and recursive STARK-based mempools as evidence the concept has produced a more explicit model of transactions.
Splitting actions from dependencies
The key, according to Buterin, is distinguishing between two components: "actions" and "dependencies." According to Buterin: "An action is an effect that a transaction has," he explained. The distinction may sound largely conceptual, but Buterin argues that separating the two explicitly could let developers optimize each in fundamentally different ways.
Validation and execution are traditionally intertwined: nodes receive a transaction, validate the required information, and then execute it. Buterin argues that dependencies have properties that make them particularly suitable for optimization.
Why parallel checks could speed scaling
Many dependencies can be checked in parallel, some can be examined by the mempool before a transaction reaches a block, and others do not require access to Ethereum state at all.
Those so-called "pure" dependencies could potentially be checked once by the mempool and never executed again by every validator. Buterin said large collections of such checks could eventually be replaced by a single STARK proof confirming they were all performed correctly.
Source: U.Today
Trading involves risk.
Risk Disclaimer
