runtimeverification / casper-proofs
Coq definitions and lemmas for verification of Casper
☆18Updated 5 years ago
Alternatives and similar repositories for casper-proofs:
Users that are interested in casper-proofs are comparing it to the libraries listed below
- The modular protocol framework based on Universal Composability☆18Updated 4 years ago
- A formal verification of Linear PCP SNARKs.☆53Updated 9 months ago
- A support library for working with zero knowledge cryptography in Lean 4.☆37Updated 3 weeks ago
- A formal specification of the Yul IR semantics in the Lean proof assistant.☆13Updated 3 years ago
- Futhark implementation of neptune-compatible Poseidon.☆27Updated 4 years ago
- Generator and supporting evidence for security of the Tweedledum/Tweedledee pair of elliptic curves suitable for Halo☆20Updated 2 years ago
- Formal verification of the Algorand consensus protocol☆26Updated 2 years ago
- A library providing mechanized proofs of the LibraBFT consensus using the Coq theorem prover☆26Updated 4 years ago
- Elliptic curve search experiments☆35Updated 2 years ago
- Formalization of the Beacon Chain Phase 0 Specification in K☆21Updated 2 years ago
- Shared Lurk source code, including tests and library code.☆18Updated last year
- The Juvix standard library☆14Updated this week
- Super Amazing Universal Composability, Yeah!☆34Updated 2 years ago
- Website!☆22Updated 2 years ago
- Hackathon project for Snarky workshop.☆11Updated 5 years ago
- A model of the RISC Zero zkVM and ecosystem in the Lean 4 Theorem Prover☆66Updated 2 years ago
- the CheckMate protocol verification tool☆10Updated last week
- A formalization of a Proof-of-Stake Nakamoto-style blockchain in Coq☆25Updated 4 years ago
- Eth2.0 spec in Dafny☆78Updated 10 months ago
- Formal verification for Solidity smart contracts with Coq 🐓 Verify arbitrary properties on your smart contracts and make no bugs!☆32Updated last week
- Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings☆45Updated 5 years ago
- Fast and simple constant-time hashing to the BLS12-381 elliptic curve☆43Updated 5 years ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆21Updated 5 years ago
- Formalizing Polynomial Commitment Schemes in the Interactive Theorem Prover Isabelle.☆10Updated last month
- A Coq-based framework to verify the correctness of Byzantine fault-tolerant distributed systems☆31Updated 5 years ago
- Verification of the gnark implementation of the Semaphore protocol using Reilabs' extractor to Lean.☆15Updated last year
- Formal verification of the zkWasm project☆11Updated 8 months ago
- ☆58Updated 5 months ago
- BLS working standard draft☆39Updated 5 years ago
- Implementing a Turing-complete computer (OISC) within a zk-SNARKS circuit.☆13Updated 3 years ago