论文标题
伊斯坦布尔BFT共识算法
The Istanbul BFT Consensus Algorithm
论文作者
论文摘要
本文介绍了IBFT，这是一种简单而优雅的拜占庭耐药性共识算法，用于在\ emph {quorum}区块链中实现状态机的复制。 IBFT假设了一个部分同步通信模型，在该模型中，安全不取决于任何时间假设，只有livices取决于同步周期。该算法是确定性的，基于领导者且最佳弹性的 - $ f $ frangy流程不超出$ n $，其中$ n \ geq 3f+1 $。在良好的沟通期间，IBFT在三个消息延迟中实现了终止，并且具有$ O（n^2）$总沟通复杂性。
This paper presents IBFT, a simple and elegant Byzantine fault-tolerant consensus algorithm that is used to implement state machine replication in the \emph{Quorum} blockchain. IBFT assumes a partially synchronous communication model, where safety does not depend on any timing assumptions and only liveness depends on periods of synchrony. The algorithm is deterministic, leader-based, and optimally resilient - tolerating $f$ faulty processes out of $n$, where $n \geq 3f+1$. During periods of good communication, IBFT achieves termination in three message delays and has $O(n^2)$ total communication complexity.
