Search Results for id-trust

Abstract

Blockchain innovation is gaining attention in fields like monetary exchange, edge computing, medical care, and datasecurity. Consortium chains, using lightweight consensus algorithms like PBFT, offer alternatives to proof-based mechanisms while maintaining decentralization, security, and scalability. However, it also has some limitations and challenges that need to be addressed to improve its performance and scalability. PBFT is a classical algorithm with high complexity due to three-stage broadcasting and arbitrary selection of master nodes. Its communication efficiency is low, and scalability issues arise when nodes are large, causing significant delays and performance degradation in unstable networks. Furthermore, the requirement for every node to bundle, check, and broadcast the exchange list in the pre-prepared, prepared and commit stages diminishes the efficiency of consensus and performance between nodes and comes down on network correspondence. The research proposes a new methodology for the consensus algorithm, focusing on high-trust nodes to protect the network from malicious actors and reducing computational overhead and latency by eliminating Byzantian nodes and grouping the remaining nodes into groups, each of which has a main node selected based on a higher trust score. According to the results, the suggested methodology leads to significant improvements in communication complexity and Byzantine fault tolerance compared to standard PBFT networks and previous works. This indicates a substantial enhancement in network efficiency and scalability, offering promising prospects for blockchain applications in various fields.