Abstract
User transactions on Ethereum's peer-to-peer network are at risk of being attacked. The smart contracts building decentralized finance (DeFi) have introduced a new transaction ordering dependency to the Ethereum blockchain. As a result, attackers can profit from front- and back-running transactions. Multiple approaches to mitigate transaction reordering manipulations have surfaced recently. However, the success of individual approaches in mitigating such attacks and their impact on the entire blockchain remains largely unstudied. In this systematization of knowledge (SoK), we categorize and analyze state-of-the-art transaction reordering manipulation mitigation schemes. Instead of restricting our analysis to a scheme's success at preventing transaction reordering attacks, we evaluate its full impact on the blockchain. Therefore, we are able to provide a complete picture of the strengths and weaknesses of current mitigation schemes. We find that currently no scheme fully meets all the demands of the blockchain ecosystem. In fact, all approaches demonstrate unsatisfactory performance in at least one area relevant to the blockchain ecosystem.
Introduction
In the Decentralized Finance (DeFi) ecosystem, the order in which transactions are processed can be as critical as the transactions themselves. This vulnerability has given rise to Blockchain Extractable Value (BEV), often referred to as Miner Extractable Value (MEV)—an "invisible tax" on users. Because validators and miners have the authority to order transactions within a block, they (or sophisticated bots) can manipulate this order to extract profit at the expense of regular users. This paper provides a comprehensive framework for understanding these manipulations and evaluates the diverse strategies proposed to mitigate them.
The Mechanics of Transaction Reordering
In traditional finance, "front-running" is a prohibited practice where a broker trades ahead of a client's order. In DeFi, however, it is a structural byproduct of the mempool—the public waiting area for transactions. Attackers monitor the mempool for profitable opportunities and use their control over ordering to execute three primary attack types:
- Fatal Front-running: An attacker inserts a transaction that causes the victim's transaction to fail entirely, while the attacker captures the intended profit.
- Front-running: An attacker executes a trade before the victim, intentionally worsening the price for the victim's subsequent trade.
- Back-running: An attacker executes a trade immediately after a victim's transaction to profit from the price impact or arbitrage opportunity created by that trade.
Evaluation Framework
To assess the effectiveness and viability of mitigation schemes, this SoK establishes a multi-dimensional evaluation framework consisting of seven critical metrics:
- Decentralization: Does the scheme maintain a trustless environment or introduce central points of failure?
- Security: How resilient is the scheme against adversarial bypass or manipulation?
- Scope: Does the solution address all BEV types or only specific subsets (e.g., sandwich attacks)?
- Jostling: Does it prevent "gas wars" where users overbid to gain priority?
- Goodput: Does the network maintain a high volume of genuine, successful transactions?
- Delay: Does the scheme increase the latency between transaction submission and execution?
- Cost: Does the solution impose additional transaction fees on the user?
Categorizing Mitigation Strategies
The paper analyzes several state-of-the-art approaches, mapping them against the seven metrics to reveal their inherent trade-offs.
Trusted Third Parties (TTPs)
Services like Flashbots and Eden are currently the most popular solutions. They effectively eliminate "jostling" and provide low delay. However, they rely on off-chain trust, which contradicts the core ethos of blockchain decentralization.
eUTXO Models
Used by blockchains like Cardano, the extended Unspent Transaction Output (eUTXO) model is naturally resistant to front-running because it limits interactions per pool per block. While highly secure, this creates a significant "goodput" bottleneck, making it difficult to scale for high-volume DeFi applications.
Commit & Reveal Schemes
These schemes hide transaction details until they are committed to a block. While they offer high security and a broad scope of protection, they often double the transaction cost and introduce significant delays, as users must wait for multiple blocks to reveal and execute their trades.
Algorithmic Committees
Some decentralized solutions use a committee to determine transaction order. The authors warn that if these committees act as rational, profit-seeking agents, they may still collude to extract BEV, suggesting that decentralization alone does not guarantee security.
The "No Free Lunch" Reality
The core finding of this systematization is that no current scheme excels across all seven dimensions. Every solution forces a trade-off. For instance, Optimized Trade Execution (such as splitting trades) is highly compatible with existing blockchain structures but offers a very narrow scope of protection. Conversely, Off-chain Commit & Reveal shows the "greatest promise" for broad protection but currently suffers from high complexity and potential committee-based security risks.
Conclusion and Future Directions
For DeFi to compete with centralized finance, it must solve the transaction reordering problem without sacrificing performance or decentralization. Currently, a "suitable approach" that satisfies all ecosystem demands has yet to emerge. Future research should focus on refining commit-reveal mechanisms to reduce their associated delays and costs, ensuring that the "invisible tax" of BEV can be mitigated without compromising the user experience.
Summary updated