Blockchain explained
Series
Blockchain explained
Lesson
02 of 06
Edition
November 2026
References
3

Blocks and the chain: tampering shows

Abstract

Each block stores the hash of the block before it. Change an old block and its hash changes, so every block after it stops matching.

Key points

  1. A block groups data with a header, and the header includes the hash of the previous block.
  2. Changing old data changes that block’s hash and breaks the link from the next block, and from every block after it.
  3. To hide the change, every following block would have to be redone. Lesson 3 shows why that is expensive.

LimitsWhere this toy model differs from the real system: Limits

A block is data plus a header

A block collects a batch of records; in Bitcoin, transactions. Its header carries, among other fields, the hash of the previous block’s header and a number called the nonce. The hash of the header is what identifies the block.

In the widget, each block’s hash covers four things written one after the other: its number, the previous hash, the nonce and the data (number|previous hash|nonce|data).

The chain is made of hashes

Because each block contains the previous block’s hash, the blocks form a chain: block 3 points to block 2, which points to block 1. Change anything in block 2 and its hash changes. Block 3 now carries a different previous hash, so its own hash changes as well, and so on to the end of the chain.

Figure 1Try it: Four blocks in a chain

Difficulty: each hash must start with 000

  1. Block 1Valid

    Alice pays Bob 5

    Nonce
    6494
    Previous hash
    00000000000000…
    Hash
    000c7fa918b513…
  2. Block 2Valid

    Bob pays Carol 2

    Nonce
    4628
    Previous hash
    000c7fa918b513…
    Hash
    000602efd00756…
  3. Block 3Valid

    Carol pays Dan 1

    Nonce
    4498
    Previous hash
    000602efd00756…
    Hash
    000548890d2df7…
  4. Block 4Valid

    Dan pays Erin 3

    Nonce
    711
    Previous hash
    000548890d2df7…
    Hash
    00029da450449a…

Chain valid

This widget needs JavaScript. The text of the lesson explains the same idea without it.

Edit the data of block 2: that block and every block after it turn hatched and are marked Broken. Press “Mine” on block 2 and it becomes valid again, but block 3 is still broken, because the previous hash it contains has changed. Repairing history means redoing every block that came after.

Valid means “the work was done”

In this toy chain a block is valid when its hash starts with 000. The nonce is the number that was changed until that happened: this is proof of work, the subject of the next lesson. Without it, recomputing all the hashes would take a fraction of a second and the chain would protect nothing.

The idea of linking records through their hashes is older than Bitcoin: it comes from research on digital time-stamping by Haber and Stornetta in 1991, which the Bitcoin whitepaper cites.

Limits

Sources

Primary sources this lesson is based on.