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.
☆13Dec 3, 2020Updated 5 years ago
Alternatives and similar repositories for libvectcom
Users that are interested in libvectcom are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Argument systems for inner pairing products☆45Jul 31, 2024Updated 2 years ago
- Rust implementation of Zcash multi-signautres☆13Jun 23, 2019Updated 7 years ago
- Vector Commitments with Constant-Sized, Updatable Proofs and Linear-Sized Public Parameters☆11Jun 3, 2021Updated 5 years ago
- ☆13Aug 7, 2023Updated 3 years ago
- [wip] implementing origami VDF☆13Mar 1, 2023Updated 3 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Elliptic curve search experiments