liveBook · Manning

Proof of work

Proof of work is a computational mechanism requiring demonstrable effort, typically by repeatedly searching for a value whose hash satisfies a difficulty condition.

How 2 Manning books explain it

Real-World Cryptography

Proof of work is a consensus technique in which participants demonstrate computational effort by finding a hash satisfying a difficulty condition.

How it is used
Coordinates permissionless Bitcoin consensus by selecting block proposers through computational puzzles.
How deep it goes
Explains blocks, nonces, hash difficulty, forks, and chain selection, while stopping short of implementation-level mining details.
Examples
Uses Bitcoin block proposals, nonce searches, zero-prefixed digests, competing forks, and an interactive toy blockchain.
What you can do after
Evaluate how computational puzzles select miners, resist account-based influence, resolve forks, and impose an energy cost.

Read how Real-World Cryptography explains proof of work →

The Joy of JavaScript

A computational procedure that requires searching for a value meeting a difficulty condition, often by repeated hashing.

How it is used
Uses repeated hashing to make adding blockchain blocks costly while keeping successful results straightforward to verify.
How deep it goes
Explains the nonce-and-hash loop and its difficulty prefix, then defers production-grade blockchain implementation.
Examples
Demonstrates leading-zero difficulty, nonce mutation, block hashing, block mining, and Worker Threads execution.
What you can do after
Build proof-of-work from scratch and run its long computation asynchronously with Node.js Worker Threads.

Read how The Joy of JavaScript explains proof of work →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.