nodedex 0.1.0

package/dist/middleware/reflect/pass4-slice.js

@@ -0,0 +1,315 @@
+// ═══════════════════════════════════════════════════════════════════════════════
+// PASS 4 — SLICE BUILDER (production gap ⑤: scale — replace the full-graph dump)
+// ═══════════════════════════════════════════════════════════════════════════════
+//
+// WHAT IT DOES
+//   Builds the PROJECT GRAPH context Pass 4 reasons over — but as a RETRIEVED
+//   SLICE instead of buildProjectContext's whole-graph dump. Pass 4's job is
+//   unchanged (link this-turn's new blocks to existing blocks BY MEANING); this
+//   only changes WHAT it sees, never HOW it decides. The slice is RECALL only —
+//   it narrows the field to plausible candidates; the link is still Pass 4's
+//   meaning judgment, per pair. "In the slice" never implies "link it."
+//
+// HOW IT NARROWS (two paths — mirrors how the AGENT navigates cross-root, and
+// reuses the exact same substrate: deriveRootRelatedness + the chain abstraction):
+//
+//   FOLLOW TRUTH (certain, no threshold) — for each new block, pull candidates
+//     from its OWN root PLUS every root in its Venn overlap. A cross-root edge is
+//     RECORDED truth that two roots are related (deriveRootRelatedness); there is
+//     no "related enough" — edge present ⟹ descend. Root-level relatedness does
+//     NOT pre-decide any block-level link; it only widens the candidate field.
+//
+//   GUESS (fuzzy, first-ever links only) — retrieveGraphSlice's identity/semantic
+//     net surfaces candidates in roots with NO overlap yet, where there is no
+//     recorded edge to follow. This is the only place similarity enters.
+//
+// HOW IT PRESENTS (coarse → fine — "the chain is the unit of meaning; the block
+// is the entry point", agent.md Rule 2):
+//   • CHAINS as units (chain block essence = the arc summary) to let Pass 4 find
+//     the right neighbourhood, THEN
+//   • the individual MEMBER blocks at full detail so Pass 4 can name the exact
+//     link target (relations are block→block; you cannot link to a summary).
+//   • loose blocks (chain_id = null) presented individually.
+//
+// Default OFF (NODEDEX_PASS4_SLICE=1). Small graphs fall back to the dump (the
+// caller's buildProjectContext) — slicing only earns its keep at scale.
+import { cosineSim } from "../../engine/vector-math.js";
+import { intFromEnv } from "./config.js";
+import { deriveRootRelatedness } from "./root-relatedness.js";
+import { retrieveGraphSlice } from "./retrieve-graph-slice.js";
+import { extractPrimaryValueFromUnique } from "./dedup-by-source-and-value.js";
+// ─── Config (env-gated; safe defaults) ──────────────────────────────────────────
+/** Default ON (promoted 2026-06-14 — validated; falls back to the full dump under the
+ *  small-graph threshold). Set NODEDEX_PASS4_SLICE=0 to opt out. */
+export function pass4SliceEnabled() {
+    return process.env.NODEDEX_PASS4_SLICE !== "0";
+}
+/** Below this many blocks the dump is fine + cheaper than k retrievals → fall back. */
+export function pass4SliceMinGraph() {
+    return intFromEnv("NODEDEX_PASS4_SLICE_MIN_GRAPH", 150);
+}
+// ─── Semantic-delta net (drift recall) — default OFF, sub-feature of the slice ──
+// Surfaces a SMALL, CAPPED, TAGGED set of existing blocks that are MEANING-near a
+// new block but were missed by structure + identity (wording drift). It is a pure
+// RECALL net: NOT weighted into the trusted ranking — appended separately, marked
+// "unconfirmed", and judged by Pass 4. Reads STORED embeddings (no embed call).
+export function semanticDeltaEnabled() {
+    return process.env.NODEDEX_PASS4_SEMANTIC_DELTA === "1";
+}
+export function semanticDeltaK() {
+    return intFromEnv("NODEDEX_PASS4_SEMANTIC_DELTA_K", 5);
+}
+// Below this cosine, "near" is noise — don't even introduce it to the judge.
+const SEMANTIC_DELTA_FLOOR = 0.5;
+// ─── Pure-ish helpers ────────────────────────────────────────────────────────────
+function parseObject(s) {
+    if (s && typeof s === "object")
+        return s;
+    if (typeof s !== "string" || !s)
+        return {};
+    try {
+        const p = JSON.parse(s);
+        return p && typeof p === "object" ? p : {};
+    }
+    catch {
+        return {};
+    }
+}
+function parseConcepts(s) {
+    if (Array.isArray(s))
+        return s.filter((x) => typeof x === "string");
+    if (typeof s !== "string" || !s)
+        return [];
+    try {
+        const p = JSON.parse(s);
+        return Array.isArray(p) ? p.filter((x) => typeof x === "string") : [];
+    }
+    catch {
+        return [];
+    }
+}
+/** unique{} primary value (identity), via the same extractor RETRIEVE + AUDIT use. */
+function uniquePrimary(block) {
+    const content = parseObject(block.content);
+    const unique = parseObject(content.unique);
+    try {
+        return extractPrimaryValueFromUnique(block.type, unique) || "";
+    }
+    catch {
+        return "";
+    }
+}
+/** unique{} fields rendered compactly for a context line (≤4 pairs, mirrors pipeline). */
+function uniqueFieldsStr(block) {
+    const content = parseObject(block.content);
+    const unique = parseObject(content.unique);
+    const pairs = Object.entries(unique)
+        .filter(([, v]) => v && String(v).trim())
+        .slice(0, 4)
+        .map(([k, v]) => `${k}: "${String(v).slice(0, 80)}"`);
+    return pairs.length ? ` | unique: { ${pairs.join(", ")} }` : "";
+}
+/** The {project} (owner) segment of a strict label {project}_{type}_{concept}. */
+function labelPrefix(label) {
+    const i = (label ?? "").indexOf("_");
+    return i === -1 ? (label ?? "") : label.slice(0, i);
+}
+function blockLine(block, indent) {
+    return `${indent}${block.label} | ${block.id} [${block.type}] — "${(block.essence || "").slice(0, 140)}"${uniqueFieldsStr(block)}`;
+}
+/** Parse a stored embedding (JSON array string, or already an array) → vector or null. */
+function parseEmbedding(v) {
+    if (Array.isArray(v))
+        return v.length ? v : null;
+    if (typeof v !== "string" || !v)
+        return null;
+    try {
+        const p = JSON.parse(v);
+        return Array.isArray(p) && p.length ? p : null;
+    }
+    catch {
+        return null;
+    }
+}
+/** Cosine similarity of two equal-length vectors. 0 if shapes mismatch. */
+// ─── Main entry ──────────────────────────────────────────────────────────────────
+/**
+ * Build the retrieved-slice PROJECT GRAPH body for Pass 4. Returns the same shape
+ * as buildProjectContext ({ context, reflectedIds }) so it is a drop-in swap at
+ * the call site. `context` is the body Pass 4 wraps in "PROJECT GRAPH (...):".
+ */
+export function buildPass4Slice(db, newBlocks, opts = {}) {
+    const netK = opts.netK ?? 5;
+    const maxBlocks = opts.maxBlocks ?? 120;
+    if (!newBlocks || newBlocks.length === 0)
+        return { context: "", reflectedIds: [] };
+    const allBlocks = db.getAllBlocks();
+    const newIds = new Set(newBlocks.map((b) => b.id));
+    // Root maps (label ⇄ id). deriveRootRelatedness speaks in LABELS; member blocks
+    // carry their root id in project_id — so we need both directions.
+    const rootIdByLabel = new Map();
+    const rootLabelById = new Map();
+    for (const b of allBlocks) {
+        if (b.type === "project") {
+            rootIdByLabel.set(b.label, b.id);
+            rootLabelById.set(b.id, b.label);
+        }
+    }
+    // ── 1. ANCHOR ROOTS — the new blocks' own roots (project_id, else label prefix) ──
+    const anchorRootLabels = new Set();
+    for (const b of newBlocks) {
+        const pid = b.project_id;
+        if (pid && rootLabelById.has(pid))
+            anchorRootLabels.add(rootLabelById.get(pid));
+        const pref = labelPrefix(b.label);
+        if (rootIdByLabel.has(pref))
+            anchorRootLabels.add(pref);
+    }
+    // ── 2. RELATED ROOTS (FOLLOW TRUTH) — Venn overlap from recorded cross-root edges ──
+    const relatedRootLabels = new Set();
+    try {
+        for (const pair of deriveRootRelatedness(db).pairs) {
+            if (anchorRootLabels.has(pair.root_a))
+                relatedRootLabels.add(pair.root_b);
+            if (anchorRootLabels.has(pair.root_b))
+                relatedRootLabels.add(pair.root_a);
+        }
+    }
+    catch { /* best-effort — a relatedness failure must not sink Pass 4 */ }
+    const neighbourhoodLabels = new Set([...anchorRootLabels, ...relatedRootLabels]);
+    const neighbourhoodIds = new Set();
+    for (const lbl of neighbourhoodLabels) {
+        const id = rootIdByLabel.get(lbl);
+        if (id)
+            neighbourhoodIds.add(id);
+    }
+    // ── 3. NEIGHBOURHOOD MEMBERS — atomic blocks owned by anchor ∪ related roots ──
+    const surfaced = new Map();
+    for (const b of allBlocks) {
+        if (b.type === "project")
+            continue;
+        // No status filter: getAllBlocks() already excludes archived — match the
+        // dump (buildProjectContext) this replaces, so it stays a faithful swap.
+        if (newIds.has(b.id))
+            continue; // never link a new block against itself
+        const pid = b.project_id;
+        const inByPid = pid != null && neighbourhoodIds.has(pid);
+        const inByPrefix = neighbourhoodLabels.has(labelPrefix(b.label));
+        if (inByPid || inByPrefix)
+            surfaced.set(b.id, b);
+    }
+    // ── 4. FIRST-EVER NET (GUESS) — similarity candidates in not-yet-overlapping roots ──
+    for (const nb of newBlocks) {
+        const primary = uniquePrimary(nb);
+        const entity = {
+            canonical_name: nb.label.replace(/-/g, " "),
+            primary_values: primary ? [primary] : [],
+            concepts: parseConcepts(nb.concepts),
+        };
+        let candidates;
+        try {
+            candidates = retrieveGraphSlice(db, entity, { k: netK });
+        }
+        catch {
+            continue;
+        }
+        for (const c of candidates) {
+            const b = c.block;
+            if (!b || b.type === "project" || newIds.has(b.id) || b.status !== "active")
+                continue;
+            if (!surfaced.has(b.id))
+                surfaced.set(b.id, b);
+        }
+    }
+    // Token guard: cap total surfaced blocks (FOLLOW-TRUTH neighbourhood first,
+    // already inserted before the net, so the cap drops the weakest net hits first).
+    let surfacedBlocks = [...surfaced.values()];
+    if (surfacedBlocks.length > maxBlocks)
+        surfacedBlocks = surfacedBlocks.slice(0, maxBlocks);
+    // ── 4b. SEMANTIC DELTA (drift recall net) — UNWEIGHTED, separate, capped, $0 ──
+    // Pure recall: existing blocks MEANING-near a new block but missed by structure
+    // + identity (wording drift). Reads STORED vectors (no embed call). NOT ranked
+    // into the trusted set — appended as a small tagged delta the LLM judges by
+    // meaning. Excludes anything already surfaced + the new blocks themselves.
+    const deltaScored = [];
+    if (semanticDeltaEnabled()) {
+        const queryVecs = newBlocks
+            .map((b) => parseEmbedding(b.embedding))
+            .filter((v) => !!v);
+        if (queryVecs.length > 0) {
+            const surfacedIds = new Set(surfacedBlocks.map((b) => b.id));
+            for (const b of allBlocks) {
+                if (b.type === "project" || newIds.has(b.id) || surfacedIds.has(b.id))
+                    continue;
+                if (b.status !== "active")
+                    continue;
+                const vec = parseEmbedding(b.embedding);
+                if (!vec)
+                    continue;
+                let best = 0;
+                for (const q of queryVecs) {
+                    const s = cosineSim(q, vec);
+                    if (s > best)
+                        best = s;
+                }
+                if (best >= SEMANTIC_DELTA_FLOOR)
+                    deltaScored.push({ block: b, sim: best });
+            }
+            deltaScored.sort((a, b) => b.sim - a.sim);
+            deltaScored.length = Math.min(deltaScored.length, semanticDeltaK());
+        }
+    }
+    if (deltaScored.length > 0) {
+        console.log(`[pass4-slice] semantic delta: ${deltaScored.length} candidate(s) — ` +
+            deltaScored.map((d) => `${d.block.label}(${d.sim.toFixed(2)})`).join(", "));
+    }
+    if (surfacedBlocks.length === 0 && deltaScored.length === 0)
+        return { context: "", reflectedIds: [] };
+    // ── 5. PRESENT COARSE → FINE — group by chain_id; chain block essence = the arc ──
+    const byChain = new Map();
+    const loose = [];
+    for (const b of surfacedBlocks) {
+        const cid = b.chain_id;
+        if (cid) {
+            let arr = byChain.get(cid);
+            if (!arr) {
+                arr = [];
+                byChain.set(cid, arr);
+            }
+            arr.push(b);
+        }
+        else
+            loose.push(b);
+    }
+    const lines = [];
+    for (const [chainId, members] of byChain) {
+        // Canonical chain_id IS the blk_ id of the materialized type:"chain" block.
+        let header = `CHAIN ${chainId}`;
+        try {
+            const cb = db.getBlock(chainId);
+            if (cb && cb.type === "chain")
+                header = `CHAIN ${cb.label} — "${(cb.essence || "").slice(0, 160)}"`;
+        }
+        catch { /* tolerate — fall back to the bare chain id header */ }
+        lines.push(header);
+        for (const m of members)
+            lines.push(blockLine(m, "    "));
+    }
+    if (loose.length > 0) {
+        lines.push("[loose blocks]");
+        for (const b of loose)
+            lines.push(blockLine(b, "    "));
+    }
+    // Semantic delta — kept SEPARATE + tagged so Pass 4 scrutinizes by meaning,
+    // never links on resemblance. sim shown for the judge's calibration.
+    if (deltaScored.length > 0) {
+        lines.push("[semantically related — UNCONFIRMED; link ONLY if the meaning clearly matches, not on resemblance]");
+        for (const { block, sim } of deltaScored)
+            lines.push(`${blockLine(block, "    ")}  (sim ${sim.toFixed(2)})`);
+    }
+    return {
+        context: lines.join("\n"),
+        reflectedIds: [...surfacedBlocks.map((b) => b.id), ...deltaScored.map((d) => d.block.id)],
+    };
+}
+//# sourceMappingURL=pass4-slice.js.map

package/dist/middleware/reflect/pass4-slice.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pass4-slice.js","sourceRoot":"","sources":["../../../src/middleware/reflect/pass4-slice.ts"],"names":[],"mappings":"AAAA,kFAAkF;AAClF,iFAAiF;AACjF,kFAAkF;AAClF,EAAE;AACF,eAAe;AACf,8EAA8E;AAC9E,6EAA6E;AAC7E,gFAAgF;AAChF,gFAAgF;AAChF,6EAA6E;AAC7E,wEAAwE;AACxE,EAAE;AACF,8EAA8E;AAC9E,mFAAmF;AACnF,EAAE;AACF,+EAA+E;AAC/E,kFAAkF;AAClF,kFAAkF;AAClF,gFAAgF;AAChF,+EAA+E;AAC/E,EAAE;AACF,kFAAkF;AAClF,8EAA8E;AAC9E,yEAAyE;AACzE,EAAE;AACF,gFAAgF;AAChF,yCAAyC;AACzC,iFAAiF;AACjF,oCAAoC;AACpC,+EAA+E;AAC/E,6EAA6E;AAC7E,6DAA6D;AAC7D,EAAE;AACF,+EAA+E;AAC/E,wEAAwE;AAGxE,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAoB,MAAM,2BAA2B,CAAC;AACjF,OAAO,EAAE,6BAA6B,EAAE,MAAM,gCAAgC,CAAC;AAE/E,mFAAmF;AAEnF;oEACoE;AACpE,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,GAAG,CAAC,mBAAmB,KAAK,GAAG,CAAC;AACjD,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,kBAAkB;IAChC,OAAO,UAAU,CAAC,+BAA+B,EAAE,GAAG,CAAC,CAAC;AAC1D,CAAC;AAED,mFAAmF;AACnF,kFAAkF;AAClF,kFAAkF;AAClF,kFAAkF;AAClF,gFAAgF;AAChF,MAAM,UAAU,oBAAoB;IAClC,OAAO,OAAO,CAAC,GAAG,CAAC,4BAA4B,KAAK,GAAG,CAAC;AAC1D,CAAC;AACD,MAAM,UAAU,cAAc;IAC5B,OAAO,UAAU,CAAC,gCAAgC,EAAE,CAAC,CAAC,CAAC;AACzD,CAAC;AACD,6EAA6E;AAC7E,MAAM,oBAAoB,GAAG,GAAG,CAAC;AASjC,oFAAoF;AAEpF,SAAS,WAAW,CAAC,CAAU;IAC7B,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,CAA4B,CAAC;IACpE,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3C,IAAI,CAAC;QAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAAC,OAAO,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAAC,CAAC;IAC5E,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;AACtB,CAAC;AAED,SAAS,aAAa,CAAC,CAAU;IAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;IACpE,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3C,IAAI,CAAC;QAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAAC,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAAC,CAAC;IACvG,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;AACtB,CAAC;AAED,sFAAsF;AACtF,SAAS,aAAa,CAAC,KAAY;IACjC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC;QAAC,OAAO,6BAA6B,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC;IAAC,CAAC;IACvE,MAAM,CAAC;QAAC,OAAO,EAAE,CAAC;IAAC,CAAC;AACtB,CAAC;AAED,0FAA0F;AAC1F,SAAS,eAAe,CAAC,KAAY;IACnC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;SACjC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SACxC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IACxD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAClE,CAAC;AAED,kFAAkF;AAClF,SAAS,WAAW,CAAC,KAAa;IAChC,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACrC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,SAAS,CAAC,KAAY,EAAE,MAAc;IAC7C,OAAO,GAAG,MAAM,GAAG,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;AACrI,CAAC;AAED,0FAA0F;AAC1F,SAAS,cAAc,CAAC,CAAU;IAChC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,CAAc,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/D,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,IAAI,CAAC;QAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAAC,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;AACzG,CAAC;AAED,2EAA2E;AAC3E,oFAAoF;AAEpF;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAC7B,EAAe,EACf,SAAkB,EAClB,OAAuB,EAAE;IAEzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC;IAExC,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;IAEnF,MAAM,SAAS,GAAG,EAAE,CAAC,YAAY,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnD,gFAAgF;IAChF,kEAAkE;IAClE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAAC,CAAC;IACnG,CAAC;IAED,oFAAoF;IACpF,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAI,CAAS,CAAC,UAA2B,CAAC;QACnD,IAAI,GAAG,IAAI,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,gBAAgB,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC;QACjF,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC;IAED,sFAAsF;IACtF,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5C,IAAI,CAAC;QACH,KAAK,MAAM,IAAI,IAAI,qBAAqB,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;YACnD,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBAAE,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1E,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;gBAAE,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IAAC,MAAM,CAAC,CAAC,8DAA8D,CAAC,CAAC;IAE1E,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,gBAAgB,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC;IACzF,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,mBAAmB,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,EAAE;YAAE,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,iFAAiF;IACjF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;YAAE,SAAS;QACnC,yEAAyE;QACzE,yEAAyE;QACzE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,wCAAwC;QACxE,MAAM,GAAG,GAAI,CAAS,CAAC,UAA2B,CAAC;QACnD,MAAM,OAAO,GAAG,GAAG,IAAI,IAAI,IAAI,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,mBAAmB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACjE,IAAI,OAAO,IAAI,UAAU;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,uFAAuF;IACvF,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,MAAM,GAAgB;YAC1B,cAAc,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3C,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE;YACxC,QAAQ,EAAE,aAAa,CAAE,EAAU,CAAC,QAAQ,CAAC;SAC9C,CAAC;QACF,IAAI,UAAU,CAAC;QACf,IAAI,CAAC;YAAC,UAAU,GAAG,kBAAkB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAAC,CAAC;QACjE,MAAM,CAAC;YAAC,SAAS;QAAC,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YAClB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;gBAAE,SAAS;YACtF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,iFAAiF;IACjF,IAAI,cAAc,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,IAAI,cAAc,CAAC,MAAM,GAAG,SAAS;QAAE,cAAc,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAE3F,iFAAiF;IACjF,gFAAgF;IAChF,+EAA+E;IAC/E,4EAA4E;IAC5E,2EAA2E;IAC3E,MAAM,WAAW,GAAyC,EAAE,CAAC;IAC7D,IAAI,oBAAoB,EAAE,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,SAAS;aACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAE,CAAS,CAAC,SAAS,CAAC,CAAC;aAChD,MAAM,CAAC,CAAC,CAAC,EAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7D,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAChF,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;oBAAE,SAAS;gBACpC,MAAM,GAAG,GAAG,cAAc,CAAE,CAAS,CAAC,SAAS,CAAC,CAAC;gBACjD,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,IAAI,IAAI,GAAG,CAAC,CAAC;gBACb,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;oBAAC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAAC,IAAI,CAAC,GAAG,IAAI;wBAAE,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;gBACnF,IAAI,IAAI,IAAI,oBAAoB;oBAAE,WAAW,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;YAC9E,CAAC;YACD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1C,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IACD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,iCAAiC,WAAW,CAAC,MAAM,kBAAkB;YAC/E,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAChF,CAAC;IAED,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;IAEtG,oFAAoF;IACpF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3C,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAI,CAAS,CAAC,QAAyB,CAAC;QACjD,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;gBAAC,GAAG,GAAG,EAAE,CAAC;gBAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAAC,CAAC;YAC9C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;;YAAM,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;QACzC,4EAA4E;QAC5E,IAAI,MAAM,GAAG,SAAS,OAAO,EAAE,CAAC;QAChC,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAChC,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO;gBAAE,MAAM,GAAG,SAAS,EAAE,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;QACtG,CAAC;QAAC,MAAM,CAAC,CAAC,sDAAsD,CAAC,CAAC;QAClE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,4EAA4E;IAC5E,qEAAqE;IACrE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,oGAAoG,CAAC,CAAC;QACjH,KAAK,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,WAAW;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,UAAU,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/G,CAAC;IAED,OAAO;QACL,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QACzB,YAAY,EAAE,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;KAC1F,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,30 @@
+import type { LLMProvider } from "../../engine/ai-provider.js";
+export declare const PASS4_PROMPT = "You receive two things:\n  NEW BLOCKS \u2014 blocks just saved this turn (label, id, type, essence, existing relations)\n  PROJECT GRAPH \u2014 existing blocks from prior sessions\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 (NEW BLOCKS, PROJECT GRAPH).\nYour training knowledge and \"what's commonly true in this domain\" are NOT state.\nA block exists ONLY if it appears in one of the two marked regions. Familiarity \u2260\nrecorded. When the DIRECTNESS CHECK asks \"is there another block Z that already\nconnects X to Y?\", Z must be a real label from NEW BLOCKS or PROJECT GRAPH \u2014 not\na block you imagine should exist.\n\nYour ONLY job: find missing connections between a NEW BLOCK and an EXISTING block.\nOutput relation tuples only. No new blocks. No block content. Just arrows.\n\n\u2500\u2500 SCOPE \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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\n  New block \u2194 existing block: YES \u2014 this is your job.\n  New block \u2194 new block (same batch): NEVER \u2014 already decided by an earlier pass.\n  Reversing an existing relation: NEVER \u2014 earlier passes had the transcript.\n\nIf a new block already has relations in its \"chain:\" section, those are DECIDED.\nDo not re-derive, reverse, or duplicate them.\n\n\u2500\u2500 DIRECTION \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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\nTHE SOURCE DEPENDS ON THE TARGET.\n\"Which block needs the other to make sense?\" \u2014 that block is the source.\n\n\u2500\u2500 FOR EACH (NEW BLOCK, EXISTING BLOCK) PAIR \u2014 RUN THIS TREE \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nAnswer from the essences only. When uncertain at any step, answer NO.\nA missing link is recoverable next session; a wrong link is not.\n\nIn all steps, (X) and (Y) can be either the new block or the existing block.\nDirection follows the question's answer, not which block is newer.\n\nSTEP 1 \u2014 IDENTITY: \"Are (X) and (Y) about the same concept, mechanism, or role?\"\n\n  NO \u2192 go to STEP 2.\n\n  YES \u2192 STEP 1b: \"Does (X) make (Y) obsolete \u2014 same role, newer state?\"\n    YES \u2192 supersedes  { source: X (newer), target: Y (older) }\n          Only valid between same category (decision\u2194decision, blueprint\u2194blueprint,\n          decision\u2194blueprint). STOP \u2014 do not continue to STEP 2 for this pair.\n    NO  \u2192 STEP 1c: \"Does (X) add scope on top of (Y), where (Y) still stands alone?\"\n      YES \u2192 extends  { source: X (addition), target: Y (foundation) }\n            STOP \u2014 do not continue to STEP 2 for this pair.\n      NO  \u2192 go to STEP 2.\n\nSTEP 2 \u2014 CAUSALITY: Ask 2a and 2b independently. A pair can produce both.\n\n  2a \u2014 \"Would (X) exist if (Y) had never happened?\"\n    YES \u2192 no prompted_by for this pair.\n    NO  \u2192 DIRECTNESS CHECK before wiring:\n      \"Is there another block (Z) \u2014 in (X)'s chain or in NEW BLOCKS \u2014 that (X)\n      depends on more directly, where (Z) itself depends on or relates to (Y)?\"\n        YES \u2192 (Y) is an ancestor, not the direct cause. The path from (X) to (Y)\n              already runs through (Z). Skip \u2014 do not wire prompted_by.\n        NO  \u2192 (Y) is the most immediate cause.\n              prompted_by  { source: X (effect), target: Y (cause) }\n\n  2b \u2014 \"Would (X)'s claim be unsupported without (Y)'s specific finding?\"\n    NO  \u2192 no based_on for this pair.\n    YES \u2192 DIRECTNESS CHECK before wiring:\n      \"Is there another block (Z) that (X) already relies on, where (Z) itself\n      draws on (Y) as its evidence?\"\n        YES \u2192 (Y)'s evidence already reaches (X) through (Z). Skip.\n        NO  \u2192 (Y) is direct evidence for (X).\n              based_on  { source: X (claim), target: Y (evidence) }\n\nSTEP 3 \u2014 RESOLVES: Only ask when (Y) has type = question OR type = hypothesis.\n\n  \"Does (X) directly answer or settle what (Y) asks or proposes?\"\n    YES \u2192 resolves  { source: X (answer/finding), target: Y (question/hypothesis) }\n    NO  \u2192 no relation for this pair.\n\n\u2500\u2500 TERMINAL \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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\nAfter checking every (new block, existing block) pair:\n  No question answered YES for any pair \u2192 output empty relations array.\n\n\u2500\u2500 REASONING (REQUIRED PER RELATION) \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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\nFor each emitted relation, the reason field MUST cite SPECIFIC source-target\nlabels and name which TREE STEP fired (1b supersedes / 1c extends / 2a\nprompted_by / 2b based_on / 3 resolves), in \u2264200 chars. Mirror Pass 5's\nper-chain reasoning shape: WHY this direction, citing the concrete labels.\n\nA reason that says only \"they are related\" or \"X relates to Y\" without\nnaming the TREE STEP that fired fails the contract \u2014 do not emit relations\nwhose direction you cannot defend by naming the specific step.\n\nExamples of valid reasons:\n  \"2a prompted_by: project-X_decision_databricks would not exist without\n   project-X_constraint_no-vendor-lock \u2014 constraint was prior.\"\n  \"1b supersedes: project-Y_decision_use-postgres is newer same-role\n   replacement for project-Y_decision_use-sqlite.\"\n\n\u2500\u2500 RULES \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\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\n- Only output MISSING relations \u2014 not already in the graph or in a block's chain\n- Only use: extends, supersedes, superseded_by, prompted_by, based_on, resolves\n- source_id and target_id must be block labels exactly as shown\n- Every relation MUST include a reason field per REASONING above\n- Candidates under \"[semantically related \u2014 UNCONFIRMED]\" were surfaced by SIMILARITY,\n  not a recorded connection. Link one ONLY when its MEANING clearly matches per the\n  tree above \u2014 surface resemblance is never enough. When uncertain, answer NO.";
+export declare const PASS4_DEFAULT_BATCH = 20;
+export declare function pass4BatchSize(): number;
+export declare function chunkForPass4<T>(items: T[], size?: number): T[][];
+export declare function callPass4LLM(provider: LLMProvider, newBlocks: Array<{
+    id: string;
+    label: string;
+    type: string;
+    essence: string;
+    uniqueFields?: string;
+    chain?: string[];
+}>, projectContext: string, thinkingBudget?: number, sceneCard?: string): Promise<{
+    result: {
+        relations: Array<{
+            source_id: string;
+            type: string;
+            target_id: string;
+            reason?: string;
+        }>;
+    } | null;
+    thinking: string;
+    rateLimited: boolean;
+    model?: string;
+    attempts?: Array<{
+        model: string;
+        outcome: string;
+    }>;
+}>;
+//# sourceMappingURL=pass4.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pass4.d.ts","sourceRoot":"","sources":["../../../src/middleware/reflect/pass4.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAe/D,eAAO,MAAM,YAAY,ipPA2GsD,CAAC;AA8BhF,eAAO,MAAM,mBAAmB,KAAK,CAAC;AAEtC,wBAAgB,cAAc,IAAI,MAAM,CAGvC;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,IAAI,SAAmB,GAAG,CAAC,EAAE,EAAE,CAI3E;AAED,wBAAsB,YAAY,CAChC,QAAQ,EAAE,WAAW,EACrB,SAAS,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC,EACvH,cAAc,EAAE,MAAM,EACtB,cAAc,SAAM,EACpB,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC;IAAE,MAAM,EAAE;QAAE,SAAS,EAAE,KAAK,CAAC;YAAE,SAAS,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,MAAM,CAAC,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;KAAE,GAAG,IAAI,CAAC;IAAC,QAAQ,EAAE,MAAM,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,CAwCzO"}

package/dist/middleware/reflect/pass4.js

@@ -0,0 +1,193 @@
+import { reflectTokenStats } from "./context.js";
+import { modelForPass } from "./config.js";
+// Pass 4 model (resolved at call time via modelForPass("pass4")):
+//   NODEDEX_PASS4_MODEL override → NODEDEX_REASONING_MODEL tier → (Gemini) gemini-2.5-pro
+//   default (Pro reliably thinks where Flash skips + produces shallow links) → provider default.
+// Set a stronger reasoning model (o4-mini, deepseek-reasoner) for non-Gemini providers.
+// See docs/Compatible-Models-Reference.md for per-provider recommendations.
+// ═══════════════════════════════════════════════════════════════════════════════
+// PASS 4 — CONNECT (cross-session only)
+// Job: link new blocks to existing graph blocks from prior sessions.
+// Runs after all Pass 3 blocks are saved. Output: relation tuples only.
+// Does NOT re-derive intra-batch wiring (Pass 2 owns that).
+// ═══════════════════════════════════════════════════════════════════════════════
+export const PASS4_PROMPT = `You receive two things:
+  NEW BLOCKS — blocks just saved this turn (label, id, type, essence, existing relations)
+  PROJECT GRAPH — existing blocks from prior sessions
+
+── STATE CONVENTION ─────────────────────────────────────────────────────────
+"State" in this prompt = text in marked regions below (NEW BLOCKS, PROJECT GRAPH).
+Your training knowledge and "what's commonly true in this domain" are NOT state.
+A block exists ONLY if it appears in one of the two marked regions. Familiarity ≠
+recorded. When the DIRECTNESS CHECK asks "is there another block Z that already
+connects X to Y?", Z must be a real label from NEW BLOCKS or PROJECT GRAPH — not
+a block you imagine should exist.
+
+Your ONLY job: find missing connections between a NEW BLOCK and an EXISTING block.
+Output relation tuples only. No new blocks. No block content. Just arrows.
+
+── SCOPE ───────────────────────────────────────────────────────────────────
+
+  New block ↔ existing block: YES — this is your job.
+  New block ↔ new block (same batch): NEVER — already decided by an earlier pass.
+  Reversing an existing relation: NEVER — earlier passes had the transcript.
+
+If a new block already has relations in its "chain:" section, those are DECIDED.
+Do not re-derive, reverse, or duplicate them.
+
+── DIRECTION ───────────────────────────────────────────────────────────────
+
+THE SOURCE DEPENDS ON THE TARGET.
+"Which block needs the other to make sense?" — that block is the source.
+
+── FOR EACH (NEW BLOCK, EXISTING BLOCK) PAIR — RUN THIS TREE ──────────────
+
+Answer from the essences only. When uncertain at any step, answer NO.
+A missing link is recoverable next session; a wrong link is not.
+
+In all steps, (X) and (Y) can be either the new block or the existing block.
+Direction follows the question's answer, not which block is newer.
+
+STEP 1 — IDENTITY: "Are (X) and (Y) about the same concept, mechanism, or role?"
+
+  NO → go to STEP 2.
+
+  YES → STEP 1b: "Does (X) make (Y) obsolete — same role, newer state?"
+    YES → supersedes  { source: X (newer), target: Y (older) }
+          Only valid between same category (decision↔decision, blueprint↔blueprint,
+          decision↔blueprint). STOP — do not continue to STEP 2 for this pair.
+    NO  → STEP 1c: "Does (X) add scope on top of (Y), where (Y) still stands alone?"
+      YES → extends  { source: X (addition), target: Y (foundation) }
+            STOP — do not continue to STEP 2 for this pair.
+      NO  → go to STEP 2.
+
+STEP 2 — CAUSALITY: Ask 2a and 2b independently. A pair can produce both.
+
+  2a — "Would (X) exist if (Y) had never happened?"
+    YES → no prompted_by for this pair.
+    NO  → DIRECTNESS CHECK before wiring:
+      "Is there another block (Z) — in (X)'s chain or in NEW BLOCKS — that (X)
+      depends on more directly, where (Z) itself depends on or relates to (Y)?"
+        YES → (Y) is an ancestor, not the direct cause. The path from (X) to (Y)
+              already runs through (Z). Skip — do not wire prompted_by.
+        NO  → (Y) is the most immediate cause.
+              prompted_by  { source: X (effect), target: Y (cause) }
+
+  2b — "Would (X)'s claim be unsupported without (Y)'s specific finding?"
+    NO  → no based_on for this pair.
+    YES → DIRECTNESS CHECK before wiring:
+      "Is there another block (Z) that (X) already relies on, where (Z) itself
+      draws on (Y) as its evidence?"
+        YES → (Y)'s evidence already reaches (X) through (Z). Skip.
+        NO  → (Y) is direct evidence for (X).
+              based_on  { source: X (claim), target: Y (evidence) }
+
+STEP 3 — RESOLVES: Only ask when (Y) has type = question OR type = hypothesis.
+
+  "Does (X) directly answer or settle what (Y) asks or proposes?"
+    YES → resolves  { source: X (answer/finding), target: Y (question/hypothesis) }
+    NO  → no relation for this pair.
+
+── TERMINAL ────────────────────────────────────────────────────────────────
+
+After checking every (new block, existing block) pair:
+  No question answered YES for any pair → output empty relations array.
+
+── REASONING (REQUIRED PER RELATION) ────────────────────────────────────────
+
+For each emitted relation, the reason field MUST cite SPECIFIC source-target
+labels and name which TREE STEP fired (1b supersedes / 1c extends / 2a
+prompted_by / 2b based_on / 3 resolves), in ≤200 chars. Mirror Pass 5's
+per-chain reasoning shape: WHY this direction, citing the concrete labels.
+
+A reason that says only "they are related" or "X relates to Y" without
+naming the TREE STEP that fired fails the contract — do not emit relations
+whose direction you cannot defend by naming the specific step.
+
+Examples of valid reasons:
+  "2a prompted_by: project-X_decision_databricks would not exist without
+   project-X_constraint_no-vendor-lock — constraint was prior."
+  "1b supersedes: project-Y_decision_use-postgres is newer same-role
+   replacement for project-Y_decision_use-sqlite."
+
+── RULES ───────────────────────────────────────────────────────────────────
+
+- Only output MISSING relations — not already in the graph or in a block's chain
+- Only use: extends, supersedes, superseded_by, prompted_by, based_on, resolves
+- source_id and target_id must be block labels exactly as shown
+- Every relation MUST include a reason field per REASONING above
+- Candidates under "[semantically related — UNCONFIRMED]" were surfaced by SIMILARITY,
+  not a recorded connection. Link one ONLY when its MEANING clearly matches per the
+  tree above — surface resemblance is never enough. When uncertain, answer NO.`;
+const PASS4_SCHEMA = {
+    type: "object",
+    properties: {
+        relations: {
+            type: "array",
+            items: {
+                type: "object",
+                properties: {
+                    source_id: { type: "string" },
+                    type: { type: "string" },
+                    target_id: { type: "string" },
+                    reason: { type: "string" },
+                },
+                required: ["source_id", "type", "target_id", "reason"],
+            },
+        },
+    },
+    required: ["relations"],
+};
+// ── Batching (2026-07-03) ────────────────────────────────────────────────────
+// Pass 4 emits one relation-judgment per new block; its OUTPUT grows with the
+// new-block count while the input-side slice stays capped. The 200-block dogfood
+// run proved the failure mode: 157 new blocks in ONE call blew the model's output
+// cap → truncated twice → the whole pass failed → every cross-group conclusion
+// landed orphaned. The caller chunks new blocks to ≤ this size per call (mirroring
+// fill_2b's batching), which bounds each call's output and isolates failures —
+// one truncated batch loses only its own links.
+export const PASS4_DEFAULT_BATCH = 20;
+export function pass4BatchSize() {
+    const n = Number(process.env.NODEDEX_PASS4_BATCH);
+    return Number.isFinite(n) && n >= 1 ? Math.floor(n) : PASS4_DEFAULT_BATCH;
+}
+export function chunkForPass4(items, size = pass4BatchSize()) {
+    const out = [];
+    for (let i = 0; i < items.length; i += size)
+        out.push(items.slice(i, i + size));
+    return out;
+}
+export async function callPass4LLM(provider, newBlocks, projectContext, thinkingBudget = 512, sceneCard) {
+    const newBlocksSection = `NEW BLOCKS (just saved this turn):\n${newBlocks.map(b => {
+        const chainStr = b.chain && b.chain.length > 0 ? `\n    chain:\n${b.chain.join("\n")}` : "";
+        return `  ${b.label} | ${b.id} [${b.type}] — "${b.essence}"${b.uniqueFields ?? ""}${chainStr}`;
+    }).join("\n")}\n\n`;
+    const projectSection = projectContext
+        ? `PROJECT GRAPH (existing blocks — find missing links against these):\n${projectContext}`
+        : `PROJECT GRAPH: (empty)`;
+    // Scene card is session-level framing — Pass 4 is cross-session linking only,
+    // so we don't inject it (it encouraged intra-batch re-derivation).
+    const userInput = `${newBlocksSection}${projectSection}`;
+    // Resolve the model to use for Pass 4:
+    // 1. NODEDEX_PASS4_MODEL env var (explicit override, works for any provider)
+    // 2. For Gemini with no override: default to gemini-2.5-pro (Pro thinks reliably)
+    // 3. All other providers with no override: use their configured AI_MODEL
+    const modelOverride = modelForPass("pass4")
+        ?? (provider.getName() === "gemini" ? "gemini-2.5-pro" : undefined);
+    const r = await provider.generateStructured(PASS4_PROMPT, userInput, PASS4_SCHEMA, { thinkingBudget, modelOverride });
+    if (r.usage) {
+        reflectTokenStats.pass4.input += r.usage.input;
+        reflectTokenStats.pass4.thinking += r.usage.thinking;
+        reflectTokenStats.pass4.output += r.usage.output;
+    }
+    reflectTokenStats.pass4.calls += 1;
+    if (r.result) {
+        const modelTag = modelOverride ? ` [${modelOverride}]` : (provider.getName() !== "gemini" ? ` [${provider.getName()}]` : "");
+        console.log(`Auto-Reflect Pass 4: ${r.result.relations?.length ?? 0} relation(s) found | tokens: in=${r.usage?.input ?? "?"} think=${r.usage?.thinking ?? "?"}${modelTag}`);
+    }
+    else {
+        console.warn(`Auto-Reflect Pass 4: ${r.rateLimited ? "rate limited" : "failed"} — skipping (non-critical)`);
+    }
+    return { result: r.result, thinking: r.thinking ?? "", rateLimited: r.rateLimited, model: r.model, attempts: r.attempts };
+}
+//# sourceMappingURL=pass4.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pass4.js","sourceRoot":"","sources":["../../../src/middleware/reflect/pass4.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAG3C,kEAAkE;AAClE,0FAA0F;AAC1F,iGAAiG;AACjG,wFAAwF;AACxF,4EAA4E;AAE5E,kFAAkF;AAClF,wCAAwC;AACxC,qEAAqE;AACrE,wEAAwE;AACxE,4DAA4D;AAC5D,kFAAkF;AAElF,MAAM,CAAC,MAAM,YAAY,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;+EA2GmD,CAAC;AAEhF,MAAM,YAAY,GAAG;IACnB,IAAI,EAAE,QAAQ;IACd,UAAU,EAAE;QACV,SAAS,EAAE;YACT,IAAI,EAAE,OAAO;YACb,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBAC7B,IAAI,EAAO,EAAE,IAAI,EAAE,QAAQ,EAAE;oBAC7B,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBAC7B,MAAM,EAAK,EAAE,IAAI,EAAE,QAAQ,EAAE;iBAC9B;gBACD,QAAQ,EAAE,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,CAAC;aACvD;SACF;KACF;IACD,QAAQ,EAAE,CAAC,WAAW,CAAC;CACxB,CAAC;AAEF,gFAAgF;AAChF,8EAA8E;AAC9E,iFAAiF;AACjF,kFAAkF;AAClF,+EAA+E;AAC/E,mFAAmF;AACnF,+EAA+E;AAC/E,gDAAgD;AAChD,MAAM,CAAC,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAEtC,MAAM,UAAU,cAAc;IAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC;AAC5E,CAAC;AAED,MAAM,UAAU,aAAa,CAAI,KAAU,EAAE,IAAI,GAAG,cAAc,EAAE;IAClE,MAAM,GAAG,GAAU,EAAE,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,QAAqB,EACrB,SAAuH,EACvH,cAAsB,EACtB,cAAc,GAAG,GAAG,EACpB,SAAkB;IAElB,MAAM,gBAAgB,GAAG,uCAAuC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QAChF,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5F,OAAO,KAAK,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,YAAY,IAAI,EAAE,GAAG,QAAQ,EAAE,CAAC;IACjG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAEpB,MAAM,cAAc,GAAG,cAAc;QACnC,CAAC,CAAC,wEAAwE,cAAc,EAAE;QAC1F,CAAC,CAAC,wBAAwB,CAAC;IAE7B,8EAA8E;IAC9E,mEAAmE;IACnE,MAAM,SAAS,GAAG,GAAG,gBAAgB,GAAG,cAAc,EAAE,CAAC;IAEzD,uCAAuC;IACvC,6EAA6E;IAC7E,kFAAkF;IAClF,yEAAyE;IACzE,MAAM,aAAa,GAAG,YAAY,CAAC,OAAO,CAAC;WACtC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAEtE,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CACzC,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,EAAE,cAAc,EAAE,aAAa,EAAE,CACzE,CAAC;IAEF,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACZ,iBAAiB,CAAC,KAAK,CAAC,KAAK,IAAO,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;QAClD,iBAAiB,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;QACrD,iBAAiB,CAAC,KAAK,CAAC,MAAM,IAAM,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACrD,CAAC;IACD,iBAAiB,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;IAEnC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QACb,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7H,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,mCAAmC,CAAC,CAAC,KAAK,EAAE,KAAK,IAAI,GAAG,UAAU,CAAC,CAAC,KAAK,EAAE,QAAQ,IAAI,GAAG,GAAG,QAAQ,EAAE,CAAC,CAAC;IAC9K,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,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AAC5H,CAAC"}

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

@@ -0,0 +1,22 @@
+import type { LLMProvider } from "../../engine/ai-provider.js";
+import type { Pass5Result } from "./types.js";
+export type Pass5CallResult = {
+    result: Pass5Result | null;
+    rateLimited: boolean;
+    model?: string;
+    attempts?: Array<{
+        model: string;
+        outcome: string;
+    }>;
+};
+export declare function callPass5LLM(provider: LLMProvider, newBlocks: Array<{
+    id: string;
+    label: string;
+    type: string;
+    essence: string;
+}>, causalRels: Array<{
+    source_id: string;
+    target_id: string;
+    type: string;
+}>): Promise<Pass5CallResult>;
+//# sourceMappingURL=pass5.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pass5.d.ts","sourceRoot":"","sources":["../../../src/middleware/reflect/pass5.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC/D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AA6I9C,MAAM,MAAM,eAAe,GAAG;IAC5B,MAAM,EAAE,WAAW,GAAG,IAAI,CAAC;IAC3B,WAAW,EAAE,OAAO,CAAC;IACrB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtD,CAAC;AAEF,wBAAsB,YAAY,CAChC,QAAQ,EAAE,WAAW,EACrB,SAAS,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,EAC9E,UAAU,EAAE,KAAK,CAAC;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GACxE,OAAO,CAAC,eAAe,CAAC,CA4C1B"}