Formally Documenting Tenderbake - Archive ouverte HAL Access content directly
Journal Articles Open Access Series in Informatics Year : 2021

Formally Documenting Tenderbake


In this paper, we propose a formal documentation of Tenderbake, the new Tezos consensus algorithm, slated to replace the current Emmy family algorithms. The algorithm is broken down to its essentials and represented as an automaton. The automaton models the various aspects of the algorithm: (i) the individual participant, referred to as a baker, (ii) how bakers communicate over the network (the mempool) and (iii) the overall network the bakers operate in. We also present a TLA+ implementation, which has proven to be useful for reasoning about this automaton and refining our documentation. The main goal of this work is to serve as a formal foundation for extracting intricate test scenarios and verifying invariants that Tenderbake's implementation should satisfy.
Fichier principal
Vignette du fichier
main.pdf (623.46 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03398884 , version 1 (23-10-2021)



Sylvain Conchon, Alexandrina Korneva, Çagdas Bozman, Mohamed Iguernlala, Alain Mebsout. Formally Documenting Tenderbake. Open Access Series in Informatics, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩. ⟨hal-03398884⟩
186 View
127 Download



Gmail Facebook Twitter LinkedIn More