{'fraction_non_alphanumeric': 0.03488372093023256, 'fraction_numerical': 0.003875968992248062, 'mean_word_length': 5.304878048780488, '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}}
Brief Announcement: Tight Space Bounds for Memoryless Anonymous Consensus

Tight Θ(n^2) bounds are known for the total step complexity of randomized algorithms for n-process consensus from registers [1]. However, there is a large gap between the best known space lower bound of Ω(sqrt(n)) registers and the Θ(n) space complexity of the best existing algorithms. We prove matching upper and lower bounds of n for the space complexity of nondeterministic solo-terminating consensus in a restricted computational model.