基于PBFT算法的分片技术的研究

Research on Fragmentation Technology Based on PBFT Algorithm

区块链作为分布式共识领域的一种集成创新,备受技术人员和研究者的关注,但目前区块链仍面临扩展性问题亟待解决,分片技术是迄今为止被认为最能够解决区块链系统扩展性的最实用的解决方案,但目前分片技术也存在一些问题,当节点被分配到分片时,拜占庭节点也会被分配到各个分片中,当采用实用拜占庭容错算法(Practical Byzantine Fault Tolerance,PBFT)后可能无法保证分片数据的可信性。针对以上问题,提出了基于PBFT共识算法通过动态权重(Dynamic weight)和聚合签名改进的动态实用拜占庭容错算法(Dynamic Practical Byzantine Fault Tolerance,DPBFT),通过给节点增加动态权重进行节点随机分配以及对节点达成共识算法进行改进确保分片数据的可信性,并通过实验验证了改进后的算法可有效地提高系统容错性、交易吞吐量并降低了交易延迟。

As an integrated innovation in the field of distributed consensus,blockchain has attracted the attention of techni-cians and researchers.However,at present,blockchain still faces the problem of scalability,which needs to be solved urgently.Fragmentation technology is considered to be the most practical solution to solve the scalability of blockchain system so far.Howev-er,there are also some problems in fragmentation technology.When nodes are allocated to fragmentation,it is necessary to pay at-tention to that its court nodes will also be allocated to each partition.When practical Byzantine fault tolerance(PBFT)algorithm is used,the credibility of partition data may not be guaranteed.To solve the above problems,a dynamic practical Byzantine fault algo-rithm based on PBFT consensus algorithm is proposed,which is improved by dynamic weight and aggregate signature(DPBFT)and ensures the credibility of partitioned data by adding dynamic weights to nodes for random allocation and improving the consensus al-gorithm.Experiments show that the improved algorithm can effectively improve the system fault tolerance,transaction throughput and reduce transaction delay.