LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs
Longfei Qiu, Yoonseung Kim, Ji-Yong Shin, Jieung Kim, Wolf Honoré, Zhong Shao
Abstract
Byzantine fault-tolerant state machine replication (SMR) protocols, such as PBFT, HotStuff, and Jolteon, are essential for modern blockchain technologies. However, they are challenging to implement correctly because they have to deal with any unexpected message from Byzantine peers and ensure safety and liveness at all times. Many formal frameworks have been developed to verify the safety of SMR implementations, but there is still a gap in the verification of their liveness. Existing liveness proofs are either limited to the network level or do not cover popular partially synchronous protocols.
We introduce LiDO, a consensus model that enables the verification of both safety and liveness of implementations through refinement. We observe that current consensus models cannot handle liveness because they do not include a pacemaker state. We show that by adding a pacemaker state to the LiDO model, we can express the liveness properties of SMR protocols as a few safety properties that can be easily verified by refinement proofs. Based on our LiDO model, we provide mechanized safety and liveness proofs for both unpipelined and pipelined Jolteon in Coq. This is the first mechanized liveness proof for a byzantine consensus protocol with non-trivial optimizations such as pipelining.
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 f3424ec0-2cd1-4989-835b-6d90748469f6Cited by top-tier papers3
- Compositional Verification of Composite Byzantine ProtocolsQiyuan Zhao, George Pîrlea, Karolina Grzeszkiewicz, Seth Gilbert et al.CCS 2024 · 3 citations
- LiDO-DAG: A Framework for Verifying Safety and Liveness of DAG-Based Consensus ProtocolsLongfei Qiu, Jingqi Xiao, Ji-Yong Shin, Zhong ShaoPLDI 2025 · 3 citations
- SureDistrib: Verifying Almost-Sure Termination of Composite Asynchronous Byzantine ProtocolsLongfei Qiu, Jingqi Xiao, Ji-Yong Shin, Zhong ShaoPLDI 2026 · 1 citation
Builds on5
- Order-Fairness for Byzantine ConsensusMahimna Kelkar, Fan Zhang, Steven Goldfeder, Ari JuelsCRYPTO 2020 · 152 citations
- Grove: a Separation-Logic Library for Verifying Distributed SystemsUpamanyu Sharma, Ralf Jung, Joseph Tassarotti, M. Frans Kaashoek et al.SOSP 2023 · 18 citations
- Much ADO about failures: a fault-aware model for compositional verification of strongly consistent distributed systemsWolf Honoré, Jieung Kim, Ji-Yong Shin, Zhong ShaoOOPSLA 2021 · 12 citations
- Adore: atomic distributed objects with certified reconfigurationWolf Honoré, Ji-Yong Shin, Jieung Kim, Zhong ShaoPLDI 2022 · 9 citations
- AdoB: Bridging Benign and Byzantine Consensus with Atomic Distributed ObjectsWolf Honoré, Longfei Qiu, Yoonseung Kim, Ji-Yong Shin et al.OOPSLA 2024 · 5 citations
Related papers
- Byzantine Ordered Consensus without Byzantine OligarchyYunhao Zhang, Srinath T. V. Setty, Qi Chen, Lidong Zhou et al.OSDI 2020 · 131 citations
- Recover from Excessive Faults in Partially-Synchronous BFT SMRTiantian Gong, Gustavo Franco Camilo, Kartik Nayak, Andrew Lewis-Pye et al.USENIX Security 2025
- Verifying Almost-Sure Termination for Randomized Distributed AlgorithmsConstantin Enea, Rupak Majumdar, Harshit Jitendra Motwani, V. R. SathiyanarayanaPOPL 2026 · 1 citation
- Multi-Threshold Byzantine Fault ToleranceAtsuki Momose, Ling RenCCS 2021 · 1 citation
- Mostly Automated Verification of Liveness Properties for Distributed Protocols with Ranking FunctionsJianan Yao, Runzhou Tao, Ronghui Gu, Jason NiehPOPL 2024 · 12 citations
