Scalable Blockchain Through Prioritised Sharding

Abstract

Blockchain Technology (BCT) relies on trust assumptions within distributed computing, involving independent nodes. Addressing scalability issues in Blockchain remains a continuous endeavor for researchers. In this research paper, authors introduced Prioritised Sharding (P-Sharding), a novel approach that enhances the scalability of Blockchain systems by prioritizing nodes based on their performance. We accomplish this through the use of advanced algorithms and real-time analytics. Our empirical findings demonstrate marked enhancements in aspects such as response times to queries, the accessibility of data, and the total throughput of the system. Moreover, our approach successfully diminishes the common bottlenecks imputed to the conventional sharding methods. This research significantly adds to the discussion regarding tactics for scalable data management, offering practical solutions for extensive, data-centric enterprises.