January 2019
Beginner to intermediate
372 pages
11h 17m
English
Consensus algorithms were designed in distributed systems to tolerate Byzantine faults relating to the Byzantine generals' problem (refer to Chapter 1, Introduction, for a definition of the Byzantine generals' problem). Though PoW and PoS have tolerance to Byzantine faults, it comes at a cost. Several variants of Byzantine Fault Tolerance (BFT) consensus models have been proposed as solutions to this problem in untrusted distributed networks.