Optimal Flexible Consensus and its Application to Ethereum
Joachim Neu, Srivatsan Sridhar, Lei Yang, David Tse
Abstract
Classic BFT consensus protocols guarantee safety and liveness for all clients if fewer than one-third of replicas are faulty. However, in applications such as high-value payments, some clients may want to prioritize safety over liveness. Flexible consensus allows each client to opt for higher safety resilience, albeit at the expense of reduced liveness resilience. We present the first construction that allows optimal safety–liveness tradeoff for every client simultaneously. This construction is modular and is realized as an add-on applied on top of an existing consensus protocol. The add-on consists of an additional round of voting and permanent locking done by the replicas, to sidestep a sub-optimal quorum-intersection-based constraint present in previous solutions. We adapt our construction to the existing Ethereum protocol to derive optimal flexible confirmation rules that clients can adopt unilaterally without requiring system-wide changes. This is possible because existing Ethereum protocol features can double as the extra voting and locking. We show an implementation using Ethereum’s consensus API.
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 2619fe29-eacc-4358-a737-bf477b1567ecCited by top-tier papers2
- Scalable Accountable Byzantine Agreement and BeyondPierre Civit, Daniel Collins, Vincent Gramoli, Rachid Guerraoui et al.S&P 2026 · 4 citations
- Asymmetric Grid Quorum Systems for Heterogeneous ProcessesMichael Senn, Christian CachinCCS 2026 · 1 citation
Builds on14
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 259 citations
- Sync HotStuff: Simple and Practical Synchronous State Machine ReplicationIttai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren et al.S&P 2020 · 240 citations
- Bullshark: DAG BFT Protocols Made PracticalAlexander Spiegelman, Neil Giridharan, Alberto Sonnino, Lefteris Kokoris-KogiasCCS 2022 · 132 citations
- Flexible Byzantine Fault ToleranceDahlia Malkhi, Kartik Nayak, Ling RenCCS 2019 · 122 citations
Related papers
- Ebb-and-Flow Protocols: A Resolution of the Availability-Finality DilemmaJoachim Neu, Ertem Nusret Tas, David TseS&P 2021 · 105 citations
- Accountable LivenessAndrew Lewis-Pye, Joachim Neu, Tim Roughgarden, Luca ZanoliniCCS 2025
- Orthrus: Accelerating Multi-BFT Consensus Through Concurrent Partial Ordering of TransactionsHanzheng Lyu, Shaokang Xie, Jianyu Niu, Ivan Beschastnikh et al.ICDE 2025 · 2 citations
- Finding Consensus Bugs in Ethereum via Multi-transaction Differential FuzzingYoungseok Yang, Taesoo Kim, Byung-Gon ChunOSDI 2021 · 57 citations
- GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness DichotomyBernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen et al.CCS 2022 · 25 citations
