论文标题
一切都是一场比赛，中村总是赢
Everything is a Race and Nakamoto Always Wins
论文作者
论文摘要
中村发明了最长的链条协议，并通过分析私人双重攻击，这是对手和诚实节点之间的竞赛，以增长更长的链条。但这是最糟糕的攻击吗？我们针对三类最长的链条协议的肯定问题回答了这个问题，该问题是为不同共识模型设计的：1）Nakamoto的原始工作证明协议； 2）Ouroboros和Snowwhite Stires验证方案； 3）CHIA空间证明协议。因此，获得每个协议的最大耐受对手功率的精确表征，这是通过网络延迟标准化的平均块时间的函数。这些协议的安全分析是通过将所有攻击减少到对手和诚实节点之间种族中所有攻击的新方法以统一的方式进行的。
Nakamoto invented the longest chain protocol, and claimed its security by analyzing the private double-spend attack, a race between the adversary and the honest nodes to grow a longer chain. But is it the worst attack? We answer the question in the affirmative for three classes of longest chain protocols, designed for different consensus models: 1) Nakamoto's original Proof-of-Work protocol; 2) Ouroboros and SnowWhite Proof-of-Stake protocols; 3) Chia Proof-of-Space protocol. As a consequence, exact characterization of the maximum tolerable adversary power is obtained for each protocol as a function of the average block time normalized by the network delay. The security analysis of these protocols is performed in a unified manner by a novel method of reducing all attacks to a race between the adversary and the honest nodes.
