LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs-Reference-Cited by-同舟云学术

LiDO: Linearizable Byzantine Distributed Objects with Refinement-Based Liveness Proofs

Published:2024-06-20 Issue:PLDI Volume:8 Page:1140-1164
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Qiu Longfei¹^ORCID,Kim Yoonseung¹^ORCID,Shin Ji-Yong²^ORCID,Kim Jieung³^ORCID,Honoré Wolf¹^ORCID,Shao Zhong¹^ORCID

Affiliation:

1. Yale University, New Haven, USA

2. Northeastern University, Boston, USA

3. Inha University, Incheon, South Korea

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.

Funder

National Science Foundation

Defense Advanced Research Projects Agency

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3656423

Reference44 articles.

1. Mark Abspoel, Thomas Attema, and Matthieu Rambaud. 2021. Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC’21). Association for Computing Machinery, New York, NY, USA. 195–198. isbn:9781450385480 https://doi.org/10.1145/3465084.3467953 10.1145/3465084.3467953

2. Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics

3. Alysson Bessani, João Sousa, and Eduardo E. P. Alchieri. 2014. State Machine Replication for the Masses with BFT-SMaRt. In Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks (DSN ’14). IEEE Computer Society, Washington, DC, USA. 355–362. https://doi.org/10.1109/DSN.2014.43 10.1109/DSN.2014.43

4. Manuel Bravo, Gregory V. Chockler, and Alexey Gotsman. 2022. Liveness and Latency of Byzantine State-Machine Replication. In 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, Christian Scheideler (Ed.) (LIPIcs, Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 12:1–12:19. https://doi.org/10.4230/LIPIcs.DISC.2022.12 10.4230/LIPIcs.DISC.2022.12