brucechin / zexe
Rust library for decentralized private computation
☆9Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for zexe
- ☆23Updated 7 months ago
- Rust 256-bit unsigned integers.☆9Updated last year
- Efficient zero-knowledge arguments in the discrete log setting, revisited☆15Updated 4 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated 2 years ago
- Curdleproofs is a zero-knowledge shuffle argument☆69Updated last year
- Elliptic Curve Fast Fourier Transform built on @arkworks-rs☆68Updated last year
- Identity Based Encryption schemes on the BLS12-381 pairing-friendly elliptic curve☆20Updated 3 years ago
- High-performance Multi-scalar Multiplication for Pasta curves☆21Updated 11 months ago
- ☆28Updated last year
- Fast implementation of multi-scalar multiplication in WebAssembly☆32Updated 2 months ago
- A library for decentralized private computation☆18Updated 3 years ago
- ☆14Updated 5 months ago
- A program for creating and verifying zkSNARKs to prove the results of Orbis smart contract executions and other TinyRAM program execution…☆37Updated last year
- Lurk is a Turing-complete programming language for zk-SNARKs. It is a statically scoped dialect of Lisp, influenced by Scheme and Common …☆40Updated this week
- Circom AES-GCM circuits☆27Updated 2 weeks ago
- A STARK-friendly elliptic curve defined over a sextic extension of a small prime field.☆38Updated 11 months ago
- An experimental rust zksnarks compiler with embeeded bellman-bn128 prover☆42Updated 3 years ago
- Prover for the Plumo light client system https://docs.zkproof.org/pages/standards/accepted-workshop3/proposal-plumo_celolightclient.pdf☆14Updated 2 years ago
- ☆24Updated last year
- ☆37Updated 2 years ago
- Prototype of fraud proofs.☆12Updated 2 years ago
- FRI low-degree-testing & polynomial commitment scheme☆23Updated last year
- Shared Lurk source code, including tests and library code.☆18Updated 8 months ago
- Implementing a Turing-complete computer (OISC) within a zk-SNARKS circuit.☆12Updated 2 years ago
- [wip] implementing origami VDF☆13Updated last year
- A library for fast NTTs over the Goldilocks prime field☆74Updated last month
- RISC Zero Nova is inherit from Risc Zero but aim to replace STARK with Nova folding scheme☆29Updated last year
- Starky implementation of Bls12-381☆12Updated 5 months ago
- Implementations of proof-carrying data☆30Updated 2 years ago