Blockchain-Enabled Distributed Computing Framework for Optimized and Secure Resource Allocation via Smart Contract Verification

Abstract

As distributed computing systems evolve, secure and verifiable resource allocation in ride-sharing platforms remains a critical challenge due to inefficiencies in traditional centralized systems. This paper presents a blockchain-based framework integrating smart contracts with a hybrid optimization algorithm to achieve efficient, transparent, and fair resource allocation. The framework employs a three-phase approach, pre-filtering, weighted bipartite matching, and iterative refinement, combined with distributed consensus mechanisms to optimize driver-rider assignments in real-time (within 5s latency). Computational experiments simulating an urban ride-sharing network with 1,000 drivers and 5,000 riders demonstrate that our framework achieves an average encryption time of 1.66 seconds, decryption time of 1.65 seconds, and verification time of 9.2 ms per transaction, ensuring security and auditability with minimal overhead. Compared to centralized SOTA approaches, it reduces computational overhead by 32% (relative to total processing cost) while improving scalability (sub-5-second latency at scale) and fairness (Gini coefficient of 0.15 vs. 0.38 in baselines). Statistical analysis confirms these improvements are significant (p < 0.01) across efficiency, fairness, and transparency metrics. This work offers a scalable, verifiable solution for ride-sharing systems, addressing limitations in computational efficiency and trust present in existing centralized and blockchain-based methods