Vol. 1 — June 2026
L1 LIBRARY

Built from MIT curriculum · Every chain. Explained.

L1
CONCEPT · CONSENSUS

Proof of Work

A consensus mechanism where miners repeatedly hash block data with a varying nonce until they find a hash with the required number of leading zeros — proving they expended real computation. The longest-chain rule resolves forks.

Last updated: June 10, 2026

Why It Matters

Proof of Work is the original solution to a fundamental problem: how do you get strangers on the internet to agree on a shared ledger without trusting anyone? Before PoW, digital money couldn’t work because there was no way to prevent someone from spending the same coin twice without a central authority keeping score.

PoW makes cheating expensive. To rewrite Bitcoin’s history, an attacker would need more computing power than the rest of the network combined — a cost measured in billions of dollars and megawatts of electricity. That cost is the security.

The tradeoff is real: Bitcoin’s network consumes energy comparable to a small country. This is the central tension that led to alternative mechanisms like Proof of Stake. Whether the energy cost is justified depends on whether you think a trustless, censorship-resistant monetary network is worth powering.

How It Works

Beginner

Think of it like a lottery that runs every 10 minutes. Thousands of computers around the world race to solve a math puzzle. The puzzle is simple to check but hard to solve — like a combination lock where you have to try billions of combinations. The first computer to find the answer gets to add the next page to the shared ledger and earns new bitcoin as a reward.

Intermediate

Miners take a block of pending transactions, combine them with the previous block’s hash and a random number (the nonce), and run it through SHA-256. If the resulting hash starts with enough zeros (determined by the difficulty target), the block is valid. If not, they increment the nonce and try again. On average, the network performs ~600 quintillion hashes per second to find one valid block.

The difficulty adjustment recalibrates every 2,016 blocks (~2 weeks) to maintain a 10-minute average block time, regardless of how much computing power joins or leaves the network.

Builder

The core loop: SHA256(SHA256(block_header)) where block_header includes version, previous block hash, Merkle root of transactions, timestamp, difficulty bits, and nonce (32-bit). When the 32-bit nonce space is exhausted, miners modify the coinbase transaction’s extraNonce field, which changes the Merkle root, creating a fresh nonce search space.

Key parameters (Bitcoin mainnet, 2024): block reward = 3.125 BTC (post-fourth halving), difficulty retarget every 2,016 blocks, target block time = 600 seconds, max block weight = 4M weight units.

Examples

Chains using Proof of Work:

  • Bitcoin — The original PoW implementation. SHA-256 mining, 10-minute blocks.
  • Litecoin — Scrypt-based PoW, 2.5-minute blocks. Designed as “silver to Bitcoin’s gold.”
  • Dogecoin — Merged-mining with Litecoin (Scrypt). Originally a meme, now a top-20 chain.
  • Bitcoin Cash — SHA-256, larger block size (32MB). Forked from Bitcoin in 2017.
  • Monero — RandomX PoW, designed to resist ASIC mining and preserve CPU-mining accessibility.
  • Ethereum Classic — Ethash PoW. Continued after Ethereum moved to PoS in the Merge (2022).

Tradeoffs

Strengths

  • Battle-tested security — Bitcoin has operated continuously since 2009 with no successful 51% attack on the main chain.
  • True decentralization of issuance — Anyone with hardware and electricity can mine. No stake requirement.
  • Thermodynamic finality — The cost to rewrite history grows exponentially with each confirmation.
  • Simple to verify — Checking a proof is trivial; producing one is expensive. This asymmetry is the mechanism.

Limitations

  • Energy consumption — Bitcoin mining uses ~150 TWh/year (comparable to a mid-size country). This is a feature to proponents and a bug to critics.
  • Mining centralization — Despite the design intent, ~3 mining pools control the majority of Bitcoin hashrate.
  • Low throughput — Bitcoin processes ~7 transactions per second on the base layer. Scaling relies on Layer 2 solutions.
  • Fork latency — Merchants typically wait 6 confirmations (~1 hour) for high-value transactions.

Main alternative: Proof of Stake — replaces energy expenditure with economic stake as the security mechanism.

Sources & Last Updated

  • MIT BLC Module 2: Maintaining Blockchain Integrity (primary source)
  • Nakamoto, S. “Bitcoin: A Peer-to-Peer Electronic Cash System” (2008)
  • Back, A. “Hashcash — A Denial of Service Counter-Measure” (2002)
  • Micali, S. Lecture on consensus mechanism tradeoffs (MIT BLC)

Freshness note: Ethereum’s September 2022 Merge moved it from PoW to PoS. Bitcoin block reward figures updated for the April 2024 halving. Mining pool concentration and hashrate figures should be verified quarterly.

Last updated: June 10, 2026