daira / describe-curveLinks
Describe elliptic curves
☆35Updated 4 years ago
Alternatives and similar repositories for describe-curve
Users that are interested in describe-curve are comparing it to the libraries listed below
Sorting:
- Elliptic curve search experiments☆35Updated 2 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated 3 years ago
- LegoGroth16 implementation on top of Zexe☆25Updated 4 years ago
- Notes for the R1CS programming workshop at ZK0x04☆31Updated 6 years ago
- A library for decentralized private computation☆19Updated 4 years ago
- Polymath: Groth16 Is Not The Limit☆30Updated 10 months ago
- Benchmarking Polynomial Commitments☆51Updated 2 years ago
- Generator and supporting evidence for security of the Pallas/Vesta pair of elliptic curves suitable for Halo☆58Updated 2 years ago
- Draft documents for standardization of Plonkish arithmetization☆23Updated last year
- snarkpack for arkwork☆21Updated 2 years ago
- Testudo: Spartan + Groth16☆53Updated last year
- ☆11Updated last year
- ☆30Updated 2 years ago
- A program for creating and verifying zkSNARKs to prove the results of Orbis smart contract executions and other TinyRAM program execution…☆39Updated 3 years ago
- Implementations of proof-carrying data☆36Updated 3 years ago
- ☆19Updated 2 years ago
- Groth16 zkSNARK bellman proof verifier using cloudflare/bn256 Pairing☆13Updated 5 years ago
- polynomial commitments from linear codes☆47Updated last year
- Rust library for accumulation schemes☆25Updated 2 years ago
- ☆19Updated 5 years ago
- Decentralised Voting Scheme☆16Updated 4 years ago
- [wip] implementing origami VDF☆13Updated 2 years ago
- Curdleproofs is a zero-knowledge shuffle argument☆70Updated 2 years ago
- ☆41Updated 3 years ago
- A Rust library for proof-carrying disclosures☆23Updated last year
- Solidity libraries and contracts for verifying WHIR proofs on the EVM.☆27Updated last year
- 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 algori…☆13Updated 5 years ago
- ☆24Updated 2 years ago
- Slides and notes for "Halo Optimizations and Constructing Graphs of Elliptic Curves"☆49Updated 3 years ago
- ☆42Updated 4 years ago