Level 1 · Start hereThe village#045

Why you can't change the past on a blockchain: you'd have to outrun the whole village

Changing an old block breaks its hash and every link after it. To repair them, a forger would have to redo the proof of work for that block and all later ones, and overtake the honest network. The deeper a block is buried, the less likely that becomes.

Ben paid Anna for a sack of flour three pages ago. He has eaten the bread. Now he'd like the payment to never have happened.

So he takes his copy of the notebook and rewrites the old line. The page's wax seal no longer fits, so he has to make a new one, and making a seal takes a whole night's puzzle. Then the next page, which carried the old seal, doesn't fit either. And the one after. Meanwhile the rest of the village, with far more hands than Ben, closes a new page every evening. Ben is redoing old pages while everyone else adds new ones.

He can't catch up. Nobody forbids him. It's just that the past, on a blockchain, is buried under work, and every new page adds another layer.

What it is

"You can't change the past" doesn't mean a law of nature. It means it costs too much. The Bitcoin white paper says it in one sentence: once the computing work for a block is done, "the block cannot be changed without redoing the work" (Nakamoto, 2008).

And not just that block. "To modify a past block, an attacker would have to redo the proof-of-work of the block and all blocks after it and then catch up with and surpass the work of the honest nodes" (Nakamoto, 2008).

How it works: break one seal and watch

Here is what happens with a real block. You don't need the network for this, just the public header and a few lines of code that anyone can run.

  1. The original. Block 900,000 was added on 6 June 2025. Its 80-byte header is public (mempool.space). Hashed the Bitcoin way, SHA-256 twice (Bitcoin developer reference), it gives 000000000000000000010538edbf... Nineteen zeros up front.
  2. The smallest change. Change one number in the header, the nonce, from 2,455,752,826 to 2,455,752,827. One more. Nothing else.
  3. The new seal. The hash becomes ffbe462c779250b39447... Not a single leading zero. A block's hash must be at or below a target, and this one is miles above it. Every node would reject the page on sight.
  4. The repair job. To fix it, you'd have to keep trying numbers until the seal again starts with enough zeros. For block 900,000, the whole mining network shared that job, at a difficulty mempool.space puts at about 127 trillion (mempool.space).
  5. The pages on top. Then block 900,001 still quotes the old seal, so it has to be redone too. On 18 November 2026 the chain had reached block 976,347 (mempool.space). That's 76,347 pages stacked on top of block 900,000, each needing its own night's puzzle.
  6. The race. And while you redo them, the honest network keeps adding a page about every ten minutes. Nodes follow the chain with the most work: "The majority decision is represented by the longest chain" (Nakamoto, 2008).

The odds, from the white paper

Section 11 of the white paper works out the chance that an attacker ever catches up, depending on their share of the computing power and how many blocks behind they start (Nakamoto, 2008).

  • An attacker with 10% of the power, 6 blocks behind: a probability of 0.0002428, about 1 in 4,000.
  • An attacker with 30%, only 5 blocks behind: 0.1773523, almost 18%. Not small at all.
  • The same 30% attacker, 24 blocks behind: below 0.1%, according to the paper's table.

The paper's summary: "the probability drops exponentially as the number of blocks the attacker has to catch up with increases". Old pages aren't protected by a lock. They're protected by depth.

What even a winner can't do

Suppose someone did gather more computing power than everyone else. The white paper is clear about the limits. It "does not throw the system open to arbitrary changes, such as creating value out of thin air or taking money that never belonged to the attacker." Nodes still reject invalid transactions. "An attacker can only try to change one of his own transactions", to take back money he has just spent (Nakamoto, 2008).

That's Ben's dream: un-paying for the flour. We look at how that attack works in "The 51% attack explained".

Why it matters

  • Old payments are final in practice. A payment buried under thousands of blocks would need thousands of blocks of work to undo.
  • New payments aren't, yet. A block that was added a minute ago has almost no work on top. That's why many exchanges wait for several blocks before they credit a deposit.
  • It's a cost, not a promise. On a small network with few miners, the same maths gives a much cheaper rewrite.
  • People can still choose. In 2010 the network did switch to a corrected chain after a bug, by running fixed software. "Digital scarcity explained" tells that story.

Where people get it wrong

  • "A blockchain can never be changed." It can, at a price, and the price depends on the network's size and how deep the block is.
  • "Hackers can rewrite your balance." Even with most of the power, an attacker can't sign away your coins without your key.
  • "One confirmation is as good as a hundred." The white paper's own table shows the risk falling with every block.
  • "Immutable means correct." A mistaken payment is just as hard to undo as an honest one.

The sting: count the pages on top

When you receive crypto, open the transaction on a block explorer and look for "confirmations". That's the number of pages stacked on top of yours. For a coffee, one is plenty. For a car, ask yourself how many pages a cheater would have to redo, and on how big a network.

The stranger at the gate is always in a hurry to drive off with the car after one confirmation. Funny, that.

Frequently asked questions

Can a blockchain be changed?

In principle yes, in practice it gets harder with every block. Changing an old Bitcoin block means redoing the proof of work for it and every later block, and overtaking the rest of the network. The white paper shows the chance of success falling exponentially with each block.

What is a confirmation?

A confirmation is a block added on top of the block that contains your transaction. One confirmation means your transaction is in a block; each further block adds another layer of work an attacker would have to redo.

Why does changing one block break the chain?

Each block contains the hash of the block before it. Changing anything in an old block changes its hash, so the next block no longer points to it, and the proof of work for the changed block is no longer valid.

Can someone with 51% of the mining power steal my bitcoin?

Not directly. The Bitcoin white paper says an attacker with most of the power can't create coins out of thin air or take money that never belonged to them. They could try to reverse their own recent payments.

How many confirmations are safe?

There's no single number. The white paper's calculations show the risk shrinking with each block and depending on the attacker's share of computing power. Exchanges set their own requirements, often higher for larger amounts.

Sources

  1. Satoshi Nakamoto, Bitcoin: A peer-to-peer electronic cash system (2008)
  2. mempool.space API, raw header of block 900,000
  3. mempool.space API, Bitcoin block 900,000 (6 June 2025)
  4. mempool.space API, block height on 18 November 2026
  5. Bitcoin developer reference, Block chain (block headers)

Read next.