基于块链式存储的实用拜占庭容错共识算法研究
首发时间:2020-03-20
摘要:实用拜占庭容错共识算法(PBFT算法)是目前在联盟链中广泛采用的共识机制,然而PBFT算法的三阶段共识过程仍然过于复杂,导致算法存在执行效率低和扩展性差等问题。因此本文提出了基于块链式存储的实用拜占庭容错共识算法(B-PBFT算法),借助于块链式存储结构的特点--子区块数据生产校验均依赖于父区块,该算法只需要令节点间进行两轮通信既可完成共识过程,并且在视图变更阶段时若发现区块链存在分叉的风险就通过回滚部分区块数据的方法来保证节点之间的数据一致性。最后通过实验验证得出结论,在保证系统安全性和活性的前提下B-PBFT算法相较于PBFT算法具备更好的执行效率和扩展性。
关键词: 区块链;联盟链;拜占庭容错共识算法
For information in English, please click here
Research on Practical Byzantine Fault-tolerant Consensus Mechanism Based on Blockchain Storage
Abstract:The practical Byzantine fault-tolerant consensus algorithm (PBFT algorithm) is a consensus mechanism widely used in consortium blockchains. However, the three-phase consensus process of the PBFT algorithm is still too complicated, resulting in problems such as low execution efficiency and poor scalability. Therefore, this paper proposes a practical Byzantine fault-tolerant consensus algorithm (B-PBFT algorithm) based on block-chain storage. With the help of the characteristics of the block-chain storage structure--the production verification of child block data depends on the parent block, the algorithm only requires two rounds of communication between nodes to complete the consensus process, and if the blockchain is found to be at risk of forking during the view change phase, the data consistency between nodes is guaranteed by rolling back part of the block data. Finally, it is concluded through experimental verification that the B-PBFT algorithm has better execution efficiency and scalability than the PBFT algorithm under the premise of ensuring system security and activity.
Keywords: Blockchain Consortium Blockchains Byzantine Fault-tolerant Consensus
基金:
引用
No.****
动态公开评议
共计0人参与
勘误表
基于块链式存储的实用拜占庭容错共识算法研究
评论
全部评论