Advertisement
AD

Buterin Teases Major Advances in Ethereum Transaction Formats

Sun, 6/09/2026 - 8:36
Ethereum co-founder Vitalik Buterin says a new generation of transaction formats could lay the groundwork for major Ethereum scaling gains by separating transaction execution from the conditions that must be verified beforehand.
Advertisement
Buterin Teases Major Advances in Ethereum Transaction Formats
Cover image via U.Today
Google

Ethereum co-founder Vitalik Buterin has outlined what he sees as a potentially major evolution of Ethereum’s transactions. 

Advertisement

He claims recent work on account abstraction, state design, and cryptographic proof aggregation is contributing to a clearer separation between what transactions do and what must be proven before they can do it.

Buterin said recent research surrounding EIP-8141, alternative state models, keyed nonces and recursive STARK-based mempools has produced a more explicit conceptual model of transactions.

HOT Stories
Alex Jones Issues Alarming Warning to XRP Holders Binance Coin (BNB), Uniswap (UNI), Gram (GRAM) and ChainLink (LINK) Price Analysis for September 5: Memecoin and Altcoin Season Is Here

The key is to distinguish between two components: "actions" and "dependencies."

Advertisement

"An action is an effect that a transaction has," Buterin explained.

The distinction may sound largely conceptual. However, Buterin argues that explicitly separating the two could allow Ethereum developers to optimize them in fundamentally different ways.

Why it matters

Validation and execution are traditionally intertwined. Nodes receive transactions, validate the required information, and eventually execute them.

Advertisement

Buterin argues that dependencies have properties that make them particularly suitable for optimization.

You Might Also Like

Many dependencies can be checked in parallel. Some can be examined by the mempool before the transaction reaches a block. Others do not require access to Ethereum state at all.

Those so-called "pure" dependencies could potentially be checked once by the mempool and then never executed again by every validator.

According to Buterin, large collections of such checks could eventually be replaced by a single STARK proving that they were all performed correctly.

"Dependencies can be processed in parallel," he wrote.

Advertisement
Advertisement
Advertisement
Advertisement

Recommended articles

Our social media
There's a lot to see there, too
Advertisement
Advertisement
AD