tobias-rothmann / Polynomial-Commitment-Schemes
Formalizing Polynomial Commitment Schemes in the Interactive Theorem Prover Isabelle.
☆10Updated 2 weeks ago
Alternatives and similar repositories for Polynomial-Commitment-Schemes:
Users that are interested in Polynomial-Commitment-Schemes are comparing it to the libraries listed below
- A support library for working with zero knowledge cryptography in Lean 4.☆35Updated 2 weeks ago
- Compiler framework for ZK VMs☆33Updated last year
- ☆10Updated 6 months ago
- A cutting-edge zkWASM implementation leveraging Nova-NIVC-based folding techniques.☆34Updated this week
- Verification of the gnark implementation of the Semaphore protocol using Reilabs' extractor to Lean.☆14Updated last year
- ☆26Updated last week
- Circom AES-GCM circuits☆29Updated last week
- ☆47Updated last year
- Proof system backends for OpenVM.☆27Updated this week
- A rusty implementation of the Caulk+ lookup algorithm.☆12Updated 2 years ago
- Formally Verified SNARKs in Lean☆40Updated last week
- Formal verification of the zkWasm project☆11Updated 7 months ago
- Curdleproofs is a zero-knowledge shuffle argument☆69Updated last year
- ☆12Updated 5 months ago
- Polymath: Groth16 Is Not The Limit☆29Updated last month
- Elliptic curve search experiments☆35Updated 2 years ago
- Lean circuit DSL for AIR☆22Updated last week
- ☆11Updated last year
- ☆31Updated this week
- ☆24Updated 2 years ago
- A formal verification of Linear PCP SNARKs.☆52Updated 8 months ago
- Testudo: Spartan + Groth16☆52Updated last year
- ☆39Updated last year
- ☆28Updated 2 years ago
- ECFFT in Rust☆56Updated last year
- Mozak RISC-V Virtual Machine☆24Updated last week
- Fiat-Shamir for the masses.☆53Updated this week
- r1cs file format parser☆24Updated 10 months ago
- Automated verification of uniqueness property for ZKP circuits☆41Updated 9 months ago
- ☆40Updated 2 years ago