- The paper modifies Tendermint by removing prevotes and merging locked and valid state, reducing good-case finality from three communication steps to two under the stronger assumption n > 5f.
- The paper proves safety and liveness using quorum-intersection arguments and adaptive timeouts, and provides a formal Quint specification for model checking.
- The paper offers a minimal-diff path to faster blockchain consensus while sacrificing resilience from tolerating nearly one-third to nearly one-fifth Byzantine faults, with implementation and performance evaluation left for future work.
Fast Tendermint is a modification of the Tendermint Byzantine fault-tolerant (BFT) consensus protocol that reduces good-case latency from three communication steps to two, at the cost of a stricter fault-tolerance assumption of n>5f instead of n>3f (2608.13434). The work is motivated by a line of recent protocols showing that two-step consensus is possible when the Byzantine budget drops below n/3, but it differs from that line by adapting an existing, widely deployed protocol rather than designing a new one from scratch. The authors accompany the protocol with safety and liveness proofs and a formal specification in Quint, a surface syntax for TLA+, used for model checking.
Background and motivation
Tendermint, derived from PBFT and the DLS partially synchronous protocol, is notable for rotating the leader every round, which subsumes the complex view-change machinery of classical BFT protocols. Under f<n/3, three communication steps are a tight lower bound for good-case latency (2608.13434). Recent work—FaB Paxos, Minimmit, Alpenglow, BlueBottle, Kudzu, Hydrangea—trades resilience for speed: with f<n/5 (or parameterized budgets below n/3), two communication steps suffice. Algorithms achieving two-step good-case latency even exist at n≥5f−1, but the added structural complexity has limited practical adoption. Fast Tendermint asks whether a battle-tested $3f+1$ protocol can be retrofitted to the $5f+1$ setting, answering affirmatively.
System model
The protocol inherits Tendermint's model: n processes with at most n>3f0 Byzantine, signed messages over a public-key infrastructure, and partial synchrony with bound n>3f1 and Global Stabilization Time (GST). It assumes Tendermint's gossip communication property: any message sent (or received) by a correct process at time n>3f2 reaches all correct processes by n>3f3. The problem is Byzantine consensus with external validity: agreement, application-specific validity via a n>3f4 predicate, and termination.
Protocol design
Fast Tendermint retains Tendermint's structure of heights, rounds, and per-round proposer rotation, but makes two structural changes. First, it collapses prevote and precommit into a single voting step: a round consists only of a n>3f5 followed by n>3f6 messages, so a decision requires one voting step (n>3f7 precommits) instead of two. Second, it merges the n>3f8 and n>3f9 state into a single pair n/30. In Tendermint, n/31 is a safety mechanism (a process rejects non-locked values after precommitting) and n/32 is a liveness mechanism (proposers re-propose the highest known valid value). Fast Tendermint shows that at n/33 a single variable suffices.
The key rules are as follows. A fresh proposal carrying a full value n/34 is accepted only if n/35 holds and the receiver has no conflicting n/36; the receiver then precommits for n/37. A value becomes valid when it accumulates n/38 precommits from the same round (via the observation or re-proposal rules), rather than n/39 prevotes as in Tendermint. A re-proposal carries only f<n/30 and the valid round f<n/31; receivers accept it if the f<n/32 supporting precommits from round f<n/33 were received and f<n/34, overriding a weaker f<n/35. The decision rule requires a proposal plus f<n/36 matching precommits. Notably, round skipping is permitted only through a quorum-any rule requiring f<n/37 precommits (not the f<n/38 threshold of Tendermint), because the observation rule must capture valid values before a process advances—a safety-driven departure from Tendermint's round-skip logic. The proposer of rounds f<n/39 runs a f<n/50 procedure for at least f<n/51 to learn the maximum valid round before proposing.
Correctness
The safety argument rests on a quorum-intersection lemma: any set of f<n/52 and any set of f<n/53 processes share at least f<n/54 processes, hence at least one correct process. The central value-lock lemma states that if f<n/55 processes precommit for f<n/56 in round f<n/57, no correct process ever sets f<n/58 to a different value in any round f<n/59. The inductive proof shows that correct processes entering later rounds observe the n/30 precommits for n/31 (at least n/32 of which they receive) and update n/33 accordingly, leaving at most n/34 processes able to precommit for any conflicting value. Agreement follows directly: two decisions require n/35 precommits for two values in rounds where the value-lock lemma forbids the second. Validity holds because re-proposal and decision rules do not evaluate n/36; the earliest round in which correct processes precommit for a value must have been triggered by the fresh-proposal rule, which does check the predicate. This is a deliberate design choice—n/37 is evaluated exactly once per value's lifecycle.
Liveness is established through a good-round lemma: if the first correct process enters round n/38 after n/39, the proposer is correct, and the timeouts satisfy n≥5f−10 and n≥5f−11, all correct processes decide in round n≥5f−12. The proof relies on the gossip property and the n≥5f−13 procedure guaranteeing that the proposer learns the maximum valid round across correct processes. Termination follows from leader rotation guaranteeing a correct proposer eventually, plus adaptive timeouts ensuring the timing conditions hold even with unknown n≥5f−14. The timing conditions are sufficient rather than necessary conditions, and the termination argument depends on adaptive timeout growth, which the paper asserts but does not formalize in detail.
Relation to prior two-step protocols
Fast Tendermint occupies a specific point in the design space. Kudzu (n≥5f−15) and Hydrangea (n≥5f−16) achieve two-round commits under reduced fault budgets while retaining a failure-optimal slow path; the paper concedes that whether Fast Tendermint can retain such a slow path remains open. The authors state that Alpenglow's claimed tolerance of 20% Byzantine plus 20% crash faults with two-round commit has been refuted by Hydrangea, and that Alpenglow's erasure-coded dissemination layer makes end-to-end finality require three rounds. Minimmit and BlueBottle, like Fast Tendermint, achieve two-round commits at n≥5f−17 without a slow path; BlueBottle does so via a DAG-based architecture, whereas Fast Tendermint preserves Tendermint's leader-based chain. Two-round finality at the tighter n≥5f−18 bound is achievable in principle, but the paper argues the required faulty-leader identification logic and complex view changes make the trade-off unattractive for deployment—a claim asserted rather than empirically demonstrated.
Limitations and open questions
The protocol's central trade-off is explicit: reducing latency from three to two steps costs resilience, dropping the tolerable fraction of Byzantine processes from one-third to one-fifth. Whether a failure-optimal slow path can be added without sacrificing simplicity is left open, as is the possibility of further speed-up along the lines of Minimmit's view progression rule. The correctness results are analytical and model-checked; the paper reports no implementation or experimental performance evaluation, deferring that to future work. The liveness proof's reliance on adaptive timeouts with unstated growth schedules, and the assumption of collision-resistant value identifiers, are additional assumptions a deployment would need to discharge.
Conclusion
Fast Tendermint demonstrates that Tendermint's defining feature—per-round leader rotation that eliminates complex view changes—survives the transition to the n≥5f−19 two-step regime with only two structural modifications: dropping the prevote step and merging $3f+1$0 with $3f+1$1. The result provides a minimal-diff path from a long-deployed protocol to two-communication-step finality, backed by proofs and a Quint/TLA+ specification, though its practical value depends on whether the reduced fault tolerance and the absence of an experimental evaluation are acceptable for target blockchains (2608.13434).