HotPoW: Finality from Proof-of-Work Quorums

by   Patrik Keller, et al.

We build a bridge between the notions of Byzantine and Nakamoto consensus by developing a theory of proof-of-work quorums. This theory yields stochastic uniqueness of quorums as a function of the quorum size, a security parameter. We employ the theory in HotPoW, a scalable permissionless distributed log protocol that supports finality based on the pipelined three-phase commit previously presented for HotStuff. Additionally, we present a simulation framework for distributed consensus protocols, which we use for evaluating the proposed protocol and variants with adversarial modifications. Results show that the protocol can tolerate network latency, churn, and targeted attacks on consistency and liveness at small overhead compared to deployed systems.


page 1

page 2

page 3

page 4


An Interleaving Hybrid Consensus Protocol

We introduce Unity Interleave, a new consensus algorithm for public bloc...

A Unifying Hybrid Consensus Protocol

We introduce Unity, a new consensus algorithm for public blockchain sett...

Agent-Based Simulations of Blockchain protocols illustrated via Kadena's Chainweb

While many distributed consensus protocols provide robust liveness and c...

Albatross: An optimistic consensus algorithm

The area of distributed ledgers is a vast and quickly developing landsca...

StakeCube: Combining Sharding and Proof-of-Stake to build Fork-free Secure Permissionless Distributed Ledgers

Our work focuses on the design of a scalable permissionless blockchain i...

Modeling the Raft Distributed Consensus Protocol in LNT

Consensus protocols are crucial for reliable distributed systems as they...

A Blockchain Consensus Protocol Based on Dedicated Time-Memory-Data Trade-Off

A problem of developing the consensus protocols in public blockchain sys...