随机时延下的最长链协议
The Longest-Chain Protocol Under Random Delays
摘要：
在分布式共识和区块链领域，同步通信模型假设诚实方之间的所有消息最多延迟一个已知常数$Δ$。最近的文献表明，最长链的区块链协议在同步模型下是安全的。但是，对于固定的挖掘速率，安全性保证会随着$Δ$而降低。我们分析了最长链协议的性能的假设下，通信延迟是随机的，独立的，和相同的分布。该通信模型允许具有无界支持的分布，并且是同步模型的严格概括。我们提供安全性和活性的保证，简单，明确的边界上的故障概率。这些界限适用于无限时域执行，并随安全参数呈指数衰减。特别是，我们表明，最长链协议具有良好的安全保证时，延迟是偶发性的大，可能是无界的，这是反映了现实世界的网络条件。
英文摘要：
In the field of distributed consensus and blockchains, the synchronous communication model assumes that all messages between honest parties are delayed at most by a known constant $Δ$. Recent literature establishes that the longest-chain blockchain protocol is secure under the synchronous model. However, for a fixed mining rate, the security guarantees degrade with $Δ$. We analyze the performance of the longest-chain protocol under the assumption that the communication delays are random, independent, and identically distributed. This communication model allows for distributions with unbounded support and is a strict generalization of the synchronous model. We provide safety and liveness guarantees with simple, explicit bounds on the failure probabilities. These bounds hold for infinite-horizon executions and decay exponentially with the security parameter. In particular, we show that the longest-chain protocol has good security guarantees when delays are sporadically large and possibly unbounded, which is reflective of real-world network conditions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
