The Istanbul BFT Consensus Algorithm

Abstract

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\ge 3f+1$. During periods of good communication, IBFT achieves termination in three message delays and has $O(n^2)$ total communication complexity.

References in corpus (3)

• Revisiting Fast Practical Byzantine Fault Tolerance
• IBFT 2.0: A Safe and Live Variation of the IBFT Blockchain Consensus Protocol for Eventually Synchronous Networks
• Correctness Analysis of IBFT

Cited by in corpus (4)

• On the Suitability of Blockchain Platforms for IoT Applications: Architectures, Security, Privacy, and Performance
• An End-to-End Performance Comparison of Seven Permissioned Blockchain Systems
• Evaluation of a blockchain-enabled resource management mechanism for NGNs
• Consensus in Blockchain Systems with Low Network Throughput: A Systematic Mapping Study