论文标题
其部分的总和:联邦拜占庭协议系统的分析
The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems
论文作者
论文摘要
在共识协议的背景下,联邦拜占庭协议系统(FBASS)是一个引人入胜的新范式。 FBASS最初提议为稳定支付网络提供动力,可以实例化拜占庭法定人数系统,而无需对一组通用验证者进行带外协议;每个节点都可以自由决定自己需要协议。因此,可以在FBASS上构建抗Sybil且能节能的共识方案,而FBAS范式的“体重化”可能足以减少对环境不可持续的工作证明协议的使用。在本文中,我们首先说明如何通过确定其安全性和livesice缓冲液,从而可以与基于阈值的Quorum系统进行比较,从而确定单个FBASS的鲁棒性。然后,我们使用仿真和示例节点配置策略,然后从经验上研究以下假设:尽管可以通过自下而上的方式从单个偏好中以自下而上的方式进行fbass,但应由节点运算符应用策略考虑因素,以便到达可稳固且可受监测的FBASS。最后,我们研究了FBASS报告的“开放式成员”属性。我们观察到,一小组节点通常与确定LIVISE缓冲液相关,并证明该顶级的成员身份是由当前顶级节点批准的条件,如果保持安全性是核心要求。
Federated Byzantine Agreement Systems (FBASs) are a fascinating new paradigm in the context of consensus protocols. Originally proposed for powering the Stellar payment network, FBASs can instantiate Byzantine quorum systems without requiring out-of-band agreement on a common set of validators; every node is free to decide for itself with whom it requires agreement. Sybil-resistant and yet energy-efficient consensus protocols can therefore be built upon FBASs, and the "decentrality" possible with the FBAS paradigm might be sufficient to reduce the use of environmentally unsustainable proof-of-work protocols. In this paper, we first demonstrate how the robustness of individual FBASs can be determined, by precisely determining their safety and liveness buffers and therefore enabling a comparison with threshold-based quorum systems. Using simulations and example node configuration strategies, we then empirically investigate the hypothesis that while FBASs can be bootstrapped in a bottom-up fashion from individual preferences, strategic considerations should additionally be applied by node operators in order to arrive at FBASs that are robust and amenable to monitoring. Finally, we investigate the reported "open-membership" property of FBASs. We observe that an often small group of nodes is exclusively relevant for determining liveness buffers and prove that membership in this top tier is conditional on the approval by current top tier nodes if maintaining safety is a core requirement.