REVIEW 23 cited by
The latest gossip on BFT consensus
Not yet reviewed by Pith; the record is open.
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
Signed reviews
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.
Forward citations
Cited by 23 Pith papers
-
From Permissioned to Proof-of-Stake Consensus
A generic compiler transforms any permissioned consensus protocol into a proof-of-stake permissionless protocol with the same fault tolerance, plus accountability.
-
Multimmit: Extending Blocks for Faster Finality
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.
-
The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus
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.
-
Accountable Liveness
Accountable liveness is achievable in x-partially-synchronous networks if and only if x < 1/2 and the adversary controls fewer than n/2 nodes.
-
Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes
Aleph achieves expected constant-latency atomic broadcast over an asynchronous network using a communication-history DAG and a trustless threshold-signature randomness beacon.
-
Symmetry all the way down
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.
-
Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus
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...
-
Price of Censorship: Censorship Resistance and Throughput under Rational Concurrent Proposers
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...
-
BlueBottle: Fast and Robust Blockchains through Subsystem Specialization
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.
-
Recipe: Hardware-Accelerated Replication Protocols
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.
-
TNIC: A Trusted NIC Architecture
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.
-
Technical Report: Exploring Automatic Model-Checking of the Ethereum specification
Bounded model checking of the 3SF consensus protocol's Accountable Safety property found no counterexamples in small configurations, using new TLA+, SMT, and Alloy encodings.
-
Partially Synchronous BFT Consensus Made Practical in Wireless Networks
ReduceCatch reduces the number of active senders with repeated TDMA broadcasts and then uses CSMA with NACK to recover lost packets, improving latency and throughput of PBFT, Tendermint, and HotStuff in wireless ad ho...
-
A Game-Theoretic Approach to the Study of Blockchain's Robustness
Ethereum PoS is probabilistically live rather than guaranteed live: a timed equivocation attack can delay finality, and the inactivity leak can produce safety violations even with under one-third Byzantine stake.
-
Nakamoto Consensus with Verifiable Delay Puzzle
A proof-of-stake blockchain where each validator is assigned a unique sequential puzzle via a verifiable random function can resist long-range attacks while using less energy than proof-of-work.
-
Fast Tendermint: Speeding Up a Foundational Consensus Protocol
A modified Tendermint protocol that decides in two communication steps under n > 5f, with safety and liveness proofs and a Quint model-checked specification.
-
Setchain Algorithms for Blockchain Scalability
Three Setchain implementations, especially Hashchain, show orders-of-magnitude higher throughput than the underlying CometBFT ledger while adding light-client epoch proofs.
-
Redefining Hybrid Blockchains: A Balanced Architecture
Proposes a semi-centralized hybrid blockchain combining Kafka pub-sub messaging, Kubernetes microservices, and stake-based validator selection; a proof-of-concept on one laptop reported about 1,030 block TPS and 2.2 s...
-
Fast and Interactive Byzantine Fault-tolerant Web Services via Session-Based Consensus Decoupling
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 ...
-
BLOCKS: Blockchain-supported Cross-Silo Knowledge Sharing for Efficient LLM Services
BLOCKS combines a Cosmos-based blockchain, a reputation mechanism, and a priority cache to let LLMs retrieve prompts from untrusted knowledge silos.
-
PBFT-Backed Semantic Voting for Multi-Agent Memory Pruning
The Co-Forgetting Protocol combines DistilBERT-based semantic voting, multi-scale temporal decay, and PBFT-style consensus to synchronize memory pruning in multi-agent systems, with a four-agent simulation reporting 5...
-
Decentralization in PoS Blockchain Consensus: Quantification and Advancement
Square-root and logarithmic stake-weighting functions raise decentralization metrics by about 51% and 132% respectively across ten PoS blockchains, but the claims depend on an unresolved Sybil-cost assumption.
-
Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice
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.
Discussion (0). Continue with ORCID to comment.