Dai Wei，也許他的中文名是 “戴偉”资柔。 他是華人焙贷，也是密碼朋克小組中，我們所知道的唯一華人贿堰。在比特幣之前辙芍，他提出的 B-Money 概念，實(shí)際上就是比特幣的原型羹与。而中本聰與其溝通的三封郵件中故硅，明確指出自己發(fā)明的比特幣 “實(shí)現(xiàn)了戴偉的 B-Money 概念”。

第一封郵件：中本聰至 Dai Wei

From: "Satoshi Nakamoto"
Sent: Friday, August 22, 2008 4:38 PM
To: "Wei Dai"
Cc: "Satoshi Nakamoto"
Subject: Citation of your b-money page

I was very interested to read your b-money page.? I'm getting ready to release a paper that expands on your ideas into a complete working system. Adam Back (hashcash.org) noticed the similarities and pointed me to your site.

I need to find out the year of publication of your b-money page for the citation in my paper.? It'll look like: [1] W. Dai, "b-money," http://www.weidai.com/bmoney.txt, (2006?).

You can download a pre-release draft at http://www.upload.ae/file/6157/ecash-pdf.html? Feel free to forward it to anyone else you think would be interested.

Title: Electronic Cash Without a Trusted Third Party

Abstract: A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without the burdens of going through a financial institution.? Digital signatures offer part of the solution, but the main benefits are lost if a trusted party is still required to prevent double-spending.? We propose a solution to the double-spending problem using a peer-to-peer network.? The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work.? The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power.? As long as honest nodes control the most CPU power on the network, they can generate the longest chain and outpace any attackers.? The network itself requires minimal structure.? Messages are broadcasted on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.

Satoshi

中本聰給 Dai Wei 郵件的譯文：

我讀了您介紹 b-money 的網(wǎng)頁(yè)纵搁，非常感興趣吃衅。 我很快就會(huì)發(fā)出一篇論文，能把您的思路腾誉，擴(kuò)展成一個(gè)完整的徘层，可運(yùn)行的系統(tǒng)。 是 Adam Back (hashcash.org) 發(fā)現(xiàn)了兩者之間的相似之處利职，也是他讓我來看您的網(wǎng)站趣效。

為了在我的論文中引用您的 b-money 概念，我需要確認(rèn)您的 b-money 網(wǎng)頁(yè)的發(fā)布日期眼耀。 我的引用會(huì)是這樣：[1] W. Dai, "b-money," http://www.weidai.com/bmoney.txt, (2006?).

您從?http://www.upload.ae/file/6157/ecash-pdf.html 這個(gè)地址可以下載一份論文初稿英支。如果您覺得有人會(huì)感興趣，也請(qǐng)轉(zhuǎn)發(fā)哮伟。

標(biāo)題：無需可信第三方的電子貨幣

摘要：一個(gè)徹底實(shí)現(xiàn)點(diǎn)對(duì)點(diǎn)的電子貨幣系統(tǒng)干花，可以在網(wǎng)絡(luò)上從一方直接支付到另一方，完全無需依賴金融機(jī)構(gòu)楞黄。電子簽名解決了部分問題池凄，但如果為了防備?“雙花”問題，依然還需要引入一個(gè)可信第三方的話鬼廓，那就失去了點(diǎn)對(duì)點(diǎn)的主要優(yōu)勢(shì)肿仑。我們?cè)O(shè)計(jì)了一個(gè)方案，在點(diǎn)對(duì)點(diǎn)網(wǎng)絡(luò)中碎税，可以解決 “雙花” 問題尤慰。在此網(wǎng)絡(luò)上，通過對(duì)交易進(jìn)行哈希運(yùn)算雷蹂，為交易打上時(shí)間戳伟端，并勾連成鏈，且以哈希運(yùn)算來證明創(chuàng)建鏈的工作量匪煌。這樣就形成了一條記錄责蝠，該記錄是無法篡改的党巾，除非重算所有工作量證明。最長(zhǎng)的鏈霜医，不僅見證了事件發(fā)生的順序齿拂，也代表了它來自最大的 CPU 算力池。只要誠(chéng)實(shí)的節(jié)點(diǎn)控制了網(wǎng)絡(luò)中大部分的 CPU 算力肴敛，則它們就能夠生成最長(zhǎng)的鏈條署海，并把攻擊者拋在后面。此網(wǎng)絡(luò)本身只需要最小的結(jié)構(gòu) 值朋。消息以最佳的效果傳播叹侄，節(jié)點(diǎn)可以隨意離開，也可以隨意重新加入網(wǎng)絡(luò)昨登，加入時(shí)接受工作量證明最長(zhǎng)的鏈趾代，認(rèn)可那是它們離開網(wǎng)絡(luò)期間所發(fā)生事件的見證。

中本聰

第二封郵件：Dai Wei?至中本聰

Hi Satoshi. b-money was announced on the cypherpunks mailing list in 1998.

Here's the archived post:
http://cypherpunks.venona.com/date/1998/11/msg00941.html

There are some discussions of it at http://cypherpunks.venona.com/date/1998/12/msg00194.html.

Thanks for letting me know about your paper. I'll take a look at it and let you know if I have any comments or questions.

Dai Wei 給中本聰郵件的譯文：

Hi 中本聰：

b-money 是 1998 年在密碼朋克郵件組中發(fā)表的丰辣。

下面是歸檔的帖子:

http://cypherpunks.venona.com/date/1998/11/msg00941.html

這里您還能找到一些關(guān)于 b-money 的討論：

http://cypherpunks.venona.com/date/1998/12/msg00194.html.

謝謝告知您的論文撒强。我會(huì)讀一下，如果我有意見和問題笙什，我會(huì)聯(lián)系您飘哨。

第三封郵件：中本聰至 Dai Wei

From: Satoshi Nakamoto

Sent: Saturday, January 10, 2009 11:17 AM

To: weidai@weidai.comSubject: Re: Citation of your b-money page

I wanted to let you know, I just released the full implementation of the paper I sent you a few months ago, Bitcoin v0.1.? Details, download and screenshots are at www.bitcoin.org I think it achieves nearly all the goals you set out to solve in your

b-money paper.

The system is entirely decentralized, without any server or trusted parties.? The network infrastructure can support a full range of escrow transactions and contracts, but for now the focus is on the basics of money and transactions.

There was a discussion of the design on the Cryptography mailing list.

Hal Finney gave a good high-level overview:
| One thing I might mention is that in many ways bitcoin is two independent
| ideas: a way of solving the kinds of problems James lists here, of
| creating a globally consistent but decentralized database; and then using
| it for a system similar to Wei Dai's b-money (which is referenced in the
| paper) but transaction/coin based rather than account based. Solving the
| global, massively decentralized database problem is arguably the harder
| part, as James emphasizes. The use of proof-of-work as a tool for this
| purpose is a novel idea well worth further review IMO.

Satoshi

中本聰給 Dai Wei 郵件的譯文：

From: Satoshi Nakamoto
Sent: Saturday, January 10, 2009 11:17 AM
To: weidai@weidai.com
Subject: Re: Citation of your b-money page

我特為告知您，我剛剛發(fā)布了比特幣 v0.1 版琐凭，這個(gè)系統(tǒng)完全實(shí)現(xiàn)了幾個(gè)月前我發(fā)給您的論文中的思想芽隆。從?www.bitcoin.org 您可以獲得詳細(xì)信息，也可以下載軟件和屏幕截圖统屈。

我想胚吁，您在 b-money 論文中想要解決的問題，比特幣幾乎都做到了愁憔。

系統(tǒng)完全是去中心化的腕扶，無需任何服務(wù)器，也無需任何可信方吨掌。此網(wǎng)絡(luò)的架構(gòu)半抱，能夠支持各種托管交易和合約類型，但當(dāng)前還只是實(shí)現(xiàn)了貨幣和交易的功能膜宋。

在密碼學(xué)郵件組中窿侈，有一個(gè)圍繞設(shè)計(jì)的討論。

哈爾芬尼作出的一個(gè)概括評(píng)價(jià)秋茫，非常好：“我想提的一點(diǎn)是史简，比特幣從各種角度看，都是兩個(gè)獨(dú)立的創(chuàng)意：首先是解決了 James 列出的那些問題学辱，創(chuàng)造出一個(gè)實(shí)現(xiàn)了全局一致乘瓤，但又去中心化的數(shù)據(jù)庫(kù)；然后用來實(shí)現(xiàn)了與 Wei Dai 的 b-money 非常類似的系統(tǒng)策泣，但卻又不是基于賬戶的衙傀，而是基于交易/現(xiàn)金的。 James 就曾強(qiáng)調(diào)過萨咕，實(shí)現(xiàn)全局一致统抬，但又大規(guī)模的去中心化數(shù)據(jù)庫(kù)，毫無疑問是最困難的部分危队。利用工作量證明的方法聪建，來解決這個(gè)問題，是個(gè)天才的主意茫陆，非常值得進(jìn)一步的認(rèn)真思考金麸。”

中本聰