Improving Byzantine Fault Tolerance Based on Stake Evaluation and Consistent Hashing
preprint
OA: closed
Abstract
In the context of distributed systems, Byzantine fault tolerance plays a critical role in ensuring the normal operation of the system, particularly when facing with malicious nodes. However, challenges remain in enhancing the security and reliability of Byzantine fault-tolerant systems. This paper addresses these challenges by improving a Byzantine fault-tolerant approach based on stake evaluation and improved consistency hashing. We propose a method that leverages node stakes to enhance system security and reliability by allocating different trust values. Additionally, we introduce improvements to the consistency hashing technique, enabling its effective operation in a Byzantine fault-tolerant environment. By introducing redundant nodes on the hash ring to mitigate the impact of malicious nodes, we enhance system fault tolerance and scalability. Experimental results demonstrate a significant improvement in system security and performance using this approach. These findings suggest that our method holds considerable potential for widespread application in the field of Byzantine fault tolerance, supporting the development of more reliable blockchain systems.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00