@unbrained/pm-cli 2026.5.18 → 2026.5.24

package/dist/core/fs/path-utils.d.ts

@@ -0,0 +1 @@
+export declare function isPathWithinDirectory(directory: string, targetPath: string): boolean;

package/dist/core/fs/path-utils.js

@@ -0,0 +1,12 @@
+
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="e8f4f66b-8f68-5a07-8905-ff2602564716")}catch(e){}}();
+import path from "path";
+export function isPathWithinDirectory(directory, targetPath) {
+    const relative = path.relative(directory, targetPath);
+    if (relative.length === 0) {
+        return true;
+    }
+    return !relative.startsWith("..") && !path.isAbsolute(relative);
+}
+//# sourceMappingURL=path-utils.js.map
+//# debugId=e8f4f66b-8f68-5a07-8905-ff2602564716

package/dist/core/fs/path-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-utils.js","sources":["core/fs/path-utils.ts"],"sourceRoot":"/","sourcesContent":["import path from \"path\";\n\nexport function isPathWithinDirectory(directory: string, targetPath: string): boolean {\n  const relative = path.relative(directory, targetPath);\n  if (relative.length === 0) {\n    return true;\n  }\n  return !relative.startsWith(\"..\") && !path.isAbsolute(relative);\n}\n"],"names":[],"mappings":";;AAAA,OAAO,IAAI,MAAM,MAAM,CAAC;AAExB,MAAM,UAAU,qBAAqB,CAAC,SAAiB,EAAE,UAAkB;IACzE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IACtD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;AAClE,CAAC","debugId":"e8f4f66b-8f68-5a07-8905-ff2602564716"}

package/dist/core/history/drift-scan.d.ts

@@ -0,0 +1,11 @@
+import type { ItemMetadata } from "../../types/index.js";
+export interface DriftScanResult {
+    missingStreams: string[];
+    unreadableStreams: string[];
+    hashMismatches: string[];
+    chainMismatches: string[];
+    driftedItems: string[];
+}
+export declare function scanHistoryDrift(pmRoot: string, items: Array<ItemMetadata & {
+    body: string;
+}>): Promise<DriftScanResult>;

package/dist/core/history/drift-scan.js

@@ -0,0 +1,67 @@
+
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="ac6b8edd-33a1-58cc-aaa7-1846bde3e340")}catch(e){}}();
+import fs from "fs/promises";
+import { getHistoryPath } from "../store/paths.js";
+import { hashDocument } from "./history.js";
+import { verifyHistoryChain } from "./replay.js";
+export async function scanHistoryDrift(pmRoot, items) {
+    const missingStreams = [];
+    const unreadableStreams = [];
+    const hashMismatches = [];
+    const chainMismatches = [];
+    for (const item of items) {
+        const historyPath = getHistoryPath(pmRoot, item.id);
+        let latestAfterHash = null;
+        try {
+            const raw = await fs.readFile(historyPath, "utf8");
+            if (raw.trim().length === 0) {
+                missingStreams.push(item.id);
+                continue;
+            }
+            const entries = [];
+            for (const line of raw.split(/\r?\n/)) {
+                const trimmed = line.trim();
+                if (trimmed.length === 0) {
+                    continue;
+                }
+                const parsed = JSON.parse(trimmed);
+                if (typeof parsed.after_hash !== "string" || parsed.after_hash.trim().length === 0) {
+                    throw new Error("missing after_hash");
+                }
+                entries.push(parsed);
+                latestAfterHash = parsed.after_hash;
+            }
+            const chainVerification = verifyHistoryChain(entries);
+            if (!chainVerification.ok) {
+                chainMismatches.push(item.id);
+            }
+        }
+        catch (error) {
+            if (typeof error === "object" && error !== null && "code" in error && error.code === "ENOENT") {
+                missingStreams.push(item.id);
+            }
+            else {
+                unreadableStreams.push(item.id);
+            }
+            continue;
+        }
+        /* c8 ignore start -- defensive guard for future history schema changes. */
+        if (!latestAfterHash) {
+            missingStreams.push(item.id);
+            continue;
+        }
+        /* c8 ignore stop */
+        const { body, ...frontMatter } = item;
+        const currentHash = hashDocument({
+            metadata: frontMatter,
+            body,
+        });
+        if (currentHash !== latestAfterHash) {
+            hashMismatches.push(item.id);
+        }
+    }
+    const driftedItems = [...new Set([...missingStreams, ...unreadableStreams, ...hashMismatches, ...chainMismatches])].sort((a, b) => a.localeCompare(b));
+    return { missingStreams, unreadableStreams, hashMismatches, chainMismatches, driftedItems };
+}
+//# sourceMappingURL=drift-scan.js.map
+//# debugId=ac6b8edd-33a1-58cc-aaa7-1846bde3e340

package/dist/core/history/drift-scan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drift-scan.js","sources":["core/history/drift-scan.ts"],"sourceRoot":"/","sourcesContent":["import fs from \"fs/promises\";\nimport { getHistoryPath } from \"../store/paths.js\";\nimport { hashDocument } from \"./history.js\";\nimport { verifyHistoryChain } from \"./replay.js\";\nimport type { HistoryEntry, ItemMetadata } from \"../../types/index.js\";\n\nexport interface DriftScanResult {\n  missingStreams: string[];\n  unreadableStreams: string[];\n  hashMismatches: string[];\n  chainMismatches: string[];\n  driftedItems: string[];\n}\n\nexport async function scanHistoryDrift(\n  pmRoot: string,\n  items: Array<ItemMetadata & { body: string }>,\n): Promise<DriftScanResult> {\n  const missingStreams: string[] = [];\n  const unreadableStreams: string[] = [];\n  const hashMismatches: string[] = [];\n  const chainMismatches: string[] = [];\n\n  for (const item of items) {\n    const historyPath = getHistoryPath(pmRoot, item.id);\n    let latestAfterHash: string | null = null;\n    try {\n      const raw = await fs.readFile(historyPath, \"utf8\");\n      if (raw.trim().length === 0) {\n        missingStreams.push(item.id);\n        continue;\n      }\n      const entries: HistoryEntry[] = [];\n      for (const line of raw.split(/\\r?\\n/)) {\n        const trimmed = line.trim();\n        if (trimmed.length === 0) {\n          continue;\n        }\n        const parsed = JSON.parse(trimmed) as HistoryEntry;\n        if (typeof parsed.after_hash !== \"string\" || parsed.after_hash.trim().length === 0) {\n          throw new Error(\"missing after_hash\");\n        }\n        entries.push(parsed);\n        latestAfterHash = parsed.after_hash;\n      }\n      const chainVerification = verifyHistoryChain(entries);\n      if (!chainVerification.ok) {\n        chainMismatches.push(item.id);\n      }\n    } catch (error: unknown) {\n      if (typeof error === \"object\" && error !== null && \"code\" in error && (error as { code?: string }).code === \"ENOENT\") {\n        missingStreams.push(item.id);\n      } else {\n        unreadableStreams.push(item.id);\n      }\n      continue;\n    }\n    /* c8 ignore start -- defensive guard for future history schema changes. */\n    if (!latestAfterHash) {\n      missingStreams.push(item.id);\n      continue;\n    }\n    /* c8 ignore stop */\n    const { body, ...frontMatter } = item;\n    const currentHash = hashDocument({\n      metadata: frontMatter as ItemMetadata,\n      body,\n    });\n    if (currentHash !== latestAfterHash) {\n      hashMismatches.push(item.id);\n    }\n  }\n\n  const driftedItems = [...new Set([...missingStreams, ...unreadableStreams, ...hashMismatches, ...chainMismatches])].sort((a, b) =>\n    a.localeCompare(b),\n  );\n  return { missingStreams, unreadableStreams, hashMismatches, chainMismatches, driftedItems };\n}\n"],"names":[],"mappings":";;AAAA,OAAO,EAAE,MAAM,aAAa,CAAC;AAC7B,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAWjD,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,MAAc,EACd,KAA6C;IAE7C,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,iBAAiB,GAAa,EAAE,CAAC;IACvC,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,eAAe,GAAa,EAAE,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACpD,IAAI,eAAe,GAAkB,IAAI,CAAC;QAC1C,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YACnD,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC5B,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7B,SAAS;YACX,CAAC;YACD,MAAM,OAAO,GAAmB,EAAE,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC5B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACzB,SAAS;gBACX,CAAC;gBACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAiB,CAAC;gBACnD,IAAI,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACnF,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;gBACxC,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;YACtC,CAAC;YACD,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;YACtD,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,CAAC;gBAC1B,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI,KAAK,IAAK,KAA2B,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACrH,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,SAAS;QACX,CAAC;QACD,2EAA2E;QAC3E,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QACD,oBAAoB;QACpB,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,EAAE,GAAG,IAAI,CAAC;QACtC,MAAM,WAAW,GAAG,YAAY,CAAC;YAC/B,QAAQ,EAAE,WAA2B;YACrC,IAAI;SACL,CAAC,CAAC;QACH,IAAI,WAAW,KAAK,eAAe,EAAE,CAAC;YACpC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,cAAc,EAAE,GAAG,iBAAiB,EAAE,GAAG,cAAc,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAChI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CACnB,CAAC;IACF,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,cAAc,EAAE,eAAe,EAAE,YAAY,EAAE,CAAC;AAC9F,CAAC","debugId":"ac6b8edd-33a1-58cc-aaa7-1846bde3e340"}

package/dist/core/history/replay.d.ts

@@ -0,0 +1,82 @@
+import type { HistoryEntry, HistoryPatchOp, ItemDocument } from "../../types/index.js";
+/**
+ * Shared history replay/patch mechanics single-sourced for the history, restore,
+ * history-redact, and history-repair commands plus the health/validate drift checks.
+ *
+ * Each command keeps its own thin error-formatting wrapper so the exact CLI error
+ * contracts (restore's rich patch-failure context, redact's op tag, history's
+ * generic message) are preserved; only the underlying replay/patch logic is shared.
+ */
+export interface ReplayDocument {
+    metadata: Record<string, unknown>;
+    body: string;
+}
+export declare const EMPTY_REPLAY_DOCUMENT: ReplayDocument;
+export declare function cloneEmptyReplayDocument(): ReplayDocument;
+export declare function replayHash(document: ReplayDocument): string;
+export declare function replayToItemDocument(document: ReplayDocument): ItemDocument;
+/**
+ * Canonicalize an item document into the ordered replay form used when comparing
+ * a replayed chain against the on-disk item (restore + history-repair reconciliation).
+ */
+export declare function toReplayDocument(document: ItemDocument): ReplayDocument;
+export declare function normalizeReplayPatchPath(path: string): string;
+export declare function normalizeReplayPatchOps(patch: HistoryPatchOp[]): HistoryPatchOp[];
+export type ReplayApplyResult = {
+    ok: true;
+    document: ReplayDocument;
+} | {
+    ok: false;
+    error: unknown;
+};
+/**
+ * Strictly apply a history patch (front_matter->metadata normalized) to a replay
+ * document. Returns a result envelope rather than throwing so each caller can
+ * format its own error contract.
+ */
+export declare function tryApplyReplayPatch(current: ReplayDocument, patch: HistoryPatchOp[]): ReplayApplyResult;
+/**
+ * Deterministically verify a history chain: each entry's before_hash must equal
+ * the prior replayed after_hash, the patch must strictly apply, and the recorded
+ * after_hash must equal the replayed result.
+ */
+export declare function verifyHistoryChain(entries: HistoryEntry[]): {
+    ok: boolean;
+    errors: string[];
+};
+export interface LenientApplyResult {
+    document: ReplayDocument;
+    convertedReplaceToAdd: number;
+    skippedOps: number;
+}
+/**
+ * Apply a legacy patch op-by-op, recovering from drift that strict replay rejects:
+ * a `replace` whose path no longer exists is retried as `add`, and any op that
+ * still cannot apply against the current replay state is skipped. The resulting
+ * document is what the repaired entry's recomputed patch should target.
+ */
+export declare function lenientApplyReplayPatch(current: ReplayDocument, patch: HistoryPatchOp[]): LenientApplyResult;
+export interface ReanchorEntryDetail {
+    index: number;
+    rehashed: boolean;
+    patch_repaired: boolean;
+    converted_replace_to_add: number;
+    skipped_ops: number;
+}
+export interface ReanchorResult {
+    entries: HistoryEntry[];
+    finalDocument: ReplayDocument;
+    entriesRehashed: number;
+    entriesPatchRepaired: number;
+    convertedReplaceToAdd: number;
+    skippedOps: number;
+    details: ReanchorEntryDetail[];
+}
+/**
+ * Re-anchor a drifted history chain: replay every entry from empty, recompute the
+ * before/after hashes, and only rewrite a patch when the original op set no longer
+ * strictly applies (legacy drift). Clean entries keep their patch verbatim so the
+ * on-disk diff stays minimal. The returned chain verifies via verifyHistoryChain.
+ */
+export declare function reanchorHistoryEntries(entries: HistoryEntry[]): ReanchorResult;
+export declare function historyEntriesToRaw(entries: HistoryEntry[]): string;

package/dist/core/history/replay.js

@@ -0,0 +1,249 @@
+
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="9f6d7165-e26e-5815-9ac5-aad4ce4d3877")}catch(e){}}();
+import jsonPatch from "fast-json-patch";
+import { FRONT_MATTER_KEY_ORDER } from "../shared/constants.js";
+import { canonicalDocument } from "../item/item-format.js";
+import { orderObject, sha256Hex, stableStringify } from "../shared/serialization.js";
+import { hashDocument } from "./history.js";
+export const EMPTY_REPLAY_DOCUMENT = {
+    metadata: {},
+    body: "",
+};
+export function cloneEmptyReplayDocument() {
+    return structuredClone(EMPTY_REPLAY_DOCUMENT);
+}
+export function replayHash(document) {
+    try {
+        return hashDocument({
+            metadata: document.metadata,
+            body: document.body,
+        });
+    }
+    catch {
+        // Legacy/malformed replay states (for example a stream whose first entry never
+        // established a full `create` document, so the canonicalizer cannot normalize it)
+        // cannot be canonically hashed. Fall back to a deterministic structural hash so
+        // re-anchor and verification stay internally consistent for these streams. Fully
+        // formed documents always take the canonical path above, so valid streams are
+        // unaffected.
+        return sha256Hex(stableStringify({ replay_fallback: true, metadata: document.metadata, body: document.body }));
+    }
+}
+export function replayToItemDocument(document) {
+    return {
+        metadata: document.metadata,
+        body: document.body,
+    };
+}
+/**
+ * Canonicalize an item document into the ordered replay form used when comparing
+ * a replayed chain against the on-disk item (restore + history-repair reconciliation).
+ */
+export function toReplayDocument(document) {
+    if (!document.metadata || Object.keys(document.metadata).length === 0) {
+        return {
+            metadata: {},
+            body: document.body ?? "",
+        };
+    }
+    const canonical = canonicalDocument(document);
+    return {
+        metadata: orderObject(canonical.metadata, FRONT_MATTER_KEY_ORDER),
+        body: canonical.body,
+    };
+}
+export function normalizeReplayPatchPath(path) {
+    if (path === "/front_matter") {
+        return "/metadata";
+    }
+    if (path.startsWith("/front_matter/")) {
+        return `/metadata/${path.slice("/front_matter/".length)}`;
+    }
+    return path;
+}
+export function normalizeReplayPatchOps(patch) {
+    return patch.map((operation) => ({
+        ...operation,
+        path: normalizeReplayPatchPath(operation.path),
+        from: operation.from ? normalizeReplayPatchPath(operation.from) : undefined,
+    }));
+}
+function isReplayDocumentShape(value) {
+    return (typeof value === "object" &&
+        value !== null &&
+        "metadata" in value &&
+        "body" in value &&
+        typeof value.body === "string" &&
+        typeof value.metadata === "object" &&
+        value.metadata !== null);
+}
+/**
+ * Strictly apply a history patch (front_matter->metadata normalized) to a replay
+ * document. Returns a result envelope rather than throwing so each caller can
+ * format its own error contract.
+ */
+export function tryApplyReplayPatch(current, patch) {
+    try {
+        const normalizedPatch = normalizeReplayPatchOps(patch);
+        const applied = jsonPatch.applyPatch(structuredClone(current), normalizedPatch, true, false).newDocument;
+        if (!isReplayDocumentShape(applied)) {
+            return { ok: false, error: new Error("history_replay_invalid_document_shape") };
+        }
+        return { ok: true, document: { metadata: applied.metadata, body: applied.body } };
+    }
+    catch (error) {
+        return { ok: false, error };
+    }
+}
+/**
+ * Deterministically verify a history chain: each entry's before_hash must equal
+ * the prior replayed after_hash, the patch must strictly apply, and the recorded
+ * after_hash must equal the replayed result.
+ */
+export function verifyHistoryChain(entries) {
+    let replay = cloneEmptyReplayDocument();
+    for (let index = 0; index < entries.length; index += 1) {
+        const entry = entries[index];
+        if (replayHash(replay) !== entry.before_hash) {
+            return {
+                ok: false,
+                errors: [`verify_failed:before_hash_mismatch:entry_${index + 1}`],
+            };
+        }
+        const applied = tryApplyReplayPatch(replay, entry.patch);
+        if (!applied.ok) {
+            return {
+                ok: false,
+                errors: [`verify_failed:patch_apply_failed:entry_${index + 1}`],
+            };
+        }
+        replay = applied.document;
+        if (replayHash(replay) !== entry.after_hash) {
+            return {
+                ok: false,
+                errors: [`verify_failed:after_hash_mismatch:entry_${index + 1}`],
+            };
+        }
+    }
+    return { ok: true, errors: [] };
+}
+function tryApplySingleOp(document, op) {
+    try {
+        const applied = jsonPatch.applyPatch(structuredClone(document), [op], true, false).newDocument;
+        return { ok: true, document: applied };
+    }
+    catch {
+        return { ok: false };
+    }
+}
+/**
+ * Apply a legacy patch op-by-op, recovering from drift that strict replay rejects:
+ * a `replace` whose path no longer exists is retried as `add`, and any op that
+ * still cannot apply against the current replay state is skipped. The resulting
+ * document is what the repaired entry's recomputed patch should target.
+ */
+export function lenientApplyReplayPatch(current, patch) {
+    let working = structuredClone(current);
+    let convertedReplaceToAdd = 0;
+    let skippedOps = 0;
+    for (const op of normalizeReplayPatchOps(patch)) {
+        const direct = tryApplySingleOp(working, op);
+        if (direct.ok) {
+            working = direct.document;
+            continue;
+        }
+        if (op.op === "replace") {
+            const asAdd = tryApplySingleOp(working, { ...op, op: "add" });
+            if (asAdd.ok) {
+                working = asAdd.document;
+                convertedReplaceToAdd += 1;
+                continue;
+            }
+        }
+        skippedOps += 1;
+    }
+    const candidate = working;
+    const document = {
+        metadata: typeof candidate.metadata === "object" && candidate.metadata !== null
+            ? candidate.metadata
+            : {},
+        body: typeof candidate.body === "string" ? candidate.body : current.body,
+    };
+    return { document, convertedReplaceToAdd, skippedOps };
+}
+/**
+ * Re-anchor a drifted history chain: replay every entry from empty, recompute the
+ * before/after hashes, and only rewrite a patch when the original op set no longer
+ * strictly applies (legacy drift). Clean entries keep their patch verbatim so the
+ * on-disk diff stays minimal. The returned chain verifies via verifyHistoryChain.
+ */
+export function reanchorHistoryEntries(entries) {
+    let replay = cloneEmptyReplayDocument();
+    const rewritten = [];
+    const details = [];
+    let entriesRehashed = 0;
+    let entriesPatchRepaired = 0;
+    let convertedReplaceToAdd = 0;
+    let skippedOps = 0;
+    for (let index = 0; index < entries.length; index += 1) {
+        const entry = entries[index];
+        const beforeHash = replayHash(replay);
+        const strict = tryApplyReplayPatch(replay, entry.patch);
+        let next;
+        let outPatch;
+        let patchRepaired = false;
+        let entryConverted = 0;
+        let entrySkipped = 0;
+        if (strict.ok) {
+            next = strict.document;
+            outPatch = entry.patch;
+        }
+        else {
+            const lenient = lenientApplyReplayPatch(replay, entry.patch);
+            next = lenient.document;
+            outPatch = jsonPatch.compare(replay, next);
+            patchRepaired = true;
+            entryConverted = lenient.convertedReplaceToAdd;
+            entrySkipped = lenient.skippedOps;
+            convertedReplaceToAdd += entryConverted;
+            skippedOps += entrySkipped;
+            entriesPatchRepaired += 1;
+        }
+        const afterHash = replayHash(next);
+        const rehashed = beforeHash !== entry.before_hash || afterHash !== entry.after_hash;
+        if (rehashed) {
+            entriesRehashed += 1;
+        }
+        rewritten.push({
+            ...entry,
+            patch: outPatch,
+            before_hash: beforeHash,
+            after_hash: afterHash,
+        });
+        details.push({
+            index: index + 1,
+            rehashed,
+            patch_repaired: patchRepaired,
+            converted_replace_to_add: entryConverted,
+            skipped_ops: entrySkipped,
+        });
+        replay = next;
+    }
+    return {
+        entries: rewritten,
+        finalDocument: replay,
+        entriesRehashed,
+        entriesPatchRepaired,
+        convertedReplaceToAdd,
+        skippedOps,
+        details,
+    };
+}
+export function historyEntriesToRaw(entries) {
+    if (entries.length === 0) {
+        return "";
+    }
+    return `${entries.map((entry) => JSON.stringify(entry)).join("\n")}\n`;
+}
+//# sourceMappingURL=replay.js.map
+//# debugId=9f6d7165-e26e-5815-9ac5-aad4ce4d3877

package/dist/core/history/replay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay.js","sources":["core/history/replay.ts"],"sourceRoot":"/","sourcesContent":["import jsonPatch from \"fast-json-patch\";\nimport { FRONT_MATTER_KEY_ORDER } from \"../shared/constants.js\";\nimport { canonicalDocument } from \"../item/item-format.js\";\nimport { orderObject, sha256Hex, stableStringify } from \"../shared/serialization.js\";\nimport { hashDocument } from \"./history.js\";\nimport type { HistoryEntry, HistoryPatchOp, ItemDocument, ItemMetadata } from \"../../types/index.js\";\n\n/**\n * Shared history replay/patch mechanics single-sourced for the history, restore,\n * history-redact, and history-repair commands plus the health/validate drift checks.\n *\n * Each command keeps its own thin error-formatting wrapper so the exact CLI error\n * contracts (restore's rich patch-failure context, redact's op tag, history's\n * generic message) are preserved; only the underlying replay/patch logic is shared.\n */\n\nexport interface ReplayDocument {\n  metadata: Record<string, unknown>;\n  body: string;\n}\n\nexport const EMPTY_REPLAY_DOCUMENT: ReplayDocument = {\n  metadata: {},\n  body: \"\",\n};\n\nexport function cloneEmptyReplayDocument(): ReplayDocument {\n  return structuredClone(EMPTY_REPLAY_DOCUMENT);\n}\n\nexport function replayHash(document: ReplayDocument): string {\n  try {\n    return hashDocument({\n      metadata: document.metadata as unknown as ItemMetadata,\n      body: document.body,\n    });\n  } catch {\n    // Legacy/malformed replay states (for example a stream whose first entry never\n    // established a full `create` document, so the canonicalizer cannot normalize it)\n    // cannot be canonically hashed. Fall back to a deterministic structural hash so\n    // re-anchor and verification stay internally consistent for these streams. Fully\n    // formed documents always take the canonical path above, so valid streams are\n    // unaffected.\n    return sha256Hex(stableStringify({ replay_fallback: true, metadata: document.metadata, body: document.body }));\n  }\n}\n\nexport function replayToItemDocument(document: ReplayDocument): ItemDocument {\n  return {\n    metadata: document.metadata as unknown as ItemMetadata,\n    body: document.body,\n  };\n}\n\n/**\n * Canonicalize an item document into the ordered replay form used when comparing\n * a replayed chain against the on-disk item (restore + history-repair reconciliation).\n */\nexport function toReplayDocument(document: ItemDocument): ReplayDocument {\n  if (!document.metadata || Object.keys(document.metadata).length === 0) {\n    return {\n      metadata: {},\n      body: document.body ?? \"\",\n    };\n  }\n  const canonical = canonicalDocument(document);\n  return {\n    metadata: orderObject(canonical.metadata as unknown as Record<string, unknown>, FRONT_MATTER_KEY_ORDER),\n    body: canonical.body,\n  };\n}\n\nexport function normalizeReplayPatchPath(path: string): string {\n  if (path === \"/front_matter\") {\n    return \"/metadata\";\n  }\n  if (path.startsWith(\"/front_matter/\")) {\n    return `/metadata/${path.slice(\"/front_matter/\".length)}`;\n  }\n  return path;\n}\n\nexport function normalizeReplayPatchOps(patch: HistoryPatchOp[]): HistoryPatchOp[] {\n  return patch.map((operation) => ({\n    ...operation,\n    path: normalizeReplayPatchPath(operation.path),\n    from: operation.from ? normalizeReplayPatchPath(operation.from) : undefined,\n  }));\n}\n\nfunction isReplayDocumentShape(value: unknown): value is { metadata: Record<string, unknown>; body: string } {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    \"metadata\" in value &&\n    \"body\" in value &&\n    typeof (value as { body: unknown }).body === \"string\" &&\n    typeof (value as { metadata: unknown }).metadata === \"object\" &&\n    (value as { metadata: unknown }).metadata !== null\n  );\n}\n\nexport type ReplayApplyResult =\n  | { ok: true; document: ReplayDocument }\n  | { ok: false; error: unknown };\n\n/**\n * Strictly apply a history patch (front_matter->metadata normalized) to a replay\n * document. Returns a result envelope rather than throwing so each caller can\n * format its own error contract.\n */\nexport function tryApplyReplayPatch(current: ReplayDocument, patch: HistoryPatchOp[]): ReplayApplyResult {\n  try {\n    const normalizedPatch = normalizeReplayPatchOps(patch);\n    const applied = jsonPatch.applyPatch(\n      structuredClone(current),\n      normalizedPatch as jsonPatch.Operation[],\n      true,\n      false,\n    ).newDocument as unknown;\n    if (!isReplayDocumentShape(applied)) {\n      return { ok: false, error: new Error(\"history_replay_invalid_document_shape\") };\n    }\n    return { ok: true, document: { metadata: applied.metadata, body: applied.body } };\n  } catch (error) {\n    return { ok: false, error };\n  }\n}\n\n/**\n * Deterministically verify a history chain: each entry's before_hash must equal\n * the prior replayed after_hash, the patch must strictly apply, and the recorded\n * after_hash must equal the replayed result.\n */\nexport function verifyHistoryChain(entries: HistoryEntry[]): { ok: boolean; errors: string[] } {\n  let replay = cloneEmptyReplayDocument();\n  for (let index = 0; index < entries.length; index += 1) {\n    const entry = entries[index];\n    if (replayHash(replay) !== entry.before_hash) {\n      return {\n        ok: false,\n        errors: [`verify_failed:before_hash_mismatch:entry_${index + 1}`],\n      };\n    }\n    const applied = tryApplyReplayPatch(replay, entry.patch);\n    if (!applied.ok) {\n      return {\n        ok: false,\n        errors: [`verify_failed:patch_apply_failed:entry_${index + 1}`],\n      };\n    }\n    replay = applied.document;\n    if (replayHash(replay) !== entry.after_hash) {\n      return {\n        ok: false,\n        errors: [`verify_failed:after_hash_mismatch:entry_${index + 1}`],\n      };\n    }\n  }\n  return { ok: true, errors: [] };\n}\n\nexport interface LenientApplyResult {\n  document: ReplayDocument;\n  convertedReplaceToAdd: number;\n  skippedOps: number;\n}\n\nfunction tryApplySingleOp(document: unknown, op: HistoryPatchOp): { ok: true; document: unknown } | { ok: false } {\n  try {\n    const applied = jsonPatch.applyPatch(\n      structuredClone(document),\n      [op as jsonPatch.Operation],\n      true,\n      false,\n    ).newDocument as unknown;\n    return { ok: true, document: applied };\n  } catch {\n    return { ok: false };\n  }\n}\n\n/**\n * Apply a legacy patch op-by-op, recovering from drift that strict replay rejects:\n * a `replace` whose path no longer exists is retried as `add`, and any op that\n * still cannot apply against the current replay state is skipped. The resulting\n * document is what the repaired entry's recomputed patch should target.\n */\nexport function lenientApplyReplayPatch(current: ReplayDocument, patch: HistoryPatchOp[]): LenientApplyResult {\n  let working: unknown = structuredClone(current);\n  let convertedReplaceToAdd = 0;\n  let skippedOps = 0;\n\n  for (const op of normalizeReplayPatchOps(patch)) {\n    const direct = tryApplySingleOp(working, op);\n    if (direct.ok) {\n      working = direct.document;\n      continue;\n    }\n    if (op.op === \"replace\") {\n      const asAdd = tryApplySingleOp(working, { ...op, op: \"add\" });\n      if (asAdd.ok) {\n        working = asAdd.document;\n        convertedReplaceToAdd += 1;\n        continue;\n      }\n    }\n    skippedOps += 1;\n  }\n\n  const candidate = working as { metadata?: unknown; body?: unknown };\n  const document: ReplayDocument = {\n    metadata:\n      typeof candidate.metadata === \"object\" && candidate.metadata !== null\n        ? (candidate.metadata as Record<string, unknown>)\n        : {},\n    body: typeof candidate.body === \"string\" ? candidate.body : current.body,\n  };\n  return { document, convertedReplaceToAdd, skippedOps };\n}\n\nexport interface ReanchorEntryDetail {\n  index: number;\n  rehashed: boolean;\n  patch_repaired: boolean;\n  converted_replace_to_add: number;\n  skipped_ops: number;\n}\n\nexport interface ReanchorResult {\n  entries: HistoryEntry[];\n  finalDocument: ReplayDocument;\n  entriesRehashed: number;\n  entriesPatchRepaired: number;\n  convertedReplaceToAdd: number;\n  skippedOps: number;\n  details: ReanchorEntryDetail[];\n}\n\n/**\n * Re-anchor a drifted history chain: replay every entry from empty, recompute the\n * before/after hashes, and only rewrite a patch when the original op set no longer\n * strictly applies (legacy drift). Clean entries keep their patch verbatim so the\n * on-disk diff stays minimal. The returned chain verifies via verifyHistoryChain.\n */\nexport function reanchorHistoryEntries(entries: HistoryEntry[]): ReanchorResult {\n  let replay = cloneEmptyReplayDocument();\n  const rewritten: HistoryEntry[] = [];\n  const details: ReanchorEntryDetail[] = [];\n  let entriesRehashed = 0;\n  let entriesPatchRepaired = 0;\n  let convertedReplaceToAdd = 0;\n  let skippedOps = 0;\n\n  for (let index = 0; index < entries.length; index += 1) {\n    const entry = entries[index];\n    const beforeHash = replayHash(replay);\n    const strict = tryApplyReplayPatch(replay, entry.patch);\n\n    let next: ReplayDocument;\n    let outPatch: HistoryPatchOp[];\n    let patchRepaired = false;\n    let entryConverted = 0;\n    let entrySkipped = 0;\n\n    if (strict.ok) {\n      next = strict.document;\n      outPatch = entry.patch;\n    } else {\n      const lenient = lenientApplyReplayPatch(replay, entry.patch);\n      next = lenient.document;\n      outPatch = jsonPatch.compare(replay, next) as HistoryPatchOp[];\n      patchRepaired = true;\n      entryConverted = lenient.convertedReplaceToAdd;\n      entrySkipped = lenient.skippedOps;\n      convertedReplaceToAdd += entryConverted;\n      skippedOps += entrySkipped;\n      entriesPatchRepaired += 1;\n    }\n\n    const afterHash = replayHash(next);\n    const rehashed = beforeHash !== entry.before_hash || afterHash !== entry.after_hash;\n    if (rehashed) {\n      entriesRehashed += 1;\n    }\n\n    rewritten.push({\n      ...entry,\n      patch: outPatch,\n      before_hash: beforeHash,\n      after_hash: afterHash,\n    });\n    details.push({\n      index: index + 1,\n      rehashed,\n      patch_repaired: patchRepaired,\n      converted_replace_to_add: entryConverted,\n      skipped_ops: entrySkipped,\n    });\n    replay = next;\n  }\n\n  return {\n    entries: rewritten,\n    finalDocument: replay,\n    entriesRehashed,\n    entriesPatchRepaired,\n    convertedReplaceToAdd,\n    skippedOps,\n    details,\n  };\n}\n\nexport function historyEntriesToRaw(entries: HistoryEntry[]): string {\n  if (entries.length === 0) {\n    return \"\";\n  }\n  return `${entries.map((entry) => JSON.stringify(entry)).join(\"\\n\")}\\n`;\n}\n"],"names":[],"mappings":";;AAAA,OAAO,SAAS,MAAM,iBAAiB,CAAC;AACxC,OAAO,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AACrF,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAiB5C,MAAM,CAAC,MAAM,qBAAqB,GAAmB;IACnD,QAAQ,EAAE,EAAE;IACZ,IAAI,EAAE,EAAE;CACT,CAAC;AAEF,MAAM,UAAU,wBAAwB;IACtC,OAAO,eAAe,CAAC,qBAAqB,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,QAAwB;IACjD,IAAI,CAAC;QACH,OAAO,YAAY,CAAC;YAClB,QAAQ,EAAE,QAAQ,CAAC,QAAmC;YACtD,IAAI,EAAE,QAAQ,CAAC,IAAI;SACpB,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,+EAA+E;QAC/E,kFAAkF;QAClF,gFAAgF;QAChF,iFAAiF;QACjF,8EAA8E;QAC9E,cAAc;QACd,OAAO,SAAS,CAAC,eAAe,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACjH,CAAC;AACH,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,QAAwB;IAC3D,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,QAAmC;QACtD,IAAI,EAAE,QAAQ,CAAC,IAAI;KACpB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAsB;IACrD,IAAI,CAAC,QAAQ,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtE,OAAO;YACL,QAAQ,EAAE,EAAE;YACZ,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,EAAE;SAC1B,CAAC;IACJ,CAAC;IACD,MAAM,SAAS,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IAC9C,OAAO;QACL,QAAQ,EAAE,WAAW,CAAC,SAAS,CAAC,QAA8C,EAAE,sBAAsB,CAAC;QACvG,IAAI,EAAE,SAAS,CAAC,IAAI;KACrB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,IAAY;IACnD,IAAI,IAAI,KAAK,eAAe,EAAE,CAAC;QAC7B,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,IAAI,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,EAAE,CAAC;QACtC,OAAO,aAAa,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;IAC5D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,KAAuB;IAC7D,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC/B,GAAG,SAAS;QACZ,IAAI,EAAE,wBAAwB,CAAC,SAAS,CAAC,IAAI,CAAC;QAC9C,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;KAC5E,CAAC,CAAC,CAAC;AACN,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAc;IAC3C,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,UAAU,IAAI,KAAK;QACnB,MAAM,IAAI,KAAK;QACf,OAAQ,KAA2B,CAAC,IAAI,KAAK,QAAQ;QACrD,OAAQ,KAA+B,CAAC,QAAQ,KAAK,QAAQ;QAC5D,KAA+B,CAAC,QAAQ,KAAK,IAAI,CACnD,CAAC;AACJ,CAAC;AAMD;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAuB,EAAE,KAAuB;IAClF,IAAI,CAAC;QACH,MAAM,eAAe,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;QACvD,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,CAClC,eAAe,CAAC,OAAO,CAAC,EACxB,eAAwC,EACxC,IAAI,EACJ,KAAK,CACN,CAAC,WAAsB,CAAC;QACzB,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,uCAAuC,CAAC,EAAE,CAAC;QAClF,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;IACpF,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC9B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAuB;IACxD,IAAI,MAAM,GAAG,wBAAwB,EAAE,CAAC;IACxC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC;YAC7C,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,CAAC,4CAA4C,KAAK,GAAG,CAAC,EAAE,CAAC;aAClE,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACzD,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;YAChB,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,CAAC,0CAA0C,KAAK,GAAG,CAAC,EAAE,CAAC;aAChE,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC;QAC1B,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;YAC5C,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,CAAC,2CAA2C,KAAK,GAAG,CAAC,EAAE,CAAC;aACjE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAClC,CAAC;AAQD,SAAS,gBAAgB,CAAC,QAAiB,EAAE,EAAkB;IAC7D,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,CAClC,eAAe,CAAC,QAAQ,CAAC,EACzB,CAAC,EAAyB,CAAC,EAC3B,IAAI,EACJ,KAAK,CACN,CAAC,WAAsB,CAAC;QACzB,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;IACvB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CAAC,OAAuB,EAAE,KAAuB;IACtF,IAAI,OAAO,GAAY,eAAe,CAAC,OAAO,CAAC,CAAC;IAChD,IAAI,qBAAqB,GAAG,CAAC,CAAC;IAC9B,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,EAAE,IAAI,uBAAuB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC7C,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;YACd,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,IAAI,EAAE,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9D,IAAI,KAAK,CAAC,EAAE,EAAE,CAAC;gBACb,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC;gBACzB,qBAAqB,IAAI,CAAC,CAAC;gBAC3B,SAAS;YACX,CAAC;QACH,CAAC;QACD,UAAU,IAAI,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,SAAS,GAAG,OAAiD,CAAC;IACpE,MAAM,QAAQ,GAAmB;QAC/B,QAAQ,EACN,OAAO,SAAS,CAAC,QAAQ,KAAK,QAAQ,IAAI,SAAS,CAAC,QAAQ,KAAK,IAAI;YACnE,CAAC,CAAE,SAAS,CAAC,QAAoC;YACjD,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,OAAO,SAAS,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI;KACzE,CAAC;IACF,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,UAAU,EAAE,CAAC;AACzD,CAAC;AAoBD;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAuB;IAC5D,IAAI,MAAM,GAAG,wBAAwB,EAAE,CAAC;IACxC,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,oBAAoB,GAAG,CAAC,CAAC;IAC7B,IAAI,qBAAqB,GAAG,CAAC,CAAC;IAC9B,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACvD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAExD,IAAI,IAAoB,CAAC;QACzB,IAAI,QAA0B,CAAC;QAC/B,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;YACd,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC;YACvB,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,uBAAuB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7D,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC;YACxB,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAqB,CAAC;YAC/D,aAAa,GAAG,IAAI,CAAC;YACrB,cAAc,GAAG,OAAO,CAAC,qBAAqB,CAAC;YAC/C,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC;YAClC,qBAAqB,IAAI,cAAc,CAAC;YACxC,UAAU,IAAI,YAAY,CAAC;YAC3B,oBAAoB,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,UAAU,KAAK,KAAK,CAAC,WAAW,IAAI,SAAS,KAAK,KAAK,CAAC,UAAU,CAAC;QACpF,IAAI,QAAQ,EAAE,CAAC;YACb,eAAe,IAAI,CAAC,CAAC;QACvB,CAAC;QAED,SAAS,CAAC,IAAI,CAAC;YACb,GAAG,KAAK;YACR,KAAK,EAAE,QAAQ;YACf,WAAW,EAAE,UAAU;YACvB,UAAU,EAAE,SAAS;SACtB,CAAC,CAAC;QACH,OAAO,CAAC,IAAI,CAAC;YACX,KAAK,EAAE,KAAK,GAAG,CAAC;YAChB,QAAQ;YACR,cAAc,EAAE,aAAa;YAC7B,wBAAwB,EAAE,cAAc;YACxC,WAAW,EAAE,YAAY;SAC1B,CAAC,CAAC;QACH,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IAED,OAAO;QACL,OAAO,EAAE,SAAS;QAClB,aAAa,EAAE,MAAM;QACrB,eAAe;QACf,oBAAoB;QACpB,qBAAqB;QACrB,UAAU;QACV,OAAO;KACR,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,OAAuB;IACzD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACzE,CAAC","debugId":"9f6d7165-e26e-5815-9ac5-aad4ce4d3877"}

package/dist/core/item/item-format.js

@@ -1,10 +1,11 @@
 
-!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="db4086f4-7818-5cc1-a6c0-67949132208c")}catch(e){}}();
-import { decode as decodeToon, encode as encodeToon } from "@toon-format/toon";
-import { CONFIDENCE_TEXT_VALUES, ISSUE_SEVERITY_VALUES, RECURRENCE_FREQUENCY_VALUES, RECURRENCE_WEEKDAY_VALUES, STATUS_VALUES, } from "../../types/index.js";
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="7ce34b61-0ca0-51e3-8969-50ee0dbe020b")}catch(e){}}();
+import { encode as encodeToon } from "@toon-format/toon";
+import { CONFIDENCE_TEXT_VALUES, ISSUE_SEVERITY_VALUES, RECURRENCE_FREQUENCY_VALUES, RECURRENCE_WEEKDAY_VALUES, STATUS_VALUES, weekdayOrderIndex, } from "../../types/index.js";
 import { coerceRuntimeFieldValue } from "../schema/runtime-field-values.js";
 import { resolveRuntimeFieldRegistry, resolveRuntimeStatusRegistry, } from "../schema/runtime-schema.js";
 import { normalizeStatusInput } from "./status.js";
+import { decodeToonItemContent } from "./toon-decode.js";
 import { EXIT_CODE, FRONT_MATTER_KEY_ORDER } from "../shared/constants.js";
 import { findFirstMergeConflictMarker } from "../shared/conflict-markers.js";
 import { PmCliError } from "../shared/errors.js";
@@ -42,9 +43,6 @@ function runtimeFieldRequiredForType(definition, typeName) {
     }
     return definition.required_types.map((value) => value.toLowerCase()).includes(typeName.trim().toLowerCase());
 }
-function weekdayOrderIndex(value) {
-    return RECURRENCE_WEEKDAY_VALUES.indexOf(value);
-}
 function validationError(message) {
     throw new PmCliError(`Invalid item front matter: ${message}`, EXIT_CODE.GENERIC_FAILURE);
 }
@@ -1059,7 +1057,12 @@ function parseJsonMarkdownItemDocument(content, runtimeContext, options = {}) {
 function parseToonItemDocument(content, runtimeContext, options = {}) {
     let parsed;
     try {
-        parsed = decodeToon(content);
+        // decodeToonItemContent transparently recovers documents that the upstream
+        // strict decoder rejects (bracketed-token-then-colon inside a quoted value;
+        // see toon-decode.ts). The recovery is lossless, so it stays silent rather
+        // than emitting a per-read warning that would perpetually flip pm health
+        // red for legacy files. The behavior is pinned by toon-decode.spec.ts.
+        parsed = decodeToonItemContent(content).value;
     }
     catch {
         validationError("TOON item document is not valid TOON");
@@ -1126,4 +1129,4 @@ export function canonicalDocument(document, options = {}) {
     };
 }
 //# sourceMappingURL=item-format.js.map
-//# debugId=db4086f4-7818-5cc1-a6c0-67949132208c
+//# debugId=7ce34b61-0ca0-51e3-8969-50ee0dbe020b