Vitalik Buterin, co-founder of Ethereum, has introduced a revised conceptual framework for processing transactions on the Ethereum network. He emphasized that separating transaction “actions” from their “dependencies” could unlock significant efficiency gains for future developments.
Transaction Components: Actions and Dependencies
Buterin stated that ongoing advances in account abstraction, cryptographic proof systems, and novel state models are bringing about a clearer delineation between the tasks a transaction performs, and the conditions that must be met beforehand. He highlighted work around Ethereum Improvement Proposal (EIP) 8141, the use of alternative state models, the introduction of keyed nonces, and experiments with recursive STARK-based mempools as key contributors to this emerging model.
He described “actions” as the tangible effects caused by a transaction, such as transferring tokens or interacting with smart contracts. By contrast, “dependencies” represent the requirements that must be met before those actions can be carried out. This distinction, according to Buterin, would enable developers to pursue optimizations tailored to each component.
Actions define what a transaction changes within Ethereum, while dependencies set out the prerequisites before those changes can take place.
According to Buterin, most Ethereum nodes currently combine validation and execution: they receive transactions, verify them against network rules, and then execute any approved operations. Decoupling these functions, he argued, could lead to performance improvements and more nuanced security guarantees.
Optimizing Dependencies and State Validation
Buterin pointed out that many transaction dependencies can be reviewed in parallel, enabling more streamlined pre-checks before transactions reach inclusion in a block. He also noted that certain dependencies, particularly so-called “pure” dependencies, do not require live access to Ethereum’s global state. These, he said, present a prime opportunity for enhancement.
If implemented, mempools—the systems that collect pending transactions—could process and validate these pure dependencies only once, rather than requiring every network validator to repeat the same checks as blocks are created and confirmed.
Large batches of such validated dependencies may eventually be aggregated into a single succinct cryptographic proof, specifically a STARK, which could demonstrate the correctness of all checks in a single step.
Mini dictionary: STARK (Scalable Transparent Argument of Knowledge), a cryptographic proof technology designed for efficient, trustless verification of complex computations without requiring confidential setup or assumptions. STARKs are widely used in scaling solutions and privacy applications within blockchain networks.
Many dependencies can be checked in parallel, streamlining the validation process and reducing duplication across validators.
Buterin views this model as an important architectural shift. He suggested that these changes might form the basis for future updates, as Ethereum’s developers aim to keep evolving the platform for scalability and security.
