License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2018.16
URN: urn:nbn:de:0030-drops-100764
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/10076/
Amoussou-Guenou, Yackolley ;
Del Pozzo, Antonella ;
Potop-Butucaru, Maria ;
Tucci-Piergiovanni, Sara
Correctness of Tendermint-Core Blockchains
Abstract
Tendermint-core blockchains (e.g. Cosmos) are considered today one of the most viable alternatives for the highly energy consuming proof-of-work blockchains such as Bitcoin and Ethereum. Their particularity is that they aim at offering strong consistency (no forks) in an open system combining two ingredients (i) a set of validators that generate blocks via a variant of Practical Byzantine Fault Tolerant (PBFT) consensus protocol and (ii) a selection strategy that dynamically selects nodes to be validators for the next block via a proof-of-stake mechanism. The exact assumptions on the system model under which Tendermint underlying algorithms are correct and the exact properties Tendermint verifies, however, have never been formally analyzed. The contribution of this paper is as follows. First, while formalizing Tendermint algorithms we precisely characterize the system model and the exact problem solved by Tendermint, then, we prove that in eventual synchronous systems a modified version of Tendermint solves (i) under additional assumptions, a variant of one-shot consensus for the validation of one single block and (ii) a variant of the repeated consensus problem for multiple blocks. These results hold even if the set of validators is hit by Byzantine failures, provided that for each one-shot consensus instance less than one third of the validators is Byzantine.
BibTeX - Entry
@InProceedings{amoussouguenou_et_al:LIPIcs:2018:10076,
author = {Yackolley Amoussou-Guenou and Antonella Del Pozzo and Maria Potop-Butucaru and Sara Tucci-Piergiovanni},
title = {{Correctness of Tendermint-Core Blockchains}},
booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-098-9},
ISSN = {1868-8969},
year = {2018},
volume = {125},
editor = {Jiannong Cao and Faith Ellen and Luis Rodrigues and Bernardo Ferreira},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/10076},
URN = {urn:nbn:de:0030-drops-100764},
doi = {10.4230/LIPIcs.OPODIS.2018.16},
annote = {Keywords: Blockchain, Consensus, Proof-of-Stake, Fairness}
}
|
Keywords: |
|
Blockchain, Consensus, Proof-of-Stake, Fairness |
|
Collection: |
|
22nd International Conference on Principles of Distributed Systems (OPODIS 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
15.01.2019 |
