arnaucube/go-circom-prover-verifier
1
0
Fork 0
mirror of https://github.com/arnaucube/go-circom-prover-verifier.git synced 2026-02-07 19:36:42 +01:00
Code Issues Packages Projects Releases Wiki Activity
45 Commits 16 Branches 2 Tags
8c81f5041ec12016abb602f0432651cf183f0088
Commit Graph

5 Commits

Author SHA1 Message Date
arnaucube
700f2a4503 Fix prover benchmark file paths, update readme, and other small updates 2020-04-29 10:27:31 +02:00
arnaucube
d3f43ce1a0 Refactor circuits, update prover & verifier tests 2020-04-26 21:32:52 +02:00
arnaucube
3691785054 Add paralelization of polynomials in GenerateProof 
- before:
BenchmarkGenerateProof-4               1        1553842743 ns/op
For a circuit of 9094 constraints takes 7.761949512s seconds to generate the proof.

- now:
BenchmarkGenerateProof-4               1        1331576862 ns/op
For a circuit of 9094 constraints takes 5.745279126s to generate the proof.

For bigger circuits (more constraints) the difference will be bigger.

Executed on a Intel(R) Core(TM) i5-7200U CPU @ 2.50GHz, with 16GB of RAM
 2020-04-24 10:50:28 +02:00
arnaucube
9b93bad028 Use fft on calculateH polynomial multiplication 
For a circuit arround 22500 constraints:
- before: the proof was generated aprox in `80 seconds`
- now: the proof is generated aprox in `16 seconds`
 2020-04-21 15:38:50 +02:00
arnaucube
e1147db72f refactor in sub packages 2020-04-17 20:31:53 +02:00