How the Blockchain Works

The blockchain is the technology that makes Bitcoin work - and the concept that every other cryptocurrency, DeFi protocol, and Web3 application builds on. It is also one of the most frequently described and least accurately understood technologies in mainstream media. This lesson explains it precisely - what a blockchain actually is, how it stores data, how cryptographic hashing links each block to the previous one, and why the resulting structure is practically impossible to alter. By the end of this lesson, you will be able to explain the blockchain to someone else accurately - which means you understand it better than most people who write about it professionally.

The Ledger Analogy

The best starting point is a simple analogy. Imagine a village where every transaction between residents is recorded in a public ledger. Every time someone transfers money, the transaction is announced loudly to the whole village, and every resident writes it down in their own copy of the ledger. There is no single official copy - every copy is equally valid. To falsify a transaction, you would need to simultaneously change the record in the majority of every resident's ledger - an practically impossible task.

The Bitcoin blockchain is this village ledger - except instead of village residents, there are approximately 15,000 to 20,000 computers around the world. Instead of writing transactions by hand, they record them using cryptographic functions that make falsification detectable and practically impossible.

Blocks and the Chain

Transactions on the Bitcoin network are not recorded one by one - they are batched together into blocks. Approximately every ten minutes, all the recent transactions broadcast to the network are collected, verified, and packaged into a new block. This block is then added to the chain of all previous blocks - creating the blockchain.

Each block contains: a list of verified transactions, a timestamp, a reference to the previous block (its hash), and a unique identifier for itself (its own hash). The reference to the previous block is what creates the chain - each block is cryptographically linked to the one before it.

Cryptographic Hashing

A cryptographic hash function takes any input - a word, a document, an entire block of transactions - and produces a fixed-length output string called a hash. Bitcoin uses the SHA-256 function. Two critical properties make this useful.

First: the same input always produces the same hash. "Hello" always produces the exact same 64-character string. Second: any change to the input - even changing a single letter - produces a completely different hash. "Hello" and "hello" produce radically different outputs. This means a hash is effectively a unique fingerprint of its input data.

Distributed Consensus

Every node on the Bitcoin network holds a complete copy of the entire blockchain - all transactions ever recorded, going back to the genesis block in January 2009. When a new block is proposed, every node independently verifies every transaction in it against the rules of the protocol. Only if the block follows all the rules is it accepted and added to the node's copy of the blockchain.

If two nodes disagree about which block is valid - a situation called a fork - the network follows the longest chain rule: the chain with the most accumulated computational work is the valid one. This ensures that the network always converges on a single agreed-upon version of the truth, even without any central authority.

Why It Cannot Be Altered

Suppose an attacker wanted to alter a transaction that occurred in block 800,000. To do so, they would need to: change the data in block 800,000 (which changes its hash), then recalculate the hash for block 800,001 (which referenced the old hash), then recalculate 800,002, and so on - all the way to the current block. And they would need to do all of this faster than the entire rest of the network is adding new blocks.

With Bitcoin's current network size, this would require controlling more than 50% of the entire network's computing power simultaneously - a 51% attack. The cost of acquiring this computing power far exceeds any possible gain from altering historical transactions. This is not just theoretically secure - it is economically rational to be honest on the network.