han0110 / plonkish
☆104Updated 10 months ago
Alternatives and similar repositories for plonkish:
Users that are interested in plonkish are comparing it to the libraries listed below
- ☆73Updated 2 months ago
- ☆97Updated 7 months ago
- STIR 🥣: Reed–Solomon Proximity Testing with Fewer Queries☆57Updated 4 months ago
- A Framework of Lattice-based Zero-knowledge Arguments in Rust☆43Updated 2 months ago
- ☆119Updated 3 months ago
- Basic scaffolding for setting up and writing a Halo2 ZK circuit☆109Updated last year
- A PoC repo for a HyperNova impl☆82Updated last year
- A Plonkish folding framework for Incrementally Verifiable Computation (IVC).☆168Updated this week
- ☆50Updated last year
- ☆150Updated last year
- A lattice-based non-interactive folding scheme written in Rust☆65Updated this week
- Extensive benchmarks of various zero-knowledge proof systems for Fully Homomorphic Encryption☆37Updated last year
- Benchmark of multiple zk implementations.☆83Updated last year
- A FRI verifier circuit for the Halo2 proof system☆76Updated 2 years ago
- Experimental folding schemes library☆229Updated 2 weeks ago
- Experimental implementation of the SuperNova protocol. https://eprint.iacr.org/2022/1758☆120Updated 2 years ago
- Zk proving the correct execution of encryption operation under BFV Fully Homomorphic Encryption scheme☆110Updated last year
- ☆56Updated 3 months ago
- Accelerated Zero-knowledge Virtual Machine by Non-uniform Prover Based on GKR Protocol☆86Updated this week
- Proof-of-concept implementation of scalable collaborative zk-SNARKs with fully distributed proof generation.☆46Updated this week
- A SNARK using towers of binary fields, implemented in Rust☆93Updated this week
- Benchmarks of popular zkVMs including Jolt☆60Updated 11 months ago
- WHIR 🌪️: Reed–Solomon Proximity Testing with Super-Fast Verification☆95Updated this week
- Circom interpreter to arithmetic circuit description☆53Updated 6 months ago
- Solidity implementation of Nova proving system verifier☆60Updated last year
- Benchmarking framework for general purpose zero-knowledge proofs languages and libraries☆100Updated 3 months ago
- STARK - SNARK recursive zero knowledge proofs, combinaison of the Winterfell library and the Circom language☆102Updated last year
- Expander, an open-source GKR prover designed for scaling large-scale parallel computing.☆63Updated last month
- linear-time sumcheck protocol for multilinear polynomials and related addends☆63Updated 5 months ago