alinush / libvectcomLinks
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 5 years ago
Alternatives and similar repositories for libvectcom
Users that are interested in libvectcom are comparing it to the libraries listed below
Sorting:
- Vector Commitments with Constant-Sized, Updatable Proofs and Linear-Sized Public Parameters☆11Updated 4 years ago
- ☆15Updated 5 years ago
- ☆19Updated 5 years ago
- Efficient zero-knowledge arguments in the discrete log setting, revisited☆16Updated 5 years ago
- Identity Based Encryption schemes on the BLS12-381 pairing-friendly elliptic curve☆20Updated 4 years ago
- ☆15Updated 6 years ago
- ☆11Updated last year
- [wip] implementing origami VDF☆13Updated 2 years ago
- A rusty implementation of the Caulk+ lookup algorithm.☆12Updated 3 years ago
- Prover for the Plumo light client system https://docs.zkproof.org/pages/standards/accepted-workshop3/proposal-plumo_celolightclient.pdf☆14Updated 4 years ago
- fft impl for ff::Field☆17Updated last year
- ☆15Updated 4 years ago
- Around applying the VDF construcrtion based on isogenies between super-signular elliptic curves☆15Updated 4 years ago
- Elliptic curve search experiments☆35Updated 2 years ago
- ☆15Updated 4 years ago
- R1CS constraints for non-native field arithmetic☆21Updated 4 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo