Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model

01/04/2022
by   Andrew Lewis-Pye, et al.
0

We consider the message complexity of State Machine Replication protocols dealing with Byzantine failures in the partial synchrony model. A result of Dolev and Reischuk gives a quadratic lower bound for the message complexity, but it was unknown whether this lower bound is tight, with the most efficient known protocols giving worst-case message complexity O(n^3). We describe a protocol which meets Dolev and Reischuk's quadratic lower bound, while also satisfying other desirable properties. To specify these properties, suppose that we have n replicas, f of which display Byzantine faults (with n≥ 3f+1). Suppose that Δ is an upper bound on message delay, i.e. if a message is sent at time t, then it is received by time max{ t, GST } +Δ. We describe a deterministic protocol that simultaneously achieves O(n^2) worst-case message complexity, optimistic responsiveness, O(fΔ ) time to first confirmation after GST and O(n) mean message complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2022

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]

The Dolev-Reischuk bound says that any deterministic Byzantine consensus...
research
08/06/2020

Leaderless State-Machine Replication: Specification, Properties, Limits (Extended Version)

Modern Internet services commonly replicate critical data across several...
research
01/24/2023

Fever: Optimal Responsive View Synchronisation

View synchronisation is an important component of many modern Byzantine ...
research
08/07/2023

Strong Byzantine Agreement with Adaptive Word Complexity

The strong Byzantine agreement (SBA) problem is defined among n processe...
research
06/19/2022

Deterministic Finite-Memory Bias Estimation

In this paper we consider the problem of estimating a Bernoulli paramete...
research
03/29/2020

Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication

This paper investigates Byzantine broadcast (BB) protocols with optimal ...
research
06/01/2023

Every Bit Counts in Consensus

Consensus enables n processes to agree on a common valid L-bit value, de...

Please sign up or login with your details

Forgot password? Click here to reset