json-patch-to-crdt 0.4.0 → 0.5.0

package/dist/{compact-BcwxBNx_.mjs → compact-Dj0BYeY5.mjs}

@@ -26,6 +26,7 @@ function toDepthApplyError(error) {
 
 //#endregion
 //#region src/version-vector.ts
+let observedVersionVectorObserverForTests = null;
 function readVersionVectorCounter(vv, actor) {
 	if (!Object.prototype.hasOwnProperty.call(vv, actor)) return;
 	const counter = vv[actor];
@@ -50,6 +51,7 @@ function observeVersionVectorDot(vv, dot) {
 * of the currently materialized document tree.
 */
 function observedVersionVector(target) {
+	observedVersionVectorObserverForTests?.(target);
 	const doc = "doc" in target ? target.doc : target;
 	const vv = Object.create(null);
 	if ("clock" in target) observeVersionVectorDot(vv, {
@@ -493,6 +495,7 @@ function rgaPrevForInsertAtIndex(seq, index) {
 //#endregion
 //#region src/materialize.ts
 let materializeObserver = null;
+const EMPTY_PATH = [];
 function createMaterializedObject() {
 	return Object.create(null);
 }
@@ -507,7 +510,7 @@ function setMaterializedProperty(out, key, value) {
 /** Convert a CRDT node graph into a plain JSON value using an explicit stack. */
 function materialize(node) {
 	const observer = materializeObserver;
-	observer?.([], node);
+	observer?.(EMPTY_PATH, node);
 	if (node.kind === "lww") return node.value;
 	const root = node.kind === "obj" ? createMaterializedObject() : [];
 	const stack = [];
@@ -538,7 +541,7 @@ function materialize(node) {
 			const child = entry.node;
 			const childDepth = frame.depth + 1;
 			assertTraversalDepth(childDepth);
-			const childPath = [...frame.path, key];
+			const childPath = observer ? [...frame.path, key] : EMPTY_PATH;
 			observer?.(childPath, child);
 			if (child.kind === "lww") {
 				setMaterializedProperty(frame.out, key, child.value);
@@ -576,7 +579,7 @@ function materialize(node) {
 		const child = elem.value;
 		const childDepth = frame.depth + 1;
 		assertTraversalDepth(childDepth);
-		const childPath = [...frame.path, String(frame.nextIndex)];
+		const childPath = observer ? [...frame.path, String(frame.nextIndex)] : EMPTY_PATH;
 		frame.nextIndex += 1;
 		observer?.(childPath, child);
 		if (child.kind === "lww") {
@@ -2068,51 +2071,35 @@ function docFromJson(value, nextDot) {
 	return { root: nodeFromJson(value, nextDot) };
 }
 /**
-* Legacy: create a doc using a single dot with counter offsets for array children.
-* Prefer `docFromJson(value, nextDot)` to ensure unique dots per node.
+* Legacy helper for tests and fixtures that seeds an entire document from one dot.
+*
+* It reuses that dot for object entries and synthesizes array child counters from the
+* same seed, which can produce low-quality causal metadata and unrealistic sequence
+* identities in production CRDT state.
+*
+* Prefer `docFromJson(value, nextDot)` so every node receives a fresh unique dot.
+*
+* @deprecated Use `docFromJson(value, nextDot)` for production documents.
 */
 function docFromJsonWithDot(value, dot) {
 	return { root: deepNodeFromJson(value, dot) };
 }
 function getSeqAtPath(doc, path) {
-	let cur = doc.root;
-	for (const seg of path) {
-		if (cur.kind !== "obj") return;
-		const ent = cur.entries.get(seg);
-		if (!ent) return;
-		cur = ent.node;
-	}
-	return cur.kind === "seq" ? cur : void 0;
+	const node = getNodeAtPath(doc, path);
+	return node?.kind === "seq" ? node : void 0;
 }
 function getObjAtPathStrict(doc, path) {
-	let cur = doc.root;
-	const seen = [];
-	if (path.length === 0) {
-		if (cur.kind !== "obj") return {
-			ok: false,
-			message: "expected object at /"
-		};
+	const node = getNodeAtPath(doc, path);
+	if (!node || node.kind !== "obj") {
+		const pointer = stringifyJsonPointer(path);
 		return {
-			ok: true,
-			obj: cur
-		};
-	}
-	for (const seg of path) {
-		if (cur.kind !== "obj") return {
-			ok: false,
-			message: `expected object at /${seen.join("/")}`
-		};
-		const entry = cur.entries.get(seg);
-		seen.push(seg);
-		if (!entry || entry.node.kind !== "obj") return {
 			ok: false,
-			message: `expected object at /${seen.join("/")}`
+			message: `expected object at ${pointer === "" ? "/" : pointer}`
 		};
-		cur = entry.node;
 	}
 	return {
 		ok: true,
-		obj: cur
+		obj: node
 	};
 }
 function ensureSeqAtPath(head, path, dotForCreate) {
@@ -2159,10 +2146,24 @@ function ensureSeqAtPath(head, path, dotForCreate) {
 function getNodeAtPath(doc, path) {
 	let cur = doc.root;
 	for (const seg of path) {
-		if (cur.kind !== "obj") return;
-		const ent = cur.entries.get(seg);
-		if (!ent) return;
-		cur = ent.node;
+		if (cur.kind === "obj") {
+			const ent = cur.entries.get(seg);
+			if (!ent) return;
+			cur = ent.node;
+			continue;
+		}
+		if (cur.kind === "seq") {
+			if (!ARRAY_INDEX_TOKEN_PATTERN.test(seg)) return;
+			const index = Number(seg);
+			if (!Number.isSafeInteger(index)) return;
+			const elemId = rgaIdAtIndex(cur, index);
+			if (elemId === void 0) return;
+			const elem = cur.elems.get(elemId);
+			if (!elem) return;
+			cur = elem.value;
+			continue;
+		}
+		if (cur.kind === "lww") return;
 	}
 	return cur;
 }
@@ -2376,38 +2377,88 @@ function getJsonAtDocPathForTest(doc, path) {
 	let cur = doc.root;
 	for (let i = 0; i < path.length; i++) {
 		const seg = path[i];
-		assertTraversalDepth(i + 1);
+		try {
+			assertTraversalDepth(i + 1);
+		} catch (error) {
+			return {
+				ok: false,
+				error: error instanceof TraversalDepthError ? toDepthApplyError(error) : {
+					ok: false,
+					code: 409,
+					reason: "INVALID_PATCH",
+					message: error instanceof Error ? error.message : "invalid test path"
+				}
+			};
+		}
 		if (cur.kind === "obj") {
 			const ent = cur.entries.get(seg);
-			if (!ent) throw new Error(`Missing key '${seg}'`);
+			if (!ent) return {
+				ok: false,
+				error: {
+					ok: false,
+					code: 409,
+					reason: "MISSING_TARGET",
+					message: `Missing key '${seg}'`
+				}
+			};
 			cur = ent.node;
 			continue;
 		}
 		if (cur.kind === "seq") {
-			if (!ARRAY_INDEX_TOKEN_PATTERN.test(seg)) throw new Error(`Expected array index, got '${seg}'`);
-			const id = rgaIdAtIndex(cur, Number(seg));
-			if (id === void 0) throw new Error(`Index out of bounds at '${seg}'`);
+			if (!ARRAY_INDEX_TOKEN_PATTERN.test(seg)) return {
+				ok: false,
+				error: {
+					ok: false,
+					code: 409,
+					reason: "INVALID_POINTER",
+					message: `Expected array index, got '${seg}'`
+				}
+			};
+			const idx = Number(seg);
+			if (!Number.isSafeInteger(idx)) return {
+				ok: false,
+				error: {
+					ok: false,
+					code: 409,
+					reason: "OUT_OF_BOUNDS",
+					message: `Index out of bounds at '${seg}'`
+				}
+			};
+			const id = rgaIdAtIndex(cur, idx);
+			if (id === void 0) return {
+				ok: false,
+				error: {
+					ok: false,
+					code: 409,
+					reason: "OUT_OF_BOUNDS",
+					message: `Index out of bounds at '${seg}'`
+				}
+			};
 			cur = cur.elems.get(id).value;
 			continue;
 		}
-		throw new Error(`Cannot traverse into non-container at '${seg}'`);
-	}
-	return cur.kind === "lww" ? cur.value : materialize(cur);
-}
-function applyTest(base, head, it, evalTestAgainst) {
-	let got;
-	try {
-		got = getJsonAtDocPathForTest(evalTestAgainst === "head" ? head : base, it.path);
-	} catch {
 		return {
 			ok: false,
-			code: 409,
-			reason: "MISSING_TARGET",
-			message: `test path missing at /${it.path.join("/")}`,
-			path: `/${it.path.join("/")}`
+			error: {
+				ok: false,
+				code: 409,
+				reason: "INVALID_TARGET",
+				message: `Cannot traverse into non-container at '${seg}'`
+			}
 		};
 	}
-	if (!jsonEquals(got, it.value)) return {
+	return {
+		ok: true,
+		value: cur.kind === "lww" ? cur.value : materialize(cur)
+	};
+}
+function applyTest(base, head, it, evalTestAgainst) {
+	const got = getJsonAtDocPathForTest(evalTestAgainst === "head" ? head : base, it.path);
+	if (!got.ok) return {
+		...got.error,
+		path: `/${it.path.join("/")}`
+	};
+	if (!jsonEquals(got.value, it.value)) return {
 		ok: false,
 		code: 409,
 		reason: "TEST_FAILED",
@@ -2712,6 +2763,46 @@ function rebaseDiffOps(path, nestedOps, out) {
 		throw new Error(`Unexpected op '${op.op}' from diffJsonPatch`);
 	}
 }
+function collectLiveSequenceElements(seq) {
+	const elems = [];
+	const cursor = rgaCreateLinearCursor(seq);
+	for (let elem = cursor.next(); elem; elem = cursor.next()) elems.push(elem);
+	return elems;
+}
+function materializeSequenceWindow(elems, start, end) {
+	const out = [];
+	for (let i = start; i < end; i++) out.push(nodeToJsonForPatch(elems[i].value));
+	return out;
+}
+function rebaseSequenceWindowDiffOps(path, indexOffset, nestedOps, out) {
+	const pending = [];
+	for (const op of nestedOps) {
+		if (op.path === "") return false;
+		const rebasedSegments = parseJsonPointer(op.path);
+		const indexToken = rebasedSegments[0];
+		if (!indexToken || !ARRAY_INDEX_TOKEN_PATTERN.test(indexToken)) return false;
+		rebasedSegments[0] = String(Number(indexToken) + indexOffset);
+		const rebasedPath = stringifyJsonPointer([...path, ...rebasedSegments]);
+		if (op.op === "remove") {
+			pending.push({
+				op: "remove",
+				path: rebasedPath
+			});
+			continue;
+		}
+		if (op.op === "add" || op.op === "replace") {
+			pending.push({
+				op: op.op,
+				path: rebasedPath,
+				value: op.value
+			});
+			continue;
+		}
+		return false;
+	}
+	out.push(...pending);
+	return true;
+}
 function nodesJsonEqual(baseNode, headNode, depth) {
 	assertTraversalDepth(depth);
 	if (baseNode === headNode) return true;
@@ -2836,6 +2927,35 @@ function diffObjectNodes(path, baseNode, headNode, options, ops, depth) {
 		headIndex += 1;
 	}
 }
+function diffSequenceNodes(path, baseNode, headSeq, options, ops, depth) {
+	if ((options.arrayStrategy ?? "lcs") === "atomic") {
+		rebaseDiffOps(path, diffJsonPatch(materialize(baseNode), materialize(headSeq), options), ops);
+		return;
+	}
+	const baseElems = collectLiveSequenceElements(baseNode);
+	const headElems = collectLiveSequenceElements(headSeq);
+	const sharedLength = Math.min(baseElems.length, headElems.length);
+	let prefixLength = 0;
+	while (prefixLength < sharedLength && nodesJsonEqual(baseElems[prefixLength].value, headElems[prefixLength].value, depth + 1)) prefixLength += 1;
+	if (prefixLength === baseElems.length && prefixLength === headElems.length) return;
+	let baseEnd = baseElems.length;
+	let headEnd = headElems.length;
+	while (baseEnd > prefixLength && headEnd > prefixLength && nodesJsonEqual(baseElems[baseEnd - 1].value, headElems[headEnd - 1].value, depth + 1)) {
+		baseEnd -= 1;
+		headEnd -= 1;
+	}
+	const unmatchedBaseLength = baseEnd - prefixLength;
+	const unmatchedHeadLength = headEnd - prefixLength;
+	if (unmatchedBaseLength === 1 && unmatchedHeadLength === 1) {
+		path.push(String(prefixLength));
+		diffNodeToPatch(path, baseElems[prefixLength].value, headElems[prefixLength].value, options, ops, depth + 1);
+		path.pop();
+		return;
+	}
+	const seqOps = diffJsonPatch(materializeSequenceWindow(baseElems, prefixLength, baseEnd), materializeSequenceWindow(headElems, prefixLength, headEnd), options);
+	if (rebaseSequenceWindowDiffOps(path, prefixLength, seqOps, ops)) return;
+	rebaseDiffOps(path, diffJsonPatch(materialize(baseNode), materialize(headSeq), options), ops);
+}
 function diffNodeToPatch(path, baseNode, headNode, options, ops, depth) {
 	assertTraversalDepth(depth);
 	if (baseNode === headNode) return;
@@ -2861,8 +2981,7 @@ function diffNodeToPatch(path, baseNode, headNode, options, ops, depth) {
 		diffObjectNodes(path, baseNode, headNode, options, ops, depth);
 		return;
 	}
-	const headSeq = headNode;
-	rebaseDiffOps(path, diffJsonPatch(materialize(baseNode), materialize(headSeq), options), ops);
+	diffSequenceNodes(path, baseNode, headNode, options, ops, depth);
 }
 /**
 * Generate a JSON Patch delta between two CRDT documents.
@@ -2904,7 +3023,7 @@ function jsonPatchToCrdtInternal(options) {
 		}
 		return applyIntentsToCrdt(options.base, options.head, intents, options.newDot, evalTestAgainst, options.bumpCounterAbove, { strictParents: options.strictParents });
 	}
-	let shadowBase = cloneDoc(evalTestAgainst === "base" ? options.base : options.head);
+	const shadowBase = evalTestAgainst === "base" ? cloneDoc(options.base) : null;
 	let shadowCtr = 0;
 	const shadowDot = () => ({
 		actor: "__shadow__",
@@ -2913,60 +3032,340 @@ function jsonPatchToCrdtInternal(options) {
 	const shadowBump = (ctr) => {
 		if (shadowCtr < ctr) shadowCtr = ctr;
 	};
-	const applySequentialOp = (op, opIndex) => {
-		const baseJson = materialize(shadowBase.root);
-		let intents;
-		try {
-			intents = compileJsonPatchToIntent(baseJson, [op], { semantics: "sequential" });
-		} catch (error) {
-			return withOpIndex(toApplyError$1(error), opIndex);
+	const session = { pointerCache: /* @__PURE__ */ new Map() };
+	for (const [opIndex, op] of options.patch.entries()) {
+		const step = applySequentialPatchOp(options, evalTestAgainst === "base" ? shadowBase : options.head, op, opIndex, evalTestAgainst, shadowDot, shadowBump, session);
+		if (!step.ok) return step;
+	}
+	return { ok: true };
+}
+function applySequentialPatchOp(options, compileBase, op, opIndex, evalTestAgainst, shadowDot, shadowBump, session) {
+	if (op.op === "move") {
+		if (op.from === op.path) {
+			const pathCheck = resolveValueAtPointerInDoc$1(compileBase, op.from, opIndex, session.pointerCache);
+			if (!pathCheck.ok) return pathCheck;
+			return { ok: true };
+		}
+		const fromResolved = resolveValueAtPointerInDoc$1(compileBase, op.from, opIndex, session.pointerCache);
+		if (!fromResolved.ok) return fromResolved;
+		const removeStep = applySingleSequentialPatchStep(options, compileBase, {
+			op: "remove",
+			path: op.from
+		}, opIndex, evalTestAgainst, shadowDot, shadowBump, session);
+		if (!removeStep.ok) return removeStep;
+		return applySingleSequentialPatchStep(options, compileBase, {
+			op: "add",
+			path: op.path,
+			value: structuredClone(fromResolved.value)
+		}, opIndex, evalTestAgainst, shadowDot, shadowBump, session);
+	}
+	if (op.op === "copy") {
+		const fromResolved = resolveValueAtPointerInDoc$1(compileBase, op.from, opIndex, session.pointerCache);
+		if (!fromResolved.ok) return fromResolved;
+		return applySingleSequentialPatchStep(options, compileBase, {
+			op: "add",
+			path: op.path,
+			value: structuredClone(fromResolved.value)
+		}, opIndex, evalTestAgainst, shadowDot, shadowBump, session);
+	}
+	return applySingleSequentialPatchStep(options, compileBase, op, opIndex, evalTestAgainst, shadowDot, shadowBump, session);
+}
+function applySingleSequentialPatchStep(options, compileBase, op, opIndex, evalTestAgainst, shadowDot, shadowBump, session) {
+	const compiled = compilePreparedSingleIntentFromDoc$1(compileBase, op, session.pointerCache, opIndex);
+	if (!compiled.ok) return compiled;
+	const headStep = applyIntentsToCrdt(compileBase, options.head, compiled.intents, options.newDot, evalTestAgainst, options.bumpCounterAbove, { strictParents: options.strictParents });
+	if (!headStep.ok) return withOpIndex$1(headStep, opIndex);
+	if (op.op === "test") return { ok: true };
+	if (evalTestAgainst === "head") return { ok: true };
+	const shadowStep = applyIntentsToCrdt(compileBase, compileBase, compiled.intents, shadowDot, "base", shadowBump, { strictParents: options.strictParents });
+	if (!shadowStep.ok) return withOpIndex$1(shadowStep, opIndex);
+	return { ok: true };
+}
+function resolveValueAtPointerInDoc$1(doc, pointer, opIndex, pointerCache) {
+	const parsedPath = parsePointerWithCache$1(pointer, pointerCache, opIndex);
+	if (!parsedPath.ok) return parsedPath;
+	const resolved = resolveNodeAtPath$1(doc.root, parsedPath.path);
+	if (!resolved.ok) return {
+		ok: false,
+		...resolved.error,
+		path: pointer,
+		opIndex
+	};
+	return {
+		ok: true,
+		value: nodeToJsonForPatch(resolved.node)
+	};
+}
+function compilePreparedSingleIntentFromDoc$1(baseDoc, op, pointerCache, opIndex) {
+	const parsedPath = parsePointerWithCache$1(op.path, pointerCache, opIndex);
+	if (!parsedPath.ok) return parsedPath;
+	const path = parsedPath.path;
+	if (op.op === "test") return {
+		ok: true,
+		intents: [{
+			t: "Test",
+			path,
+			value: op.value
+		}]
+	};
+	if (path.length === 0) {
+		if (op.op === "remove") return {
+			ok: false,
+			code: 409,
+			reason: "INVALID_TARGET",
+			message: "remove at root path is not supported in RFC-compliant mode",
+			path: op.path,
+			opIndex
+		};
+		return {
+			ok: true,
+			intents: [{
+				t: "ObjSet",
+				path: [],
+				key: ROOT_KEY,
+				value: op.value
+			}]
+		};
+	}
+	const parentPath = path.slice(0, -1);
+	const parentPointer = stringifyJsonPointer(parentPath);
+	const key = path[path.length - 1];
+	const resolvedParent = parentPath.length === 0 ? {
+		ok: true,
+		node: baseDoc.root
+	} : resolveNodeAtPath$1(baseDoc.root, parentPath);
+	if (!resolvedParent.ok) return {
+		ok: false,
+		...resolvedParent.error,
+		path: parentPointer,
+		opIndex
+	};
+	const parentNode = resolvedParent.node;
+	if (parentNode.kind === "seq") {
+		const parsedIndex = parseArrayIndexTokenForDoc$1(key, op.op, op.path, opIndex);
+		if (!parsedIndex.ok) return parsedIndex;
+		const boundedIndex = validateArrayIndexBounds$1(parsedIndex.index, op.op, rgaLength(parentNode), op.path, opIndex);
+		if (!boundedIndex.ok) return boundedIndex;
+		if (op.op === "add") return {
+			ok: true,
+			intents: [{
+				t: "ArrInsert",
+				path: parentPath,
+				index: boundedIndex.index,
+				value: op.value
+			}]
+		};
+		if (op.op === "remove") return {
+			ok: true,
+			intents: [{
+				t: "ArrDelete",
+				path: parentPath,
+				index: boundedIndex.index
+			}]
+		};
+		return {
+			ok: true,
+			intents: [{
+				t: "ArrReplace",
+				path: parentPath,
+				index: boundedIndex.index,
+				value: op.value
+			}]
+		};
+	}
+	if (parentNode.kind !== "obj") return {
+		ok: false,
+		code: 409,
+		reason: "INVALID_TARGET",
+		message: `expected object or array parent at ${parentPointer}`,
+		path: parentPointer,
+		opIndex
+	};
+	if (key === "__proto__") return {
+		ok: false,
+		code: 409,
+		reason: "INVALID_POINTER",
+		message: `unsafe object key at ${op.path}`,
+		path: op.path,
+		opIndex
+	};
+	const entry = parentNode.entries.get(key);
+	if ((op.op === "replace" || op.op === "remove") && !entry) return {
+		ok: false,
+		code: 409,
+		reason: "MISSING_TARGET",
+		message: `missing key ${key} at ${parentPointer}`,
+		path: op.path,
+		opIndex
+	};
+	if (op.op === "remove") return {
+		ok: true,
+		intents: [{
+			t: "ObjRemove",
+			path: parentPath,
+			key
+		}]
+	};
+	return {
+		ok: true,
+		intents: [{
+			t: "ObjSet",
+			path: parentPath,
+			key,
+			value: op.value,
+			mode: op.op
+		}]
+	};
+}
+function parsePointerWithCache$1(pointer, pointerCache, opIndex) {
+	const cachedPath = pointerCache.get(pointer);
+	if (cachedPath !== void 0) return {
+		ok: true,
+		path: cachedPath.slice()
+	};
+	try {
+		const parsedPath = parseJsonPointer(pointer);
+		pointerCache.set(pointer, parsedPath);
+		return {
+			ok: true,
+			path: parsedPath.slice()
+		};
+	} catch (error) {
+		return {
+			ok: false,
+			code: 409,
+			reason: "INVALID_POINTER",
+			message: error instanceof Error ? error.message : "invalid pointer",
+			path: pointer,
+			opIndex
+		};
+	}
+}
+function resolveNodeAtPath$1(root, path) {
+	let current = root;
+	for (const segment of path) {
+		if (current.kind === "obj") {
+			const entry = current.entries.get(segment);
+			if (!entry) return {
+				ok: false,
+				error: {
+					code: 409,
+					reason: "MISSING_PARENT",
+					message: `Missing key '${segment}'`
+				}
+			};
+			current = entry.node;
+			continue;
 		}
-		const headStep = applyIntentsToCrdt(shadowBase, options.head, intents, options.newDot, evalTestAgainst, options.bumpCounterAbove, { strictParents: options.strictParents });
-		if (!headStep.ok) return withOpIndex(headStep, opIndex);
-		if (evalTestAgainst === "base") {
-			const shadowStep = applyIntentsToCrdt(shadowBase, shadowBase, intents, shadowDot, "base", shadowBump, { strictParents: options.strictParents });
-			if (!shadowStep.ok) return withOpIndex(shadowStep, opIndex);
-		} else shadowBase = cloneDoc(options.head);
-		return { ok: true };
-	};
-	for (let opIndex = 0; opIndex < options.patch.length; opIndex++) {
-		const op = options.patch[opIndex];
-		if (op.op === "move") {
-			const baseJson = materialize(shadowBase.root);
-			let fromValue;
-			try {
-				fromValue = structuredClone(getAtJson(baseJson, parseJsonPointer(op.from)));
-			} catch {
-				try {
-					compileJsonPatchToIntent(baseJson, [{
-						op: "remove",
-						path: op.from
-					}], { semantics: "sequential" });
-				} catch (error) {
-					return withOpIndex(toApplyError$1(error), opIndex);
+		if (current.kind === "seq") {
+			if (!ARRAY_INDEX_TOKEN_PATTERN.test(segment)) return {
+				ok: false,
+				error: {
+					code: 409,
+					reason: "INVALID_POINTER",
+					message: `Expected array index, got '${segment}'`
 				}
-				return withOpIndex(toApplyError$1(/* @__PURE__ */ new Error(`failed to resolve move source at ${op.from}`)), opIndex);
-			}
-			if (op.from === op.path) continue;
-			const removeStep = applySequentialOp({
-				op: "remove",
-				path: op.from
-			}, opIndex);
-			if (!removeStep.ok) return removeStep;
-			const addStep = applySequentialOp({
-				op: "add",
-				path: op.path,
-				value: fromValue
-			}, opIndex);
-			if (!addStep.ok) return addStep;
+			};
+			const index = Number(segment);
+			if (!Number.isSafeInteger(index)) return {
+				ok: false,
+				error: {
+					code: 409,
+					reason: "OUT_OF_BOUNDS",
+					message: `Index out of bounds at '${segment}'`
+				}
+			};
+			const elemId = rgaIdAtIndex(current, index);
+			if (elemId === void 0) return {
+				ok: false,
+				error: {
+					code: 409,
+					reason: "OUT_OF_BOUNDS",
+					message: `Index out of bounds at '${segment}'`
+				}
+			};
+			current = current.elems.get(elemId).value;
 			continue;
 		}
-		const step = applySequentialOp(op, opIndex);
-		if (!step.ok) return step;
+		return {
+			ok: false,
+			error: {
+				code: 409,
+				reason: "INVALID_TARGET",
+				message: `Cannot traverse into non-container at '${segment}'`
+			}
+		};
 	}
-	return { ok: true };
+	return {
+		ok: true,
+		node: current
+	};
 }
-function withOpIndex(error, opIndex) {
+function parseArrayIndexTokenForDoc$1(token, op, path, opIndex) {
+	if (token === "-") {
+		if (op !== "add") return {
+			ok: false,
+			code: 409,
+			reason: "INVALID_POINTER",
+			message: `'-' index is only valid for add at ${path}`,
+			path,
+			opIndex
+		};
+		return {
+			ok: true,
+			index: Number.POSITIVE_INFINITY
+		};
+	}
+	if (!ARRAY_INDEX_TOKEN_PATTERN.test(token)) return {
+		ok: false,
+		code: 409,
+		reason: "INVALID_POINTER",
+		message: `expected array index at ${path}`,
+		path,
+		opIndex
+	};
+	const index = Number(token);
+	if (!Number.isSafeInteger(index)) return {
+		ok: false,
+		code: 409,
+		reason: "OUT_OF_BOUNDS",
+		message: `array index is too large at ${path}`,
+		path,
+		opIndex
+	};
+	return {
+		ok: true,
+		index
+	};
+}
+function validateArrayIndexBounds$1(index, op, arrLength, path, opIndex) {
+	if (op === "add") {
+		if (index === Number.POSITIVE_INFINITY) return {
+			ok: true,
+			index
+		};
+		if (index > arrLength) return {
+			ok: false,
+			code: 409,
+			reason: "OUT_OF_BOUNDS",
+			message: `index out of bounds at ${path}; expected 0..${arrLength}`,
+			path,
+			opIndex
+		};
+	} else if (index >= arrLength) return {
+		ok: false,
+		code: 409,
+		reason: "OUT_OF_BOUNDS",
+		message: `index out of bounds at ${path}; expected 0..${Math.max(arrLength - 1, 0)}`,
+		path,
+		opIndex
+	};
+	return {
+		ok: true,
+		index
+	};
+}
+function withOpIndex$1(error, opIndex) {
 	if (error.opIndex !== void 0) return error;
 	return {
 		...error,
@@ -3129,10 +3528,13 @@ function tryApplyPatchInPlace(state, patch, options = {}) {
 * Does not mutate caller-provided values.
 */
 function validateJsonPatch(base, patch, options = {}) {
-	const result = tryApplyPatch(createState(base, {
+	const result = tryApplyPatchInPlace(createState(base, {
 		actor: "__validate__",
 		jsonValidation: options.jsonValidation
-	}), patch, options);
+	}), patch, {
+		...options,
+		atomic: false
+	});
 	if (!result.ok) return {
 		ok: false,
 		error: result.error
@@ -3181,16 +3583,11 @@ function toApplyPatchOptionsForActor(options) {
 		} : void 0
 	};
 }
-function applyPatchInternal(state, patch, options, execution) {
+function applyPatchInternal(state, patch, options, _execution) {
 	const preparedPatch = preparePatchPayloadsSafe(patch, options.jsonValidation ?? "none");
 	if (!preparedPatch.ok) return preparedPatch;
 	const runtimePatch = preparedPatch.patch;
 	if ((options.semantics ?? "sequential") === "sequential") {
-		if (!options.base && execution === "batch") {
-			const compiled = compilePreparedIntents(materialize(state.doc.root), runtimePatch, "sequential");
-			if (!compiled.ok) return compiled;
-			return applyIntentsToCrdt(state.doc, state.doc, compiled.intents, () => state.clock.next(), options.testAgainst ?? "head", (ctr) => bumpClockCounter(state, ctr), { strictParents: options.strictParents });
-		}
 		const explicitBaseState = options.base ? {
 			doc: cloneDoc(options.base.doc),
 			clock: createClock("__base__", 0)
@@ -3244,10 +3641,10 @@ function applySinglePatchOpSequentialStep(state, baseDoc, op, options, explicitB
 	const compiled = compilePreparedSingleIntentFromDoc(baseDoc, op, session.pointerCache, opIndex);
 	if (!compiled.ok) return compiled;
 	const headStep = applyIntentsToCrdt(baseDoc, state.doc, compiled.intents, () => state.clock.next(), options.testAgainst ?? "head", (ctr) => bumpClockCounter(state, ctr), { strictParents: options.strictParents });
-	if (!headStep.ok) return headStep;
+	if (!headStep.ok) return withOpIndex(headStep, opIndex);
 	if (explicitBaseState && op.op !== "test") {
 		const shadowStep = applyIntentsToCrdt(explicitBaseState.doc, explicitBaseState.doc, compiled.intents, () => explicitBaseState.clock.next(), "base", (ctr) => bumpClockCounter(explicitBaseState, ctr), { strictParents: options.strictParents });
-		if (!shadowStep.ok) return shadowStep;
+		if (!shadowStep.ok) return withOpIndex(shadowStep, opIndex);
 	}
 	return { ok: true };
 }
@@ -3255,7 +3652,7 @@ function applySinglePatchOpExplicitShadowStep(explicitBaseState, op, options, op
 	const compiled = compilePreparedSingleIntentFromDoc(explicitBaseState.doc, op, session.pointerCache, opIndex);
 	if (!compiled.ok) return compiled;
 	const shadowStep = applyIntentsToCrdt(explicitBaseState.doc, explicitBaseState.doc, compiled.intents, () => explicitBaseState.clock.next(), "base", (ctr) => bumpClockCounter(explicitBaseState, ctr), { strictParents: options.strictParents });
-	if (!shadowStep.ok) return shadowStep;
+	if (!shadowStep.ok) return withOpIndex(shadowStep, opIndex);
 	return { ok: true };
 }
 function resolveValueAtPointerInDoc(doc, pointer, opIndex, pointerCache) {
@@ -3618,6 +4015,13 @@ function toApplyError(error) {
 		message: error instanceof Error ? error.message : "failed to compile patch"
 	};
 }
+function withOpIndex(error, opIndex) {
+	if (error.opIndex !== void 0) return error;
+	return {
+		...error,
+		opIndex
+	};
+}
 function toPointerParseApplyError(error, pointer, opIndex) {
 	return {
 		ok: false,
@@ -3991,20 +4395,23 @@ function mergeDoc(a, b, options = {}) {
 /** Non-throwing `mergeDoc` variant with structured conflict details. */
 function tryMergeDoc(a, b, options = {}) {
 	try {
-		const mismatchPath = options.requireSharedOrigin ?? true ? findSeqLineageMismatch(a.root, b.root, []) : null;
-		if (mismatchPath !== null) return {
-			ok: false,
-			error: {
+		const config = { unrelatedArrays: resolveUnrelatedArraysStrategy(options) };
+		if (config.unrelatedArrays === "reject") {
+			const mismatchPath = findSeqLineageMismatch(a.root, b.root, []);
+			if (mismatchPath !== null) return {
 				ok: false,
-				code: 409,
-				reason: "LINEAGE_MISMATCH",
-				message: `merge requires shared array origin at ${mismatchPath}`,
-				path: mismatchPath
-			}
-		};
+				error: {
+					ok: false,
+					code: 409,
+					reason: "LINEAGE_MISMATCH",
+					message: `merge requires shared array origin at ${mismatchPath}`,
+					path: mismatchPath
+				}
+			};
+		}
 		return {
 			ok: true,
-			doc: { root: mergeNode(a.root, b.root) }
+			doc: mergeDocRoot(a.root, b.root, config).doc
 		};
 	} catch (error) {
 		if (error instanceof SharedElementMetadataMismatchError) return {
@@ -4030,7 +4437,7 @@ function tryMergeDoc(a, b, options = {}) {
 * The merged clock keeps a stable actor identity:
 * - defaults to the actor from the first argument (`a`)
 * - can be overridden via `options.actor`
-* - optional `options.requireSharedOrigin` controls merge lineage checks
+* - optional `options.unrelatedArrays` controls the merge strategy for non-overlapping sequences
 *
 * The merged counter is lifted to the highest counter already observed for
 * that actor across both input clocks and the merged document dots.
@@ -4042,17 +4449,51 @@ function mergeState(a, b, options = {}) {
 }
 /** Non-throwing `mergeState` variant with structured conflict details. */
 function tryMergeState(a, b, options = {}) {
-	const mergedDoc = tryMergeDoc(a.doc, b.doc, { requireSharedOrigin: options.requireSharedOrigin });
-	if (!mergedDoc.ok) return mergedDoc;
-	const doc = mergedDoc.doc;
-	const actor = options.actor ?? a.clock.actor;
-	return {
-		ok: true,
-		state: {
-			doc,
-			clock: createClock(actor, maxObservedCtrForActor(doc, actor, a, b))
+	try {
+		const actor = options.actor ?? a.clock.actor;
+		const config = {
+			actor,
+			unrelatedArrays: resolveUnrelatedArraysStrategy(options)
+		};
+		if (config.unrelatedArrays === "reject") {
+			const mismatchPath = findSeqLineageMismatch(a.doc.root, b.doc.root, []);
+			if (mismatchPath !== null) return {
+				ok: false,
+				error: {
+					ok: false,
+					code: 409,
+					reason: "LINEAGE_MISMATCH",
+					message: `merge requires shared array origin at ${mismatchPath}`,
+					path: mismatchPath
+				}
+			};
 		}
-	};
+		const merged = mergeDocRoot(a.doc.root, b.doc.root, config);
+		const ctr = maxObservedCtrForActor(merged.maxObservedCtr, actor, a, b);
+		return {
+			ok: true,
+			state: {
+				doc: merged.doc,
+				clock: createClock(actor, ctr)
+			}
+		};
+	} catch (error) {
+		if (error instanceof SharedElementMetadataMismatchError) return {
+			ok: false,
+			error: {
+				ok: false,
+				code: 409,
+				reason: "LINEAGE_MISMATCH",
+				message: error.message,
+				path: error.path
+			}
+		};
+		if (error instanceof TraversalDepthError) return {
+			ok: false,
+			error: toDepthApplyError(error)
+		};
+		throw error;
+	}
 }
 function findSeqLineageMismatch(a, b, path) {
 	const stack = [{
@@ -4095,99 +4536,166 @@ function findSeqLineageMismatch(a, b, path) {
 	}
 	return null;
 }
-function maxObservedCtrForActor(doc, actor, a, b) {
-	let best = observedVersionVector(doc)[actor] ?? 0;
+function mergeDocRoot(a, b, config) {
+	const merged = mergeNodeAtDepth(a, b, 0, [], config);
+	return {
+		doc: { root: merged.node },
+		maxObservedCtr: merged.maxObservedCtr
+	};
+}
+function resolveUnrelatedArraysStrategy(options) {
+	if (options.unrelatedArrays !== void 0) return options.unrelatedArrays;
+	if (options.requireSharedOrigin === false) return "unsafe-union";
+	return "reject";
+}
+function maxObservedCtrForActor(docObservedCtr, actor, a, b) {
+	let best = docObservedCtr;
 	if (a.clock.actor === actor && a.clock.ctr > best) best = a.clock.ctr;
 	if (b.clock.actor === actor && b.clock.ctr > best) best = b.clock.ctr;
 	return best;
 }
 function repDot(node) {
-	switch (node.kind) {
-		case "lww": return node.dot;
-		case "obj": {
-			let best = {
-				actor: "",
-				ctr: 0
-			};
-			for (const entry of node.entries.values()) if (compareDot(entry.dot, best) > 0) best = entry.dot;
-			for (const d of node.tombstone.values()) if (compareDot(d, best) > 0) best = d;
-			return best;
-		}
-		case "seq": {
-			let best = {
-				actor: "",
-				ctr: 0
-			};
-			for (const e of node.elems.values()) if (compareDot(e.insDot, best) > 0) best = e.insDot;
-			return best;
+	let best = {
+		actor: "",
+		ctr: 0
+	};
+	const stack = [{
+		node,
+		depth: 0
+	}];
+	while (stack.length > 0) {
+		const frame = stack.pop();
+		assertTraversalDepth(frame.depth);
+		switch (frame.node.kind) {
+			case "lww":
+				if (compareDot(frame.node.dot, best) > 0) best = frame.node.dot;
+				break;
+			case "obj":
+				for (const entry of frame.node.entries.values()) {
+					if (compareDot(entry.dot, best) > 0) best = entry.dot;
+					stack.push({
+						node: entry.node,
+						depth: frame.depth + 1
+					});
+				}
+				for (const tombstone of frame.node.tombstone.values()) if (compareDot(tombstone, best) > 0) best = tombstone;
+				break;
+			case "seq":
+				for (const elem of frame.node.elems.values()) {
+					if (compareDot(elem.insDot, best) > 0) best = elem.insDot;
+					if (elem.delDot && compareDot(elem.delDot, best) > 0) best = elem.delDot;
+					stack.push({
+						node: elem.value,
+						depth: frame.depth + 1
+					});
+				}
+				break;
 		}
 	}
+	return best;
 }
-function mergeNode(a, b) {
-	return mergeNodeAtDepth(a, b, 0, []);
-}
-function mergeNodeAtDepth(a, b, depth, path) {
+function mergeNodeAtDepth(a, b, depth, path, config) {
 	assertTraversalDepth(depth);
-	if (a.kind === "lww" && b.kind === "lww") return mergeLww(a, b);
-	if (a.kind === "obj" && b.kind === "obj") return mergeObj(a, b, depth + 1, path);
-	if (a.kind === "seq" && b.kind === "seq") return mergeSeq(a, b, depth + 1, path);
-	if (compareDot(repDot(a), repDot(b)) >= 0) return cloneNodeShallow(a, depth + 1);
-	return cloneNodeShallow(b, depth + 1);
+	if (a.kind === "lww" && b.kind === "lww") return mergeLww(a, b, config.actor);
+	if (a.kind === "obj" && b.kind === "obj") return mergeObj(a, b, depth + 1, path, config);
+	if (a.kind === "seq" && b.kind === "seq") return mergeSeq(a, b, depth + 1, path, config);
+	if (compareDot(repDot(a), repDot(b)) >= 0) return cloneNodeShallow(a, depth + 1, config.actor);
+	return cloneNodeShallow(b, depth + 1, config.actor);
 }
-function mergeLww(a, b) {
+function mergeLww(a, b, actor) {
 	if (compareDot(a.dot, b.dot) >= 0) return {
-		kind: "lww",
-		value: structuredClone(a.value),
-		dot: { ...a.dot }
+		node: {
+			kind: "lww",
+			value: structuredClone(a.value),
+			dot: { ...a.dot }
+		},
+		maxObservedCtr: maxObservedCtrForDot(a.dot, actor)
 	};
 	return {
-		kind: "lww",
-		value: structuredClone(b.value),
-		dot: { ...b.dot }
+		node: {
+			kind: "lww",
+			value: structuredClone(b.value),
+			dot: { ...b.dot }
+		},
+		maxObservedCtr: maxObservedCtrForDot(b.dot, actor)
 	};
 }
-function mergeObj(a, b, depth, path) {
+function mergeObj(a, b, depth, path, config) {
 	assertTraversalDepth(depth);
 	const entries = /* @__PURE__ */ new Map();
 	const tombstone = /* @__PURE__ */ new Map();
+	let maxObservedCtr = 0;
 	const allTombKeys = new Set([...a.tombstone.keys(), ...b.tombstone.keys()]);
 	for (const key of allTombKeys) {
 		const da = a.tombstone.get(key);
 		const db = b.tombstone.get(key);
-		if (da && db) tombstone.set(key, compareDot(da, db) >= 0 ? { ...da } : { ...db });
-		else if (da) tombstone.set(key, { ...da });
-		else tombstone.set(key, { ...db });
+		if (da && db) {
+			const mergedDot = compareDot(da, db) >= 0 ? { ...da } : { ...db };
+			tombstone.set(key, mergedDot);
+			maxObservedCtr = Math.max(maxObservedCtr, maxObservedCtrForDot(mergedDot, config.actor));
+		} else if (da) {
+			tombstone.set(key, { ...da });
+			maxObservedCtr = Math.max(maxObservedCtr, maxObservedCtrForDot(da, config.actor));
+		} else {
+			tombstone.set(key, { ...db });
+			maxObservedCtr = Math.max(maxObservedCtr, maxObservedCtrForDot(db, config.actor));
+		}
 	}
 	const allKeys = new Set([...a.entries.keys(), ...b.entries.keys()]);
 	for (const key of allKeys) {
 		const ea = a.entries.get(key);
 		const eb = b.entries.get(key);
 		let merged;
-		if (ea && eb) merged = {
-			node: mergeNodeAtDepth(ea.node, eb.node, depth + 1, [...path, key]),
-			dot: compareDot(ea.dot, eb.dot) >= 0 ? { ...ea.dot } : { ...eb.dot }
-		};
-		else if (ea) merged = {
-			node: cloneNodeShallow(ea.node, depth + 1),
-			dot: { ...ea.dot }
-		};
-		else merged = {
-			node: cloneNodeShallow(eb.node, depth + 1),
-			dot: { ...eb.dot }
-		};
+		let mergedNodeMaxObservedCtr = 0;
+		if (ea && eb) {
+			const mergedNode = mergeNodeAtDepth(ea.node, eb.node, depth + 1, [...path, key], config);
+			const dot = compareDot(ea.dot, eb.dot) >= 0 ? { ...ea.dot } : { ...eb.dot };
+			merged = {
+				node: mergedNode.node,
+				dot
+			};
+			mergedNodeMaxObservedCtr = mergedNode.maxObservedCtr;
+		} else if (ea) {
+			const cloned = cloneNodeShallow(ea.node, depth + 1, config.actor);
+			merged = {
+				node: cloned.node,
+				dot: { ...ea.dot }
+			};
+			mergedNodeMaxObservedCtr = cloned.maxObservedCtr;
+		} else {
+			const cloned = cloneNodeShallow(eb.node, depth + 1, config.actor);
+			merged = {
+				node: cloned.node,
+				dot: { ...eb.dot }
+			};
+			mergedNodeMaxObservedCtr = cloned.maxObservedCtr;
+		}
 		const td = tombstone.get(key);
 		if (td && compareDot(td, merged.dot) >= 0) continue;
 		entries.set(key, merged);
+		maxObservedCtr = Math.max(maxObservedCtr, mergedNodeMaxObservedCtr, maxObservedCtrForDot(merged.dot, config.actor));
 	}
 	return {
-		kind: "obj",
-		entries,
-		tombstone
+		node: {
+			kind: "obj",
+			entries,
+			tombstone
+		},
+		maxObservedCtr
 	};
 }
-function mergeSeq(a, b, depth, path) {
+function mergeSeq(a, b, depth, path, config) {
 	assertTraversalDepth(depth);
+	if (config.unrelatedArrays === "atomic-replace" && a.elems.size > 0 && b.elems.size > 0) {
+		let shared = false;
+		for (const id of a.elems.keys()) if (b.elems.has(id)) {
+			shared = true;
+			break;
+		}
+		if (!shared) return cloneNodeShallow(compareDot(repDot(a), repDot(b)) >= 0 ? a : b, depth, config.actor);
+	}
 	const elems = /* @__PURE__ */ new Map();
+	let maxObservedCtr = 0;
 	const allIds = new Set([...a.elems.keys(), ...b.elems.keys()]);
 	for (const id of allIds) {
 		const ea = a.elems.get(id);
@@ -4195,35 +4703,51 @@ function mergeSeq(a, b, depth, path) {
 		if (ea && eb) {
 			if (ea.prev !== eb.prev) throw new SharedElementMetadataMismatchError(stringifyJsonPointer(path), id, "prev");
 			if (!sameDot(ea.insDot, eb.insDot)) throw new SharedElementMetadataMismatchError(stringifyJsonPointer(path), id, "insDot");
-			const mergedValue = mergeNodeAtDepth(ea.value, eb.value, depth + 1, [...path, id]);
+			const mergedValue = mergeNodeAtDepth(ea.value, eb.value, depth + 1, [...path, id], config);
+			const mergedDeleteDot = mergeDeleteDot(ea.delDot, eb.delDot);
 			elems.set(id, {
 				id,
 				prev: ea.prev,
 				tombstone: ea.tombstone || eb.tombstone,
-				delDot: mergeDeleteDot(ea.delDot, eb.delDot),
-				value: mergedValue,
+				delDot: mergedDeleteDot,
+				value: mergedValue.node,
 				insDot: { ...ea.insDot }
 			});
-		} else if (ea) elems.set(id, cloneElem(ea, depth + 1));
-		else elems.set(id, cloneElem(eb, depth + 1));
+			maxObservedCtr = Math.max(maxObservedCtr, mergedValue.maxObservedCtr, maxObservedCtrForDot(ea.insDot, config.actor), maxObservedCtrForDot(mergedDeleteDot, config.actor));
+		} else if (ea) {
+			const cloned = cloneElem(ea, depth + 1, config.actor);
+			elems.set(id, cloned.elem);
+			maxObservedCtr = Math.max(maxObservedCtr, cloned.maxObservedCtr);
+		} else {
+			const cloned = cloneElem(eb, depth + 1, config.actor);
+			elems.set(id, cloned.elem);
+			maxObservedCtr = Math.max(maxObservedCtr, cloned.maxObservedCtr);
+		}
 	}
 	return {
-		kind: "seq",
-		elems
+		node: {
+			kind: "seq",
+			elems
+		},
+		maxObservedCtr
 	};
 }
 function sameDot(a, b) {
 	return a.actor === b.actor && a.ctr === b.ctr;
 }
-function cloneElem(e, depth) {
+function cloneElem(e, depth, actor) {
 	assertTraversalDepth(depth);
+	const value = cloneNodeShallow(e.value, depth + 1, actor);
 	return {
-		id: e.id,
-		prev: e.prev,
-		tombstone: e.tombstone,
-		delDot: e.delDot ? { ...e.delDot } : void 0,
-		value: cloneNodeShallow(e.value, depth + 1),
-		insDot: { ...e.insDot }
+		elem: {
+			id: e.id,
+			prev: e.prev,
+			tombstone: e.tombstone,
+			delDot: e.delDot ? { ...e.delDot } : void 0,
+			value: value.node,
+			insDot: { ...e.insDot }
+		},
+		maxObservedCtr: Math.max(value.maxObservedCtr, maxObservedCtrForDot(e.insDot, actor), maxObservedCtrForDot(e.delDot, actor))
 	};
 }
 function mergeDeleteDot(a, b) {
@@ -4231,38 +4755,64 @@ function mergeDeleteDot(a, b) {
 	if (a) return { ...a };
 	if (b) return { ...b };
 }
-function cloneNodeShallow(node, depth) {
+function cloneNodeShallow(node, depth, actor) {
 	assertTraversalDepth(depth);
 	switch (node.kind) {
 		case "lww": return {
-			kind: "lww",
-			value: structuredClone(node.value),
-			dot: { ...node.dot }
+			node: {
+				kind: "lww",
+				value: structuredClone(node.value),
+				dot: { ...node.dot }
+			},
+			maxObservedCtr: maxObservedCtrForDot(node.dot, actor)
 		};
 		case "obj": {
 			const entries = /* @__PURE__ */ new Map();
-			for (const [k, v] of node.entries) entries.set(k, {
-				node: cloneNodeShallow(v.node, depth + 1),
-				dot: { ...v.dot }
-			});
+			let maxObservedCtr = 0;
+			for (const [k, v] of node.entries) {
+				const cloned = cloneNodeShallow(v.node, depth + 1, actor);
+				entries.set(k, {
+					node: cloned.node,
+					dot: { ...v.dot }
+				});
+				maxObservedCtr = Math.max(maxObservedCtr, cloned.maxObservedCtr, maxObservedCtrForDot(v.dot, actor));
+			}
 			const tombstone = /* @__PURE__ */ new Map();
-			for (const [k, d] of node.tombstone) tombstone.set(k, { ...d });
+			for (const [k, d] of node.tombstone) {
+				tombstone.set(k, { ...d });
+				maxObservedCtr = Math.max(maxObservedCtr, maxObservedCtrForDot(d, actor));
+			}
 			return {
-				kind: "obj",
-				entries,
-				tombstone
+				node: {
+					kind: "obj",
+					entries,
+					tombstone
+				},
+				maxObservedCtr
 			};
 		}
 		case "seq": {
 			const elems = /* @__PURE__ */ new Map();
-			for (const [id, e] of node.elems) elems.set(id, cloneElem(e, depth + 1));
+			let maxObservedCtr = 0;
+			for (const [id, e] of node.elems) {
+				const cloned = cloneElem(e, depth + 1, actor);
+				elems.set(id, cloned.elem);
+				maxObservedCtr = Math.max(maxObservedCtr, cloned.maxObservedCtr);
+			}
 			return {
-				kind: "seq",
-				elems
+				node: {
+					kind: "seq",
+					elems
+				},
+				maxObservedCtr
 			};
 		}
 	}
 }
+function maxObservedCtrForDot(dot, actor) {
+	if (!dot || !actor || dot.actor !== actor) return 0;
+	return dot.ctr;
+}
 
 //#endregion
 //#region src/compact.ts