| Document | b-money: an anonymous distributed electronic cash proposal |
|---|---|
| Author | Wei Dai |
| Date | Announced to the Cypherpunks mailing list on November 27, 1998 (UTC) |
| Project | b-money |
| Type | Historical protocol proposal; not a current blockchain or payment network |
| License | Not specified in the proposal |
Disclaimer: This page summarizes a historical proposal and compares it with later systems. A design paper is not evidence of a deployed service, security audit, or guarantee of anonymity. Digital-asset systems carry technical and financial risks. This is educational material, not financial or legal advice.
What b-money Proposed
Wei Dai introduced b-money in 1998 as a proposal for pseudonymous participants to exchange money and enforce contracts without relying on a conventional institution. The text describes two related protocols rather than a launched coin or a single finished implementation. Dai assumed an “untraceable” communication network where users were identified by public-key pseudonyms and messages were signed and encrypted. Those are assumptions of the design, not proof that its users would be anonymous in practice.
Two Protocol Designs
In Protocol 1, each participant keeps a separate account database. A signed transfer message moves units between pseudonyms, and the community checks that the sender has enough balance. Money creation is tied to solving a previously unsolved computational problem. The amount credited is based on the estimated computing effort expressed in a standard basket of commodities; it is not simply a claim that any amount of CPU time automatically produces money.
The first protocol also sketches contract enforcement. A contract names an arbitrator and sets each party’s maximum reparation for default. The parties and arbitrator sign it, and the corresponding amounts are reserved in a contract account. When the contract concludes, the participants apply the agreed or arbitrated reparations. Dai explicitly calls this protocol impractical because it relies heavily on a synchronous, unjammable anonymous broadcast channel.
Protocol 2 changes who keeps the account database: a subset of participants, called servers, maintains it. For each transaction, the affected participants are meant to check that the message reached and was processed by a randomly selected subset of servers. Each server deposits money that can be used as a potential fine or reward when misconduct is proven. Servers also periodically publish and commit to the money-creation and money-ownership databases. Users are told to check their balances and ensure the total recorded balances do not exceed all money created.
This description should not be inflated into a modern proof-of-stake slashing system or a protocol that guarantees finality through a defined quorum. It is a proposal for limiting server dishonesty while retaining a degree of server trust. The paper does not specify the public proof-of-work chain and global transaction-ordering mechanism that Bitcoin later describes.
An Alternative for Creating Money
An appendix addresses a difficulty in the original issuance rule: estimating the cost of computation can become inaccurate as hardware changes. Dai proposes an alternative process in which account keepers set a money-creation quota for each period. People bid by naming an amount and a problem from an agreed class; successful solvers submit proofs, and account keepers accept bids by nominal computation cost per unit created. This is an alternative sketched in the proposal, not evidence that b-money operated an auction or a live mining market.
How It Relates to Bitcoin
The Bitcoin paper cites W. Dai’s b-money in its references. The two proposals share a historical interest in electronic cash, digital signatures, and computation, but their mechanisms are different. b-money describes account balances and, in its second design, server-held records. Bitcoin instead proposes a peer-to-peer timestamp server that orders publicly announced transactions through a proof-of-work chain. Bitcoin’s paper also discusses rewards for block creation and a chain of signed transactions. The citation establishes a documented reference; by itself it does not show that Bitcoin copied every part of b-money or that the earlier proposal was a working predecessor.
An August 22, 2008 email attributed to Satoshi Nakamoto asks Dai for the publication year of b-money and offers a link to a pre-release electronic-cash draft. That shows contact about the citation and an offer to share a draft. It does not establish that Dai downloaded or read the file, and the original draft link is no longer available. The surviving Bitcoin paper and mailing-list record are stronger sources for describing the systems themselves.
Limits and Careful Reading
b-money is useful as a historical design proposal, especially for seeing how pseudonymous accounts, computational issuance, server records, and contract enforcement were considered before Bitcoin. It should not be described as a deployed blockchain, a token that can be bought today, or a system proven to provide anonymity. The proposal makes network and server assumptions, leaves important operational questions open, and does not provide a live implementation whose behavior can be assessed. Bitcoin later took a different route to public transaction ordering; that comparison does not mean one short rule solved every issue in earlier electronic-cash research.
Social Media Sentiment
A small r/Bitcoin discussion about the Bitcoin paper’s footnotes focused on b-money’s place in Bitcoin’s history. The post linked readers to a review of Dai’s proposal, while a visible reply brought Nick Szabo’s Bit Gold into the comparison. This is a narrow discussion of historical references, not a broad view about b-money’s technical quality or safety; the sample is too small to represent community sentiment.
Last updated: 2026-10
Related Terms
- Bitcoin — a later peer-to-peer electronic-cash design whose paper cites b-money.
- Proof of Work — computational evidence used in different ways in historical digital-cash proposals and later networks.
- Smart Contract — software or protocol rules that can define and execute conditions; b-money separately proposed signed contracts with arbitration.
See Also
- Bitcoin: A Peer-to-Peer Electronic Cash System — a later design for public transaction ordering and electronic payments.
- Hashcash: A Denial of Service Counter-Measure — an earlier proof-of-work proposal cited by Bitcoin.
- Zerocash: Decentralized Anonymous Payments from Bitcoin — a later privacy-payment proposal with a different construction.
Sources
- Wei Dai, “b-money” (November 1998), archived full text — primary text for the two protocol designs, issuance rules, account records, and contract procedures.
- Wei Dai, “PipeNet 1.1 and b-money,” Cypherpunks mailing-list archive (November 27, 1998 UTC) — preserves the announcement and its brief description of b-money’s purpose.
- Satoshi Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System” — primary source for Bitcoin’s b-money citation and its distinct proof-of-work ordering design.
- Satoshi Nakamoto and Wei Dai, 2008–2009 email archive — reproduces the August 22, 2008 message about the b-money citation and the offered draft link.
- r/Bitcoin, “The Bitcoin Whitepaper Footnotes: Part 2 — b-money by Wei Dai” — a small discussion sample summarized above.