Make Every Word Count: Adaptive BA with Fewer Words

02/18/2022
by   Shir Cohen, et al.
0

Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with O(n(f+1)) communication complexity, where 0≤ f≤ t is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in the failure-free case and a quadratic cost otherwise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2020

Optimal Communication Complexity of Byzantine Consensus under Honest Majority

Communication complexity is one of the most important efficiency metrics...
research
02/16/2020

Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP

King and Saia were the first to break the quadratic word complexity boun...
research
08/07/2023

Strong Byzantine Agreement with Adaptive Word Complexity

The strong Byzantine agreement (SBA) problem is defined among n processe...
research
08/09/2023

Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit

Algorithms to solve fault-tolerant consensus in asynchronous systems oft...
research
01/24/2023

Fever: Optimal Responsive View Synchronisation

View synchronisation is an important component of many modern Byzantine ...
research
05/15/2019

Byzantine Consensus in the Common Case

Modular methods to transform Byzantine consensus protocols into ones tha...
research
05/05/2023

Flash: An Asynchronous Payment System with Good-Case Linear Communication Complexity

While the original purpose of blockchains was to realize a payment syste...

Please sign up or login with your details

Forgot password? Click here to reset