Research and Application of BFT Algorithms Based on the Hybrid Fault Model

The recent explosion of interest in blockchain led to a plethora of researches on consensus algorithms. Compared with bitcoin-derived consensus mechanisms, Byzantine Fault-Tolerance (BFT) algorithms are more applicable for consortium blockchain. However, these algorithms work lies in the foundation that 3f + 1 nodes are required to tolerate only f faults, which results in high network traffic and cost. The hybrid fault model with Trusted Components (TC) assistance is proposed to reduce the minimum to 2f +1 and improve overall performance. In this paper, we firstly introduce the basic principles of BFT algorithms based on the hybrid fault model. Then we analyze different TC abstractions and implementation scenarios, and express our own choices. The general framework for BFT algorithms design choices and the applications of this model in blockchain are also discussed. Therefore, this paper aims to provide guidance for reasonable design of efficient BFT algorithms and application of TC assistance mechanism.