bft-json-crdt
overlord
bft-json-crdt | overlord | |
---|---|---|
2 | 1 | |
188 | 78 | |
- | - | |
10.0 | 0.0 | |
over 1 year ago | 8 months ago | |
Rust | Rust | |
MIT License | MIT License |
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.
bft-json-crdt
-
Building a BFT JSON CRDT
I'm quite surprised by the [benchmarks versus Automerge JS & Rust](https://github.com/jackyzha0/bft-json-crdt#benchmarks) when it comes to memory:
> Ours (Basic) 27.6MB
> Ours (BFT) 59.5MB
> Automerge (Rust) 232.5MB
I would expect adding the public key tracking to use more memory; I wonder how Automerge is spending so much more memory. Possibly on a bunch of internal caches or memoization that give the order-of-magnitude improvement in speed?
> Ops: 100k
> Ours (Basic) 9.321s
> Ours (BFT) 38.842s
> Automerge (Rust) 0.597s
overlord
-
Muta is part of Nervos?
Muta is chain framework (e.g. substrate or cosmos-sdk) being intensively worked on in 2020. The design goal of Muta is high performance and usability. Muta can process ~3k transactions per second and achieve instant finality thanks to a BFT consensus implementation named Overlord.
What are some alternatives?
y-sweet - A standalone yjs server with persistence to S3 or filesystem.
paxakos - Rust implementation of Paxos consensus algorithm
diamond-types - The world's fastest CRDT. WIP.
tikv - Distributed transactional key-value database, originally created to complement TiDB
cr-sqlite - Convergent, Replicated SQLite. Multi-writer and CRDT support for SQLite
muta - Muta is a high-performance blockchain framework.
AlephBFT - Rust implementation of Aleph consensus protocol
cita - A high performance blockchain kernel for enterprise users.
prolly-trees - Hash consistent search trees.