daftari 1.21.0 → 1.23.0

package/dist/consolidate/birth.js

@@ -0,0 +1,315 @@
+// Birth mode (spec §4.0, brief item 1). For an unprocessed doc, retrieve its
+// top-K embedding neighbors and ask the LLM — with a foundational-ordering
+// prompt, both docs' content loaded — whether it has a load-bearing derivation
+// with each neighbor and which is the premise; emit edge_observe for survivors,
+// log the full top-K + outcomes to the birth trace for post-hoc recall@K
+// evaluation, and return the content hash so the caller can advance
+// `consolidate-state.json`'s birth-processed map.
+//
+// Direction is elicited in BOTH orders per neighbor (option c, design §3.1
+// amendment): agreement ⇒ a trusted directed edge; an explicit `symmetric` or
+// an order-disagreement ⇒ a canonical-sorted *pending* edge (premiseVote
+// "symmetric", direction-unconfirmed) plus an interpretive tension for human
+// adjudication. The gate showed ambiguous real-prose pairs return a confident
+// but order-dependent direction rather than `symmetric`, so both orders are
+// required to catch that.
+//
+// One pass per neighbor — NOT a panel (the panel is revision-mode, §4.1).
+// Birth seeds k=0 candidates; subsequent revision passes earn strength.
+import { createHash } from "node:crypto";
+import { appendFileSync, mkdirSync } from "node:fs";
+import { join, posix } from "node:path";
+import { err, ok } from "../frontmatter/types.js";
+import { CONSOLIDATE_AGENT } from "./constants.js";
+import { DERIVATION_SYSTEM, DERIVATION_VERDICT_SCHEMA, derivationUserBody, parseDerivationVerdict, } from "./derivation-prompt.js";
+// --- canonicalization --------------------------------------------------------
+// Same canon() as src/consolidate/index.ts uses. Path-aliasing is the bug
+// class that bit edge store + merge + Stage 1; every keyed boundary
+// canonicalizes (memory: canonicalize-path-keys).
+function canon(p) {
+    return posix.normalize(p).replace(/^\.\//, "");
+}
+// Map an order-1 verdict (A=doc, B=neighbor) to a real-world premise.
+function realWorldPremise1(v) {
+    if (!v.related)
+        return "unrelated";
+    if (v.premise === "symmetric")
+        return "symmetric";
+    if (v.premise === "A")
+        return "doc";
+    if (v.premise === "B")
+        return "neighbor";
+    return "unrelated";
+}
+// Map an order-2 verdict (A=neighbor, B=doc) to a real-world premise.
+function realWorldPremise2(v) {
+    if (!v.related)
+        return "unrelated";
+    if (v.premise === "symmetric")
+        return "symmetric";
+    if (v.premise === "A")
+        return "neighbor";
+    if (v.premise === "B")
+        return "doc";
+    return "unrelated";
+}
+// Reconcile both orders into a single edge decision. Conservative on existence
+// (either order saying "unrelated" ⇒ no edge); any explicit symmetric ⇒ pending;
+// agreement on the premise ⇒ directed; disagreement (one says doc, the other
+// neighbor) ⇒ pending-contested.
+export function reconcileDirection(order1, order2) {
+    const r1 = realWorldPremise1(order1);
+    const r2 = realWorldPremise2(order2);
+    if (r1 === "unrelated" || r2 === "unrelated")
+        return { kind: "unrelated" };
+    if (r1 === "symmetric" || r2 === "symmetric")
+        return { kind: "symmetric", contested: false };
+    if (r1 === r2)
+        return { kind: "directed", premise: r1 };
+    return { kind: "symmetric", contested: true };
+}
+// --- prompt input bounding ---------------------------------------------------
+// Truncate doc content for the prompt. Birth doesn't need the whole doc —
+// the central claim is usually in the first ~1500 chars; a longer corpus
+// is calibration noise + cost. Tunable from constants if needed.
+const MAX_DOC_CHARS = 1500;
+function truncate(s) {
+    return s.length <= MAX_DOC_CHARS ? s : `${s.slice(0, MAX_DOC_CHARS)}\n…[truncated]`;
+}
+// Defensive wrapper around the injected admit. The live makeAdmit (Task 7) does
+// I/O — reads provenance / decay / tension state — so it can throw (network,
+// config, fs). The house style is no-throw from this loop: a thrown admit must
+// NOT crash the whole birth pass (losing every neighbor's verdict + the trace).
+// Treat a throw as a refusal on the invariants gate (fail-closed: never write
+// when the gate couldn't be evaluated), recorded like any other gated outcome.
+async function safeAdmit(admit, action) {
+    try {
+        return await admit(action);
+    }
+    catch (e) {
+        return {
+            admit: false,
+            gate: "invariants",
+            reason: `admit threw: ${e instanceof Error ? e.message : String(e)}`,
+            impact: 0,
+        };
+    }
+}
+// A non-empty one-line claim snippet for the tension record (addTension rejects
+// empty claims). Falls back to the path when the content is blank.
+function claimSnippet(content, fallback) {
+    const line = content.split("\n").find((l) => l.trim().length > 0);
+    const snip = (line ?? "").trim().slice(0, 200);
+    return snip.length > 0 ? snip : `(no readable content: ${fallback})`;
+}
+// --- birth pass --------------------------------------------------------------
+export async function birthOne(doc, deps, opts) {
+    const docPath = canon(doc.relPath);
+    const contentHash = createHash("sha256").update(doc.content).digest("hex").slice(0, 16);
+    const docContent = truncate(doc.content);
+    const neighborsRes = await deps.searchNeighbors(docPath, 20);
+    if (!neighborsRes.ok)
+        return neighborsRes;
+    const neighbors = neighborsRes.value.map(canon).filter((n) => n !== docPath);
+    const verdicts = [];
+    const observations = [];
+    let gatedCount = 0;
+    let llmCalls = 0;
+    let inputTokens = 0;
+    let outputTokens = 0;
+    for (const neighbor of neighbors) {
+        // Each neighbor needs both orders; stop if we can't afford the pair.
+        if (llmCalls + 2 > opts.budgetRemaining)
+            break;
+        const nc = await deps.loadNeighborContent(neighbor);
+        if (!nc.ok) {
+            verdicts.push({ neighbor, error: `load failed: ${nc.error.message}` });
+            continue;
+        }
+        const neighborContent = truncate(nc.value);
+        // Order 1: DOC A = this doc, DOC B = neighbor.
+        const r1 = await deps.llm.completeJson({
+            model: opts.model,
+            system: DERIVATION_SYSTEM,
+            user: derivationUserBody(docPath, docContent, neighbor, neighborContent),
+            schema: DERIVATION_VERDICT_SCHEMA,
+            temperature: 0,
+        });
+        llmCalls++;
+        if (!r1.ok) {
+            verdicts.push({ neighbor, error: r1.error.message });
+            continue;
+        }
+        inputTokens += r1.value.input_tokens;
+        outputTokens += r1.value.output_tokens;
+        const p1 = parseDerivationVerdict(r1.value.parsed);
+        if (!p1.ok) {
+            verdicts.push({ neighbor, error: p1.error.message });
+            continue;
+        }
+        // Order 2: DOC A = neighbor, DOC B = this doc.
+        const r2 = await deps.llm.completeJson({
+            model: opts.model,
+            system: DERIVATION_SYSTEM,
+            user: derivationUserBody(neighbor, neighborContent, docPath, docContent),
+            schema: DERIVATION_VERDICT_SCHEMA,
+            temperature: 0,
+        });
+        llmCalls++;
+        if (!r2.ok) {
+            verdicts.push({ neighbor, error: r2.error.message });
+            continue;
+        }
+        inputTokens += r2.value.input_tokens;
+        outputTokens += r2.value.output_tokens;
+        const p2 = parseDerivationVerdict(r2.value.parsed);
+        if (!p2.ok) {
+            verdicts.push({ neighbor, error: p2.error.message });
+            continue;
+        }
+        const outcome = reconcileDirection(p1.value, p2.value);
+        const reason = p1.value.reason;
+        if (outcome.kind === "unrelated") {
+            verdicts.push({ neighbor, related: false, direction: "none", premise: null, reason });
+            continue;
+        }
+        if (outcome.kind === "directed") {
+            // Premise is materialized on `to` (clocks: from depends on to). doc-premise
+            // ⇒ to=doc, from=neighbor; neighbor-premise ⇒ to=neighbor, from=doc.
+            const [from, to] = outcome.premise === "doc" ? [neighbor, docPath] : [docPath, neighbor];
+            // Consult the envelope ONCE for this neighbor's edge-action. On refuse:
+            // record a gated verdict, count it, and skip the write entirely.
+            const verdict = await safeAdmit(deps.admit, {
+                action: "edge-observe",
+                fromPath: from,
+                toPath: to,
+            });
+            if (!verdict.admit) {
+                verdicts.push({
+                    neighbor,
+                    related: true,
+                    direction: "directed",
+                    premise: outcome.premise,
+                    reason,
+                    gated: true,
+                    gate: verdict.gate,
+                });
+                gatedCount++;
+                continue;
+            }
+            verdicts.push({
+                neighbor,
+                related: true,
+                direction: "directed",
+                premise: outcome.premise,
+                reason,
+            });
+            const obs = await deps.observe({
+                fromPath: from,
+                toPath: to,
+                observedBy: opts.agent,
+                blind: true,
+                axis: "prompt",
+                premiseVote: "to",
+                note: `birth: ${reason}`,
+            });
+            if (!obs.ok) {
+                verdicts.push({ neighbor, error: `observe failed: ${obs.error.message}` });
+                continue;
+            }
+            observations.push({ from, to });
+            continue;
+        }
+        // symmetric — a canonical-sorted pending edge (direction unconfirmed) so
+        // re-observation lands on the same key, plus an interpretive tension.
+        const [from, to] = [docPath, neighbor].sort();
+        const which = outcome.contested ? "contested" : "mutual";
+        // Consult the envelope ONCE for this neighbor's edge-action. On refuse:
+        // record a gated verdict, count it, and skip BOTH the observe AND the
+        // direction-pending tension (no write of any kind).
+        const symVerdict = await safeAdmit(deps.admit, {
+            action: "edge-observe",
+            fromPath: from,
+            toPath: to,
+        });
+        if (!symVerdict.admit) {
+            verdicts.push({
+                neighbor,
+                related: true,
+                direction: "symmetric",
+                premise: null,
+                reason,
+                gated: true,
+                gate: symVerdict.gate,
+            });
+            gatedCount++;
+            continue;
+        }
+        verdicts.push({ neighbor, related: true, direction: "symmetric", premise: null, reason });
+        const obs = await deps.observe({
+            fromPath: from,
+            toPath: to,
+            observedBy: opts.agent,
+            blind: true,
+            axis: "prompt",
+            premiseVote: "symmetric",
+            note: `birth/symmetric(${which}): ${reason}`,
+        });
+        if (!obs.ok) {
+            verdicts.push({ neighbor, error: `observe failed: ${obs.error.message}` });
+            continue;
+        }
+        observations.push({ from, to });
+        const tension = await deps.recordTension({
+            title: `direction-pending (${which}): ${from} ↔ ${to}`,
+            kind: "interpretive",
+            sourceA: docPath,
+            claimA: claimSnippet(doc.content, docPath),
+            sourceB: neighbor,
+            claimB: claimSnippet(nc.value, neighbor),
+            loggedBy: opts.agent,
+        });
+        if (!tension.ok) {
+            verdicts.push({ neighbor, error: `tension failed: ${tension.error.message}` });
+        }
+    }
+    const traceRes = await deps.recordBirthTrace({
+        at: new Date().toISOString().replace(/\.\d{3}Z$/, "Z"),
+        docPath,
+        contentHash,
+        topK: neighbors,
+        axis: opts.axis,
+        model: opts.model,
+        verdicts,
+    });
+    return ok({
+        docPath,
+        contentHash,
+        neighbors,
+        verdicts,
+        observations,
+        gatedCount,
+        llmCalls,
+        inputTokens,
+        outputTokens,
+        traceWritten: traceRes.ok,
+        ...(traceRes.ok ? {} : { traceError: traceRes.error.message }),
+    });
+}
+// --- the CLI-wired trace recorder --------------------------------------------
+export function birthTracePath(vaultRoot) {
+    return join(vaultRoot, ".daftari", "birth-trace.jsonl");
+}
+export async function appendBirthTrace(vaultRoot, row) {
+    try {
+        mkdirSync(join(vaultRoot, ".daftari"), { recursive: true });
+        appendFileSync(birthTracePath(vaultRoot), `${JSON.stringify(row)}\n`);
+        return ok(undefined);
+    }
+    catch (e) {
+        return err(new Error(`cannot record birth trace: ${e instanceof Error ? e.message : String(e)}`));
+    }
+}
+// Re-exported so the CLI doesn't have to import it from constants alone.
+export { CONSOLIDATE_AGENT };
+//# sourceMappingURL=birth.js.map

package/dist/consolidate/birth.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"birth.js","sourceRoot":"","sources":["../../src/consolidate/birth.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,2EAA2E;AAC3E,+EAA+E;AAC/E,gFAAgF;AAChF,yEAAyE;AACzE,oEAAoE;AACpE,kDAAkD;AAClD,EAAE;AACF,2EAA2E;AAC3E,8EAA8E;AAC9E,yEAAyE;AACzE,6EAA6E;AAC7E,8EAA8E;AAC9E,4EAA4E;AAC5E,0BAA0B;AAC1B,EAAE;AACF,0EAA0E;AAC1E,wEAAwE;AAExE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAIxC,OAAO,EAAE,GAAG,EAAE,EAAE,EAAe,MAAM,yBAAyB,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAkC,MAAM,gBAAgB,CAAC;AACnF,OAAO,EACL,iBAAiB,EACjB,yBAAyB,EAEzB,kBAAkB,EAClB,sBAAsB,GACvB,MAAM,wBAAwB,CAAC;AA+FhC,gFAAgF;AAEhF,0EAA0E;AAC1E,oEAAoE;AACpE,kDAAkD;AAClD,SAAS,KAAK,CAAC,CAAS;IACtB,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AACjD,CAAC;AASD,sEAAsE;AACtE,SAAS,iBAAiB,CAAC,CAAoB;IAC7C,IAAI,CAAC,CAAC,CAAC,OAAO;QAAE,OAAO,WAAW,CAAC;IACnC,IAAI,CAAC,CAAC,OAAO,KAAK,WAAW;QAAE,OAAO,WAAW,CAAC;IAClD,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG;QAAE,OAAO,UAAU,CAAC;IACzC,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,sEAAsE;AACtE,SAAS,iBAAiB,CAAC,CAAoB;IAC7C,IAAI,CAAC,CAAC,CAAC,OAAO;QAAE,OAAO,WAAW,CAAC;IACnC,IAAI,CAAC,CAAC,OAAO,KAAK,WAAW;QAAE,OAAO,WAAW,CAAC;IAClD,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG;QAAE,OAAO,UAAU,CAAC;IACzC,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG;QAAE,OAAO,KAAK,CAAC;IACpC,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,+EAA+E;AAC/E,iFAAiF;AACjF,6EAA6E;AAC7E,iCAAiC;AACjC,MAAM,UAAU,kBAAkB,CAChC,MAAyB,EACzB,MAAyB;IAEzB,MAAM,EAAE,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,EAAE,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,EAAE,KAAK,WAAW,IAAI,EAAE,KAAK,WAAW;QAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IAC3E,IAAI,EAAE,KAAK,WAAW,IAAI,EAAE,KAAK,WAAW;QAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC7F,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACxD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAChD,CAAC;AAED,gFAAgF;AAEhF,0EAA0E;AAC1E,yEAAyE;AACzE,iEAAiE;AACjE,MAAM,aAAa,GAAG,IAAI,CAAC;AAC3B,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,CAAC,CAAC,MAAM,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,gBAAgB,CAAC;AACtF,CAAC;AAED,gFAAgF;AAChF,6EAA6E;AAC7E,+EAA+E;AAC/E,gFAAgF;AAChF,8EAA8E;AAC9E,+EAA+E;AAC/E,KAAK,UAAU,SAAS,CACtB,KAAY,EACZ,MAAqF;IAErF,IAAI,CAAC;QACH,OAAO,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,IAAI,EAAE,YAAY;YAClB,MAAM,EAAE,gBAAgB,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YACpE,MAAM,EAAE,CAAC;SACV,CAAC;IACJ,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,mEAAmE;AACnE,SAAS,YAAY,CAAC,OAAe,EAAE,QAAgB;IACrD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClE,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC/C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB,QAAQ,GAAG,CAAC;AACvE,CAAC;AAED,gFAAgF;AAEhF,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,GAAyC,EACzC,IAAe,EACf,IAAe;IAEf,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACxF,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAEzC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAC7D,IAAI,CAAC,YAAY,CAAC,EAAE;QAAE,OAAO,YAAY,CAAC;IAC1C,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC;IAE7E,MAAM,QAAQ,GAA4C,EAAE,CAAC;IAC7D,MAAM,YAAY,GAAwC,EAAE,CAAC;IAC7D,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,qEAAqE;QACrE,IAAI,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,eAAe;YAAE,MAAM;QAE/C,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QACpD,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACX,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACvE,SAAS;QACX,CAAC;QACD,MAAM,eAAe,GAAG,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;QAE3C,+CAA+C;QAC/C,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,iBAAiB;YACzB,IAAI,EAAE,kBAAkB,CAAC,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,eAAe,CAAC;YACxE,MAAM,EAAE,yBAAyB;YACjC,WAAW,EAAE,CAAC;SACf,CAAC,CAAC;QACH,QAAQ,EAAE,CAAC;QACX,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACX,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACrD,SAAS;QACX,CAAC;QACD,WAAW,IAAI,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC;QACrC,YAAY,IAAI,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC;QACvC,MAAM,EAAE,GAAG,sBAAsB,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACX,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACrD,SAAS;QACX,CAAC;QAED,+CAA+C;QAC/C,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC;YACrC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,iBAAiB;YACzB,IAAI,EAAE,kBAAkB,CAAC,QAAQ,EAAE,eAAe,EAAE,OAAO,EAAE,UAAU,CAAC;YACxE,MAAM,EAAE,yBAAyB;YACjC,WAAW,EAAE,CAAC;SACf,CAAC,CAAC;QACH,QAAQ,EAAE,CAAC;QACX,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACX,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACrD,SAAS;QACX,CAAC;QACD,WAAW,IAAI,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC;QACrC,YAAY,IAAI,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC;QACvC,MAAM,EAAE,GAAG,sBAAsB,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACX,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACrD,SAAS;QACX,CAAC;QAED,MAAM,OAAO,GAAG,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC;QAE/B,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YACjC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;YACtF,SAAS;QACX,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAChC,4EAA4E;YAC5E,qEAAqE;YACrE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YACzF,wEAAwE;YACxE,iEAAiE;YACjE,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE;gBAC1C,MAAM,EAAE,cAAc;gBACtB,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,EAAE;aACX,CAAC,CAAC;YACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC;oBACZ,QAAQ;oBACR,OAAO,EAAE,IAAI;oBACb,SAAS,EAAE,UAAU;oBACrB,OAAO,EAAE,OAAO,CAAC,OAAO;oBACxB,MAAM;oBACN,KAAK,EAAE,IAAI;oBACX,IAAI,EAAE,OAAO,CAAC,IAAI;iBACnB,CAAC,CAAC;gBACH,UAAU,EAAE,CAAC;gBACb,SAAS;YACX,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC;gBACZ,QAAQ;gBACR,OAAO,EAAE,IAAI;gBACb,SAAS,EAAE,UAAU;gBACrB,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,MAAM;aACP,CAAC,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC;gBAC7B,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,EAAE;gBACV,UAAU,EAAE,IAAI,CAAC,KAAK;gBACtB,KAAK,EAAE,IAAI;gBACX,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,IAAI;gBACjB,IAAI,EAAE,UAAU,MAAM,EAAE;aACzB,CAAC,CAAC;YACH,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;gBACZ,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,mBAAmB,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBAC3E,SAAS;YACX,CAAC;YACD,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;YAChC,SAAS;QACX,CAAC;QAED,yEAAyE;QACzE,sEAAsE;QACtE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC;QACzD,wEAAwE;QACxE,sEAAsE;QACtE,oDAAoD;QACpD,MAAM,UAAU,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE;YAC7C,MAAM,EAAE,cAAc;YACtB,QAAQ,EAAE,IAAI;YACd,MAAM,EAAE,EAAE;SACX,CAAC,CAAC;QACH,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC;gBACZ,QAAQ;gBACR,OAAO,EAAE,IAAI;gBACb,SAAS,EAAE,WAAW;gBACtB,OAAO,EAAE,IAAI;gBACb,MAAM;gBACN,KAAK,EAAE,IAAI;gBACX,IAAI,EAAE,UAAU,CAAC,IAAI;aACtB,CAAC,CAAC;YACH,UAAU,EAAE,CAAC;YACb,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1F,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC;YAC7B,QAAQ,EAAE,IAAI;YACd,MAAM,EAAE,EAAE;YACV,UAAU,EAAE,IAAI,CAAC,KAAK;YACtB,KAAK,EAAE,IAAI;YACX,IAAI,EAAE,QAAQ;YACd,WAAW,EAAE,WAAW;YACxB,IAAI,EAAE,mBAAmB,KAAK,MAAM,MAAM,EAAE;SAC7C,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YACZ,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,mBAAmB,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAC3E,SAAS;QACX,CAAC;QACD,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC;YACvC,KAAK,EAAE,sBAAsB,KAAK,MAAM,IAAI,MAAM,EAAE,EAAE;YACtD,IAAI,EAAE,cAAc;YACpB,OAAO,EAAE,OAAO;YAChB,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC;YAC1C,OAAO,EAAE,QAAQ;YACjB,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC;YACxC,QAAQ,EAAE,IAAI,CAAC,KAAK;SACrB,CAAC,CAAC;QACH,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;YAChB,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,mBAAmB,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACjF,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC;QAC3C,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,CAAC;QACtD,OAAO;QACP,WAAW;QACX,IAAI,EAAE,SAAS;QACf,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,QAAQ;KACT,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;QACR,OAAO;QACP,WAAW;QACX,SAAS;QACT,QAAQ;QACR,YAAY;QACZ,UAAU;QACV,QAAQ;QACR,WAAW;QACX,YAAY;QACZ,YAAY,EAAE,QAAQ,CAAC,EAAE;QACzB,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;KAC/D,CAAC,CAAC;AACL,CAAC;AAED,gFAAgF;AAEhF,MAAM,UAAU,cAAc,CAAC,SAAiB;IAC9C,OAAO,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,mBAAmB,CAAC,CAAC;AAC1D,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,SAAiB,EACjB,GAAkB;IAElB,IAAI,CAAC;QACH,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5D,cAAc,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtE,OAAO,EAAE,CAAC,SAAS,CAAC,CAAC;IACvB,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,GAAG,CACR,IAAI,KAAK,CAAC,8BAA8B,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CACtF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,yEAAyE;AACzE,OAAO,EAAE,iBAAiB,EAAE,CAAC"}

package/dist/consolidate/clocks.d.ts

@@ -0,0 +1,15 @@
+import { type DerivesFromEdge } from "../curation/edges.js";
+export type DueReason = "backstop" | "decay" | "event";
+export interface DueEdge {
+    fromPath: string;
+    toPath: string;
+    strength: number;
+    reason: DueReason;
+}
+export declare function decayBackstopDue(edges: DerivesFromEdge[], now: Date): DueEdge[];
+export declare function eventDue(changedPaths: string[], edges: DerivesFromEdge[]): DueEdge[];
+export declare function birthQueue(docs: Array<{
+    relPath: string;
+    content: string;
+}>, birthProcessed: Record<string, string>): string[];
+//# sourceMappingURL=clocks.d.ts.map

package/dist/consolidate/clocks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clocks.d.ts","sourceRoot":"","sources":["../../src/consolidate/clocks.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,KAAK,eAAe,EAAc,MAAM,sBAAsB,CAAC;AAQxE,MAAM,MAAM,SAAS,GAAG,UAAU,GAAG,OAAO,GAAG,OAAO,CAAC;AACvD,MAAM,WAAW,OAAO;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,SAAS,CAAC;CACnB;AAUD,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,GAAG,EAAE,IAAI,GAAG,OAAO,EAAE,CAsB/E;AAqBD,wBAAgB,QAAQ,CAAC,YAAY,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,OAAO,EAAE,CAmDpF;AAKD,wBAAgB,UAAU,CACxB,IAAI,EAAE,KAAK,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,EACjD,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GACrC,MAAM,EAAE,CAIV"}

package/dist/consolidate/clocks.js

@@ -0,0 +1,127 @@
+// The three session-start clocks (spec §3.1), as pure functions over injected
+// edges/docs — no I/O, so they are exhaustively testable with a fixed `now`.
+// The I/O wrapper that feeds them is runConsolidate (index.ts).
+//
+// NOTE (Stage 1 scope): the decay clock keys off edge aged-strength only. The
+// spec's TTL-on-docs input (`ttl_days` frontmatter feeding the same clock) is
+// deferred to a later stage; it is additive and does not change the edge math.
+import { EDGE_K_CAP } from "../curation/edges.js";
+import { CONSOLIDATE_MAX_INTERVAL_DAYS, CONSOLIDATE_PATH_STRENGTH_FLOOR, reviewIntervalDays, } from "./constants.js";
+import { docContentHash } from "./state.js";
+const MS_PER_DAY = 86_400_000;
+function daysBetween(thenISO, now) {
+    return (now.getTime() - new Date(thenISO).getTime()) / MS_PER_DAY;
+}
+// Decay + backstop clocks. Backstop dominates (it is the guarantee): an edge past
+// the max-interval cap is backstop-overdue regardless of strength; otherwise an
+// edge past its strength-scaled review interval is decay-due.
+export function decayBackstopDue(edges, now) {
+    const out = [];
+    for (const e of edges) {
+        if (e.status === "revoked")
+            continue;
+        // Direction-unconfirmed edges are not trusted to bear triggers (spec §3.4);
+        // they stay visible as undirected relationships but never become due.
+        if (e.directionVerdict === "symmetric")
+            continue;
+        // Clamp at 0: a future-dated lastRederived (clock skew) yields a negative age;
+        // either way such an edge is fresh, not due (consistent with priority.ts ageOf).
+        const age = Math.max(0, daysBetween(e.lastRederived, now));
+        if (age >= CONSOLIDATE_MAX_INTERVAL_DAYS) {
+            out.push({
+                fromPath: e.fromPath,
+                toPath: e.toPath,
+                strength: e.strength,
+                reason: "backstop",
+            });
+        }
+        else if (age >= reviewIntervalDays(e.strength)) {
+            out.push({ fromPath: e.fromPath, toPath: e.toPath, strength: e.strength, reason: "decay" });
+        }
+    }
+    return out;
+}
+const edgeKey = (from, to) => `${from}\n${to}`;
+// Event clock: forward walk from changed premises over derives_from edges. An
+// edge (from → to) means `from` depends on `to`; a changed `to` makes `from` due.
+//
+// Attenuation: edge `strength` is the aged value in [0, EDGE_K_CAP] (k·decay), so
+// a strong edge has strength > 1 — multiplying raw strengths would *amplify* the
+// signal and never hit the floor. We normalize each hop to a factor in [0,1]
+// (strength / EDGE_K_CAP): a fully-earned edge passes the change-signal undimmed,
+// a weak/aged edge attenuates it. Reach = ∏(factors); a path stops below the
+// floor (spec §3.1, C-Q2).
+//
+// Max-product relaxation: a node can be reached by several paths with different
+// products. We keep the BEST (largest) product per node and re-expand when a
+// strictly larger product arrives — a plain visited-on-first-touch guard would
+// prune a node's descendants using whatever (possibly weaker) path reached it
+// first, which is order-dependent and wrongly drops reachable edges. Dedup is by
+// the full edge (from,to): two distinct edges sharing a `from` (a←b and a←c) are
+// separate review units (§4) and must both surface.
+export function eventDue(changedPaths, edges) {
+    const byPremise = new Map();
+    for (const e of edges) {
+        if (e.status === "revoked")
+            continue;
+        // Direction-unconfirmed edges don't propagate change signals (spec §3.4):
+        // we can't trust which endpoint is the premise, so a change on either side
+        // must not fabricate a due dependent.
+        if (e.directionVerdict === "symmetric")
+            continue;
+        const list = byPremise.get(e.toPath) ?? [];
+        list.push(e);
+        byPremise.set(e.toPath, list);
+    }
+    const due = new Map();
+    const bestProduct = new Map();
+    const queue = [];
+    for (const p of changedPaths) {
+        if ((bestProduct.get(p) ?? -1) < 1) {
+            bestProduct.set(p, 1);
+            queue.push({ path: p, product: 1 });
+        }
+    }
+    // Hard stop: products only decrease (factors ≤ 1) and we re-enqueue only on
+    // strict improvement, so this converges; the cap is a defensive backstop.
+    const maxExpansions = edges.length * edges.length + edges.length + changedPaths.length + 16;
+    let head = 0;
+    let expansions = 0;
+    while (head < queue.length && expansions < maxExpansions) {
+        const item = queue[head++];
+        if (!item)
+            break;
+        expansions += 1;
+        if (item.product < (bestProduct.get(item.path) ?? 0))
+            continue; // stale entry
+        for (const e of byPremise.get(item.path) ?? []) {
+            const factor = Math.min(Math.max(e.strength / EDGE_K_CAP, 0), 1);
+            const carried = item.product * factor;
+            if (carried < CONSOLIDATE_PATH_STRENGTH_FLOOR)
+                continue; // signal faded
+            const key = edgeKey(e.fromPath, e.toPath);
+            if (!due.has(key)) {
+                due.set(key, {
+                    fromPath: e.fromPath,
+                    toPath: e.toPath,
+                    strength: e.strength,
+                    reason: "event",
+                });
+            }
+            if (carried > (bestProduct.get(e.fromPath) ?? 0)) {
+                bestProduct.set(e.fromPath, carried);
+                queue.push({ path: e.fromPath, product: carried });
+            }
+        }
+    }
+    return [...due.values()];
+}
+// Birth queue: docs never processed, or whose content changed since (edited ⇒
+// re-birth, spec §4.0). Stage 1 only computes this; it never marks anything
+// processed (no births are executed — that is Stage 2).
+export function birthQueue(docs, birthProcessed) {
+    return docs
+        .filter((d) => birthProcessed[d.relPath] !== docContentHash(d.content))
+        .map((d) => d.relPath);
+}
+//# sourceMappingURL=clocks.js.map

package/dist/consolidate/clocks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clocks.js","sourceRoot":"","sources":["../../src/consolidate/clocks.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,6EAA6E;AAC7E,gEAAgE;AAChE,EAAE;AACF,8EAA8E;AAC9E,8EAA8E;AAC9E,+EAA+E;AAE/E,OAAO,EAAwB,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACxE,OAAO,EACL,6BAA6B,EAC7B,+BAA+B,EAC/B,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAU5C,MAAM,UAAU,GAAG,UAAU,CAAC;AAC9B,SAAS,WAAW,CAAC,OAAe,EAAE,GAAS;IAC7C,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,UAAU,CAAC;AACpE,CAAC;AAED,kFAAkF;AAClF,gFAAgF;AAChF,8DAA8D;AAC9D,MAAM,UAAU,gBAAgB,CAAC,KAAwB,EAAE,GAAS;IAClE,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QACrC,4EAA4E;QAC5E,sEAAsE;QACtE,IAAI,CAAC,CAAC,gBAAgB,KAAK,WAAW;YAAE,SAAS;QACjD,+EAA+E;QAC/E,iFAAiF;QACjF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,GAAG,IAAI,6BAA6B,EAAE,CAAC;YACzC,GAAG,CAAC,IAAI,CAAC;gBACP,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,MAAM,EAAE,UAAU;aACnB,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,GAAG,IAAI,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjD,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,EAAE,CAAC,GAAG,IAAI,KAAK,EAAE,EAAE,CAAC;AAE/D,8EAA8E;AAC9E,kFAAkF;AAClF,EAAE;AACF,kFAAkF;AAClF,iFAAiF;AACjF,6EAA6E;AAC7E,kFAAkF;AAClF,6EAA6E;AAC7E,2BAA2B;AAC3B,EAAE;AACF,gFAAgF;AAChF,6EAA6E;AAC7E,+EAA+E;AAC/E,8EAA8E;AAC9E,iFAAiF;AACjF,iFAAiF;AACjF,oDAAoD;AACpD,MAAM,UAAU,QAAQ,CAAC,YAAsB,EAAE,KAAwB;IACvE,MAAM,SAAS,GAAG,IAAI,GAAG,EAA6B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QACrC,0EAA0E;QAC1E,2EAA2E;QAC3E,sCAAsC;QACtC,IAAI,CAAC,CAAC,gBAAgB,KAAK,WAAW;YAAE,SAAS;QACjD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAmB,CAAC;IACvC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,MAAM,KAAK,GAA6C,EAAE,CAAC;IAC3D,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,0EAA0E;IAC1E,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,GAAG,EAAE,CAAC;IAC5F,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,IAAI,UAAU,GAAG,aAAa,EAAE,CAAC;QACzD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,UAAU,IAAI,CAAC,CAAC;QAChB,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAE,SAAS,CAAC,cAAc;QAC9E,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,GAAG,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;YACtC,IAAI,OAAO,GAAG,+BAA+B;gBAAE,SAAS,CAAC,eAAe;YACxE,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;oBACX,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,MAAM,EAAE,OAAO;iBAChB,CAAC,CAAC;YACL,CAAC;YACD,IAAI,OAAO,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACjD,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBACrC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AAC3B,CAAC;AAED,8EAA8E;AAC9E,4EAA4E;AAC5E,wDAAwD;AACxD,MAAM,UAAU,UAAU,CACxB,IAAiD,EACjD,cAAsC;IAEtC,OAAO,IAAI;SACR,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;SACtE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;AAC3B,CAAC"}

package/dist/consolidate/constants.d.ts

@@ -0,0 +1,26 @@
+export declare const CONSOLIDATE_MIN_INTERVAL_DAYS = 1;
+export declare const CONSOLIDATE_MAX_INTERVAL_DAYS = 90;
+export declare function reviewIntervalDays(strength: number): number;
+export declare const CONSOLIDATE_PATH_STRENGTH_FLOOR = 0.1;
+export declare const CONSOLIDATE_SLICE_FRACTIONS: {
+    readonly backstop: 0.25;
+    readonly main: 0.45;
+    readonly periphery: 0.15;
+    readonly birth: 0.15;
+};
+export declare const CONSOLIDATE_DEFAULT_BUDGET = 50;
+export declare const CONSOLIDATE_PANEL_SIZE = 2;
+export declare const CONSOLIDATE_BIRTH_TOP_K = 20;
+export declare const CONSOLIDATE_DEFAULT_MODEL = "claude-haiku-4-5-20251001";
+export declare const CONSOLIDATE_AGENT = "agent:curation-loop";
+export declare const CONSOLIDATE_PROMPT_TEMPLATES: readonly ["forward", "reverse", "contrast"];
+export type ConsolidatePromptTemplate = (typeof CONSOLIDATE_PROMPT_TEMPLATES)[number];
+export declare const CONSOLIDATE_DECORRELATION_MIN_LIFT = 0.05;
+export declare const CONSOLIDATE_DIRECTION_MIN_ACCURACY = 0.85;
+export declare const CONSOLIDATE_PRICING_PER_MTOKEN: Record<string, {
+    input: number;
+    output: number;
+}>;
+export declare function isModelPriced(model: string): boolean;
+export declare function estimateCostUSD(model: string, inputTokens: number, outputTokens: number): number;
+//# sourceMappingURL=constants.d.ts.map

package/dist/consolidate/constants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../../src/consolidate/constants.ts"],"names":[],"mappings":"AAOA,eAAO,MAAM,6BAA6B,IAAI,CAAC;AAC/C,eAAO,MAAM,6BAA6B,KAAK,CAAC;AAEhD,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAG3D;AAID,eAAO,MAAM,+BAA+B,MAAM,CAAC;AAKnD,eAAO,MAAM,2BAA2B;;;;;CAK9B,CAAC;AAIX,eAAO,MAAM,0BAA0B,KAAK,CAAC;AAM7C,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAIxC,eAAO,MAAM,uBAAuB,KAAK,CAAC;AAK1C,eAAO,MAAM,yBAAyB,8BAA8B,CAAC;AAMrE,eAAO,MAAM,iBAAiB,wBAAwB,CAAC;AAOvD,eAAO,MAAM,4BAA4B,6CAA8C,CAAC;AACxF,MAAM,MAAM,yBAAyB,GAAG,CAAC,OAAO,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC;AAOtF,eAAO,MAAM,kCAAkC,OAAO,CAAC;AAKvD,eAAO,MAAM,kCAAkC,OAAO,CAAC;AAQvD,eAAO,MAAM,8BAA8B,EAAE,MAAM,CAAC,MAAM,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAI5F,CAAC;AAGF,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAEpD;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAQhG"}

package/dist/consolidate/constants.js

@@ -0,0 +1,83 @@
+// Provisional scheduler constants. EVERY value here is a calibration target
+// (spec §10 — calibrate from shadow data); the loop runs on these placeholders
+// until Stage 5. Single-sourced + exported so calibration has one home, mirroring
+// EDGE_* / SHADOW_* in the curation layer.
+// Review interval f(aged strength): MIN · 2^strength, hard-capped by MAX (the
+// max-interval backstop — nothing rests longer than this without re-derivation).
+export const CONSOLIDATE_MIN_INTERVAL_DAYS = 1;
+export const CONSOLIDATE_MAX_INTERVAL_DAYS = 90; // aligns with EDGE_HALF_LIFE_DAYS
+export function reviewIntervalDays(strength) {
+    const grown = CONSOLIDATE_MIN_INTERVAL_DAYS * 2 ** Math.max(0, strength);
+    return Math.min(grown, CONSOLIDATE_MAX_INTERVAL_DAYS);
+}
+// Event-blast attenuation: a forward path's reach = ∏(edge strengths); it stops
+// where the product drops below this floor (spec §3.1, C-Q2).
+export const CONSOLIDATE_PATH_STRENGTH_FLOOR = 0.1;
+// Compute-budget partition (spec §3.3). Fractions of the per-session budget.
+// backstop is GUARANTEED; periphery is blast-blind fairness; birth is one-time
+// cold-start population. Provisional — tuned against B coverage metrics (§6.2).
+export const CONSOLIDATE_SLICE_FRACTIONS = {
+    backstop: 0.25,
+    main: 0.45,
+    periphery: 0.15,
+    birth: 0.15,
+};
+// Stage 1 has no LLM calls, so "budget" = max queue items emitted per session.
+// With Component A (Stage 2) this becomes the re-derivation-call cap.
+export const CONSOLIDATE_DEFAULT_BUDGET = 50;
+// --- Stage 2 (Component A) ----------------------------------------------------
+// Panel size M: votes cast per due edge per session (spec §4.1, brief item 2).
+// Starting M=2 — provisional, TBD — calibrate from shadow data.
+export const CONSOLIDATE_PANEL_SIZE = 2;
+// Birth-mode neighbor retrieval: top-K embedding neighbors per unprocessed doc
+// (spec §4.0). 20 = the K in the §10.2 recall@20 kill condition.
+export const CONSOLIDATE_BIRTH_TOP_K = 20;
+// Default LLM model for re-derivation. Haiku 4.5 — cheapest tier where the
+// task is "detect derivation," not "subtle reasoning." Override via the
+// DAFTARI_CONSOLIDATE_MODEL env var when calibrating against bigger models.
+export const CONSOLIDATE_DEFAULT_MODEL = "claude-haiku-4-5-20251001";
+// The agent principal Stage 2 attributes its writes to (spec §8). The server
+// is started as `--user agent:curation-loop --role curation-loop`; this string
+// is the free-text `agent` claim on edge_observe/contest (the authenticated
+// principal is recorded separately by the shadow path).
+export const CONSOLIDATE_AGENT = "agent:curation-loop";
+// Prompt-framing axis (v1 = the only varied axis, see brief item 3). Three
+// deterministic templates that re-derive the same edge claim from different
+// directions. Each template is independent of the others by *framing*, not
+// by model or input — whether that is enough to decorrelate votes is the
+// load-bearing question the decorrelation report (brief item 8) decides.
+export const CONSOLIDATE_PROMPT_TEMPLATES = ["forward", "reverse", "contrast"];
+// Decorrelation lift (brief item 8 / spec §10.2). `majority_accuracy −
+// max(single_vote_accuracy)`. Retained as an informational metric: under the
+// foundational-ordering prompt (which replaced the prompt-framing axes) the
+// axes send an identical deterministic prompt, so lift is ~0 by construction —
+// confirming the axes no longer decorrelate, the verdict doc's conclusion.
+export const CONSOLIDATE_DECORRELATION_MIN_LIFT = 0.05;
+// The report's PASS gate is now ACCURACY, not lift (spec §5 — it measures the
+// foundational prompt's direction-recovery accuracy on the fixture). Matches the
+// real-prose gate's 85% directional kill condition.
+export const CONSOLIDATE_DIRECTION_MIN_ACCURACY = 0.85;
+// LLM pricing — USD per million tokens, current as of 2026-06-16 for
+// claude-haiku-4-5-20251001. VERIFY against current pricing before reading the
+// cost-USD figure as gospel; this table is a recoverable mistake (the raw
+// token counts ARE logged into the shadow journal, so historical sessions can
+// be re-costed when prices move). Override per-model via the table; unknown
+// models fall back to Haiku pricing with a flag in the report.
+export const CONSOLIDATE_PRICING_PER_MTOKEN = {
+    "claude-haiku-4-5-20251001": { input: 1.0, output: 5.0 },
+    "claude-sonnet-4-6": { input: 3.0, output: 15.0 },
+    "claude-opus-4-8": { input: 15.0, output: 75.0 },
+};
+// True when the model has its own pricing row (vs falling back to Haiku rates).
+export function isModelPriced(model) {
+    return Object.hasOwn(CONSOLIDATE_PRICING_PER_MTOKEN, model);
+}
+export function estimateCostUSD(model, inputTokens, outputTokens) {
+    const p = CONSOLIDATE_PRICING_PER_MTOKEN[model] ??
+        CONSOLIDATE_PRICING_PER_MTOKEN["claude-haiku-4-5-20251001"];
+    // Clamp negatives: a bad token count must not produce a negative "cost".
+    const inTok = Math.max(0, inputTokens);
+    const outTok = Math.max(0, outputTokens);
+    return (inTok * p.input + outTok * p.output) / 1_000_000;
+}
+//# sourceMappingURL=constants.js.map

package/dist/consolidate/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.js","sourceRoot":"","sources":["../../src/consolidate/constants.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,+EAA+E;AAC/E,kFAAkF;AAClF,2CAA2C;AAE3C,8EAA8E;AAC9E,iFAAiF;AACjF,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,CAAC;AAC/C,MAAM,CAAC,MAAM,6BAA6B,GAAG,EAAE,CAAC,CAAC,kCAAkC;AAEnF,MAAM,UAAU,kBAAkB,CAAC,QAAgB;IACjD,MAAM,KAAK,GAAG,6BAA6B,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACzE,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,6BAA6B,CAAC,CAAC;AACxD,CAAC;AAED,gFAAgF;AAChF,8DAA8D;AAC9D,MAAM,CAAC,MAAM,+BAA+B,GAAG,GAAG,CAAC;AAEnD,6EAA6E;AAC7E,+EAA+E;AAC/E,gFAAgF;AAChF,MAAM,CAAC,MAAM,2BAA2B,GAAG;IACzC,QAAQ,EAAE,IAAI;IACd,IAAI,EAAE,IAAI;IACV,SAAS,EAAE,IAAI;IACf,KAAK,EAAE,IAAI;CACH,CAAC;AAEX,+EAA+E;AAC/E,sEAAsE;AACtE,MAAM,CAAC,MAAM,0BAA0B,GAAG,EAAE,CAAC;AAE7C,iFAAiF;AAEjF,+EAA+E;AAC/E,gEAAgE;AAChE,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAExC,+EAA+E;AAC/E,iEAAiE;AACjE,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAE1C,2EAA2E;AAC3E,wEAAwE;AACxE,4EAA4E;AAC5E,MAAM,CAAC,MAAM,yBAAyB,GAAG,2BAA2B,CAAC;AAErE,6EAA6E;AAC7E,+EAA+E;AAC/E,4EAA4E;AAC5E,wDAAwD;AACxD,MAAM,CAAC,MAAM,iBAAiB,GAAG,qBAAqB,CAAC;AAEvD,2EAA2E;AAC3E,4EAA4E;AAC5E,2EAA2E;AAC3E,yEAAyE;AACzE,yEAAyE;AACzE,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAU,CAAC;AAGxF,uEAAuE;AACvE,6EAA6E;AAC7E,4EAA4E;AAC5E,+EAA+E;AAC/E,2EAA2E;AAC3E,MAAM,CAAC,MAAM,kCAAkC,GAAG,IAAI,CAAC;AAEvD,8EAA8E;AAC9E,iFAAiF;AACjF,oDAAoD;AACpD,MAAM,CAAC,MAAM,kCAAkC,GAAG,IAAI,CAAC;AAEvD,qEAAqE;AACrE,+EAA+E;AAC/E,0EAA0E;AAC1E,8EAA8E;AAC9E,4EAA4E;AAC5E,+DAA+D;AAC/D,MAAM,CAAC,MAAM,8BAA8B,GAAsD;IAC/F,2BAA2B,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;IACxD,mBAAmB,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;IACjD,iBAAiB,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE;CACjD,CAAC;AAEF,gFAAgF;AAChF,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,OAAO,MAAM,CAAC,MAAM,CAAC,8BAA8B,EAAE,KAAK,CAAC,CAAC;AAC9D,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAa,EAAE,WAAmB,EAAE,YAAoB;IACtF,MAAM,CAAC,GACL,8BAA8B,CAAC,KAAK,CAAC;QACrC,8BAA8B,CAAC,2BAA2B,CAAC,CAAC;IAC9D,yEAAyE;IACzE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;IACzC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;AAC3D,CAAC"}