noir-lang / zk_bench

Benchmark circom and noir on some standard primitives from circomlib/noir stdlib
MIT License
3 stars 0 forks source link

Add 100 and 200 iterations for SHA256 and Pedersen #12

Open Savio-Sou opened 4 months ago

Savio-Sou commented 4 months ago

Adding more iteration variations to evaluate e.g how Barretenberg's fixed lookup table costs affect proving times.

Ideally we add enough iteration variations (if 100 and 200 are insufficient) to plot a graph that illustrates the effect.