Sharding alleviates the scalability bottleneck of blockchain systems by parallelizing transaction processing across multiple shards, but dispersing mining power lowers the security threshold of each individual shard, which typically requires additional mechanisms and overhead to restore. In this paper, we introduce Monosulfide, a PoW sharded blockchain that employs a braided-chain architecture to safely enable adaptive allocation of computational power across shards, while preserving both sharding and decentralization benefits. At its core is G-MOS, a novel pivot-graph confirmation algorithm that unifies local longest-chain mining with a global cumulative–work rule to provide lock-free parallel mining and robust fork-safety. We formalize the notion of mineable block sets and prove that G-MOS achieves security equivalent to a single canonical chain. Monosulfide allows miners to focus on hot shards with only minimal additional storage, achieving automatic load balancing. Our prototype demonstrates that, at the theoretical maximum transaction injection rate, Monosulfide delivers over 3x the throughput of Monoxide with 8 shards and over 6x with 16 shards, while maintaining low orphan rates and bounded confirmation latency under strong safety and liveness guarantees.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Monosulfide: A Sharded PoW Blockchain System with Secure Adaptive Mining Power Allocation

  • Yue Pan,
  • Guangtao Xue,
  • Shengyun Liu,
  • Haotian Zhu,
  • Jiahao Qi,
  • Dian Ding

摘要

Sharding alleviates the scalability bottleneck of blockchain systems by parallelizing transaction processing across multiple shards, but dispersing mining power lowers the security threshold of each individual shard, which typically requires additional mechanisms and overhead to restore. In this paper, we introduce Monosulfide, a PoW sharded blockchain that employs a braided-chain architecture to safely enable adaptive allocation of computational power across shards, while preserving both sharding and decentralization benefits. At its core is G-MOS, a novel pivot-graph confirmation algorithm that unifies local longest-chain mining with a global cumulative–work rule to provide lock-free parallel mining and robust fork-safety. We formalize the notion of mineable block sets and prove that G-MOS achieves security equivalent to a single canonical chain. Monosulfide allows miners to focus on hot shards with only minimal additional storage, achieving automatic load balancing. Our prototype demonstrates that, at the theoretical maximum transaction injection rate, Monosulfide delivers over 3x the throughput of Monoxide with 8 shards and over 6x with 16 shards, while maintaining low orphan rates and bounded confirmation latency under strong safety and liveness guarantees.