区块链学习

《Bitcoin A Peer-to-Peer Electronic Cash System》在2008年由自称中本聪的一个人或组织发布，比特币去中心化的交易系统，具有抗攻击和避免单点故障的优势，文中对点对点的比特币转账系统各部分都做了细致的介绍，我们不讨论虚拟币，只学习其中的分布式系统技术，论文对区块链技术细节进行了系统的阐述，后来的区块链技术和区块链学术论文大部分都出自此文，堪称区块链领域的经典之作，强烈建议初学区块链的同学可以仔细研读一下。下面是摘要及翻译。
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 能力由不合作攻击网络的节点控制，它们就会生成最长的链并超过攻击者。网络本身需要最小的结构。消息在尽最大努力的基础上广播，节点可以随意离开和重新加入网络，接受最长的工作量证明链作为他们离开时发生的事情的证明。