中本聪的比特币白皮书（中文译稿，译者 杨怀玉）
比特币：点对点电子现金系统
作 者：中本聪
电子邮箱：satoshin@gmx.com
网 址：www.bitcoin.org
【摘要】纯粹的点对点电子现金改进版，必须支持一方直接发送给另外一方的在线支付方式，而无须通过任何金融机构。“数字签名”提供了部分解决方案，但如果还是必须由一个被信任的第三方来防止“双重支付”，则丧失了其关键价值。我们提出的“双重支付”问题解决方案是使用“点对点”网络。此网络使用“hashing(散列)”将交易打上“时间戳”，以此将所有交易合并为一个不间断的基于散列的“工作量证明”链条，形成的记录不可更改——除非重建“工作量证明”。不仅仅最长的链条用于被见证的事件系列之证明，另一方面，该证明亦来自最大规模的CPU能量池。只要不是为节点所控制的占比较大的CPU能量协同一致攻击该网络，那么网络将生成最长的，超过攻击者的链条。此网络本身只需极少的基础设施。信息尽最大努力进行广播，节点可以随意离开或重新加入网络，并承认最长的“工作量证明”链条作为该节点离线期间所发生所有交易的证明。
附原文
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 pay-ments 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 so-lution to the double-spending problem us-ing 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. Aslong as a majority of CPU power is controlled by nodes that are not cooperating toattack the network, they'll generate the longest chain and outpace attackers. Thenetwork itself requires mini-mal 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.
网友评论