khovratovich / Kate
☆26Updated 2 years ago
Alternatives and similar repositories for Kate:
Users that are interested in Kate are comparing it to the libraries listed below
- ☆28Updated 2 years ago
- Coded Merkle Tree☆26Updated 5 years ago
- ☆42Updated 3 years ago
- Rust library for accumulation schemes☆23Updated 2 years ago
- Draft documents for standardization of Plonkish arithmetization☆23Updated last year
- RISC Zero Nova is inherit from Risc Zero but aim to replace STARK with Nova folding scheme☆28Updated last year
- Simple RSA VDF in Rust☆19Updated 4 years ago
- Notes for the R1CS programming workshop at ZK0x04☆31Updated 5 years ago
- ☆15Updated 3 years ago
- ☆18Updated 5 years ago
- Benchmarking Polynomial Commitments☆49Updated last year
- polynomial commitments from linear codes☆41Updated 4 months ago
- A Rust library for proof-carrying disclosures☆20Updated last year
- snarkpack for arkwork☆21Updated last year
- Decentralised Voting Scheme☆15Updated 3 years ago
- An O(N\log{N}) time algorithm for computing all N proofs fast in the Pointproofs VC. Also, the O(N\log{N}) time Feist-Khovratovich algori…☆13Updated 4 years ago
- LegoGroth16 implementation on top of Zexe☆24Updated 3 years ago
- ☆15Updated 4 years ago
- ☆30Updated 3 weeks 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
- Testudo: Spartan + Groth16☆52Updated last year
- Pairing-friendly elliptic curve library☆24Updated 8 months ago
- ☆23Updated last year
- ☆18Updated 2 years ago
- A toolkit to compile and debug circom circuit.☆28Updated last year
- ☆18Updated last year
- gkr-mimc is a POC-grad gnark gadget to accelerate the proving time of Mimc computation☆25Updated 10 months ago
- Early prototype.☆23Updated 2 years ago
- Plonky2 gadgets for EcGFp5 curve and base field arithmetic☆20Updated 2 years ago
- Implementation of https://eprint.iacr.org/2022/1565.pdf on top of arkworks☆16Updated 2 years ago