ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2102.07932
63
5
v1v2v3 (latest)

Fast Validated Byzantine Broadcast

16 February 2021
Ittai Abraham
Kartik Nayak
Ling Ren
Zhuolun Xiang
ArXiv (abs)PDFHTML
Abstract

Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned blockchain systems. A sequence of research efforts focuses on improving the commit latency of the SMR protocol in the common good case, including PBFT with 333-round latency and n≥3f+1n\geq 3f+1n≥3f+1 and FaB with 222-round latency and n≥5f+1n\geq 5f+1n≥5f+1. In this paper, we abstract a single-shot BFT SMR with a new broadcast formulation named partially synchronous validated Byzantine broadcast (psync-VBB), and propose a 222-round psync-VBB protocol under the optimal resilience n≥5f−1n\geq 5f-1n≥5f−1 with a matching lower bound. Our protocol solves 222-round BFT SMR with only n≥5f−1n\geq 5f-1n≥5f−1 replicas, which refutes the optimal resiliency claim made in FaB for needing n≥5f+1n \geq 5f+1n≥5f+1 for 222-round PBFT-style BFT protocols. For the special case when f=1f=1f=1, our protocol needs only 444 replicas, and strictly improves PBFT by reducing the latency by one round (even when one backup is faulty).

View on arXiv
Comments on this paper