Casper the Friendly Finality Gadget

By Vitalik Buterin, Virgil Griffith. arXiv.org, 2017

681 citations recorded by the source corpus.

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.

View Paper: https://www.semanticscholar.org/paper/fdbebd67c8a9671efabf4e53d6267789cd91d96c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

HotStuff: BFT Consensus with Linearity and Responsiveness (2019, background): “To our knowledge, only BFT protocols in the blockchain arena like Tendermint [15, 16] and Casper [17] follow such a simple leader regime.”
Proof-of-Stake Consensus Mechanisms for Future Blockchain Networks: Fundamentals, Applications and Opportunities (2019, methodology): “Another type of attack that specifically targets on the PoS protocols using voting mechanisms is long-range attack [28].”
A Survey of Blockchain From the Perspectives of Applications, Challenges, and Opportunities (2019, background): “, Ethereum’s Casper, are actively trying to penalize the validator for malicious behavior [60].”
Blockchain without Waste: Proof-of-Stake (2020, background): “Prominent examples of PoS mechanisms proposed by practitioners that await implementation include Buterin and Griffith (2017) and Zamfir (2017). In contrast to the referenced papers, this paper studies a chain-based PoS mechanism akin to that discussed by Ethereum.”
A Survey of Distributed Consensus Protocols for Blockchain Networks (2019, methodology): “For example, the state machine replication (SMR) based BFT consensus algorithms have great potential in permissioned blockchain networks operated with static and revealed identities, of which TenderMint [12], Algorand [13], Casper FFG [14], and Hyperledger Fabric [15] are well-known use cases.”
A Survey on Ethereum Systems Security (2019, methodology): “(i) To cope with the nothing-at-stake attack, Casper FFG introduces the slashing mechanism to heavily penalize the misbehaving validators that generate conflicting blocks, while rewarding validators who provide evidence for the misbehavior.”
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability (2018, background): “Notably, such protocols restrict the dynamic availability of participants: for instance, Casper [8], Snow White [14], and Ouroboros/Ouroboros Praos [16, 25] require parties to maintain a “moving checkpoint”—specifically, new parties must receive trusted “advice” when they join and otherwise be frequ”
A Vademecum on Blockchain Technologies: When, Which, and How (2019, methodology): “That is, Casper cannot be considered as an hybrid algorithm mixing PoS and BFT (see Section C-G) since election and validation are not independent processes.”
Zether: Towards Privacy in a Smart Contract World (2020, background): “based consensus model in the future [20].”
A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks (2018, background): “According to [155], Casper provides plausible liveness (instead of probabilistic liveness with PoW) and accountable safety, which tolerate up to 1 / 3 of the overall voting power (weighted by stake) that is controlled by the Byzantine nodes.”
A Comprehensive Review of Blockchain Consensus Mechanisms (2021, result): “However, the evaluation results show that Casper is not able to tackle 51% of attacks [44].”