# The latest gossip on BFT consensus

arXiv: https://arxiv.org/abs/1807.04938 · HTML: https://mlsanity.com/paper/1807.04938/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Jul 2018.

## Built on by (most cited first, 5 of 5)

- [From Logic Monopoly to Social Contract: Separation of Power and the Institutional Foundations for Autonomous Agent Economies](https://mlsanity.com/paper/2603.25100/) (2026)
- [Attacks and Mitigations for Distributed Governance of Agentic AI under Byzantine Adversaries](https://mlsanity.com/paper/2605.12364/) (2026)
- [PlanetServe: A Decentralized, Scalable, and Privacy-Preserving Overlay for Democratizing Large Language Model Serving](https://mlsanity.com/paper/2504.20101/) (2025)
- [PBFT-Backed Semantic Voting for Multi-Agent Memory Pruning](https://mlsanity.com/paper/2506.17338/) (2025)
- [Proof-of-Data: A Consensus Protocol for Collaborative Intelligence](https://mlsanity.com/paper/2501.02971/) (2025)

## 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.