What this is

A hands-on sequence-CRDT simulator with three genuinely independent browser-side replicas. Isolate Atlas, Beacon, or Cygnus; type a different document on each; inspect the resulting insert and delete operations; then deliver those messages one at a time or let the network play.

The model is deterministic. Inserts reference an immutable predecessor, concurrent siblings use a Lamport-clock and device-ID total order, and deletes leave tombstones instead of shifting indexes. Operations may arrive before their anchors and safely wait. The visible convergence hash only turns green when every replica has the same complete operation set and renders the same text.

Why this is mind-blowing

There is no master copy and no last writer quietly erasing the others. The conflict preset changes the same word on three partitioned devices, then shuffles the delivery schedule from a repeatable seed. All three alternatives survive, every replica independently computes the same order, and reconnecting drains the queue into one byte-for-byte result.

That is the central CRDT promise made visible: agreement comes from the algebra of the operations, not from a server deciding whose version wins. The hash is proof of shared state, while the operation inspector shows exactly why each character occupies its final position.