Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol

by   Rati Gelashvili, et al.

The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT SMR protocols provide optimal linear communication cost per decision under synchrony and good leaders, but lose liveness under asynchrony. On the other hand, the state-of-the-art asynchronous BFT SMR protocols are live even under asynchrony, but always pay quadratic cost even under synchrony. In this paper, we propose a BFT SMR protocol that achieves the best of both worlds – optimal linear cost per decision under good networks and leaders, optimal quadratic cost per decision under bad networks, and remains always live.


page 1

page 2

page 3

page 4


Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback

Existing committee-based Byzantine state machine replication (SMR) proto...

In Search for a Linear Byzantine Agreement

The long-standing byzantine agreement problem gets more attention in rec...

On the Significance of Quiescent Protocols for Asynchronous Perfectly Secure Message Transmission

We consider the problem of perfect (information-theoretically) secure me...

Network-Agnostic State Machine Replication

We study the problem of state machine replication (SMR) – the underlying...

Deterministic Blockchain BFT Protocol XP for Complete Asynchronous Networks

Ethereum Research team has proposed a family of Casper blockchain consen...

Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil

We describe a protocol called `Hot-Stuff the Linear, Optimal-Resilience,...

The Good, the Bad, and the Ugly: three different approaches to break their watermarking system

The Good is Blondie, a wandering gunman with a strong personal sense of ...