A wax seal for digital data
Long ago, before envelopes had glue, important letters were sealed with a blob of hot wax pressed by a signet ring. The wax did one clever thing: if anyone pried the letter open and resealed it, the seal cracked and you could see it had been touched. The seal didn't lock the letter — it made tampering obvious.
A cryptographic hash is the digital version of that wax seal. You feed in any data — a sentence, a photo, a whole page of records — and a fixed recipe spits out a short, scrambled string of characters: the data's fingerprint. The same input always gives the same fingerprint. But change even one comma, and the fingerprint comes out completely different — not slightly off, but unrecognizable.
Stamping each block with the one before it
Now picture a notebook of records, written one page at a time. Each page is a block. Here is the trick that makes the whole notebook honest: at the top of each new page, before writing anything else, you copy down the fingerprint of the previous page. That little summary at the top of a page is called its block header.
So every block carries the fingerprint of the block before it. The blocks are no longer a loose pile of pages — they are a chain, each link reaching back and gripping the one behind it. That is literally where the word blockchain comes from.
Block 1 Block 2 Block 3
+-----------+ +-----------+ +-----------+
| prev: ... | | prev: H1 | | prev: H2 |
| data | | data | | data |
| hash: H1 |----->| hash: H2 |----->| hash: H3 |
+-----------+ +-----------+ +-----------+
| | |
fingerprint fingerprint fingerprint
of block 1 of block 2 of block 3Why you can't quietly rewrite the past
Here's where the seals pay off. Suppose a cheat wants to go back and alter a record buried in block 1 — change a number, erase a payment. The moment they edit block 1, its data changes, so its fingerprint changes. But block 2 wrote down the old fingerprint of block 1 in its header. Now they don't match. The seal is cracked.
To hide the crack, the cheat would have to update block 2 with the new fingerprint. But that changes block 2's own fingerprint — which block 3 has already recorded. And block 4 after that. To rewrite one old page, you must secretly redo every page that came after it, all the way to the present, faster than everyone else keeps adding new pages. On a busy network, that is practically impossible.
The receipt that proves you're inside a block
A single block can hold thousands of records. Instead of one fingerprint of the whole pile, those records are fingerprinted in pairs, then the pairs are fingerprinted together, and so on up a little pyramid until just one fingerprint sits at the very top. That pyramid of hashes is a Merkle tree, and its single top fingerprint is what the block header carries.
ROOT (one fingerprint in the header)
/ \
H12 H34
/ \ / \
H1 H2 H3 H4
| | | |
r1 r2 r3 r4 (your record is r3)The lovely payoff: to prove your record `r3` really sits in this block, you don't need all thousand records. You just need a short receipt — a handful of fingerprints along the path up the pyramid — and anyone can recompute their way to the root and check it matches the header. A few fingerprints stand in for the entire block.
What you now know
- A hash is a tamper-evident fingerprint: same data in, same fingerprint out; change anything, and the fingerprint changes completely.
- Each block's header carries the previous block's fingerprint, linking the blocks into a chain.
- Editing an old block breaks every seal after it, so the deep past is effectively frozen.
- A Merkle tree boils a whole block down to one root fingerprint, so a tiny receipt can prove your record is inside.
You now hold the mechanical heart of a blockchain. Next we'll meet the keys that let you sign records as truly yours — so the chain doesn't just remember the past honestly, it also knows who is allowed to write the next page.