• Corpus ID: 199000944

HotPoW: Finality from Proof-of-Work Quorums

  title={HotPoW: Finality from Proof-of-Work Quorums},
  author={Patrik Keller and Rainer B{\"o}hme},
A fundamental conflict of many proof-of-work systems is that they want to achieve inclusiveness and security at the same time. We analyze and resolve this conflict with a theory of proof-of-work quorums, which enables a new bridge between Byzantine and Nakamoto consensus. The theory yields stochastic uniqueness of quorums as a function of a security parameter. We employ the theory in HotPoW, a scalable permissionless distributed log protocol that supports finality based on the pipelined three… 

Securing Proof-of-Work Ledgers via Checkpointing

This work puts forth the first rigorous study of checkpointing as a protection from 51% attacks and identifies and protect against a (previously undocumented) attack, "block lead", thus this scheme is the first to guarantee liveness.

Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems

It is shown that under plausible and flexible security assumptions about clients the confirmed checkpoints can not be equivocated, and checkpoint latency is evaluated experimentally using Bitcoin and Ethereum transaction graphs, with and without delegation of stake.

Blockchain and cryptocurrencies technologies and network structures: applications, implications and beyond

The aim of the paper is to provide a synthetic sketch of issues raised by the development of Blockchains and Cryptocurrencies, these issues are mainly presented through the link between on one hand the technological aspects, and on the other hand the issues raised from applications to implications.



Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem

This paper shows how to construct an asymmetric proof-of-work (PoW) based on a computationally hard problem, which requires a lot of memory to generate a proof but is instant to verify, and introduces the new technique of algorithm binding to prevent cost amortization.

HotStuff: BFT Consensus in the Lens of Blockchain

This work presents HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model that enables a correct leader to drive the protocol to consensus at the pace of actual network delay with communication complexity that is linear in the number of replicas.

Lay Down the Common Metrics: Evaluating Proof-of-Work Consensus Protocols' Security

It is concluded that to date, no PoW protocol achieves ideal chain quality or is resistant against all three attacks, and a multi-metric evaluation framework is introduced to quantitatively analyze PoW protocols' chain quality and attack resistance.

SPECTRE: A Fast and Scalable Cryptocurrency Protocol

SPECTRE is presented, a new protocol for the consensus core of crypto-currencies that remains secure even under high throughput and fast confirmation times, and can operate at high block creation rates, which implies that its transactions confirm in mere seconds.

FruitChains: A Fair Blockchain

  • R. PassE. Shi
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2016
The FruitChain protocol is presented, which satisfies the same consistency and liveness properties as Nakamoto's protocol, and additionally is δ-approximately fair: with overwhelming probability, any honest set of players controlling a φ fraction of computational power is guaranteed to get at least a fraction of the blocks in any Ω(κ/δ) length segment of the chain.

Exposing Computationally-Challenged Byzantine Impostors

Though the algorithms do not prevent Sybil attacks entirely, they suggest that Byzantine agreement and similar tools from the distributed computing literature are likely to help solve the problem of adversarial behavior by components of peer-to-peer systems.

The Bitcoin Backbone Protocol: Analysis and Applications

This work extracts and analyzes the core of the Bitcoin protocol, which is term the Bitcoin backbone, and proves two of its fundamental properties which are called common prefix and chain quality in the static setting where the number of players remains fixed.

Byzantine quorum systems

This paper considers the arbitrary (Byzantine) failure of data repositories and presents the first study of quorum system requirements and constructions that ensure data availability and consistency despite these failures, and demonstrates quorum systems over n servers with a load of O(\frac{1}{\sqrt{n}})$, thus meeting the lower bound on load for benignly fault-tolerant quorum Systems.

State Machine Replication in the Libra Blockchain

The Libra Byzantine Fault Tolerance algorithmic core incorporates a novel round synchronization mechanism that provides bounded commit latency under synchrony and introduces a nil-block vote that allows proposals to commit despite having faulty leaders.

Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing

This paper introduces ByzCoin, a novel Byzantine consensus protocol that leverages scalable collective signing to commit Bitcoin transactions irreversibly within seconds, and achieves a throughput higher than PayPal currently handles, with a confirmation latency of 15-20 seconds.