davidrusu/bft-crdts: Byzantine Fault Tolerant CRDT's and other Eventually Consistent Algorithms

Byzantine Fault Tolerant CRDT's and other Eventually Consistent Algorithms

Byzantine Fault Tolerant Eventually Consistent Algorithms This research was funded by Maidsafe and open sourced at their request. (MIT/BSD-3) The repository contains a byzantine fault tolerant systems for achieving network agreement over eventually consistent algorithms. The system is implemented as a three layered onion. The center is the eventually consistent algorithm, e.g. CRDT's or perhaps a causal asset transfer system (AT2). This core is responsible for validating and applying incoming operations, this is the "business logic" of the system. On top of the core we layer an implementation

related reading

• Building a BFT JSON CRDTjzhao.xyz
• Making CRDTs Byzantine Fault Tolerant - Martin Kleppmannmartin.kleppmann.com
• A Distributed Systems Reading Listferd.ca
• Let’s take a crack at understanding distributed consensuspreethikasireddy.com
• GitHub - jackyzha0/bft-json-crdt: 🏰 the first JSON-like Byzantine Fault Tolerant CRDTgithub.com
• Consensus Canon - a16z cryptoa16zcrypto.com
• practical Byzantine Fault Tolerance(pBFT) - GeeksforGeeksgeeksforgeeks.org
• Byzantine fault - Wikipediaen.wikipedia.org
• How to do distributed locking - Martin Kleppmann's blogmartin.kleppmann.com
• Conflict-free replicated data type - Wikipediaen.wikipedia.org
• Cadence: Extreme Pipelining with Multiple Concurrent Proposersarxiv.org
• Three-phase commit protocolen.wikipedia.org