nodedex 0.1.0

package/dist/middleware/reflect/pass5.js

@@ -0,0 +1,178 @@
+import { reflectTokenStats } from "./context.js";
+import { getThinkingBudget, modelForPass } from "./config.js";
+// ═══════════════════════════════════════════════════════════════════════════════
+// PASS 5 — CHAIN ASSEMBLY
+// Job: find causally connected clusters in this turn's new blocks and name them
+// as retrievable chain objects. Runs after Pass 4 has wired all relations.
+// ═══════════════════════════════════════════════════════════════════════════════
+const PASS5_PROMPT = `You receive blocks saved this turn and the causal relations between them.
+
+── STATE CONVENTION ─────────────────────────────────────────────────────────
+"State" in this prompt = text in marked regions below (NEW BLOCKS THIS TURN,
+CAUSAL RELATIONS BETWEEN THEM). Your training knowledge of "how such arcs
+typically conclude" is NOT state. A committed conclusion exists ONLY if a
+member block in NEW BLOCKS has the right type and the cluster's relations
+terminate on it. Familiarity with the domain's typical patterns is irrelevant.
+
+Your job: find clusters of causally connected blocks and assemble each into a named chain.
+
+── WHAT IS A CHAIN ───────────────────────────────────────────────────────────
+
+A chain is a named arc that captures a complete story: evidence or failures led
+to a committed conclusion. It is a retrievable summary of how a cluster of blocks
+resolved into an outcome.
+
+A chain requires:
+  - At least 2 blocks connected by a causal-thread relation: prompted_by, based_on,
+    supports (X is evidence for Y — e.g. a specific failure supports a general
+    dead-end), supersedes, or resolves
+  - A committed conclusion — ask: "Does this cluster end in a block that represents
+    a closed outcome — something the cluster produced or resolved — not just an
+    observation, a work-in-progress, or accumulated context?"
+
+    Committed conclusion (valid terminus):
+      (X) was chosen from real alternatives              → decision
+      (X) was established as an external boundary        → constraint
+      (A) + (B) were synthesised into a new conclusion   → insight, reasoning_chain
+      (X) was definitively replaced or abandoned         → dead_end as final block
+
+    NOT a committed conclusion (do not create a chain):
+      (X) is true — observation with no resolution attached  → fact alone
+      (X) is planned but not yet built or confirmed          → blueprint
+      (X) is being worked on                                 → task
+      A cluster where every block is accumulated context with no arc produced
+
+  - The blocks must be from the same project
+
+Do NOT create a chain for:
+  - A single block with no causal connections
+  - A cluster with no committed conclusion (open arcs, pure accumulation, tasks only)
+  - Blocks from different projects (each project gets its own chain)
+
+── CHAIN NAMING ──────────────────────────────────────────────────────────────
+
+{project}_chain_{capability-area}
+
+  project          = the project prefix (same as member blocks)
+  capability-area  = the system capability this arc resolved
+                     Name the WHAT (the capability), not the HOW (mechanism)
+                     and not the WHY (cause). 2-4 words, hyphens only.
+
+  "What system capability now exists or changed because of this arc?"
+  That answer is the capability-area.
+
+  Test: "What system capability now exists or changed because of this arc?"
+  The answer to that question is the capability-area.
+  Strip "because", "using", "via", "from" — what remains is the concept.
+  Name the RESULT (what now works), not the PROCESS (how it was achieved).
+
+── CHAIN ESSENCE ─────────────────────────────────────────────────────────────
+
+One sentence, ≤140 chars. The compressed story: what was tried/required, what
+failed or was imposed, what was adopted. Should stand alone as a summary.
+
+  "First approach hit scaling limit; second approach had prohibitive overhead cost; third approach adopted as primary solution"
+  "First method showed high variance across sites; second method validated at acceptable consistency; second method adopted as standard"
+
+── MEMBERS AND ARC ───────────────────────────────────────────────────────────
+
+members: block labels in causal order — cause-first, outcome-last.
+arc:     type sequence matching members order, e.g. "fact → dead_end → decision"
+
+── CONCLUSION ────────────────────────────────────────────────────────────────
+
+conclusion: the specific committed outcome this arc produced.
+            A noun phrase (≤80 chars) naming what now exists or is established.
+            This is the terminal answer to "what did this arc resolve into?"
+
+  NOT a restatement of the essence. NOT a sentence. NOT the mechanism.
+  The WHAT — the named capability, decision, or practice that now exists.
+
+  Test: "What named capability, decision, or practice now exists?"
+  Must be a noun phrase (≤80 chars), not a sentence.
+  Name the WHAT (capability), not the HOW (mechanism).
+  Strip "by", "through", "via" — what remains is the conclusion.
+
+── REASONING (REQUIRED PER CHAIN) ────────────────────────────────────────────
+
+For each chain emit a reasoning field that explains WHY in two parts, naming
+specific member blocks:
+
+  1. WHY THESE MEMBERS: which causal relations make these blocks one cluster
+     (cite the specific prompted_by / based_on / supports / supersedes / resolves
+     links that bind them; explain why excluded blocks are excluded if relevant).
+  2. WHY THIS CONCLUSION: which member block is the committed terminus and
+     which terminus test it passes ("decision: chosen from real alternatives" /
+     "constraint: established as external boundary" / "insight: synthesised
+     from A+B" / "dead_end: definitively abandoned as final").
+
+Reasoning must reference SPECIFIC block labels — not generic phrasing. A
+chain whose reasoning cannot name the concrete cluster-link and the concrete
+terminus-block fails the WHAT-IS-A-CHAIN test; do not emit it.
+
+── OUTPUT ────────────────────────────────────────────────────────────────────
+
+Return chains[] with one entry per valid cluster. Each entry includes the
+reasoning field per the section above.
+If no valid clusters exist → return chains: []`;
+const PASS5_SCHEMA = {
+    type: "object",
+    properties: {
+        chains: {
+            type: "array",
+            items: {
+                type: "object",
+                properties: {
+                    chain_label: { type: "string" },
+                    chain_essence: { type: "string" },
+                    arc: { type: "string" },
+                    conclusion: { type: "string" },
+                    members: { type: "array", items: { type: "string" } },
+                    reasoning: { type: "string" }, // per-chain WHY (members + conclusion)
+                },
+                required: ["chain_label", "chain_essence", "arc", "conclusion", "members", "reasoning"],
+            },
+        },
+    },
+    required: ["chains"],
+};
+export async function callPass5LLM(provider, newBlocks, causalRels) {
+    if (newBlocks.length < 2)
+        return { result: null, rateLimited: false };
+    const blockById = new Map(newBlocks.map(b => [b.id, b]));
+    // Only include relations where both ends are in new blocks
+    const relevantRels = causalRels.filter(r => blockById.has(r.source_id) && blockById.has(r.target_id));
+    if (relevantRels.length === 0)
+        return { result: null, rateLimited: false };
+    const blocksSection = `NEW BLOCKS THIS TURN:\n${newBlocks.map(b => {
+        return `  ${b.label} [${b.type}] — "${b.essence}"`;
+    }).join("\n")}\n`;
+    const relsSection = `\nCAUSAL RELATIONS BETWEEN THEM:\n${relevantRels.map(r => {
+        const src = blockById.get(r.source_id);
+        const tgt = blockById.get(r.target_id);
+        return `  ${src?.label} --[${r.type}]--> ${tgt?.label}`;
+    }).join("\n")}`;
+    const userInput = blocksSection + relsSection;
+    const r = await provider.generateStructured(PASS5_PROMPT, userInput, PASS5_SCHEMA, {
+        thinkingBudget: getThinkingBudget(512), // respects NODEDEX_THINKING_BUDGET; pass5 bills its share
+        modelOverride: modelForPass("pass5"),
+    });
+    // debt-4 §3: pass5 has its OWN bucket. Pre-fix this incremented pass4's bucket
+    // ("pass5 is lightweight, no separate counter needed") which inflated pass4
+    // cost AND hid pass5 from cost_breakdown. Empirically pass5 wall_ms is ~5-12s
+    // and it bills thinking — not lightweight enough to merge.
+    if (r.usage) {
+        reflectTokenStats.pass5.input += r.usage.input ?? 0;
+        reflectTokenStats.pass5.thinking += r.usage.thinking ?? 0;
+        reflectTokenStats.pass5.output += r.usage.output ?? 0;
+    }
+    reflectTokenStats.pass5.calls += 1;
+    if (r.result) {
+        console.log(`Auto-Reflect Pass 5: ${r.result.chains?.length ?? 0} chain(s) assembled | tokens: in=${r.usage?.input ?? "?"} think=${r.usage?.thinking ?? "?"} out=${r.usage?.output ?? "?"}`);
+    }
+    else {
+        console.warn(`Auto-Reflect Pass 5: ${r.rateLimited ? "rate limited" : "failed"} — skipping (non-critical)`);
+    }
+    return { result: r.result ?? null, rateLimited: r.rateLimited, model: r.model, attempts: r.attempts };
+}
+//# sourceMappingURL=pass5.js.map

package/dist/middleware/reflect/pass5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pass5.js","sourceRoot":"","sources":["../../../src/middleware/reflect/pass5.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAI9D,kFAAkF;AAClF,0BAA0B;AAC1B,gFAAgF;AAChF,2EAA2E;AAC3E,kFAAkF;AAElF,MAAM,YAAY,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;+CA6G0B,CAAC;AAEhD,MAAM,YAAY,GAAG;IACnB,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,MAAM,EAAE;YACN,IAAI,EAAE,OAAO;YACb,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,WAAW,EAAI,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACjC,aAAa,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACjC,GAAG,EAAY,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACjC,UAAU,EAAK,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACjC,OAAO,EAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE;oBAC3D,SAAS,EAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAI,uCAAuC;iBAC7E;gBACD,QAAQ,EAAE,CAAC,aAAa,EAAE,eAAe,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,WAAW,CAAC;aACxF;SACF;KACF;IACD,QAAQ,EAAE,CAAC,QAAQ,CAAC;CACrB,CAAC;AASF,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,QAAqB,EACrB,SAA8E,EAC9E,UAAyE;IAEzE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;IAEtE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzD,2DAA2D;IAC3D,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACtG,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;IAE3E,MAAM,aAAa,GAAG,0BAA0B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QAChE,OAAO,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,OAAO,GAAG,CAAC;IACrD,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IAElB,MAAM,WAAW,GAAG,qCAAqC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QAC5E,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACvC,OAAO,KAAK,GAAG,EAAE,KAAK,OAAO,CAAC,CAAC,IAAI,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC;IAC1D,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAEhB,MAAM,SAAS,GAAG,aAAa,GAAG,WAAW,CAAC;IAE9C,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CAAc,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE;QAC9F,cAAc,EAAE,iBAAiB,CAAC,GAAG,CAAC,EAAE,0DAA0D;QAClG,aAAa,EAAE,YAAY,CAAC,OAAO,CAAC;KACrC,CAAC,CAAC;IAEH,+EAA+E;IAC/E,4EAA4E;IAC5E,8EAA8E;IAC9E,2DAA2D;IAC3D,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACZ,iBAAiB,CAAC,KAAK,CAAC,KAAK,IAAO,CAAC,CAAC,KAAK,CAAC,KAAK,IAAO,CAAC,CAAC;QAC1D,iBAAiB,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC;QAC1D,iBAAiB,CAAC,KAAK,CAAC,MAAM,IAAM,CAAC,CAAC,KAAK,CAAC,MAAM,IAAM,CAAC,CAAC;IAC5D,CAAC;IACD,iBAAiB,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAEnC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACb,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,oCAAoC,CAAC,CAAC,KAAK,EAAE,KAAK,IAAI,GAAG,UAAU,CAAC,CAAC,KAAK,EAAE,QAAQ,IAAI,GAAG,QAAQ,CAAC,CAAC,KAAK,EAAE,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC;IAC/L,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,4BAA4B,CAAC,CAAC;IAC9G,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AACxG,CAAC"}

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

@@ -0,0 +1,44 @@
+import type { LLMProvider } from "../../engine/ai-provider.js";
+import type { Pass1Item } from "./types.js";
+export declare const PASS_JUDGE_PROMPT = "You receive items extracted from one session of an AI agent\nworking on a project. The extractor maximises RECALL \u2014 it finds every discrete claim it can.\nYour job is to apply a single binary worth test to each item and decide KEEP or DROP.\n\nYou do NOT change item types. You do NOT merge items. You do NOT extract anything new.\nCover every input item exactly once.\n\n\u2500\u2500 THE TEST (one question, applied per item) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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\"Could a competent instance of the model \u2014 given the project context, but WITHOUT having\nlived this session \u2014 already know this item, or trivially produce it?\"\n\n  YES \u2192 general knowledge / scaffolding the model already carries \u2192 DROP.\n  NO  \u2192 specific to this session's lived path \u2192 KEEP.\n\nThe session is what makes an item path-specific. \"The model already knows it\" is what makes\nit scaffolding. The test is the same for every type.\n\n\u2500\u2500 ASYMMETRIC COST (calibration, not restraint) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nA dropped decision, dead_end, or constraint is UNRECOVERABLE \u2014 it was forged in this\nsession and will not come back if discarded. So is a session-specific observation,\nmeasurement, or stated value: a model cannot reproduce a number someone measured here,\nand a conclusion loses its grounding when the finding it rests on is dropped.\nOnly a GENERAL-KNOWLEDGE fact \u2014 one the model already carries \u2014 is FREE; that, and only\nthat, the model produces again on demand.\n\n  When uncertain \u2192 KEEP.\n  The default verdict is KEEP. DROP only when you can name the general source the item\n  duplicates, or identify the specific scaffolding test it fails (below).\n\n\u2500\u2500 CLARIFYING TESTS \u2014 two faces of the same one question \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nTEST A \u2014 Considered options.\n  If the item describes an approach or option the agent considered:\n    \u2022 Did the agent CHOOSE this approach? \u2192 residue (decision). KEEP.\n    \u2022 Did the agent ENTER this approach then ABANDON it with a reason? \u2192 residue\n      (dead_end). KEEP.\n    \u2022 Did the agent merely NAME this approach while thinking, without choosing\n      or trying it? \u2192 it left no residue; the list of options is general knowledge\n      the model would generate on demand. DROP with reason_category = option_merely_named.\n\nTEST B \u2014 Why vs When.\n  If the item describes causality or sequence:\n    \u2022 Does it carry a WHY \u2014 the transferable validity condition (this holds because\n      of that)? \u2192 residue future sessions can use. KEEP.\n    \u2022 Does it carry only a WHEN \u2014 a procedural sequence (do X, then Y, then Z) with\n      no reason recorded? \u2192 procedural scaffolding the model can re-derive from\n      the decisions. DROP with reason_category = procedural_when_sequence.\n\nIf neither clarifying test applies and the spine question above returns DROP, use\nreason_category = general_knowledge.\n\n\u2500\u2500 PER-ITEM LOCALITY \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nJudge each item INDEPENDENTLY against the spine question. Do not look at how many you\nhave kept or dropped overall. Do not balance the batch. Do not consider what other\nitems might do. Each verdict is local to its item.\n\n\u2500\u2500 OUTPUT \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\nFor every input item, emit exactly one verdict record:\n  { item_id, verdict: \"KEEP\" | \"DROP\", reason_category, notes? }\n\nreason_category is REQUIRED.\n  For KEEP : \"path_specific_residue\"\n  For DROP : \"general_knowledge\" | \"option_merely_named\" | \"procedural_when_sequence\"\nnotes is OPTIONAL \u2014 one short sentence \u2014 use only when the standard reason_category does\nnot adequately capture why you decided as you did.\n\nDo not invent item ids. Do not change item types. Do not omit any input item.\n";
+export interface PassJudgeVerdict {
+    item_id: string;
+    verdict: "KEEP" | "DROP";
+    reason_category: "path_specific_residue" | "general_knowledge" | "option_merely_named" | "procedural_when_sequence";
+    notes?: string;
+    reasoning?: string;
+}
+export interface PassJudgeResult {
+    verdicts: PassJudgeVerdict[];
+}
+export declare function callPassJudgeLLM(provider: LLMProvider, pass1Items: Pass1Item[], sceneCard: string | undefined, agentThinking: string, agentOutput: string, thinkingBudget?: number, userMessage?: string, roleById?: Record<string, string>): Promise<{
+    result: PassJudgeResult | null;
+    rateLimited: boolean;
+    model?: string;
+    attempts?: Array<{
+        model: string;
+        outcome: string;
+    }>;
+}>;
+/**
+ * Apply judge verdicts to Pass 1 items, with safe ref-cleanup.
+ *
+ * Rules:
+ *   1. If judge result is null (call failed), pass-through ALL items — judge failure
+ *      must never silently drop residue. Precision is an improvement, not a blocker.
+ *   2. If a KEPT item references a DROPPED item via extends_id (the only intra-batch
+ *      reference Pass 1 carries), override the drop and KEEP the parent too. Never
+ *      lose an anchor of something we're keeping — preserves the asymmetric cost.
+ *      Records the override for audit.
+ *   3. Items missing from the judge's verdicts default to KEEP (defensive — never
+ *      silently drop on judge omission).
+ *
+ * Returns the kept item set, the final dropped verdicts (post-override), and the list
+ * of anchor overrides for the turn log.
+ */
+export declare function applyJudgeVerdicts(pass1Items: Pass1Item[], judge: PassJudgeResult | null): {
+    kept: Pass1Item[];
+    dropped: PassJudgeVerdict[];
+    anchorOverrides: string[];
+};
+//# sourceMappingURL=pass_judge.d.ts.map

package/dist/middleware/reflect/pass_judge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pass_judge.d.ts","sourceRoot":"","sources":["../../../src/middleware/reflect/pass_judge.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AA8B5C,eAAO,MAAM,iBAAiB,g1JAmE7B,CAAC;AA0BF,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC;IACzB,eAAe,EAAE,uBAAuB,GAAG,mBAAmB,GAAG,qBAAqB,GAAG,0BAA0B,CAAC;IACpH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,gBAAgB,EAAE,CAAC;CAC9B;AAmCD,wBAAsB,gBAAgB,CACpC,QAAQ,EAAE,WAAW,EACrB,UAAU,EAAE,SAAS,EAAE,EACvB,SAAS,EAAE,MAAM,GAAG,SAAS,EAC7B,aAAa,EAAE,MAAM,EACrB,WAAW,EAAE,MAAM,EACnB,cAAc,SAAO,EACrB,WAAW,GAAE,MAAW,EACxB,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAM,GACpC,OAAO,CAAC;IAAE,MAAM,EAAE,eAAe,GAAG,IAAI,CAAC;IAAC,WAAW,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CAAC,CAgEzI;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,SAAS,EAAE,EACvB,KAAK,EAAE,eAAe,GAAG,IAAI,GAC5B;IAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IAAC,OAAO,EAAE,gBAAgB,EAAE,CAAC;IAAC,eAAe,EAAE,MAAM,EAAE,CAAA;CAAE,CA0B/E"}

package/dist/middleware/reflect/pass_judge.js

@@ -0,0 +1,263 @@
+import { reflectTokenStats } from "./context.js";
+import { modelForPass } from "./config.js";
+// ═══════════════════════════════════════════════════════════════════════════════
+// PASS JUDGE — PRECISION FILTER (between Pass 1 and Pass 2)
+//
+// Job:   For each Pass 1 item, apply the charter §2.1 path-specificity test and
+//        return one binary verdict (KEEP | DROP) with a reason_category.
+//        Does NOT change types, merge items, or extract anything new.
+//
+// Role:  Pass 1 maximises recall (finds everything). JUDGE filters for
+//        precision (drops scaffolding / general knowledge / merely-named
+//        options). Pass 2 then dedups and wires what survived.
+//
+// Why this is OK to ask the LLM (where the failed pass1-residue reframe was not):
+//   • The reframe asked Pass 1 to NOT-EMIT things during extraction — restraint,
+//     a weak LLM skill (charter rule 4). The result was inconsistent across
+//     domains (over-extraction doc).
+//   • JUDGE asks "given this item, is it path-specific?" — a local binary
+//     judgment on an existing artifact. That is the LLM's competence.
+//
+// Charter compliance:
+//   rule 3 — semantic per-item judgment → LLM (this), not code.
+//   rule 4 — schema enforces per-item local verdict, no batch coordination.
+//   rule 6 — never overrides a success: filters at extraction layer, pre-commit;
+//            nothing committed to the DB is touched.
+//   rule 7 — deterministic on probabilistic input is still probabilistic.
+//            Document validation as multi-run + read reasoning, not single-run.
+//   rule 14 — uses the §2.1 sharpened worth test verbatim.
+// ═══════════════════════════════════════════════════════════════════════════════
+export const PASS_JUDGE_PROMPT = `You receive items extracted from one session of an AI agent
+working on a project. The extractor maximises RECALL — it finds every discrete claim it can.
+Your job is to apply a single binary worth test to each item and decide KEEP or DROP.
+
+You do NOT change item types. You do NOT merge items. You do NOT extract anything new.
+Cover every input item exactly once.
+
+── THE TEST (one question, applied per item) ────────────────────────────────
+"Could a competent instance of the model — given the project context, but WITHOUT having
+lived this session — already know this item, or trivially produce it?"
+
+  YES → general knowledge / scaffolding the model already carries → DROP.
+  NO  → specific to this session's lived path → KEEP.
+
+The session is what makes an item path-specific. "The model already knows it" is what makes
+it scaffolding. The test is the same for every type.
+
+── ASYMMETRIC COST (calibration, not restraint) ─────────────────────────────
+A dropped decision, dead_end, or constraint is UNRECOVERABLE — it was forged in this
+session and will not come back if discarded. So is a session-specific observation,
+measurement, or stated value: a model cannot reproduce a number someone measured here,
+and a conclusion loses its grounding when the finding it rests on is dropped.
+Only a GENERAL-KNOWLEDGE fact — one the model already carries — is FREE; that, and only
+that, the model produces again on demand.
+
+  When uncertain → KEEP.
+  The default verdict is KEEP. DROP only when you can name the general source the item
+  duplicates, or identify the specific scaffolding test it fails (below).
+
+── CLARIFYING TESTS — two faces of the same one question ────────────────────
+
+TEST A — Considered options.
+  If the item describes an approach or option the agent considered:
+    • Did the agent CHOOSE this approach? → residue (decision). KEEP.
+    • Did the agent ENTER this approach then ABANDON it with a reason? → residue
+      (dead_end). KEEP.
+    • Did the agent merely NAME this approach while thinking, without choosing
+      or trying it? → it left no residue; the list of options is general knowledge
+      the model would generate on demand. DROP with reason_category = option_merely_named.
+
+TEST B — Why vs When.
+  If the item describes causality or sequence:
+    • Does it carry a WHY — the transferable validity condition (this holds because
+      of that)? → residue future sessions can use. KEEP.
+    • Does it carry only a WHEN — a procedural sequence (do X, then Y, then Z) with
+      no reason recorded? → procedural scaffolding the model can re-derive from
+      the decisions. DROP with reason_category = procedural_when_sequence.
+
+If neither clarifying test applies and the spine question above returns DROP, use
+reason_category = general_knowledge.
+
+── PER-ITEM LOCALITY ────────────────────────────────────────────────────────
+Judge each item INDEPENDENTLY against the spine question. Do not look at how many you
+have kept or dropped overall. Do not balance the batch. Do not consider what other
+items might do. Each verdict is local to its item.
+
+── OUTPUT ──────────────────────────────────────────────────────────────────
+For every input item, emit exactly one verdict record:
+  { item_id, verdict: "KEEP" | "DROP", reason_category, notes? }
+
+reason_category is REQUIRED.
+  For KEEP : "path_specific_residue"
+  For DROP : "general_knowledge" | "option_merely_named" | "procedural_when_sequence"
+notes is OPTIONAL — one short sentence — use only when the standard reason_category does
+not adequately capture why you decided as you did.
+
+Do not invent item ids. Do not change item types. Do not omit any input item.
+`;
+const PASS_JUDGE_SCHEMA = {
+    type: "object",
+    properties: {
+        verdicts: {
+            type: "array",
+            items: {
+                type: "object",
+                properties: {
+                    item_id: { type: "string" },
+                    verdict: { type: "string", enum: ["KEEP", "DROP"] },
+                    reason_category: {
+                        type: "string",
+                        enum: ["path_specific_residue", "general_knowledge", "option_merely_named", "procedural_when_sequence"],
+                    },
+                    notes: { type: "string" },
+                    reasoning: { type: "string" },
+                },
+                required: ["item_id", "verdict", "reason_category"],
+            },
+        },
+    },
+    required: ["verdicts"],
+};
+// Appended ONLY when a USER turn is present (NODEDEX_EXTRACT_ALL_SOURCES on). Gives
+// JUDGE the verbatim excerpt + the user turn so the (novelty) worth spine judges the
+// SOURCE not the paraphrase, and requests a per-item rationale (auditability, Rule 8).
+// The worth AXIS is unchanged — the spine's path-specific test (charter §1/§2.1).
+// (The two-prong worth-axis was reverted 2026-06-04: over-extraction is GRANULARITY,
+//  not worth — fixed by the Pass 2 fold, not a sharper filter. See fragmentation memo.)
+const PASS_JUDGE_TWO_PARTY_SUFFIX = `
+
+── TWO-PARTY INPUT + VERBATIM (present) ────────────────────────────────────
+The session evidence includes a USER turn, and each item now carries its excerpt — the
+verbatim source span. Judge worth against the verbatim and the full exchange, not the
+paraphrased text alone: a paraphrase can read like general knowledge even when the
+source shows it was chosen, tried, or stated by the user this session.
+For each verdict, put a one-line rationale in the reasoning field: what makes it
+path-specific residue, or which general source it duplicates.`;
+// Appended ONLY when the caller supplies each item's structural ROLE (the
+// context-aware judge, NODEDEX_V2_JUDGE_CONTEXT). Lets worth include a block's role in
+// the session's reasoning — NOT a quota signal. Threads the PER-ITEM LOCALITY needle
+// explicitly so the judge doesn't start balancing the batch.
+const PASS_JUDGE_ROLE_SUFFIX = `
+
+── STRUCTURAL ROLE (present) ────────────────────────────────────────────────
+Each item now carries a "role" field — what DEPENDS ON it and what it BUILDS ON in this
+session's reasoning (e.g. "needed-by decision; builds-on fact"). Weigh it: a block that
+another block's reasoning RESTS ON is path-specific residue BY ITS ROLE — keep it even
+when its sentence reads like plain knowledge, because dropping it strands what depends on
+it. A block with no role line is judged on its text alone, exactly as before.
+This does NOT relax the per-item rule: you are still judging whether THIS item carries
+residue (now including its structural role) — never balancing the set or matching a quota.
+When the role changed your verdict, say so in the reasoning field (e.g. "kept — needed-by
+a decision, would strand it").`;
+export async function callPassJudgeLLM(provider, pass1Items, sceneCard, agentThinking, agentOutput, thinkingBudget = 1024, userMessage = "", roleById = {}) {
+    const sceneCardSection = sceneCard
+        ? `SCENE CARD (structural shape of this session's path):\n${sceneCard}\n\n---\n\n`
+        : "";
+    const thinkingSection = agentThinking
+        ? `AGENT THINKING:\n${agentThinking}\n\n---\n\n`
+        : "";
+    // Compact items payload — id + provisional_type + text — schema-shaped so the
+    // model can address them by id without seeing internal Pass 1 fields.
+    const includeUserTurn = !!(userMessage && userMessage.trim());
+    const includeRole = Object.keys(roleById).length > 0; // context-aware judge (v2)
+    const compactItems = pass1Items.map(i => {
+        const c = { id: i.id, provisional_type: i.provisional_type, text: i.text };
+        if (includeUserTurn)
+            c.excerpt = i.excerpt; // carry the verbatim so worth is judged on source, not paraphrase
+        if (includeRole && roleById[i.id])
+            c.role = roleById[i.id]; // structural role for context-aware worth
+        return c;
+    });
+    const itemsSection = `ITEMS TO JUDGE (each receives exactly one verdict):\n${JSON.stringify(compactItems, null, 2)}`;
+    const userSection = includeUserTurn ? `USER:\n${userMessage}\n\n---\n\n` : "";
+    const userInput = `${sceneCardSection}${userSection}${thinkingSection}AGENT OUTPUT:\n${agentOutput}\n\n---\n\n${itemsSection}`;
+    let judgePrompt = PASS_JUDGE_PROMPT;
+    if (includeUserTurn)
+        judgePrompt += PASS_JUDGE_TWO_PARTY_SUFFIX;
+    if (includeRole)
+        judgePrompt += PASS_JUDGE_ROLE_SUFFIX;
+    const r = await provider.generateStructured(judgePrompt, userInput, PASS_JUDGE_SCHEMA, {
+        thinkingBudget,
+        maxOutputTokens: 8192,
+        modelOverride: modelForPass("judge"),
+    });
+    if (r.result && !Array.isArray(r.result.verdicts)) {
+        // SEAM contract: a judge result MUST carry verdicts[]. Provider variance can
+        // return a truthy object without it, and consuming that crashes every caller
+        // (.filter on undefined took down the whole v2 front-half, 2026-06-11).
+        // Malformed = failed → null it so the KEEP-ALL degrade below applies (a failed
+        // selector must never drop residue).
+        console.warn("Auto-Reflect JUDGE: malformed result (missing verdicts[]) — treating as failed");
+        r.result = null;
+    }
+    if (r.result) {
+        // Judge has its own token slot so cost_breakdown attributes it once, to the
+        // judge — not double-counted against pass1 (D-fix 2026-05-25).
+        reflectTokenStats.pass_judge.input += r.usage?.input ?? 0;
+        reflectTokenStats.pass_judge.thinking += r.usage?.thinking ?? 0;
+        reflectTokenStats.pass_judge.output += r.usage?.output ?? 0;
+        reflectTokenStats.pass_judge.calls += 1;
+        const drops = r.result.verdicts.filter(v => v.verdict === "DROP");
+        const cats = drops.reduce((acc, v) => { acc[v.reason_category] = (acc[v.reason_category] || 0) + 1; return acc; }, {});
+        const catSummary = Object.entries(cats).map(([k, n]) => `${k}=${n}`).join(", ") || "(none)";
+        console.log(`Auto-Reflect JUDGE: ${pass1Items.length} → ${pass1Items.length - drops.length} kept (${drops.length} dropped: ${catSummary}) | tokens: in=${r.usage?.input ?? "?"} think=${r.usage?.thinking ?? "?"} out=${r.usage?.output ?? "?"}`);
+        for (const v of drops) {
+            const note = v.notes ? ` — ${v.notes}` : "";
+            console.log(`  [JUDGE drop] ${v.item_id} [${v.reason_category}]${note}`);
+        }
+        // all-sources mode emits a two-prong rationale per item — log it so keep/drop is auditable
+        for (const v of r.result.verdicts) {
+            if (v.reasoning)
+                console.log(`  [JUDGE ${v.verdict}] ${v.item_id} :: ${v.reasoning}`);
+        }
+    }
+    else {
+        console.warn(`Auto-Reflect JUDGE: ${r.rateLimited ? "rate limited" : "failed"} — degrading to KEEP-ALL (no items dropped)`);
+    }
+    return { result: r.result, rateLimited: r.rateLimited, model: r.model, attempts: r.attempts };
+}
+/**
+ * Apply judge verdicts to Pass 1 items, with safe ref-cleanup.
+ *
+ * Rules:
+ *   1. If judge result is null (call failed), pass-through ALL items — judge failure
+ *      must never silently drop residue. Precision is an improvement, not a blocker.
+ *   2. If a KEPT item references a DROPPED item via extends_id (the only intra-batch
+ *      reference Pass 1 carries), override the drop and KEEP the parent too. Never
+ *      lose an anchor of something we're keeping — preserves the asymmetric cost.
+ *      Records the override for audit.
+ *   3. Items missing from the judge's verdicts default to KEEP (defensive — never
+ *      silently drop on judge omission).
+ *
+ * Returns the kept item set, the final dropped verdicts (post-override), and the list
+ * of anchor overrides for the turn log.
+ */
+export function applyJudgeVerdicts(pass1Items, judge) {
+    if (!judge)
+        return { kept: pass1Items, dropped: [], anchorOverrides: [] };
+    const verdictById = new Map(judge.verdicts.map(v => [v.item_id, v]));
+    const dropIds = new Set();
+    for (const v of judge.verdicts) {
+        if (v.verdict === "DROP")
+            dropIds.add(v.item_id);
+    }
+    // Anchor override: if a kept item's extends_id points to a dropped item, override
+    // the drop. Pass 1's "extends_id" by definition means the child is meaningless
+    // without the parent — keeping the child requires keeping the parent.
+    const anchorOverrides = [];
+    for (const item of pass1Items) {
+        if (!item.extends_id)
+            continue;
+        if (dropIds.has(item.id))
+            continue; // child is dropped too — cascade is fine
+        if (dropIds.has(item.extends_id)) {
+            dropIds.delete(item.extends_id);
+            anchorOverrides.push(item.extends_id);
+        }
+    }
+    // Final dropped set: only verdicts whose ids are still in dropIds after overrides
+    const dropped = judge.verdicts.filter(v => v.verdict === "DROP" && dropIds.has(v.item_id));
+    const kept = pass1Items.filter(i => !dropIds.has(i.id));
+    return { kept, dropped, anchorOverrides };
+}
+//# sourceMappingURL=pass_judge.js.map

package/dist/middleware/reflect/pass_judge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pass_judge.js","sourceRoot":"","sources":["../../../src/middleware/reflect/pass_judge.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,EAAqB,YAAY,EAAE,MAAM,aAAa,CAAC;AAI9D,kFAAkF;AAClF,4DAA4D;AAC5D,EAAE;AACF,gFAAgF;AAChF,yEAAyE;AACzE,sEAAsE;AACtE,EAAE;AACF,uEAAuE;AACvE,yEAAyE;AACzE,+DAA+D;AAC/D,EAAE;AACF,kFAAkF;AAClF,iFAAiF;AACjF,4EAA4E;AAC5E,qCAAqC;AACrC,0EAA0E;AAC1E,sEAAsE;AACtE,EAAE;AACF,sBAAsB;AACtB,gEAAgE;AAChE,4EAA4E;AAC5E,iFAAiF;AACjF,qDAAqD;AACrD,0EAA0E;AAC1E,gFAAgF;AAChF,2DAA2D;AAC3D,kFAAkF;AAElF,MAAM,CAAC,MAAM,iBAAiB,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAmEhC,CAAC;AAEF,MAAM,iBAAiB,GAAG;IACxB,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,QAAQ,EAAE;YACR,IAAI,EAAE,OAAO;YACb,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBAC3B,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;oBACnD,eAAe,EAAE;wBACf,IAAI,EAAE,QAAQ;wBACd,IAAI,EAAE,CAAC,uBAAuB,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,0BAA0B,CAAC;qBACxG;oBACD,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACzB,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;iBAC9B;gBACD,QAAQ,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,iBAAiB,CAAC;aACpD;SACF;KACF;IACD,QAAQ,EAAE,CAAC,UAAU,CAAC;CACvB,CAAC;AAcF,oFAAoF;AACpF,qFAAqF;AACrF,uFAAuF;AACvF,kFAAkF;AAClF,qFAAqF;AACrF,wFAAwF;AACxF,MAAM,2BAA2B,GAAG;;;;;;;;8DAQ0B,CAAC;AAE/D,0EAA0E;AAC1E,uFAAuF;AACvF,qFAAqF;AACrF,6DAA6D;AAC7D,MAAM,sBAAsB,GAAG;;;;;;;;;;;+BAWA,CAAC;AAEhC,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAqB,EACrB,UAAuB,EACvB,SAA6B,EAC7B,aAAqB,EACrB,WAAmB,EACnB,cAAc,GAAG,IAAI,EACrB,cAAsB,EAAE,EACxB,WAAmC,EAAE;IAErC,MAAM,gBAAgB,GAAG,SAAS;QAChC,CAAC,CAAC,0DAA0D,SAAS,aAAa;QAClF,CAAC,CAAC,EAAE,CAAC;IACP,MAAM,eAAe,GAAG,aAAa;QACnC,CAAC,CAAC,oBAAoB,aAAa,aAAa;QAChD,CAAC,CAAC,EAAE,CAAC;IACP,8EAA8E;IAC9E,sEAAsE;IACtE,MAAM,eAAe,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9D,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,2BAA2B;IACjF,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACtC,MAAM,CAAC,GAA4B,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC,gBAAgB,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACpG,IAAI,eAAe;YAAE,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,kEAAkE;QAC9G,IAAI,WAAW,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,0CAA0C;QACtG,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IACH,MAAM,YAAY,GAAG,wDAAwD,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;IAErH,MAAM,WAAW,GAAG,eAAe,CAAC,CAAC,CAAC,UAAU,WAAW,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9E,MAAM,SAAS,GAAG,GAAG,gBAAgB,GAAG,WAAW,GAAG,eAAe,kBAAkB,WAAW,cAAc,YAAY,EAAE,CAAC;IAC/H,IAAI,WAAW,GAAG,iBAAiB,CAAC;IACpC,IAAI,eAAe;QAAE,WAAW,IAAI,2BAA2B,CAAC;IAChE,IAAI,WAAW;QAAE,WAAW,IAAI,sBAAsB,CAAC;IAEvD,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CAAkB,WAAW,EAAE,SAAS,EAAE,iBAAiB,EAAE;QACtG,cAAc;QACd,eAAe,EAAE,IAAI;QACrB,aAAa,EAAE,YAAY,CAAC,OAAO,CAAC;KACrC,CAAC,CAAC;IAEH,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAE,CAAC,CAAC,MAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC3D,6EAA6E;QAC7E,6EAA6E;QAC7E,wEAAwE;QACxE,+EAA+E;QAC/E,qCAAqC;QACrC,OAAO,CAAC,IAAI,CAAC,gFAAgF,CAAC,CAAC;QAC/F,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACb,4EAA4E;QAC5E,+DAA+D;QAC/D,iBAAiB,CAAC,UAAU,CAAC,KAAK,IAAO,CAAC,CAAC,KAAK,EAAE,KAAK,IAAO,CAAC,CAAC;QAChE,iBAAiB,CAAC,UAAU,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC;QAChE,iBAAiB,CAAC,UAAU,CAAC,MAAM,IAAM,CAAC,CAAC,KAAK,EAAE,MAAM,IAAM,CAAC,CAAC;QAChE,iBAAiB,CAAC,UAAU,CAAC,KAAK,IAAO,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAyB,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/I,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC;QAC5F,OAAO,CAAC,GAAG,CAAC,uBAAuB,UAAU,CAAC,MAAM,MAAM,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,UAAU,KAAK,CAAC,MAAM,aAAa,UAAU,kBAAkB,CAAC,CAAC,KAAK,EAAE,KAAK,IAAI,GAAG,UAAU,CAAC,CAAC,KAAK,EAAE,QAAQ,IAAI,GAAG,QAAQ,CAAC,CAAC,KAAK,EAAE,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC;QAClP,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5C,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,eAAe,IAAI,IAAI,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,2FAA2F;QAC3F,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,CAAC,SAAS;gBAAE,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,6CAA6C,CAAC,CAAC;IAC9H,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AAChG,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,kBAAkB,CAChC,UAAuB,EACvB,KAA6B;IAE7B,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;IAE1E,MAAM,WAAW,GAAG,IAAI,GAAG,CAA2B,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACnD,CAAC;IAED,kFAAkF;IAClF,+EAA+E;IAC/E,sEAAsE;IACtE,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,SAAS;QAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,yCAAyC;QAC7E,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACjC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAChC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,kFAAkF;IAClF,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3F,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;AAC5C,CAAC"}