konnov / bymc
Byzantine model checker
☆21Updated last year
Related projects ⓘ
Alternatives and complementary repositories for bymc
- Formal verification of the Algorand consensus protocol☆26Updated last year
- A Coq-based framework to verify the correctness of Byzantine fault-tolerant distributed systems☆28Updated 5 years ago
- A minimalistic blockchain consensus implemented and verified in Coq☆111Updated 4 years ago
- State-Transition Systems for Smart Contracts☆24Updated 4 years ago
- A formalization of a Proof-of-Stake Nakamoto-style blockchain in Coq☆25Updated 3 years ago
- A library providing mechanized proofs of the LibraBFT consensus using the Coq theorem prover☆25Updated 4 years ago
- The modular protocol framework based on Universal Composability☆18Updated 4 years ago
- Arithmetic circuits for zero knowledge proof systems☆82Updated 6 months ago
- A foundational framework for modular cryptographic proofs in Coq☆56Updated last week
- A framework for smart contract verification in Coq☆114Updated last month
- the CheckMate protocol verification tool☆10Updated this week
- ☆59Updated 2 years ago
- Tools for conformance monitoring on Kubernetes with TLA+☆19Updated 4 months ago
- Super Amazing Universal Composability, Yeah!☆33Updated 2 years ago
- Executable formal model of the EVM and Yul in Lean 4.☆36Updated this week
- A model of the RISC Zero zkVM and ecosystem in the Lean 4 Theorem Prover☆57Updated last year
- Collection of Distributed Protocol Verification Problems☆12Updated 6 months ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆20Updated 5 years ago
- Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings☆45Updated 4 years ago
- Coq definitions and lemmas for verification of Casper☆17Updated 5 years ago
- Foundational Cryptography Framework for machine-checked proofs of cryptography.☆48Updated 6 months ago
- Hackathon project for Snarky workshop.☆11Updated 5 years ago
- Formalization of the UTxO abstract model for (bitcoin-style) blockchain transactions.☆14Updated this week
- A formal verification of Linear PCP SNARKs.☆48Updated 3 months ago
- BLST-Verification☆20Updated 2 years ago
- Formalization of Tendermint proposer election properties☆15Updated 5 years ago
- An implementation of a simple asynchronous message-passing lock server, verified in Coq using the Verdi framework☆13Updated 7 years ago
- A toy implementation of the EVM in Lean4.☆10Updated 5 months ago
- authenticated data structures, generically☆50Updated 8 years ago
- Rewrites TLA⁺ specs to use Unicode symbols instead of ASCII, and vice-versa☆28Updated 2 weeks ago