MASTERING-BITCOIN · Unit 13 · Video 5

The Self-Healing Blockchain: Interactive Practice

IKey Concepts Reference

Concept	Rule	Meaning
Block validation	6 independent checks	Syntax, PoW target, timestamp, weight, coinbase, transactions
Coinbase reward	$\text{subsidy} + \text{fees}$	Currently subsidy = 3.125 BTC per block
Fork resolution	Most cumulative work wins	$W_{\text{chain}} = \sum_i \text{difficulty}_i$
Block interval	$\approx 10$ minutes	Balance between fork rate and confirmation latency
Security	$\propto$ total work	Not the count of confirmations

IIVisualization 1: The Six Validation Checks

A new block arrives at your node. Use the controls below to simulate different block properties and see which of the six consensus checks pass or fail. A block is accepted only if all six checks pass.

⚙ interactive visualization — coming to this page format soon

Reflect: Try setting the coinbase payout to 10 BTC while leaving every other check valid. Even with valid proof of work and a perfect timestamp, the block is REJECTED. This is why our cheating miner from the video burns electricity for zero reward — the network's immune system catches the inflated coinbase regardless of how much hashpower was spent.

IIIVisualization 2: Most Cumulative Work Wins (Not Longest Chain)

Two competing chains exist after a fork. Adjust the length and average difficulty of each chain. The chain with the most total work — not the most blocks — wins.

⚙ interactive visualization — coming to this page format soon

Notice: Try setting Chain A to 7 blocks at difficulty 10 and Chain B to 5 blocks at difficulty 20. Chain B is shorter but wins because its blocks were mined during a higher-difficulty epoch (work: 100 vs 70). The phrase "longest chain wins" is a useful shortcut, but the truth is most cumulative work wins.

IVVisualization 3: Why 10 Minutes? The Block Interval Tradeoff

What happens if Bitcoin used a different target block interval? Move the slider and watch two competing curves: the fork rate (wasted work) and the confirmation delay (user experience).

⚙ interactive visualization — coming to this page format soon

Reflect: At very short intervals (say, 0.5 minutes), the fork rate explodes — many blocks are orphaned because they were mined before the previous block fully propagated. At very long intervals (say, 60 minutes), users wait forever for confirmations. 10 minutes is a deliberate compromise: long enough for global propagation, short enough for usable UX.

A subtle but important point: nine 1-minute confirmations represent roughly the same total work as one 10-minute confirmation, so they give roughly the same security — just with more orphan blocks burning hashpower along the way.

VQuiz Questions

Question 1

A miner spends $50{,}000 in electricity, finds a valid proof of work, and broadcasts a block that pays themselves 1000 BTC in the coinbase (current allowed subsidy is 3.125 BTC). All other checks pass. What happens?

✅ Correct! Validation is independent of proof of work. An inflated coinbase fails check #5 regardless of how much hashpower the miner spent.

❌ Not quite. Remember: each of the six checks is independent. Valid proof of work does not override an invalid coinbase amount.

Show solution

Solution:

Block validation requires all six checks to pass independently. Even with valid proof of work, check #5 (coinbase amount within the allowed subsidy) fails when the miner tries to pay themselves more than 3.125 BTC.

Every node on the network applies the same rule. The block is rejected in milliseconds. The proof of work cannot "buy" an invalid coinbase. The electricity is already burned; the reward is zero.

This is the key insight: Bitcoin verifies, it does not trust. Cheating isn't merely disallowed — it's economically self-defeating.

Question 2

Two competing chains exist after a temporary fork:

Chain X: 7 blocks, each mined at difficulty 10
Chain Y: 5 blocks, each mined at difficulty 20

Which chain do nodes follow?

✅ Correct! Work (5 × 20 = 100) beats length (7 blocks). The true rule is most cumulative work wins.

❌ Not quite. Block count is a proxy for work, not the rule itself. Compute total work for each chain (blocks × difficulty).

Show solution

Solution:

Compute cumulative work for each chain:

Chain X work: $7 \times 10 = 70$
Chain Y work: $5 \times 20 = 100$

Chain Y wins because $100 > 70$ , even though Chain X has more blocks.

The popular phrase "longest chain wins" is a useful shortcut, but the real rule is "most cumulative work wins." When difficulty changes across epochs, a shorter chain mined during higher-difficulty periods can outweigh a longer chain of easier blocks.

There is no voting and no central authority. Each node independently sums the work behind every block and follows the heaviest chain.

Question 3

True or False: Nine confirmations on a hypothetical 1-minute-block chain provide significantly more security than one confirmation on Bitcoin's 10-minute-block chain, assuming both networks have the same total hashpower.

✅ Correct! Same hashpower over 9 minutes ≈ slightly less work than the same hashpower over 10 minutes. Confirmation count alone is a poor security metric.

❌ Not quite. Count is misleading. Compute the wall-clock time — 9 one-minute blocks span 9 minutes; 1 ten-minute block spans 10 minutes. With equal hashpower, less time means less work.

Show solution

Solution:

If total network hashpower is the same on both chains, then:

1 block on the 10-minute chain = 10 minutes of total network work
9 blocks on the 1-minute chain = 9 minutes of total network work

So nine fast confirmations actually represent slightly less total work — and thus slightly less security — than one slow confirmation.

Security is proportional to total accumulated work, not the number of confirmations. Faster blocks let you sample security sooner, but they don't raise the ceiling, and they waste more hashpower on accidental forks (orphan blocks).

Block count is theater. Work is the substance.

Question 4

A node sees Block B at height N+1. Later, a longer-work chain extends Block A (a sibling at the same height) with Block N+2. What does the node do, and what term describes this event?

✅ Correct! The node switches to the heavier chain. Block B becomes a stale sibling, and its miner gets no reward. This is a reorg.

❌ Not quite. First-seen is only a tiebreaker when work is equal. Once a competing chain accumulates more work, nodes silently switch — no vote required.

Show solution

Solution:

When a node sees a competing chain with more cumulative work, it abandons its current tip and switches to the heavier chain. This switch is called a reorganization, or reorg.

In this scenario:

The node originally accepted Block B.
A new Block N+2 extends Block A, so the A-chain now has more cumulative work.
The node drops Block B (it becomes a stale sibling), and re-applies the transactions along the A-chain.
Block B's miner loses the reward.

Key properties:

No voting, no leader, no referee.
Most temporary forks resolve within a single block.
Two-block reorgs are possible but rare; deeper reorgs are extremely improbable on Bitcoin.
"First seen" is only a tiebreaker for equal-work chains — it does not override more cumulative work.

VISummary

Bitcoin replaces coordination by authority with verification by everyone:

Every node holds the rulebook. Every node checks every block.
Six independent validity checks reject invalid blocks in milliseconds, regardless of how much hashpower built them.
When two valid blocks compete, the network waits for the next block. The chain with the most cumulative work silently wins; the loser's block becomes stale.
10 minutes is a deliberate balance: long enough for global propagation, short enough for usable confirmations.
Security comes from total accumulated work, not the count of confirmations.

No vote. No leader. No referee. Just rules, work, and time.

Solved: 0 / 4