LOCAL REVIEW EDITION · 19 SEPTEMBER 2026Research scope & limitations ↗

Inherited archive entry · retained from the earlier edition. Its factual, legal and policy claims have not all been reverified for 19 September 2026. Research scope.

A stamp made of computation, not currency

Adam Back announced hash cash to the cypherpunks mailing list on 28 March 1997, describing what he called a partial hash collision based postage scheme. The idea: a sender attaches a token to a message that took real computing time to produce and that a recipient can check in a single hash operation. Back wrote that such tokens can be made arbitrarily expensive to compute and yet can be verified instantly, and he pitched the scheme as anti-spam postage and, in his own words, something that 'may provide a stop gap measure until digicash becomes more widely used' — an explicit acknowledgement that hashcash was not itself a currency.

What the later paper formalised

Back's fuller 2002 paper, 'Hashcash — A Denial of Service Counter-Measure', generalises the mechanism beyond email: any resource request can be gated behind proof that the requester spent measurable computation first. The asymmetry is the whole design, cheap to check and deliberately expensive to produce, which prices out large-scale abuse while leaving a single legitimate message affordable. Neither document proposes a ledger, a supply schedule, or a way for independent parties to agree on a shared history; the token proves work was done, not that a payment occurred or value changed hands.

How the whitepaper repurposed the same primitive

Bitcoin's peer-to-peer electronic cash paper cites Back's paper directly, stating its own proof-of-work is similar to Adam Back's Hashcash. The reuse is precise: Bitcoin scans for a nonce that makes a block's hash begin with a required number of zero bits, exactly the collision search Back described, but attaches the resulting cost to a shared, append-only chain of blocks rather than to a single message. The paper states this converts a spam deterrent into a majority-decision mechanism, calling proof-of-work essentially one-CPU-one-vote, where the chain with the most accumulated work represents the network's history.

What the deterrent does not do on its own

Hashcash's own documents never claim to solve double-spending or to establish consensus among mutually distrusting parties; that step belongs entirely to Bitcoin's chain rule, and confusing the two understates how much additional structure Nakamoto's paper had to build on top of a borrowed idea.

  • Is proof-of-work being used here to deter abuse, or to order a shared history?
  • Who verifies the work, and what do they agree to accept once it is done?
  • Does raising the cost of production change who can afford to participate at all?

Hashcash solved a narrower problem than money; Bitcoin's contribution was building a history-ordering system on top of that narrower tool, not inventing the tool itself.

Sources & reading trail

Hash cash postage implementation announcement (cypherpunks mailing list) ↗

Preserves Adam Back's original 28 March 1997 announcement text and his stated anti-spam, non-currency purpose.

Source published: 28 March 1997 · Retrieved: 16 September 2026

Hashcash — A Denial of Service Counter-Measure ↗

Gives the fuller 2002 paper's generalised denial-of-service framing and the cost asymmetry the mechanism relies on.

Source published: 1 August 2002 · Retrieved: 16 September 2026

Bitcoin: A Peer-to-Peer Electronic Cash System ↗

Cites Hashcash directly and shows how the whitepaper reuses the same collision search as its block proof-of-work.

Source published: Not established · Retrieved: 16 September 2026

Historical sources establish the record; the questions and interpretation are Block Due Diligence’s editorial analysis. This retrospective draft does not imply the site published on the event date.