halo2-ce / halo2View external linksLinks
☆30Feb 1, 2023Updated 3 years ago
Alternatives and similar repositories for halo2
Users that are interested in halo2 are comparing it to the libraries listed below
Sorting:
- Early prototype.☆23Mar 30, 2023Updated 2 years ago
- Batching zero over k checks☆11Feb 11, 2023Updated 3 years ago
- Implementation of https://eprint.iacr.org/2022/1565.pdf on top of arkworks☆16Jan 1, 2023Updated 3 years ago
- A rusty implementation of the Caulk+ lookup algorithm.☆12Dec 18, 2022Updated 3 years ago
- Experimental implementation of the SuperNova protocol. https://eprint.iacr.org/2022/1758☆122Feb 25, 2023Updated 2 years ago
- A program for creating and verifying zkSNARKs to prove the results of Orbis smart contract executions and other TinyRAM program execution…☆39Nov 18, 2022Updated 3 years ago
- ☆50Mar 7, 2024Updated last year
- Draft documents for standardization of Plonkish arithmetization☆23Mar 15, 2024Updated last year
- Testudo: Spartan + Groth16☆53Feb 21, 2024Updated last year
- Polyexen demo of Plonkish Arithmetiation Format (Plaf) on the zkevm-circuits☆31Feb 16, 2024Updated 2 years ago
- A Solidity implementation of Halo2's Pasta curves☆50Mar 30, 2023Updated 2 years ago
- ☆41Oct 24, 2022Updated 3 years ago
- Slides and notes for "Halo Optimizations and Constructing Graphs of Elliptic Curves"☆49Mar 5, 2022Updated 3 years ago
- Benchmark for adding Lasso lookup argument to halo2 backend☆37Mar 3, 2024Updated last year
- ☆124Nov 30, 2024Updated last year
- ☆14Feb 7, 2023Updated 3 years ago
- ☆17Feb 13, 2023Updated 3 years ago
- SIPP(Statistically sound Inner Pairing Product) verification in SNARK☆17Oct 8, 2023Updated 2 years ago
- A FRI verifier circuit for the Halo2 proof system☆77Feb 22, 2023Updated 2 years ago
- ☆111Nov 27, 2025Updated 2 months ago
- zero knowledge proof aggregator for general circuit☆73May 20, 2024Updated last year
- ☆42Jul 25, 2024Updated last year
- ☆41Aug 31, 2023Updated 2 years ago
- Monorepo of halo2 crates☆307Aug 26, 2025Updated 5 months ago
- Based on https://eprint.iacr.org/2022/1510☆26Oct 20, 2024Updated last year
- Benchmarking Polynomial Commitments☆51Jul 3, 2023Updated 2 years ago
- ☆20Jul 10, 2025Updated 7 months ago
- Some very rough benchmarks between sha256 circuits in different proving systems☆53Aug 6, 2022Updated 3 years ago
- ECFFT in Rust☆58Oct 3, 2023Updated 2 years ago
- ECDSA gadgets for plonky2☆19Oct 20, 2023Updated 2 years ago
- A collection of technical notes from the Geometry research team.☆47Apr 17, 2023Updated 2 years ago
- A Rust library for proof-carrying disclosures☆23Apr 10, 2024Updated last year
- ☆155Feb 26, 2024Updated last year
- a simple implementation of the KZG polynomial commitment scheme☆25Nov 22, 2021Updated 4 years ago
- Compiler framework for ZK VMs☆35Aug 2, 2023Updated 2 years ago
- World's first implementation of a (possibly) secure witness encryption scheme. Uses the CLT13 multilinear map.☆36Jan 12, 2022Updated 4 years ago
- Nova Verifier in Circom so it can be verified onChain☆59Jun 9, 2023Updated 2 years ago
- A library for fast NTTs over the Goldilocks prime field☆80Sep 25, 2024Updated last year
- A collection of comparison-benchmarks for Nova & related Proving systems☆44Apr 6, 2023Updated 2 years ago