Alternatives and similar repositories for circom2gnark

Users that are interested in circom2gnark are comparing it to the libraries listed below

• liyue201 / gnark-circomlib
  Translate circomlib into gnark
  ☆16Updated 7 months ago
• geometryxyz / protostar
  ☆51Updated last year
• cryptonetlab / testudo
  Testudo: Spartan + Groth16
  ☆52Updated last year
• tcoratger / whir-p3
  ☆28Updated this week
• conroi / lcpc
  polynomial commitments from linear codes
  ☆44Updated 5 months ago
• LBruyne / Scalable-Collaborative-zkSNARK
  Proof-of-concept implementation of the papers on scalable collaborative zk-SNARKs (coZK) with applications to private proof delegation.
  ☆49Updated this week
• jbaylina / nova-circom-verifier
  Nova Verifier in Circom so it can be verified onChain
  ☆58Updated last year
• nulltea / hyper-greco
  Verifiable FHE with GKR
  ☆26Updated 8 months ago
• Janmajayamall / bfv
  ☆26Updated last year
• arnaucube / protogalaxy-poc
  ProtoGalaxy folding scheme PoC implementation https://eprint.iacr.org/2023/1106.pdf
  ☆41Updated last year
• jeong0982 / gkr
  zero knowledge proof aggregator for general circuit
  ☆72Updated last year
• gy001 / hypercube
  ☆41Updated last year
• philsippl / circom-witness-rs
  ☆61Updated last year
• Orbiter-Finance / rapidsnark
  rapidsnark is a fast zkSNARK prover written in C++, that generates proofs for circuits created with circom and snarkjs.
  ☆13Updated last year
• cursive-team / trinity-v0
  2PC with ideal UX and DevX. Combination of Garbled Circuits, PLONK, and KZG Witness Encryption
  ☆13Updated 4 months ago
• dmpierre / nova-browser-ecdsa
  In-browser ECDSA aggregation using Nova over secp/secq
  ☆33Updated last year
• compsec-epfl / space-efficient-sumcheck
  ☆34Updated last week
• h-hafezi / kzh_fold
  ☆23Updated 2 months ago
• joshbeal / derecho
  A Rust library for proof-carrying disclosures
  ☆20Updated last year
• cursive-team / babyjubjub-ecdsa
  Circuits for making ZK proofs about Baby Jub Jub ECDSA signatures
  ☆21Updated 6 months ago
• therealyingtong / ultraplonk-workshop
  ☆10Updated 2 years ago
• dmpierre / sha1-circom
  Generate a zero-knowledge proof for a SHA1 pre-image.
  ☆12Updated last year
• lurk-lab / circom-scotia
  ☆20Updated last year
• personaelabs / sapir
  ☆2Updated last year
• bkomuves / hash-circuits
  Hashing circuits implemented in circom
  ☆22Updated 4 months ago
• weijiekoh / elgamal-babyjub
  ☆23Updated 4 years ago
• ed255 / polyexen-demo
  Polyexen demo of Plonkish Arithmetiation Format (Plaf) on the zkevm-circuits
  ☆31Updated last year
• privacy-scaling-explorations / Trinity
  Trinity is a two-party computation (2PC) protocol designed to minimize interaction rounds, enable input verifiability, and facilitate reu…
  ☆20Updated last month
• lattice-complete / Lazarus
  A Framework of Lattice-based Zero-knowledge Arguments in Rust
  ☆49Updated 4 months ago
• CharmsDev / polymath
  Polymath: Groth16 Is Not The Limit
  ☆29Updated 3 months ago