Weimin CHEN (The Hong Kong Polytechnic University (PolyU)), Xiapu Luo (The Hong Kong Polytechnic University)

Decentralized finance (DeFi) is an emerging financial service on blockchain, enabling automatic and anonymous transactions. Within DeFi, decentralized exchanges (DEXs) maintain reserves of a pair of tokens and determine the exchange rate to swap tokens. However, DEXs also create opportunities for Maximal Extractable Value (MEV), where attackers include, exclude, or reorder DEX transactions to exploit price discrepancies of tokens and extract profit. Uncovering MEV opportunities requires high throughput, as the 12-second block interval and the vast search space impose strict time constraints. However, existing tools suffer from low throughput, as they rely on CPU-bound execution, which is hindered by frequent state forking and slow DEX execution. In this paper, we take the first step in leveraging GPU parallel computing power to boost MEV-search throughput in arbitrage and sandwich strategies. More precisely, we compile an MEV bot into a GPU application and then launch thousands of GPU threads to search for profit in parallel. To this end, we design new solutions to address three major challenges: designing cheatcodes to simulate transactions on GPU, proposing a memory manager to reduce GPU memory usage, and designing strategy-aware mutations to improve input diversity. We implement
a prototype named MeVisor that runs DEXs on GPUs and searches for MEV using a parallel genetic algorithm. Evaluated on 3,941 real MEV cases from Ethereum, MeVisor achieves 3.3M-5.1M transactions per second, outperforming the CPU baseline by 100,000x. In a large-scale study of Q1 2025 data, MeVisor estimates MEV opportunities ranging from 2 to 14 transactions, yielding at most $1.1 million in MEV profit.

View More Papers

Convergent Privacy Framework for Multi-layer GNNs through Contractive Message...

Yu Zheng (University of California, Irvine), Chenang Li (University of California, Irvine), Zhou Li (University of California, Irvine), Qingsong Wang (University of California, San Diego)

Read More

How to Effectively Trace Provenance on Windows Endpoint Detection...

Jason Liu (University of Illinois at Urbana-Champaign), Muhammad Adil Inam (University of Illinois at Urbana-Champaign), Akul Goyal (University of Illinois at Urbana-Champaign), Dylen Greenenwald (University of Illinois at Urbana-Champaign), Adam Bates (University of Illinois at Urbana-Champaign), Saurav Chittal (Purdue University)

Read More

LAPSE: Automatic, Formal Fault-Tolerant Correctness Proofs for Native Code

Charles Averill, Ilan Buzzetti (The University of Texas at Dallas), Alex Bellon (UC San Diego), Kevin Hamlen (The University of Texas at Dallas)

Read More