Bitcoin: A Peer-to-Peer Electronic Cash System
Satoshi Nakamoto
satoshin@gmx.com
www.bitcoin.org
Abstract. A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide 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 a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast 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.
比特币：一种点对点的电子现金系统
作者：中本聪 satoshin@gmx.com
翻译：何翀 jack.hechong@foxmail.com
摘要：一个纯粹的点对点版本的电子现金系统，能够无需通过任何一个金融系统，就允许交易直接从一端发送到另一端。数字签名虽然提供了一部分的解决方案，但是，如果仍然需要一个受信任的第三方机构来防范出现双重支付问题的话，电子支付的主要优势就没有了。我们提出了一个方案，通过使用点对点网络的方法来防止双重支付问题。这个点对点的网络将每一笔交易都打上时间戳，把交易的记录用哈希的方法录入到一个不断延展并且基于哈希的工作量证明链上，形成一个除非重做否则不能更改的记录。最长的链条不仅用来作为已发生事件顺序的证据，而且用来证明他来自于最大的CPU算力池。只要大多数的CPU算力不被攻击网络的节点控制，良性的节点将会生成最长的链条而且超越攻击者。这个网络本身需要最小化的结构。信息将尽最大努力去广播，节点可以根据自己的意愿离开或者重新加入，加入时接受以最长的工作量证明链条作为他们离开期间所发生一切的证据。
