Securing Proof-of-Stake Nakamoto Consensus Under Bandwidth Constraint

by   Joachim Neu, et al.

Satoshi Nakamoto's Proof-of-Work (PoW) longest chain (LC) protocol was a breakthrough for Internet-scale open-participation consensus. Many Proof-of-Stake (PoS) variants of Nakamoto's protocol such as Ouroboros or Snow White aim to preserve the advantages of LC by mimicking PoW LC closely, while mitigating downsides of PoW by using PoS for Sybil resistance. Previous works have proven these PoS LC protocols secure assuming all network messages are delivered within a bounded delay. However, this assumption is not compatible with PoS when considering bandwidth constraints in the underlying communication network. This is because PoS enables the adversary to reuse block production opportunities and spam the network with equivocating blocks, which is impossible in PoW. The bandwidth constraint necessitates that nodes choose carefully which blocks to spend their limited download budget on. We show that 'download along the longest header chain', a natural download rule for PoW LC, emulated by PoS variants, is insecure for PoS LC. Instead, we propose 'download towards the freshest block' and prove that PoS LC with this download rule is secure in bandwidth constrained networks. Our result can be viewed as a first step towards the co-design of consensus and network layer protocols.


page 1

page 2

page 3

page 4


Security of Blockchains at Capacity

Given a network of nodes with certain communication and computation capa...

Everything is a Race and Nakamoto Always Wins

Nakamoto invented the longest chain protocol, and claimed its security b...

DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks

The success of blockchains has sparked interest in large-scale deploymen...

A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs

Large scale cryptocurrencies require the participation of millions of pa...

Blockmania: from Block DAGs to Consensus

Blockmania is a byzantine consensus protocol. Nodes emit blocks forming ...

StairDag: Cross-DAG Validation For Scalable BFT Consensus

This paper introduces a new consensus protocol, so-called , for fast con...

Fast-HotStuff: A Fast and Resilient HotStuff Protocol

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

Please sign up or login with your details

Forgot password? Click here to reset