simple implementations for MicroServiceArchitecture patterns
-
Updated
Jun 6, 2020 - Java
simple implementations for MicroServiceArchitecture patterns
In distributed computing, a conflict-free replicated data type (CRDT) is a data structure which can be replicated across multiple computers in a network, where the replicas can be updated independently and concurrently without coordination between the replicas, and where it is always mathematically possible to resolve inconsistencies that might …
A distributed typescript / javascript datastore implementation using Merkle-CRDTs.
An abstract implementation of a Merkle Search Tree, structurally compatible with ATProto's instantiation
This is an implementation in progress of various conflict free replicated datatypes (CRDT) in Scala.
real-time collaborative editor built on CRDT
Go implementation of some CRDTs
Implementation of LWW-Element-Graph in PHP
LWW Element Set is an algorithm under Conflict-free replicated data type(CRDT), here is the Python implementation
A CRDT based collaborative Sudoku.
An implementation of Logoot-Undo in Swift
A mini demonstration applications for the Concordant platform.
C# sample implementation of the Grow-only Counter CRDT structure
A Python implementation of LLW Element Set following a hybrid approach that allows time travel.
Some CRDT samples to be used as reference
Conflict-Free Replicated Data Type implementations in C#
A Text Crdt implementation on top of the liveblocks platform, and tiptap (prosemirror) text editor
Convergent and Commutative Replicated Data Types implementation in Swift
Add a description, image, and links to the crdt-implementations topic page so that developers can more easily learn about it.
To associate your repository with the crdt-implementations topic, visit your repo's landing page and select "manage topics."