中本聪致戴伟：关于在比特币白皮书中引用 b-money（2008 年 8 月 22 日）
首次公开证据
打开首次公开证据查看 1 个交叉存档
- Pre-release draft — Electronic Cash Without a Trusted Third Party — The draft was attached to this email and is now lost; the former hosting site disappeared and no cached copy is known.
我很有兴趣读了你的 b-money 页面。我正在准备发布一篇论文，把你的想法扩展成一个完整可运行的系统。Adam Back（hashcash.org）注意到了其中的相似之处，并把我指向了你的网站。
我需要弄清你的 b-money 页面发表的年份，以便在论文中引用。格式会是：
[1] W. Dai, "b-money," http://www.weidai.com/bmoney.txt, 1998.
纯粹点对点的电子现金版本可以让在线支付直接从一方发送给另一方，而不必承担经过金融机构的负担。数字签名提供了部分解决方案，但如果仍然需要可信第三方来防止双重支付，主要优点就会丧失。我们提出一种使用点对点网络解决双重支付问题的方法。网络通过把交易哈希进持续增长的、基于哈希的工作量证明链来为交易加时间戳，形成一份不重新完成工作量证明就无法改变的记录。最长链不仅可以证明所见事件的顺序，还能证明它来自最大的 CPU 算力池。只要诚实节点控制网络中最多的 CPU 算力，它们就能生成最长链并赶过任何攻击者。网络本身只需要最小的结构。消息以尽力而为的方式广播，节点可以随时离开并重新加入网络，并接受最长的工作量证明链作为它们离开期间发生了什么的证明。
谢谢， 中本聪
英文原文
展开英文原文
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, 1998.
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 third 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.
Thanks, Satoshi