Revisiting Optimal Resilience of Fast Byzantine Consensus

02/25/2021
by   Petr Kuznetsov, et al.
0

It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes three message delays to decide a value, in contrast with just two in Paxos. This motivates the search for fast Byzantine consensus algorithms that can produce decisions after just two message delays in the common case, e.g., under the assumption that the current leader is correct and not suspected by correct processes. The (optimal) two-step latency comes with the cost of lower resilience: fast Byzantine consensus requires more processes to tolerate the same number of faults. In particular, 5f+1 processes were claimed to be necessary to tolerate f Byzantine failures. In this paper, we present a fast Byzantine consensus algorithm that relies on just 5f-1 processes. Moreover, we show that 5f-1 is the tight lower bound, correcting a mistake in the earlier work. While the difference of just 2 processes may appear insignificant for large values of f, it can be crucial for systems of a smaller scale. In particular, for f=1, our algorithm requires only 4 processes, which is optimal for any (not necessarily fast) partially synchronous Byzantine consensus algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2021

Self-stabilizing Byzantine- and Intrusion-tolerant Consensus

One of the most celebrated problems of fault-tolerant distributed comput...
research
06/25/2019

A Permit-Based Optimistic Byzantine Ledger

PermitBFT solves the byzantine consensus problem for n nodes tolerating ...
research
02/10/2020

The Istanbul BFT Consensus Algorithm

This paper presents Istanbul BFT (IBFT), a Byzantine fault-tolerant (BFT...
research
10/06/2020

Byzantine Geoconsensus

We define and investigate the consensus problem for a set of N processes...
research
11/30/2020

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker

Threshold guards are a basic primitive of many fault-tolerant algorithms...
research
05/29/2019

The Impact of RDMA on Agreement

Remote Direct Memory Access (RDMA) is becoming widely available in data ...
research
05/04/2023

ZLB, a Blockchain Tolerating Colluding Majorities

The problem of Byzantine consensus has been key to designing secure dist...

Please sign up or login with your details

Forgot password? Click here to reset