Metraipolis › archive › dc_fef55dc0c1bf

Fast Tendermint: Speeding Up a Foundational Consensus Protocol — arXiv:2608.13434

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.13434
License (as archived): CC0-1.0
Archived: 2026-10-19T04:24:48.331Z
SHA-256 of the archived text: 702180bdd0ed08531c2c225ea52e6a1e614f2058822bcd908cbdf9174a3b9b21
Stable URL of this page: https://metraipolis.com/documento/dc_fef55dc0c1bf

How to cite

Fast Tendermint: Speeding Up a Foundational Consensus Protocol — arXiv:2608.13434 — arXiv (en), https://arxiv.org/abs/2608.13434 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fef55dc0c1bf (Metraipolis archive dc_fef55dc0c1bf, sha256 702180bdd0ed08531c2c225ea52e6a1e614f2058822bcd908cbdf9174a3b9b21)

BibTeX

@misc{dcfef55dc0c1bf,
  title = {Fast Tendermint: Speeding Up a Foundational Consensus Protocol — arXiv:2608.13434},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13434},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fef55dc0c1bf; sha256 702180bdd0ed08531c2c225ea52e6a1e614f2058822bcd908cbdf9174a3b9b21},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13434. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-14 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2608.13434 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:17:59.929Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).