Content
@
0 reply
0 recast
2 reactions
Michael Amadi
@michaels
Wrote a generic (over the number of `bitsPerIteration`) Strauss Shamir impl. The space complexity is O(2 ** 2n), where n is the bitsPerIteration. Because of this, it's important to find a balance between gas cost per iteration and memory expansion cost that comes with reducing the number of iterations by storing precomputed values in memory. OpenZeppelin for example, uses 2 bits per iteration for their P256 verifier. This example uses scalar numbers for simplicity but would also work if used with EC points and operations.
1 reply
0 recast
2 reactions
Michael Amadi
@michaels
Gist: https://gist.github.com/AmadiMichael/dab482d9273d86bbb20febdbca1f8be3
0 reply
0 recast
1 reaction
