initc3 / SaUCy
The modular protocol framework based on Universal Composability
☆18Updated 4 years ago
Alternatives and similar repositories for SaUCy:
Users that are interested in SaUCy are comparing it to the libraries listed below
- Multi-party computation utilities toolkit for rust☆16Updated 5 years ago
- Hackathon project for Snarky workshop.☆11Updated 5 years ago
- A Python tool to manage and tag your bibliography (.bib and .pdf) files on Dropbox☆13Updated 2 years ago
- Super Amazing Universal Composability, Yeah!☆33Updated 2 years ago
- Coq definitions and lemmas for verification of Casper☆17Updated 5 years ago
- Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings☆45Updated 4 years ago
- A proof-of-concept for stateless Bitcoin nodes.☆31Updated 5 years ago
- C implementation of the CLT13 multilinear map☆14Updated 6 years ago
- ☆32Updated 2 years ago
- BLS working standard draft☆39Updated 5 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated 2 years ago
- Argument systems for inner pairing products☆41Updated 6 months ago
- BLST-Verification☆21Updated 3 weeks ago
- Fawkes-Crypto - zkSNARKs framework☆21Updated last year
- A zkSNARK implementation of a merkle tree membership preimage proof.☆24Updated 5 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
- Website!☆22Updated 2 years ago
- Futhark implementation of neptune-compatible Poseidon.☆27Updated 3 years ago
- ☆15Updated 5 years ago
- A support library for working with zero knowledge cryptography in Lean 4.☆34Updated 3 weeks ago
- Coded Merkle Tree☆26Updated 5 years ago
- Efficient zero-knowledge arguments in the discrete log setting, revisited☆15Updated 4 years ago
- fft impl for ff::Field☆15Updated 9 months ago
- A library providing mechanized proofs of the LibraBFT consensus using the Coq theorem prover☆26Updated 4 years ago
- Fast and simple constant-time hashing to the BLS12-381 elliptic curve☆43Updated 4 years ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆21Updated 5 years ago
- Batch verifier for zkSNARKs☆10Updated 2 years ago
- A formal verification of Linear PCP SNARKs.☆52Updated 7 months ago
- Pure OCaml implementation of the Groth-Maller SNARK verifier (and associated crypto)☆55Updated 5 years ago
- Rust library for efficient, succinct and modular set membership and non-membership proofs☆57Updated 3 years ago