arXiv (All)
open access
Revisiting Fast Tendermint: An Agreement Violation and Two Repairs
Fast Tendermint reduces Tendermint's good-case latency to two communication steps for n>=5f+1. We show that its published round-change rule violates Agreement: one Byzantine process suffices for every f>=1, and for f>=2 two Byzantine processes suffice without double signing. The failure occurs when
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Revisiting Fast Tendermint: An Agreement Violation and Two Repairs#1318986
- Stage-Replay Divergence Follows the KV Cache: Fixed-Prefix Precision Controls and Bidirectional Cache Transplantation#414096
- Changes in Shareholders' Meetings and Legal Problems Thereof#23784
- Signing the Transaction but Not the Decision: Whisper Attacks and a Binding Defense for AP2#673399
- Duty Issues in the Ever-Changing World of Payments Processing: Is It Time for New Rules?#493800
Record · ID 1328032
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive