pith. sign in

arxiv: 1710.09437 · v4 · pith:UHJDZIPHnew · submitted 2017-10-25 · 💻 cs.CR

Casper the Friendly Finality Gadget

Vitalik Buterin , Virgil Griffith This is my paper
classification 💻 cs.CR
keywords casperproofconsensusfinalityintroducesystemworkadditional
0
0 comments X
read the original abstract

We introduce Casper, a proof of stake-based finality system which overlays an existing proof of work blockchain. Casper is a partial consensus mechanism combining proof of stake algorithm research and Byzantine fault tolerant consensus theory. We introduce our system, prove some desirable features, and show defenses against long range revisions and catastrophic crashes. The Casper overlay provides almost any proof of work chain with additional protections against block reversions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Bitcoin Staking

    cs.CR 2024-08 unverdicted novelty 7.0

    Bitcoin staking protocol enables trustless security sharing from Bitcoin to any PoS chain using double-authentication-preventing signatures, finality gadgets, and bi-directional timestamping, as shown by Babylon mainn...

  2. Cryptocurrency Egalitarianism: A Quantitative Approach

    cs.CY 2019-07 unverdicted novelty 7.0

    A new quantitative definition shows ASIC resistance improves egalitarianism in proof-of-work coins while stake-based protocols can achieve perfect egalitarianism under suitable parameters.

  3. Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations

    quant-ph 2026-03 conditional novelty 6.0

    Resource estimates show Shor's algorithm can break 256-bit ECDLP with fewer than 1450 logical qubits and 90 million Toffoli gates on fast-clock quantum hardware, enabling on-spend attacks on cryptocurrency mempools.

  4. CoBRA: A Universal Strategyproof Confirmation Protocol for Quorum-based Proof-of-Stake Blockchains

    cs.CR 2025-03 unverdicted novelty 6.0

    CoBRA extends any quorum-based SMR protocol to tolerate 1/3 Byzantine plus 1/3 rational validators via finalization changes and adds a recovery mechanism for higher fault levels with client reimbursement.

  5. Adversarial procurement in blockchains

    cs.GT 2026-05 unverdicted novelty 5.0

    Optimal mechanisms for procuring hard computational work in adversarial blockchains incur loss scaling logarithmically with liveness-fault cost, with equilibria that designate one random primary worker and a committee...

  6. StakeDag: Stake-based Consensus For Scalable Trustless Systems

    cs.DC 2019-07 unverdicted novelty 5.0

    StakeDag introduces a stake-weighted consensus protocol S_φ for leaderless asynchronous DAGs to achieve pBFT by treating stake as validating weights in a system separating users and validators.

  7. Properties of Decentralized Consensus Technology -- Why not every Blockchain is a Blockchain

    cs.DC 2019-07 unverdicted novelty 3.0

    The authors propose Decentralized Consensus Technology (DCT) as an umbrella term for systems with decentralization, trustlessness and eventual consensus, positioning blockchain as one implementation of decentralized l...