Whitepaper
The Bitcoin Whitepaper and How It Works
On October 31, 2008, Satoshi Nakamoto published a nine-page paper titled "Bitcoin: A Peer-to-Peer Electronic Cash System." This page walks through what problem the whitepaper defined, what solution it proposed, and how that solution actually works on the network, following the structure of the original text.
The structure from Sections 3–4 of the whitepaper. Because a block header includes the prior block's hash, altering past records requires redoing the proof-of-work for everything after it.
The original text has 12 sections. Read in order, the flow is: problem → solution → verification → incentives → probability calculation.
| Section | Title | Gist |
|---|---|---|
| 1 | 1. Introduction | Frames the problem as online payments' reliance on trusted third parties. |
| 2 | 2. Transactions | Defines a coin as a "chain of digital signatures" and raises the double-spending problem. |
| 3 | 3. Timestamp Server | Orders batches of transactions in time and links them by including the prior hash. |
| 4 | 4. Proof-of-Work | Nonce search imposes a cost on recording, using computing power as the majority-vote basis. |
| 5 | 5. Network | Outlines 6 steps for block propagation, validation, and adopting the longest chain in conflicts. |
| 6 | 6. Incentive | Issuance rewards and fees incentivize mining, arguing honest mining is more rational than attacking. |
| 7 | 7. Reclaiming Disk Space | Merkle trees let spent transactions be pruned while block-header integrity holds. |
| 8 | 8. Simplified Payment Verification (SPV) | A lightweight-client method verifying transaction inclusion using only headers and a Merkle path. |
| 9~10 | 9–10. Combining/Splitting Value / Privacy | Explains the input/output combination structure and the practice of using a new address each time for privacy. |
| 11~12 | 11–12. Calculations / Conclusion | Calculates that an attacker's chance of catching up decreases exponentially with confirmations. |
Every 210,000 blocks (~4 years), the reward is cut in half; the sum of this geometric series converges to 21 million. The supply cap is a mathematical consequence of this rule, not a policy choice.
- 2009 (Genesis)50 BTC · 50 BTC/block
- 2012 1st halving25 BTC · 25 BTC/block
- 2016 2nd halving12.5 BTC · 12.5 BTC/block
- 2020 3rd halving6.25 BTC · 6.25 BTC/block
- 2024 4th halving3.125 BTC · 3.125 BTC/block
Concepts that recur when reading the original text, with definitions and examples.
An attempt to use the same coin more than once. It is the central problem for any electronic cash system without a central authority.
Example: If two transactions spend the same UTXO, only whichever one is included in a block first becomes valid.
A process of repeatedly performing computation to find a block hash below a target value. Finding it is hard; verifying it is easy.
Example: A mining rig calculates tens of trillions of hashes per second while searching for a nonce.
An unspent transaction output. A wallet's balance is the sum of the UTXOs it can spend.
Example: Sending 0.2 BTC from a single 0.5 BTC UTXO creates two new outputs: 0.2 and about 0.3 (change).
A data structure that pairs up transactions within a block via hashing to summarize them into a single root hash.
Example: A lightweight wallet can verify that its transaction is included in a block using only the Merkle path.
A variable number included in the block header that is repeatedly changed to try to satisfy the proof-of-work condition.
Example: If every possible nonce is exhausted without a solution, the search continues by changing another value in the header.
The rule that recalculates the target every 2,016 blocks to keep the block interval at about 10 minutes.
Example: If hashpower increases, difficulty rises, keeping the issuance rate the same.
The consensus rule of accepting the chain with the greatest cumulative proof-of-work as canonical.
Example: If two blocks appear at the same time, whichever one gets the next block attached becomes canonical.
An upgrade that tightens the rules in a way that remains compatible with existing nodes.
Example: SegWit and Taproot were both applied as soft forks.
A method of verifying a transaction using block headers and a Merkle path, without downloading the entire blockchain.
Example: This is the basis on which a mobile wallet can confirm a deposit without gigabytes of data.
The problem defined by the whitepaper: double-spending and trusted third parties
The whitepaper's first sentence clearly states its goal: "a purely peer-to-peer version of electronic cash [that] would allow online payments to be sent directly from one party to another without going through a financial institution." Satoshi saw the very structure of internet payments depending on a trusted third party such as a bank or card network as the problem. With a third party involved, fees are added, small payments become impractical, and the possibility of chargebacks pushes merchants to demand more information from customers.
The hardest problem in creating digital money without a third party is double-spending. Because digital data can be perfectly copied, a way is needed to prevent the same coin from being sent to two people at once. Earlier attempts at electronic cash solved this by having a central issuer redeem and reissue every coin, which meant the system disappeared if the issuer disappeared.
The whitepaper's solution is to prove the order of transactions. If a majority of network participants can agree on which transaction happened first, any later transaction attempting to spend the same coin is automatically invalidated. In other words, Bitcoin is not a 'copy-prevention technology' but a 'technology for reaching consensus on chronological order.'
This perspective matters because everything else in the design flows from it. Proof-of-work, the linking of blocks, the longest-chain rule, and mining rewards are all answers to a single question: who determines the order?
The core solution: proof-of-work and the longest chain
Sections 3 and 4 of the whitepaper describe the timestamp server and proof-of-work. Transactions are grouped into blocks, and each block includes the hash of the previous block, chaining them together. Changing a past block would break the hashes of every subsequent block, meaning any tampering would require redoing the computation for the entire chain after that point.
Proof-of-work is the process of repeatedly trying random values for a nonce until a block's hash falls below a specific target. Finding the answer requires enormous computation and electricity, but verification takes only a single hash check. This asymmetry is what 'imposes a cost on the record.'
When a conflict arises, nodes accept the longest chain — more precisely, the chain with the greatest cumulative proof-of-work — as canonical. The crucial point is that the basis for this majority vote is computational effort invested, not the number of accounts or IP addresses. Voting based on IP addresses fails because addresses can be created without limit (a Sybil attack), but computation cannot be forged.
Section 11 of the whitepaper calculates the probability that an attacker could catch up to the honest chain. If the attacker's hashpower is below half of the network's, the probability of a successful reversal converges exponentially toward zero as more blocks are added. This calculation is the basis for the convention of waiting for six confirmations (about one hour).
How transactions are made: UTXOs and digital signatures
Bitcoin has no bank-style 'balance' field. Instead, there is a set of unspent transaction outputs — UTXOs. The balance shown by a wallet is the sum of all UTXOs it can spend with its private key.
Sending funds means taking your held UTXOs as inputs and creating new outputs — one for the recipient's share, and one for the change. The difference between the total input and total output becomes the fee paid to the miner. Because of this structure, wallets receive change at a fresh address each time, which is also tied to privacy practices.
Each input carries the owner's digital signature. Since signing is done with a private key and verification with the corresponding public key, a UTXO cannot be moved without the private key, and no one can recover it if the key is lost. The whitepaper's Section 2 phrase, "a chain of digital signatures," refers to this structure.
Transactions within a block are summarized via a Merkle tree into a single 32-byte root hash stored in the block header. This lets a lightweight node verify that a specific transaction is included in a block without downloading every transaction. Sections 7 and 8 of the whitepaper, on reclaiming disk space and simplified payment verification (SPV), rest on this structure.
The supply rule and incentives: why 21 million
Section 6 of the whitepaper addresses incentives. The miner who creates a block receives both newly issued coins and transaction fees. Early on, the issuance reward gives participants a reason to join the network, and as issuance shrinks, fees are designed to take over that role.
The issuance amount is set by software rules. The block reward is cut in half every 210,000 blocks (about four years), and the sum of this geometric sequence converges to 21 million coins. The reward, which was 50 BTC in 2009, became 3.125 BTC in April 2024. The total supply cap is not a value decided by policy, but a mathematical consequence of the halving rule.
The mechanism that keeps the block interval at about 10 minutes is the difficulty adjustment. Every 2,016 blocks (about two weeks), the actual time elapsed is checked and the target is recalculated. Difficulty rises if hashpower increases and falls if it decreases — so more mining equipment does not speed up issuance.
The whitepaper argues this incentive structure makes honest mining more rational than attacking. If an entity that secures a majority of hashpower tries to roll back the chain, doing so undermines the value of its own held coins and equipment.
What the whitepaper doesn't cover, and what changed afterward
The whitepaper is a nine-page design overview and does not contain every rule of today's network. The 1MB block size limit, the difficulty adjustment period, the details of the scripting language, and address formats were all set later through implementation and consensus.
Major changes since then have been carried out via soft forks. Segregated Witness (SegWit) in 2017 separated signature data to ease capacity and scalability issues, and Taproot in 2021 improved the signature scheme to enhance the privacy and efficiency of smart contracts. The Lightning Network is an attempt to solve, at a second layer, the small-payments problem the whitepaper mentioned.
Debates not covered in the whitepaper have also emerged. The 2017 dispute over increasing block size led to the Bitcoin Cash fork, an event that empirically demonstrated 'how difficult it is to change the rules.' The interpretation that this difficulty in changing rules is a property of the asset, rather than a cost, comes from this episode.
It's worth keeping in mind when reading the whitepaper that it is a technical proposal, not a forecast or an investment document. Price, markets, and its character as an asset were not the paper's subject, and the explanations on this page likewise are not investment advice.
Sources & references
- Bitcoin: A Peer-to-Peer Electronic Cash System (original PDF) ↗
Satoshi Nakamoto's original nine-page whitepaper, published October 31, 2008.
- Korean translation of the Bitcoin whitepaper ↗
The official Korean translation provided by bitcoin.org.
- Bitcoin Developer Guide — Transactions and blockchain structure ↗
Implementation-level explanation of UTXOs, scripts, fees, and more.
- BIP 141 — Segregated Witness ↗
The original specification of the 2017 SegWit soft fork.
- BIP 341 — Taproot ↗
The original specification of the 2021 Taproot upgrade.
- Bitcoin Core — Difficulty adjustment implementation ↗
The code for the 2,016-block-cycle difficulty recalculation.