Other meanings of Hashcash
Cryptography
Hashcash is a proof-of-work system proposed by Adam Back to make email spam and denial-of-service attacks more expensive. A sender computes a partial hash collision, attaches the resulting token to a message, and allows the recipient to verify the work far more cheaply than it was produced.1
Hashcash makes large-scale abuse costly by requiring a sender to perform a modest amount of computation before a message is accepted. The proposal targeted unsolicited commercial email and denial-of-service attacks, where an attacker benefits from sending enormous numbers of inexpensive requests.1
A Hashcash token contains information such as a service identifier, a date, a resource name, an extension field, and a counter. The sender varies the counter until the hash of the token begins with a required number of zero bits. The recipient then hashes the supplied token once or a few times, checks the claimed resource and date, and verifies that the difficulty requirement has been met. This asymmetry—expensive creation but inexpensive verification—is the defining engineering property of the scheme.
Hashcash difficulty is controlled by the number of leading zero bits required in the hash output. Increasing that number raises the expected work exponentially: adding one required bit approximately doubles the average number of trials. Because each trial changes only a counter or similar nonce, the computation is naturally parallelizable, while verification remains nearly constant-time.
The system deters abuse rather than proving that a message is legitimate. A determined sender with sufficient hardware can still produce tokens, and legitimate high-volume senders may face the same computational burden as spammers. Hashcash also does not by itself prevent replay, impersonation, or content-based abuse; practical deployments must bind tokens to a recipient or service, enforce freshness, and reject reuse. The original proposal therefore treats proof of work as one component of an anti-abuse policy rather than a complete email-authentication protocol.1
Hashcash supplied an influential proof-of-work pattern for later distributed systems, but it was not itself a cryptocurrency or a consensus ledger. Its original tokens were spent as anti-abuse credentials: a recipient checked that computational effort had been performed for a particular resource and time, rather than transferring a scarce monetary asset.
Satoshi Nakamoto's Bitcoin design adapted proof of work to a different problem. Bitcoin miners search for a block header whose double SHA-256 hash satisfies a network difficulty target; the resulting chain helps the network order transactions and select a history without a central authority.2 The conceptual connection is direct, and Back's Hashcash work is cited in the Bitcoin paper, but Bitcoin adds public-key transactions, blocks, peer-to-peer propagation, and a consensus rule. Hashcash should therefore be understood as an ancestor and component idea, not as another name for Bitcoin.
Hashcash's resource field is a subtle but important feature: work can be tied to a particular email address, network service, or other destination instead of being freely reusable. This prevents a sender from generating one token in advance and presenting it indiscriminately to many recipients. Expiration dates similarly limit the value of stored tokens and help bound replay attacks.1
The proposal also anticipated that computational costs are relative to hardware and user circumstances. A fixed difficulty can become trivial as processors improve, yet an aggressive requirement can burden mobile devices, accessibility tools, or users in regions with expensive electricity. Hashcash's assumptions are also affected by specialized hardware, cloud-scale parallelism, and energy prices. These trade-offs explain why proof-of-work defenses have seen more use in selected network protocols and online services than as a universal replacement for filtering, authentication, rate limits, and reputation systems.
Hashcash is discussed here as Adam Back's proof-of-work anti-abuse design, not as a generic label for every computational puzzle or cryptocurrency mining system.
Help improve the encyclopedia. Reports go straight to the site manager.