Fast Tendermint is a consensus protocol variant that aims to cut Tendermint's good-case latency to two communication steps, assuming at least 5f+1 total processes. A new arXiv paper (2610.16442) revisits this design and finds a problem in its round-change rule.
The authors show that the published rule can violate Agreement, meaning honest processes may not settle on the same value. They demonstrate that a single Byzantine process is enough to trigger the violation for every f>=1, and they also analyze the f>=2 case. This challenges the protocol's safety guarantees under its stated assumptions.
To fix the issue, the paper presents two repairs to the round-change rule. The authors do not abandon the two-step latency goal, but the proposed changes are necessary to restore Agreement.