Mekanisme Lain

Proof of Work and Proof of Stake are the most famous consensus mechanisms, but many others exist, each trading off decentralization, speed, and trust differently.

This lesson surveys the key alternatives.

Proof of Authority relies on a small set of pre-approved, identified validators. Their real-world reputation is the stake.

PoA is fast and cheap but more centralized — common in private and test networks.

In Delegated Proof of Stake, token holders vote for a limited number of delegates who produce blocks on their behalf.

This boosts throughput but concentrates block production among the elected few.

Both reduce the validator set for speed, but differ in how validators are chosen:

• PoA: validators are pre-approved by identity/authority
• DPoS: validators are elected by token-holder votes

Proof of History, used by Solana, creates a verifiable timeline by hashing events in sequence.

It is not standalone consensus but a clock that lets validators agree on ordering before voting, enabling high throughput.

Many mechanisms build on Byzantine Fault Tolerance (BFT): the ability to reach agreement even if some nodes act maliciously or fail.

A BFT system stays correct as long as fewer than one-third of participants are faulty.

PBFT reaches consensus through rounds of voting among a known validator set. It gives fast, immediate finality but does not scale to thousands of open nodes.

It underpins many permissioned and hybrid chains.

Proof of Space (used by Chia) lets participants pledge disk storage instead of computation, aiming for lower energy use.

It is paired with Proof of Time to prevent gaming, offering a different resource-based security model.

There is no single best choice — it depends on goals:

• Maximum decentralization -> PoW or PoS
• Speed in a trusted group -> PoA or PBFT
• Community-elected throughput -> DPoS

The trilemma says it is hard to maximize decentralization, security, and scalability all at once.

Each consensus mechanism picks a balance, sacrificing some of one to gain another.

Beyond PoW and PoS, mechanisms like PoA, DPoS, PoH, and PBFT optimize for different needs. They mainly differ in who validates and how validators are selected.

All wrestle with the same trilemma trade-offs.

You learned that:

• PoA uses pre-approved, identified validators
• DPoS elects delegates via token-holder votes
• PoH orders events with a verifiable clock
• BFT/PBFT tolerate malicious nodes via voting
• The trilemma forces trade-offs

Next: finality and forks.