Formal Verification of HotStuff

Jehl, Leander

doi:10.1007/978-3-030-78089-0_13

Cited by 7 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, Leander [21] has described work modeling and proving correctness for one specific, simplified variant of HotStuff. Hashes are not explicitly modeled, but the way the relationship between blocks is modeled amounts to an assumption that hashing is injective.…”

Section: Hotstuff /Librabftmentioning

confidence: 99%

“…Specifically, their model can be instantiated with different implementation components, and they prove that any implementation that provides components satisfying certain requirements is correct. In contrast, each of the LibraBFTrelated efforts mentioned above [19,21,24] proves properties about one particular model of HotStuff/LibraBFT.…”

Section: Other Bft Consensus Protocolsmentioning

confidence: 99%

See 1 more Smart Citation

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version

Carr¹,

Moir²,

Miraldo³

et al. 2022

Preprint

View full text Add to dashboard Cite

LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property and an extended condition that enables non-participating parties to verify committed results. (Liveness properties would be proved for specific implementations, not for the abstract model presented in this paper.) A key contribution is precisely defining assumptions about the behavior of honest peers, in an abstract way, independent of any particular implementation. Therefore, our work is an important step towards proving correctness of an entire class of concrete implementations, without repeating the hard work of proving correctness of the underlying protocol. The abstract proofs are for a single configuration (epoch); extending these proofs across configuration changes is future work. Our models and proofs are expressed in Agda, and are available in open source.⋆ This is an extended version of a conference paper with the same title in the proceedings of the 14th NASA Formal Methods Symposium (NFM 2022). It contains additional details and proof overviews.

show abstract

Section: Hotstuff /Librabftmentioning

confidence: 99%

Section: Other Bft Consensus Protocolsmentioning

confidence: 99%

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version

Carr¹,

Moir²,

Miraldo³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Using our framework we have implemented several variants of HotStuff [15,16,27]. Our implementation provides fixed, roundrobin, and reputation-based leader selection policies.…”

Section: Introductionmentioning

confidence: 99%

An Extensible Framework for Implementing and Validating Byzantine Fault-Tolerant Protocols

Gogada,

Meling,

Jehl

et al. 2023

Proceedings of the 5th Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating Algorit

Self Cite

View full text Add to dashboard Cite

HotStuff is a Byzantine fault-tolerant state machine replication protocol that incurs linear communication costs to achieve consensus. This linear scalability promoted the protocol to be adopted as the consensus mechanism in permissioned blockchains. This paper discusses the architecture, testing, and evaluation of our extensible framework to implement HotStuff and its variants. The framework already contains three HotStuff variants and other interchangeable components for cryptographic operations and leader selection.Inspired by the Twins approach, we also provide a testing framework for validating protocol implementations by inducing Byzantine behaviors. Test generation is protocol-agnostic; new protocols can execute the test suite with little-to-no modifications. We report relevant insights on how we benefited from Twins for validation and test-driven development. Leveraging our deployment tool, we evaluated our implementation in various configurations.

show abstract

Towards Formal Verification of HotStuff-Based Byzantine Fault Tolerant Consensus in Agda

Carr

Jenkins

Moir³

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Formal Verification of HotStuff

Cited by 7 publications

References 17 publications

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version

An Extensible Framework for Implementing and Validating Byzantine Fault-Tolerant Protocols

Towards Formal Verification of HotStuff-Based Byzantine Fault Tolerant Consensus in Agda

Contact Info

Product

Resources

About