An Efficient Propagation Algorithm Based on Node Clustering and Seed Node Selection in a Blockchain Network

Due to block Propagation Delay and mining competition in blockchain networks, conflicting blocks are generated and propagated, leading to blockchain forks and the potential for double-spending attacks. Thus, reducing Propagation Delay and Blockchain Fork Rate is a critical research challenge. Traditional methods demonstrate high Propagation Delay and fork rate alongside low Propagation Coverage Rate. We introduce the Seed Node based Propagation (SNP) algorithm to tackle this issue. SNP utilizes a cluster generation method to reorganize nodes, selecting the seed node with the smallest distance to others in each cluster. An update mechanism maintains the clusters when nodes join or leave. Theoretical analysis shows O(n) computational complexity. We use an innovative metric, the Propagation Measurement Index (PMI) to evaluate our algorithms, and extensive experiments demonstrate a two-order-of-magnitude reduction in Propagation Delay and Propagation Coverage Rate. Moreover, SNP outperforms 6 state-of-the-art algorithms in terms of PMI.