@open-everywhere/core 0.1.0

package/dist/agent/memory/dream/mode3.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mode3.d.ts","sourceRoot":"","sources":["../../../../agent/memory/dream/mode3.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAE7D,+KAA+K;AAC/K,eAAO,MAAM,eAAe,YAC1B,oBAAoB,EACpB,gBAAgB,EAChB,kBAAkB,EAClB,oBAAoB,EACpB,iBAAiB,EACjB,gCAAgC,EAChC,mCAAmC,CAC3B,CAAC;AAEX,MAAM,MAAM,aAAa,GAAG,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC;AAI7D,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,IAAI,aAAa,CAEvE;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC;AAED,MAAM,WAAW,aAAa;IAC5B,4DAA4D;IAC5D,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;IAC9B,sFAAsF;IACtF,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IACxC;8FAC0F;IAC1F,QAAQ,CAAC,WAAW,CAAC,EAAE,YAAY,CAAC;IACpC;;;OAGG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,gBAAgB,CAAC;CACrC;AAED,MAAM,MAAM,gBAAgB,GAAG,CAAC,IAAI,EAAE,SAAS,UAAU,EAAE,EAAE,IAAI,EAAE,aAAa,KAAK,cAAc,EAAE,CAAC;AAEtG,MAAM,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,UAAU,KAAK,MAAM,GAAG,SAAS,CAAC;AAEnE;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM,CAuBxE;AAqBD,yIAAyI;AACzI,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,SAAS,UAAU,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAS5F;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,SAAS,UAAU,EAAE,EAAE,IAAI,GAAE,aAAkB,GAAG,cAAc,EAAE,CAWtG;AAED,kGAAkG;AAClG,eAAO,MAAM,eAAe,MAAM,CAAC;AACnC,eAAO,MAAM,gBAAgB,MAAM,CAAC;AAEpC,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAqDD,wBAAgB,WAAW,CAAC,OAAO,EAAE,cAAc,GAAG,MAAM,CAY3D;AAED;2FAC2F;AAC3F,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI,CAOnE;AAED,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;AAEjF,MAAM,WAAW,iBAAiB;IAChC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC;CAC7E;AAED,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,eAAe,GAAG,iBAAiB,CAUrF;AAID,qJAAqJ;AACrJ,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,iBAAiB,GAAG,IAAI,CAExE;AAMD,MAAM,WAAW,kBAAmB,SAAQ,cAAc;IACxD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B;yEACqE;IACrE,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,uFAAuF;IACvF,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,QAAQ,EAAE,SAAS,kBAAkB,EAAE,CAAC;CAClD;AAED;;;GAGG;AACH,wBAAsB,gBAAgB,CACpC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,SAAS,UAAU,EAAE,EAC3B,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,IAAI,GAAE,aAAkB,GACvB,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAuB7B;AAKD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,GAAE,MAA8B,GAAG,MAAM,CAWrG"}

package/dist/agent/memory/dream/mode3.js

@@ -0,0 +1,236 @@
+// Mode 3, the weekly failure digest: it clusters the org's audited failure-shaped rows, facets the top clusters with the cheap utility model, and reports them. It edits nothing and opens nothing.
+// The narrowing layer and the facet judge are both injected, so the module edge to dream/mode3-cluster.ts stays one-way.
+/** The audit `action` values mined as a failed turn or interaction. `turn.failed` itself is a hook event rather than a durable audit row, so these are the queryable proxy. */
+export const FAILURE_ACTIONS = [
+    "surface.quiet_fail", // slack.ts: an uninvited turn's failure, suppressed on-surface
+    "turn.bare_stop", // slack.ts: turn ended with no reply/react/no_reply — a missing judgment call
+    "webhook.rejected", // webhooks/reject-audit.ts: an inbound delivery failed signature/route checks
+    "spend.cap_bypassed", // spend/bypass.ts: an admin sudo'd past a spend cap
+    "approval.failed", // approvals/flow.ts: an approved pending action's execute() threw
+    "unified.supervisor_turn_failed", // channels/unified.ts: a unified-supervisor turn threw; carries failureDiag()
+    "unified.supervisor_session_failed", // channels/unified.ts: a unified-supervisor session failed; carries failureDiag() + the OPE-573 `unresumable` label
+];
+const FAILURE_ACTION_SET = new Set(FAILURE_ACTIONS);
+export function isFailureAction(action) {
+    return FAILURE_ACTION_SET.has(action);
+}
+/**
+ * One human-readable line for a single audited failure row, grounded in each action's actual `detail` shape.
+ * It always leads with the platform: a bare Slack team id reads as Microsoft Teams to a human, so the ids never stand alone.
+ */
+export function exampleLine(row, name) {
+    const resolved = name?.(row);
+    const where = resolved
+        ? `${row.platform} ${resolved}${row.surface ? ` (${row.surface})` : ""}`
+        : `${row.platform} ${row.surface ? `${row.workspace}/${row.surface}` : row.workspace}`;
+    const d = row.detail ?? {};
+    switch (row.action) {
+        case "surface.quiet_fail":
+            return `${where}: ${String(d["event"] ?? "quiet-fail")} — ${String(d["message"] ?? "(no message)")}`;
+        case "turn.bare_stop":
+            return `${where}: turn ended with no reply, no react, and no no_reply (thread ${String(d["threadTs"] ?? "?")})`;
+        case "webhook.rejected":
+            return `${where}: hook "${String(d["hookId"] ?? "?")}" rejected (${String(d["status"] ?? "?")} — ${String(d["reason"] ?? "unknown reason")})`;
+        case "spend.cap_bypassed":
+            return `${where}: spend cap bypassed (${String(d["standing"] ?? "?")})${d["reason"] ? ` — ${String(d["reason"])}` : ""}`;
+        case "approval.failed":
+            return `${where}: "${String(d["kind"] ?? "?")}" approval execute() failed — ${String(d["error"] ?? "(no error)")}`;
+        case "unified.supervisor_turn_failed":
+        case "unified.supervisor_session_failed":
+            return `${where}: ${row.action === "unified.supervisor_turn_failed" ? "supervisor turn failed" : "supervisor session failed"} — ${String(d["message"] ?? "(no message)")}${failureDiagSuffix(d)}`;
+        default:
+            return `${where}: ${row.action}`;
+    }
+}
+// The exact key set `failureDiag()` (channels/unified.ts) is whitelisted to emit onto `detail`, mirrored here and never widened, so the line assumes no vendor or gateway shape.
+const FAILURE_DIAG_KEYS = [
+    "code",
+    "errorId",
+    "name",
+    "statusCode",
+    "generationId",
+    "gatewayName",
+    "gatewayType",
+    "upstreamType",
+    "upstreamStatusCode",
+    "upstreamMessage",
+];
+function failureDiagSuffix(d) {
+    const parts = FAILURE_DIAG_KEYS.filter((k) => d[k] !== undefined).map((k) => `${k}=${String(d[k])}`);
+    return parts.length > 0 ? ` [${parts.join(" ")}]` : "";
+}
+/** Group the failure-shaped rows by `action` in first-seen order, with no cap and no row dropped. Non-failure rows are ignored. Pure. */
+export function groupFailuresByAction(rows) {
+    const byAction = new Map();
+    for (const row of rows) {
+        if (!isFailureAction(row.action))
+            continue;
+        const list = byAction.get(row.action);
+        if (list)
+            list.push(row);
+        else
+            byAction.set(row.action, [row]);
+    }
+    return byAction;
+}
+/**
+ * Bucket the week's audit rows by `action`, keep the top `maxClusters` by count (descending,
+ * ties broken by first-seen order — stable). Non-failure rows are ignored. Pure.
+ */
+export function bucketFailures(rows, opts = {}) {
+    const maxClusters = opts.maxClusters ?? 3;
+    const maxExamples = opts.maxExamplesPerCluster ?? 3;
+    return Array.from(groupFailuresByAction(rows).entries())
+        .map(([action, entries]) => ({
+        action,
+        count: entries.length,
+        examples: entries.slice(0, maxExamples).map((row) => exampleLine(row, opts.surfaceName)),
+    }))
+        .sort((a, b) => b.count - a.count)
+        .slice(0, maxClusters);
+}
+/** Longest facet label kept. Enforced in BOTH places a facet can enter — see buildMode3Report. */
+export const FACET_LABEL_MAX = 120;
+export const FACET_SKETCH_MAX = 300;
+// The fallback facet used when no judge is registered, or when the judge abstains or throws for a cluster, so a cluster is never blank.
+const STATIC_FACET = {
+    "surface.quiet_fail": {
+        label: "Uninvited-turn failures suppressed on-surface",
+        fixSketch: "Check upstream model/gateway reliability for uninvited (name-drop) turns; consider whether that surface's retry/backoff needs tightening.",
+    },
+    "turn.bare_stop": {
+        label: "Turn ended with no reply, react, or no_reply",
+        fixSketch: "Usually a missing judgment call, not a deliberate one — review NO_REPLY/no_reply tool coverage or clarify the dispatch prompt for this case.",
+    },
+    "webhook.rejected": {
+        label: "Inbound webhook deliveries rejected",
+        fixSketch: "Check the failing hook id's HMAC secret provisioning and trusted-host allow-list.",
+    },
+    "spend.cap_bypassed": {
+        label: "Admin spend-cap bypasses",
+        fixSketch: "Review whether the surface's spend cap is sized correctly, or whether the bypass rate signals a cap that's too tight for normal usage.",
+    },
+    "approval.failed": {
+        label: "Approved actions failing at execute()",
+        fixSketch: "Inspect the failing ActionKind's execute() error — likely an external dependency hiccup (GitHub/Slack) or a stale frozen arg.",
+    },
+    "unified.supervisor_turn_failed": {
+        label: "Unified-supervisor turn failures",
+        fixSketch: "Check the example's statusCode/gatewayType/upstreamType — a gateway 4xx/5xx names the failing provider; an EmptyModelResponse has no provider to attribute and may instead need a retry/backoff tweak.",
+    },
+    "unified.supervisor_session_failed": {
+        label: "Unified-supervisor session failures",
+        fixSketch: "Same diagnostic fields as a turn failure. Nothing rotates the seat in response — read the row's `unresumable` label first: TRUE names a session the runtime can never resume (rotate the window), FALSE points at a bad delegated route or a persistently unhealthy provider.",
+    },
+};
+function staticFacet(action) {
+    return STATIC_FACET[action] ?? {
+        label: action,
+        fixSketch: "No static fix-sketch on file for this action — inspect the example occurrences directly.",
+    };
+}
+function extractJSON(text) {
+    const start = text.indexOf("{");
+    const end = text.lastIndexOf("}");
+    if (start === -1 || end <= start)
+        return null;
+    try {
+        return JSON.parse(text.slice(start, end + 1));
+    }
+    catch {
+        return null;
+    }
+}
+export function facetPrompt(cluster) {
+    return [
+        "You are triaging a week of recorded failures from an AI agent harness (not memory content — a",
+        "code-level reliability review).",
+        `Failure action: "${cluster.action}" — ${cluster.count} occurrence(s) this week.`,
+        "Example occurrences:",
+        ...cluster.examples.map((e) => `- ${e}`),
+        "",
+        "Write a short label (<=8 words) naming the failure pattern, and ONE concrete sentence",
+        "suggesting a harness/prompt/skill/config change a human could investigate or make.",
+        'Reply with STRICT JSON only, no prose: {"label": "…", "fixSketch": "…"}',
+    ].join("\n");
+}
+/** Tolerant parse of a facet completion into a FailureFacet, or null (fail quiet — the
+ *  static fallback is used instead). Clamped: label <=120 chars, fixSketch <=300 chars. */
+export function parseFailureFacet(text) {
+    const raw = extractJSON(text);
+    if (typeof raw !== "object" || raw === null)
+        return null;
+    const o = raw;
+    if (typeof o["label"] !== "string" || o["label"].trim().length === 0)
+        return null;
+    if (typeof o["fixSketch"] !== "string" || o["fixSketch"].trim().length === 0)
+        return null;
+    return { label: o["label"].trim().slice(0, FACET_LABEL_MAX), fixSketch: o["fixSketch"].trim().slice(0, FACET_SKETCH_MAX) };
+}
+export function facetJudgeFromCompletion(complete) {
+    return {
+        async facet(scope, cluster) {
+            try {
+                return parseFailureFacet(await complete(scope, facetPrompt(cluster)));
+            }
+            catch {
+                return null; // fail quiet — the static fallback facet is used instead
+            }
+        },
+    };
+}
+let registeredFacetJudge = null;
+/** Register the deployment's facet transport at boot. A later call replaces it; with none registered the report uses the static, zero-LLM facets. */
+export function registerFailureFacetJudge(judge) {
+    registeredFacetJudge = judge;
+}
+function failureFacetJudge() {
+    return registeredFacetJudge;
+}
+/**
+ * Returns null when there is nothing to say: an empty week is a no-op by design, so the schedule never posts on a quiet week.
+ * The facet judge's `scope` is the org id.
+ */
+export async function buildMode3Report(org, rows, windowStart, windowEnd, opts = {}) {
+    const clusters = (opts.cluster ?? bucketFailures)(rows, opts);
+    if (clusters.length === 0)
+        return null;
+    const judge = failureFacetJudge();
+    const shaped = [];
+    for (const c of clusters) {
+        let facet = null;
+        if (judge) {
+            try {
+                facet = await judge.facet(org, c);
+            }
+            catch {
+                facet = null; // belt-and-braces — a well-behaved judge never throws
+            }
+        }
+        const chosen = facet ?? staticFacet(c.action);
+        // Clamp here, not only in `parseFailureFacet`: a registered `FailureFacetJudge` may return a facet of any size, and only `facetJudgeFromCompletion` routes through that parser.
+        // This is the one point every consumer reads, and the label reaches a pull-request title (GitHub refuses past 256 characters) and a Slack message.
+        shaped.push({ ...c, label: chosen.label.slice(0, FACET_LABEL_MAX), fixSketch: chosen.fixSketch.slice(0, FACET_SKETCH_MAX), judged: facet !== null });
+    }
+    const totalFailures = rows.filter((r) => isFailureAction(r.action)).length;
+    return { org, windowStart, windowEnd, totalFailures, clusters: shaped };
+}
+const DISCOVERY_ONLY_FOOTER = "_Discovery only — no PR opened this run. A human picks which fix sketch, if any, to act on._";
+/**
+ * Render a report as the admin-channel Slack message text. Pure.
+ * A caller passes its own `footer` in place of the default: the last mile puts its outcome line there, so a failure to reproduce reaches the reader in words rather than as silence.
+ */
+export function formatMode3Report(report, footer = DISCOVERY_ONLY_FOOTER) {
+    const lines = [
+        `:microscope: *Weekly failure digest* (${report.windowStart.slice(0, 10)} → ${report.windowEnd.slice(0, 10)}) — ` +
+            `${report.totalFailures} failure event(s), top ${report.clusters.length} cluster(s):`,
+    ];
+    report.clusters.forEach((c, i) => {
+        lines.push(`${i + 1}. *${c.label}* (\`${c.action}\`, ${c.count}×) — ${c.fixSketch}`);
+        if (c.examples[0])
+            lines.push(`   e.g. ${c.examples[0]}`);
+    });
+    lines.push(footer);
+    return lines.join("\n");
+}
+//# sourceMappingURL=mode3.js.map

package/dist/agent/memory/dream/mode3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mode3.js","sourceRoot":"","sources":["../../../../agent/memory/dream/mode3.ts"],"names":[],"mappings":"AAAA,oMAAoM;AACpM,yHAAyH;AAIzH,+KAA+K;AAC/K,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,oBAAoB,EAAE,+DAA+D;IACrF,gBAAgB,EAAE,8EAA8E;IAChG,kBAAkB,EAAE,8EAA8E;IAClG,oBAAoB,EAAE,oDAAoD;IAC1E,iBAAiB,EAAE,kEAAkE;IACrF,gCAAgC,EAAE,8EAA8E;IAChH,mCAAmC,EAAE,oHAAoH;CACjJ,CAAC;AAIX,MAAM,kBAAkB,GAAwB,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;AAEzE,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,OAAO,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACxC,CAAC;AA2BD;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,GAAe,EAAE,IAAmB;IAC9D,MAAM,QAAQ,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,KAAK,GAAG,QAAQ;QACpB,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,IAAI,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACxE,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC;IACzF,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC;IAC3B,QAAQ,GAAG,CAAC,MAAM,EAAE,CAAC;QACnB,KAAK,oBAAoB;YACvB,OAAO,GAAG,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,YAAY,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC;QACvG,KAAK,gBAAgB;YACnB,OAAO,GAAG,KAAK,iEAAiE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC;QAClH,KAAK,kBAAkB;YACrB,OAAO,GAAG,KAAK,WAAW,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,eAAe,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC;QAChJ,KAAK,oBAAoB;YACvB,OAAO,GAAG,KAAK,yBAAyB,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAC3H,KAAK,iBAAiB;YACpB,OAAO,GAAG,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,iCAAiC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,YAAY,CAAC,EAAE,CAAC;QACrH,KAAK,gCAAgC,CAAC;QACtC,KAAK,mCAAmC;YACtC,OAAO,GAAG,KAAK,KAAK,GAAG,CAAC,MAAM,KAAK,gCAAgC,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,2BAA2B,MAAM,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;QACpM;YACE,OAAO,GAAG,KAAK,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;IACrC,CAAC;AACH,CAAC;AAED,iLAAiL;AACjL,MAAM,iBAAiB,GAAG;IACxB,MAAM;IACN,SAAS;IACT,MAAM;IACN,YAAY;IACZ,cAAc;IACd,aAAa;IACb,aAAa;IACb,cAAc;IACd,oBAAoB;IACpB,iBAAiB;CACT,CAAC;AAEX,SAAS,iBAAiB,CAAC,CAA0B;IACnD,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACrG,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;AACzD,CAAC;AAED,yIAAyI;AACzI,MAAM,UAAU,qBAAqB,CAAC,IAA2B;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS;QAC3C,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACpB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,IAA2B,EAAE,IAAI,GAAkB,EAAE;IAClF,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,IAAI,CAAC,CAAC;IACpD,OAAO,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;SACrD,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3B,MAAM;QACN,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,QAAQ,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;KACzF,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;AAC3B,CAAC;AAED,kGAAkG;AAClG,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,CAAC;AACnC,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAOpC,wIAAwI;AACxI,MAAM,YAAY,GAAwC;IACxD,oBAAoB,EAAE;QACpB,KAAK,EAAE,+CAA+C;QACtD,SAAS,EAAE,2IAA2I;KACvJ;IACD,gBAAgB,EAAE;QAChB,KAAK,EAAE,8CAA8C;QACrD,SAAS,EAAE,8IAA8I;KAC1J;IACD,kBAAkB,EAAE;QAClB,KAAK,EAAE,qCAAqC;QAC5C,SAAS,EAAE,mFAAmF;KAC/F;IACD,oBAAoB,EAAE;QACpB,KAAK,EAAE,0BAA0B;QACjC,SAAS,EAAE,wIAAwI;KACpJ;IACD,iBAAiB,EAAE;QACjB,KAAK,EAAE,uCAAuC;QAC9C,SAAS,EAAE,+HAA+H;KAC3I;IACD,gCAAgC,EAAE;QAChC,KAAK,EAAE,kCAAkC;QACzC,SAAS,EAAE,wMAAwM;KACpN;IACD,mCAAmC,EAAE;QACnC,KAAK,EAAE,qCAAqC;QAC5C,SAAS,EACP,+QAA+Q;KAClR;CACF,CAAC;AAEF,SAAS,WAAW,CAAC,MAAc;IACjC,OAAQ,YAA6C,CAAC,MAAM,CAAC,IAAI;QAC/D,KAAK,EAAE,MAAM;QACb,SAAS,EAAE,0FAA0F;KACtG,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK;QAAE,OAAO,IAAI,CAAC;IAC9C,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,OAAuB;IACjD,OAAO;QACL,+FAA+F;QAC/F,iCAAiC;QACjC,oBAAoB,OAAO,CAAC,MAAM,OAAO,OAAO,CAAC,KAAK,2BAA2B;QACjF,sBAAsB;QACtB,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QACxC,EAAE;QACF,uFAAuF;QACvF,oFAAoF;QACpF,yEAAyE;KAC1E,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;2FAC2F;AAC3F,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACzD,MAAM,CAAC,GAAG,GAA8B,CAAC;IACzC,IAAI,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAClF,IAAI,OAAO,CAAC,CAAC,WAAW,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1F,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,EAAE,CAAC;AAC7H,CAAC;AAQD,MAAM,UAAU,wBAAwB,CAAC,QAAyB;IAChE,OAAO;QACL,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO;YACxB,IAAI,CAAC;gBACH,OAAO,iBAAiB,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxE,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC,CAAC,yDAAyD;YACxE,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC;AAED,IAAI,oBAAoB,GAA6B,IAAI,CAAC;AAE1D,qJAAqJ;AACrJ,MAAM,UAAU,yBAAyB,CAAC,KAAwB;IAChE,oBAAoB,GAAG,KAAK,CAAC;AAC/B,CAAC;AAED,SAAS,iBAAiB;IACxB,OAAO,oBAAoB,CAAC;AAC9B,CAAC;AAmBD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,GAAW,EACX,IAA2B,EAC3B,WAAmB,EACnB,SAAiB,EACjB,IAAI,GAAkB,EAAE;IAExB,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,cAAc,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,MAAM,KAAK,GAAG,iBAAiB,EAAE,CAAC;IAClC,MAAM,MAAM,GAAyB,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,KAAK,GAAwB,IAAI,CAAC;QACtC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC;gBACH,KAAK,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpC,CAAC;YAAC,MAAM,CAAC;gBACP,KAAK,GAAG,IAAI,CAAC,CAAC,sDAAsD;YACtE,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,IAAI,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC9C,gLAAgL;QAChL,mJAAmJ;QACnJ,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,EAAE,MAAM,EAAE,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC;IACvJ,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3E,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AAC1E,CAAC;AAED,MAAM,qBAAqB,GACzB,8FAA8F,CAAC;AAEjG;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAmB,EAAE,MAAM,GAAW,qBAAqB;IAC3F,MAAM,KAAK,GAAG;QACZ,yCAAyC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM;YAC/G,GAAG,MAAM,CAAC,aAAa,0BAA0B,MAAM,CAAC,QAAQ,CAAC,MAAM,cAAc;KACxF,CAAC;IACF,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QACrF,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/agent/memory/dream/ops.d.ts

@@ -0,0 +1,75 @@
+import type { MemoryFiles } from "../store.js";
+export type OpKind = "dedup" | "link-repair" | "salience-reorder" | "consolidate" | "contradiction" | "supersede" | "stale";
+export declare const SAFE_KINDS: readonly OpKind[];
+export declare const DESTRUCTIVE_KINDS: readonly OpKind[];
+export declare function isSafe(kind: OpKind): boolean;
+export interface MemoryOp {
+    readonly kind: OpKind;
+    readonly file: string;
+    readonly summary: string;
+    readonly before?: string;
+    readonly after?: string;
+}
+/**
+ * Within each markdown file, drop bullet lines whose trimmed text exactly repeats an earlier
+ * bullet (first occurrence kept). Only bullet lines are touched — headings/prose are never
+ * deduped. Idempotent: a second pass finds nothing to drop.
+ */
+export declare function dedupBullets(files: MemoryFiles): {
+    files: MemoryFiles;
+    ops: MemoryOp[];
+};
+/**
+ * Canonicalise every `[[link]]` the graph resolves uniquely to a different node id — a bare basename or a case/spacing variant. Alias (`|`) and heading anchor (`#`) are preserved.
+ * A dangling link the graph cannot resolve is LEFT alone: it is intent, not an error.
+ */
+export declare function repairLinks(files: MemoryFiles): {
+    files: MemoryFiles;
+    ops: MemoryOp[];
+};
+/**
+ * Reorder each contiguous run of POINTER bullets (`- [[…]] …`) by descending salience of their first link, stable within equal scores.
+ * Dated fact bullets never match, so chronological content is untouched; only order changes, and sorting a sorted run is a no-op.
+ */
+export declare function reorderBySalience(files: MemoryFiles): {
+    files: MemoryFiles;
+    ops: MemoryOp[];
+};
+/**
+ * One bullet's FACT: its text with any provenance carrier removed, because the dream cycle pairs bullets by what they SAY, not by the attribution around it.
+ * Measured pre-fix: the carriers' own words dropped an attributed claim to 0.47 against its own plain duplicate (under the 0.70 consolidate bar) and lifted two unrelated bullets wrapped by the same turn to 0.53 (over the 0.50 candidate bar).
+ */
+export declare function factText(line: string): string;
+/** True when a bullet's FACT carries a negation or reversal marker. It reads {@link factText} for the same reason the word set does: polarity decides which pairing a bullet is eligible for, so a carrier word must never answer it. */
+export declare function isNegated(line: string): boolean;
+export declare function bulletDate(line: string): string | null;
+/** Significant, deduped, lower-cased content words of a bullet's FACT (provenance carrier + date +
+ *  stopwords + links dropped). The carriers go FIRST: on a dated bullet the attribution sits after
+ *  the date stamp, so removing it leaves the date where {@link DATE_PREFIX} still reads it. */
+export declare function contentWords(line: string): Set<string>;
+export declare function jaccard(a: Set<string>, b: Set<string>): number;
+/**
+ * EVERY token of one bullet's FACT — the carriers and the leading date stamp removed, nothing else dropped. NOT {@link contentWords}: that set drops stopwords and short tokens, which is exactly where a superseding fact differs.
+ * Measured on this repo's kernel: "…every 30 days" against "…every 60 days", and "Amy owns the cadence" against "Bob owns the cadence", both score 1.00 under `contentWords`.
+ */
+export declare function factTokens(line: string): Set<string>;
+/**
+ * The survivor-identity bar — one of the three conditions {@link restatesDonor} requires. The value is UNPROVEN against real judge output and is deliberately strict.
+ * The bar alone does not refuse a substitution (swapping one token of twenty still scores about 0.90); the containment rule does. `TidyOptions.restatementThreshold` moves it without a re-spelling here.
+ */
+export declare const RESTATEMENT_THRESHOLD = 0.9;
+/**
+ * Does `survivor` merely RE-TYPE the donor whose disclosure a conservation would copy? Three conditions, all required and each able only to decline: same polarity, containment of every donor token, and overlap at or above `threshold`.
+ * Declining is the conservative direction. A survivor that only ADDS words still counts as a re-typing, even where the addition changes the meaning.
+ */
+export declare function restatesDonor(survivor: string, sources: readonly string[], threshold?: number): boolean;
+/**
+ * DETECT near-duplicate bullets (high word overlap, SAME polarity) and PROPOSE a merge keeping the longer line — never applied, because merging drops a line. Byte-identical duplicates are `dedupBullets`' job.
+ * `exclude` skips human-edit-marked files, so the cycle never proposes "correcting" a fact an admin just deliberately wrote.
+ */
+export declare function detectConsolidations(files: MemoryFiles, threshold?: number, exclude?: ReadonlySet<string>): MemoryOp[];
+/** DETECT two bullets in one file about the SAME subject (moderate word overlap) with OPPOSING polarity. Heuristic, hence a proposal and never an auto-resolution: resolving a contradiction is a human's judgment call. */
+export declare function detectContradictions(files: MemoryFiles, subjectThreshold?: number, exclude?: ReadonlySet<string>): MemoryOp[];
+/** DETECT dated bullets older than `staleDays` and propose review or archival — never applied, because "old" is not "wrong": a standing decision can be years old and still load-bearing. */
+export declare function detectStale(files: MemoryFiles, now: Date, staleDays?: number, exclude?: ReadonlySet<string>): MemoryOp[];
+//# sourceMappingURL=ops.d.ts.map

package/dist/agent/memory/dream/ops.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ops.d.ts","sourceRoot":"","sources":["../../../../agent/memory/dream/ops.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAG/C,MAAM,MAAM,MAAM,GACd,OAAO,GACP,aAAa,GACb,kBAAkB,GAClB,aAAa,GACb,eAAe,GACf,WAAW,GACX,OAAO,CAAC;AAEZ,eAAO,MAAM,UAAU,EAAE,SAAS,MAAM,EAAiD,CAAC;AAQ1F,eAAO,MAAM,iBAAiB,EAAE,SAAS,MAAM,EAA2D,CAAC;AAE3G,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAE5C;AAED,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AASD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,GAAG,EAAE,QAAQ,EAAE,CAAA;CAAE,CAwBxF;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,WAAW,GAAG;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,GAAG,EAAE,QAAQ,EAAE,CAAA;CAAE,CAyBvF;AAQD;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,WAAW,GAAG;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,GAAG,EAAE,QAAQ,EAAE,CAAA;CAAE,CAmC7F;AAgBD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAE7C;AASD,yOAAyO;AACzO,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAE/C;AAED,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAEtD;AAED;;+FAE+F;AAC/F,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAQtD;AAiBD,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAK9D;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAMpD;AAED;;;GAGG;AACH,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC;;;GAGG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,SAAwB,GAAG,OAAO,CAStH;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,SAAM,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,QAAQ,EAAE,CAmBnH;AAED,4NAA4N;AAC5N,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,WAAW,EAAE,gBAAgB,SAAO,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,QAAQ,EAAE,CAc3H;AAED,6LAA6L;AAC7L,wBAAgB,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,SAAM,EAAE,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,QAAQ,EAAE,CAgBrH"}

package/dist/agent/memory/dream/ops.js

@@ -0,0 +1,302 @@
+// Pure tidy ops (no I/O, clock injected) over a silo's materialized markdown, split by BLAST RADIUS.
+// SAFE kinds are idempotent and non-lossy and the cycle auto-applies them; DESTRUCTIVE kinds would delete or rewrite meaning, so they are only DETECTED and proposed for human review, never applied.
+import { buildGraph, resolveNode } from "../graph.js";
+import { conserveProvenanceOnMerge, donorOf, provenanceCarrierPattern } from "../provenance-mark.js";
+import { salienceMap } from "./salience.js";
+export const SAFE_KINDS = ["dedup", "link-repair", "salience-reorder"];
+// `supersede` is DESTRUCTIVE like the rest and for the strongest reason of the four: it deletes a
+// line no date ordered and no key identified. OPE-1995 measured why it can never be auto-applied
+// from a score — "Kim joined the billing team" against "Tom joined the billing team" scores 1.00 on
+// this module's own kernel while being two live facts, and a real supersede ("payments use stripe"
+// against "payments use adyen") scores 0.33. The two classes overlap completely, so NO threshold
+// separates them and only a judge can. See `selectCandidates` for the detection and
+// `supersede-apply.ts` for what an approval then does.
+export const DESTRUCTIVE_KINDS = ["consolidate", "contradiction", "supersede", "stale"];
+export function isSafe(kind) {
+    return SAFE_KINDS.includes(kind);
+}
+// A `[[wikilink]]` — same shape graph.ts parses, redeclared locally so this module owns no
+// private graph internals. Global so `String.replace` can rewrite every occurrence.
+const WIKILINK = /\[\[([^[\]]+?)\]\]/g;
+const isMd = (rel) => /\.md$/i.test(rel);
+const isBullet = (line) => /^\s*-\s+/.test(line);
+const isPointerBullet = (line) => /^\s*-\s+\[\[/.test(line);
+/**
+ * Within each markdown file, drop bullet lines whose trimmed text exactly repeats an earlier
+ * bullet (first occurrence kept). Only bullet lines are touched — headings/prose are never
+ * deduped. Idempotent: a second pass finds nothing to drop.
+ */
+export function dedupBullets(files) {
+    const out = {};
+    const ops = [];
+    for (const [rel, content] of Object.entries(files)) {
+        if (!isMd(rel)) {
+            out[rel] = content;
+            continue;
+        }
+        const seen = new Set();
+        const kept = [];
+        for (const line of content.split("\n")) {
+            if (isBullet(line)) {
+                const key = line.trim();
+                if (seen.has(key)) {
+                    ops.push({ kind: "dedup", file: rel, summary: `dropped duplicate bullet — ${key.slice(0, 72)}`, before: line });
+                    continue;
+                }
+                seen.add(key);
+            }
+            kept.push(line);
+        }
+        out[rel] = kept.join("\n");
+    }
+    return { files: out, ops };
+}
+/**
+ * Canonicalise every `[[link]]` the graph resolves uniquely to a different node id — a bare basename or a case/spacing variant. Alias (`|`) and heading anchor (`#`) are preserved.
+ * A dangling link the graph cannot resolve is LEFT alone: it is intent, not an error.
+ */
+export function repairLinks(files) {
+    const graph = buildGraph(files);
+    const out = {};
+    const ops = [];
+    for (const [rel, content] of Object.entries(files)) {
+        if (!isMd(rel)) {
+            out[rel] = content;
+            continue;
+        }
+        const rewritten = content.replace(WIKILINK, (whole, body) => {
+            const [targetPart, ...aliasParts] = body.split("|");
+            const [rawTarget, anchor] = targetPart.split("#");
+            const target = rawTarget.trim();
+            if (!target)
+                return whole;
+            const id = resolveNode(graph, target);
+            if (!id || id === target)
+                return whole; // unresolvable, or already canonical
+            const anchorPart = anchor !== undefined ? `#${anchor}` : "";
+            const aliasPart = aliasParts.length > 0 ? `|${aliasParts.join("|")}` : "";
+            const replacement = `[[${id}${anchorPart}${aliasPart}]]`;
+            ops.push({ kind: "link-repair", file: rel, summary: `[[${target}]] → [[${id}]]`, before: whole, after: replacement });
+            return replacement;
+        });
+        out[rel] = rewritten;
+    }
+    return { files: out, ops };
+}
+function bulletTarget(line, graph) {
+    const m = line.match(/\[\[([^[\]]+?)\]\]/);
+    if (!m)
+        return null;
+    return resolveNode(graph, m[1].split("|")[0].split("#")[0].trim());
+}
+/**
+ * Reorder each contiguous run of POINTER bullets (`- [[…]] …`) by descending salience of their first link, stable within equal scores.
+ * Dated fact bullets never match, so chronological content is untouched; only order changes, and sorting a sorted run is a no-op.
+ */
+export function reorderBySalience(files) {
+    const graph = buildGraph(files);
+    const score = salienceMap(graph);
+    const out = {};
+    const ops = [];
+    for (const [rel, content] of Object.entries(files)) {
+        if (!isMd(rel)) {
+            out[rel] = content;
+            continue;
+        }
+        const lines = content.split("\n");
+        let changed = false;
+        let i = 0;
+        while (i < lines.length) {
+            if (!isPointerBullet(lines[i])) {
+                i++;
+                continue;
+            }
+            let j = i;
+            while (j < lines.length && isPointerBullet(lines[j]))
+                j++;
+            const run = lines.slice(i, j);
+            const sorted = run
+                .map((line, idx) => ({ line, idx, s: score.get(bulletTarget(line, graph) ?? "") ?? 0 }))
+                .sort((a, b) => b.s - a.s || a.idx - b.idx)
+                .map((e) => e.line);
+            if (sorted.some((line, k) => line !== run[k])) {
+                changed = true;
+                ops.push({ kind: "salience-reorder", file: rel, summary: `reordered ${run.length} pointer bullet(s) by salience` });
+                for (let k = 0; k < run.length; k++)
+                    lines[i + k] = sorted[k];
+            }
+            i = j;
+        }
+        out[rel] = changed ? lines.join("\n") : content;
+    }
+    return { files: out, ops };
+}
+const STOP = new Set([
+    "the", "a", "an", "and", "or", "but", "to", "of", "in", "on", "for", "with", "is",
+    "are", "was", "were", "be", "by", "at", "as", "it", "its", "this", "that", "from",
+    "see", "also", "via", "per", "our", "we", "you", "they", "he", "she",
+]);
+const NEGATION = /\b(not|no|never|n't|dont|doesn't|isn't|aren't|wasn't|stop(?:ped)?|deprecat(?:ed)?|remov(?:ed)?|cancel(?:led)?|drop(?:ped)?|no longer|instead of)\b/i;
+const DATE_PREFIX = /^\s*-\s+(\d{4}-\d{2}-\d{2})\s*[:]?\s*/;
+/**
+ * Either carrier of the provenance mark, built by memory/provenance-mark.ts, which owns the wordings and the full-lead-in bound.
+ * This module-level `/g` copy is safe for `String.replace` and `matchAll` only — never `.test()` or `.exec()`, which advance `lastIndex`.
+ */
+const PROVENANCE_CARRIER = provenanceCarrierPattern();
+/**
+ * One bullet's FACT: its text with any provenance carrier removed, because the dream cycle pairs bullets by what they SAY, not by the attribution around it.
+ * Measured pre-fix: the carriers' own words dropped an attributed claim to 0.47 against its own plain duplicate (under the 0.70 consolidate bar) and lifted two unrelated bullets wrapped by the same turn to 0.53 (over the 0.50 candidate bar).
+ */
+export function factText(line) {
+    return line.replace(PROVENANCE_CARRIER, " ");
+}
+/** True when a bullet's FACT carries a negation or reversal marker. It reads {@link factText} for the same reason the word set does: polarity decides which pairing a bullet is eligible for, so a carrier word must never answer it. */
+export function isNegated(line) {
+    return NEGATION.test(factText(line));
+}
+export function bulletDate(line) {
+    return line.match(DATE_PREFIX)?.[1] ?? null;
+}
+/** Significant, deduped, lower-cased content words of a bullet's FACT (provenance carrier + date +
+ *  stopwords + links dropped). The carriers go FIRST: on a dated bullet the attribution sits after
+ *  the date stamp, so removing it leaves the date where {@link DATE_PREFIX} still reads it. */
+export function contentWords(line) {
+    const body = factText(line)
+        .replace(DATE_PREFIX, "")
+        .replace(/^\s*-\s+/, "")
+        .replace(WIKILINK, " ")
+        .toLowerCase();
+    const words = body.split(/[^a-z0-9]+/).filter((w) => w.length > 3 && !STOP.has(w));
+    return new Set(words);
+}
+// `exclude` (memory/provenance.ts `humanEditedFiles`) drops a file's bullets from destructive detection entirely.
+// Every pairing below is same-file-only, so removing a file can never hide evidence a DIFFERENT file's pair needed.
+function bulletRefs(files, exclude) {
+    const refs = [];
+    for (const [file, content] of Object.entries(files)) {
+        if (!isMd(file))
+            continue;
+        if (exclude?.has(file))
+            continue;
+        for (const line of content.split("\n")) {
+            if (!isBullet(line))
+                continue;
+            refs.push({ file, line, words: contentWords(line), negated: isNegated(line) });
+        }
+    }
+    return refs;
+}
+export function jaccard(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let inter = 0;
+    for (const w of a)
+        if (b.has(w))
+            inter++;
+    return inter / (a.size + b.size - inter);
+}
+/**
+ * EVERY token of one bullet's FACT — the carriers and the leading date stamp removed, nothing else dropped. NOT {@link contentWords}: that set drops stopwords and short tokens, which is exactly where a superseding fact differs.
+ * Measured on this repo's kernel: "…every 30 days" against "…every 60 days", and "Amy owns the cadence" against "Bob owns the cadence", both score 1.00 under `contentWords`.
+ */
+export function factTokens(line) {
+    const body = factText(line)
+        .replace(DATE_PREFIX, "")
+        .replace(/^\s*-\s+/, "")
+        .toLowerCase();
+    return new Set(body.split(/[^a-z0-9]+/).filter((t) => t.length > 0));
+}
+/**
+ * The survivor-identity bar — one of the three conditions {@link restatesDonor} requires. The value is UNPROVEN against real judge output and is deliberately strict.
+ * The bar alone does not refuse a substitution (swapping one token of twenty still scores about 0.90); the containment rule does. `TidyOptions.restatementThreshold` moves it without a re-spelling here.
+ */
+export const RESTATEMENT_THRESHOLD = 0.9;
+/**
+ * Does `survivor` merely RE-TYPE the donor whose disclosure a conservation would copy? Three conditions, all required and each able only to decline: same polarity, containment of every donor token, and overlap at or above `threshold`.
+ * Declining is the conservative direction. A survivor that only ADDS words still counts as a re-typing, even where the addition changes the meaning.
+ */
+export function restatesDonor(survivor, sources, threshold = RESTATEMENT_THRESHOLD) {
+    const donor = donorOf(sources);
+    if (donor === undefined)
+        return false; // nothing disclosed ⇒ nothing to conserve either way
+    if (isNegated(survivor) !== isNegated(donor))
+        return false;
+    const survivorTokens = factTokens(survivor);
+    const donorTokens = factTokens(donor);
+    if (survivorTokens.size === 0 || donorTokens.size === 0)
+        return false;
+    for (const token of donorTokens)
+        if (!survivorTokens.has(token))
+            return false; // a re-typing drops nothing
+    return jaccard(survivorTokens, donorTokens) >= threshold;
+}
+/**
+ * DETECT near-duplicate bullets (high word overlap, SAME polarity) and PROPOSE a merge keeping the longer line — never applied, because merging drops a line. Byte-identical duplicates are `dedupBullets`' job.
+ * `exclude` skips human-edit-marked files, so the cycle never proposes "correcting" a fact an admin just deliberately wrote.
+ */
+export function detectConsolidations(files, threshold = 0.7, exclude) {
+    const refs = bulletRefs(files, exclude);
+    const ops = [];
+    for (let i = 0; i < refs.length; i++) {
+        for (let j = i + 1; j < refs.length; j++) {
+            const a = refs[i];
+            const b = refs[j];
+            if (a.file !== b.file)
+                continue;
+            if (a.line.trim() === b.line.trim())
+                continue; // exact dup → dedup handles it
+            if (a.negated !== b.negated)
+                continue; // opposing polarity → contradiction, not consolidate
+            if (jaccard(a.words, b.words) < threshold)
+                continue;
+            // Length is provenance-blind: the longer line can be the unhedged one, so the merge would launder a disclosure.
+            // `conserveProvenanceOnMerge` copies the FIRST disclosing source's carriers onto the survivor — the rule compares no two marks for strictness.
+            const keep = a.line.length >= b.line.length ? a.line : b.line;
+            const survivor = conserveProvenanceOnMerge(keep, [a.line, b.line]);
+            ops.push({ kind: "consolidate", file: a.file, summary: `near-duplicate bullets — merge into one`, before: `${a.line}\n${b.line}`, after: survivor });
+        }
+    }
+    return ops;
+}
+/** DETECT two bullets in one file about the SAME subject (moderate word overlap) with OPPOSING polarity. Heuristic, hence a proposal and never an auto-resolution: resolving a contradiction is a human's judgment call. */
+export function detectContradictions(files, subjectThreshold = 0.34, exclude) {
+    const refs = bulletRefs(files, exclude);
+    const ops = [];
+    for (let i = 0; i < refs.length; i++) {
+        for (let j = i + 1; j < refs.length; j++) {
+            const a = refs[i];
+            const b = refs[j];
+            if (a.file !== b.file)
+                continue;
+            if (a.negated === b.negated)
+                continue; // need opposing polarity
+            if (jaccard(a.words, b.words) < subjectThreshold)
+                continue; // must be the same subject
+            ops.push({ kind: "contradiction", file: a.file, summary: `possible contradiction (one bullet negates the other)`, before: `${a.line}\n${b.line}` });
+        }
+    }
+    return ops;
+}
+/** DETECT dated bullets older than `staleDays` and propose review or archival — never applied, because "old" is not "wrong": a standing decision can be years old and still load-bearing. */
+export function detectStale(files, now, staleDays = 180, exclude) {
+    const horizon = now.getTime() - staleDays * 24 * 60 * 60 * 1000;
+    const ops = [];
+    for (const [file, content] of Object.entries(files)) {
+        if (!isMd(file))
+            continue;
+        if (exclude?.has(file))
+            continue;
+        for (const line of content.split("\n")) {
+            const m = line.match(DATE_PREFIX);
+            if (!m)
+                continue;
+            const t = Date.parse(m[1]);
+            if (!Number.isFinite(t) || t >= horizon)
+                continue;
+            const ageDays = Math.floor((now.getTime() - t) / (24 * 60 * 60 * 1000));
+            ops.push({ kind: "stale", file, summary: `bullet is ${ageDays}d old (> ${staleDays}d) — review or archive`, before: line });
+        }
+    }
+    return ops;
+}
+//# sourceMappingURL=ops.js.map