pith. sign in

arxiv: 2606.00720 · v1 · pith:VFU2QRWBnew · submitted 2026-05-30 · 💻 cs.CE

To Wait or To Probe: Arbitrage Competition on High-Throughput Blockchains

classification 💻 cs.CE
keywords probabilisticsearchbotsspamarbitragebaseopportunityarchitectures
0
0 comments X
read the original abstract

Maximal Extractable Value (MEV) on high-throughput blockchains can be captured through targeted search, where bots identify opportunities off-chain and submit route-committed transactions, or through probabilistic search, where bots submit repeated attempts that resolve opportunity discovery during on-chain execution. This distinction has direct implications for spam, blockspace consumption, and protocol fee revenue. We model how ordering granularity, fee floors, and opportunity-access shocks shape competition between these architectures. Using cyclic arbitrage data on Base from June 2025 to February 2026, we develop a trace-level classifier for search architectures and show that the resulting labels correspond to distinct execution behavior. We test the model across three episodes: Flashblocks selects against broad on-chain probabilistic scanners; token-launch opportunity shocks temporarily revive probabilistic search; and higher fee floors select against probabilistic bots whose opportunity flow cannot sustain repeated attempts. In our sample, probabilistic search accounts for only 23% of arbitrage activity but produces 95% of spam and consumes 20% of Base gas. After Base's configuration changes, protocol fee revenue shifts toward successful arbitrages and away from spam, probabilistic bots pay higher priority fees, and spam consumes a smaller share of blockspace.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.