TL;DR
This paper introduces Tendermint, a BFT consensus protocol that simplifies event ordering in distributed networks using gossip protocols, enhancing blockchain reliability under adversarial conditions.
Contribution
It presents a modernized and simplified BFT consensus protocol leveraging gossip protocols, improving robustness and efficiency in blockchain networks.
Findings
Tendermint achieves reliable Byzantine fault-tolerant consensus.
The protocol simplifies existing BFT algorithms using gossip mechanisms.
It is suitable for blockchain applications with adversarial nodes.
Abstract
The paper presents Tendermint, a new protocol for ordering events in a distributed network under adversarial conditions. More commonly known as Byzantine Fault Tolerant (BFT) consensus or atomic broadcast, the problem has attracted significant attention in recent years due to the widespread success of blockchain-based digital currencies, such as Bitcoin and Ethereum, which successfully solved the problem in a public setting without a central authority. Tendermint modernizes classic academic work on the subject and simplifies the design of the BFT algorithm by relying on a peer-to-peer gossip protocol among nodes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
