reilabs / proven-zk
A support library for working with zero knowledge cryptography in Lean 4.
☆37Updated this week
Alternatives and similar repositories for proven-zk:
Users that are interested in proven-zk are comparing it to the libraries listed below
- A model of the RISC Zero zkVM and ecosystem in the Lean 4 Theorem Prover☆67Updated 2 years ago
- A formal verification of Linear PCP SNARKs.☆53Updated 9 months ago
- Verification of the gnark implementation of the Semaphore protocol using Reilabs' extractor to Lean.☆15Updated last year
- deprecated, use Verified-zkEVM repository instead☆19Updated 3 months ago
- ☆59Updated 6 months ago
- Executable formal model of the EVM and Yul in Lean 4.☆56Updated 3 weeks ago
- Formally Verified Arguments of Knowledge in Lean☆68Updated this week
- zkLean is a domain specific language (DSL) in Lean for specifying zero-knowledge statements☆11Updated last week
- ☆47Updated last year
- A tool to extract gnark circuits defined in Go to Lean for formal verification.☆12Updated last month
- Solves systems of polynomial equations.☆29Updated last year
- Lean circuit DSL☆69Updated this week
- A cutting-edge zkWASM implementation leveraging Nova-NIVC-based folding techniques.☆34Updated 3 weeks ago
- Automated verification of uniqueness property for ZKP circuits☆41Updated 11 months ago
- A pqSNARK with lightweight proofs, powered by the Whir PCS.☆16Updated this week
- ☆51Updated last year
- Compiler framework for ZK VMs☆33Updated last year
- Formal verification of the zkWasm project☆12Updated 8 months ago
- A program for creating and verifying zkSNARKs to prove the results of Orbis smart contract executions and other TinyRAM program execution…☆37Updated 2 years ago
- Interactive formal verification tool for Yul programs☆64Updated 2 weeks ago
- Finite Fields and Curves in Lean☆13Updated 2 years ago
- Circom AES-GCM circuits☆29Updated last month
- Formalizing Polynomial Commitment Schemes in the Interactive Theorem Prover Isabelle.☆10Updated last month
- Proof system backends for OpenVM.☆30Updated this week
- UPA is the proof aggregation engine built by NEBRA team.☆30Updated 2 weeks ago
- Extracting the semantics of Noir to Lean for formal verification☆27Updated this week
- polynomial commitments from linear codes☆41Updated 4 months ago
- Curdleproofs is a zero-knowledge shuffle argument☆69Updated last year
- WebGPU MSM Implementation (BLS12-377 Curve) for ZPrize 2023☆13Updated 5 months ago
- Benchmark of ZKVMs and Proving Schemes☆25Updated 2 weeks ago