{'fraction_non_alphanumeric': 0.011780104712041885, 'fraction_numerical': 0.007853403141361256, 'mean_word_length': 5.375, '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}}
Compiling computations to constraints for verified computation

We present a compiler that automates the task of converting high-level code to constraint sets of the form accepted by the Ginger and Zaatar protocols for verified computation. Performing the conversion from high-level code to constraints by hand is prone to human error and therefore not practical for large computations. This paper evaluates the performance of the compiler and the effectiveness of its optimizations on reducing the size of the constraint set. We show that the compiler can produce constraint sets for a number of interesting computations, including DNA sequence alignment of 200 nucleotide sequences and partitionabout-medoids clustering of 100-dimensional data into two clusters.