Scholarlink

<p>The asynchronous Byzantine-fault tolerance (BFT) protocols are widely adopted in mission-critical tasks. However, existing asynchronous consensus algorithms, such as Honey Badger BFT (HBBFT) and DumboBFT, still suffer from bandwidth waste, excessive producer election rounds, and low consensus efficiency. Therefore, exploring optimized solutions for current asynchronous consensus algorithms is imperative to enhance efficiency. This work proposes an improved asynchronous BFT with erasure code and verifiable random function (ERBFT). By incorporating an erasure code scheme, ERBFT optimizes the provable broadcast protocol to decrease unnecessary bandwidth wastage and message complexity. Based on the node’s performance during the broadcast phase, a comprehensive node activity evaluation mechanism has been devised to calculate the node’s activity level. When integrated with verifiable random function, this activity level facilitates the efficient selection of a producer from among the active nodes. This integration enhances the efficiency of reaching consensus and effectively diminishes the frequency of producer elections. Finally, the theoretical and experimental analysis shows that ERBFT has notably higher throughput and significantly lower latency than HBBFT, Dumbo2, and sDumbo. Specifically, when <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11227_2025_6995_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="57" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=100\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>100</mn> </mrow> </math></EquationSource> </InlineEquation>, compared to HBBFT, the throughput of ERBFT has increased by 137.4%, and the latency has decreased by 58.4%.</p>

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

ERBFT: improved asynchronous BFT with erasure code and verifiable random function

  • 期刊论文

  • 发表日期：

    2025年2月12日

查看全文
  • Yu Lan,
  • Hui Huang,
  • Zhenjie Huang,
  • Qunshan Chen,
  • Shuaike Wu

摘要

The asynchronous Byzantine-fault tolerance (BFT) protocols are widely adopted in mission-critical tasks. However, existing asynchronous consensus algorithms, such as Honey Badger BFT (HBBFT) and DumboBFT, still suffer from bandwidth waste, excessive producer election rounds, and low consensus efficiency. Therefore, exploring optimized solutions for current asynchronous consensus algorithms is imperative to enhance efficiency. This work proposes an improved asynchronous BFT with erasure code and verifiable random function (ERBFT). By incorporating an erasure code scheme, ERBFT optimizes the provable broadcast protocol to decrease unnecessary bandwidth wastage and message complexity. Based on the node’s performance during the broadcast phase, a comprehensive node activity evaluation mechanism has been devised to calculate the node’s activity level. When integrated with verifiable random function, this activity level facilitates the efficient selection of a producer from among the active nodes. This integration enhances the efficiency of reaching consensus and effectively diminishes the frequency of producer elections. Finally, the theoretical and experimental analysis shows that ERBFT has notably higher throughput and significantly lower latency than HBBFT, Dumbo2, and sDumbo. Specifically, when \(n=100\) n = 100 , compared to HBBFT, the throughput of ERBFT has increased by 137.4%, and the latency has decreased by 58.4%.