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
• GitHub - jackyzha0/bft-json-crdt: 🏰 the first JSON-like Byzantine Fault Tolerant CRDTgithub.com
• Making CRDTs Byzantine Fault Tolerant - Martin Kleppmannmartin.kleppmann.com
• An Interactive Intro to CRDTs | jakelazaroff.comjakelazaroff.com
• practical Byzantine Fault Tolerance(pBFT) - GeeksforGeeksgeeksforgeeks.org
• MonadBFT - Monad Documentationdocs.monad.xyz
• GitHub - josephg/diamond-types: The world's fastest CRDT. WIP.github.com
• A Distributed Systems Reading Listferd.ca
• Let’s take a crack at understanding distributed consensuspreethikasireddy.com
• What is the difference between PBFT, Tendermint, HotStuff, and HotStuff-2?decentralizedthoughts.github.io
• Tower BFT: Solana’s High Performance Implementation of PBFT | by Anatoly Yakovenko | Solana | Mediummedium.com
• Building an open-source version of Antithesis, Part 1: Understanding the deterministic simulation testing ecosystemdatabases.systems