nano-o / PaxosMadeSimple
A TLA+ formalization of the algorithm described in "Paxos Made Simple"
☆21Updated 3 months ago
Alternatives and similar repositories for PaxosMadeSimple
Users that are interested in PaxosMadeSimple are comparing it to the libraries listed below
Sorting:
- Different TLA+ specifications, mostly for learning purposes☆32Updated last year
- Synchronous fault-tolerant distributed algorithms encoded in TLA+☆32Updated 4 years ago
- High Speed elliptic curve signature system using a 260-bit Granger Moss Prime.☆14Updated 3 years ago
- BLST-Verification☆22Updated 3 months ago
- Verification-Driven Development☆21Updated 4 years ago
- Rust CASPaxos implementation☆66Updated 4 years ago
- A specification of the CBC Casper consensus protocols written in TLA+ and PlusCal (transpiled to TLA+)☆21Updated 5 years ago
- The rewrite of TLAPM, the TLAPS proof manager☆1Updated 5 years ago
- ☆15Updated 7 years ago
- TLA+ Spec of a simplified part of MongoDB replication system☆46Updated 5 years ago
- Proving a blocking queue deadlock free in a dozen different ways☆42Updated 6 months ago
- Compiler for BitML☆28Updated 3 years ago
- Experimental language for verifiable computation using zero-knowledge proofs☆25Updated 7 years ago
- Hackathon project for Snarky workshop.☆11Updated 5 years ago
- Byzantine Fault Tolerant CRDT's and other Eventually Consistent Algorithms☆59Updated 4 years ago
- Animations for Elementary-Affine-Net interactions☆11Updated 5 years ago
- Distributed Data Structures in Coq☆49Updated 11 years ago
- Sonic implementation in Rust☆17Updated 5 years ago
- Apache-2 licensed common Ethereum structs shared by crates☆21Updated 5 years ago
- Model-based testing tool☆58Updated 2 months ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- Rust bindings to formally-proven field arithmetic operations from MIT's fiat-crypto project☆12Updated 5 years ago
- ☆23Updated 2 years ago
- A Rust implementation of Plumtree algorithm☆29Updated 3 months ago
- A minimalistic blockchain consensus implemented and verified in Coq☆111Updated 5 years ago
- Formalization of Tendermint proposer election properties☆15Updated 6 years ago
- An implementation of a simple asynchronous message-passing lock server, verified in Coq using the Verdi framework☆14Updated 7 years ago
- ☆10Updated 3 years ago
- A collection of useful TLA+ operators☆21Updated 7 years ago
- Pluscal/TLA+ modeling of distributed systems/protocols☆78Updated last year