When Priority Fails: Revert-Based MEV on Fast-Finality Rollups

• URL: http://arxiv.org/abs/2506.01462v4
• Date: Mon, 22 Sep 2025 08:22:47 GMT
• Title: When Priority Fails: Revert-Based MEV on Fast-Finality Rollups
• Authors: Krzysztof Gogol, Manvir Schneider, Claudio Tessone,
• Abstract summary: We study the economics of transaction reverts on rollups and show that they are not accidental failures but equilibrium outcomes of MEV strategies.<n>We find that over 80% of reverted transactions are swaps, with half targeting USDC-WETH pools on Uniswap v3, v4.<n>Our findings establish reverts as a structural feature of rollup MEV microstructure and highlight the need for protocol-level reforms to sequencing, fee markets, and revert protection.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the economics of transaction reverts on Ethereum rollups and show that they are not accidental failures but equilibrium outcomes of MEV strategies. Using execution traces from major L2s, we find that over 80% of reverted transactions are swaps, with half targeting USDC-WETH pools on Uniswap v3, v4. Clustering reveals distinct bot archetypes, including split-trade arbitrageurs, atomic duplicators, and end-of-block spammers, demonstrating that reverts follow systematic patterns rather than random noise. Empirically, we show that priority fee auctions on rollups do not allocate blockspace efficiently: transaction placement is mis-ordered, round-number bidding dominates, and duplication spam inflates base fees. As a result, reverted transactions contribute disproportionately more to sequencer fee revenues than to gas consumption, shifting welfare from users to sequencers. To explain these dynamics, we develop a model proving that trade-splitting and duplication strictly dominate one-shot execution under convex adversarial loss. Our findings establish reverts as a structural feature of rollup MEV microstructure and highlight the need for protocol-level reforms to sequencing, fee markets, and revert protection.

Related papers

• How to Serve Your Sandwich? MEV Attacks in Private L2 Mempools [0.0]
  We study the feasibility, profitability, and prevalence of sandwich attacks on rollups with private mempools.<n>Our results suggest that sandwiching, while endemic and profitable on L1, is rare, unprofitable, and largely absent in rollups with private mempools.
  arXiv  Detail & Related papers  (2026-01-27T13:00:33Z)
• A Formal Approach to AMM Fee Mechanisms with Lean 4 [0.29858597335303283]
  Automated Market Makers (AMMs) are a central component of DeFi.<n> trading fees substantially complicate the economic properties of AMMs.<n>We show that several key properties of the swap rate function, including output-boundedness and monotonicity, are preserved.
  arXiv  Detail & Related papers  (2026-01-24T20:47:42Z)
• Outcome-Grounded Advantage Reshaping for Fine-Grained Credit Assignment in Mathematical Reasoning [60.00161035836637]
  Group Relative Policy Optimization has emerged as a promising critic-free reinforcement learning paradigm for reasoning tasks.<n>We introduce Outcome-grounded Advantage Reshaping (OAR), a fine-grained credit assignment mechanism that redistributes advantages based on how much each token influences the model's final answer.<n>OAR-G achieves comparable gains with negligible computational overhead, both significantly outperforming a strong GRPO baseline.
  arXiv  Detail & Related papers  (2026-01-12T10:48:02Z)
• Metacognitive Self-Correction for Multi-Agent System via Prototype-Guided Next-Execution Reconstruction [58.51530390018909]
  Large Language Model based multi-agent systems excel at collaborative problem solving but remain brittle to cascading errors.<n>We present MASC, a metacognitive framework that endows MAS with real-time, unsupervised, step-level error detection and self-correction.
  arXiv  Detail & Related papers  (2025-10-16T05:35:37Z)
• On-Chain Decentralized Learning and Cost-Effective Inference for DeFi Attack Mitigation [4.37137147573556]
  Billions of dollars are lost every year in DeFi platforms by transactions exploiting business logic or accounting vulnerabilities.<n>We present the first decentralized, fully on-chain learning framework that: (i) performs gas-prohibitive computation on Layer-2 to reduce cost, (ii) propagates verified model updates to Layer-1, and (iii) enables gas-bounded low-latency inference inside smart contracts.
  arXiv  Detail & Related papers  (2025-10-15T18:58:34Z)
• Demystifying Private Transactions and Their Impact in PoW and PoS Ethereum [43.548299433042835]
  Private transactions, a specialized transaction type employed to evade public Peer-to-Peer (P2P) network broadcasting, remain largely unexplored.<n>We analyze large-scale datasets comprising 14,810,392 private transactions within a 15.5-month Proof-of-Work (PoW) dataset and 30,062,232 private transactions within a 15.5-month Proof-of-Stake (PoS) dataset.
  arXiv  Detail & Related papers  (2025-03-30T16:45:18Z)
• The Early Days of the Ethereum Blob Fee Market and Lessons Learnt [4.181969992118843]
  EIP-4844 introduced blob transactions designed to meet the data availability needs of layer 2 protocols.<n>This work constitutes the first rigorous and comprehensive empirical analysis of transaction- and mempool-level data since March 13, 2024.
  arXiv  Detail & Related papers  (2025-02-18T15:47:49Z)
• Pandora's Box: Cross-Chain Arbitrages in the Realm of Blockchain Interoperability [6.6477743808876895]
  We study two non-atomic cross-chain arbitrage strategies: Sequence-Independent Arbitrage (SIA) and Sequence-Dependent Arbitrage (SDA)<n>We analyze the effectiveness of these strategies across nine blockchains over a one-year period from September 2023 to August 2024.<n>These arbitrages generated a lower-bound profit of 9,496,115.28 USD from a total traded volume of 465,797,487.98 USD.
  arXiv  Detail & Related papers  (2025-01-28T23:04:50Z)
• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency.<n>Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• RediSwap: MEV Redistribution Mechanism for CFMMs [6.475701705193783]
  We introduce RediSwap, a novel AMM designed to capture Maximal Extractable Value (MEV) at the application level and refund it fairly among users and liquidity providers. At its core, RediSwap features an MEV-redistribution mechanism that manages arbitrage opportunities within the AMM pool. We prove that our mechanism is incentive-compatible and Sybil-proof, and demonstrate that it is easy for arbitrageurs to participate.
  arXiv  Detail & Related papers  (2024-10-24T05:11:41Z)
• Short Paper: Atomic Execution is Not Enough for Arbitrage Profit Extraction in Shared Sequencers [10.73653653756456]
  We develop a model to assess arbitrage profits under atomic execution across two Constant Product Market Marker liquidity pools.<n>We also discuss some scenarios where atomicity may lead to losses, offering insights into why atomic execution may not be enough to convince arbitrageurs and rollups to adopt shared sequencing.
  arXiv  Detail & Related papers  (2024-10-15T12:43:28Z)
• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• Advancing Generalized Transfer Attack with Initialization Derived Bilevel Optimization and Dynamic Sequence Truncation [49.480978190805125]
  Transfer attacks generate significant interest for black-box applications. Existing works essentially directly optimize the single-level objective w.r.t. surrogate model. We propose a bilevel optimization paradigm, which explicitly reforms the nested relationship between the Upper-Level (UL) pseudo-victim attacker and the Lower-Level (LL) surrogate attacker.
  arXiv  Detail & Related papers  (2024-06-04T07:45:27Z)
• The Writing is on the Wall: Analyzing the Boom of Inscriptions and its Impact on EVM-compatible Blockchains [8.744676168760394]
  On certain days, inscriptions accounted for nearly 90% of transactions on Arbitrum and ZKsync Era.<n>ZKsync Era, a ZK-rollup, showed a greater fee reduction than the optimistic rollups studied.
  arXiv  Detail & Related papers  (2024-05-24T07:21:53Z)
• Rolling in the Shadows: Analyzing the Extraction of MEV Across Layer-2 Rollups [13.27494645366702]
  Decentralized finance embraces a series of exploitative economic practices known as Maximal Extractable Value (MEV) In this paper, we investigate the prevalence and impact of MEV on prominent rollups such as Arbitrum, and zkSync over a nearly three-year period. While our findings did not detect any sandwiching activity on popular rollups, we did identify the potential for cross-layer sandwich attacks.
  arXiv  Detail & Related papers  (2024-04-30T18:34:32Z)
• Towards a Theory of Maximal Extractable Value II: Uncertainty [4.07926531936425]
  Maximal Extractable Value (MEV) is value extractable by temporary monopoly power commonly found in decentralized systems. This extraction stems from a lack of user privacy upon transaction submission and the ability of a monopolist validator to reorder, add, and/or censor transactions. We show that neither fair ordering techniques nor economic mechanisms can individually mitigate MEV for arbitrary payoff functions.
  arXiv  Detail & Related papers  (2023-09-25T15:01:11Z)
• Don't Let MEV Slip: The Costs of Swapping on the Uniswap Protocol [0.17999333451993949]
  We present the first empirical characterization of the costs of trading on a decentralized exchange (DEX) Using quoted prices from the Uniswap Labs interface, we evaluate the efficiency of trading on DEXs. Our results provide preliminary evidence that DEXs offer a compelling trust-less alternative to centralized exchanges for trading digital assets.
  arXiv  Detail & Related papers  (2023-09-24T14:22:15Z)
• Distributional Reinforcement Learning with Dual Expectile-Quantile Regression [51.87411935256015]
  quantile regression approach to distributional RL provides flexible and effective way of learning arbitrary return distributions.<n>We show that distributional estimation guarantees vanish, and we empirically observe that the estimated distribution rapidly collapses to its mean.<n>Motivated by the efficiency of $L$-based learning, we propose to jointly learn expectiles and quantiles of the return distribution in a way that allows efficient learning.
  arXiv  Detail & Related papers  (2023-05-26T12:30:05Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• Uniswap Liquidity Provision: An Online Learning Approach [49.145538162253594]
  Decentralized Exchanges (DEXs) are new types of marketplaces leveraging technology. One such DEX, Uniswap v3, allows liquidity providers to allocate funds more efficiently by specifying an active price interval for their funds. This introduces the problem of finding an optimal strategy for choosing price intervals. We formalize this problem as an online learning problem with non-stochastic rewards.
  arXiv  Detail & Related papers  (2023-02-01T17:21:40Z)
• TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
  This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions. A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts. For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
  arXiv  Detail & Related papers  (2022-12-22T10:22:31Z)
• Benefits of Permutation-Equivariance in Auction Mechanisms [90.42990121652956]
  An auction mechanism that maximizes the auctioneer's revenue while minimizes bidders' ex-post regret is an important yet intricate problem in economics. Remarkable progress has been achieved through learning the optimal auction mechanism by neural networks.
  arXiv  Detail & Related papers  (2022-10-11T16:13:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.