Reusable proofs of work (RPOW)

Wonder

1. How can a central authority be trusted not to cheat if it controls the ledger?
2. Why did a system with verifiable code still fail as money?
3. If no one can cheat a server, what can still go wrong with it?

Explore

1. In August 2004, Hal Finney released Reusable Proofs of Work (RPOW), a digital cash prototype that evolved Adam Back’s Hashcash. While previous stamps were bound to single recipients and non-transferable, RPOW tokens could be exchanged one-for-one with the server for new tokens. This mechanism allowed value to pass from person to person indefinitely, mimicking physical cash while retaining the computational cost of creation.
2. The core trust problem was centralization: a single server managed all balances and prevented double-spending by keeping a record of spent tokens. To mitigate this, Finney implemented remote attestation using an IBM 4758 Secure Cryptographic Coprocessor. This tamper-resistant hardware allowed any external user to verify that the server was running the published open-source code exactly as intended, preventing even the operator from secretly altering the rules.
3. Mechanically, a user submitted a Hashcash-style proof of work to the server and received an RSA-signed RPOW token in return. During payment, the sender transferred the token to the recipient, who then redeemed it with the server for new tokens of equal value. This process ensured that each unit of value remained unique and unspent, solving the double-spend problem within a closed, trusted environment.
4. Tokens could be split and combined at the server, as long as total value was preserved. One limitation was economic: nothing adjusted for faster hardware. As computing became cheaper, a token of a given size cost less work to mint than one created earlier, so tokens of equal face value embodied unequal costs.
5. The single-server architecture remained a point of failure. Although remote attestation prevented cheating by the operator, it could not prevent shutdown or network partitioning. The system required continuous availability for all transactions, making it as fragile as its host. This dependency on a central entity distinguished RPOW from later decentralized protocols that distributed consensus across many independent nodes.
6. Finney’s design represented the closest pre-bitcoin approach to electronic cash, combining proof-of-work issuance with transferable tokens. It saw little use: few people had reason to hold the tokens, and few places accepted them. The transition from RPOW to Bitcoin involved replacing the trusted central server with a distributed consensus mechanism that accepted probabilistic finality rather than absolute certainty.

Key facts

Exercise nine, six, three, one

Fact check

Dates, figures and claims checked against the published sources listed below.

• H. Finney, 'Reusable Proofs of Work' documentation (rpow.net, 2004)
• N. Popper, Digital Gold: Bitcoin and the Inside Story of the Misfits and Geniuses Trying to Reinvent Money (2015)
• A. Back, 'Hashcash – A Denial of Service Counter-Measure' (2002)