Bitcoin Whitepaper — Annotated Guide

# 7. Reclaiming Disk Space

Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree, with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.

> 💡 In plain terms
> A Merkle Tree is a way of summarizing many pieces of data into one short fingerprint.
>
> Imagine you have 1,000 transactions in a block.
> Instead of keeping all 1,000 forever, you:
> 1. Hash each transaction individually → 1,000 hashes
> 2. Pair them up and hash each pair → 500 hashes
> 3. Pair those and hash again → 250 hashes
> 4. Keep repeating until you have just ONE hash: the "Merkle Root"
>
> This single root is stored in the block header.
> It mathematically represents ALL the transactions in the block.
> If any transaction were tampered with, the root would change completely.
>
> The clever part: once a transaction is old enough (spent and buried under many blocks), you can safely delete the detailed transaction data and keep only the root — because the root already proves it existed.
> This is called "pruning," and it keeps the blockchain from growing indefinitely while preserving its integrity.

A block header with no transactions would be about 80 bytes. If we suppose blocks are generated every 10 minutes, 80 bytes × 6 × 24 × 365 = 4.2 MB per year. With computer systems typically selling with 2 GB of RAM as of 2008, and Moore's Law predicting current growth of 1.2 GB per year, storage should not be a problem even if the block headers must be kept in memory.

> 💡 In plain terms
> Satoshi did the math in 2008: even storing every block header (without the full transaction data) only uses about 4.2 MB per year. That's essentially nothing.
>
> The point being made: even as Bitcoin scales over decades, the core data structure (block headers with Merkle roots) is extraordinarily lean. You can verify the integrity of the entire history of Bitcoin from a device with modest storage.

> ⚡ Why It Works vs. Traditional Finance
> Bank databases must store complete records of every transaction forever, for regulatory, audit, and dispute resolution purposes.
> These databases are expensive, proprietary, and accessible only to the institution.
>
> Bitcoin's Merkle Tree structure allows anyone to:
> - Verify a specific transaction belongs to a block WITHOUT downloading the whole block
> - Prune old data to save space WITHOUT losing the ability to verify history
> - Run a lightweight "SPV" client (see Chapter 8) on a phone or small device
>
> The same cryptographic structure that secures the data also makes it efficiently verifiable — no central database administrator required.

Bitcoin Reclaiming Disk Space

// COMMENTS

ON THIS PAGE