USENIX Security2026Top-tier venue
Hydrangea: Optimistic Two-Round Partial Synchrony with Improved Fault Resilience
Nibesh Shrestha, Aniket Kate, Kartik Nayak
Abstract
Consensus protocols in the partially synchronous setting face a fundamental trade-off: achieving optimal Byzantine fault tolerance requires a good-case latency of at least three rounds, while committing in fewer than three rounds generally entails reduced resilience. Even optimistic protocols such as SBFT (DSN'19), FaB (TDSC'06), and Kudzu achieve an optimistic good-case latency of two rounds under favorable conditions, but only at the cost of reduced fault tolerance. In this work, we introduce Hydrangea, a partially synchronous Byzantine fault-tolerant state machine replication protocol that combines low latency with improved fault resilience. Let f denote the maximum number of tolerated Byzantine faults, c the maximum number of tolerated crash faults, and k 0 a tunable parameter. For a system of n = 3f + 2c + k + 1 parties, Hydrangea achieves an optimistic good-case latency of two rounds when the total number of faulty parties (Byzantine or crash) is at most p = c + k ⁄ 2 . In more adversarial settings, with up to f Byzantine faults and c crash faults, it guarantees a good-case latency of three rounds. We further prove a matching lower bound: no protocol can achieve a two-round optimistic commit under this fault model if p > c + k + 2 ⁄ 2 . Our experimental evaluation on geo-distributed deployments demonstrates that Hydrangea consistently achieves substantially lower latency than state-of-the-art protocols in both Byzantine-only and Byzantine–crash fault models, while also delivering modest improvements in throughput.
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 8b9e51fa-10b0-42df-bcc3-828825e9a862Builds on5
- 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
- On the Optimality of Optimistic ResponsivenessNibesh Shrestha, Ittai Abraham, Ling Ren, Kartik NayakCCS 2020 · 47 citations
- Mysticeti: Reaching the Latency Limits with Uncertified DAGsKushal Babel, Andrey Chursin, George Danezis, Anastasios Kichidis et al.NDSS 2025
- Optimistic, Signature-Free Reliable Broadcast and Its ApplicationsNibesh Shrestha, Qianyu Yu, Aniket Kate, Giuliano Losa et al.CCS 2025
Related papers
- Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual EvaluationChristopher Hodsdon, Zijian Qin, Khiem Ngo, Siddhartha Sen et al.EuroSys 2026
- Multi-Threshold Byzantine Fault ToleranceAtsuki Momose, Ling RenCCS 2021 · 1 citation
- Ambulance: Saving BFT through RacingNeil Giridharan, Shubham Mishra, Lorenzo Alvisi, Natacha Crooks et al.OSDI 2026 · 1 citation
- Consensus in the Known Participation Model with Byzantine Faults and Sleepy ReplicasChenxu Wang, Sisi Duan, Minghui Xu, Feng Li et al.NDSS 2026
- Integrating 2PC with Consensus for Fast ReplicationYan Chen, Xinyi Yu, Shengyun Liu, Ruofan Xiong et al.SIGCOMM 2026
