https://github.com/ConsenSys/quorum-ibft

https://github.com/ConsenSys/quorum-ibft

Last synced: about 1 month ago
JSON representation

• Host: GitHub
• URL: https://github.com/ConsenSys/quorum-ibft
• Owner: Consensys
• Archived: true
• Created: 2020-06-10T20:04:27.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2020-08-27T13:31:22.000Z (about 4 years ago)
• Last Synced: 2024-04-23T04:57:03.976Z (5 months ago)
• Size: 445 KB
• Stars: 4
• Watchers: 14
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

• awesome-quorum - BFT specifications - Paper describing the BFT Consensus Algorithm, a simple and elegant algorithm for Byzantine fault-tolerant consensus and is used to implement state machine replication in the Quorum blockchain (Documentation / Specifications)

README

        
# The Istanbul BFT Consensus Algorithm

This repository contains authoritative paper describing the Istanbul BFT Consensus Algorithm, or IBFT, for short. IBFT is a simple and elegant algorithm for Byzantine fault-tolerant consensus and is used to implement state machine replication in the *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* is equal or greater than *3f+1*. During periods of good communication, IBFT achieves termination in three message delays and has *O(n^2)* total communication complexity.