informalsystems / vdd
Verification-Driven Development
☆21Updated 4 years ago
Alternatives and similar repositories for vdd
Users that are interested in vdd are comparing it to the libraries listed below
Sorting:
- A TLA+ implementation of the Avalanche Protocol Family, both for learning Avalanche and TLA+☆18Updated 5 years ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆21Updated 5 years ago
- TLA+ specifications of various protocols used by wallets in the nitro protocol.☆18Updated 4 years ago
- RLN wrappers and implementation in Go☆11Updated 3 years ago
- Efficient zero-knowledge arguments in the discrete log setting, revisited☆15Updated 5 years ago
- IPC implementation atop CometBFT☆16Updated last year
- BLST-Verification☆22Updated 3 months ago
- Pastry DHT implementation with a standalone libp2p compatible node☆12Updated 4 years ago
- Compiles r1cs gadgets to the zkinterface format☆10Updated 4 years ago
- An experimental rust zksnarks compiler with embeeded bellman-bn128 prover☆42Updated 3 years ago
- Sonic implementation in Rust☆17Updated 5 years ago
- decaf377 is a prime-order group designed for use in SNARKs over BLS12-377☆17Updated 2 months ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated 2 years ago
- Web Assembly low level implementation of pairing friendly curves.☆15Updated last year
- Hackathon project for Snarky workshop.☆11Updated 5 years ago
- fft impl for ff::Field☆16Updated last year
- Coded Merkle Tree☆26Updated 5 years ago
- An implementation of a namespaced merkle tree in Rust.☆31Updated 2 weeks ago
- Diffie-Hellman key exchange using the Ristretto255 group, in Rust.☆21Updated 2 years ago
- BFT consensus in Rust☆21Updated 3 years ago
- Rust implementation of Amino☆27Updated 4 years ago
- Intel assembly finite field library generator☆12Updated last year
- Rust 256-bit unsigned integers.☆9Updated last year
- ☆14Updated last year
- An api for constructing sparse Merkle tree accumulators with random sampling capabilities.☆24Updated 3 years ago
- ☆11Updated 4 years ago
- Ed25519 suitable for use in consensus-critical contexts.☆48Updated 9 months ago
- Jepsen tests for the Tendermint distributed byzantine consensus system☆26Updated 7 years ago
- Argument systems for inner pairing products☆42Updated 9 months ago
- Embedded curve over the Ristretto255 scalar field, for use in Bulletproofs☆17Updated 5 years ago