Pith. sign in

REVIEW 3 minor 20 references

Fast TetraBFT: Optimizing Latency Where It Matters

T0 review · 0 major / 3 minor · reviewed 2026-06-28 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Fast TetraBFT achieves optimal 3-message-delay good-case latency for unauthenticated Byzantine consensus by adding a simple fast-path wrapper to TetraBFT.

desk verdict Fast TetraBFT adds a simple wrapper to TetraBFT to hit 3-message good-case latency while keeping its space and comm bounds. read the letter →

arxiv 2606.03754 v1 pith:27VU7I2U submitted 2026-06-02 cs.DC

Antonio J. Fernández-Pinto , Manuel Bravo , Gregory Chockler , Alexey Gotsman This is my paper · ORCID
classification cs.DC
keywords unauthenticatedByzantineconsensusgood-caselatencypartiallysynchronousnetworksfaulttolerancefast-pathwrappermessagedelaysoptimizationTetraBFT
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper establishes that optimal good-case latency of 3 message delays is possible for unauthenticated Byzantine consensus in partially synchronous networks without adopting the complex design of ForgetIT. It reaches this by wrapping the existing TetraBFT protocol with a fast-path mechanism that triggers under favorable conditions. The augmentation keeps the base protocol's bounded space usage and low communication complexity intact. A sympathetic reader cares because the result shows that top-tier latency performance can be obtained through targeted, minimal changes rather than wholesale protocol redesign.

What carries the argument

The fast-path wrapper added to TetraBFT, which enables correct processes to decide after 3 message delays in good cases without altering the base protocol's safety or complexity bounds.

What would settle it

An execution trace in the partial synchrony model where the wrapper produces a safety violation, exceeds 3 message delays in a good case, or increases space or communication beyond the original TetraBFT bounds.

Watch

Extended reading notes

Core claim

Fast TetraBFT augments an existing TetraBFT protocol with a simple fast-path wrapper to lower good-case latency from 5 to 3 message delays while preserving bounded space requirements and low communication complexity in unauthenticated Byzantine consensus under partial synchrony.

Load-bearing premise

The fast-path wrapper integrates with TetraBFT without introducing new failure modes or violating the base protocol's correctness and complexity guarantees under the stated network assumptions.

Editorial extensions

If this is right

  • Unauthenticated Byzantine consensus protocols can reach the information-theoretic latency lower bound of 3 delays.
  • TetraBFT retains its original bounded space and low communication properties after the augmentation.
  • Good-case latency optimization can be performed via wrapper without redesigning the core protocol.
  • Optimal latency remains compatible with the resilience and network assumptions of the unauthenticated setting.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The wrapper technique may transfer to other base consensus protocols to reduce their good-case latency.
  • Simpler optimal-latency designs could reduce the engineering effort needed for deployment in blockchain systems.
  • The separation of fast path from base protocol may simplify formal verification of the combined system.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The manuscript presents Fast TetraBFT, an unauthenticated Byzantine consensus protocol for partially synchronous networks. It augments the existing TetraBFT protocol with a simple fast-path wrapper to reduce good-case latency from 5 to 3 message delays while preserving bounded space requirements and low communication complexity. The work positions this as a simpler alternative to the ForgetIT protocol, which also achieves 3-delay latency but with higher design complexity.

Significance. If the fast-path wrapper integrates correctly without new failure modes, the result offers a meaningful simplification for achieving optimal good-case latency in unauthenticated settings. This is relevant for blockchain applications and post-quantum scenarios that benefit from avoiding message authentication while maintaining resilience and efficiency bounds.

minor comments (3)
  1. The abstract and introduction would benefit from a brief high-level description of the fast-path wrapper mechanism (e.g., which messages are duplicated or how the decision is triggered early) to allow readers to assess the augmentation without immediately consulting the full protocol pseudocode.
  2. Clarify in §3 or the complexity analysis whether the fast-path adds any additional message types or increases the worst-case communication complexity beyond the base TetraBFT bounds, even if only in the good case.
  3. The comparison to ForgetIT in the introduction would be strengthened by citing the specific sections of ForgetIT that introduce the complexity the authors seek to avoid.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the supportive summary, recognition of the significance for blockchain and post-quantum settings, and recommendation of minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity

full rationale

The paper presents a protocol-construction claim: augmenting an existing TetraBFT protocol with a fast-path wrapper to reduce good-case latency from 5 to 3 message delays while preserving bounded space and low communication complexity. No equations, fitted parameters, self-definitional reductions, or load-bearing self-citations appear in the provided abstract or claim structure. The central result is a design augmentation statement with independent content relative to the base protocol, making the derivation self-contained against external benchmarks.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The claim rests on standard domain assumptions of the distributed-computing literature rather than new free parameters or invented entities.

assumptions (2)
  • domain assumption The network is partially synchronous
    Explicitly stated as the setting for the consensus protocols.
  • domain assumption Authenticated point-to-point channels suffice without authenticated messages
    Core premise of unauthenticated Byzantine consensus as described.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Fast TetraBFT: Optimizing Latency Where It Matters." pith.science (2026). https://pith.science/paper/27VU7I2U

@misc{pith2026260603754,
  author       = {Pith},
  title        = {Pith review of: Fast TetraBFT: Optimizing Latency Where It Matters},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/27VU7I2U}},
  note         = {Machine review of arXiv:2606.03754}
}
read the original abstract

Unauthenticated Byzantine consensus protocols achieve optimal failure resilience while relying only on authenticated point-to-point channels, not authenticated messages. They are an attractive building block for blockchains that do not mandate symmetric trust assumptions as well as for future post-quantum settings. We consider unauthenticated Byzantine consensus in partially synchronous networks and focus on optimizing its good-case latency - the worst-case time for correct processes to reach a decision under favorable conditions. A recently proposed ForgetIT protocol achieves an optimal good-case latency of 3 message delays but employs a highly complex design. We show that this complexity is unnecessary. To this end, we present Fast TetraBFT - an unauthenticated Byzantine consensus protocol that achieves optimal good-case latency by augmenting an existing TetraBFT protocol with a simple fast-path wrapper. Our solution lowers the good-case latency of TetraBFT from 5 to 3 message delays while preserving its bounded space requirements and low communication complexity.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 1 canonical work pages

  1. [1]

    https://cosmos.network/

  2. [2]

    Quantum computing & blockchain

    Scott Aaronson, Dan Boneh, Justin Drake, Sreeram Kannan, Yehuda Lindell, and Dahlia Malkhi. Quantum computing & blockchain. Technical report, Coinbase Quantum Advisory Council, April 2026. URL: https://assets.ctfassets.net/sygt3q11s4a9/6EjYavuGdtJDYCqaJrASj9/9f464a8bf26f44bd6c85710fe7e4a29f/Quantum_Computing_and_Blockchain_v10.3_15April2026.pdf

    2026

  3. [3]

    Forget-IT : Optimal good-case latency for information-theoretic BFT

    Ittai Abraham, Sourav Das, Yuval Efron, and Jovan Komatovic. Forget-IT : Optimal good-case latency for information-theoretic BFT . IACR Cryptol. ePrint Arch. , 2026. URL: https://eprint.iacr.org/2026/355

    2026

  4. [4]

    Good-case and bad-case latency of unauthenticated B yzantine broadcast: A complete categorization

    Ittai Abraham, Ling Ren, and Zhuolun Xiang. Good-case and bad-case latency of unauthenticated B yzantine broadcast: A complete categorization. In Conference on Principles of Distributed Systems (OPODIS) , 2021

    2021

  5. [5]

    Information theoretic HotStuff

    Ittai Abraham and Gilad Stern. Information theoretic HotStuff . In Conference on Principles of Distributed Systems (OPODIS) , 2020

    2020

  6. [6]

    Tenderbake - a solution to dynamic repeated consensus for blockchains

    L a cr a mioara A s tef a noaei, Pierre Chambart, Antonella Del Pozzo, Thibault Rieutord, Sara Tucci-Piergiovanni, and Eugen Z a linescu. Tenderbake - a solution to dynamic repeated consensus for blockchains. In Symposium on Foundations and Applications of Blockchain (FAB) , 2021

    2021

  7. [7]

    Security analysis of R ipple consensus

    Ignacio Amores-Sesar, Christian Cachin, and Jovana Mi\' c i\' c . Security analysis of R ipple consensus. In Conference on Principles of Distributed Systems (OPODIS) , 2021

    2021

  8. [8]

    Asynchronous consensus and broadcast protocols

    Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. J. ACM , 32(4):824–840, 1985

    1985

Show all 20 references
  1. [9]

    Making B yzantine consensus live

    Manuel Bravo, Gregory Chockler, and Alexey Gotsman. Making B yzantine consensus live. Distributed Computing , 35(6):503--532, 2022

    2022

  2. [10]

    The latest gossip on BFT consensus

    Ethan Buchman, Jae Kwon, and Zarko Milosevic. The latest gossip on BFT consensus. arXiv , abs/1807.04938, 2018. URL: http://arxiv.org/abs/1807.04938, http://arxiv.org/abs/1807.04938 arXiv:1807.04938

    2018

  3. [11]

    Secure and efficient asynchronous broadcast protocols

    Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and efficient asynchronous broadcast protocols. In International Cryptology Conference (CRYPTO) , 2001

    2001

  4. [12]

    Practical B yzantine Fault Tolerance

    Miguel Castro. Practical B yzantine Fault Tolerance . PhD thesis, Massachusetts Institute of Technology, 2001

    2001

  5. [13]

    Unreliable failure detectors for reliable distributed systems

    Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM , 43(2):225--267, 1996

    1996

  6. [14]

    Lynch, and Larry J

    Cynthia Dwork, Nancy A. Lynch, and Larry J. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM , 35(2):288--323, 1988

    1988

  7. [15]

    Fast isolation of arbitrary forwarding faults

    Amir Herzberg and Shay Kutten. Fast isolation of arbitrary forwarding faults. In Symposium on Principles of Distributed Computing (PODC) , 1989

    1989

  8. [16]

    Fast and secure global payments with S tellar

    Marta Lokhava, Giuliano Losa, David Mazi \` e res, Graydon Hoare, Nicolas Barry, Eli Gafni, Jonathan Jove, Rafal Malinowsky, and Jed McCaleb. Fast and secure global payments with S tellar. In Symposium on Operating Systems Principles (SOSP) , 2019

    2019

  9. [17]

    Stellar consensus by instantiation

    Giuliano Losa, Eli Gafni, and David Mazi \` e res. Stellar consensus by instantiation. In International Symposium on Distributed Computing (DISC) , 2019

    2019

  10. [18]

    Hybrid consensus: Efficient consensus in the permissionless model

    Rafael Pass and Elaine Shi. Hybrid consensus: Efficient consensus in the permissionless model. In Symposium on Distributed Computing (DISC) , 2017

    2017

  11. [19]

    T hunderella: Blockchains with optimistic instant confirmation

    Rafael Pass and Elaine Shi. T hunderella: Blockchains with optimistic instant confirmation. In Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) , 2018

    2018

  12. [20]

    TetraBFT : Reducing latency of unauthenticated, responsive BFT consensus

    Qianyu Yu, Giuliano Losa, and Xuechao Wang. TetraBFT : Reducing latency of unauthenticated, responsive BFT consensus. In Symposium on Principles of Distributed Computing (PODC) , 2024

    2024

Pith tools

Reviewed June 28, 2026 · model on record in the stance chip above.