Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks

03/04/2020
by   Bryan Ford, et al.
0

It is commonly held that asynchronous consensus is much more complex, difficult, and costly than partially-synchronous algorithms, especially without using common coins. This paper challenges that conventional wisdom with que sera consensus QSC, an approach to consensus that cleanly decomposes the agreement problem from that of network asynchrony. QSC uses only private coins and reaches consensus in O(1) expected communication rounds. It relies on "lock-step" synchronous broadcast, but can run atop a threshold logical clock (TLC) algorithm to time and pace partially-reliable communication atop an underlying asynchronous network. This combination is arguably simpler than partially-synchronous consensus approaches like (Multi-)Paxos or Raft with leader election, and is more robust to slow leaders or targeted network denial-of-service attacks. The simplest formulations of QSC atop TLC incur expected O(n^2) messages and O(n^4) bits per agreement, or O(n^3) bits with straightforward optimizations. An on-demand implementation, in which clients act as "natural leaders" to execute the protocol atop stateful servers that merely implement passive key-value stores, can achieve O(n^2) expected communication bits per client-driven agreement.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2019

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Consensus protocols for asynchronous networks are usually complex and in...
research
06/15/2021

Efficient Asynchronous Byzantine Agreement without Private Setups

For asynchronous binary agreement (ABA) with optimal resilience, prior p...
research
11/24/2019

ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication

With the emergence of cross-organization attack-prone byzantine fault-to...
research
04/04/2020

A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs

Large scale cryptocurrencies require the participation of millions of pa...
research
06/12/2018

Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model

We provide the first asynchronous distributed algorithms to compute broa...
research
09/12/2022

Bullshark: The Partially Synchronous Version

The purpose of this manuscript is to describe the deterministic partiall...
research
07/11/2023

Comparing Social Network Dynamic Operators

Numerous logics have been developed to reason either about threshold-ind...

Please sign up or login with your details

Forgot password? Click here to reset