计算机技术与发展2024，Vol.34Issue(5)：16-23,8.DOI:10.20165/j.cnki.ISSN1673-629X.2024.0035
基于哈希值分组和信任主节点选取的共识机制
Consensus Mechanism Based on Hash Grouping and Trust Primary Node Selection
摘要
Abstract
Practical Byzantine Fault Tolerance algorithm(PBFT)is one of the most popular consensus mechanisms.However,the com-munication mode of its broadcast leads to high communication complexity.Although the improved method of hierarchical node consensus reduces the communication scale of the algorithm,there are still shortcomings in security and efficiency of the algorithm.Based on this,an improved HBFT algorithm is proposed.Firstly,the nodes are grouped according to the hash value of MAC address,which increases the randomness of node grouping and makes the distribution of Byzantine nodes more uniform.Secondly,the consensus process,commu-nication content and view replacement protocol of the algorithm are optimized to further reduce the communication scale and improve the speed of master node replacement and fault handling.Finally,the credit mechanism is introduced and the master node is selected based on it.It improves the reliability of the master node and the security of the algorithm.From the perspective of theory,experiment and safety,it is showed that the consensus efficiency of HBFT algorithm is improved by 96.1%～98.6%and 51.3%～89.7%compared with PBFT algorithm and layer-based improved algorithm.In addition,HBFT algorithm has higher security.关键词
区块链/共识机制/哈希函数/信誉模型/共识效率Key words
blockchain/consensus mechanism/hash function/reputation model/consensus efficiency分类
信息技术与安全科学引用本文复制引用
韩昊澎,金瑜..基于哈希值分组和信任主节点选取的共识机制[J].计算机技术与发展,2024,34(5):16-23,8.基金项目
国家自然科学基金项目(61802286) （61802286）
