Blockchain explained
Series
Blockchain explained
Edition
November 2026

Blockchain explained

A blockchain is built from a few simple ideas stacked on each other. Each lesson explains one of them in a few minutes and gives you something to change, so you can see the consequence for yourself. Everything is computed in your browser.

Start with lesson 01

Lessons

  1. 01

    Hashing: a fingerprint for any data

    A hash function turns any data into a short, fixed-size fingerprint. Change one character and the fingerprint changes completely: that is how a blockchain notices tampering.

  2. 02

    Blocks and the chain: tampering shows

    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.

  3. 03

    Mining: Proof Of Work

    To add a block, a miner must find a nonce that gives the block a hash of a required shape. There is no shortcut, only trying, and that is what makes rewriting history expensive.

  4. 04

    Merkle trees: one hash for many transactions

    A Merkle tree hashes transactions in pairs, then pairs of pairs, up to a single root. A handful of hashes is enough to prove that one transaction is in a block.

  5. 05

    Digital signatures: who may spend

    A private key signs and the matching public key verifies. A signature proves that the holder of the key approved exactly that message, without revealing the key.

  6. 06

    Consensus and the 51% attack

    Nodes follow the chain with the most accumulated work. An attacker with less than half of the computing power falls behind, and every confirmation makes catching up less likely.