Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use
Authors:
- 1 June 2022
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 11-14
Abstract
Tendermint is a deterministic consensus protocol and is one of the most mature implementations of its kind. This implementation is used as the core for building State Machine Replication (SMR) platforms with Byzantine fault-tolerant (BFT) guarantees. A noteworthy deployment of Tendermint has been in continuous operation since 2019 within a blockchain called Cosmos Hub. The Cosmos Hub supports the development of decentralized applications, and stands as one of the largest and most stable ongoing deployments of a BFT SMR platform.While successful in practice, the Tendermint consensus protocol has no definitive description in the literature. It is not clear what makes this protocol unique or how it fits into a blockchain protocol stack. In this short paper, we revisit Tendermint. We contrast Tendermint with other major consensus algorithms, examining its unique design choices. We also focus on the requirements which dictated Tendermint’s design. Lastly, we briefly analyze the accountability support which Tendermint provides.Keywords
This publication has 10 references indexed in Scilit:
- BFT Protocol Forensics2021
- Polygraph: Accountable Byzantine Agreement2021
- HotStuff2019
- Introduction to Reliable and Secure Distributed Programming2011
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- Gossiping to reach consensus2002
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978