Fast Tendermint：加速基础共识协议
Fast Tendermint: Speeding Up a Foundational Consensus Protocol
AI总结：
Fast Tendermint是Tendermint在n>5f场景下的适配方案，保留其领导者轮换结构，将预投票与预提交合并为单一步骤，可在两次通信步骤内达成决策，同时完成相关性质证明与形式化规范。
AI中文摘要：
Tendermint是研究和部署最广泛的拜占庭容错（BFT）共识协议之一，部分原因在于其原生的领导者轮换机制，该机制涵盖了复杂的视图变更。与大多数部分同步BFT协议一样，Tendermint可容忍f < n/3个拜占庭进程，并在三次通信步骤内达成决策。受低延迟区块链需求的推动，近期研究表明当f < n/5时，共识可在两次通信步骤内解决。我们提出Fast Tendermint，这是Tendermint在n > 5f场景下的适配方案，在良好情况下可在两次通信步骤内达成决策，同时保留Tendermint的领导者轮换结构。Fast Tendermint将Tendermint的预投票和预提交步骤合并为单一投票步骤，并合并了locked（锁定）和valid（有效）状态。我们给出了一致性、有效性和终止性的证明，以及在Quint（TLA+的现代表层语法，用于协议模型检查）中的形式化规范。
英文摘要：
Tendermint is among the most widely studied and deployed Byzantine fault-tolerant (BFT) consensus protocols, owing in part to its native leader-rotation mechanism that subsumes complex view changes. Like most partially-synchronous BFT protocols, Tendermint tolerates $f < n/3$ Byzantine processes and decides in three communication steps. Motivated by the push for lower-latency blockchains, a recent line of work shows that consensus can be solved in two communication steps when $f < n/5$. We present Fast Tendermint, an adaptation of Tendermint to the $n > 5f$ setting that decides in two communication steps in the good case, while preserving Tendermint's leader-rotation structure. Fast Tendermint collapses Tendermint's prevote and precommit steps into a single voting step and merges the $locked$ and $valid$ state. We give proofs of agreement, validity, and termination, and a formal specification in Quint, a modern surface syntax for TLA+, used to model-check the protocol.
