lattice

Convergence notebook

Local updates, deterministic merges, one shared value.

lattice gives each replica a CRDT state it can update independently. When replicas meet, merge uses the CRDT's lattice rule so every node converges without locks, consensus, or a conflict-resolution callback.

ReplicaLocal updateMerged value

node-a+2max(a:2, b:3)

node-b+3max(a:2, b:3)

Every replica reads5

Start fastInstall lattice_crdt and merge a counter in minutes.Choose a state shapeMatch counters, registers, sets, maps, text, or presence to your data.Pick a packageUse the umbrella package, or depend on only the CRDT family you need.Check the modelRead the causal clocks that make observed-remove types behave.

Choose the shape of your state.

Start from the data you need to replicate, then install the smallest package that carries that merge rule.

TotalCounterslattice_counters for values that only grow, or grow and shrink.Single valueRegisterslattice_registers for last-writer-wins or multi-value conflicts.MembershipSets + presencelattice_sets and lattice_presence for collections and live membership.Nested stateMaps + textlattice_maps, lattice_sequence, and lattice_text for keyed or ordered data.

Pre-1.0 Software

lattice is ready for evaluation and feedback, with property-based tests covering core merge laws. The API is still pre-1.0, so expect possible breaking changes before using it for production systems. Start with a prototype, and pin versions before you depend on public API shape.