Formal Verification of HotStuff - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2021

Formal Verification of HotStuff

Leander Jehl
  • Function : Author
  • PersonId : 1152669

Abstract

HotStuff is a recent algorithm for repeated distributed consensus used in permissioned blockchains. We present a simplified version of the HotStuff algorithm and verify its safety using both Ivy and the TLA Proof Systems tools.We show that HotStuff deviates from the traditional view-instance model used in other consensus algorithms and instead follows a novel tree model to solve this fundamental problem. We argue that the tree model results in more complex verification tasks than the traditional view-instance model. Our verification efforts provide initial evidence towards this claim.
Fichier principal
Vignette du fichier
509782_1_En_13_Chapter.pdf (306.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03740260 , version 1 (29-07-2022)

Licence

Attribution

Identifiers

Cite

Leander Jehl. Formal Verification of HotStuff. 41th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2021, Valletta, Malta. pp.197-204, ⟨10.1007/978-3-030-78089-0_13⟩. ⟨hal-03740260⟩
14 View
1 Download

Altmetric

Share

Gmail Facebook X LinkedIn More