The latest gossip on BFT consensus

Ethan Buchman, Jae Kwon, Zarko Milosevic
7/13/2018
cs.DC

Official code: tendermint/tendermint (5,863 stars, Apache-2.0, last commit 2026-10-20).

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.

View on arXivView PDF

Code Implementations(1)

tendermint/tendermintOfficial100%
Apache-2.0

⟁ Tendermint Core (BFT Consensus) in Go

5,8632,102Go, HCLMay 14, 20142 days agoApache-2.0
bftblockchainconsensusconsistencycryptocurrency+4 more

Similar Papers

Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks

81% match1 repo282020

Trustworthy Distributed Average Consensus based on Locally Assessed Trust Evaluations

80% match2023

Decentralized Ranking Aggregation: Gossip Algorithms for Borda and Copeland Consensus

79% match2026

Revisiting Gossip Protocols: A Vision for Emergent Coordination in Agentic Multi-Agent Systems

78% match2025

A Gossip-Enhanced Communication Substrate for Agentic AI: Toward Decentralized Coordination in Large-Scale Multi-Agent Systems

78% match2025

Event-Triggered Gossip for Distributed Learning

78% match2026

Cite this paper

@article{buchman2018latest,
  title  = {The latest gossip on BFT consensus},
  author = {Ethan Buchman and Jae Kwon and Zarko Milosevic},
  year   = {2018},
  eprint = {1807.04938},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1807.04938}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1807.04938.svg)](https://codeofpaper.com/paper/1807.04938)

Discussion