{'fraction_non_alphanumeric': 0.0345821325648415, 'fraction_numerical': 0.0, 'mean_word_length': 4.887005649717514, '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}}
Fork Probability Analysis of PoUW Consensus Mechanism

In Blockchain, fork is a fundamental impediment to consensus mechanisms such as Proof-of-Work (PoW). In this paper, we study the fork probability of the famous Proof-of-Useful-Work (PoUW) consensus mechanism, which has recently been proposed to solve the huge waste of computing resources in PoW. With PoUW, each miner first does useful work (e.g., data classification), and then competes for the leader according to the number of the executed CPU instructions. Compared with conventional factors such as network delay, the time of doing useful work is a new and salient factor leading to a fork for a PoUW-based blockchain. Taking into account some important factors (e.g., the time of doing useful work, computational power, network delay), we propose a theoretical model to characterize the impact of these factors on the PoUW fork probability. Extensive simulations verify that our model is very accurate. This study is helpful for providing guidance of configuring PoUW parameters.