alinush / libvectcom

An O(N\log{N}) time algorithm for computing all N proofs fast in the Pointproofs VC. Also, the O(N\log{N}) time Feist-Khovratovich algorithm for computing all N proofs in KZG-based VCs. Lastly, benchmarks.
13Updated 3 years ago

Related projects

Alternatives and complementary repositories for libvectcom