论文标题
无许可网络中的法定系统
Quorum Systems in Permissionless Network
论文作者
论文摘要
容易产生故障的系统及其法定系统是用于设计分布式算法的有用工具。但是，到目前为止所研究的容易产生的系统要求每个过程都知道完整的系统成员资格，以通过全球相交的法定人数来确保安全。因此，在可能无法使用的知识的情况下，它们在无许可的环境中几乎没有帮助。我们建议概括容易产生故障的系统的理论，以使其适用于无许可的系统。我们这样做是通过启用过程不仅可以对失败做出假设，还可以对其他过程的假设做出假设。因此，通过传递性，甚至不知道任何共同过程的过程可能仍然与法定人数相交并求解，例如，可靠的广播。我们的模型概括了现有模型，例如经典易失败的系统模型[Malkhi and Reiter，1998]和不对称的易失败系统模型[Cachin and Tackmann，Opodis 2019]。此外，它以恒星区块链使用的模型的标准形式主义给出了表征。
Fail-prone systems, and their quorum systems, are useful tools for the design of distributed algorithms. However, fail-prone systems as studied so far require every process to know the full system membership in order to guarantee safety through globally intersecting quorums. Thus, they are of little help in an open, permissionless setting, where such knowledge may not be available. We propose to generalize the theory of fail-prone systems to make it applicable to permissionless systems. We do so by enabling processes not only to make assumptions about failures, but also to make assumptions about the assumptions of other processes. Thus, by transitivity, processes that do not even know of any common process may nevertheless have intersecting quorums and solve, for example, reliable broadcast. Our model generalizes existing models such as the classic fail-prone system model [Malkhi and Reiter, 1998] and the asymmetric fail-prone system model [Cachin and Tackmann, OPODIS 2019]. Moreover, it gives a characterization with standard formalism of the model used by the Stellar blockchain.
