‹ CHAPTER 9, ALL LESSONS

PATHFINDER · CHAPTER 9 · LESSON 4 OF 5

Mempool, blocks & confirmations

How blocks are chained

Why does changing an old block break everything after it? 4 min

Every header contains the hash of the previous block. That hash covers the previous header, which itself contains the hash of the block before, and so on back to the genesis block of 3 January 2009.

Pull one thread

Suppose someone changes one transaction in a block from last year. Its Merkle root changes, so its header changes, so its hash changes. The next block, which recorded the old hash, no longer points to it. To make the chain whole again, every following block would need a new valid proof of work.

That is why depth is safety. An old block is buried under all the work done since, and redoing that work while the rest of the network keeps adding blocks is out of reach of anyone who does not control most of the hashing power.

▶ SEE IT IN THE MACHINE

On the BLOCKCHAIN rail, each block slides into a slot the previous block opens: the tenon is the previous hash.

What to remember

  • Each header contains the previous block's hash.
  • Changing an old block changes every hash after it.
  • The deeper a block, the more work protects it.

Quick check

Someone alters a transaction in an old block. What breaks first?

Why is a block buried under 100 others very hard to change?