Research on Byzantine Fault Tolerant algorithm based on Node Weights

In order to solve the problems of low consensus efficiency and slow query speed of PBFT consensus algorithm in alliance chain, a Byzantine Fault Tolerance based on Node Weights (NW-BFT) algorithm is proposed. NW-BFT algorithm measures node weight by using ledger model to record the historical online time and workload of nodes. To solve the problem of lack of reliable time source, the algorithm uses node history proof to verify the online time of nodes, so as to provide consistent verifiable time interval data for the network. Set the decentralization mechanism to select the subLeader to ensure the effectiveness of view change protocol. The experiment shows that NW-BFT is better than PBFT and TWV in efficiency and safety.