FOLLOW THE MECHANISM
- 1Candidate block
Assemble a valid proposed history extension.
- 2Repeated hashing
Search for a result below the target.
- 3Broadcast
Publish a qualifying candidate.
- 4Independent checks
Nodes verify validity and accumulated work.
A conceptual sequence. Real implementations can add steps, intermediaries, and conditions.
A search that is expensive to win
A miner repeatedly changes candidate block data and hashes it, looking for a result below the network’s target. Each trial is cheap; finding a qualifying result takes many trials on average. Verifiers can check the winning result quickly. This asymmetry makes it possible to demonstrate expended computational effort without replaying every unsuccessful attempt. It does not mean miners solve useful scientific equations or decrypt users’ transactions.
Work selects among valid histories
A full node first checks consensus validity, including transaction authorization and issuance limits. Among valid competing histories, accumulated proof of work guides chain selection. Extra computing power cannot make a node accept an invalid signature or an excessive block subsidy under unchanged rules. An attacker with sufficient influence can instead attempt censorship or reorganizations, including reversing their own earlier payments in a competing valid history.
Difficulty changes the search target
Bitcoin adjusts its difficulty under protocol rules so that changes in available hashing power do not permanently translate into equally large changes in average block spacing. Actual intervals remain variable; an average is not a schedule. A small miner may wait a long time for a block despite continuously performing work. Pools change the distribution of payouts to participants without changing the network’s underlying proof requirement.
Security has continuing costs
Hardware, electricity and operating capacity are inputs to mining. Rewards and fees compensate successful production, but profitability depends on costs, competition and the market value of received coins. The security budget is therefore an economic flow as well as a cryptographic mechanism. A large amount of historical work raises the burden of replacing history; it does not guarantee a coin’s market price or a user’s custody arrangements.
MAKE IT CONCRETE
Why a faster computer cannot forge a signature
In a simplified attack, a miner finds blocks unusually quickly and inserts a payment from someone else without authorization. Full nodes still reject that block. A separate attack might build an alternative valid history excluding the attacker’s own payment. These attack paths differ: chain selection influence does not grant arbitrary spending keys.
FAILURE PATHS & COMMON MISREADINGS
Where the model can break
KEEP EXPLORING