The javascript prover and verifier will succeed when using public inputs > field prime

[norswap]

I ran into this issue with one of my circuits where the proof was successfully generating locally, and the local verifier would successfully verify the proof, but the Solidity verifier would reject the proof, even though the public signals and proof were identical.

I was using random values sampled from [0, 2^256] instead of bounding them to the field prime (one was a public signal, and the other a private signal).

I reckon both the prover and the verifier should fail early if any of the signal are larger than the field prime.

[ytrezq]

@norswap the issue was fixed some months ago.