{'fraction_non_alphanumeric': 0.019830028328611898, 'fraction_numerical': 0.0, 'mean_word_length': 5.385542168674699, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
SRRS: A Blockchain Fast Propagation Protocol Based on non-Markovian Process

With the widespread use of Bitcoin, more demands on the underlying blockchain technology have been raised for more efficient transactions. Thus, in the last decade, many solutions have been proposed to improve the propagation of blocks. Motivated by the social reinforcement rumor spreading (SRRS), we propose a blockchain fast propagation protocol based on a non-Markovian process, which refers to that the verification and transmission of a block also depends on its propagation history. The simulated experimental results show that our protocol can significantly accelerate the propagation of blocks. Compared with existing major solutions, our protocol does not change the main procedure of Bitcoin and the block data structure. This is a huge advantage for practical applications. Moreover, employing the theories of complex networks and percolation, we develop a method that presents a theoretical analysis for our protocol, which can find the optimal setting of our protocol.