[Paper Review] Condorcet Attack Against Fair Transaction Ordering

Vafadar, Mohammad Amin, Khabbazian, Majid|arXiv (Cornell University)|Jan 1, 2023

Blockchain Technology Applications and Security89 citations

TL;DR

This paper exposes a systemic risk in Ethereum's consensus layer caused by miner extractable value (MEV), particularly through priority gas auctions (PGAs) and arbitrage bots that frontrun trades. It demonstrates that MEV from pure revenue opportunities and PGA fees can enable time-bandit attacks, undermining blockchain security—empirically validating a $6M+ economy of frontrunning and revealing that MEV exceeds block rewards.

ABSTRACT

We introduce the Condorcet attack, a new threat to fair transaction ordering. Specifically, the attack undermines batch-order-fairness, the strongest notion of transaction fair ordering proposed to date. The batch-order-fairness guarantees that a transaction tx is ordered before tx' if a majority of nodes in the system receive tx before tx'; the only exception (due to an impossibility result) is when tx and tx' fall into a so-called "Condorcet cycle". When this happens, tx and tx' along with other transactions within the cycle are placed in a batch, and any unfairness inside a batch is ignored. In the Condorcet attack, an adversary attempts to undermine the system’s fairness by imposing Condorcet cycles to the system. In this work, we show that the adversary can indeed impose a Condorcet cycle by submitting as few as two otherwise legitimate transactions to the system. Remarkably, the adversary (e.g., a malicious client) can achieve this even when all the nodes in the system behave honestly. A notable feature of the attack is that it is capable of "trapping" transactions that do not naturally fall inside a cycle, i.e. those that are transmitted at significantly different times (with respect to the network latency). To mitigate the attack, we propose three methods based on three different complementary approaches. We show the effectiveness of the proposed mitigation methods through simulations, and explain their limitations.

Motivation & Objective

• To investigate the extent and mechanics of arbitrage bots exploiting transaction ordering in decentralized exchanges (DEXes).
• To formalize and analyze priority gas auctions (PGAs), where bots compete via gas fee bidding for transaction priority.
• To demonstrate that MEV—especially from order optimization fees—poses a real, measurable threat to Ethereum's consensus-layer security.
• To empirically validate that MEV can subsidize forking and time-bandit attacks, undermining blockchain integrity.
• To release a real-time dashboard (frontrun.me) and open-source data to enable community monitoring and further research on MEV dynamics.

Proposed method

• The authors analyze a subset of Ethereum transactions to quantify pure revenue arbitrage opportunities, identifying those that unconditionally profit from atomic trades.
• They model PGA behavior as a continuous-time, partial-information, game-theoretic system, formalizing bot strategies in competitive gas fee bidding.
• Empirical data from the frontrun.me dashboard is used to validate the model, showing convergence on cooperative equilibria with minimal gas-price increases.
• The paper introduces the concept of miner extractable value (MEV), focusing on order optimization (OO) fees as a key source of MEV.
• It demonstrates that MEV from PGAs and pure arbitrage can enable time-bandit attacks by rewriting blockchain history to extract past profits.
• The authors use real transaction data and simulations to estimate attack feasibility, including 51% attack costs and MEV thresholds.

Experimental results

Research questions

• RQ1 To what extent are arbitrage bots exploiting transaction ordering in DEXs, and what is the quantifiable economic scale of this activity?
• RQ2 How do bots behave in priority gas auctions (PGAs), and can their strategies be formally modeled as a game-theoretic equilibrium?
• RQ3 Can MEV from PGAs and pure revenue arbitrage enable forking or time-bandit attacks on Ethereum’s consensus layer?
• RQ4 What systemic security risks do high MEV levels pose to blockchain integrity and miner behavior?
• RQ5 How do protocol-level details (e.g., miner selection, P2P relay behavior) influence application-layer security and fairness in smart contracts?

Key findings

• The authors identify a lower bound of $6 million in revenue from pure revenue arbitrage opportunities on Ethereum to date.
• Priority gas auctions (PGAs) exhibit a cooperative equilibrium where bots bid only slightly above minimum gas prices, validating the formal game-theoretic model.
• MEV from PGAs and arbitrage alone exceeds the Ethereum block reward, indicating a dominant economic force in the network.
• The paper empirically demonstrates that fee-based forking attacks are realistic and feasible on Ethereum, with attack costs estimated at $1.78 million for a 24-hour 51% attack.
• Time-bandit attacks are enabled by high MEV, as miners can rewrite history to extract profits from past trades, with potential net gains of $220,000 from a single attack.
• The study reveals that MEV poses a systemic threat to consensus stability, with current Ethereum volumes and MEV levels sufficient to subsidize serious network attacks.