论文标题
超越门槛的共识：广义的拜占庭法定人数现场
Consensus Beyond Thresholds: Generalized Byzantine Quorums Made Live
论文作者
论文摘要
现有的拜占庭耐药（BFT）共识协议仅解决阈值失败，而参与节点彼此独立失败，每个人都可能失败，并且该协议的保证遵循的简单限制了故障节点的数量。然而，随着拜占庭在区块链和分布式分类帐中的广泛部署，需要更复杂的信任假设。 本文介绍了与广义法定人数的首次实施BFT共识。它始于许多以实践为动机的广义信任结构，并探讨了有效指定和实施它们的方法。特别是，它通过具有阈值运算符的单调布尔公式（MBF）和单调跨度程序（MSP）（MSP）表示信任假设，这是一种用于计算的线性代数模型。 还描述了使用这些法定系统的HotStuff BFT共识的实现，并与现有阈值模型进行了比较。 HotStuff运行多达40个复制品的基准测试表明，MBF规范不会产生明显的放缓，而MSP表达式由于所涉及的计算而显着影响潜伏期和吞吐量。
Existing Byzantine fault-tolerant (BFT) consensus protocols address only threshold failures, where the participating nodes fail independently of each other, each one fails equally likely, and the protocol's guarantees follow from a simple bound on the number of faulty nodes. With the widespread deployment of Byzantine consensus in blockchains and distributed ledgers today, however, more sophisticated trust assumptions are needed. This paper presents the first implementation of BFT consensus with generalized quorums. It starts from a number of generalized trust structures motivated by practice and explores methods to specify and implement them efficiently. In particular, it expresses the trust assumption by a monotone Boolean formula (MBF) with threshold operators and by a monotone span program (MSP), a linear-algebraic model for computation. An implementation of HotStuff BFT consensus using these quorum systems is described as well and compared to the existing threshold model. Benchmarks with HotStuff running on up to 40 replicas demonstrate that the MBF specification incurs no significant slowdown, whereas the MSP expression affects latency and throughput noticeably due to the involved computations.
