GoldenGolden
Advanced Search
Practical Byzantine Fault Tolerance Algorithm

Practical Byzantine Fault Tolerance Algorithm

Practical Byzantine Fault Tolerance algorithm (PBFT) provides Byzantine state machine replication at high speed and low cost such that it can be used for improved system safety in real world applications.

All edits by  Dawson Sewell 

Edits on 1 Sep, 2020
Dawson Sewell
Dawson Sewell edited on 1 Sep, 2020
Edits made to:
Infobox (+2 properties)
Infobox
Is a
Technology
Related technology
Edits on 8 Feb, 2019
Dawson Sewell
Dawson Sewell edited on 8 Feb, 2019
Edits made to:
Description (+4/-4 characters)
Article (+4/-4 characters)
Topic thumbnail

Practical Byzantine Fault Tolerance Algorithm

Practical Byzantine Fault Tolerance algorithm (pBFTPBFT) provides Byzantine state machine replication at high speed and low cost such that it can be used for improved system safety in real world applications.

Article

The first practical Byzantine Fault Tolerance (pBFTPBFT) algorithm was introduced in a 1999 academic paper by Miguel Castro and Barbara Liskov. The pBFT algorithm is robust in order to survive Byzantine faults in asynchronous environments and is optimized to have high processing speeds / low latency such that it can be used in everyday applications.

Golden logo
Text is available under the Creative Commons Attribution-ShareAlike 4.0; additional terms apply. By using this site, you agree to our Terms & Conditions.