Tests for ProofOfDiscreteLog fails sometimes, roughly once in 5 runs. My gut feeling is probably due to the wrong modulus of scalars. Outside the circuits, we modulo the subgroup order q, but inside modular operations are done with the prime p. It fails sometimes probably just because secrets are generated randomly. However, I still need to double-check to confirm the issue.
Tests for
ProofOfDiscreteLog
fails sometimes, roughly once in 5 runs. My gut feeling is probably due to the wrong modulus of scalars. Outside the circuits, we modulo the subgroup orderq
, but inside modular operations are done with the primep
. It fails sometimes probably just because secrets are generated randomly. However, I still need to double-check to confirm the issue.