Page "Byzantine fault tolerance" Paragraph 13

Byzantine fault tolerant replication protocols were long considered too expensive to be practical.

Then in 1999, Miguel Castro and Barbara Liskov introduced the " Practical Byzantine Fault Tolerance " ( PBFT ) algorithm, which provides high-performance Byzantine state machine replication, processing thousands of requests per second with sub-millisecond increases in latency.