Consistency of Proof-of-Stake Blockchains with Concurrent Honest Slot Leaders

01/15/2020
by   Aggelos Kiayias, et al.
0

We improve the fundamental security threshold of Proof-of-Stake (PoS) blockchain protocols, reflecting for the first time the positive effect of rounds with multiple honest leaders. Current analyses of the longest-chain rule in PoS blockchain protocols reduce consistency to the dynamics of an abstract, round-based block creation process determined by three probabilities: p_A, the probability that a round has at least one adversarial leader; p_h, the probability that a round has a single honest leader; and p_H, the probability that a round has multiple, but honest, leaders. We present a consistency analysis that achieves the optimal threshold p_h + p_H > p_A. This is a first in the literature and can be applied to both the simple synchronous setting and the setting with bounded delays. We also achieve the optimal consistency error e^-Θ(k), k being the confirmation time. The consistency analyses in Ouroboros Praos (Eurocrypt 2018) and Genesis (CCS 2018) assume that p_h - p_H > p_A; the analyses in Sleepy Consensus (Asiacrypt 2017) and Snow White (Fin. Crypto 2019) assume that p_h > p_A. Thus existing analyses either incur a penalty for multiply-honest rounds, or treat them neutrally. In addition, previous analyses completely break down when p_h < p_A. Our new results can be directly applied to improve the consistency of these existing protocols. We emphasize that these thresholds determine the critical tradeoff between honest majority, network delays, and consistency error. We complement our results with a consistency analysis in the setting where uniquely honest slots are rare, event letting p_h = 0, under the added assumption that honest players adopt a consistent chain selection rule. Our analysis provides a direct connection between the Ouroboros analysis focusing on "relative margin" and the Sleepy analysis focusing on "strong pivots."

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/22/2019

Linear Consistency for Proof-of-Stake Blockchains

The blockchain data structure maintained via the longest-chain rule—popu...
research
09/15/2021

Private Attacks in Longest Chain Proof-of-stake Protocols with Single Secret Leader Elections

Single Secret Leader Elections have recently been proposed as an improve...
research
10/23/2017

On the Coordinator's Rule for Fast Paxos

Fast Paxos is an algorithm for consensus that works by a succession of r...
research
09/14/2019

An Analysis of Blockchain Consistency in Asynchronous Networks: Deriving a Neat Bound

Formal analyses of blockchain protocols have received much attention rec...
research
07/16/2022

Optimal Strategic Mining Against Cryptographic Self-Selection in Proof-of-Stake

Cryptographic Self-Selection is a subroutine used to select a leader for...
research
03/16/2023

Security of Blockchains at Capacity

Given a network of nodes with certain communication and computation capa...
research
06/05/2021

Modeling Coordinated vs. P2P Mining: An Analysis of Inefficiency and Inequality in Proof-of-Work Blockchains

We study efficiency in a proof-of-work blockchain with non-zero latencie...

Please sign up or login with your details

Forgot password? Click here to reset