Two replicas edit apart, in different orders, with no coordinator. Merge is set union; the order is a pure function of the merged set — a causal sort. Slide the gossip (or tap) and watch the two collapse onto one identical line and one identical hash: convergence by construction.
The DACI substrate on one page: a node's knowledge is a grow-only set of ops {id, refs, body} — a CvRDT whose merge is set union. The linear order is a pure function of that set: depth = 1 + max(depth of refs), ties broken by id, so a ref always precedes its user and the tiebreak is total. Both replicas merge the union and linearise independently, yet produce the same line and the same FNV hash — Strong Eventual Consistency by construction, no leader, no vote. A fail-loud self-check throws unless two divergent insertion orders converge to one hash, the causal order holds, and a different set hashes differently.
A single-page simulation of two replicas (seeded, reproducible), demonstrating convergence by construction — the design proven and fuzz-tested in the full daci engine, not a networked deployment; it reconciles order, not which body is true. The merge, linearisation and hash are exact.