Expand description
§Convergent
Lightweight, composable CRDTs (Conflict-Free Replicated Data Types) for decentralized systems.
CRDTs are data structures that can be replicated across nodes, modified independently, and merged with a mathematically guaranteed consistent result — no central coordination required.
§Available types
| Type | Description |
|---|---|
GCounter | Grow-only counter |
PNCounter | Positive-Negative counter |
LWWRegister | Last-Writer-Wins register (uses HLC timestamps) |
ORSet | Observed-Remove set |
Every type implements the Merge trait, which guarantees
commutativity, associativity, and idempotence.
Structs§
- GCounter
- A grow-only distributed counter.
- LWWRegister
- A distributed register where the last writer wins.
- ORSet
- A distributed set with observed-remove semantics.
- PNCounter
- A distributed counter that supports increment and decrement.