关键词: FastHotStuff算法, 领导者等待策略, 视图动态超时策略, 基于信誉值的领导者选择策略, 拜占庭容错

Abstract: The FastHotStuff algorithm achieves a twostage pipelined Byzantine fault tolerant consensus through aggregated signatures. When the leader node of FastHotStuff fails, the deadlock problem in the view change phase brings communication complexity of O(n2). However, current studies have only focused on the deadlock problem and have not considered the issue of continuous view timeouts caused by Byzantine nodes and volatile networks. To address this problem, we propose a FastHotStuff blockchain consensus algorithm with adaptive view dynamic timeouts, called AVDHotStuff. First, the view dynamic timeout strategy algorithm adaptively controls the duration of the next view timeout to avoid continuous view timeouts caused by volatile networks. Second, the leader waiting strategy algorithm reduces the communication complexity of view change from O(n2) to O(n), and ensures the efficiency of view change by adaptively controlling the leader waiting time. Finally, the reputationbased leader selection strategy algorithm introduces reliable nodes into the consensus process, avoiding continuous view timeouts by removing Byzantine nodes during the view change phase. We have conducted experiments to compare our algorithm with FastHotStuff. When Byzantine nodes are present, the average throughput of AVDHotStuff increases by approximately 51.4%, and its average latency decreases by about 59.9%.

Key words: FastHotStuff algorithm, leader waiting strategy, view dynamic timeout strategy, reputationbased leader selection optimization strategy, Byzantine fault tolerance