Formally Documenting Tenderbake
| Autor: | Conchon, Sylvain, Korneva, Alexandrina, Bozman, Çagdas, Iguernlala, Mohamed, Mebsout, Alain |
|---|---|
| Přispěvatelé: | Nomadic Labs, Université Paris-Saclay, Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Functori, ANR-16-CE25-0006,PARDI,Vérification de systèmes distribués paramétrés(2016) |
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Open Access Series in Informatics Open Access Series in Informatics, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩ Open Access Series in Informatics, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩ |
| ISSN: | 2190-6807 |
| DOI: | 10.4230/OASIcs.FMBC.2021.5⟩ |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|