The paper introduces a sharding design, named ORIC-Shard, based on the permissionless blockchain protocol ORIC, aiming to further enhance system performance and achieve linear scalability of throughput. ORIC-Shard allocates nodes to corresponding shards based on addresses, employing an account-based transaction model to distribute transactions. Within each shard, the complete block generated is broadcast through Gossip, while the corresponding block headers are disseminated to other shards via the Kademlia approach. Individual shard nodes only store complete blocks produced within their shard and block headers incoming from other shards to reduce storage pressure. To ensure system security, we propose a reporting and error-correction mechanism and outline a cross-shard transaction processing flow that guarantees eventual atomicity. Utilizing the Peersim distributed system simulator, we conduct network topology visualization and transaction-oriented broadcasting experiments, validating the superiority of the Gossip+Kademlia combined routing approach over traditional Gossip. Finally, we perform simulation tests on the overall performance of ORIC-Shard. The results indicate that ORIC-Shard achieves linear scalability of throughput, reaching 46,880 TPS in the case of 16 shards and surpassing a hundred thousand TPS with 64 shards. It maintains a high bandwidth utilization of approximately 40%-50% and a transaction confirmation latency of 6–8 min.