可验证随机函数的动态PBFT共识算法  

Dynamic PBFT consensus algorithm based on verifiable random functions

作　　者：吴帅珂 黄慧 WU Shuaike;HUANG Hui(School of Computer Science and Engineering,Minnan Normal University,Zhangzhou,Fujian 363000,China)

机构地区：[1]闽南师范大学计算机学院,福建漳州363000

出　　处：《闽南师范大学学报(自然科学版)》2025年第1期25-40,共16页Journal of Minnan Normal University:Natural Science

基　　金：福建省自然科学基金项目(2023J01920)。

摘　　要：共识算法是区块链系统的重要组成部分,其有效性直接影响到整个系统的实用性。实用拜占庭容错共识算法(practical byzantine fault tolerance,PBFT)是联盟链中被广泛应用的一种共识算法。目前的PBFT存在着视图切换开销过大、节点无法动态进出共识系统以及系统健壮性较差等问题。为此,提出一种基于可验证随机函数(verifiable random function,VRF)的动态拜占庭容错共识算法(adaptive dynamic byzantine fault tolerance,AD-BFT)。在该算法中,使用VRF算法优化原有视图切换过程,减少视图切换过程的通信量,提高共识吞吐量。设计了一套节点动态更新机制,用于处理节点动态进出共识网络的相关事务。最后,采用熔断机制,可以在系统出现节点大量脱机时防止共识系统崩溃,增强系统健壮性。实验结果与分析表明,所提出的AD-BFT相较于实用拜占庭容错共识算法(practical byzantine fault tolerance,PBFT)具有更低的共识时延与吞吐量,且能够在共识过程并行处理成员变更。The consensus algorithm is an important part of the blockchain system,and its effective‐ness directly affects the practicality of the whole system.Practical Byzantine Fault Tolerance(PBFT)is a widely used consensus algorithm in consortium blockchains.The current PBFT has problems such as excessive view-change overhead,nodes not being able to dynamically move in and out of the consensus system,and poor system robustness.This work proposes an adaptive dynamic Byzantine fault Tolerance(AD-BFT)algorithm based on verifiable random Function(VRF).In this work,the VRF algorithm is used to optimize the original view-change process,reduce the communication vol‐ume of the view-change process,and improve the consensus throughput.In this work,a set of node dynamic update mechanisms is designed to deal with the transactions related to the dynamic entry and exit of nodes into and out of the consensus network.Finally,a circuit breaker mechanism is used to prevent the consensus system from collapsing when a large number of nodes are offline in the sys‐tem and enhance the robustness of the system.Experimental results and analysis show that the pro‐posed AD-BFT has lower consensus latency and throughput compared with practical Byzantine fault tolerance(PBFT)and can process membership changes in parallel during the consensus process.

关 键 词：共识算法 区块链 联盟链 PBFT VRF 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]