Skip to content
Finance Lessons

Crypto, From Scratch

What a Blockchain Actually Is

How total strangers agree on who owns what with no bank in charge — ledgers, blocks, hashing and the chain, explained from zero with a tamperable interactive chain.

9 min Updated May 31, 2026

You’ve probably heard the word blockchain shouted from rooftops, stitched into ads, and blamed for everything from get-rich-quick schemes to melting glaciers. Strip away the hype and a blockchain is a surprisingly down-to-earth invention: it’s a way for a crowd of strangers who don’t trust each other and have no boss to nonetheless agree on a single shared record of who owns what. No bank. No referee. No “trust me.” Just a clever arrangement of lists, fingerprints and copies. By the end of this lesson you’ll be able to explain the whole thing to a skeptical relative — and poke holes in the most common myths about it.

The Problem: Agreeing With No One in Charge

Before you read — take a guess

Guess before reading: what is the core problem a blockchain is designed to solve?

Picture how money normally works. When you pay a friend, you don’t actually hand them anything — your bank quietly subtracts from your balance and adds to theirs. The bank is the trusted central party: the single authority everyone agrees to believe about who owns what. It keeps the official record, and if it says your balance is zero, your balance is zero.

That works fine — until you ask: what if there’s no bank? What if a scattered crowd of strangers across the planet, none of whom trust each other and none of whom is in charge, want to agree on who owns which coins? Whoever holds the official record could cheat — quietly erase a payment, or spend the same coin twice. You need a record that no single person controls and that nobody can secretly rewrite.

Here’s the analogy to hang everything on: imagine a shared notebook sitting in the town square. Anyone can read it. Anyone can add a new line to the bottom. But there’s a magic rule — nobody can erase or change a line that’s already written. Everyone keeps their own photocopy and checks it against the others. That impossible-sounding notebook is, in spirit, exactly what a blockchain is.

Warning:

Myth #1: “Blockchain means Bitcoin”

Bitcoin is a blockchain — the first famous one — but “blockchain” is the general idea, like “spreadsheet” versus “that one budget file.” Ethereum, and thousands of others, are all blockchains too. Bitcoin is one application of the idea, not the idea itself.

The Ledger: An Append-Only List

The notebook in our analogy has a proper name: a ledger. A ledger is just a list of transactions — “Alice paid Bob 5 coins,” “Bob paid Carol 2 coins,” and so on, in order. Banks have kept ledgers for centuries; the blockchain’s twist is how the ledger is maintained.

The defining property is that it’s append-only: you can add new entries to the bottom, but you can never go back and edit or delete an old one. This is called immutability — once something is written, it stays written, forever.

Why is that such a big deal? Because the ability to quietly rewrite history is exactly how cheating happens. If you could sneak back and delete the line “I paid Bob 5 coins,” you’d get your coins back and Bob would be robbed. An append-only ledger slams that door shut: the only legal move is to write a new line at the bottom. History accumulates; it never gets edited away.

You don’t erase it — you write a new correcting entry. If Alice fat-fingers a payment, the fix isn’t to delete the bad line (that’s forbidden); it’s to add a fresh transaction that sends the money back. The mistake stays visible in the history forever, and the correction sits right below it. Append-only means the full story is always there, warts and all.

Blocks: Transactions Batched Together

Writing every single transaction onto the ledger one at a time would be chaotic — like a thousand people all trying to scribble in the notebook at once. So instead, transactions are gathered up in batches. Each batch is a block.

Think of a block as a page in the notebook rather than a single line. A page collects a bunch of transactions that happened around the same time, and it gets two extra things stamped on it:

  • The contents — the list of transactions on that page.
  • A timestamp — roughly when the page was finalized, so the order of pages is clear.

New transactions wait in line, get bundled into the next block, and that block gets added to the bottom of the pile. The ledger, then, isn’t a loose stack of lines — it’s an ordered sequence of blocks, each one a sealed page of history. (You can already feel where the word block-chain is heading.)

Sort each item by whether it lives inside a single block, or describes the ledger as a whole.

Place each item in the right group.

  • A batch of transactions bundled together
  • A timestamp marking when the batch was sealed
  • A list of individual payments grouped onto one page
  • The rule that nothing already written can be changed
  • An append-only sequence of many blocks

Hashing: A Fingerprint for Data

Now for the piece of magic that makes immutability actually enforceable. It’s called a hash.

A hash is a fixed-size fingerprint of some data. You feed in anything — a sentence, a whole block of transactions, an entire library — and a hash function spits out a short, fixed-length code that stands in for it. Same input, same fingerprint, every single time.

Two properties make hashes almost spookily useful:

  1. The avalanche effect. Change the input by the tiniest amount — flip a single letter, add one space — and the fingerprint comes out wildly, unrecognizably different. There’s no “small change makes a small change.” Any edit, however microscopic, scrambles the whole fingerprint.
  2. One-way only. You can easily go from data to its fingerprint, but you can’t run it backwards — a fingerprint won’t let you reconstruct the original data. It’s a blender: smoothie out, never the fruit back.

The everyday analogy: a hash is like a tamper-evident seal on a jar. The seal is quick to check and it’s unique to what’s inside. You can’t un-seal-and-reseal without it being obvious, and the seal alone tells you nothing about the recipe. Crucially, a hash doesn’t hide the data (the transactions are still right there in plain sight) — it just makes any change to that data instantly detectable.

Info:

Hashing is not encryption

These get mixed up constantly. Encryption scrambles data so only someone with a key can read it — it’s about secrecy, and it’s reversible with the key. Hashing makes a fingerprint you can’t reverse — it’s about integrity, proving data hasn’t changed. A public blockchain leans on hashing, not encryption: the data stays visible to all, but becomes tamper-evident.

Fill in each blank to describe what a hash does.

Pick the right option for each blank, then check.

A hash is a fixed-size of data. Changing the input even slightly produces a output, and you run the function backwards to recover the original. Hashing protects , not secrecy.

The Chain: Each Block Locks In the Last

Here’s where blocks and hashes click together into something powerful — and where the “chain” finally shows up.

Each block stores a copy of the previous block’s hash inside itself. So block B carries A’s fingerprint, block C carries B’s fingerprint, and so on down the line. The blocks aren’t just a pile of pages — they’re linked, each one pointing back at the one before it.

Now watch what happens if a cheater tries to rewrite an old block. The moment they edit its contents, that block’s own fingerprint changes (avalanche effect — remember, any edit scrambles it completely). But the next block still carries the old fingerprint. The two no longer match — the link is visibly broken. To cover it up, the cheater would have to redo the next block too, which changes its fingerprint, which breaks the link to the block after that… and so on, cascading all the way to the end of the chain. Tampering with one old block means redoing every block built on top of it.

That cascade is the whole trick. It’s why blockchain history is, for practical purposes, immutable — not because editing is impossible, but because editing one thing forces you to redo everything after it, in plain view of everyone watching.

Try it yourself. Tamper with a block below — click “Tamper” on any block, especially an early one — and watch the break ripple down through every block that came after it. Then re-mine the chain to repair it:

Each block locks in the one before it

Chain valid — every block matches the one before it.

A block stores a fingerprint of its own contents and a copy of the previous block’s fingerprint. Change one block and its fingerprint shifts, so the next block’s stored copy no longer matches — and the break cascades down the whole chain.

You tamper with the second block in a long chain. What happens to the blocks after it?

Decentralization & Consensus: Many Copies, One Truth

So a single chain is tamper-evident. But there’s one loose end: where does this chain actually live? If it sat on one company’s server, that company could just… overwrite the whole thing. We’d be right back to trusting a central party.

The answer is decentralization. Instead of one master copy, the entire chain is replicated across thousands of computers — called nodes — scattered around the world. Every node keeps its own full copy and constantly compares notes with the others. There’s no headquarters to raid, bribe, or shut down.

But many independent copies raise a question: when a new block of transactions appears, how does the whole network agree to add the same block, in the same order? They follow a shared rulebook called a consensus mechanism — a procedure for the network to agree on one official version of the chain. The key idea (for now, just the intuition): the honest majority wins. As long as most of the network plays by the rules, no lone bad actor can force their rewritten history on everyone else — they’d be outvoted by all the honest copies.

There are different consensus rules — you may have heard the names proof-of-work and proof-of-stake, two different “ways to agree” on who gets to add the next block. We’ll dig into how each one actually works in a later lesson; for now, just know they exist and that their job is to keep a decentralized crowd honest.

Warning:

Two more myths to bust

  • “The data is encrypted / private.” A public blockchain is the opposite of secret — anyone can read every transaction. It’s transparent and tamper-evident, not hidden. (See the hashing-vs-encryption box above.)
  • “It’s stored in one place.” No master copy exists. The ledger is replicated across many independent nodes, which is exactly what makes it so hard to shut down or rewrite.

Connect every term on the left to its correct description.

Pick a term, then click its definition.

Putting It Together

Six ideas, one machine. A ledger is an append-only list; transactions get batched into blocks; each block’s contents get a hash (a fingerprint); each block stores the previous block’s hash to form the chain; and the whole thing is copied across many nodes that agree via consensus. Chunk it into one picture:

Big picture

What a blockchain is

  • What a blockchain is
    • The record
      • Ledger — an append-only list of transactions
      • Immutable — you add, you never erase
      • Blocks — transactions batched + timestamped
    • What locks it
      • Hash — a fingerprint of data
      • Any tiny change → wildly different fingerprint
      • Chain — each block stores the previous hash
      • Tampering cascades and breaks every later block
    • Who keeps it
      • Nodes — many computers, each a full copy
      • Consensus — the rule to agree on one chain
      • Honest majority wins; no central party
The six building blocks — from the append-only ledger up through hashing, the linked chain, and the decentralized network that agrees on one shared copy.

A mixed recap — it pulls from everything above:

Question 1 of 50 correct

What core problem does a blockchain solve?

Check your answer to continue.

Key Takeaways

Success:

What to remember

  • A blockchain solves agreement without a boss — it lets strangers share one record of who owns what, with no bank or referee. The mental model: a shared notebook anyone can read and append to, but nobody can erase.
  • A ledger is an append-only list of transactions. You can only add at the bottom; you never edit history. That immutability is what blocks cheating.
  • Blocks batch transactions together with a timestamp — pages in the notebook rather than single lines.
  • A hash is a one-way fingerprint of data. Any tiny change produces a wildly different fingerprint, and you can’t reverse it. Hashing is about integrity, not secrecy — it is not encryption.
  • The chain links blocks by having each one store the previous block’s hash. Tamper with an old block and the break cascades through every block after it — that’s what makes history effectively immutable.
  • Decentralization + consensus keep it honest: many nodes each hold a full copy and agree on one chain via a shared rule (proof-of-work, proof-of-stake — covered later), so the honest majority wins and no single party can rewrite history.
  • Myths busted: blockchain ≠ Bitcoin, the data isn’t encrypted (it’s transparent and tamper-evident), and it isn’t stored in one place.

You now understand the shared notebook itself. But there’s a glaring question we dodged: if the ledger just says “Alice paid Bob,” what stops me from writing a line that spends Alice’s coins? The answer is keys and wallets — the cryptographic signatures that prove who actually owns the coins — and that’s exactly where we head next.

Mark lesson as complete