Credible Decentralized Exchange Design via Verifiable Sequencing Rules
Matheus Venturyne Xavier Ferreira, David C. Parkes
Abstract
Trading on decentralized exchanges has been one of the primary use cases for permissionless blockchains with daily trading volume exceeding billions of U.S. dollars. In the status quo, users broadcast transactions they wish to execute in the exchange and miners are responsible for composing a block of transactions and picking an execution ordering -the order in which transactions execute in the exchange. Due to the lack of a regulatory framework, it is common to observe miners exploiting their privileged position by front-running transactions and obtaining risk-fee profits. Indeed, the Flashbots service institutionalizes this exploit, with miners auctioning the right to front-run transactions. In this work, we propose to modify the interaction between miners and users and initiate the study of verifiable sequencing rules. As in the status quo, miners can determine the content of a block; however, they commit to respecting a sequencing rule that constrains the execution ordering and is verifiable (there is a polynomial time algorithm that can verify if the execution ordering satisfies such constraints). Thus in the event a miner deviates from the sequencing rule, anyone can generate a proof of non-compliance. We ask if there are sequencing rules that limit price manipulation from miners in a two-token liquidity pool exchange. Our first result is an impossibility theorem: for any sequencing rule, there is an instance of user transactions where the miner can obtain non-zero risk-free profits. In light of this impossibility result, our main result is a verifiable sequencing rule that provides execution price guarantees for users. In particular, for any user transaction A, it ensures that either (1) the execution price of A is at least as good as if A was the only transaction in the block, or (2) the execution price of A is worse than this "standalone" price and the miner does not gain when including A in the block. Our framework does not require users to use countermeasures against predatory trading strategies, for example, set limit prices or split large transactions into smaller ones. This is likely to improve user experience relative to the status quo.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on5
- Flash Boys 2.0: Frontrunning in Decentralized Exchanges, Miner Extractable Value, and Consensus InstabilityPhilip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li et al.S&P 2020 · 607 citations
- On the Instability of Bitcoin Without the Block RewardMiles Carlsten, Harry A. Kalodner, S. Matthew Weinberg, Arvind NarayananCCS 2016 · 387 citations
- Quantifying Blockchain Extractable Value: How dark is the forest?Kaihua Qin, Liyi Zhou, Arthur GervaisS&P 2022 · 336 citations
- High-Frequency Trading on Decentralized On-Chain ExchangesLiyi Zhou, Kaihua Qin, Christof Ferreira Torres, Duc Viet Le et al.S&P 2021 · 243 citations
- Order-Fairness for Byzantine ConsensusMahimna Kelkar, Fan Zhang, Steven Goldfeder, Ari JuelsCRYPTO 2020 · 152 citations
Related papers
- On Identifying Sound Conditions for Frontrunning ResistanceSebastian Holler, Anna Piscitelli, Jannik Albrecht, Stephan Dübler et al.CCS 2026
- Perils of Parallelism: Transaction Fee Mechanisms under Execution UncertaintySarisht Wadhwa, Aviv Yaish, Fan Zhang, Kartik NayakUSENIX Security 2026 · 3 citations
- Data Independent Order Policy Enforcement: Limitations and SolutionsSarisht Wadhwa, Luca Zanolini, Aditya Asgaonkar, Francesco D'Amato et al.CCS 2024 · 6 citations
- SPEEDEX: A Scalable, Parallelizable, and Economically Efficient Decentralized EXchangeGeoffrey Ramseyer, Ashish Goel, David MazièresNSDI 2023
- Surviving in Dark Forest: Towards Evading the Attacks from Front-Running Bots in Application LayerZuchao Ma, Muhui Jiang, Feng Luo, Xiapu Luo et al.USENIX Security 2025
