Those are more specific than the ones in GSR. They are really about making efficient STARK proof verification over a specific prime.
Discussion
So with the arithmetic Opcode's in GSR, how is the size of the proof comparitavely?
Those are more specific than the ones in GSR. They are really about making efficient STARK proof verification over a specific prime.
So with the arithmetic Opcode's in GSR, how is the size of the proof comparitavely?