Byzantine Fault Tolerance algorithms
GPTKB entity
Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:category |
fault-tolerant consensus algorithms
|
| gptkbp:example |
gptkb:Practical_Byzantine_Fault_Tolerance_(PBFT)
gptkb:Tendermint gptkb:Honey_Badger_BFT gptkb:HotStuff gptkb:Zyzzyva |
| gptkbp:field |
computer science
distributed computing |
| gptkbp:namedAfter |
gptkb:Byzantine_Generals_Problem
|
| gptkbp:origin |
gptkb:Byzantine_Generals_Problem_(1982)
|
| gptkbp:property |
tolerate up to one-third faulty nodes
|
| gptkbp:purpose |
achieve consensus in presence of faulty or malicious nodes
|
| gptkbp:relatedConcept |
gptkb:algorithm
gptkb:Byzantine_agreement asynchronous system |
| gptkbp:requires |
at least 3f+1 nodes to tolerate f faulty nodes
|
| gptkbp:usedIn |
gptkb:cryptocurrency
distributed databases replicated state machines |
| gptkbp:bfsParent |
gptkb:Byzantine_Generals_Problem
gptkb:The_Byzantine_Generals_Problem |
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Byzantine Fault Tolerance algorithms
|