ept / byzantine-eventualLinks
Byzantine Eventual Consistency
☆22Updated 2 years ago
Alternatives and similar repositories for byzantine-eventual
Users that are interested in byzantine-eventual are comparing it to the libraries listed below
Sorting:
- A homomorphic hash function☆78Updated 6 years ago
- ☆43Updated 5 years ago
- Testground: SDK for developing test plans in Go☆12Updated last year
- The go-ipfs merkledag 'service' implementation☆83Updated 3 weeks ago
- Verification-Driven Development☆21Updated 4 years ago
- Go implementation of Rateless IBLTs.☆57Updated last year
- Initial Implementation Of GraphSync Wire Protocol☆102Updated 3 weeks ago
- [ARCHIVED] This module provides a thin wrapper over a datastore and provides caching strategies.☆49Updated 2 years ago
- framework for evaluating (planet-scale) consensus protocols☆128Updated last year
- Typescript implementation of Yamux☆16Updated 3 weeks ago
- A library for synchronizing remote data with minimum communication.☆26Updated 2 years ago
- A distributed key-value storage that's tolerant to Byzantine fault.☆30Updated 5 years ago
- Go version of append-only log CRDT on IPFS☆87Updated 3 weeks ago
- A pseudo-random deterministic merkle tree built on LMDB☆76Updated 6 months ago
- Implementation of Prio in Rust.☆113Updated 2 weeks ago
- Interoperability tests for libp2p Implementations☆20Updated last week
- SpiderMonkey-based Wasm sandbox☆22Updated 5 years ago
- Sparse Merkle Tree☆56Updated 2 years ago
- Building resilience into the foundational infrastructure for Human Knowledge☆108Updated 8 months ago
- a sharded store to hold large IPLD graphs efficiently, packaged as location-transparent attachable CAR files, with mechanical sympathy☆42Updated last year
- Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, and Alastair R. Beresford. Verifying Strong Eventual Consistency in Distribute…☆74Updated 2 years ago
- oZKS (Ordered Zero-Knowledge Set) is a library that provides an implementation of an Ordered (and Append Only) Zero-Knowledge Set.☆26Updated last year
- Data recovery for IPFS protocol.☆25Updated 5 years ago
- An experimental Substrate implementation of the Radicle Registry 📒☆33Updated 5 years ago
- ☆12Updated 5 years ago
- Go Ed25519 suitable for use in consensus-critical contexts.☆52Updated last year
- FastPay: High-Performance Byzantine Fault Tolerant Settlement☆83Updated 3 years ago
- Oblivious Pseudorandom Functions (OPRFs) using Prime-Order Groups☆38Updated last year
- A gossipsub protocol simulator☆40Updated 3 years ago
- Byzantine Fault Tolerant CRDT's and other Eventually Consistent Algorithms☆62Updated 4 years ago