Blockchain Fundamentals: How Distributed Ledgers Work

Blockchain is not just a buzzword — it's a carefully engineered data structure that solves a millennia-old problem: how do two parties that don't trust each other agree on a shared truth?

The Double-Spend Problem

Before Bitcoin, digital cash suffered from a fundamental flaw: a digital file can be copied infinitely. If I send you a digital dollar, what stops me from sending the same dollar to someone else? Banks solve this by being a trusted middleman. Blockchain solves it through mathematics and game theory.

The Data Structure: Blocks and Chains

A block is a container holding:

1. A list of transactions (the payload)
2. A timestamp
3. A reference to the previous block (the chain link)
4. A nonce (a number used once, for Proof of Work)
5. The Merkle root of all transactions

The chain forms when each block includes the hash of the previous block. Change one transaction in block #50, and the hash of block #50 changes — which invalidates block #51, which invalidates block #52... all the way to the tip. This is what makes it immutable.

Hash Functions: The Cryptographic Glue

A cryptographic hash function (like SHA-256) maps any input to a fixed-size output:

Key properties:

• Deterministic: same input always gives same output
• One-way: you can't reverse it to find the input
• Avalanche effect: one bit change completely changes the output
• Collision-resistant: practically impossible to find two inputs with the same hash

Merkle Trees: Efficient Verification

Instead of hashing all transactions sequentially, blockchains use a Merkle tree — a binary tree where:

• Leaf nodes = hashes of individual transactions
• Parent nodes = hash of their two children
• Root = single fingerprint of ALL transactions

Why this matters: To prove that TxC is in the block, you only need to share H(D), H(AB), and the root — not all transactions. This is the foundation of SPV (Simplified Payment Verification) in light clients.

Consensus: How the Network Agrees

Thousands of nodes hold copies of the ledger. When new transactions arrive, how do they all agree on which block to add next?

Proof of Work (PoW)

Miners compete to find a nonce such that SHA-256(block_header + nonce) < target_difficulty. This requires astronomical computation — and adjusts every 2016 blocks to maintain ~10 min block times.

Why it works: Cheating requires 51% of global hash power. Economically irrational — the cost of attack exceeds the potential gain.

Proof of Stake (PoS)

Validators lock up (stake) capital. The protocol randomly selects validators weighted by stake to propose and attest blocks. Misbehavior results in slashing (losing staked funds).

Ethereum's move to PoS in the 2022 Merge reduced energy consumption by ~99.95%.

The Network Layer: P2P Propagation

When you broadcast a transaction:

1. Your node sends it to 8–12 peers
2. Each peer validates and forwards to their peers
3. The transaction floods the network in ~2–4 seconds globally
4. Miners/validators include it in the next block

This gossip protocol ensures every node converges on the same state without any central coordinator.

Finality: When Is a Transaction "Done"?

---

Further Reading

• Bitcoin Whitepaper — Satoshi Nakamoto (2008)
• Ethereum Yellow Paper — Gavin Wood (2014)
• Mastering Bitcoin — Andreas Antonopoulos

Key Takeaway: Blockchain replaces institutional trust with mathematical proof. Every property — immutability, transparency, censorship-resistance — flows directly from the cryptographic primitives described above.