TaiJi: Longest Chain Availability with BFT Fast Confirmation

by   Songze Li, et al.

Most state machine replication protocols are either based on the 40-years-old Byzantine Fault Tolerance (BFT) theory or the more recent Nakamoto's longest chain design. Longest chain protocols, designed originally in the Proof-of-Work (PoW) setting, are available under dynamic participation, but has probabilistic confirmation with long latency dependent on the security parameter. BFT protocols, designed for the permissioned setting, has fast deterministic confirmation, but assume a fixed number of nodes always online. We present a new construction which combines a longest chain protocol and a BFT protocol to get the best of both worlds. Using this construction, we design TaiJi, the first dynamically available PoW protocol which has almost deterministic confirmation with latency independent of the security parameter. In contrast to previous hybrid approaches which use a single longest chain to sample participants to run a BFT protocol, our native PoW construction uses many independent longest chains to sample propose actions and vote actions for the BFT protocol. This design enables TaiJi to inherit the full dynamic availability of Bitcoin, as well as its full unpredictability, making it secure against fully-adaptive adversaries with up to 50


page 1

page 2

page 3

page 4


The Availability-Accountability Dilemma and its Resolution via Accountability Gadgets

Byzantine fault tolerant (BFT) consensus protocols are traditionally dev...

Cross-Chain State Machine Replication

This paper considers the classical state machine replication (SMR) probl...

The Checkpointed Longest Chain: User-dependent Adaptivity and Finality

Longest-chain protocols such as the one invented by Nakamoto for Bitcoin...

PoSAT: Proof-of-Work Availability andUnpredictability, without the Work

An important feature of Proof-of-Work (PoW) blockchains is full dynamic ...

Ebb-and-Flow Protocols: A Resolution of the Availability-Finality Dilemma

The CAP theorem says that no blockchain can be live under dynamic partic...

Cryptoeconomic Security for Data Availability Committees

Layer 2 systems have received increasing attention due to their potentia...

Fast-HotStuff: A Fast and Resilient HotStuff Protocol

The HotStuff protocol is a recent breakthrough inByzantine Fault Toleran...