maramihali
maramihali
and the proof should be stdlib
We need to range check the limbs against `bb::fr` modulus not `bb::fq` modulus otherwise we could have vulsn
It needs to aggregate the pairing points from Translator and Merge and we need to implement IPA accumulators for ECCVM
The current version is wasteful in terms of gates added. An alternative is to make arithmetic operations between cycle_scalar elements possible so we don't have to do the conversion in...
If the prover sends a point at infinity and, on the recursive verifier side, this is constructed as a cycle_group, calling `point.get_value().on_curve()` will be false because the transcript doesnt have...
Otherwise we will run into problems with the recursive verifier because the number of rounds in sumcheck is dependent on circuit size. This should be done based on the needs...