论文标题
平行工作证明与具体边界
Parallel Proof-of-Work with Concrete Bounds
论文作者
论文摘要
在不能依赖节点识别的分布式系统中，授权具有挑战性。工作证明提供了一种替代的守门机制，但其概率性质与常规安全定义不相容。最近的相关工作确立了比特币顺序工作证明机制的失败概率的具体界限。我们使用并行的工作证明提出了一个国家复制协议家族。我们从协议子协议的自下而上的设计使我们能够为对抗性同步网络的故障概率提供具体的界限。在典型的10分钟间隔之后，平行工作证明提供了两个数量级的安全性，比顺序的工作证明。这意味着状态更新可以足够安全，可以在一个块之后（即10分钟后）提供支持，从而消除了许多应用程序中双支出的风险。我们提供有关广泛网络和攻击者假设的最佳参数选择的指导。模拟表明，拟议的构造与违反设计假设的行为是强大的。
Authorization is challenging in distributed systems that cannot rely on the identification of nodes. Proof-of-work offers an alternative gate-keeping mechanism, but its probabilistic nature is incompatible with conventional security definitions. Recent related work establishes concrete bounds for the failure probability of Bitcoin's sequential proof-of-work mechanism. We propose a family of state replication protocols using parallel proof-of-work. Our bottom-up design from an agreement sub-protocol allows us to give concrete bounds for the failure probability in adversarial synchronous networks. After the typical interval of 10 minutes, parallel proof-of-work offers two orders of magnitude more security than sequential proof-of-work. This means that state updates can be sufficiently secure to support commits after one block (i.e., after 10 minutes), removing the risk of double-spending in many applications. We offer guidance on the optimal choice of parameters for a wide range of network and attacker assumptions. Simulations show that the proposed construction is robust against violations of design assumptions.
