Byzantine Fault Tolerant Algorithm based on Vote

Practical Byzantine Fault Tolerance (PBFT) algorithm is a popular solution for establishing consensus in blockchain systems. However, there are some issues in the PBFT algorithm, such as high energy consumption, low efficiency, and poor scalability. These problems are not solved even in some of its improved algorithms, such as Byzantine consensus algorithm based on Gossip protocol (GBC) and Credit Practical Byzantine Fault Tolerance (CBPFT) algorithms. To address these issues, this paper proposes a Byzantine Fault Tolerant algorithm based on Vote algorithm (vBFT). The nodes in the network are divided into three types of with different responsibilities by the vBFT algorithm, which are client, slave, and master nodes. The state between nodes could be dynamically adjusted at any time. As shown our simulations and analysis, the proposed algorithm has significantly improved performance in terms of dynamics, energy consumption, fault tolerance and low-latency compared with consensus algorithms such as PBFT, GBC and CBPFT algorithm.