Scholarlink

<p>In order to solve the situation that the Leader node in the blockchain consensus algorithm HotStuff is randomly selected and the consensus success rate decreases significantly when facing the Byzantine node attack, this paper designs a consensus algorithm DR-HotStuff(Double Reputation evaluate- HotStuff) with double reputation evaluation model applicable to this complex environment. HotStuff), which maintains the advantages of low communication complexity of the HotStuff algorithm, combines with the dual reputation model to quickly screen out the Byzantine nodes in the consensus nodes, and assigns each node a corresponding identity based on different reputation values to reduce the probability that the Leader node is a malicious node, which further improves the stability and work efficiency of the blockchain. The experimental results show that the consensus algorithm has high throughput and low consensus delay, and can still eliminate most of the Byzantine nodes when the number of Byzantine nodes is greater than 30% and less than 50%, so that the efficiency of the blockchain can be restored to the optimal state through up to four rounds of consensus.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An improved HotStuff consensus algorithm based on a double reputation evaluate model

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月28日

查看全文
  • Dawei Xu,
  • Xiaolong Zhou,
  • Yunfang Liang,
  • Guogang Zhao,
  • Jian Zhao,
  • Dawen Sun

摘要

In order to solve the situation that the Leader node in the blockchain consensus algorithm HotStuff is randomly selected and the consensus success rate decreases significantly when facing the Byzantine node attack, this paper designs a consensus algorithm DR-HotStuff(Double Reputation evaluate- HotStuff) with double reputation evaluation model applicable to this complex environment. HotStuff), which maintains the advantages of low communication complexity of the HotStuff algorithm, combines with the dual reputation model to quickly screen out the Byzantine nodes in the consensus nodes, and assigns each node a corresponding identity based on different reputation values to reduce the probability that the Leader node is a malicious node, which further improves the stability and work efficiency of the blockchain. The experimental results show that the consensus algorithm has high throughput and low consensus delay, and can still eliminate most of the Byzantine nodes when the number of Byzantine nodes is greater than 30% and less than 50%, so that the efficiency of the blockchain can be restored to the optimal state through up to four rounds of consensus.