From Weakly-terminating Binary Agreement and Reliable Broadcast to Atomic Broadcast

TL;DR

This paper introduces a simplified atomic broadcast protocol by reducing it to reliable broadcast and a new weakly-terminating binary agreement, with proofs of safety, liveness, and censorship resilience.

Contribution

It presents a novel approach that simplifies atomic broadcast by leveraging weakly-terminating binary agreement and reliable broadcast, with concrete solutions and formal proofs.

Findings

Proposes a new weakly-terminating binary agreement (WBA) protocol.

Reduces atomic broadcast to reliable broadcast and WBA.

Provides proofs of safety, liveness, and censorship resilience.

Abstract

We present a novel and simple solution to Atomic Broadcast (AB). We reduce AB to two subproblems. One of them is Reliable Broadcast (RB). We also introduce a subproblem we call Weakly-terminating Binary Agreement (WBA). WBA relaxes Binary Agreement (BA) protocols by not always terminating. WBA admits much simpler solutions than BA. We discuss concrete solutions to RB and WBA. We prove safety, liveness, and censorship resilience of our new AB protocol.