2025/09/13 by Mohammed Ziaul Haider, Haider, M. Z., Marcos Dias de Assunção +3 · 2 citations
Computer Science · #Blockchain Technology Applications and Security #Cloud Computing and Resource Management #Cryptography and Security (cs.CR) #Distributed #FOS: Computer and information sciences #IoT and Edge/Fog Computing #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2509.11006
openalex publication_date 2025/09/13 · openalex created_date 2025/10/12 · openalex updated_date 2026/07/29
Blockchain technology offers decentralization and security but struggles with scalability, particularly in enterprise settings where efficiency and controlled access are paramount. Sharding is a promising solution for private blockchains, yet existing approaches face challenges in coordinating shards, ensuring fault tolerance with limited nodes, and minimizing the high overhead of consensus mechanisms like PBFT. This paper proposes the Range-Based Sharding (RBS) Protocol, a novel sharding mechanism tailored for enterprise blockchains, implemented on Quorum. Unlike traditional sharding models such as OmniLedger and non-sharding Corda framework, RBS employs a commit-reveal scheme for secure and unbiased shard allocation, ensuring fair validator distribution while reducing cross-shard transaction delays. Our approach enhances scalability by balancing computational loads across shards, reducing consensus overhead, and improving parallel transaction execution. Experimental evaluations demonstrate that RBS achieves significantly higher throughput and lower latency compared to existing enterprise sharding frameworks, making it a viable and efficient solution for largescale blockchain deployments.