Leaderless Byzantine Fault Tolerant Consensus

by   Jianyu Niu, et al.

Byzantine fault tolerant (BFT) consensus has recently gained much attention because of its intriguing connection with blockchains. Several state-of-the-art BFT consensus protocols have been proposed in the age of blockchains such as Tendermint [5], Pala [9], Streamlet [8], HotStuff [23], and Fast-HotStuff [17]. These protocols are all leader-based (i.e., protocols run in a series of views, and each view has a delegated node called the leader to coordinate all consensus decisions). To make progress, leader-based BFT protocols usually rely on view synchronization, which is an ad-hoc way of rotating the leader and synchronizing nodes to the same view with the leader for enough overlap time. However, many studies and system implementations show that existing methods of view synchronization are complicated and bug-prone [2], [15], [16], [19]. In this paper, we aim to design a leaderless Byzantine fault tolerant (LBFT) protocol, in which nodes simply compete to propose blocks (containing a batch of clients' requests) without the need of explicit coordination through view synchronization. LBFT also enjoys several other desirable features emphasized recently by the research community, such as the chain structure, pipelining techniques, and advanced cryptography [5], [6], [9], [17], [23]. With these efforts, LBFT can achieve both good performance (e.g., O(n)or O(nlog(n)) message complexity) and prominent simplicity.



page 1

page 2

page 3

page 4


Devouring the Leader Bottleneck in BFT Consensus

There is a resurgence of interest in Byzantine fault-tolerant (BFT) syst...

Cob: a consensus layer enabling sustainable sharding-based consensus protocols

In this paper we explore a context of application of Cob, a recently int...

Making Byzantine Consensus Live (Extended Version)

Partially synchronous Byzantine consensus protocols typically structure ...

It's not easy to relax: liveness in chained BFT protocols

Modern chained Byzantine Fault Tolerant (BFT) protocols leverage a combi...

SITAN: Services for Fault-Tolerant Ad Hoc Networks with Unknown Participants

The evolution of mobile devices with various capabilities (e.g., smartph...

Rationals vs Byzantines in Consensus-based Blockchains

In this paper we analyze from the game theory point of view Byzantine Fa...

LinSBFT: Linear-Communication One-Step BFT Protocol for Public Blockchains

This paper presents LinSBFT, a Byzantine Fault Tolerance (BFT) protocol ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.