TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus

[2405.02615] TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Cryptography and Security arXiv:2405.02615 (cs) [Submitted on 4 May 2024 ( v1 ), last revised 10 Apr 2026 (this version, v2)] Title: TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus Authors: Qianyu Yu , Giuliano Losa , Xuechao Wang View a PDF of the paper titled TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus, by Qianyu Yu and 1 other authors View PDF HTML (experimental) Abstract: This paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol for solving consensus in partial synchrony, eliminating the need for public key cryptography and ensuring resilience against computationally unbounded adversaries. TetraBFT has several compelling features: it necessitates only constant local storage, has optimal communication complexity, satisfies optimistic responsiveness -- allowing the protocol to operate at actual network speeds under ideal conditions -- and can achieve consensus in just 5 message delays, which outperforms all known unauthenticated protocols achieving the other properties listed. We validate the correctness of TetraBFT through rigorous security analysis and formal verification. Furthermore, we extend TetraBFT into a multi-shot, chained consensus protocol, making a pioneering effort in applying pipelining techniques to unauthenticated protocols. This positions TetraBFT as a practical and deployable solution for blockchain systems aiming for high efficiency. Comments: The full version of the PODC 2024 paper. Updated TLA+ specs Subjects: Cryptography and Security (cs.CR) Cite as: arXiv:2405.02615 [cs.CR] (or arXiv:2405.02615v2 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2405.02615 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Giuliano Losa [ view email ] [v1] Sat, 4 May 2024 08:54:42 UTC (1,151 KB) [v2] Fri, 10 Apr 2026 18:00:15 UTC (1,231 KB) Full-text links: Access Paper: View a PDF of the paper titled TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus, by Qianyu Yu and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.CR < prev | next > new | recent | 2024-05 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Distance-Preserving Digests: A Primitive for BFT Consensus#196419
• Byzantine Reliable Broadcast with Causal Ordering#1123469
• Byzantine Reliable Broadcast with Causal Ordering#919329
• Breaking Fault Lines: Unifying TEE-Assisted BFT Consensus in Partially Trusted Worlds#996567
• Reputation-Based Byzantine-Resilient Vector Consensus without Prespecified Fault Bounds#1014698