initc3 / SaUCy
The modular protocol framework based on Universal Composability
☆18Updated 4 years ago
Related projects: ⓘ
- Super Amazing Universal Composability, Yeah!☆32Updated 2 years ago
- Coq definitions and lemmas for verification of Casper☆17Updated 5 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated last year
- A Python tool to manage and tag your bibliography (.bib and .pdf) files on Dropbox☆13Updated last year
- Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings☆44Updated 4 years ago
- Multi-party computation utilities toolkit for rust☆16Updated 4 years ago
- Argument systems for inner pairing products☆41Updated last month
- Hackathon project for Snarky workshop.☆11Updated 5 years ago
- Formal verification of the Algorand consensus protocol☆26Updated last year
- A proof-of-concept for stateless Bitcoin nodes.☆31Updated 5 years ago
- fft impl for ff::Field☆15Updated 4 months ago
- Batch verifier for zkSNARKs☆10Updated last year
- Fast and simple constant-time hashing to the BLS12-381 elliptic curve☆43Updated 4 years ago
- Sonic implementation in Rust☆17Updated 5 years ago
- C implementation of the CLT13 multilinear map☆14Updated 5 years ago
- ☆17Updated this week
- Pure OCaml implementation of the Groth-Maller SNARK verifier (and associated crypto)☆53Updated 5 years ago
- Website!☆21Updated last year
- BLS working standard draft☆39Updated 5 years ago
- A library providing mechanized proofs of the LibraBFT consensus using the Coq theorem prover☆25Updated 4 years ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆20Updated 5 years ago
- BLST-Verification☆20Updated 2 years ago
- 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 3 years ago
- Elliptic curve search experiments☆35Updated last year
- Coded Merkle Tree☆26Updated 5 years ago
- A formal verification of Linear PCP SNARKs.☆47Updated last month
- Implementation of the Groth16 zk-SNARK proving system☆22Updated 6 years ago
- Optimised bilinear pairings over elliptic curves☆55Updated 7 months ago
- Describe elliptic curves☆35Updated 3 years ago