fluidex / snarkitLinks
A toolkit to compile and debug circom circuit.
☆27Updated 2 years ago
Alternatives and similar repositories for snarkit
Users that are interested in snarkit are comparing it to the libraries listed below
Sorting:
- A minimal KZG polynominal commitment library with a Solidity verifier☆72Updated 2 years ago
- Solidity verifier for Plonk☆42Updated last year
- A Solidity implementation of Halo2's Pasta curves☆50Updated 2 years ago
- Benchmarking Polynomial Commitments☆51Updated 2 years ago
- ☆16Updated last year
- Using folding schemes for a provable bitcoin light client☆34Updated last year
- Solidity implementation of Nova proving system verifier☆66Updated last year
- Draft documents for standardization of Plonkish arithmetization☆23Updated last year
- Early prototype.☆23Updated 2 years ago
- Implementation of Plonk by Hand in rust☆62Updated last year
- ☆23Updated 5 years ago
- ☆28Updated this week
- Nova: Recursive SNARKs without trusted setup☆44Updated 2 years ago
- ☆50Updated last year
- Curdleproofs is a zero-knowledge shuffle argument☆70Updated 2 years ago
- zero knowledge proof aggregator for general circuit☆73Updated last year
- plonky2 implementation of bn254 pairing☆19Updated last year
- polynomial commitments from linear codes☆47Updated last year
- RLN circuits in Circom☆32Updated last year
- a hack implementation of CCS generic arithmetization, won a prize at Zuzalu hackathon 2023 despite incompleteness☆50Updated 2 years ago
- ☆19Updated 2 years ago
- ☆33Updated 2 years ago
- Implementation of Nova using arkworks for learning purposes. https://eprint.iacr.org/2021/370.pdf☆45Updated 2 years ago
- Poseidon encryption in Typescript and circom (decryption only) on the BN254 elliptic curve☆13Updated 2 years ago
- ☆28Updated 4 years ago
- Verify JWTs using SNARK circuits☆29Updated last year
- Kate commitment based PLONK recursive aggregation circuit☆42Updated 2 years ago
- ☆17Updated 2 years ago
- ☆33Updated 2 years ago
- Based on https://eprint.iacr.org/2022/1510☆26Updated last year