The bitcoin white paper explained, section by section, in plain English

In 2008, someone using the name Satoshi Nakamoto published a short paper titled Bitcoin: A Peer-to-Peer Electronic Cash System. It’s only about nine pages long, and much of it is readable without a computer science degree. Yet it laid out almost everything that makes bitcoin work today.

This guide walks through the paper section by section in plain English, with notes on what has changed since and what the paper didn’t say. You can read the original on bitcoin.org.

The abstract: cash without a middleman

The paper opens with its goal: electronic cash that lets one party pay another directly, without going through a financial institution. Digital signatures alone aren’t enough, it says, because a trusted third party would still be needed to stop people spending the same money twice.

Its proposal: a peer-to-peer network that timestamps transactions into a chain secured by proof of work, so the record can’t be changed without redoing that work. As long as honest nodes control most of the computing power, they’ll build the longest chain and outpace attackers.

1. Introduction: the problem with trust

Online payments, the paper argues, rely almost entirely on financial institutions acting as trusted third parties. Because they must mediate disputes, payments can be reversed, which adds costs, makes small payments impractical and forces merchants to ask customers for more information. What’s needed is a system based on cryptographic proof instead of trust.

2. Transactions: a coin as a chain of signatures

The paper defines a coin as a chain of digital signatures: each owner passes it on by signing it over to the next owner’s public key. Anyone can check the chain of signatures. See public keys, private keys and addresses.

The catch is double spending: the recipient can’t tell whether a previous owner already spent the same coin elsewhere. The traditional fix is a central “mint” that checks every transaction, but then everything depends on that company, just like a bank. Bitcoin’s alternative: announce every transaction publicly and agree on a single history of their order.

3. Timestamp server: chaining the history

The building block is a timestamp server: take a hash of a batch of items and publish it. Each new timestamp includes the previous one, forming a chain in which every link reinforces those before it. That’s the “chain” in blockchain. See what is a blockchain?

4. Proof of work: making history expensive to rewrite

To run this without a central publisher, the paper uses proof of work, inspired by Adam Back’s Hashcash. Miners repeatedly change a number in the block until its hash, for example with SHA-256, starts with enough zero bits. That takes a lot of work to find but only a moment to check.

Two key points:

• Changing an old block means redoing its work and all the work after it, then overtaking the honest chain.
• Proof of work makes the vote “one CPU, one vote” rather than one IP address, one vote, which could be faked. The longest chain, with the most work behind it, represents the majority.

The paper also introduces difficulty adjustment: if blocks come too fast, the target gets harder. See bitcoin mining explained.

5. Network: six steps

The paper lists how the network runs: new transactions are broadcast; nodes collect them into blocks; each node works on proof of work; a node that finds it broadcasts the block; others accept it only if every transaction is valid and not already spent; and they show acceptance by building the next block on top of it. If two blocks appear at once, nodes work on the first they saw until one branch becomes longer.

6. Incentive: why miners take part

The first transaction in each block creates new coins for the block’s creator. That rewards nodes for supporting the network and distributes coins without a central issuer. The paper compares it to gold miners spending resources to add gold to circulation, except here it’s computing time and electricity.

Miners also collect transaction fees. Once a predetermined number of coins is in circulation, the reward can move entirely to fees. The paper also argues that a would-be attacker with lots of computing power should find it more profitable to follow the rules than to undermine the system. See the bitcoin halving explained.

7. Reclaiming disk space

Old transactions can be pruned using a Merkle tree, which keeps the block’s hash intact. A block header alone is about 80 bytes, so headers would add up to only about 4.2 MB a year.

8. Simplified payment verification

You don’t need to run a full node to check a payment. A lightweight wallet can keep just the block headers and check that a transaction is included in a block. That’s reliable while honest nodes control the network, but more vulnerable if an attacker overpowers it, so the paper suggests businesses receiving frequent payments run their own nodes.

9. Combining and splitting value

Transactions can have multiple inputs and outputs, so small amounts can be combined and large ones split. Usually there are two outputs: the payment and the change back to the sender.

10. Privacy

All transactions are public, so privacy comes from keeping public keys anonymous: people can see that someone sent an amount to someone else, but not who. The paper compares it to a stock exchange publishing trades without names, and suggests a new key pair for each transaction. It warns that if a key’s owner is revealed, other transactions may be linked to them. Bitcoin.org still recommends a fresh address for each payment.

11. Calculations: why attackers fall behind

The paper models an attacker trying to build a secret, faster chain. Even if they succeed, they can’t create coins out of thin air or take money that was never theirs: honest nodes reject invalid transactions. They could only try to reverse their own recent payment. And the chance of catching up drops exponentially with each new block. That’s why recipients wait for confirmations. See what is a 51% attack?

12. Conclusion

The paper sums up a system for electronic transactions without relying on trust: a peer-to-peer network where nodes vote with their computing power, accepting valid blocks by building on them and rejecting invalid ones by refusing to.

What the paper didn’t say

• 21 million coins. The paper speaks only of a “predetermined number”. The cap is in bitcoin’s software: Bitcoin Core uses 21 million BTC as its maximum amount.
• The halving schedule and exact block reward.
• Ten-minute blocks as a rule: the paper uses 10 minutes only as an assumption in its storage example.
• Price or investment. It’s about payments, not speculation.

NIST’s blockchain overview sums up its influence: the paper contained the blueprint that most modern cryptocurrency schemes follow, with variations, and bitcoin was the first of many blockchain applications. NIST also notes that earlier electronic cash schemes, such as ecash and NetCash, never achieved widespread use.

For what bitcoin became, see what is bitcoin? and bitcoin vs Ethereum.