Lably
Skip to content

Proof of stake

System that regulates the formation of blocks on a blockchain

  • 7 min read
  • 6 chapters

Related on Lably

Through Blockchain, Security (finance) and Energy consumption

Description

For a blockchain transaction to be recognized, it must be appended to the blockchain. In a proof-of-stake blockchain, the appending entities are named minters or validators (in proof-of-work blockchains, this task is carried out by the miners); in most protocols, the validators receive a reward for doing so. For the blockchain to remain secure, it must have a mechanism to prevent a malicious user or group from taking over a majority of validation. PoS accomplishes this by requiring that validators have some quantity of blockchain tokens, requiring potential attackers to acquire a large fraction of the tokens on the blockchain to mount an attack.

Proof-of-work (PoW), another commonly used consensus mechanism, uses a validation of computational prowess to verify transactions, requiring a potential attacker to acquire a large fraction of the computational power of the validator network. This incentivizes consuming huge quantities of energy. PoS is more energy-efficient.

Riposo and Gupta showed that a formal PoS mathematical model can derive a metric for the expected gain of a staker. They introduced a forward-method model that computes staking rewards as the staking return per block-validation period and proved that the resulting interest equals the ratio of the average staking gain to the total staked coins. The model incorporates PoS-specific factors such as slashing (penalties for misbehavior) and Maximal Extractable Value (MEV), showing that slashing reduces expected rewards and that MEV links transaction-fee extraction to the average staking gain. In addition, the authors illustrated the model using Ethereum 2.0, and presented an analogous derivation for PoW consensus.

Early PoS implementations were plagued by a number of new attacks that exploited the unique vulnerabilities of the PoS protocols. Eventually, two dominant designs emerged: Byzantine-fault-tolerance-based and chain-based approaches. Bashir identifies three more types of PoS:

  • committee-based PoS (a.k.a. nominated PoS, NPoS);
  • delegated proof of stake (DPoS);
  • liquid proof of stake (LPoS).

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Computing and communication