The Fair Ordering Design Space
summary
Defines fair ordering as preventing adversarial manipulation of transaction inclusion and ordering and proposes concrete definitions called receive order fairness and batch order fairness that aim to approximate send time ordering within network latency. Describes the Iqitos/iquitos protocol lineage and permissioned versus permissionless tradeoffs, notes honest supermajority assumptions and open problems: handling mostly rational nodes, composing different fairers across L1/L2, and whether practical protocols can be both efficient and MEV‑minimizing.
AI-written summary · about
chapters (13)
- 0:00whoami
- 0:49Ethereum is Decentralized (or is it)
- 1:48What is fair ordering?
- 3:28Why study fair ordering?
- 4:54MEV Minimization and Democratization are opposing views
- 6:00Defining Fairness
- 6:47What's a good fairness definition?
- 7:20Practical Definitions
- 8:10Permissioned vs Permissionless
- 9:11Careful with L2
- 10:27Interoperability
- 11:41Rational Design
- 13:37Reach Out!
related talks
26mWhat's New in MEV
26mThe MEV Game on L2: Bots, Users, Sequencers Dynamics
01h 03mEthCC 2: Fatemeh Shirazi, Oskar Thorén, & Sebastian Bürgel
29mEthereum Sharing
01h 10mMEVconomic's Panel: Speedrunning Finance Latency in MEV
17mDecentralizing Sequencers Wait it’s all PBS Always have been
24mSemaphore Roadmap for Ethereum
14mThe d/acc Trilemma: Principles for Ethereum Projects and Collaborations