怎样阅读一个白皮书？

作为一个刚进入区块链世界就遇到了"鬼节（9月4日）"的韭菜，心平气和之后只能通过学习来平复一下上蹿下跳的情绪，上一篇文章我写过想要阅读工信部的《区块链白皮书》，以后就开始陆续开始展开来写。

当我真正开始阅读的时候发现这样一一些特点:

一是白皮书其实和书一样，决定用读书笔记的方法来分享、学习。

二是会分享我认为比较重要的知识点，不重要的就一笔带过了，当然也可能出现啰嗦情况。

三是我会相应的展开文中出现的文献，同时翻译成中文来学习。

言归正传，我看了序言、目录、内容摘要等等，个人觉得文中一些非常重要的概念和缩略语很重要于是乎，摘录下来加以学习:

区块链:分布式数据存储、点对点传输、共识机制、加密算法等计算机技术的新型应用模式。

分布式:相对于集中式而言。在白皮书中，分布式是区块链的典型特征之一，对应的英文是Decentralized，完整的表达形式是不依赖于中心服务器 (集群)、利用分布的计算机资源进行计算的模式。

金融科技:通过科技让金融服务更高效，通常简称为FinTech。

普惠金融:立足机会平等要求和商业可持续原则，以可负担的成本为有金融服务需求的社会各阶层和群体提供适当、有效的金融服务。

数字货币: 货币的数字化，通过数据交易并发挥交易媒介、记账单位及价值存储的功能，但它并不是任何国家和地区的法定货币。

共识机制:区块链系统中实现不同节点之间建立信任、获取权益的数学算法。

智能合约:一种用计算机语言取代法律语言去记录条款的合约。

挖矿:比特币系统中争取记账权从而获得奖励的活动。

分布式账本:一个可以在多个站点、不同地理位置或者多个机构组成的网络中分享的资产数据库。其中，资产可以是货币以及法律定义的、实体的或是电子的资产。

PoW:工作量证明(Proof of Work)；PoS:权益证明(Proof of Stake)；DPoS:股份授权证明(Delegate Proof of Stake)；PBFT:实用拜占庭容错(Practical Byzantine Fault Tolerance)；P2P:点对点(Peer to Peer)；DAPP:分布式应用(Decentralized Application)；KYC:客户识别(Know Your Customer)；RSA
RSA加密算法(RSA Algorithm)；ECC:椭圆加密算法(Elliptic Curve Cryptography)；BaaS:区块链即服务(Blockchain as a Service)

当我看到区块链发展演进途径时，看到了比特币起源于化名"中本聪"的一篇论文《比特币:一种点对点电子现金系统》，我自己试着翻译一下，当然在Google翻译帮助下。

Bitcoin: A Peer-to-Peer Electronic Cash System

比特币:一种点对点的电子现金系统

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.

摘要。一个完全的点对点电子现金的版本将允许在线付款直接从一方发送到另一方而没有经过金融机构。数字签名提供了解决方法的一部分，但如果仍然需要一个可信任的第三方来防止双重支付，那么主要的好处就消失了。我们提供了一个解决方法来解决双重支付难题通过一个点对点网络。这个网络交易时间戳回报通过散列成基于Hash的工作证明的一个持续链条，形成一个记录，不能被改变没有重做的工作证明。最长的链不仅作为事件见证先后顺序的证据，而且证明了它来自最大的CPU的功率池。只要大部分的CPU功率是由不配合攻击网络的节点所控制，他们会产生最长的链，同时超过攻击者。网络本身需要最小的结构。消息被在最努力基础下广播，节点可以离开并重新加入网络在将来，接受最长的工作证明作为当他们离开时发生的事情的证据。

Introduction

1.简介

Commerce on the Internet has come to rely almost exclusively on financial institutions serving as trusted third parties to process electronic payments. While the system works well enough for most transactions, it still suffers from the inherent weaknesses of the trust based model. Completely non-reversible transactions are not really possible, since financial institutions cannot avoid mediating disputes. The cost of mediation increases transaction costs, limiting the minimum practical transaction size and cutting off the possibility for small casual transactions, and there is a broader cost in the loss of ability to make non-reversible payments for non- reversible services. With the possibility of reversal, the need for trust spreads.

网上商业几乎完全实现依赖于专业的金融机构，作为可信的第三方来处理电子支付。虽然这个系统对绝大多数交易工作的足够好，但它仍然患有基于信任模型的固有弱点。完全不可逆交易是不可能的，因为金融机构不能避免调解纠纷。调解成本增加了交易成本，限制了最小实际交易规模，切断了小散交易的可能性，同时有一个更大的成本的能力的损失，就是不可逆服务的不可逆支付能力。随着逆转的可能性，也就需要信任传播。

Merchants must be wary of their customers, hassling them for more information than they would otherwise need. A certain percentage of fraud is accepted as unavoidable. These costs and payment uncertainties can be avoided in person by using physical currency, but no mechanism exists to make payments over a communications channel without a trusted party.What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers. In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.

商人必须警惕他们的客户，打扰他们获得自己将要不同的需要的更多信息。一定比例的欺诈被接受是不可避免的。这些费用和付款的不确定性可以被亲自避免通过使用实物货币，但是没有一种机制存在进行支付，在没有信任方的通信信道上。所需要的是一种基于加密验证来代替信任的电子支付系统，允许任何两个双方自愿的直接地进行互相交易，而没有可信的第三方。逆向计算不可行的交易将保护卖方，出现骗子，而日常代管机制可以很容易地实施，以保护买方。在论文中，我们提出了一个解决方案，使用点对点分布式时间戳服务器，产生时间顺序的计算证明，来解决双重支付问题。只要全体诚实节点比任何一个共同协作的攻击节点组控制更多的CPU功率，系统就很可靠。

Transactions

交易

We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding these to the end of the coin. A payee can verify the signatures to verify the chain of ownership.

我们将电子货币定义为数字签名链。每个拥有者传输货币下一个拥有者，通过数字签名以前交易的哈希值，还有就是公钥，将它们添加到下一个拥有者硬币的末端。收款人可以核实签名以核实所有权链。

The problem of course is the payee can't verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the company running the mint, with every transaction having to go through them, just like a bank.

课程问题是收款人不能核实拥有者之一没有同一个币花了两次。一个常见的解决方案是引入一个可信任的中心机构，即薄荷，它可以检查每笔交易的重复开支。每次交易后，硬币必须退还给造币厂发行一枚新硬币，而且只有从造币厂直接发行的硬币才值得信赖，不能重复使用。这个解决方案的问题在于整个货币系统的命运取决于运行铸币的公司，每一笔交易都要经过，就像一家银行。

We need a way for the payee to know that the previous owners did not sign any earlier transactions. For our purposes, the earliest transaction is the one that counts, so we don't care about later attempts to double-spend. The only way to confirm the absence of a transaction is to be aware of all transactions. In the mint based model, the mint was aware of all transactions and decided which arrived first. To accomplish this without a trusted party, transactions must be publicly announced , and we need a system for participants to agree on a single history of the order in which they were received. The payee needs proof that at the time of each transaction, the majority of nodes agreed it was the first received.

我们需要一种方式让收款人知道先前的所有者没有签署任何早先的交易。就我们的目的而言，最早的交易是算数的那笔，所以我们不在乎双重支付的后来尝试者。确认一笔交易的唯一方法是意识到所有交易。以薄荷为基础的的模型中，铸币厂知道所有交易并决定最先到达的哪一笔交易。为了实现没有可信的一方的这一点，交易必须公开播报，我们需要一个系统让参与者同意一个单一的顺序的接受的历史。收款人需要证明每次交易的时间点，大多数网点同意这是第一次收到的节点。

Timestamp Server

3.时间戳服务器

The solution we propose begins with a timestamp server. A timestamp server works by taking a hash of a block of items to be timestamped and widely publishing the hash, such as in a newspaper or Usenet post [2-5]. The timestamp proves that the data must have existed at the time, obviously, in order to get into the hash. Each timestamp includes the previous timestamp in its hash, forming a chain, with each additional timestamp reinforcing the ones before it.

我们提出的解决方案用一个时间戳服务器开始。时间戳服务器工作通过一个块的哈希值的项目被创建和广泛发布的哈希，如在报纸或新闻组帖子[2-5]。为了进入哈希表，时间戳证明了当时的数据显然是存在的。每个时间戳包含前一个时间戳在它的哈希中，形成一个链，每一个额外的时间戳增强它前面的一个时间戳。

Proof-of-Work

4.工作证明

To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a proof- of-work system similar to Adam Back's Hashcash [6], rather than newspaper or Usenet posts. The proof-of-work involves scanning for a value that when hashed, such as with SHA-256, the hash begins with a number of zero bits. The average work required is exponential in the number of zero bits required and can be verified by executing a single hash.

为了执行一个分布式时间戳服务器点对点的工作原理，我们将需要使用一个工作量证明类实现了一个分布式时间戳服务器在对等的基础上，我们将需要使用一个工作量证明的工作系统像Adam Back的hashcash 一样[ 6 ]，而不是报纸或新闻组的帖子。工作证明包括扫描一个值，当散列，如SHA-256，哈希开始与一些零位。所需的平均工作在所需的零位数中是指数的，并且可以通过执行单个散列来验证。似Adam Back的hashcash [ 6 ]的工作系统，而不是报纸或新闻组的帖子。工作证明包括扫描一个值，当散列，如SHA-256，哈希开始与一些零位。所需的平均工作在所需的零位数中是指数的，并且可以通过执行单个散列来验证。

未完待续……