The Blockchain Execution Dilemma: Optimizing Revenue XOR Fair Ordering
Artjom Pugatsov, Can Umut Ileri, J\'er\'emie Decouchant

TL;DR
This paper presents a dynamic optimization framework for transaction sequencing in blockchains, balancing validator revenue and fairness, and demonstrates significant profit increases and congestion relief through a genetic algorithm.
Contribution
It introduces a blockchain-independent model for transaction scheduling and an anytime genetic algorithm to optimize validator revenue and fairness.
Findings
Validator profit increases by approximately 15% using the proposed algorithm.
Congestion relief is accelerated by up to 58%.
Strict fair ordering can reduce validator revenue by 50-60% during high congestion.
Abstract
The successive generations of consensus algorithms have progressively shifted the performance bottleneck of blockchains to the execution layer. While recent works address this by parallelizing transaction execution, they often overlook the critical role of transaction sequencing. Historically, transaction ordering was left to validator discretion, a practice prone to Maximal Extractable Value (MEV) attacks, or rigid fair-ordering protocols that limit validator revenue. In this work, we address the tension between validator revenue and order fairness using a dynamic optimization framework. We introduce a blockchain-independent model for transaction sequencing in a continuous setting where block executions can overlap. Within this framework, we propose an anytime genetic algorithm that utilizes gas prices, object sets, and predicted execution times to optimize schedules. We evaluate our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
