高级检索
    路宇轩, 孔兰菊, 张宝晨, 闵新平. MC-RHotStuff:面向多链基于信誉的HotStuff共识机制[J]. 计算机研究与发展. DOI: 10.7544/issn1000-1239.202330195
    引用本文: 路宇轩, 孔兰菊, 张宝晨, 闵新平. MC-RHotStuff:面向多链基于信誉的HotStuff共识机制[J]. 计算机研究与发展. DOI: 10.7544/issn1000-1239.202330195
    Lu Yuxuan, Kong Lanju, Zhang Baochen, Min Xinping. MC-RHotStuff :Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202330195
    Citation: Lu Yuxuan, Kong Lanju, Zhang Baochen, Min Xinping. MC-RHotStuff :Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202330195

    MC-RHotStuff:面向多链基于信誉的HotStuff共识机制

    MC-RHotStuff :Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation

    • 摘要: 现有区块链呈现出多链趋势,传统共识算法不具备面向多链的动态扩展性,难以应对大规模联盟链开放使用与封闭运维的矛盾. 对此,提出了一种新颖的多链共识方法MC-RHotStuff:节点划分不同的角色,分为待准入节点、备选节点、共识节点,每条工作链都拥有共识节点和备选节点,待准入节点完成准入验证后将成为备选节点;共识节点拥有其他节点不具备的信誉值,做出正确行为的共识节点将提高信誉值,做出错误行为的共识节点将扣除信誉值,通过节点信誉计算及筛选算法MC-Scan来寻找信誉值异常的节点,并从备选节点中选择新的共识节点与异常节点交换;此外,还提出了节点动态调整算法MC-Schedule,通过检测每条区块链的交易量从而动态的调整共识节点的数量来达到最优化,既保证区块链系统的高效执行,又提高了节点筛选的速度;为保证当节点数量变化或共识群组成员发生变化时,共识机制能够正常运转,提出了节点状态同步机制MC-Syn.对此进行了大量的实验来验证其性能,与现有系统相比,交易吞吐量和延迟综合提升约15%.

       

      Abstract: The existing blockchain presents a multi-chain trend. Traditional consensus algorithms do not have dynamic scalability for multi-chain, making it difficult to cope with the contradiction between open use and closed maintenance of large-scale Permissioned Blockchain. For this question, a novel multi-chain consensus algorithm, MC-RHotStuff, is proposed: Nodes have different roles, including alternative nodes, candidate nodes, and consensus nodes. Each working chain has consensus nodes and alternative nodes. After the admission verification, the candidate node will become an alternative node; A consensus node has a reputation value that other nodes do not have. A consensus node that performs the correct behavior will increase the reputation value, while a consensus node that performs the wrong behavior will deduct the reputation value. The node with abnormal reputation value will be found through the node reputation calculation and filtering algorithm MC-Scan. And a new consensus node will be selected from the alternative nodes to exchange with the abnormal node; In addition, a dynamic node adjustment algorithm, MC-Schedule, is proposed to achieve optimization by detecting the transaction volume of each blockchain and dynamically adjusting the number of consensus nodes, which not only ensures the efficient execution of the blockchain system but also improves the speed of node filtering. MC-RHotStuff proposes a node state synchronization mechanism, MC-Syn, to ensure that the consensus operates normally when the node number change or the consensus group change. Compared to existing systems, transaction throughput, and latency have been comprehensively improved by about 15%.

       

    /

    返回文章
    返回