vocdoni / smtverifier-noirLinks
Port of Circom Sparse Merkle Tree verifier to Noir.
☆11Updated last year
Alternatives and similar repositories for smtverifier-noir
Users that are interested in smtverifier-noir are comparing it to the libraries listed below
Sorting:
- A list of worth-reading articles about Cryptohraphy☆16Updated 10 months ago
- Vectorized AVX-512 256-bit arithmetic library☆30Updated 8 months ago
- [wip] implementing origami VDF☆13Updated 2 years ago
- A Solidity implementation of Halo2's Pasta curves☆49Updated 2 years ago
- Nova Verifier in Circom so it can be verified onChain☆58Updated last year
- Polyexen demo of Plonkish Arithmetiation Format (Plaf) on the zkevm-circuits☆31Updated last year
- The repository for high quality Trusted setups for groth16 based SNARKS☆22Updated 2 months ago
- RISC Zero Nova is inherit from Risc Zero but aim to replace STARK with Nova folding scheme☆28Updated last year
- ☆17Updated 2 years ago
- Code used in a recent presentation showing off noir storage proofs☆15Updated last year
- Blind signatures over elliptic curve implementation (native & r1cs constraints).☆13Updated 2 years ago
- An implementation of Sangria☆17Updated 2 years ago
- Based on https://eprint.iacr.org/2022/1510☆26Updated 7 months ago
- An arkworks implementation of the superspartan PIOP☆13Updated 8 months ago
- An example of how to build an end-to-end dApp with plonky2x☆22Updated last year
- ☆50Updated last year
- Batching zero over k checks☆11Updated 2 years ago
- Implementation of the Grumpkin curve in Rust.☆29Updated last year
- client side proving☆30Updated 2 months ago
- ☆16Updated last year
- Benchmarking Polynomial Commitments☆49Updated last year
- ☆33Updated last year
- Early prototype.☆23Updated 2 years ago
- ☆26Updated last year
- Swoir is a Swift package for creating and verifying zero-knowledge Noir proofs.☆12Updated 2 months ago
- Implementation of https://eprint.iacr.org/2022/1565.pdf on top of arkworks☆16Updated 2 years ago
- Prove multi-opens of EIP-4844 KZG blobs☆14Updated last year
- polynomial commitments from linear codes☆44Updated 5 months ago
- a hack implementation of CCS generic arithmetization, won a prize at Zuzalu hackathon 2023 despite incompleteness☆48Updated last year
- ☆14Updated last year