REVIEW 2 cited by
The Istanbul BFT Consensus Algorithm
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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 \geq 3f+1$. During periods of good communication, IBFT achieves termination in three message delays and has $O(n^2)$ total communication complexity.
Forward citations
Cited by 2 Pith papers
-
Toward Practical Decentralized Proof-of-Location via Physical Witnessing Zones
A four-witness UWB prototype with a BFT ledger produced location proofs at 0.18 m mean error in one indoor room and rejected simulated out-of-zone, stale-reference, and range-inflation attacks.
-
Decentralization in PoS Blockchain Consensus: Quantification and Advancement
Square-root and logarithmic stake-weighting functions raise decentralization metrics by about 51% and 132% respectively across ten PoS blockchains, but the claims depend on an unresolved Sybil-cost assumption.
Discussion (0). Continue with ORCID to comment.