Hashcash — A Denial of Service Counter-Measure

Author Adam Back
Year 2002
Project Hashcash
Document Technical report
License No reuse license is stated in the paper
Paper Read a PDF copy of Back’s 2002 report

This page summarizes the paper in its own words. It is not a reproduction of the original work and does not claim authorship. The report’s technical claims are presented in their historical context.

Hashcash is a proof-of-work cost function proposed by Adam Back in May 1997 and described in his 2002 technical report. Its original aim was to make repeated requests to unmetered online services more costly, especially unsolicited email and abuse of anonymous remailers. A sender produces a token that a recipient can check more cheaply than the sender produced it. Hashcash is not a cryptocurrency, blockchain, or consensus protocol.

Why Back proposed it

Back’s paper treats computation as a configurable cost attached to using a resource. The recipient decides what resource a token applies to and what work is sufficient, then checks a submitted token before proceeding. The paper discusses both non-interactive stamps, suitable for messages that cannot first receive a server challenge, and interactive puzzles that can respond to a challenge from a server. It also cites earlier work by Cynthia Dwork and Moni Naor on computational pricing for junk mail; Hashcash was one later design in that research area, not the first proposal of proof-of-work for email.

How a stamp works

In the familiar version-one email stamp, the sender varies a counter until a hash meets a partial-preimage target: the output begins with a specified number of zero bits. A stamp also identifies details such as its version, claimed difficulty, date, and the resource it is meant for. The recipient checks that the stamp is well formed, meets the required threshold, is appropriate for that resource and time, and has not already been used. This last check matters because a valid stamp should not be reusable indefinitely.

Difficulty sets the expected work

The target is a parameter, not a universal “one second per email” setting. With a partial-preimage puzzle, adding one required zero bit approximately doubles the expected number of attempts. The time that takes depends on the machine and implementation, so a work factor that feels small on one computer can be burdensome on another. Back’s paper describes this as a tunable cost function rather than a fixed amount of work for every user or every era.

How Bitcoin uses a related idea

Satoshi Nakamoto’s 2008 Bitcoin paper cites Hashcash as a model for proof-of-work. Bitcoin uses a similar search: miners change a nonce in a block until its hash meets a network target. But Bitcoin uses that work as part of a peer-to-peer system for ordering transactions and extending a chain of blocks. Each block refers to the previous block, nodes validate transactions, and the protocol’s rules determine which chain they accept. Bitcoin is therefore an adaptation of a related proof-of-work idea, not the same email-stamp system scaled up, and Hashcash does not by itself explain Bitcoin’s rewards, transaction rules, or consensus.

What Hashcash does—and does not—guarantee

A valid stamp shows that a computation satisfying a chosen target was performed for the stamp’s stated context. It does not prove who performed that work, guarantee that an email is legitimate, or make abuse impossible. A service must validate stamps, prevent reuse, choose a useful work factor, and decide which requests to accept. Higher work can deter some repeated requests, but it also raises the cost for ordinary users and devices with limited computing resources. These trade-offs are part of the design, not a promise that proof-of-work alone eliminates spam or denial-of-service attacks.

Related Terms

See Also

Sources

  • Back, A. (2002). Hashcash — A Denial of Service Counter-Measure. PDF copy of the primary report — describes Hashcash’s purpose, cost-function design, and applications.
  • Nakamoto, S. (2008). Bitcoin: A Peer-to-Peer Electronic Cash System. Official Bitcoin.org PDF — cites Hashcash and explains Bitcoin’s block-based proof-of-work design.
  • Dwork, C., & Naor, M. (1992). Pricing via Processing or Combatting Junk Mail. CRYPTO ’92. Microsoft Research publication record — documents the earlier computational-pricing proposal for email.
  • Debian Hashcash manual. Version-one stamp format and verification notes — describes stamp fields, difficulty, date, resource, and reuse checks.