This simulator demonstrates how independent replicas of a CRDT, each updated offline and out of order, always converge to an identical final state once merged, by visualizing the join-semilattice merge operation on a live Grow-only Counter.
Add replicas, apply increments to each one independently while they remain disconnected, then trigger merges in any order or sequence you like and watch every replica's total converge to the same value regardless of merge order.
Controls let you create multiple replicas, apply local increment operations to each while offline, toggle network connectivity, and trigger state merges in arbitrary orders to observe convergence.
Did you know that the mathematical property guaranteeing CRDT convergence, the join-semilattice, is the same algebraic structure used to define the least upper bound in order theory, meaning CRDT correctness proofs borrow directly from decades-old pure mathematics rather than being a new invention of distributed computing.
This simulator demonstrates how independent replicas of a CRDT, each updated offline and out of order, always converge to an identical final state once merged, by visualizing the join-semilattice merge operation on a live Grow-only Counter.
This simulator demonstrates how independent replicas of a CRDT, each updated offline and out of order, always converge to an identical final state once merged, by visualizing the join-semilattice merge operation on a live Grow-only Counter.
Add replicas, apply increments to each one independently while they remain disconnected, then trigger merges in any order or sequence you like and watch every replica's total converge to the same value regardless of merge order.
Did you know that the mathematical property guaranteeing CRDT convergence, the join-semilattice, is the same algebraic structure used to define the least upper bound in order theory, meaning CRDT correctness proofs borrow directly from decades-old pure mathematics rather than being a new invention of distributed computing.