This Is Not Your Bank's Database
Every database you have ever used — your bank's ledger, a hospital's records, a government registry — can be edited. A row can be changed. A record can be deleted. A balance can be quietly revised. The people who control the servers control the truth. This is the fundamental assumption behind every centralized information system ever built.
Bitcoin's timechain is built on the opposite assumption: that history should be permanently and verifiably unalterable. Every block committed to the chain encodes not just transactions, but a cryptographic commitment to every block that came before it. To change a single transaction in block 500,000, you would need to recalculate that block's proof of work — and then every one of the 449,000 blocks that came after it — faster than the entire honest network keeps adding new blocks. It is not just difficult. It is economically irrational.
And it is worth noting what Satoshi actually called this thing. In the original Bitcoin whitepaper, the word "blockchain" does not appear. Satoshi described a chain of "timestamp server" outputs — a sequence of cryptographic proofs, each one stamping the moment in time when a set of transactions became permanent. Some call it the timechain. It is the more accurate name.
"The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work."
— Satoshi Nakamoto, Bitcoin Whitepaper (2008)
Each block contains a Unix timestamp — the number of seconds elapsed since January 1, 1970. This timestamp is not just metadata. It is part of the block header, and therefore part of the hash, and therefore part of the chain. The chain is not merely a sequence of data. It is a sequence of mathematically proven moments in time. Every ten minutes, the entire world's network of Bitcoin nodes collectively agrees: this happened, at this time, and no one can say otherwise.
Inside a Bitcoin Block
Every Bitcoin block has two parts: a compact 80-byte header that summarizes everything, and the transaction data that follows. The header is what gets hashed by miners. The transactions are what actually move value. Understanding both is understanding Bitcoin.
The block header contains exactly six fields. Each one is load-bearing. Remove or alter any one, and the entire block becomes invalid, and every block built on top of it becomes invalid too. This is the chain.
Header Size
Fields
Hash Output
Space
The coinbase transaction is the first transaction in every block and the only one with no inputs. It creates fresh Bitcoin out of nothing — currently 3.125 BTC per block, set by the protocol — plus collects all transaction fees from the other transactions in the block. This is how miners get paid, and how new Bitcoin enters circulation.
The previous block hash is the link in the chain. To build a valid block, you must include the exact hash of the most recent accepted block. This creates the chain structure: each block cryptographically references the one before it, going all the way back to the Genesis Block of January 3, 2009.
The Merkle Root: A Fingerprint of Everything
A block might contain 2,000 transactions. The block header is only 80 bytes. How does the header prove that all 2,000 transactions are exactly what they claim to be? Through a structure called the Merkle tree — one of the most elegant ideas in Bitcoin's architecture.
Every transaction in a block is hashed. Then those hashes are paired up and hashed together. The resulting hashes are paired and hashed again. This continues — layer by layer — until a single hash remains. That final hash is the Merkle root, and it goes in the block header. Change even one byte in any transaction and the Merkle root changes completely, making the block invalid.
This structure enables a powerful capability called a Merkle proof. To prove that TxA is in a block, you don't need to download all 2,000 transactions. You only need Hash(TxB) and Hash(CD) — a logarithmic number of hashes. You can reconstruct the path from TxA to the Merkle root yourself and verify it matches the header. This is how lightweight wallets (SPV — Simple Payment Verification) work: they trust the headers and use Merkle proofs to verify individual transactions without storing the full blockchain.
Efficient
Verify a specific transaction is in a block using only a handful of hashes — not the full block data.
Tamper-Evident
Change any single transaction in the block and the Merkle root changes. The block becomes instantly invalid.
Compact
Just 32 bytes in the block header represent a complete, unforgeable fingerprint of thousands of transactions.
Provable
Merkle proofs let lightweight wallets verify transactions cryptographically without trusting any third party.
SHA-256: The Cryptographic Backbone
Every hash in Bitcoin — every block hash, every transaction ID, every Merkle computation — is produced by a function called SHA-256 (Secure Hash Algorithm, 256-bit). It was designed by the NSA, published as a federal standard, and is one of the most analyzed cryptographic functions in history. Satoshi chose well.
SHA-256 is a one-way function. You can feed it anything — a single character, a full novel, an image — and it always produces exactly 64 hexadecimal characters (256 bits, 32 bytes). Same input always gives the same output. But even a one-character change to the input produces a completely unpredictable, entirely different output. This is called the avalanche effect.
SHA-256("SATOSHJ") → a91f4b3c8d70...
One letter changed. Half the output bits flipped. No pattern. No prediction. No reverse.
Bitcoin uses double SHA-256 (SHA256d): the output of one SHA-256 computation is fed into a second SHA-256 computation. This provides extra security against a class of attacks called length extension attacks, where knowing H(message) could otherwise help an attacker compute H(message + extension) without knowing the message itself. Double hashing closes this vulnerability.
Proof of work is built on SHA-256. Miners take the 80-byte block header, change the nonce field by one, and hash it again. They are looking for a hash that starts with enough leading zeros to satisfy the current difficulty target. With a 32-bit nonce (~4 billion possible values), modern miners exhaust the nonce space in milliseconds and must change other fields to keep searching. At the current network hash rate of approximately 1.020 zettahashes per second, the global network performs over one quintillion hash computations per second in this search.
The difficulty target adjusts every 2,016 blocks (~2 weeks) to keep the average block time near 10 minutes. If blocks come faster than expected, difficulty increases. If slower, it decreases. The system is self-calibrating, requiring no administrator.
The Mempool: Where Transactions Wait
When you send Bitcoin, your transaction does not go directly into a block. It goes into the mempool — the memory pool — a holding area maintained independently by every full node on the network. The mempool is not a single database. Every node has its own version, though they are largely similar because they all receive the same broadcast transactions.
The mempool is a waiting room. Transactions sit there until a miner decides to include them in the next block. Miners are economically rational: they select transactions that pay the highest fees first, measured in satoshis per virtual byte (sat/vbyte). A virtual byte accounts for the weight of witness data introduced by SegWit. The higher your fee rate, the faster your transaction gets picked up.
Mempool Size
Low Priority
Unit
(1 Block)
During congestion events — when usage spikes and more transactions are broadcast than can fit in a block — fees can rise dramatically. During quiet periods, you can often move Bitcoin globally in under 10 minutes for less than a cent in fees. The fee market is self-regulating: high fees cause users to wait or batch transactions, reducing demand, which brings fees back down.
Replace-By-Fee (RBF) is a mechanism that lets you replace an unconfirmed transaction with a new version paying higher fees. If you sent a transaction with a fee that's too low and the mempool is congested, RBF lets you bump the fee without your original transaction ever confirming. It is opt-in and clearly signaled in the transaction data.
UTXOs: How Bitcoin Tracks Ownership
This is the most important and most commonly misunderstood concept in Bitcoin. Most people assume Bitcoin works like a bank account: you have a balance, and transactions add or subtract from it. Bitcoin does not work this way at all.
Bitcoin has no accounts. It has no balances. It has Unspent Transaction Outputs — UTXOs. Each UTXO is a discrete, specific amount of Bitcoin sitting at a specific address, created by a specific previous transaction. Think of each UTXO as a physical coin or banknote. It exists as a complete unit. You cannot spend part of it. You must spend the whole thing, and if you spend more than you want to send, you create change.
Your Bitcoin "balance" in any wallet is simply the sum of all UTXOs that your private keys can unlock. The wallet scans the blockchain for UTXOs assigned to your addresses and adds them up. There is no account balance stored anywhere. There is only the UTXO set — a shared record of every unspent output in Bitcoin's history.
When you send Bitcoin, here is what actually happens at the transaction level: your wallet selects one or more UTXOs as inputs, creates new UTXOs as outputs (one going to the recipient, usually one returning change to you), and the difference between inputs and outputs becomes the miner fee. The old UTXOs are consumed and cease to exist. The new UTXOs are created.
Input: 0.5 BTC UTXO (consumed — gone forever)
Output 1: 0.3 BTC → recipient's address (new UTXO created)
Output 2: 0.195 BTC → your change address (new UTXO created)
Fee: 0.005 BTC → absorbed by miner (not a UTXO)
Imagine your wallet as a pocket of physical coins. You cannot break a coin in half at the register — you hand over coins totaling more than the price and receive change. UTXOs work exactly the same way. This model is more complex than account balances, but it is more private (fresh addresses every transaction), more parallelizable (UTXOs are independent of each other), and more auditable (every satoshi in existence can be traced to its origin).
No Double-Spend
Each UTXO can only be referenced once as an input. The moment a transaction is confirmed, that UTXO is consumed. Attempting to spend it again fails validation on every node.
Privacy
You can generate a fresh receiving address for every transaction. Each payment creates new UTXOs, making it harder to link transactions to a single owner.
Parallelism
UTXOs are independent. Multiple transactions spending different UTXOs can be validated simultaneously, enabling efficient processing.
Simplicity
There are no accounts, no complex state. Only a set of coins and the cryptographic conditions needed to spend them. Elegant and auditable.
The UTXO set is stored in RAM by full nodes for rapid validation. Every incoming transaction is checked against it: do these inputs exist? Are they unspent? Are the signatures valid? If yes, the transaction is valid. If no, it is rejected. No historical lookup required.
How You Prove You Own Your Bitcoin
Every UTXO has a locking script — a set of conditions encoded in the output that must be satisfied before anyone can spend it. This script is called the scriptPubKey. To spend a UTXO, you provide an unlocking script (scriptSig, or for SegWit transactions, witness data) that satisfies those conditions. The Bitcoin scripting system evaluates the combination and determines whether the spend is valid.
The most common condition is straightforward: provide a valid digital signature using the private key that corresponds to the public key (or address) specified in the locking script. This is how Bitcoin proves ownership without passwords, without databases, without any authority.
Bitcoin originally used ECDSA — Elliptic Curve Digital Signature Algorithm. Your 256-bit private key, through elliptic curve mathematics, produces a public key. The public key, through hashing, produces your address. This is a one-way process: you can derive the address from the private key, but not the private key from the address. The private key signs the transaction data, producing a unique signature that proves you authorized the spend. Anyone on Earth can verify the signature is valid using only your public key — no private key required, ever.
1xxx addresses
3xxx addresses
bc1q... addresses
bc1p... addresses
In November 2021, the Taproot upgrade activated Schnorr signatures as an alternative to ECDSA. Schnorr signatures are more efficient and enable key aggregation: multiple parties can combine their public keys and produce a single signature that looks identical to a single-party signature. A multisig transaction involving 5 people becomes indistinguishable from a standard single-key spend, improving both privacy and efficiency. This is the foundation of advanced Bitcoin protocols like Lightning, multisig wallets, and complex smart contracts that hide their complexity on-chain.
From Wallet to Block: A Transaction's Journey
Every confirmed Bitcoin transaction followed the same path: from a wallet decision, through the peer-to-peer network, into the mempool, through a miner's selection process, and finally into a block that becomes permanent history. Here is that journey, step by step.
UTXO Selection
You decide to send 0.1 BTC. Your wallet scans for UTXOs you can unlock, selects those with sufficient total value, and determines a fee rate based on current mempool conditions.
Transaction Construction
The wallet builds the transaction: inputs (references to UTXOs being spent), outputs (recipient address + amount, and your change address), and the fee embedded in the difference.
Signing
Your private key signs the transaction data using ECDSA or Schnorr. The signature proves authorization without revealing the key. The wallet encodes everything into a serialized transaction.
Broadcast
The transaction is sent to 1–8 peer nodes your wallet connects to. Each peer validates the transaction and forwards it to their peers. This gossip propagation is fast and redundant.
Validation at Every Node
Each receiving node independently verifies: do the inputs exist in the UTXO set? Are the signatures valid? Are the inputs unspent? Does the math add up? Bad transactions are dropped.
Mempool Entry
Within 2–4 seconds, the transaction lives in the mempools of thousands of nodes worldwide. It is visible, valid, and waiting. It is not yet confirmed.
Miner Selection
A miner building the next block candidate selects your transaction based on its fee rate. It is added to their block template alongside the coinbase transaction and other high-fee transactions.
Block Found — Confirmed
The miner solves proof of work and broadcasts the block. Every node validates and accepts it. Your transaction is removed from mempools and recorded permanently in the timechain. The UTXOs are spent. New UTXOs exist.
Propagation
Confirmation
Confirmations
After
What "Confirmed" Actually Means
When a transaction enters a block, it has 1 confirmation. When the next block is mined on top of that block, it has 2 confirmations. Each new block adds another confirmation, another layer of proof of work that would need to be undone to reverse the transaction.
Confirmations are votes. Each one represents another 10 minutes of global hash power saying: this transaction is valid, it happened, the history including it is the correct history. The more confirmations, the more work required to rewrite them.
To reverse a transaction buried under 6 confirmations, an attacker would need to secretly build an alternative chain of 6 blocks faster than the honest network builds its own chain — and then release that alternative chain at the right moment to trigger a reorganization. At Bitcoin's current hash rate of approximately 1.020 zettahashes per second, performing this attack even once would require an enormous fraction of the world's ASIC manufacturing capacity running for hours. Economists estimate the cost of a successful 6-block reorg at over $500 million per attempt — and even then, the attacker cannot steal coins. They can only double-spend their own previously sent transactions.
The 100-confirmation rule for coinbase outputs exists as extra protection. A mined block could theoretically be orphaned if a longer chain emerges, which would make the coinbase reward disappear. Waiting 100 blocks before spending ensures the block — and its reward — is so deeply buried it is effectively permanent.
The Bitcoin Timechain Is Genuinely Immutable
Not because a law protects it. Not because a company promises it. Not because regulators mandate it. The Bitcoin timechain is immutable because the economics of attack have been designed to be prohibitive — and they grow more prohibitive with every block.
Every 10 minutes, the chain grows. Every new block adds to the cumulative work required to rewrite history. The honest network keeps building, keeps hashing, keeps extending the chain. An attacker who wants to rewrite a transaction from last year would need to redo not just that block, but every one of the tens of thousands of blocks mined since then — in real time, faster than the honest network keeps adding new ones. It cannot be done without controlling more than half the global hash rate. And even that would not let you steal coins. It would only let you spend your own coins twice.
This is the key insight that Satoshi encoded in the whitepaper's title: Bitcoin: A Peer-to-Peer Electronic Cash System. The "peer-to-peer" is not just about the network topology. It means the trust lives in the math between peers — not in any authority, institution, or promise. The timechain is the world's first object in recorded history that is genuinely immutable at scale.
"Once the CPU effort has been expended to make it satisfy the proof-of-work, the block cannot be changed without redoing the work. As later blocks are chained after it, the work to change the block would include redoing all the blocks after it."
— Satoshi Nakamoto, Bitcoin Whitepaper (2008)
Every ten minutes, a new block is found somewhere on Earth. Every ten minutes, the history of every transaction ever made becomes slightly harder to erase. Every ten minutes, the timechain grows, accumulating proof of work like sedimentary rock — layer upon layer — until the depth of history makes revision not just difficult but effectively impossible.
The chain began on January 3, 2009. The Genesis Block's coinbase message read: "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks." Satoshi was making a point. The old system runs on trust that can be violated. The new system runs on math that cannot.