Research on Optimization of Byzantine Fault-Tolerant Consensus Algorithm Based on Involvement

The league chain is widely used in practical Byzantine fault tolerance consensus algorithm as the low throughput, delay higher problem. In order to solve the above problems, this paper proposes an optimization research of Byzantine fault tolerant consensus algorithm based on involvement, namely IBFT algorithm. During initialization, buffer node area, divided into node in the process of consensus dynamic add delete; As you progress through the consensus process, calculation with the involvement of consensus node number, in order to calculate its involvement; Finally, the nodes were dynamically replaced according to the level of involvement. The simulation results show that compared with the traditional PBFT algorithm, IBFT algorithm in the time delay are lower, in the process of consensus a greater throughput.