Safety guarantees and security-latency problem of Nakamoto consensus have been extensively studied in the last decade with a bounded delay model. Recent studies have shown that PoW protocol is secure under random delay models as well. In this paper, we analyze the security-latency problem, i.e., how secure a block is, after it becomes k-deep in the blockchain, under general random delay distributions. We provide tight and explicit bounds which only require determining the distribution of the number of Poisson arrivals during the random delay. We further consider potential effects of recent Bitcoin halving on the security-latency problem by extending our results.

翻译：在过去的十年中，基于有界延迟模型，纳卡莫托共识的安全性保障和安全性延迟问题得到了广泛研究。近期研究表明，工作量证明协议在随机延迟模型下同样具有安全性。本文分析了在一般随机延迟分布下，一个区块在区块链上达到k深度后的安全性延迟问题，即该区块的安全程度。我们给出了紧致且显式的界，该界仅需确定随机延迟期间泊松到达数量的分布。此外，通过扩展我们的结果，进一步研究了近期比特币减半对安全性延迟问题的潜在影响。