Proof of work is a consensus mechanism in which network participants called miners compete to find a block whose hash falls below a target value, a task that can only be solved by repeated trial and error, and the first miner to succeed earns the right to add the next block and collect a reward. Among consensus mechanisms, it was the first to secure an open blockchain, introduced with Bitcoin in 2009.
The core idea is that producing a valid block is expensive, while checking it is cheap. Any node can verify a solution with a single hash calculation, but finding one requires enormous computation. This asymmetry ties the security of the ledger to real-world costs in hardware and electricity, which makes rewriting history economically impractical for an attacker without a majority of the network’s computing power.
How proof of work produces a block
A miner assembles pending transactions into a candidate block, builds the block header and then hashes the header over and over, changing a field called the nonce each time. The goal is a hash value lower than the current difficulty target. Because cryptographic hash outputs are unpredictable, the only strategy is to try enormous numbers of variations.
The table below lists the steps in the mining process and what each step accomplishes.
| Step | What the miner does | Purpose |
|---|---|---|
| Collect transactions | Select pending transactions, usually by fee | Fill the block and earn fees |
| Build the header | Include previous hash, Merkle root, time and target | Link the block to the chain |
| Search for a nonce | Hash the header with changing nonce values | Find a hash below the target |
| Broadcast the block | Send the solution to peers | Claim the reward before competitors |
| Verification by nodes | Peers check hash, transactions and rules | Accept or reject the block |
Bitcoin uses a double SHA-256 hash. Because the nonce field has only 32 bits, miners also change an extra value in the reward transaction, which alters the Merkle root and opens a fresh range of nonces to search.
Difficulty, rewards and the longest chain rule
Proof of work keeps block production steady through difficulty adjustment. In Bitcoin, difficulty is recalculated every 2,016 blocks, roughly every two weeks, so that blocks continue to arrive about every ten minutes regardless of how much computing power joins or leaves.
When two miners find blocks at nearly the same time, the network temporarily splits. Nodes follow the chain with the most accumulated work, often loosely called the longest chain, and the losing block becomes orphaned. This is why proof of work offers probabilistic finality: each additional block makes reversal less likely.
| Parameter | Value or behavior | Effect |
|---|---|---|
| Target block time | About 10 minutes | Balances propagation delay and speed |
| Difficulty period | Every 2,016 blocks | Keeps block time stable |
| Block subsidy | Halves every 210,000 blocks | Limits total supply to 21 million coins |
| Customary confirmations | Often six blocks for large payments | Reduces risk of reversal |
| Hash function | Double SHA-256 | Determines suitable mining hardware |
Proof of work compared with proof of stake
The main alternative is proof of stake, in which validators lock up tokens instead of spending electricity. Ethereum switched from proof of work to proof of stake in September 2022, cutting its energy use by well over 99 percent by widely cited estimates, which made the comparison central to debates in crypto & blockchain.
| Dimension | Proof of work | Proof of stake |
|---|---|---|
| Scarce resource | Computing power and energy | Staked tokens |
| Block producers | Miners | Validators |
| Energy use | Very high | Low |
| Finality | Probabilistic, grows with confirmations | Often explicit after checkpoints |
| Penalty for misbehavior | Wasted energy and lost rewards | Slashing of staked tokens |
| Entry barrier | Specialized hardware and cheap power | Capital to stake |
| Track record | Secured Bitcoin since 2009 | Newer at very large scale |
Supporters of proof of work argue that its external cost anchors security in the physical world and that coins cannot be used to gain more control over the protocol. Critics point to energy consumption, electronic waste and the concentration of mining in large pools and regions with cheap power.
Mining hardware and hash algorithms
The hash function chosen for a proof of work chain determines which hardware mines it efficiently. Bitcoin mining moved from CPUs to GPUs to FPGAs and finally to ASICs, chips built only to compute SHA-256, which are many orders of magnitude more efficient than general-purpose processors.
| Algorithm | Example network | Dominant hardware |
|---|---|---|
| SHA-256 | Bitcoin | ASIC miners |
| Scrypt | Litecoin, Dogecoin | ASIC miners |
| RandomX | Monero | General-purpose CPUs |
| Ethash | Former Ethereum proof of work chain | GPUs, later some ASICs |
Some projects choose ASIC-resistant algorithms to keep mining accessible to ordinary computers. This widens participation, but it also makes the network easier to attack with rented cloud or botnet capacity, so the choice is a trade-off rather than a pure improvement.
Security limits and common misconceptions
Proof of work is secure only as long as honest miners control most of the hash power. Its weaknesses are well understood by practitioners.
- 51% attack: an attacker with majority hash power can reorder recent blocks and double-spend, a real risk for small proof of work chains.
- Deliberately useless puzzles: the computation has no use beyond securing the chain; its value lies in being costly and verifiable.
- Pool concentration: individual miners join pools to smooth income, so a few pool operators may coordinate a large share of block production.
- Instant payments are not final: a transaction with zero confirmations can still be replaced, so merchants accepting large amounts wait for several blocks.
Explained without jargon
Proof of work is like a lottery where tickets cost electricity. Computers around the world keep guessing numbers, and the first one to find a winning number gets to write the next page of the shared record and receives a reward.
Because guessing takes so much effort, cheating would require more computers than everyone else combined. The cost of the work is what keeps the record honest, while checking a winning number takes only a moment.
A typical use case
An online electronics retailer accepts bitcoin for orders. For a pair of headphones, it ships after one confirmation, because the risk of reversal is small compared with the order value. For a high-end laptop, it waits for six confirmations, roughly an hour, before releasing the goods.
During that hour, miners worldwide keep extending the chain. Each new block buried above the payment makes it harder to reverse, since an attacker would need to redo all that work faster than the rest of the network.
This practical policy shows how proof of work turns computing effort into settlement assurance: the merchant chooses how much accumulated work it requires based on how much money is at stake.