Stable Blockchain Sharding under Adversarial Transaction Generation: Provable Performance Bounds for Distributed Scheduling Algorithms

This paper provides the first comprehensive adversarial queuing theory analysis for blockchain sharding systems. It presents provable performance bounds on the maximum transaction generation rate that can be handled by stable scheduling algorithms, and introduces distributed scheduling algorithms that guarantee bounded queues and low transaction latency under adversarial transaction generation.