Fast Byzantine Total Order Broadcast

TL;DR

This paper introduces Flutter, a Byzantine Total Order Broadcast protocol achieving near-optimal low latency of 2Δ + ε in synchronous networks, outperforming existing protocols and being quantum-resilient.

Contribution

Flutter is the first Byzantine Total Order Broadcast protocol with sub-3Δ latency, deterministic, leaderless, signature-free, and built on a novel consensus algorithm.

Findings

Flutter achieves broadcast-to-delivery latency of 2Δ + ε in correct, synchronous networks.

Flutter's latency is proven to be quasi-optimal and cannot be improved.

The protocol is deterministic, leaderless, signature-free, and quantum-resilient.

Abstract

This paper presents Flutter, the first Byzantine Total Order Broadcast implementation with a broadcast-to-delivery latency of $2\Delta + \epsilon$ time units, $\Delta$ being the message delay and $\epsilon$ an arbitrarily small constant margin, when all processes are correct, the network is synchronous, hence local clocks are well-synchronized. Under the same conditions, state-of-the-art protocols require at least $3\Delta$ time units in practical deployments where clients differ from servers. We prove Flutter's good-case latency is quasi-optimal, meaning it cannot be improved upon by any finite amount. Flutter is deterministic, leaderless, and signature-free hence quantum-resilient; it assumes partial synchrony and at least $5f + 1$ servers, where $f$ bounds the number of faults. Under the hood, Flutter builds upon Blink, a novel Binary Consensus implementation with Representative Validity, whose fast path enables decisions in $\Delta$ time units when all correct servers propose the same value.