0xPolygonMiden / air-script
A domain-specific language for writing AIR constraints for STARKs
☆78Updated this week
Alternatives and similar repositories for air-script:
Users that are interested in air-script are comparing it to the libraries listed below
- Experimental implementation of the SuperNova protocol. https://eprint.iacr.org/2022/1758☆120Updated last year
- An advanced fork of Nova (contact:@huitseeker)☆82Updated this week
- ☆94Updated 6 months ago
- Cairo prover powered by miniSTARK (compatible with StarkWare's verifiers)☆158Updated last month
- Accelerated Zero-knowledge Virtual Machine by Non-uniform Prover Based on GKR Protocol☆82Updated this week
- A SNARK using towers of binary fields, implemented in Rust☆85Updated this week
- STARK - SNARK recursive zero knowledge proofs, combinaison of the Winterfell library and the Circom language☆103Updated last year
- ☆91Updated 2 months ago
- ☆119Updated 2 months ago
- A Plonkish folding framework for Incrementally Verifiable Computation (IVC).☆159Updated this week
- ☆104Updated 9 months ago
- Fiat-Shamir for the masses.☆52Updated 2 weeks ago
- ☆49Updated last year
- Experimental folding schemes library☆224Updated this week
- Basic scaffolding for setting up and writing a Halo2 ZK circuit☆109Updated last year
- Old, obsolete version of the Valida compiler; its replacement will become public later☆50Updated last year
- A FRI verifier circuit for the Halo2 proof system☆76Updated 2 years ago
- Reference implementation of the node for the Polygon Miden rollup☆58Updated this week
- Compiler from MidenIR to Miden Assembly☆69Updated this week
- ☆61Updated 11 months ago
- Cryptographic primitives used in Polygon Miden rollup☆111Updated this week
- A PoC repo for a HyperNova impl☆82Updated last year
- A Cairo VM prover implemented using Winterfell☆158Updated 2 years ago
- linear-time sumcheck protocol for multilinear polynomials and related addends☆63Updated 4 months ago
- Polynomials Identity Language☆68Updated 11 months ago
- Benchmark of multiple zk implementations.☆83Updated last year
- WHIR 🌪️: Reed–Solomon Proximity Testing with Super-Fast Verification☆87Updated this week
- A lattice-based non-interactive folding scheme written in Rust☆61Updated last month
- STIR 🥣: Reed–Solomon Proximity Testing with Fewer Queries☆57Updated 3 months ago
- ☆150Updated 11 months ago