TERM_DEF // BLOCKCHAIN / CHAINWORK_CUMULATIVE_POW
CHAINWORK (CUMULATIVE
POW)
POW)
Chainwork (Cumulative PoW). A node's estimate of total work in the chain; determines the heaviest chain.
This page sits in the Blockchain section — Chains of blocks, forks, reorgs, and how the network settles on one history. Read on for what it is, why it exists, how it works under the hood, and what to watch out for.
This page sits in the Blockchain section — Chains of blocks, forks, reorgs, and how the network settles on one history. Read on for what it is, why it exists, how it works under the hood, and what to watch out for.
WHAT_CHAINWORK_CUMULATIVE_POW_IS
Chainwork (Cumulative PoW) — at a glance
BLOCKCHAIN
Chainwork (Cumulative PoW) is part of how Bitcoin maintains a single, public, append-only ledger that thousands of independent nodes agree on. A node's estimate of total work in the chain; determines the heaviest chain. Each block commits to the previous one via its hash; change anything in the past and every hash after it breaks, so the chain is tamper-evident by construction.
Why it exists
DESIGN
Digital cash needs a way to prevent the same coin from being spent twice. Pre-Bitcoin systems answered with a central server; Bitcoin answers with a globally-replicated chain ordered by proof-of-work. The blockchain is the data structure that makes that ordering verifiable: anyone can walk the chain back to the genesis block and check every signature, every hash, every rule, with no third party in the loop.
HOW_IT_WORKS
Mechanism
HOW IT WORKS
Each block contains a list of transactions plus an 80-byte header. The header includes the previous block's hash, a Merkle root over its transactions, and the proof-of-work nonce. Nodes validate every rule before accepting a block, and they always extend the chain with the most cumulative work. Chainwork (Cumulative PoW) sits inside that mechanism — either as part of how blocks link, how forks resolve, or how confirmations accumulate.
1. A miner produces a block whose hash satisfies the current difficulty target.
2. The block is broadcast — every full node validates it (signatures, scripts, no double-spends, PoW) in milliseconds.
3. The block extends the longest known chain by 1; the chain tip updates atomically on every node.
4. Wallets that were watching transactions inside the block report +1 confirmation to their users.
5. If two miners find blocks at the same height ("fork"), nodes pick the side with the most cumulative work — usually within 1 block, the orphan side is discarded.
6. After ~6 confirmations the transaction is treated as final; reversing it would require redoing more PoW than the honest network produces.
WORKED_EXAMPLE
Anatomy of the chain
EXAMPLE
Genesis (height 0): 2009-01-03 hash 000000000019d6...
prev_hash 0000…0000 (no predecessor)
coinbase msg: "Chancellor on brink…"
Block 210,000 (first halving): 2012-11-28 reward 50 → 25 BTC
Block 420,000 (2nd halving) : 2016-07-09 reward 25 → 12.5 BTC
Block 630,000 (3rd halving) : 2020-05-11 reward 12.5 → 6.25 BTC
Block 840,000 (4th halving) : 2024-04-20 reward 6.25 → 3.125 BTC
Current size (2024) : ~700 GB of full chain
Average block size : ~1.5 MB (legacy) → ~1.7 MB weighted
Headers-only chain : ~60 MB (sufficient for SPV)
Re-org depth seen : usually 1–2 blocks; longest ever ~24 (early 2010, Bitcoin Core fix)
KEY_PROPERTIES
APPEND-ONLY
Blocks can be added, never removed. Any "rollback" is a competing chain replacing the tip — not an edit.
CHAINED BY HASH
Each header commits to the previous header. Editing any historical block invalidates every block after it.
REPLICATED
Tens of thousands of full nodes worldwide each store the entire chain — there is no single canonical copy.
EVENTUALLY CONSISTENT
Short forks resolve within 1–2 blocks; deep reorgs are practically impossible after ~6 confirmations.
COMMON_PITFALLS
Things that catch people out
PITFALLS
- "Storing data on the blockchain" is expensive and public forever — use it only when those properties are actually needed.
- Light clients (SPV) don't verify scripts or PoW themselves — they trust the longest header chain. A full node is the only fully trustless validator.
- "Chain reorganisation" or reorg sounds dramatic but is normal at depth 1–2. Wait for ≥ 6 confirmations on anything irreversible.
RELATED_CONCEPTS
Other terms from Blockchain — click any to read its page:
TERMINOLOGY_INDEX
TERMINOLOGY
Chainwork (Cumulative PoW)
A node's estimate of total work in the chain; determines the heaviest chain.
Chain Height
The block height of the current tip of the most-work chain.
Longest Chain Rule
Old name for "most-work chain"; the chain with the greatest cumulative proof-of-work wins.
Chain Reorganization
When a competing chain with more work appears, nodes disconnect blocks until they reach a common ancestor and reconnect the new chain.
51% Attack
Controlling >50% of hashrate to rewrite recent history; expensive but not impossible.
Hard Fork
Soft Fork
A consensus rule tightening; old nodes still see the new chain as valid. Backward compatible.
Orphan Block
A block whose parent is unknown to a node; held until the parent arrives.