Bitcoin Consensus Mechanisms — PoW, PoB, PoS, and PoET

2.5 — Bitcoin Blockchain: Consensus Mechanisms

Recall first. From Module I, consensus decides which valid history a distributed network follows. If anyone can join a public network, why is “one computer, one vote” unsafe? Write Sybil attack before reading.

The qualification that earns marks

The book presents Bitcoin as a Proof-of-Work (PoW) blockchain. The syllabus also asks for Proof-of-Burn (PoB), Proof-of-Stake (PoS), and Proof-of-Elapsed Time (PoET). These are alternative consensus mechanisms, not four mechanisms all used by Bitcoin at the same time. In an exam, write:

Bitcoin uses Nakamoto-style Proof-of-Work. PoB, PoS, and PoET are alternative mechanisms used or proposed by other blockchain systems.

The book surveys PoW, PoET, and PoS in Ch. 2, describes PoB in its coin-burning section, and explains Bitcoin’s PoW/Hashcash process in Ch. 4. [Book: Ch. 2 §2.4.3, lines 1410–1493; Ch. 3 §3.5.4, lines 2038–2054; Ch. 4 §4.4.4, lines 2748–2865]

What consensus must solve

A consensus mechanism is a set of rules for distributed participants to agree on valid transactions, block order, and the accepted ledger state despite delay, failures, or adversarial behaviour. It answers:

1. Who may propose or validate a block?
2. How much influence does a participant have?
3. How are invalid or conflicting transactions rejected?
4. How is a winner selected when proposals compete?
5. What makes attacking the system costly or punishable?

A public network cannot safely give one vote to every account because an attacker could create many fake accounts. The mechanism must attach influence to a scarce resource or controlled identity. PoW uses computation; PoS uses economically committed stake; PoET uses a trusted waiting process; PoB uses deliberately destroyed coins. [Book: Ch. 2 §2.4, lines 1410–1440]

Bitcoin’s Proof-of-Work

The race

Bitcoin miners:

1. collect valid transactions, often from a mempool;
2. assemble a candidate block;
3. place a changing nonce and other header values into the hash computation;
4. repeatedly compute the hash until it satisfies the difficulty target;
5. broadcast the candidate block and proof; and
6. let other nodes verify the proof and all transaction rules.

The winning hash is hard to find but easy for every node to check. The chain-selection rule favours the valid chain with the greatest cumulative work, so rewriting an old block requires redoing its work and catching up with subsequent work. [Book: Ch. 4 §§4.4.4–4.4.4.1, lines 2748–2818]

A simplified condition is:

H(block header) < target

A smaller target means fewer acceptable hashes and therefore a harder search. The nonce is not a magical “answer” that proves the transactions are true; it proves that the miner spent computational effort searching for a header that meets the target. Nodes still independently validate the block, signatures, UTXOs, and protocol rules.

Why PoW resists Sybil identities

One person can create many cheap network identities, but cannot make those identities produce more hashpower without paying for hardware and electricity. PoW therefore makes influence proportional to computational work rather than node count. Its costs include energy use, hardware competition, latency, and the possibility that concentrated mining power weakens decentralisation. The book identifies time, energy, and majority-hash-rate risks as PoW disadvantages. [Book: Ch. 2 §2.4.3.1, lines 1410–1430; Ch. 4 §4.4.4.2, lines 2819–2838]

Proof-of-Burn (PoB)

In Proof-of-Burn, a participant sends coins to an unspendable “eater” address. The destruction is visible and verifiable, and the amount burned determines or increases the participant’s chance/weight to validate a block. It replaces continuous computational expenditure with an irreversible economic sacrifice. [Book: Ch. 3 §3.5.4, lines 2038–2054]

Benefits: no specialised mining hardware is required; participation can be tied to a visible commitment; energy use may be lower than PoW.

Risks: the burned value is permanently lost; participants with more wealth can burn more and gain more influence; control may become concentrated in a “rich get richer” pattern. Burning for token economics is not automatically PoB—PoB requires burning to be part of block-validation rights.

Proof-of-Stake (PoS)

In PoS, validators lock or commit cryptocurrency as stake/collateral. A protocol selects validators, usually with some randomisation and stake-related weighting, to propose or attest to blocks. Honest behaviour earns rewards; protocol rules may penalise dishonest behaviour by reducing or destroying stake. [Book: Ch. 2 §2.4.3.3, lines 1450–1478]

Why it differs from PoW: security does not require every participant to race continuously through hash computations. It can reduce energy use and change the attack cost from operating hardware to acquiring and risking stake.

Risks and trade-offs:

• wealth concentration can produce validator concentration;
• the exact attack model, penalties, finality, and selection rule depend on the protocol;
• stake-based influence is not automatically fair or decentralised; and
• “less energy” does not by itself prove “more secure.”

The book mentions Peercoin, NXT, and BlackCoin as PoS examples and discusses Ethereum’s historical transition plans. Those examples and historical descriptions should not be copied as current network facts without checking a current source. [Book: Ch. 2 §2.4.3.3, lines 1450–1478]

Proof-of-Elapsed Time (PoET)

PoET selects a block winner through a randomly assigned waiting period generated and enforced by a trusted execution environment (TEE). A node waits; the node whose valid wait expires first proposes the block, and the others verify the attestation and block. The intended benefit is a fair lottery without PoW’s continuous computation. [Book: Ch. 2 §2.4.3.2, lines 1430–1450]

Its trust model is different: participants and hardware/TEE assumptions matter. If the trusted execution environment is compromised or its implementation has a vulnerability, the lottery’s fairness and security can fail. The book associates PoET with permissioned networks and Intel SGX-based systems. Treat those as the book’s examples, not as a claim that PoET is Bitcoin’s mechanism.

Comparison

Worked example — correct the statement

A student writes: “Bitcoin uses PoW, PoS, PoB, and PoET. In PoB miners burn coins, in PoS they stake coins, and in PoET they wait, so Bitcoin combines all four.” Correct the answer in three sentences.

Exercise

A new public chain wants to avoid energy-intensive PoW. Its designers propose PoS and say: “Because there is no mining, there is no centralisation risk.” Give two reasons this conclusion is too strong.

Exam lens

Use this long-answer structure:

1. Define consensus and explain the Sybil problem.
2. State clearly that Bitcoin uses PoW.
3. Explain Bitcoin’s miner race, target, nonce, verification, reward, and cumulative-work chain selection.
4. Discuss PoW advantages and disadvantages.
5. Compare PoB, PoS, and PoET as alternatives.
6. End with a table of resource, validator selection, trust assumption, and limitation.

Common traps:

• Do not call PoB, PoS, and PoET Bitcoin’s current consensus variants.
• A valid PoW hash does not make invalid transactions valid.
• A nonce is a search variable, not a transaction identifier or ownership proof.
• PoS is not simply “the richest node always wins”; selection and penalties are protocol-defined.
• PoB coin burning is not the same as burning tokens to reduce supply.
• PoET is not “free trust”; it moves trust to the TEE and its attestation.

Rapid revision

• Can I state Bitcoin’s consensus mechanism in one sentence?
• Can I explain why PoW is hard to produce but easy to verify?
• Can I map PoW/PoB/PoS/PoET to their scarce resource or assumption?
• Can I give one benefit and one limitation for each mechanism?
• Can I explain why consensus weight cannot simply equal node count on a public network?

Key takeaways

• Consensus selects valid ledger history in a distributed network.
• Bitcoin uses Proof-of-Work, not all four mechanisms in the syllabus.
• PoW buys Sybil resistance through costly computation and has energy/concentration costs.
• PoB burns coins, PoS risks stake, and PoET waits through a trusted execution environment.
• Every mechanism changes the trust and attack assumptions; none is a universal replacement.

Sources

• S. Chandramouli, Asha A. George, Abhillash K. A., and Meena Karthikeyan, Blockchain Technology. Primary extract: Ch. 2 §2.4.3 “Consensus Algorithms” (lines 1410–1493), including PoW, PoET, and PoS; Ch. 3 §3.5.4 “Token or Coin Burning / Proof-of-Burn” (lines 2038–2054); Ch. 4 §4.4.4 “Proof of Work (PoW) and Hashcash in Bitcoin” through §4.4.4.4 (lines 2748–2865). The source’s historical reward, network, and project-status numbers are intentionally not repeated as current facts; clear OCR corruption has been corrected silently.