Comment by @junzhang • Hey

To keep numbers within reasonable sizes, the arithmetic must be done not over regular integers, but over structures called "finite fields". Modular arithme

Stats

Comments

In a real program, most of the numbers are very small: for loop indices, True/False values, array indices, counters... If a field is large, the "extra" values that get generated during proof computation are much larger. This is a key source of inefficiency.