In LPC proof instead of dividing by V, divide by smaller polynomials 1 by 1, it's faster that way. - Githubissues

NilFoundation / crypto3-zk

Zero-Knowledge Proof Systems for =nil; Crypto3 C++ Cryptography Suite.

MIT License

33 stars 13 forks source link

In LPC proof instead of dividing by V, divide by smaller polynomials 1 by 1, it's faster that way. #199

Closed martun closed 1 year ago