kobigurk / zkhack-double-troubleLinks
☆10Updated last year
Alternatives and similar repositories for zkhack-double-trouble
Users that are interested in zkhack-double-trouble are comparing it to the libraries listed below
Sorting:
- fft impl for ff::Field☆16Updated last year
- ☆11Updated last year
- Rust library for accumulation schemes☆23Updated 2 years ago
- Composable proof transcripts for public-coin arguments of knowledge☆49Updated 11 months ago
- ☆12Updated 4 years ago
- Argument systems for inner pairing products☆42Updated last year
- Benchmarks of all public available SNARK/STARK keccak circuits☆13Updated last year
- cpp witness calculator for mobile and desktop for iden3 circuits☆15Updated 3 months ago
- plonky2 recursion framework handling different circuits in unified way.☆14Updated last year
- Reference implementation of Squirrel, an Efficient Synchronized Multi-Signatures from Lattices☆24Updated last year
- Starky implementation of Bls12-381☆13Updated last year
- An instantiation of the Poseidon hash for use with decaf377☆29Updated 5 months ago
- FRI low-degree-testing & polynomial commitment scheme☆24Updated 2 years ago
- Fawkes-Crypto - zkSNARKs framework☆22Updated last year
- A minimal RedJubjub implementation for use in Zebra.☆28Updated 3 months ago
- ☆30Updated 2 years ago
- Describe elliptic curves☆35Updated 4 years ago
- A library for decentralized private computation☆19Updated 4 years ago
- Implementations of proof-carrying data☆35Updated 3 years ago
- A STARK-friendly elliptic curve defined over a sextic extension of a small prime field.☆40Updated last year
- Pairing-friendly elliptic curve library☆24Updated 11 months ago
- Notes for the R1CS programming workshop at ZK0x04☆31Updated 5 years ago
- ☆24Updated last year
- Vector Commitments with Constant-Sized, Updatable Proofs and Linear-Sized Public Parameters☆11Updated 4 years ago
- [wip] implementing origami VDF☆13Updated 2 years ago
- RISCU emulator and zk circuit simulator as a reference for a Jolt implementation☆23Updated last year
- ☆11Updated 11 months ago
- 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 4 years ago
- Decentralised Voting Scheme☆15Updated 3 years ago
- ☆20Updated 3 years ago