✳flâneur — a map of the web's best reading

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

github.com · 703 words · saved by 1 readers

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

Explore this link on the map →

related reading