SP-Chain: Boosting Intra-Shard and Cross-Shard Security and Performance in Blockchain Sharding

Mingzhe Li, You Lin, Wei Wang, Jin Zhang

Abstract

A promising way to overcome the scalability limitations of the current blockchain is to use sharding, which is to split the transaction processing among multiple, smaller groups of nodes. A well-performed blockchain sharding system requires both high performance and high security in both intra- and cross-shard perspectives. However, existing protocols either have issues on protecting security or trade off great performance for security. In this paper, we propose SP-Chain, a blockchain sharding system with enhanced Security and Performance for both intra- and cross-shard perspectives. For intra-shard aspect, we design a two-phase concurrent voting scheme to provide high system throughput and low transaction confirmation latency. Moreover, we propose an efficient unbiased leader rotation scheme to ensure high performance under malicious behavior. For cross-shard aspect, a proof-assisted efficient cross-shard transaction processing mechanism is proposed to guard the cross-shard transactions with low overhead. We implement SP-Chain based on Harmony, and evaluate its performance via large-scale deployment. Extensive evaluations suggest that SP-Chain can process more than 10,000 tx/sec under malicious behaviors with a confirmation latency of 7.6s in a network of 4,000 nodes.

Introduction

Blockchain sharding—splitting the network into smaller groups (shards) to process transactions in parallel—is often considered the "holy grail" of scalability. However, it faces two major hurdles: intra-shard bottlenecks where traditional consensus protocols are slow and vulnerable to targeted attacks, and cross-shard complexity where verifying transactions between shards becomes computationally expensive. SP-Chain addresses these issues by introducing architectural innovations that ensure sharding maintains high security without sacrificing performance.

Methods

SP-Chain introduces three key innovations to optimize both intra-shard and cross-shard operations:

Pipelined Two-Phase Concurrent Voting

Traditional protocols handle block packaging and voting serially. SP-Chain parallelizes these tasks. While the network votes on block t-1, the leader simultaneously packages transactions for block t. By assuming a synchronous network within the shard, the system compresses the standard three-round BFT process into two rounds, significantly reducing latency.

Pipelined consensus mechanism showing overlapping slots for transaction packaging and voting.

Unbiased Leader Rotation

To prevent DDoS attacks or bribery, SP-Chain rotates the leader every block. The system uses the digital signature of a previously confirmed block as a random seed for the next election. This provides "unbiased randomness" without the heavy computational cost of Verifiable Random Functions (VRFs), making the rotation virtually "free" in terms of overhead.

Proof-Assisted Cross-Shard Processing

Instead of sending individual Merkle proofs for every cross-shard transaction, SP-Chain batches all transactions heading from a source shard to various destination shards. It generates a single "pruned" Merkle proof for the entire batch, which drastically reduces the data transmitted over the wire and simplifies verification for the receiving shards.

Mechanism for batching transactions and generating pruned Merkle proofs for cross-shard communication.

Evaluation and Results

The system was evaluated on Amazon EC2 using up to 4,000 nodes and historical Ethereum transaction data to model realistic patterns, including high cross-shard transaction ratios (up to 93.75%).

  • Throughput: At 4,000 nodes, SP-Chain reached 10,305 TPS, roughly 1.4x faster than RapidChain and 4x faster than Monoxide.
  • Latency: Confirmation time was recorded at 7.6 seconds, nearly half the latency of OmniLedger (13s) at the same scale.
  • Scalability: In a 10,000-node test across 40 shards, the system maintained linear scaling, reaching 24,509 TPS with a latency of only 8.1s.
  • Resilience: The system remained performant even under simulated malicious behavior and high network jitter (up to 1000ms delays).

Conclusion

SP-Chain demonstrates that the trade-off between security and performance in blockchain sharding is not inevitable. By utilizing pipelined consensus and efficient cross-shard proofs, it achieves industry-leading throughput and latency. Future work may explore reputation-based leader selection and post-quantum cryptographic primitives to further enhance long-term security.

Summary updated

Abstract

A promising way to overcome the scalability limitations of the current blockchain is to use sharding, which is to split the transaction processing among multiple, smaller groups of nodes. A well-performed blockchain sharding system requires both high performance and high security in both intra- and cross-shard perspectives. However, existing protocols either have issues on protecting security or trade off great performance for security. In this paper, we propose SP-Chain, a blockchain sharding system with enhanced Security and Performance for both intra- and cross-shard perspectives. For intra-shard aspect, we design a two-phase concurrent voting scheme to provide high system throughput and low transaction confirmation latency. Moreover, we propose an efficient unbiased leader rotation scheme to ensure high performance under malicious behavior. For cross-shard aspect, a proof-assisted efficient cross-shard transaction processing mechanism is proposed to guard the cross-shard transactions with low overhead. We implement SP-Chain based on Harmony, and evaluate its performance via large-scale deployment. Extensive evaluations suggest that SP-Chain can process more than 10,000 tx/sec under malicious behaviors with a confirmation latency of 7.6s in a network of 4,000 nodes.
BibTeX
@article{li2025sp,
  author = {Mingzhe Li and You Lin and Wei Wang and Jin Zhang},
  title = {{SP-Chain: Boosting Intra-Shard and Cross-Shard Security and Performance in Blockchain Sharding}},
  journal = {IEEE Internet of Things Journal},
  year = {2025},
  url = {https://openreview.net/forum?id=xMhVG1vpWe},
}
Figure