Algorithms like the NTT in large characteristic fields need reciprocals of field elements 0..n. For a given instantiation of Longfellow (e.g., proving a particular attribute from an mDoc), n won't change regardless of circuit inputs, and thus we can precompute those reciprocals and bake them into the binary.
Algorithms like the NTT in large characteristic fields need reciprocals of field elements 0..n. For a given instantiation of Longfellow (e.g., proving a particular attribute from an mDoc), n won't change regardless of circuit inputs, and thus we can precompute those reciprocals and bake them into the binary.