Nakamoto Consensus
Updated 2026-08-05
INTRODUCTION
English translation pending.
CORE DEFINITION
The consensus design described in Satoshi Nakamoto's Bitcoin whitepaper. Miners compete to solve a cryptographic hash puzzle, and the chain with the most accumulated work is accepted as canonical, which resolves double-spend conflicts without a trusted coordinator. Security rests on the assumption that no single party controls a majority of hashing power, since honest miners are rewarded for extending the accepted chain. The qualification is that finality is probabilistic and depends on cost and incentive assumptions that can shift.
SCAFFOLDING EFFECT
Reduce cognitive load
- Use Incentive Audit: Check whether honest participation pays better than cheating before trusting a system. - Use Costly Signal: Require provably expensive work when you need commitment that cannot be faked. - Use Rule Not Authority: Replace a trusted coordinator with transparent rules anyone can verify independently.
Anchor fast decisions
Because producing a valid block requires expending real computational work, rewriting history means redoing that work faster than everyone else combined. Miners earn rewards only for blocks that others accept, so extending the longest chain is individually profitable while attacking it is expensive. Accumulated work therefore acts as a cost-based measure of commitment, letting anonymous nodes converge on one history without trusting each other.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Proof_of_workverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS