论文标题
比特币的潜伏期 - 安全分析变得简单
Bitcoin's Latency--Security Analysis Made Simple
论文作者
论文摘要
为了确认深度,诚实和对抗性块挖掘速率以及块繁殖延迟的上限,开发了简单的封闭形式的上限和下限,以确认深度,诚实和对抗性块挖掘速率以及上限。在确认深度中,界限是指数级的,无论对手的攻击策略如何,都需要应用。对于比特币的参数,上限和下限之间的差距很小。例如,假设平均块间隔为10分钟,网络延迟限制为10秒和10%的对抗性挖掘功率,则广泛使用的6块街区确认规则会在0.11%至0.35%的概率之间产生安全性违规。
Simple closed-form upper and lower bounds are developed for the security of the Nakamoto consensus as a function of the confirmation depth, the honest and adversarial block mining rates, and an upper bound on the block propagation delay. The bounds are exponential in the confirmation depth and apply regardless of the adversary's attack strategy. The gap between the upper and lower bounds is small for Bitcoin's parameters. For example, assuming an average block interval of 10 minutes, a network delay bound of ten seconds, and 10% adversarial mining power, the widely used 6-block confirmation rule yields a safety violation between 0.11% and 0.35% probability.