arrow
Return

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

delete2025-02-12
delete0
PRE
AI
Y
Yu Lan
H
Hui Huang *
Z
Zhenjie Huang
Q
Qunshan Chen
S
S.T. Wu
DOI:10.1007/s11227-025-06995-4delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=100$$\end{document}, compared to HBBFT, the throughput of ERBFT has increased by 137.4%, and the latency has decreased by 58.4%.
Keywords:
Consensus
Blockchain
Byzantine-fault tolerance
verifiable random function
provable broadcast

Journal

Journal of Supercomputing cover
Journal of Supercomputing
IF:
2.7
Papers:
1.1K
Citations:
1.0W

Organization

K
Key Lab Data Sci and Intelligence Applicat
Scholars:
1
Papers: 1
Citations: 0
M
Minnan Normal Univ
Scholars:
230
Papers: 73
Citations: 9
F
Fujian Key Lab Granular Comp and Applicat
Scholars:
3
Papers: 3
Citations: 0
researcher View more organizations