merkle-crdt VS yata

Compare merkle-crdt vs yata and see what are their differences.

merkle-crdt

Merkle-Clock CRDT implementation in python (by samsquire)

yata

YATA based algorithm for plain text CRDT edit merging in python (by samsquire)
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
merkle-crdt yata
1 1
7 1
- -
0.0 0.0
almost 2 years ago almost 2 years ago
Python Python
- -
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

merkle-crdt

Posts with mentions or reviews of merkle-crdt. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-05-24.
  • We Put IPFS in Brave
    4 projects | news.ycombinator.com | 24 May 2022
    Does anyone understand merkle CRDTs?

    How do you handle conflicts where two concurrent events occur at the same time? Who wins? I know timestamps are not reliable but I want last write wins behaviour and seamless merge. The paper leaves data layer conflict resolution to the reader. It does suggest sorting by CID.

    After reading Merkle-DAGs meet CRDTs whitepaper I took a go to implement a MerkleClock. It's incomplete. I need to maintain the partial order of "occurs before".

    https://github.com/samsquire/merkle-crdt

    I also implemented part of the YATA algorithm yesterday. So I think I could merge the plain text merging functionality of that with the Merkle CRDT.

    https://github.com/samsquire/yata

yata

Posts with mentions or reviews of yata. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-05-24.
  • We Put IPFS in Brave
    4 projects | news.ycombinator.com | 24 May 2022
    Does anyone understand merkle CRDTs?

    How do you handle conflicts where two concurrent events occur at the same time? Who wins? I know timestamps are not reliable but I want last write wins behaviour and seamless merge. The paper leaves data layer conflict resolution to the reader. It does suggest sorting by CID.

    After reading Merkle-DAGs meet CRDTs whitepaper I took a go to implement a MerkleClock. It's incomplete. I need to maintain the partial order of "occurs before".

    https://github.com/samsquire/merkle-crdt

    I also implemented part of the YATA algorithm yesterday. So I think I could merge the plain text merging functionality of that with the Merkle CRDT.

    https://github.com/samsquire/yata

What are some alternatives?

When comparing merkle-crdt and yata you can also consider the following projects:

go-ds-crdt - A distributed go-datastore implementation using Merkle-CRDTs.

Go IPFS - IPFS implementation in Go [Moved to: https://github.com/ipfs/kubo]