Separation is Good: A Faster Order-Fairness Byzantine Consensus
Ke Mu, Bo Yin, Alia Asheralieva, Xuetao Wei
Abstract
—Order-fairness has been introduced recently as a new property for Byzantine Fault-Tolerant (BFT) consensus protocol to prevent unilaterally deciding the final order of transactions, which allows mitigating the threat of adversarial transaction order manipulation attacks (e.g., front-running) in blockchain networks and decentralized finance (DeFi). However, existing leader-based order-fairness protocols (which do not rely on synchronized clocks) still suffer from poor performance since they strongly couple fair ordering with consensus processes. In this paper, we propose SpeedyFair , a high-performance order-fairness consensus protocol, which is motivated by our insight that the ordering of transactions does not rely on the execution results of transactions in previous proposals (after consensus). SpeedyFair achieves its efficiency through a decoupled design that performs fair ordering individually and consecutively, sepa-rating from consensus. In addition, by decoupling fair ordering from consensus, SpeedyFair enables parallelizing the order/verify mode that was originally executed serially in the consensus process, which further speeds up the performance. We implement a prototype of SpeedyFair on the top of the Hotstuff protocol. Extensive experimental results demonstrate that SpeedyFair significantly outperforms the state-of-the-art order-fairness protocol (i.e., Themis), which achieves a throughput of 1.5 × -2.45 × greater than Themis while reducing latency by 35%-59%.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a40bca4d-6c08-46b2-9170-fb634f4a0738Cited by top-tier papers3
- FairDAG: Consensus Fairness over Multi-Proposer Causal DesignDakai Kang, Junchao Chen, Anh Dinh, Mohammad SadoghiVLDB 2026 · 2 citations
- On Frontrunning Risks in Batch-Order Fair Systems for BlockchainsEunchan Park, Taeung Yoon, Hocheol Nam, Deepak Maram et al.CCS 2025 · 1 citation
- Equal Opportunity: A Correctness Condition for Ordered ConsensusYunhao Zhang, Haobin Ni, Soumya Basu, Shir Cohen et al.OSDI 2026
Builds on13
- OmniLedger: A Secure, Scale-Out, Decentralized Ledger via ShardingEleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly et al.S&P 2018 · 1,145 citations
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- Flash Boys 2.0: Frontrunning in Decentralized Exchanges, Miner Extractable Value, and Consensus InstabilityPhilip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li et al.S&P 2020 · 607 citations
- Quantifying Blockchain Extractable Value: How dark is the forest?Kaihua Qin, Liyi Zhou, Arthur GervaisS&P 2022 · 336 citations
- High-Frequency Trading on Decentralized On-Chain ExchangesLiyi Zhou, Kaihua Qin, Christof Ferreira Torres, Duc Viet Le et al.S&P 2021 · 243 citations
Related papers
- Auncel: Fair Byzantine Consensus Protocol with High PerformanceWuhui Chen, Yikai Feng, Jianting Zhang, Zhongteng Cai et al.INFOCOM 2024 · 3 citations
- DAG of DAGs: Order-Fairness Made PracticalHeena Nagda, Sidharth Sankhe, Sakshi Sinha, Keon Attarha et al.SIGMOD 2026 · 2 citations
- Themis: Fast, Strong Order-Fairness in Byzantine ConsensusMahimna Kelkar, Soubhik Deb, Sishan Long, Ari Juels et al.CCS 2023 · 50 citations
- Rashnu: Data-Dependent Order-FairnessHeena Nagda, Shubhendra Pal Singhal, Mohammad Javad Amiri, Boon Thau LooVLDB 2024 · 9 citations
- Order-Fairness for Byzantine ConsensusMahimna Kelkar, Fan Zhang, Steven Goldfeder, Ari JuelsCRYPTO 2020 · 152 citations
