matter-labs / ffLinks
Traits and utilities for working with finite fields
☆18Updated last year
Alternatives and similar repositories for ff
Users that are interested in ff are comparing it to the libraries listed below
Sorting:
- Pairing-friendly elliptic curve library☆24Updated last year
- Rust library for accumulation schemes☆25Updated 3 years ago
- ☆15Updated 5 years ago
- snarkpack for arkwork☆21Updated 2 years ago
- Decentralised Voting Scheme☆16Updated 4 years ago
- Rescue and Poseidon hash function implementations☆43Updated last year
- Implementation of the BLS12-381 pairing-friendly elliptic curve group with extra features needed by the Dusk-Network team☆23Updated last week
- Groth16 zkSNARK bellman proof verifier using cloudflare/bn256 Pairing☆13Updated 5 years ago
- ☆19Updated 5 years ago
- Notes for the R1CS programming workshop at ZK0x04☆31Updated 6 years ago
- Solidity verifier for Plonk☆42Updated last year
- R1CS constraints for non-native field arithmetic☆21Updated 4 years ago
- DPC with Universal Setup☆46Updated 2 years ago
- Plonky2 gadgets for EcGFp5 curve and base field arithmetic☆20Updated 2 years ago
- ☆31Updated last week
- Batch verification proposal for the zkSNARK verification with the same(!) circuit☆24Updated 6 years ago
- ☆30Updated 3 years ago
- ☆18Updated 2 years ago
- Testudo: Spartan + Groth16☆53Updated last year
- Draft documents for standardization of Plonkish arithmetization☆23Updated last year
- Polymath: Groth16 Is Not The Limit☆31Updated last year
- gkr-mimc is a POC-grad gnark gadget to accelerate the proving time of Mimc computation☆25Updated last year
- A Rust library for proof-carrying disclosures☆23Updated last year
- Implementation of the Hades permutation algorithm used in Poseidon Hashes with ZKProof capabilities.☆22Updated 2 years ago
- ☆27Updated 3 years ago
- Implementations of proof-carrying data☆37Updated 3 years ago
- An `arkworks` library for low-degree testing☆23Updated last year
- RISC Zero Nova is inherit from Risc Zero but aim to replace STARK with Nova folding scheme☆28Updated 2 years ago
- ☆23Updated 5 years 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 5 years ago