liveBook · Manning

Proof-of-stake

As explained in Real-World Cryptography

Proof of stake is a consensus-participant selection mechanism that weights participation according to the amount of currency held or staked.

When a network cannot keep a fixed list of consensus participants, proof of stake (PoS) dynamically selects participants according to how much digital currency they hold or have at stake. The assumption is that larger stakes make attacks less attractive. section 12.1.3

PoS fits into the consensus-participant problem like this:

  • Proof of authority chooses consensus participants in advance. section 12.1.3
  • Proof of stake chooses participants dynamically by currency holdings or stake. section 12.1.3
  • Proof of work lets participants compete computationally, as in Bitcoin. section 12.1.3

Choosing participants

A cryptocurrency can use PoS to elect consensus participants based on the amount of digital currency they hold, rather than requiring a preapproved participant list. section 12.1.3

Figure 12.1 A centralized network can be seen as a single point of failure, whereas a distributed and decentralized network are resilient to a number of servers shutting down or acting maliciously. A permissioned network has a known and fixed set of main actors, while in a permissionless network, anyone can participate.

Use the network diagram to compare permissioned networks, which have known participants, with permissionless networks, where anyone can participate. section 12.1.3

How Real-World Cryptography covers it

How deep it goes
Defines stake-weighted participant selection and contrasts it with authority and work, without detailing protocol internals.
Examples
Contrasts PoS participant election with PoA’s fixed membership and Bitcoin’s computational proof of work.
What it assumes
Assumes a basic understanding of cryptocurrency consensus and distinguishes permissioned from permissionless networks.
What you can do after
Evaluate how a cryptocurrency selects consensus participants and distinguish stake-based selection from authority- and work-based approaches.
How it connects
Connects proof of stake with consensus algorithms, Byzantine fault tolerance, proof of authority, proof of work, and permissionless networks.

Also explained in

Compare how 2 books explain proof-of-stake →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Real-World Cryptography. The section links point to the parts of the book it draws on.