matter-labs / pairingLinks
Pairing-friendly elliptic curve library
☆24Updated 9 months ago
Alternatives and similar repositories for pairing
Users that are interested in pairing are comparing it to the libraries listed below
Sorting:
- ☆23Updated 4 years ago
- Simple implementation of KZG commitments in C☆35Updated 2 years ago
- Draft documents for standardization of Plonkish arithmetization☆23Updated last year
- polynomial commitments from linear codes☆44Updated 5 months ago
- Traits and utilities for working with finite fields☆18Updated 9 months ago
- ☆28Updated 2 years ago
- Rescue and Poseidon hash function implementations☆43Updated 9 months ago
- Batch verification proposal for the zkSNARK verification with the same(!) circuit☆24Updated 5 years ago
- A Rust library for proof-carrying disclosures☆20Updated last year
- Decentralised Voting Scheme☆15Updated 3 years ago
- Benchmarking Polynomial Commitments☆49Updated last year
- RISC Zero Nova is inherit from Risc Zero but aim to replace STARK with Nova folding scheme☆28Updated last year
- Early prototype.☆23Updated 2 years ago
- gkr-mimc is a POC-grad gnark gadget to accelerate the proving time of Mimc computation☆25Updated 11 months ago
- ☆33Updated last year
- Testudo: Spartan + Groth16☆52Updated last year
- Solidity verifier for Plonk☆42Updated 9 months ago
- Polynomial Expression Engine☆35Updated last year
- Notes for the R1CS programming workshop at ZK0x04☆31Updated 5 years ago
- a hack implementation of CCS generic arithmetization, won a prize at Zuzalu hackathon 2023 despite incompleteness☆48Updated last year
- snarkpack for arkwork☆21Updated last year
- A collection of comparison-benchmarks for Nova & related Proving systems☆44Updated 2 years ago
- A list of worth-reading articles about Cryptohraphy☆16Updated 10 months ago
- Elliptic curve search experiments☆35Updated 2 years ago
- ☆18Updated 5 years ago
- ☆16Updated last year
- Polyexen demo of Plonkish Arithmetiation Format (Plaf) on the zkevm-circuits☆31Updated last year
- ☆17Updated 2 years ago
- A Solidity implementation of Halo2's Pasta curves☆49Updated 2 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 4 years ago