The latest gossip on BFT consensus
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Jul 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025PlanetServe: A Decentralized, Scalable, and Privacy-Preserving Overlay for Democratizing Large Language Model Servingcited by 1
- 2025PBFT-Backed Semantic Voting for Multi-Agent Memory Pruningcited by 1
- 2026Attacks and Mitigations for Distributed Governance of Agentic AI under Byzantine Adversariescited by 1
- 2025Proof-of-Data: A Consensus Protocol for Collaborative Intelligencecited by 0
- 2026Attacks and Mitigations for Distributed Governance of Agentic AI under Byzantine Adversaries12 May 2026
- 2025PBFT-Backed Semantic Voting for Multi-Agent Memory Pruning19 Jun 2025
- 2025PlanetServe: A Decentralized, Scalable, and Privacy-Preserving Overlay for Democratizing Large Language Model Serving27 Apr 2025
- 2025Proof-of-Data: A Consensus Protocol for Collaborative Intelligence6 Jan 2025