nodedex 0.1.0

package/dist/middleware/reflect/inline-dedup.js

@@ -0,0 +1,131 @@
+// ═══════════════════════════════════════════════════════════════════════════════
+// INLINE DEDUP — recognize-before-write (run dedup BEFORE Pass 4 links)
+// ═══════════════════════════════════════════════════════════════════════════════
+//
+// DO:    For each block this turn just wrote (Pass 3, still status='pending'),
+//        find a same-scope existing block that is the SAME claim (exact /
+//        token-overlap / drift-embedding), flag it, and run the universal
+//        flag-reviewer so a confirmed duplicate is MERGED — all BEFORE Pass 4
+//        gets a chance to wire a relation between the pair.
+//
+// SERVE: compounding. One piece of residue should be ONE block. A dead_end the
+//        agent reached once, restated (reworded) in a later turn, must collapse
+//        to a single block — not accrete near-copies that bury each other and
+//        erode the agent's trust in the graph.
+//
+// CARRY: this exists at THIS seam (pre-Pass-4) for one reason. The async AUDIT
+//        already detects + the reviewer already merges — but the AUDIT runs
+//        AFTER Pass 4, and Pass 4 wires `extends` between a block and its own
+//        restatement. The reviewer then correctly reads `extends` as
+//        "elaboration, keep both" and LEAVES the pair. Running the SAME detection
+//        + the SAME reviewer one step EARLIER (before the linker) means the
+//        reviewer judges the pair on content, with no spurious edge in the way.
+//        The async AUDIT stays as the cross-SESSION backstop + healer.
+//
+// REUSE (no new logic, no new prompt):
+//   - judgeBlockDupPair / toAuditBlock / blockDupJudgeOpts / the idempotency
+//     helpers  ← stage-audit-graph.ts (the ONE detection implementation)
+//   - writePipelineFlag                                  ← pipeline-flags.ts
+//   - runFlagReviewerTick + executeMerge (edge-union)    ← flag-reviewer.ts
+//
+// Containment: gated behind NODEDEX_INLINE_DEDUP (default OFF). The reviewer's
+// executeMerge ARCHIVES the loser (recoverable, charter Rule 2 — never deletes)
+// and UNIONS its edges onto the survivor (a block can belong to many chains:
+// "write once, belong to many" — merging must not cost connections).
+import { writePipelineFlag } from "./pipeline-flags.js";
+import { runFlagReviewerTick } from "./flag-reviewer.js";
+import { toAuditBlock, judgeBlockDupPair, blockDupJudgeOpts, hasSupersedesBetween, flagAlreadyExists, sharedConceptCount, } from "./stage-audit-graph.js";
+/** Gate. Default OFF — the inline merge only runs when explicitly opted in. */
+export function inlineDedupEnabled() {
+    return (process.env.NODEDEX_INLINE_DEDUP ?? "").toLowerCase() === "on";
+}
+/**
+ * Dedup this turn's new blocks against the existing graph, BEFORE Pass 4 links.
+ *
+ * @param newBlockIds  the ids Pass 3 just created (still status='pending').
+ * @returns which of those ids the reviewer merged away (archived) — the caller
+ *          drops them from the pending set so they never reach Pass 4 / Pass 5.
+ */
+export async function dedupNewBlocksInline(db, provider, newBlockIds) {
+    const mergedAway = new Set();
+    const mergedAwayLabels = new Set();
+    if (newBlockIds.length === 0)
+        return { flagsWritten: 0, merges: 0, routed: 0, mergedAway, mergedAwayLabels };
+    const raw = db.db;
+    const opts = blockDupJudgeOpts();
+    // Snapshot the graph ONCE (pre-merge). getAllBlocks excludes archived. byId
+    // also lets us recover a merged-away loser's label after it is archived.
+    const all = db.getAllBlocks().map(toAuditBlock);
+    const byId = new Map(all.map((b) => [b.id, b]));
+    const newSet = new Set(newBlockIds);
+    let flagsWritten = 0;
+    for (const nid of newBlockIds) {
+        const a = byId.get(nid);
+        // Unscoped blocks can't be safely deduped — same-scope is the merge guard.
+        if (!a || a.project_id == null)
+            continue;
+        for (const b of all) {
+            if (b.id === a.id)
+                continue;
+            // A new-vs-new pair would otherwise be judged twice (a→b and b→a); let the
+            // lower id initiate it once. (flagAlreadyExists is the real backstop; this
+            // just avoids redundant work.) Existing(b) blocks are always judged.
+            if (newSet.has(b.id) && b.id < a.id)
+                continue;
+            if (b.project_id !== a.project_id)
+                continue; // cheap same-scope pre-filter
+            const v = judgeBlockDupPair(a, b, opts);
+            if (!v.isCandidate)
+                continue;
+            if (hasSupersedesBetween(raw, a.id, b.id))
+                continue;
+            if (flagAlreadyExists(raw, "block_dup_candidate", a.id, b.id))
+                continue;
+            writePipelineFlag(raw, {
+                flag_type: "block_dup_candidate",
+                block_id_a: a.id,
+                block_id_b: b.id,
+                criteria: {
+                    signal: v.signal,
+                    claim_tokens: v.claimTokens,
+                    embed_sim: v.signal === "essence_embedding" ? Number(v.embedSim.toFixed(3)) : undefined,
+                    shared_concepts: sharedConceptCount(a.concepts, b.concepts),
+                    primary_value: a.primary_value.slice(0, 200),
+                    scope: a.project_id,
+                    type_a: a.type, type_b: b.type,
+                    label_a: a.label, label_b: b.label,
+                },
+                scope_check: "same",
+                origin_writer: "inline_dedup",
+                origin_range_id: null,
+            });
+            flagsWritten += 1;
+        }
+    }
+    if (flagsWritten === 0)
+        return { flagsWritten: 0, merges: 0, routed: 0, mergedAway, mergedAwayLabels };
+    // REUSE the universal reviewer + executeMerge. forceAutoMerge: TRUE — inline
+    // dedup's whole purpose is to MERGE before Pass 4; a verdict-only pass would
+    // leave the block to enter Pass 4 and acquire the very `extends` edge this
+    // seam exists to prevent. Contained: gated (default off), archives (never
+    // deletes), and only fires on a high-confidence merge verdict. Single tick
+    // (reviewer batch default 5): a turn producing >5 dups leans on the async
+    // AUDIT backstop for the remainder.
+    const tick = await runFlagReviewerTick({ db, provider, forceAutoMerge: true });
+    // Which NEW blocks did the reviewer archive? getAllBlocks excludes archived,
+    // so a new id absent from the post-merge snapshot was merged away. NOTE: a merge
+    // may instead archive the EXISTING block (keeping the new one as winner) — that
+    // is still a real merge but won't appear in mergedAway, so the honest merge count
+    // comes from the reviewer tick (tick.actions_executed), not mergedAway.size.
+    const liveIds = new Set(db.getAllBlocks().map((b) => b.id));
+    for (const nid of newBlockIds) {
+        if (!liveIds.has(nid)) {
+            mergedAway.add(nid);
+            const lbl = byId.get(nid)?.label;
+            if (lbl)
+                mergedAwayLabels.add(lbl);
+        }
+    }
+    return { flagsWritten, merges: tick.actions_executed, routed: tick.routed_to_agent, mergedAway, mergedAwayLabels };
+}
+//# sourceMappingURL=inline-dedup.js.map

package/dist/middleware/reflect/inline-dedup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inline-dedup.js","sourceRoot":"","sources":["../../../src/middleware/reflect/inline-dedup.ts"],"names":[],"mappings":"AAAA,kFAAkF;AAClF,wEAAwE;AACxE,kFAAkF;AAClF,EAAE;AACF,+EAA+E;AAC/E,0EAA0E;AAC1E,0EAA0E;AAC1E,8EAA8E;AAC9E,4DAA4D;AAC5D,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,8EAA8E;AAC9E,+CAA+C;AAC/C,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,8EAA8E;AAC9E,qEAAqE;AACrE,kFAAkF;AAClF,4EAA4E;AAC5E,gFAAgF;AAChF,uEAAuE;AACvE,EAAE;AACF,uCAAuC;AACvC,6EAA6E;AAC7E,yEAAyE;AACzE,6EAA6E;AAC7E,4EAA4E;AAC5E,EAAE;AACF,+EAA+E;AAC/E,gFAAgF;AAChF,6EAA6E;AAC7E,qEAAqE;AAKrE,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EACL,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,EACjB,kBAAkB,GACnB,MAAM,wBAAwB,CAAC;AAEhC,+EAA+E;AAC/E,MAAM,UAAU,kBAAkB;IAChC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,oBAAoB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC;AACzE,CAAC;AAgBD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,EAAe,EACf,QAAqB,EACrB,WAAqB;IAErB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,gBAAgB,EAAE,CAAC;IAE7G,MAAM,GAAG,GAAI,EAAU,CAAC,EAAuB,CAAC;IAChD,MAAM,IAAI,GAAG,iBAAiB,EAAE,CAAC;IACjC,4EAA4E;IAC5E,yEAAyE;IACzE,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IAEpC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxB,2EAA2E;QAC3E,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,IAAI;YAAE,SAAS;QACzC,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;gBAAE,SAAS;YAC5B,2EAA2E;YAC3E,2EAA2E;YAC3E,qEAAqE;YACrE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;gBAAE,SAAS;YAC9C,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;gBAAE,SAAS,CAAC,8BAA8B;YAC3E,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,CAAC,CAAC,WAAW;gBAAE,SAAS;YAC7B,IAAI,oBAAoB,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YACpD,IAAI,iBAAiB,CAAC,GAAG,EAAE,qBAAqB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YACxE,iBAAiB,CAAC,GAAG,EAAE;gBACrB,SAAS,EAAE,qBAAqB;gBAChC,UAAU,EAAE,CAAC,CAAC,EAAE;gBAChB,UAAU,EAAE,CAAC,CAAC,EAAE;gBAChB,QAAQ,EAAE;oBACR,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,YAAY,EAAE,CAAC,CAAC,WAAW;oBAC3B,SAAS,EAAE,CAAC,CAAC,MAAM,KAAK,mBAAmB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;oBACvF,eAAe,EAAE,kBAAkB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC;oBAC3D,aAAa,EAAE,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC5C,KAAK,EAAE,CAAC,CAAC,UAAU;oBACnB,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI;oBAC9B,OAAO,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,KAAK;iBACnC;gBACD,WAAW,EAAE,MAAM;gBACnB,aAAa,EAAE,cAAc;gBAC7B,eAAe,EAAE,IAAI;aACtB,CAAC,CAAC;YACH,YAAY,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,IAAI,YAAY,KAAK,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,gBAAgB,EAAE,CAAC;IAEvG,6EAA6E;IAC7E,6EAA6E;IAC7E,2EAA2E;IAC3E,0EAA0E;IAC1E,2EAA2E;IAC3E,0EAA0E;IAC1E,oCAAoC;IACpC,MAAM,IAAI,GAAG,MAAM,mBAAmB,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC;IAE/E,6EAA6E;IAC7E,iFAAiF;IACjF,gFAAgF;IAChF,kFAAkF;IAClF,6EAA6E;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;YACjC,IAAI,GAAG;gBAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,gBAAgB,EAAE,MAAM,EAAE,IAAI,CAAC,eAAe,EAAE,UAAU,EAAE,gBAAgB,EAAE,CAAC;AACrH,CAAC"}

package/dist/middleware/reflect/justify-decisions.d.ts

@@ -0,0 +1,37 @@
+import type { LLMProvider } from "../../engine/ai-provider.js";
+import type { Pass2Item } from "./types.js";
+export declare function v2JustifyEnabled(): boolean;
+/** Types that must rest on a based_on edge when they ground out of a finding.
+ *  decision REQUIRES one (block-types.md). hypothesis / insight require one WHEN
+ *  they rest on a finding (COMPREHEND STEP 3) — the detector flags every empty one
+ *  and lets REPAIR return empty for the genuinely-self-standing ones (precision is
+ *  the LLM's job, not the filter's). preference is excluded on purpose: it extends
+ *  decision, and a standing lean is actionable without an evidence trail. */
+export declare const GROUNDED_TYPES: ReadonlySet<string>;
+/** Grounded-type items with NO based_on wiring. */
+export declare function findUngroundedConclusions(items: Pass2Item[]): Pass2Item[];
+export interface JustifyVerdict {
+    conclusion_id: string;
+    evidence_ids: string[];
+    reasoning: string;
+}
+/** Apply repair verdicts. Sanitizes hard: a cited id must be in the candidate
+ *  set OFFERED for that conclusion (falsifiable contract — the model can only
+ *  cite what it was shown), no self-refs, dedup, and existing links are never
+ *  overwritten (repair fills absence; it does not re-judge presence).
+ *  Mutates the matched items' based_on_items in place; returns repaired count. */
+export declare function applyJustifications(items: Pass2Item[], verdicts: JustifyVerdict[], offeredCandidates: Map<string, ReadonlySet<string>>): number;
+/** Build the one batched user input: each ungrounded conclusion + its own group's
+ *  sibling items as candidates. Returns the input text + the per-conclusion
+ *  candidate sets (the falsifiable offer applyJustifications checks against). */
+export declare function buildJustifyInput(ungrounded: Pass2Item[], items: Pass2Item[], groupByItemId?: Record<string, string>): {
+    input: string;
+    offered: Map<string, ReadonlySet<string>>;
+};
+export interface JustifyResult {
+    ran: boolean;
+    ungrounded: number;
+    repaired: number;
+}
+export declare function runJustifyConclusions(provider: LLMProvider, items: Pass2Item[], groupByItemId?: Record<string, string>): Promise<JustifyResult>;
+//# sourceMappingURL=justify-decisions.d.ts.map

package/dist/middleware/reflect/justify-decisions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"justify-decisions.d.ts","sourceRoot":"","sources":["../../../src/middleware/reflect/justify-decisions.ts"],"names":[],"mappings":"AAqCA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAG5C,wBAAgB,gBAAgB,IAAI,OAAO,CAG1C;AAID;;;;;6EAK6E;AAC7E,eAAO,MAAM,cAAc,EAAE,WAAW,CAAC,MAAM,CAAkD,CAAC;AAElG,mDAAmD;AACnD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,SAAS,EAAE,CAIzE;AAID,MAAM,WAAW,cAAc;IAC7B,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;kFAIkF;AAClF,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,SAAS,EAAE,EAClB,QAAQ,EAAE,cAAc,EAAE,EAC1B,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,GAClD,MAAM,CAiBR;AA6CD;;iFAEiF;AACjF,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,SAAS,EAAE,EACvB,KAAK,EAAE,SAAS,EAAE,EAClB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GACrC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAA;CAAE,CAiB9D;AAID,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,OAAO,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wBAAsB,qBAAqB,CACzC,QAAQ,EAAE,WAAW,EACrB,KAAK,EAAE,SAAS,EAAE,EAClB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GACrC,OAAO,CAAC,aAAa,CAAC,CAqBxB"}

package/dist/middleware/reflect/justify-decisions.js

@@ -0,0 +1,159 @@
+// ═══════════════════════════════════════════════════════════════════════════════
+// v2 JUSTIFY — repair missing conclusion→evidence wiring (the route-back pattern)
+// ═══════════════════════════════════════════════════════════════════════════════
+//
+// THE GAP (2026-06-11 React-arc retest): COMPREHEND's prompt demands "every
+// decision needs >=1 based_on" and SEAM-1 already WARNS when one is missing
+// (comprehend.ts validateComprehendResult) — but nothing consumed the warning.
+// 7/7 decisions arrived with empty based_on_items → Pass 5 correctly assembled
+// 0 chains (no causal path reached a committed conclusion) and the decisions
+// lost their re-openable WHY. Prompt-asking is not enforcement (charter rule 4).
+//
+// GENERALIZED to all GROUNDED conclusions (2026-06-15): the same gap bites a
+// hypothesis or insight that rests on a finding — COMPREHEND STEP 3 demands their
+// based_on too. It paired with the evidence_for fix (the hypothesis observation now
+// becomes its OWN block instead of folding into an evidence_for field), so the edge
+// from conclusion → that observation must be enforced, not just asked for. DETECT now
+// covers {decision, hypothesis, insight}; preference stays excluded (it extends
+// decision — a standing lean is actionable without an evidence trail).
+//
+// THE FIX, each part at its competence (charter rule 3):
+//   DETECT (code, pure)  — grounded-type items whose based_on_items is empty,
+//                          checked on the POST-MERGE composed items.
+//   REPAIR (LLM, judgment) — ONE batched call: each ungrounded conclusion + its
+//                          OWN GROUP's sibling items; the model names which ids
+//                          actually ground it. EMPTY IS A VALID ANSWER — the
+//                          justifying evidence may be out-of-scope this session
+//                          (missing-link discipline: never fabricate).
+//   APPLY (code, pure)   — sanitize: only ids from the offered candidate list,
+//                          no self-refs, dedup, never overwrite existing links.
+//                          One attempt, no retry loop (seam-α's locked budget).
+//                          Malformed result → no-op (the pass_judge lesson:
+//                          a failed repairer must never make things worse).
+//
+// Default ON: NODEDEX_V2_JUSTIFY=0 opts out. Runs in v2-integrate after the
+// cross-group MERGE (so candidates are the surviving items) and before the
+// cross-group LINK / INTEGRATE.
+import { getThinkingBudget } from "./config.js";
+export function v2JustifyEnabled() {
+    // DEFAULT ON since 2026-06-12 (part of the validated v2 stack). =0 opts out.
+    return process.env.NODEDEX_V2_JUSTIFY !== "0";
+}
+// ─── DETECT (pure) ─────────────────────────────────────────────────────────────
+/** Types that must rest on a based_on edge when they ground out of a finding.
+ *  decision REQUIRES one (block-types.md). hypothesis / insight require one WHEN
+ *  they rest on a finding (COMPREHEND STEP 3) — the detector flags every empty one
+ *  and lets REPAIR return empty for the genuinely-self-standing ones (precision is
+ *  the LLM's job, not the filter's). preference is excluded on purpose: it extends
+ *  decision, and a standing lean is actionable without an evidence trail. */
+export const GROUNDED_TYPES = new Set(["decision", "hypothesis", "insight"]);
+/** Grounded-type items with NO based_on wiring. */
+export function findUngroundedConclusions(items) {
+    return items.filter((it) => GROUNDED_TYPES.has(it.type) && (!Array.isArray(it.based_on_items) || it.based_on_items.length === 0));
+}
+/** Apply repair verdicts. Sanitizes hard: a cited id must be in the candidate
+ *  set OFFERED for that conclusion (falsifiable contract — the model can only
+ *  cite what it was shown), no self-refs, dedup, and existing links are never
+ *  overwritten (repair fills absence; it does not re-judge presence).
+ *  Mutates the matched items' based_on_items in place; returns repaired count. */
+export function applyJustifications(items, verdicts, offeredCandidates) {
+    const byId = new Map(items.map((it) => [it.id, it]));
+    let repaired = 0;
+    for (const v of verdicts) {
+        if (!v || typeof v.conclusion_id !== "string" || !Array.isArray(v.evidence_ids))
+            continue;
+        const it = byId.get(v.conclusion_id);
+        const offered = offeredCandidates.get(v.conclusion_id);
+        if (!it || !offered)
+            continue; // only conclusions we actually asked about
+        if (Array.isArray(it.based_on_items) && it.based_on_items.length > 0)
+            continue; // never overwrite
+        const clean = [...new Set(v.evidence_ids)].filter((id) => typeof id === "string" && id !== v.conclusion_id && offered.has(id));
+        if (clean.length === 0)
+            continue; // legitimate-empty → stays unwired
+        it.based_on_items = clean;
+        repaired++;
+    }
+    return repaired;
+}
+// ─── REPAIR prompt (definitional, falsifiable, universal) ──────────────────────
+const JUSTIFY_PROMPT = `Some CONCLUSIONS extracted from a session are missing their evidence wiring — the
+link to what each one was actually reasoned from. Your job is to restore ONLY the
+links that the session itself supports.
+
+A based_on link means: the conclusion RESTS ON that block — the finding, limit,
+observation, or prior conclusion that grounds it. Remove the evidence and the
+conclusion loses its footing.
+
+For each conclusion below, read its candidate blocks (the other knowledge from the
+SAME thread of the session) and name the ids whose content grounds it.
+
+RULES:
+  - Cite ONLY ids from that conclusion's own candidate list.
+  - Nearness is not grounding: a block from the same thread that the conclusion
+    does not rest on is NOT evidence. To cite a block you must be able to state how
+    the conclusion depends on it.
+  - EMPTY is a correct answer: when the grounding evidence is not among the
+    candidates (it may live outside this session), return an empty list. Never
+    pick a "best available" block that does not actually ground the conclusion.
+  - reasoning: one line per conclusion naming HOW the cited blocks ground it (or
+    why the list is empty).`;
+const JUSTIFY_SCHEMA = {
+    type: "object",
+    properties: {
+        justifications: {
+            type: "array",
+            items: {
+                type: "object",
+                properties: {
+                    conclusion_id: { type: "string" },
+                    evidence_ids: { type: "array", items: { type: "string" } },
+                    reasoning: { type: "string" },
+                },
+                required: ["conclusion_id", "evidence_ids", "reasoning"],
+            },
+        },
+    },
+    required: ["justifications"],
+};
+/** Build the one batched user input: each ungrounded conclusion + its own group's
+ *  sibling items as candidates. Returns the input text + the per-conclusion
+ *  candidate sets (the falsifiable offer applyJustifications checks against). */
+export function buildJustifyInput(ungrounded, items, groupByItemId) {
+    const groupOf = (it) => groupByItemId?.[it.id] ?? it.id.split("::")[0] ?? "_";
+    const offered = new Map();
+    const sections = [];
+    for (const d of ungrounded) {
+        const g = groupOf(d);
+        const candidates = items.filter((it) => it.id !== d.id && groupOf(it) === g);
+        offered.set(d.id, new Set(candidates.map((c) => c.id)));
+        const candLines = candidates
+            .map((c) => `    - ${c.id} [${c.type}] ${String(c.text ?? "").slice(0, 160)}`)
+            .join("\n");
+        sections.push(`CONCLUSION ${d.id} [${d.type}]: ${String(d.text ?? "").slice(0, 200)}\n` +
+            `  CANDIDATES (this conclusion's thread):\n${candLines || "    (none)"}`);
+    }
+    return { input: sections.join("\n\n"), offered };
+}
+export async function runJustifyConclusions(provider, items, groupByItemId) {
+    if (!v2JustifyEnabled())
+        return { ran: false, ungrounded: 0, repaired: 0 };
+    const ungrounded = findUngroundedConclusions(items);
+    if (ungrounded.length === 0)
+        return { ran: false, ungrounded: 0, repaired: 0 };
+    const { input, offered } = buildJustifyInput(ungrounded, items, groupByItemId);
+    try {
+        const r = await provider.generateStructured(JUSTIFY_PROMPT, input, JUSTIFY_SCHEMA, { thinkingBudget: getThinkingBudget(1024), maxOutputTokens: 4096 });
+        // SEAM contract: a truthy result without justifications[] is malformed → no-op
+        // (a failed repairer must never make things worse).
+        const verdicts = Array.isArray(r.result?.justifications) ? r.result.justifications : [];
+        const repaired = applyJustifications(items, verdicts, offered);
+        console.log(`Auto-Reflect v2 JUSTIFY: ${ungrounded.length} ungrounded conclusion(s) → ${repaired} repaired`);
+        return { ran: true, ungrounded: ungrounded.length, repaired };
+    }
+    catch (e) {
+        console.warn(`Auto-Reflect v2 JUSTIFY failed (${e?.message ?? e}) — conclusions left as-is (already SEAM-1-warned)`);
+        return { ran: true, ungrounded: ungrounded.length, repaired: 0 };
+    }
+}
+//# sourceMappingURL=justify-decisions.js.map

package/dist/middleware/reflect/justify-decisions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"justify-decisions.js","sourceRoot":"","sources":["../../../src/middleware/reflect/justify-decisions.ts"],"names":[],"mappings":"AAAA,kFAAkF;AAClF,kFAAkF;AAClF,kFAAkF;AAClF,EAAE;AACF,4EAA4E;AAC5E,4EAA4E;AAC5E,+EAA+E;AAC/E,+EAA+E;AAC/E,6EAA6E;AAC7E,iFAAiF;AACjF,EAAE;AACF,6EAA6E;AAC7E,kFAAkF;AAClF,oFAAoF;AACpF,oFAAoF;AACpF,sFAAsF;AACtF,gFAAgF;AAChF,uEAAuE;AACvE,EAAE;AACF,yDAAyD;AACzD,8EAA8E;AAC9E,qEAAqE;AACrE,gFAAgF;AAChF,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,uEAAuE;AACvE,+EAA+E;AAC/E,gFAAgF;AAChF,gFAAgF;AAChF,4EAA4E;AAC5E,4EAA4E;AAC5E,EAAE;AACF,4EAA4E;AAC5E,2EAA2E;AAC3E,gCAAgC;AAIhC,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD,MAAM,UAAU,gBAAgB;IAC9B,6EAA6E;IAC7E,OAAO,OAAO,CAAC,GAAG,CAAC,kBAAkB,KAAK,GAAG,CAAC;AAChD,CAAC;AAED,kFAAkF;AAElF;;;;;6EAK6E;AAC7E,MAAM,CAAC,MAAM,cAAc,GAAwB,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;AAElG,mDAAmD;AACnD,MAAM,UAAU,yBAAyB,CAAC,KAAkB;IAC1D,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAAC,CAC7G,CAAC;AACJ,CAAC;AAUD;;;;kFAIkF;AAClF,MAAM,UAAU,mBAAmB,CACjC,KAAkB,EAClB,QAA0B,EAC1B,iBAAmD;IAEnD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,aAAa,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC;YAAE,SAAS;QAC1F,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QACvD,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO;YAAE,SAAS,CAAoB,2CAA2C;QAC7F,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS,CAAC,kBAAkB;QAClG,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAC/C,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,IAAI,EAAE,KAAK,CAAC,CAAC,aAAa,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAC5E,CAAC;QACF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS,CAAkB,mCAAmC;QACtF,EAAE,CAAC,cAAc,GAAG,KAAK,CAAC;QAC1B,QAAQ,EAAE,CAAC;IACb,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,kFAAkF;AAElF,MAAM,cAAc,GAAG;;;;;;;;;;;;;;;;;;;;4BAoBK,CAAC;AAE7B,MAAM,cAAc,GAAG;IACrB,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,cAAc,EAAE;YACd,IAAI,EAAE,OAAO;YACb,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,aAAa,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACjC,YAAY,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;oBAC1D,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;iBAC9B;gBACD,QAAQ,EAAE,CAAC,eAAe,EAAE,cAAc,EAAE,WAAW,CAAC;aACzD;SACF;KACF;IACD,QAAQ,EAAE,CAAC,gBAAgB,CAAC;CAC7B,CAAC;AAEF;;iFAEiF;AACjF,MAAM,UAAU,iBAAiB,CAC/B,UAAuB,EACvB,KAAkB,EAClB,aAAsC;IAEtC,MAAM,OAAO,GAAG,CAAC,EAAa,EAAE,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;IACzF,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;IACvD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,SAAS,GAAG,UAAU;aACzB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;aAC7E,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,QAAQ,CAAC,IAAI,CACX,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,MAAM,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI;YACzE,6CAA6C,SAAS,IAAI,YAAY,EAAE,CACzE,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC;AACnD,CAAC;AAUD,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,QAAqB,EACrB,KAAkB,EAClB,aAAsC;IAEtC,IAAI,CAAC,gBAAgB,EAAE;QAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAC3E,MAAM,UAAU,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAE/E,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,iBAAiB,CAAC,UAAU,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;IAC/E,IAAI,CAAC;QACH,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CACzC,cAAc,EAAE,KAAK,EAAE,cAAc,EACrC,EAAE,cAAc,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,CACnE,CAAC;QACF,+EAA+E;QAC/E,oDAAoD;QACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAO,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;QACzF,MAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC/D,OAAO,CAAC,GAAG,CAAC,4BAA4B,UAAU,CAAC,MAAM,+BAA+B,QAAQ,WAAW,CAAC,CAAC;QAC7G,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC;IAChE,CAAC;IAAC,OAAO,CAAM,EAAE,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,mCAAmC,CAAC,EAAE,OAAO,IAAI,CAAC,oDAAoD,CAAC,CAAC;QACrH,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IACnE,CAAC;AACH,CAAC"}

package/dist/middleware/reflect/nl-accept.d.ts

@@ -0,0 +1,35 @@
+import type Database from "better-sqlite3";
+import type { WorkspaceDB } from "../../store/database.js";
+import type { LLMProvider } from "../../engine/ai-provider.js";
+import type { PipelineFlag } from "./types.js";
+/** Opt-in. Default OFF — auto-mutation from parsed NL stays gated until validated. */
+export declare function nlAcceptEnabled(): boolean;
+export interface NlResolution {
+    flag_id: string;
+    verdict: "merge" | "leave" | "split" | "none";
+    winning_block_id?: string;
+    confidence: "high" | "medium" | "low";
+    quote: string;
+}
+export interface NlAcceptResult {
+    addressed: number;
+    merged: number;
+    left: number;
+    split: number;
+    skipped_low_conf: number;
+    errors: number;
+}
+/** Build the parse input: the agent's message + each open question with its two
+ *  candidate ids (the agent-facing surface hides ids; the internal parser needs
+ *  them to name a winner). */
+export declare function buildNlAcceptInput(raw: Database.Database, agentText: string, flags: PipelineFlag[]): string;
+/**
+ * Read the agent's reply, match it to its routed flags, apply the confident verdicts.
+ * Gated + work-gated + cost-aware: returns a no-op result with no LLM call when
+ * disabled or when nothing is routed. `opts.force` bypasses ONLY the enabled-gate
+ * (tests); the work-gate + safety checks always hold.
+ */
+export declare function resolveRoutedFlagsFromText(db: WorkspaceDB, provider: LLMProvider, agentText: string, opts?: {
+    force?: boolean;
+}): Promise<NlAcceptResult>;
+//# sourceMappingURL=nl-accept.d.ts.map

package/dist/middleware/reflect/nl-accept.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nl-accept.d.ts","sourceRoot":"","sources":["../../../src/middleware/reflect/nl-accept.ts"],"names":[],"mappings":"AAmBA,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAC3C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAW/C,sFAAsF;AACtF,wBAAgB,eAAe,IAAI,OAAO,CAEzC;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,MAAM,CAAC;IAC9C,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IACtC,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,gBAAgB,EAAE,MAAM,CAAC;IACzB,MAAM,EAAE,MAAM,CAAC;CAChB;AAyCD;;8BAE8B;AAC9B,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAgB3G;AAyBD;;;;;GAKG;AACH,wBAAsB,0BAA0B,CAC9C,EAAE,EAAE,WAAW,EACf,QAAQ,EAAE,WAAW,EACrB,SAAS,EAAE,MAAM,EACjB,IAAI,GAAE;IAAE,KAAK,CAAC,EAAE,OAAO,CAAA;CAAO,GAC7B,OAAO,CAAC,cAAc,CAAC,CA4CzB"}

package/dist/middleware/reflect/nl-accept.js

@@ -0,0 +1,167 @@
+// nl-accept.ts — flag-resolution part (b): apply the agent's NL decision.
+//
+// The agent is read-only and passive — it can't call a write endpoint. So when the
+// system routes a question to it (a possible-duplicate it couldn't resolve alone,
+// surfaced via workspace_stats.flags), the agent just STATES its decision in its
+// normal reply ("those two are the same — keep customer-c's"). This module reads that
+// reply, matches it back to the open flags, and applies the verdict via the shared
+// applier. Read-only-preserving: the agent never writes; the pipeline does.
+//
+// SAFETY (this is auto-mutation triggered by parsing free text):
+//   • DEFAULT OFF — NODEDEX_FLAG_NL_ACCEPT=on to enable (opt-in, per the 3-tier
+//     release model: auto-mutation stays opt-in until validated).
+//   • WORK-GATED — $0 when no flags are routed to the agent (no LLM call).
+//   • NEVER-FABRICATE — a resolution is applied only if the LLM can QUOTE the agent's
+//     own words for it AND that quote actually appears in the reply.
+//   • CONSERVATIVE MERGE — a destructive merge fires only at high confidence with a
+//     valid winner; a weak merge-lean is LEFT PENDING (explicit confirmation needed),
+//     mirroring the autonomous reviewer. leave/split are non-destructive.
+import { getAgentPendingFlags } from "./pipeline-flags.js";
+import { loadBlockSnapshot } from "./flag-reviewer.js";
+import { scopeSegmentOfLabel } from "./retrieve-graph-slice.js";
+import { renderAgentFlag } from "./render-agent-flag.js";
+import { normalizeForMatch } from "./provenance-check.js";
+import { applyFlagVerdict } from "./apply-flag-verdict.js";
+import { getThinkingBudget } from "./config.js";
+const NL_BATCH = 8; // bound the questions handed to one parse call
+/** Opt-in. Default OFF — auto-mutation from parsed NL stays gated until validated. */
+export function nlAcceptEnabled() {
+    return (process.env.NODEDEX_FLAG_NL_ACCEPT ?? "").toLowerCase() === "on";
+}
+const NL_ACCEPT_PROMPT = `You apply an agent's stated decisions about pending memory-graph questions.
+
+You are given the AGENT'S MESSAGE (free text it just wrote) and a list of OPEN QUESTIONS the system asked it. Each question is a possible-duplicate the system couldn't resolve alone: two candidate entries A and B (each with an id).
+
+For EACH open question, decide whether the agent's message EXPLICITLY answered it, and if so what it decided:
+  - "merge": the agent said the two entries are the SAME thing. Set winning_block_id to the id of the entry it wants to KEEP (must be A's id or B's id for that question).
+  - "leave": the agent said they are DIFFERENT / keep both separate.
+  - "split": the agent said keep both but something structural must change, or it needs more work.
+  - "none": the agent did NOT clearly address this question. THIS IS THE DEFAULT.
+
+HARD RULES (a wrong apply corrupts the graph — be conservative):
+  - NEVER invent a decision. If the agent did not clearly speak to a question, output "none".
+  - \`quote\` MUST be the agent's own words (a verbatim substring of its message) that express the decision. If you cannot quote them, the verdict is "none".
+  - winning_block_id must be exactly one of the two candidate ids GIVEN for that question.
+  - "high" confidence only when the agent was explicit and unambiguous.
+
+OUTPUT JSON per schema: one entry per question you were given (use "none" + empty quote for the ones the agent didn't address).`;
+const NL_ACCEPT_SCHEMA = {
+    type: "object",
+    properties: {
+        resolutions: {
+            type: "array",
+            items: {
+                type: "object",
+                properties: {
+                    flag_id: { type: "string" },
+                    verdict: { type: "string", enum: ["merge", "leave", "split", "none"] },
+                    winning_block_id: { type: "string" },
+                    confidence: { type: "string", enum: ["high", "medium", "low"] },
+                    quote: { type: "string" },
+                },
+                required: ["flag_id", "verdict", "confidence", "quote"],
+            },
+        },
+    },
+    required: ["resolutions"],
+};
+/** Build the parse input: the agent's message + each open question with its two
+ *  candidate ids (the agent-facing surface hides ids; the internal parser needs
+ *  them to name a winner). */
+export function buildNlAcceptInput(raw, agentText, flags) {
+    const sections = ["AGENT'S MESSAGE:", agentText.trim(), "", "OPEN QUESTIONS:"];
+    for (const flag of flags) {
+        const rendered = renderAgentFlag(raw, flag);
+        if (!rendered)
+            continue;
+        const a = loadBlockSnapshot(raw, flag.block_id_a);
+        const b = flag.block_id_b ? loadBlockSnapshot(raw, flag.block_id_b) : null;
+        sections.push("", `QUESTION flag_id=${flag.id}:`, `  asked: ${rendered.question}`, a ? `  Candidate A: id=${a.id} owner=${scopeSegmentOfLabel(a.label)} says="${a.primary_value || a.essence}"` : `  Candidate A: (gone)`, b ? `  Candidate B: id=${b.id} owner=${scopeSegmentOfLabel(b.label)} says="${b.primary_value || b.essence}"` : `  Candidate B: (none)`);
+    }
+    return sections.join("\n");
+}
+async function callNlAcceptLLM(provider, input) {
+    try {
+        const r = await provider.generateStructured(NL_ACCEPT_PROMPT, input, NL_ACCEPT_SCHEMA, { thinkingBudget: getThinkingBudget(1024), maxOutputTokens: 4096 });
+        return r.result ?? null;
+    }
+    catch {
+        return null;
+    }
+}
+/** The agent's quote must actually be in its message (never-fabricate anchor). */
+function quoteIsGrounded(agentText, quote) {
+    if (!quote || !quote.trim())
+        return false;
+    const nt = normalizeForMatch(agentText);
+    const nq = normalizeForMatch(quote);
+    return nq.length > 0 && nt.includes(nq);
+}
+/**
+ * Read the agent's reply, match it to its routed flags, apply the confident verdicts.
+ * Gated + work-gated + cost-aware: returns a no-op result with no LLM call when
+ * disabled or when nothing is routed. `opts.force` bypasses ONLY the enabled-gate
+ * (tests); the work-gate + safety checks always hold.
+ */
+export async function resolveRoutedFlagsFromText(db, provider, agentText, opts = {}) {
+    const result = { addressed: 0, merged: 0, left: 0, split: 0, skipped_low_conf: 0, errors: 0 };
+    if (!opts.force && !nlAcceptEnabled())
+        return result; // gate (default off)
+    if (!agentText || agentText.trim().length < 20)
+        return result;
+    const raw = db.db;
+    const flags = getAgentPendingFlags(raw, { limit: NL_BATCH });
+    if (flags.length === 0)
+        return result; // work-gate ($0)
+    const llm = await callNlAcceptLLM(provider, buildNlAcceptInput(raw, agentText, flags));
+    if (!llm || !Array.isArray(llm.resolutions)) {
+        result.errors += 1;
+        return result;
+    }
+    const flagById = new Map(flags.map((f) => [f.id, f]));
+    for (const r of llm.resolutions) {
+        const flag = flagById.get(r.flag_id);
+        if (!flag)
+            continue; // defense vs hallucinated id
+        if (r.verdict === "none")
+            continue;
+        if (!quoteIsGrounded(agentText, r.quote))
+            continue; // never-fabricate
+        result.addressed += 1;
+        if (r.verdict === "merge") {
+            const validWinner = r.winning_block_id === flag.block_id_a || r.winning_block_id === flag.block_id_b;
+            if (r.confidence === "high" && validWinner) {
+                const applied = applyFlagVerdict(db, flag, {
+                    verdict: "merge", execute: true, winning_block_id: r.winning_block_id,
+                    reason: `Agent confirmed duplicate in conversation: "${r.quote}"`,
+                });
+                if (applied.ok && applied.action_taken !== "none")
+                    result.merged += 1;
+                else
+                    result.errors += 1;
+            }
+            else {
+                // Merge-lean but weak (low/medium confidence, or winner not in the pair) —
+                // do NOT auto-archive on weak NL evidence. Leave the flag PENDING so it can
+                // be confirmed explicitly (the agent can re-state, or the user decides).
+                result.skipped_low_conf += 1;
+            }
+        }
+        else if (r.verdict === "leave" || r.verdict === "split") {
+            const applied = applyFlagVerdict(db, flag, {
+                verdict: r.verdict,
+                reason: `Agent decided in conversation: "${r.quote}"`,
+            });
+            if (applied.ok) {
+                if (r.verdict === "leave")
+                    result.left += 1;
+                else
+                    result.split += 1;
+            }
+            else
+                result.errors += 1;
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=nl-accept.js.map

package/dist/middleware/reflect/nl-accept.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nl-accept.js","sourceRoot":"","sources":["../../../src/middleware/reflect/nl-accept.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,EAAE;AACF,mFAAmF;AACnF,kFAAkF;AAClF,iFAAiF;AACjF,sFAAsF;AACtF,mFAAmF;AACnF,4EAA4E;AAC5E,EAAE;AACF,iEAAiE;AACjE,gFAAgF;AAChF,kEAAkE;AAClE,2EAA2E;AAC3E,sFAAsF;AACtF,qEAAqE;AACrE,oFAAoF;AACpF,sFAAsF;AACtF,0EAA0E;AAM1E,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,+CAA+C;AAEnE,sFAAsF;AACtF,MAAM,UAAU,eAAe;IAC7B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,sBAAsB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC;AAC3E,CAAC;AAmBD,MAAM,gBAAgB,GAAG;;;;;;;;;;;;;;;;gIAgBuG,CAAC;AAEjI,MAAM,gBAAgB,GAAG;IACvB,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,WAAW,EAAE;YACX,IAAI,EAAE,OAAO;YACb,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,OAAO,EAAW,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACpC,OAAO,EAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE;oBAC/E,gBAAgB,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACpC,UAAU,EAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE;oBACrE,KAAK,EAAa,EAAE,IAAI,EAAE,QAAQ,EAAE;iBACrC;gBACD,QAAQ,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,CAAC;aACxD;SACF;KACF;IACD,QAAQ,EAAE,CAAC,aAAa,CAAC;CACjB,CAAC;AAEX;;8BAE8B;AAC9B,MAAM,UAAU,kBAAkB,CAAC,GAAsB,EAAE,SAAiB,EAAE,KAAqB;IACjG,MAAM,QAAQ,GAAa,CAAC,kBAAkB,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,iBAAiB,CAAC,CAAC;IACzF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,QAAQ;YAAE,SAAS;QACxB,MAAM,CAAC,GAAG,iBAAiB,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3E,QAAQ,CAAC,IAAI,CACX,EAAE,EACF,oBAAoB,IAAI,CAAC,EAAE,GAAG,EAC9B,YAAY,QAAQ,CAAC,QAAQ,EAAE,EAC/B,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,EAAE,UAAU,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,uBAAuB,EACtI,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,EAAE,UAAU,mBAAmB,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,uBAAuB,CACvI,CAAC;IACJ,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,QAAqB,EACrB,KAAa;IAEb,IAAI,CAAC;QACH,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CACzC,gBAAgB,EAAE,KAAK,EAAE,gBAAgB,EACzC,EAAE,cAAc,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,CACnE,CAAC;QACF,OAAO,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC;IAC1B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,kFAAkF;AAClF,SAAS,eAAe,CAAC,SAAiB,EAAE,KAAa;IACvD,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;QAAE,OAAO,KAAK,CAAC;IAC1C,MAAM,EAAE,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IACpC,OAAO,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,EAAe,EACf,QAAqB,EACrB,SAAiB,EACjB,OAA4B,EAAE;IAE9B,MAAM,MAAM,GAAmB,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC9G,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,eAAe,EAAE;QAAE,OAAO,MAAM,CAAC,CAAY,qBAAqB;IACtF,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,MAAM,CAAC;IAE9D,MAAM,GAAG,GAAI,EAA2C,CAAC,EAAE,CAAC;IAC5D,MAAM,KAAK,GAAG,oBAAoB,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC7D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,CAA2B,iBAAiB;IAElF,MAAM,GAAG,GAAG,MAAM,eAAe,CAAC,QAAQ,EAAE,kBAAkB,CAAC,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;IACvF,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;QAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;QAAC,OAAO,MAAM,CAAC;IAAC,CAAC;IAEnF,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,SAAS,CAA2C,6BAA6B;QAC5F,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM;YAAE,SAAS;QACnC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC;YAAE,SAAS,CAAY,kBAAkB;QACjF,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;QAEtB,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;YAC1B,MAAM,WAAW,GAAG,CAAC,CAAC,gBAAgB,KAAK,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,gBAAgB,KAAK,IAAI,CAAC,UAAU,CAAC;YACrG,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,IAAI,EAAE;oBACzC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;oBACrE,MAAM,EAAE,+CAA+C,CAAC,CAAC,KAAK,GAAG;iBAClE,CAAC,CAAC;gBACH,IAAI,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,YAAY,KAAK,MAAM;oBAAE,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;;oBAAM,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;YACjG,CAAC;iBAAM,CAAC;gBACN,2EAA2E;gBAC3E,4EAA4E;gBAC5E,yEAAyE;gBACzE,MAAM,CAAC,gBAAgB,IAAI,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;YAC1D,MAAM,OAAO,GAAG,gBAAgB,CAAC,EAAE,EAAE,IAAI,EAAE;gBACzC,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,MAAM,EAAE,mCAAmC,CAAC,CAAC,KAAK,GAAG;aACtD,CAAC,CAAC;YACH,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;gBAAC,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO;oBAAE,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;;oBAAM,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;YAAC,CAAC;;gBACnF,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/middleware/reflect/pass0.d.ts

@@ -0,0 +1,20 @@
+import type { LLMProvider } from "../../engine/ai-provider.js";
+import type { Pass0Result } from "./types.js";
+export declare const PASS0_PROMPT = "You receive raw agent output \u2014 thinking and final response from an AI assistant.\nRead the ENTIRE content as a whole before filling out this scene card.\n\n\u2500\u2500 STATE CONVENTION \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\"State\" in this prompt = text in marked regions below (TRANSCRIPT, AGENT THINKING,\nKNOWN PROJECTS, OPEN BLUEPRINTS). Your training knowledge, pretrained familiarity,\nand what is \"well-known in the field\" are NOT state. When you reference state \u2014\ne.g. matching a term against KNOWN PROJECTS \u2014 you must be able to point to the\nexact line in the marked region. Familiarity \u2260 recorded state.\n\nYour goal: describe what happened in this session so that downstream extraction can\ncorrectly classify and link each piece of information. Observe and describe \u2014 do not\nassign types. Be concise \u2014 one line per entry.\n\nRecord names, labels, and terms exactly as they appear in the transcript. Do not\nexpand abbreviations or add parenthetical clarifications to terms not spelled out in\nthe source \u2014 your job is to record what is there, not infer what it means.\n\n\u2500\u2500 INPUT TYPE \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nAsk: \"Does this text describe decisions and events from a specific session \u2014\nor does it synthesize general domain knowledge with no session frame?\"\n\n  Session-scoped: references to \"this session\", choices made now, trials run,\n    approaches adopted or rejected in a specific context, work in progress,\n    temporal markers (\"today\", \"this sprint\", \"the team decided\") \u2192 CONVERSATIONAL\n    Note: the input is always an agent's summary \u2014 single voice narrating session\n    events is still CONVERSATIONAL if the events have a session temporal frame.\n\n  Domain knowledge synthesis: no session frame, conclusions stated as general\n    findings (\"X is proven\", \"Y has been superseded in the field\", \"Z remains\n    an open problem\"), no choices being made now \u2192 KNOWLEDGE_SYNTHESIS\n    For KS input, SECTION 3 (actor-actions) and SECTION 4 (tasks) will be sparse\n    or empty \u2014 that is correct. SECTION 7 (REPLACEMENTS) should also be empty\n    unless a participant in THIS session is actively deciding to replace X with Y.\n    \"The industry moved from X to Y\" is a domain fact, not a session replacement.\n\nSet input_type field to CONVERSATIONAL or KNOWLEDGE_SYNTHESIS. This field is used\nby downstream passes to adjust their framing.\n\n\u2500\u2500 SECTION 1: PROJECTS \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nEvery project, product, or system this session is about.\nName + one-line scope.\n\nIf KNOWN PROJECTS are provided, check them first.\nTranscripts use generic self-referential terms to describe participants: \"the company\",\n\"the team\", \"the organization\", \"our group\", \"the lab\", \"the division\", \"the firm\".\nThese are pronouns \u2014 how participants refer to themselves. They are NOT project names.\n\nProject names are specific coined identifiers: a code name, product name, initiative name,\nor organization-specific proper noun. A generic noun that could describe any organization\nis never a project name.\n\nRule: if the transcript uses a generic term that clearly refers to a known project \u2192\nuse the known project name, not the generic term.\nRule: if no known project matches, use the most specific identifier from the transcript\n(a product name, initiative name, proper noun) \u2014 never the generic noun itself.\nRule: express every project name in label format \u2014 lowercase, hyphens only, no underscores,\nno spaces (e.g. \"x-initiative\" not \"X Initiative\"). This name becomes the project_creates[]\nlabel in Pass 3. A name that is not label-safe breaks downstream processing.\n\nSCOPE PROJECT \u2014 also identify the ONE overarching subject of the whole transcript.\nEvery transcript has exactly one. Specific systems and products still go in projects[];\nthe scope project is the umbrella they sit under \u2014 and the home for cross-cutting\nknowledge that belongs to no single project. If the transcript is about a single\nproject, the scope project IS that project. Set scope_project = { name, scope },\nname in the same label format. It must always be filled.\n\n\u2500\u2500 SECTION 2: PEOPLE AND ROLES \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nEveryone mentioned. For each person, set:\n  role = what they contributed (decision_maker, constraint_source, executor, observer)\n  signal_type = how they appear in the transcript (named, inferred, role_only)\nRoles:\n  decision_maker     \u2014 confirmed, approved, or chose something\n  constraint_source  \u2014 imposed an external requirement (auditor, vendor, regulator)\n  executor           \u2014 will build or implement something\n  observer           \u2014 described facts without making choices\n\n\u2500\u2500 SECTION 3: ACTOR-ACTION LOG \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nSignificant actions as tuples: [actor] \u2192 [verb] \u2192 [object] \u2192 [outcome or nil]\nOnly actions with lasting consequences. Skip narration and logistics.\n\n\u2500\u2500 SECTION 4: APPROACHES AND OPTIONS \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nEvery approach, tool, system, method, model, hypothesis, methodology, or strategy\nthat appeared as a choice point \u2014 regardless of domain.\nFor each: name, project (if known), and a description of what happened to it.\nDescribe what was observed. Do not assign a type \u2014 use the descriptions below.\n\nFor each approach, ask: \"What does the text say about this concept's current standing?\"\n\nDescription formats \u2014 for CONVERSATIONAL input (session-temporal framing):\n  In prior use, being replaced this session:\n    \"[name] has been in active use for [period], being replaced by Y this session\"\n  Adopted or confirmed this session:\n    \"[name] selected as the [role], confirmed this session\"\n  Explicitly excluded by named authority:\n    \"[name] ruled out by [authority]: [reason]\"\n  Formally evaluated and rejected (requires an actual trial, pilot, or dedicated time):\n    \"[name] formally evaluated for [duration], rejected: [reason]\"\n  Casually mentioned, no engagement:\n    \"[name] mentioned speculatively only: '[quote]'\"\n    \"[name] briefly dismissed with reasons but no prior use\"\n  Currently in use, no change: \"[name] in active use, no change this session\"\n  Committed for future evaluation: \"[name] committed to formal evaluation in [period]: [what]\"\n\nDescription formats \u2014 for KNOWLEDGE_SYNTHESIS input (domain-status framing):\n  Historically dominant, now generally superseded:\n    \"[name] was the dominant approach for [period/context], now generally superseded by [Y]\"\n  Currently standard or widely adopted:\n    \"[name] is the current standard approach for [function]\"\n  Proposed or emerging, not yet established:\n    \"[name] proposed as alternative to [Y], [current evidence status]\"\n  Evaluated and abandoned in domain practice:\n    \"[name] tried in [context], abandoned: [reason]\"\n  Mentioned for comparison only:\n    \"[name] mentioned for comparison: [brief context]\"\n\nFormat: \"name [project] \u2014 description\"\nThe [project] MUST be a short project label from SECTION 1 (e.g., \"project-a\", \"my-initiative\").\nNever use a block ID, a full label string, or any value that contains underscores or numbers.\nJSON field mapping: name \u2192 name field | [project] \u2192 project field (label only) | description \u2192 context field.\nThe project field contains ONLY the short label. The context field contains ONLY the description phrase. Never mix them.\nExamples:\n  \"approach-A [project-x] \u2014 has been in use for months, being replaced by approach-B this session\"\n  \"option-C [project-x] \u2014 mentioned speculatively only: 'would have handled problem P differently'\"\n  \"option-D [project-y] \u2014 ruled out by [authority]: violates standing policy\"\n  \"methodology-F [org] \u2014 formally evaluated for 3 months, rejected: high inter-rater variability\"\n\nKEY DISTINCTION \u2014 speculative mention vs substantive rejection:\n  Ask: \"Was a path into X actually entered \u2014 did anyone commit resources to it\n  (time to investigate, a trial, a deployment, a structured comparison) \u2014\n  or did X enter this conversation as a suggestion and leave as a dismissal?\n  Reasoning about what X would cost is not entering the path.\"\n\n    Path entered \u2014 in active use:\n      X was in use before this session, now being replaced \u2192 \"in prior use, being replaced\"\n    Path entered \u2014 committed investigation:\n      Someone was assigned to evaluate X, a trial ran, or resources were allocated to it.\n      \"Did someone actually try X \u2014 or reason about what trying X would cost?\"\n      Estimating the expense of X is not investing in X. \u2192 \"formally evaluated, rejected\"\n    Path not entered \u2014 speculative:\n      X raised and dismissed, no follow-up committed. Expert reasoning against X\n      reflects knowledge about X, not prior investigation of X for this project.\n      \u2192 \"mentioned speculatively\" or \"briefly dismissed with reasons but no prior use\"\n\n  When ambiguous: default to \"briefly dismissed\" description.\n  A misplaced speculative is recoverable. A misplaced \"formally evaluated\" creates false signal.\n\n\u2500\u2500 SECTION 5: TASKS (work actively in progress) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nWork that is currently underway \u2014 NOT yet complete.\nAsk: \"Are resources actively committed to this \u2014 in progress, not yet done?\"\nFormat: \"project_name: person \u2014 what they are doing\"\nDO NOT include: status-only confirmations with no new content (\"X is on track\", \"X is going well\",\n\"X has no blockers\"). Those add no new graph knowledge.\nDO NOT include future evaluations or investigations not yet started \u2014 these belong in\nSECTION 4 APPROACHES with the \"committed for future evaluation\" description.\n\n\u2500\u2500 SECTION 6: CAUSAL LINKS \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nX \u2192 Y where X caused Y, even if they appear in different paragraphs.\nOnly clear causal chains. Keep entries short.\n\nJOINT CAUSATION \u2014 multiple abandonments/failures jointly driving one adoption:\n  Capture as ONE entry with compound cause. Format: \"cause-A + cause-B \u2192 effect\"\n  Example: \"[X-abandoned] + [Y-abandoned] \u2192 [Z-adopted]\"\n\n\u2500\u2500 SECTION 7: REPLACEMENTS \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nThings that were in active use and are being replaced THIS session \u2014 announced now, not already done.\nScan the ENTIRE transcript for replacement pairs \u2014 these are mandatory dead_end\ncandidates for Pass 1.\n\nGATE: If INPUT TYPE = KNOWLEDGE SYNTHESIS, ask:\n  \"Is a participant in THIS session deciding to replace X with Y \u2014 or is the text\n  reporting that X has generally been replaced by Y in the domain?\"\n  Reporting a domain-wide shift \u2192 not a replacement pair. Put in UNCHANGED instead.\n\nA replacement pair exists when ALL THREE are true:\n  - X was actively in use AND\n  - X is being replaced or retired by Y AND\n  - This replacement is announced NOW in this session, not referenced as already done\n\nAsk: \"Is this replacement happening now \u2014 or referenced as prior-session context?\"\n  Happening now \u2192 REPLACEMENTS. Already done \u2192 UNCHANGED instead.\n\nFormat: { predecessor: \"X\", replacement: \"Y\", function: \"what both served\" }\nUse actual names from transcript. Leave empty if no replacement pairs exist.\n\n\u2500\u2500 SECTION 8: UNCHANGED \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nThings being reported as already resolved \u2014 surfaced as context for the current work,\nnot being worked out in this session.\n\nGATE: If INPUT TYPE = KNOWLEDGE_SYNTHESIS, this section should be EMPTY.\n  KS has no prior session \u2014 all content is domain knowledge, not recap.\n  Downstream passes use UNCHANGED to skip items as duplicates \u2014 filling it for KS kills correct items.\n\nFor CONVERSATIONAL input only:\n\nFor each entry in SECTION 4 (APPROACHES), ask:\n  \"Is the speaker explicitly presenting this as carried-over context from a prior session \u2014\n  or is it being worked out now?\"\n    Being worked out now (chosen, rejected, evaluated, investigated this session) \u2192 SECTION 4 only\n    Speaker presents it as prior-session context, not active work \u2192 SECTION 4 AND here\n\nAlso ask for anything else in the transcript:\n  \"Is a speaker explicitly presenting this as resolved prior context \u2014 or as something new?\"\n    Resolved prior context \u2192 include here\n    New this session \u2192 do not include here\n\nAn entry can appear in both SECTION 4 and SECTION 8. They serve different purposes:\nSECTION 4 = engagement description (Pass 2). SECTION 8 = recap signal (Pass 1). Both needed.\n\n\u2500\u2500 SCENE CARD REASONING (diagnostic) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nscene_card_reasoning: In 1-2 sentences \u2014 what input type did you identify\n(CONVERSATIONAL or KNOWLEDGE SYNTHESIS), and what drove the key APPROACHES\ndescriptions you chose (especially for any \"formally evaluated\" or \"in prior use\" entries)?";
+export declare function formatSceneCard(card: Pass0Result): string;
+export declare function callPass0LLM(provider: LLMProvider, agentThinking: string, agentOutput: string, openBlueprints?: Array<{
+    label: string;
+    essence: string;
+}>, knownRoots?: Array<{
+    label: string;
+    essence: string;
+}>, userMessage?: string): Promise<{
+    result: Pass0Result | null;
+    rateLimited: boolean;
+    model?: string;
+    attempts?: Array<{
+        model: string;
+        outcome: string;
+    }>;
+}>;
+//# sourceMappingURL=pass0.d.ts.map