An efficient cross-chain interaction mechanism for large-scale multichain environments

Abstract

To address the issues of scheduling conflicts and high verification overhead in large-scale cross-chain interactions, this paper proposes an efficient cross-chain interaction mechanism. First, a unified cross-chain interaction framework is constructed to mode and constrain the cross-chain process, providing structural support for subsequent scheduling and verification. Second, a two-layer K-means clustering-based data preprocessing mechanism is designed. The first layer groups transactions by protocol characteristics to eliminate heterogeneity, while the second layer performs fine-grained scheduling based on time-sensitivity, thereby organizing disordered requests into structured batches. Finally, a recursive aggregation-based zero-knowledge proof verification mechanism is introduced. By aggregating multiple transaction proofs into a single recursive proof, this mechanism reduces the on-chain verification complexity from linear O(N) to constant O(1). Theoretical analysis and experimental results show that the proposed solution significantly reduces the system overhead in large-scale cross-chain scenarios, improving the cross-chain efficiency rate by 68%-69% compared to existing solutions, and demonstrates good scalability under high concurrency.