{'fraction_non_alphanumeric': 0.008403361344537815, 'fraction_numerical': 0.0, 'mean_word_length': 5.037974683544304, '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}}
Bounds in Twin Prime Distribution

An efficient numerical method of traversal of twin prime pairs was applied to verify bounds on the distribution of twin primes at an arbitrary distance. It was shown that if proven formally, the bounds will be sufficient for the proof of the twin prime conjecture. Heuristic arguments in favor of the bounds obtained with numerical modeling are given and connections with other problems in distributions of prime sequences briefly discussed.