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.
比特币：一个点到点的电子货币系统
概要
比特币是一个完全的采用点对点形式的电子货币系统，通过这个系统，网络支付可以不用再通过任何金融机构而直接由一方账户到对方账户。为了解决支付信任问题，目前网络支付中广泛采用的数字签名方式虽然有诸多优点，但是考虑到该方式还是需要可信第三方担负起阻止”双花“的义务这一点，它的主要的优点也就所剩无几了。我们提供的”双花“问题的解决方案是采用点对点系统。这个系统通过把交易哈希进一个不断产生、壮大的以哈希值为基础的工作证明链条中，形成了一个除非重新制作工作证明，否则不可篡改的记录。这样以来，最长的一条链不仅能够作为后续发生的事件的证明，而且也能作为其来自最大CPU算力的综合池的证明。只要占相对多数的CPU算力掌握在未协同攻击主网的节点一方手中，这些节点就能生成最长的链，链的增速要比攻击者快。整个网络也需要最低限度的结构（这句话不明白什么意思，后期搞懂了的话会修改翻译）。这个网络中的所有的信息都是以”尽最大努力“为原则对外广播，节点可以自由选择随时退出主网络，只要承认最长的链是其不在网时的工作证明的证明就能随时加入主网。
（待续）
