SN-10003 附来源、原文与上下文。
我很感兴趣地读了你的 b-money 网页。我正准备发表一篇论文，把你的想法扩展成一个完整、可运行的系统。Adam Back（hashcash.org）注意到其中的相似之处，告诉了我你的网站。
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.
我需要知道你的 b-money 网页是哪年发表的，以便在论文中引用。引用格式会是这样：
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?)。
[1] W. Dai, "b-money," http://www.weidai.com/bmoney.txt, (2006?).
你可以在 http://www.upload.ae/file/6157/ecash-pdf.html 下载预发布草稿。你觉得还有谁会感兴趣，也请随意转发给他们。
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
信中附上的论文摘要中本聪来源 ↗一种完全点对点的电子现金，可以让在线支付直接从一方发送给另一方，免去经过金融机构的负担。数字签名提供了部分解决办法，但如果仍需要可信方来防止双重支付，主要的好处也就失去了。我们提出一种利用点对点网络解决双重支付问题的方案。网络通过哈希运算，把交易纳入一条不断延伸、基于哈希的工作量证明链，为交易加盖时间戳，形成一种记录：若不重新完成工作量证明，就无法更改它。最长链既能证明所见证事件的先后顺序，也能证明它来自最大的 CPU 算力集合。只要诚实节点控制着网络中最多的 CPU 算力，就能生成最长链，超过任何攻击者。网络本身只需要极少的组织结构。消息尽力广播，节点可以随时离开和重新加入网络，并接受最长的工作量证明链，以此证明它们离开期间发生的事情。
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
Satoshi
