Briefing
The core research problem is the design of Transaction Fee Mechanisms (TFMs) that remain incentive-compatible in the presence of active block producers whose private valuations for blocks, often interpreted as Maximal Extractable Value (MEV), fundamentally conflict with user and system welfare. This paper establishes a foundational impossibility result, demonstrating that no non-trivial TFM can achieve both incentive compatibility and near-optimal social welfare with active block producers. The breakthrough is the SAKA mechanism, a novel deterministic TFM that circumvents this impossibility by leveraging the explicit decoupling of searchers and proposers, using searcher bids as an “MEV oracle” to design a mechanism that is provably incentive-compatible for all participants and guarantees a substantial, mathematically proven fraction of the maximum possible social welfare. This new theoretical framework mandates that future blockchain architecture must incorporate explicit mechanism design components, like order flow auctions, to align economic incentives across the entire block production supply chain.
Context
Prior academic models for Transaction Fee Mechanisms (TFMs) primarily assumed passive block producers whose utility was derived solely from collected transaction fees. This foundational assumption failed to account for the reality of Maximal Extractable Value, where block producers are active economic agents with private, off-chain valuations for the blocks they produce, creating a fundamental conflict of interest. This theoretical gap created a crisis in mechanism design, as existing protocols were proven vulnerable to welfare-reducing MEV extraction strategies that undermined their purported incentive compatibility.
Analysis
The SAKA mechanism resolves the theoretical conflict by introducing a fine-grained model that formally separates the roles of searchers and proposers, a structure inspired by existing block-building markets. The mechanism operates by having searchers submit bids for the right to order transactions, effectively revealing the block’s MEV as a verifiable public signal. The TFM then uses this revealed value to set prices for users and determine the proposer’s compensation, ensuring that all three parties → users, searchers, and the block producer → are incentivized to truthfully report their valuations. This mechanism fundamentally differs from previous TFM designs by using an internal, game-theoretically enforced auction to convert the block producer’s private value (MEV) into a public variable, thereby making the entire blockspace allocation process subject to a verifiable economic equilibrium.
Parameters
- Welfare Guarantee → 50%. The maximum-possible social welfare guaranteed by the SAKA mechanism when transaction sizes are small relative to block sizes.
- Impossibility Bound → 50%. The matching negative result proving that no deterministic, incentive-compatible, and sybil-proof TFM can guarantee more than this fraction of maximum welfare.
- Incentive Compatibility → Achieved for all three parties → users, searchers, and the block producer.
Outlook
This research establishes a new theoretical frontier by mathematically quantifying the fundamental trade-off between incentive compatibility and social welfare in MEV-rich environments. The next phase of research will focus on whether cryptographic techniques, such as threshold encryption or verifiable computation, can circumvent the deterministic mechanism’s 50% welfare ceiling. Real-world applications will see the SAKA model or its derivatives integrated into next-generation rollup sequencers and Layer 1 block-building protocols to ensure credibly neutral transaction ordering and a fairer distribution of economic value, moving the field toward provably optimal mechanism design.
Verdict
The paper provides the first formal impossibility result and a provably efficient mechanism, establishing the definitive economic limits for decentralized transaction fee mechanism design in the presence of Maximal Extractable Value.
