.png){kind=icon}
.png){kind=icon}
Return
Practical Byzantine fault tolerance consensus algorithm based on dynamic reputation evaluation and master node tenure
.png){kind=icon}
OA
AI
DOI：10.1007/s12083-026-02203-z.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Practical Byzantine Fault Tolerance (PBFT) lacks built-in incentives. It cannot mobilise node enthusiasm effectively. Master-node election is crude, insecure and improperly updated. This paper proposes a PBFT algorithm based on dynamic reputation evaluation and master-node term limits. The goal is to reward honest nodes for active consensus participation while ensuring every node can serve as master node. The improved algorithm formulates a reputation score from historical behaviour, consensus attendance and penalty count. The node with the highest reputation becomes master node, guaranteeing fairness. The algorithm also introduces a master-node term mechanism. It limits consecutive master-node selections. Every node thus gains a fair chance to be elected, reducing system centralisation. Experiments show that under low load the improved PBFT throughput rises 15–37% above original PBFT. Under high load the advantage widens to 75%. Average latency drops 30–60% across all load levels. The enhanced protocol boosts throughput, sustains node motivation and curbs master-node centralisation. This supports long-term stable operation.
Keywords:
Blockchain
Practical Byzantine fault tolerance
Dynamic reputation mechanism
Master node election
Tenure mechanism
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
2.2K
Citations:
2.9K