Nakamoto Consensus: The "Most Work" Rule Explained

In the original Bitcoin Whitepaper, Satoshi Nakamoto described the network's consensus mechanism as the "longest chain" rule. However, as the protocol matured, this was refined into the Most Cumulative Work rule. While they often yield the same result, the distinction is critical for the network's security against low-difficulty spam attacks.

This guide explores the technical evolution of chain selection and how nodes identify the "true" ledger.

🔗 1. The Whitepaper Definition

Satoshi wrote in Section 4 of the whitepaper:

"The majority decision is represented by the longest chain, which has the greatest proof-of-work effort invested in it."

At the time, the network assumed a relatively stable difficulty. In such a scenario, the chain with the most blocks (the longest) would naturally be the one with the most work. However, this definition was incomplete because it didn't account for shifts in difficulty over time.

---

⚡ 2. The Shift to nChainWork

Early versions of Bitcoin (pre-2010) strictly followed the chain with the most blocks. This created a vulnerability: an attacker could mine a private chain at a very low difficulty, creating thousands of blocks rapidly. If a node saw this "longer" chain, it might switch to it, even though it represented almost no physical energy.

To solve this, Bitcoin nodes switched to tracking Cumulative Chain Work (nChainWork). * Chain A: 10 blocks at Difficulty 1,000,000. * Chain B: 1,000 blocks at Difficulty 1.

Under the "Longest Chain" rule, Chain B wins. Under the Most Work rule, Chain A wins because $10 \times 1,000,000$ is vastly greater than $1,000 \times 1$.

---

🗳️ 3. Proof of Work as a Voting System

Nakamoto Consensus uses CPU power (hashrate) as a voting mechanism. Instead of "one IP address, one vote" (which can be subverted by a Sybil attack), Bitcoin uses "one unit of hash power, one vote."

1. Block Discovery: A miner finds a block and broadcasts it.
2. Validation: Other nodes verify the block meets the current target.
3. Extension: Miners express their "vote" for that block by building the next block on top of its hash.
4. Settlement: As more blocks are added, the "weight" of the chain increases, making it mathematically impossible for a minority of the network to catch up.

---

🛠️ 4. How Nodes Track the Best Chain tip

Inside a Bitcoin node, every block header is stored in a data structure called the BlockIndex. Every block carries an nChainWork value, which is the sum of its own difficulty plus the nChainWork of its parent.

The node maintains a pointer called chainActive, which always points to the block with the highest cumulative work. If a new block arrives on a different branch that results in a higher nChainWork, the node performs a reorganization to make that branch the new chainActive.