论文标题
在网络延迟下精制的比特币安全延迟
Refined Bitcoin Security-Latency Under Network Delay
论文作者
论文摘要
我们研究了中amoto共识的安全延迟范围，即在链条中变成$ k $ - 深度之后的安全性。我们通过分析三个不同阶段的对抗性和诚实链之间的种族来改善最新界限。我们发现，在模型下，对抗链的生长的概率分布类似于[Guo，ren中的模型；船尾2022]当目标块变为链条中的$ k $ - 深处。我们分析了该竞赛的某些特性，以与现有结果相比，提供更紧密的界限的随机步道对每个阶段进行建模。将这三个阶段组合在一起为具有小$λδ$的区块链提供了新颖的上限和下限。
We study security-latency bounds for Nakamoto consensus, i.e., how secure a block is after it becomes $k$-deep in the chain. We improve the state-of-the-art bounds by analyzing the race between adversarial and honest chains in three different phases. We find the probability distribution of the growth of the adversarial chains under models similar to those in [Guo, Ren; AFT 2022] when a target block becomes $k$-deep in the chain. We analyze certain properties of this race to model each phase with random walks that provide tighter bounds than the existing results. Combining all three phases provides novel upper and lower bounds for blockchains with small $λΔ$.
