Consensus Algorithms
This is Consensus Algorithms

Consensus in Blockchain
Consensus is how a decentralized network agrees on one, canonical history of blocks and transactions, even when some participants are slow, offline, or malicious. Good consensus gives you:
- Safety: honest nodes never finalize conflicting blocks.
- Liveness: the chain keeps growing.
- Sybil resistance: one person can’t cheaply pretend to be thousands of nodes.
- Finality: a point after which a transaction won’t be reverted.
Two Big Families
- Nakamoto-style (lottery) consensus
- A leader is chosen probabilistically to propose the next block (via computing work or holding stake).
- Finality is probabilistic (confidence increases as more blocks build on top).
- Scales well to thousands of open participants.
- BFT-style (voting) consensus
- A small, known validator set votes on each block.
- Finality is deterministic once ≥⅔ (or quorum) sign.
- High throughput and fast finality, best for permissioned or moderately permissionless networks.
Core Mechanisms (with step-by-step examples)
1) Proof of Work (PoW)
In PoW, miners compete to solve a complex mathematical puzzle (cryptographic hash problem). The first to solve it gets the right to add the next block and earn block rewards (new coins + transaction fees). It’s like a lottery system, but the chances of winning depend on how much computational power (hash rate) you control.
Used by: Bitcoin, (historically) Ethereum pre-Merge.
How it works:
- Miners compete to solve a complex mathematical puzzle (called a hash puzzle).
- The first to solve it gets the right to add a new block to the blockchain.
- The winner is rewarded with cryptocurrency (e.g., Bitcoin mining).
Example:
- Suppose Alice, Bob, and Charlie are miners.
- They all compete to solve a puzzle like: “Find a number (nonce) such that the SHA-256 hash of the block data starts with 20 zeros.”
- Bob finds the solution first → he publishes the block → other nodes verify it → the block is added to the chain.
- Bob gets rewarded (e.g., 6.25 BTC in Bitcoin today).
Pros
- Highly secure (difficult to tamper with past transactions).
- Decentralized → no reliance on identities.
- Battle-tested → used by Bitcoin since 2009.
Cons
- Energy-intensive (huge electricity costs).
- Slow throughput (Bitcoin ~7 TPS).
- Mining centralization risk (large mining pools dominate).
2) Proof of Stake (PoS)
Validators are chosen to create new blocks based on how many coins they "stake" (lock up) in the network. The more coins you stake, the higher your chances of being selected, like holding lottery tickets. Instead of burning energy, security comes from the financial stake—if you cheat, you lose your deposit.
Used by: Solana (PoS variants), Polygon PoS, Ethereum 2.0, Cardano, Polkadot.
How it works:
- Assume Alice stakes 100 ETH, Bob stakes 50 ETH, Charlie stakes 200 ETH.
- The system randomly chooses validators, weighted by stake.
- Probability of selection:
Alice → 25% chance
Bob → 12.5% chance
Charlie → 50% chance - Suppose Alice is chosen → she proposes a block → other validators check it → if valid, it’s added.
- Alice earns rewards (transaction fees + staking yield).
Pros
- Energy efficient (no heavy computations).
- Higher throughput than PoW.
- Economic penalties discourage cheating (slashing).
Cons
- Rich-get-richer problem (wealthy stakers earn more).
- Complex implementation.
- Requires strong security against “long-range attacks.”
Choosing the Right Mechanism
| Scenario | Best Fit | Why |
|---|---|---|
| Open, global cryptocurrency | PoW or PoS | Strong Sybil resistance; wide participation |
| Energy efficiency, economic security | PoS | No mining race, slashing-based security |
| Fast finality in consortium/enterprise | BFT (PBFT/IBFT/Raft) | Seconds to finality, predictable throughput |
| Small validator set, identity-anchored | PoA/PoSA | Operated by known organizations |
| Token-holder governance emphasis | DPoS | Elected producers, high throughput |
Summary Comparison Table
| Consensus Algorithm | Used By (Examples) | Core Idea | Pros | Cons | Best Fit For |
|---|---|---|---|---|---|
| Proof of Work (PoW) | Bitcoin, Litecoin, early Ethereum | Miners solve cryptographic puzzles to propose blocks. | Battle-tested security, highly decentralized, censorship-resistant. | Energy-intensive, slower transactions, low scalability. | Public blockchains valuing security over speed. |
| Proof of Stake (PoS) | Ethereum 2.0, Cardano, Polkadot | Validators stake tokens; probability of proposing block depends on stake. | Energy-efficient, higher scalability, reduced hardware needs. | Wealth concentration risk, complex slashing rules. | Public blockchains seeking balance of decentralization & efficiency. |
| Delegated Proof of Stake (DPoS) | EOS, TRON, Steem | Token holders vote for a limited set of delegates who validate blocks. | Very high throughput, democratic governance, faster block confirmation. | Centralization risk (few validators), voter apathy reduces security. | High-performance blockchains with active communities. |
| Proof of Authority (PoA) / PoSA | BNB Chain (PoSA), VeChain, enterprise consortia | Small set of known validators with real-world identity/authority; PoSA combines authority + staking. | Fast finality, high TPS, low cost, efficient governance. | Less decentralized, relies on legal trust, potential validator collusion. | Enterprise or consortium chains; hybrid public-private chains. |
| BFT Protocols (PBFT, Tendermint, HotStuff, Istanbul BFT) | Hyperledger Fabric (PBFT), Cosmos (Tendermint), Libra/Diem (HotStuff) | Validators exchange messages to reach agreement, tolerating up to 1/3 malicious nodes. | Instant finality, low latency, high throughput. | Communication-heavy (scales poorly with many validators), partial centralization. | Permissioned blockchains, consortium networks, interoperable chains. |
Test Your Knowledge
Practice what you've learned with these quizzes related to What is Blockchain?.
Continue Learning
Explore more topics in What is Blockchain? or browse other tutorials.