How is proof of stake secure if it uses almost no energy?

Security comes from capital at risk rather than energy spent. To attack the chain an adversary must acquire a large fraction of the staked tokens, and provable misbehavior causes part of that stake to be destroyed (slashed). The cost of an attack is the value of the stake the attacker stands to lose, not the electricity they burn.

Slashing is the penalty that enforces honest behavior. If a validator commits a provable fault — such as signing two conflicting blocks or double-voting — the protocol burns a portion of its staked deposit and ejects it from the validator set. This makes attacks self-punishing rather than merely unprofitable.

Does proof of stake just let the rich get richer?

It is a genuine criticism: rewards accrue in proportion to stake, so large holders earn proportionally more, and the initial distribution of tokens matters a great deal. Proponents note that rewards are roughly proportional rather than super-linear, that staking is open to anyone above the minimum or via pools, and that proof of work also concentrates around cheap capital and electricity.

Proof of stake explained | Blockchain Research

Overview

Proof of stake (PoS) is a consensus mechanism that secures an open blockchain through economic stake rather than computational work. Instead of competing to burn electricity, participants lock up — stake — a quantity of the network’s native token as collateral. That collateral both grants the right to help produce blocks and serves as a bond that can be destroyed if the participant cheats. The cost of attacking the network becomes the capital you would forfeit, not the energy you would expend.

PoS is best known today as the consensus layer of Ethereum, which switched from proof of work to proof of stake in September 2022 in an event called the Merge. The model is detailed in Ethereum.org’s proof-of-stake documentation.

The problem it solves

Like proof of work, proof of stake exists to let an open, permissionless network reach agreement despite anonymous and potentially malicious participants.

The Sybil problem

Open networks cannot rely on counting identities, because identities are free to manufacture. PoS resists Sybil attacks by tying influence to staked capital instead of to the number of nodes. Running a thousand validators does you no good unless you have staked a thousand validators’ worth of tokens; the scarce resource is the token at risk, not the machine. Capital, like hash power in proof of work, is something an attacker must actually acquire.

Byzantine fault tolerance

PoS systems must also tolerate validators that are offline, buggy, or actively dishonest — the Byzantine fault model. Most modern PoS designs handle this with an explicit, BFT-style voting process among the active validators. Validators vote on the head of the chain, and once a supermajority (commonly two-thirds of total stake) has voted for a block, it becomes economically irreversible. Honest behavior is reinforced by penalties that make equivocation and conflicting votes self-destructive.

How it works mechanically

The exact rules vary between networks, but Ethereum’s design illustrates the common pattern.

Becoming a validator. A participant deposits a fixed amount of the native token (32 ETH on Ethereum) into a deposit contract to activate a validator. Those without the minimum can join staking pools or use delegated/liquid-staking services to contribute smaller amounts.
Block proposal. Time is divided into slots and epochs. In each slot, the protocol pseudo-randomly selects one active validator to propose a block. Because selection is randomized and based on stake, no one can buy their way to producing every block.
Attestation. A randomly chosen committee of other validators attests — votes — that the proposed block is valid and is the correct head of the chain. These attestations are aggregated and are what actually drive consensus.
Rewards and penalties. Validators earn rewards for proposing and attesting correctly and on time. Validators that are offline or attest incorrectly lose small amounts through inactivity leaks and missed-reward penalties.

This randomized proposer-plus-committee structure means consensus is reached by voting weighted by stake, not by a race to solve a puzzle.

The security model

PoS security is enforced primarily through slashing. If a validator commits a provable, attributable fault — most importantly equivocation, such as proposing two different blocks for the same slot or casting contradictory votes — the protocol destroys a portion of its staked deposit and forcibly removes it from the validator set. Unlike proof of work, where misbehavior simply wastes the attacker’s own effort, here misbehavior actively burns the attacker’s capital.

This enables economic finality. On Ethereum, once two-thirds of total staked value has attested across two consecutive epochs, those blocks are finalized: reverting them would require an attacker to get at least one-third of all staked ETH slashed, an enormous and self-inflicted loss. This is a stronger guarantee than proof of work’s purely probabilistic finality, where transactions are only ever increasingly hard to reverse and never strictly final.

The analogue of the 51% attack is acquiring a large fraction (typically a third or a half) of total stake. The defense is that doing so requires buying up an enormous quantity of the token — likely driving up its price in the process — and then watching that stake get slashed when the attack is detected. The attacker pays with the very asset they are attacking.

Energy and economics

The most dramatic difference from proof of work is energy. Because validating requires only ordinary servers signing messages, not brute-force hashing, PoS consumes a tiny fraction of the electricity. According to Ethereum.org’s energy figures, the Merge cut Ethereum’s electricity use by more than 99.9%, and the Merge documentation describes a reduction on the order of 99.95%.

Economically, PoS replaces the recurring operational cost of mining (hardware plus electricity) with an opportunity cost (capital locked in stake). Rewards flow to those who stake, in proportion to how much they stake. To make exit orderly and attacks harder to unwind, withdrawing staked funds is subject to delays and exit queues, so a validator cannot misbehave and instantly pull its capital out.

Honest trade-offs

Strengths. Very low energy consumption; explicit, faster finality; lower barriers to participation in raw hardware terms; and attacks that punish the attacker through slashing rather than merely costing them electricity.
Weaknesses and criticisms.
- Wealth concentration. Influence and rewards scale with stake, so large holders can grow their share, and the network’s security inherits the fairness (or unfairness) of the token’s initial distribution.
- Complexity. PoS protocols are substantially more intricate than proof of work, with more moving parts (committees, slashing conditions, finality gadgets) and therefore a larger surface for subtle bugs.
- “Nothing at stake” and weak subjectivity. Early critiques worried validators could costlessly support multiple forks; slashing addresses this directly, but PoS chains rely on new or long-offline nodes obtaining a recent trusted checkpoint to sync safely, a property called weak subjectivity that proof of work does not require.
- Staking centralization. In practice, large staking pools and liquid-staking providers can accumulate significant shares of total stake, recreating centralization concerns in a different form.

Proof of stake represents the mainstream direction for newer large networks, trading proof of work’s brute-force simplicity and energy cost for capital-based security, stronger finality, and greater protocol complexity.

Proof of stake explained