Byzantine Fault Tolerant Consensus Algorithm Based on Credit Model and Verifiable Random Function
Xiaofan Yu, Yanru Zhong, Zhaoyi Zhang · 2022
Blockchain technology has the advantages of decentralization, data tampering and data transparency, so that the application field of this technology continues to expand. However, the current consensus algorithm applied in blockchain system has some problems, such as arbitrary selection of master nodes, high communication complexity and low consensus efficiency. An enhanced consensus algorithm (BV-PBFT) is suggested in this study. The consensus protocol is simplified, the communication complexity of the algorithm is reduced, and the effectiveness of consensus is improved. First, the credit value of nodes is calculated by the credit model, and according to the credit value of nodes, the nodes in the network are divided into three types of nodes with different responsibilities. Secondly, the random and verifiable characteristics of verifiable random function (VRF) are used to construct an anonymous master selection algorithm to improve the selection of master nodes. According to experimental findings, the suggested consensus algorithm, when compared to the PBFT method, minimizes the time complexity from to , significantly lowers communication overhead and consensus delay in the network, and increases consensus efficiency and throughput.