Pith. sign in

REVIEW 12 cited by

The latest gossip on BFT consensus

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.04938 v3 pith:Y5CNAR6E submitted 2018-07-13 cs.DC

Ethan Buchman , Jae Kwon , Zarko Milosevic This is my paper · ORCID
classification cs.DC
keywords consensusgossipproblemprotocoltendermintacademicadversarialalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 12 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Permissioned to Proof-of-Stake Consensus

    cs.CR 2025-06 conditional novelty 8.0 of 10

    A generic compiler transforms any permissioned consensus protocol into a proof-of-stake permissionless protocol with the same fault tolerance, plus accountability.

  2. Multimmit: Extending Blocks for Faster Finality

    cs.DC 2026-07 conditional novelty 7.0 of 10

    Multimmit finalises transaction blocks in one voting round with roughly 3δ average latency from dissemination, confining a faulty producer's damage to its own chain.

  3. The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus

    cs.DC 2026-03 unverdicted novelty 7.0 of 10

    Two-round-finality leader-based consensus cannot beat ~2.5 data expansion; three-round Carnot protocols reach near-1 under favorable conditions and 1.33–1.5 under attack.

  4. Symmetry all the way down

    cs.DC 2026-07 accept novelty 6.5 of 10

    Asymmetric Byzantine quorum systems add no extra solvability for depth-two-or-higher tasks; a depth-2 compiler produces an equivalent symmetric system, and no depth-1 compiler exists.

  5. Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus

    cs.DC 2026-07 conditional novelty 6.0 of 10

    Recorded network geography lets Duet rotate proposers in latency order and broadcast blocks over latency-aware trees with a gossip fallback driven by consensus votes, yielding up to 7.26× peak throughput over gossip o...

  6. Censorship Resistance and Throughput with Multiple Concurrent Proposers

    cs.GT 2026-07 conditional novelty 6.0 of 10

    Under a bribery model, multiple concurrent proposers raise the cost of censoring a transaction roughly linearly with the number of proposers, and a fee rule that penalizes duplicated inclusion dominates on both censor...

  7. BlueBottle: Fast and Robust Blockchains through Subsystem Specialization

    cs.DC 2025-11 reject novelty 6.0 of 10

    A two-layer consensus architecture uses a faster n=5f+1 DAG core plus a synchronous guard layer to reach sub-second finality with accountable recovery.

  8. Recipe: Hardware-Accelerated Replication Protocols

    cs.CR 2025-02 conditional novelty 6.0 of 10

    Recipe transforms crash-fault-tolerant protocols into Byzantine-fault-tolerant ones using TEEs, with 2f+1 replicas and measured speedups up to 24x over PBFT.

  9. TNIC: A Trusted NIC Architecture

    cs.CR 2025-02 conditional novelty 6.0 of 10

    TNIC is a SmartNIC-based trusted NIC architecture that implements non-equivocation and transferable authentication in hardware, so crash-fault-tolerant protocols can be transformed for Byzantine settings with 2f+1 replicas.

  10. Fast and Interactive Byzantine Fault-tolerant Web Services via Session-Based Consensus Decoupling

    cs.DC 2025-07 reject novelty 4.0 of 10

    A two-layer BFT web service that buffers session operations for instant feedback and commits them later to full consensus is demonstrated in a supply chain prototype; the claimed security guarantee for the fast layer ...

  11. BLOCKS: Blockchain-supported Cross-Silo Knowledge Sharing for Efficient LLM Services

    cs.DC 2025-06 conditional novelty 4.0 of 10

    BLOCKS combines a Cosmos-based blockchain, a reputation mechanism, and a priority cache to let LLMs retrieve prompts from untrusted knowledge silos.

  12. Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice

    cs.CR 2025-07 conditional novelty 2.0 of 10

    A descriptive, implementation-level workflow analysis of the existing Bullshark-on-Narwhal consensus protocol, based on the Sui codebase, with no new experiments or derivations.

Pith tools