{'fraction_non_alphanumeric': 0.011475409836065573, 'fraction_numerical': 0.0, 'mean_word_length': 4.875, '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}}
A study on a distributed verification scheme and its efficiency

We proposed a scheme of distributed verification for problems that are not solved efficiently in parallel. We focused the fact that computation of verification is solved efficiently in parallel even if the original problem is not solved efficiently. We adopt grid computing for verification computation in the scheme. In the scheme, we assume that we can use high speed high cost computers and low speed low cost computers. In this paper, we evaluate the efficiency of the scheme by using information theory when high speed computers are honest.