适用于区块链的高效异步拜占庭容错算法

Efficient asynchronous Byzantine fault tolerance algorithm for blockchain

针对现有异步共识算法存在的多轮次通信开销大、随机抽签算法中缺乏信誉机制导致了较多的抽取次数等不足,提出了一种高效的异步拜占庭容错算法PenguinBFT。首先,在广播交易时直接广播原文,降低了共识通信开销;其次,引入了节点信誉评估机制,从网络情况相对稳定的节点集合中选取出块者,以减少随机抽取次数;最后,对网络节点进行分区,在请求交易缺失时,让不同的节点访问不同的分区进行交易恢复,既能减少通信开销又能提升交易恢复效率。实验结果表明,当节点规模达到64时,提出的PenguinBFT算法相较于Honey-BadgerBFT、DumboBFT和DispersedLedger算法,在通信开销、吞吐量和交易确认时延等方面均有50%以上的提升。

To address the limitations of existing asynchronous consensus algorithms,such as high communication overhead during multiple rounds and random selections due to the lack of reputation mechanism in random sampling,this paper proposed an efficient asynchronous Byzantine fault-tolerant algorithm called PenguinBFT.Firstly,this paper broadcasted transactions directly during transaction broadcasting to significantly reduce consensus communication overhead.Secondly,this paper introduced a node reputation evaluation mechanism to select a block generator from a relatively stable node set,which reduced the number of random selections required.Finally,this paper partitioned network nodes and different nodes access different partitions for transaction recovery when necessary,reducing communication overhead and improving transaction recovery efficiency.Experimental results demonstrate that when the number of nodes exceeds 64,the PenguinBFT algorithm shows more than 50%improvement in communication overhead,throughput,and transaction confirmation delay when compared to the Honey-BadgerBFT,DumboBFT,and DispersedLedger algorithms.