On the Validity of Consensus

01/12/2023
by   Pierre Civit, et al.
0

The Byzantine consensus problem involves n processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiring correct (non-faulty) processes to eventually reach a decision, (2) agreement, preventing them from deciding different values, and (3) validity, precluding “unreasonable” decisions. But, what is a reasonable decision? Strong validity, a classical property, stipulates that, if all correct processes propose the same value, only that value can be decided. Weak validity, another established property, stipulates that, if all processes are correct and they propose the same value, that value must be decided. The space of possible validity properties is vast. However, their impact on consensus remains unclear. This paper addresses the question of which validity properties allow Byzantine consensus to be solvable with partial synchrony, and at what cost. First, we determine necessary and sufficient conditions for a validity property to make the consensus problem solvable; we say that such validity properties are solvable. Notably, we prove that, if n <= 3t, all solvable validity properties are trivial (there exists an always-admissible decision). Furthermore, we show that, with any non-trivial (and solvable) validity property, consensus requires Omega(t^2) messages. This extends the seminal Dolev-Reischuk bound, originally proven for strong validity, to all non-trivial validity properties. Lastly, we give a general Byzantine consensus algorithm, we call Universal, for any solvable (and non-trivial) validity property. Importantly, Universal incurs O(n^2) message complexity. Thus, together with our lower bound, Universal implies a fundamental result in partial synchrony: with t ∈Omega(n), the message complexity of all (non-trivial) consensus variants is Theta(n^2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2018

Byzantine Preferential Voting

In the Byzantine agreement problem, n nodes with possibly different inpu...
research
05/04/2023

ZLB, a Blockchain Tolerating Colluding Majorities

The problem of Byzantine consensus has been key to designing secure dist...
research
08/07/2023

Strong Byzantine Agreement with Adaptive Word Complexity

The strong Byzantine agreement (SBA) problem is defined among n processe...
research
01/22/2020

A Simple and Efficient Binary Byzantine Consensus Algorithm using Cryptography and Partial Synchrony

This paper describes a simple and efficient Binary Byzantine faulty tole...
research
02/10/2023

Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory

Like Asynchrony, Mobility of faults precludes consensus. Yet, a model M ...
research
03/22/2023

Consensus on Unknown Torus with Dense Byzantine Faults

We present a solution to consensus on a torus with Byzantine faults. Any...
research
08/06/2019

Wait-Free Universality of Consensus in the Infinite Arrival Model

In classical asynchronous distributed systems composed of a fixed number...

Please sign up or login with your details

Forgot password? Click here to reset