English

VBFT: Veloce Byzantine Fault Tolerant Consensus for Blockchains

Distributed, Parallel, and Cluster Computing 2024-01-30 v5

Abstract

Low latency is one of the most desirable features of partially synchronous Byzantine consensus protocols. Existing low-latency protocols have achieved consensus with just two communication steps by reducing the maximum number of faults the protocol can tolerate (from f=n13f = \frac{n-1}{3} to f=n+15f = \frac{n+1}{5}), \textcolor{black}{by relaxing protocol safety guarantees}, or by using trusted hardware like Trusted Execution Environment. Furthermore, these two-step protocols don't support rotating leaders and low-cost view change (leader replacement), which are important features of many blockchain use cases. In this paper, we propose a protocol called VBFT which achieves consensus in just two communication steps without sacrificing desirable features. In particular, VBFT tolerates f=n13f = \frac{n-1}{3} faults (which is the best possible), guarantees strong safety for honest leaders, and requires no trusted hardware. Moreover, VBFT supports leader rotation and low-cost view change, thereby improving prior art on multiple axes.

Keywords

Cite

@article{arxiv.2310.09663,
  title  = {VBFT: Veloce Byzantine Fault Tolerant Consensus for Blockchains},
  author = {Mohammad M. Jalalzai and Chen Feng and Victoria Lemieux},
  journal= {arXiv preprint arXiv:2310.09663},
  year   = {2024}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2109.14604

R2 v1 2026-06-28T12:50:46.625Z