Bitcoin Whitepaper Abstract

The whitepaper opens by stating its goal: a purely peer-to-peer system for sending money online without needing a bank or payment processor. The key technical challenge it addresses is "double-spending" — stopping someone from fraudulently spending the same digital coin twice.

Bitcoin Whitepaper Introduction

Online commerce depends on banks acting as middlemen to handle disputes. This adds cost, limits small transactions, and requires trust. The whitepaper proposes replacing trust with cryptographic proof — making it mathematically verifiable who sent what to whom, without needing an authority to confirm it.

Bitcoin Whitepaper Transactions

A Bitcoin transaction is a chain of digital signatures. When you spend a coin, you sign it over to the next person using their public key. The history of who owned the coin is verifiable by tracing these signatures back through the chain.

Bitcoin Whitepaper Timestamp Server

To prove a transaction happened at a specific time, the system hashes blocks of transactions and publishes the result. Each new block contains the hash of the previous one, creating an ordered, linked chain of blocks — a blockchain.

Bitcoin Whitepaper Proof-of-Work

To add a block to the chain, a participant (miner) must find a special number that, when combined with the block data and hashed, produces a result below a target value. This is computationally expensive but easy to verify. It makes rewriting history very costly.

Bitcoin Whitepaper Network

Nodes broadcast transactions to the network. Each node builds a candidate block, tries to find a valid proof-of-work, and broadcasts the completed block. The longest valid chain wins. If two nodes complete blocks simultaneously, the network waits and follows whichever chain grows longer next.

Bitcoin Whitepaper Incentive

The first transaction in each block creates new coins rewarded to the node that found the proof-of-work (the miner). This is how new currency enters circulation. Transaction fees provide a secondary incentive once the block reward diminishes over time.

Bitcoin Whitepaper Disk Space

Old transaction data can be pruned using a Merkle Tree structure — only the root hash needs to stay in the block header. This keeps storage requirements manageable as the chain grows.

Bitcoin Whitepaper Simplified Payment Verification

You don't need the full blockchain to verify a payment. A lightweight client can verify that a transaction is included in a block by checking the block headers and a small Merkle proof, trusting the honest majority of the network.

Bitcoin Whitepaper Combining and Splitting Value

Transactions can have multiple inputs and outputs, allowing coins to be combined or split. A typical transaction takes one or more inputs and creates two outputs: one for the recipient and one for change back to the sender.

Bitcoin Whitepaper Privacy

Bitcoin achieves privacy differently from banks. All transactions are public, but the identities behind the addresses are not. The whitepaper recommends using a fresh key pair for each transaction to limit linkability.

Bitcoin Whitepaper Calculations

The final section uses probability theory to show that an attacker controlling less than 50% of the network's computing power has an exponentially decreasing chance of rewriting transaction history the further back they try to go.

Read the original text in the interactive reader →