@indexnetwork/protocol 6.12.0-rc.403.1 → 6.13.22-rc.405.1

package/dist/opportunity/outcome/outcome.env.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"outcome.env.js","sourceRoot":"/","sources":["opportunity/outcome/outcome.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAKH;;;GAGG;AACH,MAAM,UAAU,oBAAoB;IAClC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,sBAAsB,EAAE,IAAI,EAAE,CAAC;IACzD,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B;IACzC,OAAO,oBAAoB,EAAE,KAAK,KAAK,CAAC;AAC1C,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,+BAA+B,GAAG,CAAC,CAAC;AAEjD,gFAAgF;AAChF,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAE5C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAC3C,+BAA+B,GAAG,0BAA0B,CAAC;AAE/D,0EAA0E;AAC1E,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAEzC,iFAAiF;AACjF,MAAM,CAAC,MAAM,gCAAgC,GAAG,GAAG,CAAC","sourcesContent":["/**\n * Centralized accessors for Lens B outcome-question environment variables\n * (IND-434).\n *\n *   OUTCOME_QUESTIONS_MODE   off | shadow | on — Lens B \"explicit opportunity\n *                            outcomes → grounded questions\" pipeline.\n *\n *                            off (default): no outcome feedback events are\n *                              captured and no hypothesis mining runs. Zero\n *                              behavior change.\n *                            shadow: capture one idempotent append-only\n *                              feedback event per explicit owner action, mine\n *                              neutral trade-off hypotheses for the exact\n *                              recipient + intent + fingerprint, and emit\n *                              aggregate telemetry only. No question, ranking,\n *                              intent, premise, memory, newborn-stamp, or push\n *                              writes.\n *                            on: reserved for a later phase (IND-438) that\n *                              turns a grounded hypothesis into a user-facing\n *                              question. This slice treats \"on\" exactly like\n *                              \"shadow\" for capture + mining; it never emits\n *                              questions.\n *\n * All reads go through this module — do not read this variable via\n * `process.env` elsewhere. Values are read on every call (no caching) so tests\n * and long-lived processes observe changes.\n */\n\n/** Lens B outcome-question mode. */\nexport type OutcomeQuestionsMode = \"off\" | \"shadow\" | \"on\";\n\n/**\n * Current OUTCOME_QUESTIONS_MODE (default off). Only the exact trimmed literals\n * \"shadow\" and \"on\" activate; every other value (including unset/empty) is off.\n */\nexport function outcomeQuestionsMode(): OutcomeQuestionsMode {\n  const value = process.env.OUTCOME_QUESTIONS_MODE?.trim();\n  return value === \"shadow\" || value === \"on\" ? value : \"off\";\n}\n\n/**\n * True when Lens B capture + mining should run at all. Both \"shadow\" and \"on\"\n * activate the shadow pipeline; only the future question-emitting behavior is\n * gated on \"on\" (not part of this slice).\n */\nexport function isOutcomeQuestionsActivated(): boolean {\n  return outcomeQuestionsMode() !== \"off\";\n}\n\n/**\n * Independent-support threshold (k). Every compared group (discriminator side)\n * must have at least this many INDEPENDENT (related-opportunity-deduplicated)\n * examples before the hypothesis is eligible. Enforced per side, so no side\n * can be traced back to a small handful of individuals.\n */\nexport const OUTCOME_MIN_INDEPENDENT_SUPPORT = 5;\n\n/** Minimum number of qualified sides (each ≥ k) for a hypothesis to compare. */\nexport const OUTCOME_MIN_COMPARED_SIDES = 2;\n\n/**\n * k-anonymity floor for attempting a mining pass at all: the number of\n * distinct independent examples (after related-opportunity dedup) required\n * before the miner is invoked. Set to k × minimum compared sides so a pass can\n * never produce an eligible hypothesis below the aggregate floor.\n */\nexport const OUTCOME_MIN_INDEPENDENT_EXAMPLES =\n  OUTCOME_MIN_INDEPENDENT_SUPPORT * OUTCOME_MIN_COMPARED_SIDES;\n\n/** Max independent examples sent to the miner LLM (most recent first). */\nexport const OUTCOME_MAX_CANDIDATES = 48;\n\n/** Max chars of presentation-safe candidate snapshot stored/sent per example. */\nexport const OUTCOME_MAX_PUBLIC_CONTEXT_CHARS = 400;\n"]}

package/dist/opportunity/outcome/outcome.hypotheses.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"outcome.hypotheses.d.ts","sourceRoot":"/","sources":["opportunity/outcome/outcome.hypotheses.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,KAAK,EAAE,0BAA0B,EAAqB,mBAAmB,EAAsB,MAAM,oBAAoB,CAAC;AAOjI;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,0BAA0B,GAAG,mBAAmB,CAsF5F"}

package/dist/opportunity/outcome/outcome.hypotheses.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"outcome.hypotheses.js","sourceRoot":"/","sources":["opportunity/outcome/outcome.hypotheses.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,0BAA0B,EAAE,+BAA+B,EAAE,MAAM,kBAAkB,CAAC;AAG/F,8DAA8D;AAC9D,SAAS,SAAS,CAAC,CAAS;IAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;AACnC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAiC;IACrE,MAAM,UAAU,GAAG,KAAK,CAAC,qBAAqB,IAAI,+BAA+B,CAAC;IAClF,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,IAAI,0BAA0B,CAAC;IAEtE,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;IAErC,MAAM,UAAU,GAAwB,EAAE,CAAC;IAE3C,KAAK,MAAM,aAAa,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACjD,2EAA2E;QAC3E,0EAA0E;QAC1E,0EAA0E;QAC1E,kCAAkC;QAClC,MAAM,eAAe,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACvE,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;YAAE,SAAS;QAChE,IAAI,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,MAAM;YAAE,SAAS;QACvE,IAAI,eAAe,CAAC,MAAM,GAAG,QAAQ;YAAE,SAAS;QAChD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;QAE5C,yEAAyE;QACzE,mEAAmE;QACnE,6EAA6E;QAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,UAAU,IAAI,aAAa,CAAC,WAAW,EAAE,CAAC;YACnD,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ;gBAAE,SAAS;YAC/D,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC1E,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAC7C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,IAAI;gBAAE,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;iBAC5E,IAAI,QAAQ,KAAK,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACrE,CAAC;QAED,yEAAyE;QACzE,+CAA+C;QAC/C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;QACjD,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAuB,CAAC;QACzD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YAClC,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACnC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACzD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;gBACzB,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,iBAAiB,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACzE,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,qEAAqE;QACrE,4CAA4C;QAC5C,MAAM,cAAc,GAAyB,EAAE,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YAC/C,IAAI,OAAO,GAAG,UAAU;gBAAE,SAAS,CAAC,4BAA4B;YAChE,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YACxD,cAAc,CAAC,IAAI,CAAC;gBAClB,IAAI;gBACJ,kBAAkB,EAAE,OAAO;gBAC3B,UAAU,EAAE,SAAS,CAAC,QAAQ,GAAG,OAAO,CAAC;aAC1C,CAAC,CAAC;QACL,CAAC;QAED,IAAI,cAAc,CAAC,MAAM,GAAG,QAAQ;YAAE,SAAS,CAAC,wBAAwB;QAExE,6DAA6D;QAC7D,cAAc,CAAC,IAAI,CACjB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,GAAG,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CACtF,CAAC;QAEF,UAAU,CAAC,IAAI,CAAC;YACd,KAAK,EAAE,aAAa,CAAC,KAAK;YAC1B,YAAY,EAAE,aAAa,CAAC,YAAY;YACxC,KAAK,EAAE,cAAc;YACrB,YAAY,EAAE,aAAa,CAAC,YAAY;YACxC,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;SACpF,CAAC,CAAC;IACL,CAAC;IAED,0EAA0E;IAC1E,UAAU,CAAC,IAAI,CACb,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,qBAAqB,GAAG,CAAC,CAAC,qBAAqB,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAC9F,CAAC;IAEF,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC;AACpE,CAAC","sourcesContent":["/**\n * Lens B outcome join + threshold — pure functions, no LLM, no I/O (IND-434).\n *\n * Given discriminators whose candidate → side assignments were produced BLIND\n * to outcome (the miner never saw which side the user chose), this module joins\n * the explicit owner-outcome labels and produces aggregate-only telemetry:\n *\n *   - Independence: capture admits only one unique counterpart per opportunity;\n *     the caller then deduplicates by that recipient-scoped counterpart hash.\n *     Every retained entry therefore represents one distinct counterpart.\n *   - Threshold: a discriminator side is \"qualified\" only when it holds at\n *     least `minIndependentSupport` (k) independent examples. A hypothesis is\n *     eligible only when at least `minComparedSides` sides qualify.\n *   - Small-cell suppression: only qualified sides (≥ k) are ever emitted, so\n *     no aggregate row can be traced to a small handful of individuals.\n *\n * The outcome label is joined here and ONLY here — the miner and the side\n * assignments upstream are independent of it, so association can never leak\n * into classification.\n */\n\nimport { OUTCOME_MIN_COMPARED_SIDES, OUTCOME_MIN_INDEPENDENT_SUPPORT } from \"./outcome.env.js\";\nimport type { JoinOutcomeHypothesesInput, OutcomeHypothesis, OutcomeShadowResult, OutcomeSideSupport } from \"./outcome.types.js\";\n\n/** Round a rate to 0.01 for telemetry (never a raw count). */\nfunction roundRate(n: number): number {\n  return Math.round(n * 100) / 100;\n}\n\n/**\n * Join outcome labels onto blind side assignments and keep only hypotheses that\n * clear the independent-support threshold on at least `minComparedSides` sides.\n *\n * @returns Aggregate telemetry: eligible hypotheses sorted by (min support desc,\n *   label asc) for deterministic ordering, each carrying only qualified sides.\n */\nexport function joinOutcomeHypotheses(input: JoinOutcomeHypothesesInput): OutcomeShadowResult {\n  const minSupport = input.minIndependentSupport ?? OUTCOME_MIN_INDEPENDENT_SUPPORT;\n  const minSides = input.minComparedSides ?? OUTCOME_MIN_COMPARED_SIDES;\n\n  // Distinct independent examples with a joinable outcome label.\n  const poolSize = input.examples.size;\n\n  const hypotheses: OutcomeHypothesis[] = [];\n\n  for (const discriminator of input.discriminators) {\n    // Normalize sides by trimming, then reject the ENTIRE discriminator if any\n    // side is empty or if labels are not unique after normalization. Silently\n    // deduplicating malformed model output would turn an ambiguous comparison\n    // into apparently valid evidence.\n    const normalizedSides = discriminator.sides.map((side) => side.trim());\n    if (normalizedSides.some((side) => side.length === 0)) continue;\n    if (new Set(normalizedSides).size !== normalizedSides.length) continue;\n    if (normalizedSides.length < minSides) continue;\n    const validSides = new Set(normalizedSides);\n\n    // First normalize VERIFIED, labelled assignments by candidate id. If the\n    // same independent example is assigned to different sides, mark it\n    // ambiguous and exclude it from every side; it must never support two cells.\n    const sideById = new Map<string, string>();\n    const ambiguousIds = new Set<string>();\n    for (const assignment of discriminator.assignments) {\n      if (assignment.side === null || !assignment.verified) continue;\n      const side = assignment.side.trim();\n      if (!validSides.has(side) || !input.examples.has(assignment.id)) continue;\n      const previous = sideById.get(assignment.id);\n      if (previous !== undefined && previous !== side) ambiguousIds.add(assignment.id);\n      else if (previous === undefined) sideById.set(assignment.id, side);\n    }\n\n    // Tally DISTINCT independent example ids per unambiguous side. Repeating\n    // the same assignment never increases support.\n    const idsBySide = new Map<string, Set<string>>();\n    const acceptedIdsBySide = new Map<string, Set<string>>();\n    for (const [id, side] of sideById) {\n      if (ambiguousIds.has(id)) continue;\n      const label = input.examples.get(id);\n      if (label === undefined) continue;\n      if (!idsBySide.has(side)) idsBySide.set(side, new Set());\n      idsBySide.get(side)!.add(id);\n      if (label === \"accepted\") {\n        if (!acceptedIdsBySide.has(side)) acceptedIdsBySide.set(side, new Set());\n        acceptedIdsBySide.get(side)!.add(id);\n      }\n    }\n\n    // Keep only sides that clear the independent-support threshold (>= k\n    // genuinely distinct independent examples).\n    const qualifiedSides: OutcomeSideSupport[] = [];\n    for (const side of normalizedSides) {\n      const support = idsBySide.get(side)?.size ?? 0;\n      if (support < minSupport) continue; // small-cell: never emitted\n      const accepted = acceptedIdsBySide.get(side)?.size ?? 0;\n      qualifiedSides.push({\n        side,\n        independentSupport: support,\n        acceptRate: roundRate(accepted / support),\n      });\n    }\n\n    if (qualifiedSides.length < minSides) continue; // not enough to compare\n\n    // Deterministic side ordering: support desc, then label asc.\n    qualifiedSides.sort(\n      (a, b) => b.independentSupport - a.independentSupport || a.side.localeCompare(b.side),\n    );\n\n    hypotheses.push({\n      label: discriminator.label,\n      questionSeed: discriminator.questionSeed,\n      sides: qualifiedSides,\n      evidenceRate: discriminator.evidenceRate,\n      minIndependentSupport: Math.min(...qualifiedSides.map((s) => s.independentSupport)),\n    });\n  }\n\n  // Deterministic hypothesis ordering: strongest support first, then label.\n  hypotheses.sort(\n    (a, b) => b.minIndependentSupport - a.minIndependentSupport || a.label.localeCompare(b.label),\n  );\n\n  return { poolSize, eligibleCount: hypotheses.length, hypotheses };\n}\n"]}

package/dist/opportunity/outcome/outcome.shadow.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"outcome.shadow.d.ts","sourceRoot":"/","sources":["opportunity/outcome/outcome.shadow.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,yCAAyC,CAAC;AAItF,OAAO,KAAK,EAAE,cAAc,EAAgB,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAI5F,oDAAoD;AACpD,MAAM,WAAW,kBAAkB;IACjC;;;OAGG;IACH,UAAU,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,QAAQ,EAAE,cAAc,EAAE,CAAC;IAC3B,KAAK,EAAE,IAAI,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAC;IAC5C,kEAAkE;IAClE,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,4CAA4C;IAC5C,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,sCAAsC;IACtC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED;;;;GAIG;AACH,wBAAgB,0BAA0B,CAAC,QAAQ,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE,CAgBvF;AAED;;;;;;GAMG;AACH,wBAAsB,gBAAgB,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAgD9F"}

package/dist/opportunity/outcome/outcome.shadow.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"outcome.shadow.js","sourceRoot":"/","sources":["opportunity/outcome/outcome.shadow.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAG/E,OAAO,EAAE,sBAAsB,EAAE,0BAA0B,EAAE,+BAA+B,EAAE,MAAM,kBAAkB,CAAC;AACvH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAGhE,MAAM,MAAM,GAAG,cAAc,CAAC,uBAAuB,CAAC,CAAC;AAyBvD;;;;GAIG;AACH,MAAM,UAAU,0BAA0B,CAAC,QAA0B;IACnE,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAChD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACrC,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GACT,OAAO,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU;YACxC,CAAC,OAAO,CAAC,UAAU,KAAK,QAAQ,CAAC,UAAU,IAAI,OAAO,CAAC,aAAa,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;QACjG,IAAI,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAC7B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CACrG,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,KAAyB;IAC9D,MAAM,UAAU,GAAG,KAAK,CAAC,qBAAqB,IAAI,+BAA+B,CAAC;IAClF,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,IAAI,0BAA0B,CAAC;IACtE,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,sBAAsB,CAAC;IAEpE,wEAAwE;IACxE,MAAM,WAAW,GAAG,0BAA0B,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACvF,IAAI,WAAW,CAAC,MAAM,GAAG,UAAU,GAAG,QAAQ,EAAE,CAAC;QAC/C,OAAO,EAAE,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAC5E,CAAC;IAED,8EAA8E;IAC9E,+EAA+E;IAC/E,2EAA2E;IAC3E,4EAA4E;IAC5E,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACvF,MAAM,UAAU,GAAoB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACvE,EAAE,EAAE,KAAK;QACT,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,CAAC;KAC1B,CAAC,CAAC,CAAC;IAEJ,4EAA4E;IAC5E,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,CAClC,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,UAAU,EAAE,EAC5C,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CACpD,CAAC;IACF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAC5E,CAAC;IAED,6DAA6D;IAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAC5D,CAAC;IACF,MAAM,MAAM,GAAG,qBAAqB,CAAC;QACnC,cAAc,EAAE,KAAK;QACrB,QAAQ;QACR,qBAAqB,EAAE,UAAU;QACjC,gBAAgB,EAAE,QAAQ;KAC3B,CAAC,CAAC;IAEH,MAAM,CAAC,KAAK,CAAC,sBAAsB,EAAE;QACnC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,aAAa,EAAE,MAAM,CAAC,aAAa;KACpC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["/**\n * Lens B shadow orchestrator (IND-434): deduplicate related opportunities,\n * mine neutral axes over the deduplicated historical pool BLIND to outcome,\n * then join the owner-outcome labels and threshold the result.\n *\n * No persistence, no questions, no UI. The output is consumed only by aggregate\n * telemetry for human review.\n *\n * Pipeline:\n *   1. Dedup related opportunities: collapse examples sharing a dedup key to a\n *      single representative (most recent), so a cluster of related opps can\n *      neither dominate the miner nor inflate a side's independent support.\n *   2. Cap to the most recent OUTCOME_MAX_CANDIDATES for a bounded LLM pass.\n *   3. Build the miner pool — PoolCandidate carries id + publicContext + score\n *      and, critically, NO outcome label. The miner is structurally blind.\n *   4. Mine neutral axes + assign candidates (evidence-verified).\n *   5. Join outcome labels (only now) and apply the k-support threshold.\n */\n\nimport { protocolLogger } from \"../../shared/observability/protocol.logger.js\";\nimport type { PoolDiscriminatorMiner } from \"../discriminator/discriminator.miner.js\";\nimport type { PoolCandidate } from \"../discriminator/discriminator.types.js\";\nimport { OUTCOME_MAX_CANDIDATES, OUTCOME_MIN_COMPARED_SIDES, OUTCOME_MIN_INDEPENDENT_SUPPORT } from \"./outcome.env.js\";\nimport { joinOutcomeHypotheses } from \"./outcome.hypotheses.js\";\nimport type { OutcomeExample, OutcomeLabel, OutcomeShadowResult } from \"./outcome.types.js\";\n\nconst logger = protocolLogger(\"OutcomeQuestionShadow\");\n\n/** Input for one Lens B shadow mining+join pass. */\nexport interface OutcomeShadowInput {\n  /**\n   * Intent payload (+ summary) text that owns this scope. Used only as miner\n   * context; never mixed with outcome labels.\n   */\n  intentText: string;\n  /**\n   * Captured owner-outcome examples for exactly one recipient + intent +\n   * fingerprint scope. Each carries a presentation-safe snapshot and a dedup\n   * key; outcome labels live here but are withheld from the miner.\n   */\n  examples: OutcomeExample[];\n  miner: Pick<PoolDiscriminatorMiner, \"mine\">;\n  /** Override the independent-support threshold (defaults to k). */\n  minIndependentSupport?: number;\n  /** Override the minimum qualified sides. */\n  minComparedSides?: number;\n  /** Override the LLM candidate cap. */\n  maxCandidates?: number;\n  signal?: AbortSignal;\n}\n\n/**\n * Collapse related opportunities to independent examples: one representative\n * (most recent by occurredAt) per distinct dedup key. Deterministic — ties on\n * occurredAt fall back to opportunityId ordering.\n */\nexport function deduplicateOutcomeExamples(examples: OutcomeExample[]): OutcomeExample[] {\n  const byKey = new Map<string, OutcomeExample>();\n  for (const example of examples) {\n    const existing = byKey.get(example.dedupKey);\n    if (existing === undefined) {\n      byKey.set(example.dedupKey, example);\n      continue;\n    }\n    const newer =\n      example.occurredAt > existing.occurredAt ||\n      (example.occurredAt === existing.occurredAt && example.opportunityId > existing.opportunityId);\n    if (newer) byKey.set(example.dedupKey, example);\n  }\n  return [...byKey.values()].sort(\n    (a, b) => b.occurredAt.localeCompare(a.occurredAt) || a.opportunityId.localeCompare(b.opportunityId),\n  );\n}\n\n/**\n * Run the Lens B shadow pipeline for one scope.\n *\n * Throws only when *mining* fails (callers are fire-and-forget and must catch).\n * A pool that is empty or below the compare floor after dedup returns an empty\n * result rather than throwing.\n */\nexport async function runOutcomeShadow(input: OutcomeShadowInput): Promise<OutcomeShadowResult> {\n  const minSupport = input.minIndependentSupport ?? OUTCOME_MIN_INDEPENDENT_SUPPORT;\n  const minSides = input.minComparedSides ?? OUTCOME_MIN_COMPARED_SIDES;\n  const maxCandidates = input.maxCandidates ?? OUTCOME_MAX_CANDIDATES;\n\n  // 1–2. Dedup related opportunities, then cap to a bounded, recent pool.\n  const independent = deduplicateOutcomeExamples(input.examples).slice(0, maxCandidates);\n  if (independent.length < minSupport * minSides) {\n    return { poolSize: independent.length, eligibleCount: 0, hypotheses: [] };\n  }\n\n  // 3. Build the miner pool with RUN-LOCAL aliases (c0, c1, …) as candidate ids\n  //    — raw opportunity ids are never sent to the LLM. The alias→outcome map is\n  //    kept internally for the join. PoolCandidate deliberately excludes the\n  //    outcome label, so the miner cannot condition on which side was chosen.\n  const aliased = independent.map((example, index) => ({ alias: `c${index}`, example }));\n  const candidates: PoolCandidate[] = aliased.map(({ alias, example }) => ({\n    id: alias,\n    publicContext: example.publicContext,\n    score: example.score ?? 1,\n  }));\n\n  // 4. Blind assignment (assignments come back keyed by the run-local alias).\n  const mined = await input.miner.mine(\n    { intentText: input.intentText, candidates },\n    input.signal ? { signal: input.signal } : undefined,\n  );\n  if (mined.length === 0) {\n    return { poolSize: independent.length, eligibleCount: 0, hypotheses: [] };\n  }\n\n  // 5. Join outcome labels (only now) by alias, and threshold.\n  const examples = new Map<string, OutcomeLabel>(\n    aliased.map(({ alias, example }) => [alias, example.label]),\n  );\n  const result = joinOutcomeHypotheses({\n    discriminators: mined,\n    examples,\n    minIndependentSupport: minSupport,\n    minComparedSides: minSides,\n  });\n\n  logger.debug(\"shadow join complete\", {\n    poolSize: result.poolSize,\n    eligibleCount: result.eligibleCount,\n  });\n\n  return result;\n}\n"]}

package/dist/opportunity/outcome/outcome.types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"outcome.types.d.ts","sourceRoot":"/","sources":["opportunity/outcome/outcome.types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,yCAAyC,CAAC;AAElF;;;;GAIG;AACH,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,UAAU,CAAC;AAEnD;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,aAAa,EAAE,MAAM,CAAC;IACtB,yEAAyE;IACzE,aAAa,EAAE,MAAM,CAAC;IACtB,+EAA+E;IAC/E,KAAK,EAAE,YAAY,CAAC;IACpB;;;;OAIG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,8EAA8E;IAC9E,UAAU,EAAE,MAAM,CAAC;IACnB,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,6EAA6E;AAC7E,MAAM,WAAW,kBAAkB;IACjC,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAC;IACb,gFAAgF;IAChF,kBAAkB,EAAE,MAAM,CAAC;IAC3B;;;OAGG;IACH,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,iEAAiE;AACjE,MAAM,WAAW,iBAAiB;IAChC,2EAA2E;IAC3E,KAAK,EAAE,MAAM,CAAC;IACd,4EAA4E;IAC5E,YAAY,EAAE,MAAM,CAAC;IACrB,gEAAgE;IAChE,KAAK,EAAE,kBAAkB,EAAE,CAAC;IAC5B,gFAAgF;IAChF,YAAY,EAAE,MAAM,CAAC;IACrB,mEAAmE;IACnE,qBAAqB,EAAE,MAAM,CAAC;CAC/B;AAED,gFAAgF;AAChF,MAAM,WAAW,mBAAmB;IAClC,sEAAsE;IACtE,QAAQ,EAAE,MAAM,CAAC;IACjB,6EAA6E;IAC7E,aAAa,EAAE,MAAM,CAAC;IACtB;;;OAGG;IACH,UAAU,EAAE,iBAAiB,EAAE,CAAC;CACjC;AAED,4EAA4E;AAC5E,MAAM,WAAW,0BAA0B;IACzC,8EAA8E;IAC9E,cAAc,EAAE,kBAAkB,EAAE,CAAC;IACrC;;;;OAIG;IACH,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IACpC,6DAA6D;IAC7D,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B,gEAAgE;IAChE,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B"}

package/dist/opportunity/outcome/outcome.types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"outcome.types.js","sourceRoot":"/","sources":["opportunity/outcome/outcome.types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG","sourcesContent":["/**\n * Lens B outcome-question mining — shared types (IND-434).\n *\n * Lens B learns whether a user's OWN past explicit opportunity decisions\n * (accept / reject) suggest a useful clarification question, WITHOUT treating\n * mutable statuses, counterparty actions, or system transitions as\n * preferences. It is the historical-outcome analogue of the live-pool Lens A\n * discriminator (see ../discriminator/*).\n *\n * The two lenses share the neutral-axis mining machinery (PoolDiscriminatorMiner\n * assigns candidates to axis sides from presentation-safe context only). Lens B\n * adds the crucial privacy/correctness discipline on top:\n *\n *   1. Candidates are assigned to sides BLIND to their outcome label — the\n *      classifier never sees which side the user chose (the miner input carries\n *      no outcome field at all).\n *   2. Outcome labels are joined only AFTER assignment.\n *   3. Related opportunities are deduplicated (one independent example per\n *      distinct counterpart) before support is counted.\n *   4. Every compared group (side) must clear the independent-support\n *      threshold k, so aggregate telemetry never exposes a small cell.\n *\n * P7 (shadow) uses these types for aggregate-telemetry output only: no\n * questions, ranking, intent, premise, memory, newborn-stamp, or push writes.\n */\n\nimport type { MinedDiscriminator } from \"../discriminator/discriminator.types.js\";\n\n/**\n * The only two explicit owner actions Lens B treats as preference labels.\n * Non-action, delivery, expiry, timeout, merge, cascade, screening, and every\n * counterparty/agent/system transition are deliberately excluded upstream.\n */\nexport type OutcomeLabel = \"accepted\" | \"rejected\";\n\n/**\n * One captured owner-outcome example, as consumed by the mining orchestrator.\n * Built from an append-only feedback event; carries only presentation-safe\n * text plus join/dedup keys — never raw ids, vectors, or model reasoning.\n */\nexport interface OutcomeExample {\n  /**\n   * Opportunity id — the join key between blind assignment and outcome label.\n   * Never emitted in telemetry.\n   */\n  opportunityId: string;\n  /** Presentation-safe candidate snapshot the miner assigns sides from. */\n  publicContext: string;\n  /** Explicit owner action. Joined AFTER assignment, never seen by the miner. */\n  label: OutcomeLabel;\n  /**\n   * Related-opportunity dedup key: a stable, non-reversible identifier of the\n   * counterpart (or opportunity when no counterpart). Two examples with the\n   * same key count as ONE independent example.\n   */\n  dedupKey: string;\n  /** Sort key for recency-based capping/representative selection (ISO-8601). */\n  occurredAt: string;\n  /** Optional confidence mass for score-weighted assignment; defaults to 1. */\n  score?: number;\n}\n\n/** Aggregate support for one discriminator side, after dedup + threshold. */\nexport interface OutcomeSideSupport {\n  /** Neutral side label carried verbatim from the miner. */\n  side: string;\n  /** Distinct independent (deduplicated) examples assigned to this side (≥ k). */\n  independentSupport: number;\n  /**\n   * Independent accepted examples ÷ independentSupport, rounded to 0.01. A\n   * rate, never a raw small-cell count.\n   */\n  acceptRate: number;\n}\n\n/** One eligible neutral hypothesis with aggregate-only stats. */\nexport interface OutcomeHypothesis {\n  /** Discriminator label, e.g. \"Hands-on builders vs strategic advisors\". */\n  label: string;\n  /** A neutral question the intent owner could answer to resolve the axis. */\n  questionSeed: string;\n  /** Only the qualified sides (each ≥ k independent examples). */\n  sides: OutcomeSideSupport[];\n  /** Evidence-verification rate carried from the miner (hallucination health). */\n  evidenceRate: number;\n  /** Minimum independentSupport across the qualified sides (≥ k). */\n  minIndependentSupport: number;\n}\n\n/** Result of one shadow mining pass (the aggregate telemetry payload shape). */\nexport interface OutcomeShadowResult {\n  /** Distinct independent examples considered after dedup + capping. */\n  poolSize: number;\n  /** Count of eligible hypotheses (meets k + ≥ minComparedSides qualified). */\n  eligibleCount: number;\n  /**\n   * Eligible hypotheses only, sorted deterministically. Aggregate stats only —\n   * no opportunity ids, no candidate text, no small-cell counts.\n   */\n  hypotheses: OutcomeHypothesis[];\n}\n\n/** Input to the pure outcome-join step (assignment already done, blind). */\nexport interface JoinOutcomeHypothesesInput {\n  /** Mined discriminators with verified side assignments (blind to outcome). */\n  discriminators: MinedDiscriminator[];\n  /**\n   * Outcome labels keyed by opportunity id. Each example is already\n   * independent (deduplicated by the orchestrator), so one entry = one\n   * independent example.\n   */\n  examples: Map<string, OutcomeLabel>;\n  /** Independent-support threshold per side. Defaults to k. */\n  minIndependentSupport?: number;\n  /** Minimum qualified sides. Defaults to the module constant. */\n  minComparedSides?: number;\n}\n"]}

package/dist/premise/premise.analyzer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.analyzer.d.ts","sourceRoot":"/","sources":["premise/premise.analyzer.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAiExB,QAAA,MAAM,cAAc;;;;;;;;;;;;;;;;;;;;;EAoBlB,CAAC;AAEH,MAAM,MAAM,qBAAqB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,CAAC;AAEnE;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,KAAK,CAA2C;;IAS3C,MAAM,CACjB,WAAW,EAAE,MAAM,EACnB,cAAc,CAAC,EAAE,MAAM,EACvB,OAAO,GAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAO,GACrC,OAAO,CAAC,qBAAqB,CAAC;CAwBlC"}

package/dist/premise/premise.analyzer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.analyzer.js","sourceRoot":"/","sources":["premise/premise.analyzer.ts"],"names":[],"mappings":";;;;;;;;;AAAA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAC5E,OAAO,EAAE,KAAK,EAAE,MAAM,wCAAwC,CAAC;AAC/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AAExE,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,CAAC,CAAC;AACjD,MAAM,SAAS,GAAG,cAAc,CAAC,wBAAwB,CAAC,CAAC;AAE3D,MAAM,YAAY,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAsDpB,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAC5B,+EAA+E;QAC/E,oCAAoC,CACrC;IACD,aAAa,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC,QAAQ,CAC1D,6FAA6F,CAC9F;IACD,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CACpD,8EAA8E,CAC/E;IACD,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CACpD,8DAA8D,CAC/D;IACD,eAAe,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAClD,+DAA+D,CAChE;IACD,eAAe,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAChD,8EAA8E,CAC/E;CACF,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,OAAO,eAAe;IAG1B;QACE,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAAC,iBAAiB,EAAE,cAAc,EAAE;YACpE,IAAI,EAAE,kBAAkB;SACzB,CAAC,CAAC;IACL,CAAC;IAGY,AAAN,KAAK,CAAC,MAAM,CACjB,WAAmB,EACnB,cAAuB,EACvB,UAAoC,EAAE;QAEtC,SAAS,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,OAAO,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAEvF,MAAM,YAAY,GAAG,cAAc;YACjC,CAAC,CAAC,kCAAkC,cAAc,IAAI;YACtD,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,MAAM,GAAG,GAAG,YAAY;;GAE/B,WAAW;;yDAE2C,CAAC;QAEtD,MAAM,QAAQ,GAAG;YACf,IAAI,aAAa,CAAC,YAAY,CAAC;YAC/B,IAAI,YAAY,CAAC,MAAM,CAAC;SACzB,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACjF,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAE5C,SAAS,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,aAAa,EAAE,MAAM,CAAC,aAAa,EAAE,eAAe,EAAE,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC;QACvH,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA5Bc;IADZ,KAAK,EAAE;;;;6CA4BP","sourcesContent":["import { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\nimport { protocolLogger } from \"../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../shared/observability/performance.js\";\nimport { createStructuredModel } from \"../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../shared/agent/model-signal.js\";\n\nconst logger = protocolLogger(\"PremiseAnalyzer\");\nconst invokeLog = protocolLogger(\"PremiseAnalyzer:invoke\");\n\nconst systemPrompt = `\nYou are the Premise Analyzer for the Index Network — an intent-driven discovery protocol.\n\nYour job: classify a self-descriptive premise using adapted Speech Act Theory, then score its felicity conditions.\n\nA premise is a proposition a person asserts about themselves. It is NOT a desire or request (those are intents). Premises are conditions of possibility — facts about who someone is that ground opportunity discovery.\n\nAlways reason before classifying. Output reasoning first.\n\n═══════════════════════════════════════════════════\nSTEP 1 — CLASSIFY THE SPEECH ACT\n═══════════════════════════════════════════════════\n\nDECLARATIVE: The premise constitutes a fact about the speaker's identity, role, or status.\n  Examples:\n  · \"I am a climate-tech founder\" → DECLARATIVE\n  · \"I hold a PhD in computational biology\" → DECLARATIVE\n  · \"I am based in Berlin\" → DECLARATIVE\n  · \"I am raising Series A\" → DECLARATIVE (constitutes current status)\n\nASSERTIVE: The premise describes a capability, experience, or characteristic.\n  Examples:\n  · \"I have 10 years of experience in distributed systems\" → ASSERTIVE\n  · \"I built a collaboration platform used by 50k users\" → ASSERTIVE\n  · \"I speak fluent Mandarin and German\" → ASSERTIVE\n  · \"I specialize in zero-knowledge proofs\" → ASSERTIVE\n\n═══════════════════════════════════════════════════\nSTEP 2 — SCORE THE FELICITY CONDITIONS (0–100)\n═══════════════════════════════════════════════════\n\nAUTHORITY (Preparatory Condition)\n  Does the speaker plausibly have standing to assert this?\n  100 → Highly specific, verifiable claim (\"I founded X in 2019\")\n   60 → Plausible but unverifiable (\"I have deep expertise in AI\")\n   20 → Implausible or grandiose (\"I am the world's leading expert\")\n\nSINCERITY (Sincerity Condition)\n  Does the linguistic form suggest genuine self-description vs. aspiration?\n  100 → Present tense, first person, specific (\"I am a YC-backed founder\")\n   60 → Hedged or aspirational (\"I'm sort of getting into crypto\")\n   20 → Clearly aspirational masquerading as fact (\"I'm basically a VC\")\n\nCLARITY (Essential Condition)\n  How specific and matchable is this premise?\n  100 → \"I build distributed database systems in Rust at a Series B startup\"\n   60 → \"I work in tech\" (clear direction, vague spec)\n   20 → \"I do things\" (barely informative)\n\nSEMANTIC ENTROPY → 0.0 to 1.0\n  0.0 = maximally constrained (role + domain + location + stage all specified)\n  1.0 = no constraints at all\n  0.0 example: \"I am a senior ML engineer at Google Brain in Mountain View\"\n  1.0 example: \"I'm a person\"\n`;\n\nconst responseFormat = z.object({\n  reasoning: z.string().describe(\n    \"Step-by-step analysis: (1) whether this is DECLARATIVE or ASSERTIVE and why, \" +\n    \"(2) felicity condition assessment.\"\n  ),\n  speechActType: z.enum([\"DECLARATIVE\", \"ASSERTIVE\"]).describe(\n    \"DECLARATIVE = constitutes identity/role/status; ASSERTIVE = describes capability/experience\"\n  ),\n  felicityAuthority: z.number().min(0).max(100).describe(\n    \"Preparatory: does the speaker plausibly have standing to assert this (0-100)\"\n  ),\n  felicitySincerity: z.number().min(0).max(100).describe(\n    \"Sincerity: genuine self-description vs. aspirational (0-100)\"\n  ),\n  felicityClarity: z.number().min(0).max(100).describe(\n    \"Essential: how specific and matchable is this premise (0-100)\"\n  ),\n  semanticEntropy: z.number().min(0).max(1).describe(\n    \"Constraint density: 0.0 = maximally specific, 1.0 = completely unconstrained\"\n  ),\n});\n\nexport type PremiseAnalyzerOutput = z.infer<typeof responseFormat>;\n\n/**\n * Classifies a premise using adapted Speech Act Theory and scores felicity conditions.\n */\nexport class PremiseAnalyzer {\n  private model: ReturnType<typeof createStructuredModel>;\n\n  constructor() {\n    this.model = createStructuredModel(\"premiseAnalyzer\", responseFormat, {\n      name: \"premise_analyzer\"\n    });\n  }\n\n  @Timed()\n  public async invoke(\n    premiseText: string,\n    profileContext?: string,\n    options: { signal?: AbortSignal } = {},\n  ): Promise<PremiseAnalyzerOutput> {\n    invokeLog.verbose('Analyzing premise text', { preview: premiseText.substring(0, 50) });\n\n    const contextBlock = profileContext\n      ? `\\n# Speaker Profile (Context)\\n${profileContext}\\n`\n      : \"\";\n\n    const prompt = `${contextBlock}\n# Premise to Analyze\n\"${premiseText}\"\n\nClassify this premise and score its felicity conditions.`;\n\n    const messages = [\n      new SystemMessage(systemPrompt),\n      new HumanMessage(prompt),\n    ];\n\n    const result = await invokeWithAbortSignal(this.model, messages, options.signal);\n    const output = responseFormat.parse(result);\n\n    invokeLog.verbose('Analysis result', { speechActType: output.speechActType, semanticEntropy: output.semanticEntropy });\n    return output;\n  }\n}\n"]}

package/dist/premise/premise.decomposer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.decomposer.d.ts","sourceRoot":"/","sources":["premise/premise.decomposer.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAmIxB,QAAA,MAAM,iBAAiB;;;;;;;;;;;;EAQrB,CAAC;AAEH,QAAA,MAAM,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAalB,CAAC;AAEH,oFAAoF;AACpF,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,MAAM,uBAAuB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,CAAC;AACrE,MAAM,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAElE;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,KAAK,CAA2C;;IAS3C,MAAM,CACjB,KAAK,EAAE,MAAM,EACb,gBAAgB,CAAC,EAAE,kBAAkB,EAAE,EACvC,UAAU,CAAC,EAAE,MAAM,EACnB,OAAO,GAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAO,GACrC,OAAO,CAAC,uBAAuB,CAAC;CAyDpC"}

package/dist/premise/premise.decomposer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.decomposer.js","sourceRoot":"/","sources":["premise/premise.decomposer.ts"],"names":[],"mappings":";;;;;;;;;AAAA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAC5E,OAAO,EAAE,KAAK,EAAE,MAAM,wCAAwC,CAAC;AAC/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AAExE,MAAM,MAAM,GAAG,cAAc,CAAC,mBAAmB,CAAC,CAAC;AACnD,MAAM,SAAS,GAAG,cAAc,CAAC,0BAA0B,CAAC,CAAC;AAE7D,MAAM,YAAY,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAwHpB,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,CAAC,MAAM,CAAC;IACjC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,8EAA8E,CAAC;IACzG,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC,QAAQ,CAChD,qEAAqE,CACtE;IACD,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAC3D,iJAAiJ,CAClJ;CACF,CAAC,CAAC;AAEH,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAC5B,uEAAuE,CACxE;IACD,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAC3C,iFAAiF,CAClF;IACD,mBAAmB,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,QAAQ,CAC3D,8KAA8K,CAC/K;IACD,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CACtD,gNAAgN,CACjN;CACF,CAAC,CAAC;AAWH;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IAG5B;QACE,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAAC,mBAAmB,EAAE,cAAc,EAAE;YACtE,IAAI,EAAE,oBAAoB;SAC3B,CAAC,CAAC;IACL,CAAC;IAGY,AAAN,KAAK,CAAC,MAAM,CACjB,KAAa,EACb,gBAAuC,EACvC,UAAmB,EACnB,UAAoC,EAAE;QAEtC,SAAS,CAAC,OAAO,CAAC,mBAAmB,EAAE;YACrC,UAAU,EAAE,KAAK,CAAC,MAAM;YACxB,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,IAAI,CAAC;YACnD,MAAM,EAAE,OAAO,CAAC,UAAU,CAAC;SAC5B,CAAC,CAAC;QAEH,MAAM,aAAa,GAAG,gBAAgB,EAAE,MAAM;YAC5C,CAAC,CAAC,wEAAwE,gBAAgB;iBACrF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC;iBACzC,IAAI,CAAC,IAAI,CAAC,EAAE;YACjB,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,QAAQ,GAAG,UAAU,EAAE,IAAI,EAAE;YACjC,CAAC,CAAC,4FAA4F,UAAU,CAAC,IAAI,EAAE,EAAE;YACjH,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,MAAM,GAAG,6DAA6D,KAAK,GAAG,aAAa,GAAG,QAAQ,EAAE,CAAC;QAE/G,MAAM,QAAQ,GAAG;YACf,IAAI,aAAa,CAAC,YAAY,CAAC;YAC/B,IAAI,YAAY,CAAC,MAAM,CAAC;SACzB,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACjF,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAE5C,4FAA4F;QAC5F,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpE,MAAM,UAAU,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,gCAAgC,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;QAC7F,CAAC;QACD,MAAM,CAAC,mBAAmB,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAEzF,uEAAuE;QACvE,yEAAyE;QACzE,4CAA4C;QAC5C,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC;QAChD,IACE,CAAC,UAAU,EAAE,IAAI,EAAE;YACnB,CAAC,aAAa;YACd,aAAa,CAAC,WAAW,EAAE,KAAK,MAAM;YACtC,aAAa,KAAK,UAAU,CAAC,IAAI,EAAE,EACnC,CAAC;YACD,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,UAAU,GAAG,aAAa,CAAC;QACpC,CAAC;QAED,SAAS,CAAC,OAAO,CAAC,oCAAoC,EAAE;YACtD,YAAY,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;YACpC,eAAe,EAAE,MAAM,CAAC,mBAAmB,CAAC,MAAM;YAClD,aAAa,EAAE,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC;SAC1C,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA9Dc;IADZ,KAAK,EAAE;;;;+CA8DP","sourcesContent":["import { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\nimport { protocolLogger } from \"../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../shared/observability/performance.js\";\nimport { createStructuredModel } from \"../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../shared/agent/model-signal.js\";\n\nconst logger = protocolLogger(\"PremiseDecomposer\");\nconst invokeLog = protocolLogger(\"PremiseDecomposer:invoke\");\n\nconst systemPrompt = `\nYou are the Premise Decomposer for the Index Network — an intent-driven discovery protocol.\n\nYour job: decompose free-text input about a person into individual, atomic premises.\n\nA premise is a single self-descriptive proposition — a fact someone asserts about themselves.\nEach premise should be:\n1. **Atomic** — one fact per premise, not compound statements\n2. **First-person** — phrased as \"I am...\", \"I work at...\", \"I specialize in...\"\n3. **Self-descriptive** — about the person's identity, role, skills, interests, location, or context\n4. **Non-redundant** — do not repeat the same information in multiple premises\n\n═══════════════════════════════════════════════════\nINPUT TYPES\n═══════════════════════════════════════════════════\n\nYou may receive:\n- **Chat messages**: \"I'm a software engineer at Google, based in SF. I'm interested in AI safety.\"\n- **Bio text**: A paragraph describing someone's background\n- **Scraped content**: LinkedIn/GitHub/Twitter data about someone\n- **Mixed input**: Name, location, and free-text combined\n\n═══════════════════════════════════════════════════\nDECOMPOSITION RULES\n═══════════════════════════════════════════════════\n\n1. Extract every distinct factual claim about the person\n2. Convert third-person (\"She works at...\") to first-person (\"I work at...\")\n3. Separate compound statements: \"I know Python and Rust\" → two premises\n4. Capture the FULL breadth of self-description, not just job/title. In particular,\n   do not drop:\n   - **Skills & expertise** (\"I specialize in distributed systems\", \"I know Rust\")\n   - **Interests & focus areas** (\"I am interested in AI safety\", \"I care about climate\")\n   - **Background/narrative context** (education, prior roles, domains, affiliations)\n   These map to what a profile would store as interests/skills/context — every such\n   fact must surface as its own premise so nothing is lost.\n5. Classify each premise:\n   - \\`assertive\\` — stable identity facts (role, skills, interests, education, location)\n   - \\`contextual\\` — temporal/situational (current projects, events, fundraising status)\n6. For \\`contextual\\` premises, estimate \\`validityDays\\` — how many days the fact is\n   likely to remain true from now (e.g. \"speaking next week\" → ~7, \"raising a Series A\"\n   → ~120, \"currently building X\" → ~180). Use null for \\`assertive\\` premises, which\n   have no natural expiry.\n7. Skip vague or uninformative statements (\"I like stuff\", \"I'm a person\")\n8. Skip desires, requests, or intents (\"I'm looking for...\", \"I want to...\") — those are intents, not premises\n9. If the input contains NO extractable premises (e.g. just \"Yes\" or \"Hello\"), return an empty array\n10. NEVER extract denials or removal instructions as premises. \"I have nothing to do with X\",\n    \"I am not a Y\", or \"remove X from my profile\" are retractions, not facts — handle them\n    via the retraction rules below and do NOT emit a premise for them.\n\n═════════════════════════════════════════════════\nRETRACTION RULES\n═════════════════════════════════════════════════\n\nWhen the message includes the user's EXISTING PREMISES (listed with ids), you must also\ndetect which of them the input disavows and return their ids in \\`retractedPremiseIds\\`.\n\nA premise must be retracted when the input:\n- Explicitly asks to remove it (\"remove all mentions of X\", \"delete the part about Y\")\n- Denies it (\"I have nothing to do with X\", \"I never worked at Y\", \"that's not true\")\n- States it no longer holds (\"I no longer live in Berlin\", \"I left Google\")\n- Directly contradicts it (\"I'm based in Istanbul\" contradicts \"I am based in Ankara\")\n\nRules:\n- Only return ids that appear in the provided EXISTING PREMISES list — never invent ids.\n- Retract EVERY existing premise that matches the disavowed topic, not just the first one.\n- Do not retract premises the input merely omits — silence is not disavowal.\n- If no existing premises are provided, or nothing is disavowed, return an empty array.\n- Retraction and extraction are independent: an input can retract old premises AND\n  contribute new ones in the same pass.\n\n═══════════════════════════════════════════════════\nBIO REVISION RULES\n═══════════════════════════════════════════════════\n\nWhen the message includes the user's CURRENT BIO, check whether the input disavows,\nremoves, or corrects anything that appears in it.\n\n- If it does, return \\`revisedBio\\`: the bio rewritten with those facts removed or\n  corrected. Preserve everything the input does not dispute — same tone, similar\n  length, no inventions.\n- If the input explicitly rewrites the bio (\"update my bio to X\"), return that\n  rewritten bio.\n- NEVER add new facts to the bio — new information becomes premises, not bio edits.\n  Purely additive input (\"I also enjoy X\") must return revisedBio: null.\n- If the bio is unaffected, or no CURRENT BIO was provided, return null.\n- Never return a revised bio that still mentions a disavowed fact.\n\n═══════════════════════════════════════════════════\nEXAMPLES\n═══════════════════════════════════════════════════\n\nInput: \"I'm a climate tech founder based in Berlin. I have a PhD in renewable energy systems and I'm currently raising Series A.\"\nOutput:\n  1. \"I am a climate tech founder\" (assertive, validityDays: null)\n  2. \"I am based in Berlin\" (assertive, validityDays: null)\n  3. \"I hold a PhD in renewable energy systems\" (assertive, validityDays: null)\n  4. \"I am currently raising Series A\" (contextual, validityDays: 120)\n\nInput: \"John Doe is a senior ML engineer at Meta in Menlo Park. He has 8 years of experience in NLP and computer vision.\"\nOutput:\n  1. \"I am a senior ML engineer\" (assertive, validityDays: null)\n  2. \"I work at Meta\" (assertive, validityDays: null)\n  3. \"I am based in Menlo Park\" (assertive, validityDays: null)\n  4. \"I have 8 years of experience in NLP\" (assertive, validityDays: null)\n  5. \"I have experience in computer vision\" (assertive, validityDays: null)\n\nInput: \"Yes, create my profile\"\nOutput: [] (empty — no premises)\n\nInput: \"Remove all mentions of the HOPE programming language. I have nothing to do with it. I specialize in compiler design.\"\nExisting premises:\n  - id: aaaa-1 · \"I am the creator of the HOPE programming language\"\n  - id: aaaa-2 · \"I specialize in compiler design\"\n  - id: aaaa-3 · \"I am based in Istanbul\"\nCurrent bio: \"Software engineer in Istanbul. Creator of the HOPE programming language. Specializes in compiler design.\"\nOutput:\n  premises: [] (compiler design already exists as aaaa-2 — nothing new to add)\n  retractedPremiseIds: [\"aaaa-1\"]\n  revisedBio: \"Software engineer in Istanbul. Specializes in compiler design.\"\n`;\n\nconst premiseItemSchema = z.object({\n  text: z.string().describe(\"The premise text in first person (e.g. 'I am a software engineer at Google')\"),\n  tier: z.enum([\"assertive\", \"contextual\"]).describe(\n    \"assertive = stable identity fact; contextual = temporal/situational\"\n  ),\n  validityDays: z.number().int().positive().nullable().describe(\n    \"For contextual premises: estimated days the fact remains true from now (its validity window). null for assertive premises, which do not expire.\"\n  ),\n});\n\nconst responseFormat = z.object({\n  reasoning: z.string().describe(\n    \"Brief analysis of what factual claims can be extracted from the input\"\n  ),\n  premises: z.array(premiseItemSchema).describe(\n    \"Array of extracted premises. Empty if input contains no self-descriptive facts.\"\n  ),\n  retractedPremiseIds: z.array(z.string()).default([]).describe(\n    \"Ids of EXISTING premises (from the provided list) that the input disavows, denies, or asks to remove. Empty when nothing is disavowed or no existing premises were provided.\"\n  ),\n  revisedBio: z.string().nullable().default(null).describe(\n    \"When the input disavows or corrects facts that appear in the provided CURRENT BIO, the bio rewritten without those facts (preserving everything else). null when the bio is unaffected or no bio was provided.\"\n  ),\n});\n\n/** An existing ACTIVE premise offered to the decomposer for retraction matching. */\nexport interface ExistingPremiseRef {\n  id: string;\n  text: string;\n}\n\nexport type PremiseDecomposerOutput = z.infer<typeof responseFormat>;\nexport type DecomposedPremise = z.infer<typeof premiseItemSchema>;\n\n/**\n * Decomposes free-text input (chat messages, bios, scraped content) into\n * individual atomic premises suitable for the premise graph.\n */\nexport class PremiseDecomposer {\n  private model: ReturnType<typeof createStructuredModel>;\n\n  constructor() {\n    this.model = createStructuredModel(\"premiseDecomposer\", responseFormat, {\n      name: \"premise_decomposer\",\n    });\n  }\n\n  @Timed()\n  public async invoke(\n    input: string,\n    existingPremises?: ExistingPremiseRef[],\n    currentBio?: string,\n    options: { signal?: AbortSignal } = {},\n  ): Promise<PremiseDecomposerOutput> {\n    invokeLog.verbose('Decomposing input', {\n      inputChars: input.length,\n      existingPremiseCount: existingPremises?.length ?? 0,\n      hasBio: Boolean(currentBio),\n    });\n\n    const existingBlock = existingPremises?.length\n      ? `\\n\\nEXISTING PREMISES (retract by id when the input disavows them):\\n${existingPremises\n          .map((p) => `- id: ${p.id} · \"${p.text}\"`)\n          .join(\"\\n\")}`\n      : \"\";\n\n    const bioBlock = currentBio?.trim()\n      ? `\\n\\nCURRENT BIO (return revisedBio when the input disavows or corrects anything in it):\\n${currentBio.trim()}`\n      : \"\";\n\n    const prompt = `Decompose the following text into individual premises:\\n\\n${input}${existingBlock}${bioBlock}`;\n\n    const messages = [\n      new SystemMessage(systemPrompt),\n      new HumanMessage(prompt),\n    ];\n\n    const result = await invokeWithAbortSignal(this.model, messages, options.signal);\n    const output = responseFormat.parse(result);\n\n    // Guard against hallucinated ids: only keep retractions that reference premises we offered.\n    const knownIds = new Set((existingPremises ?? []).map((p) => p.id));\n    const droppedIds = output.retractedPremiseIds.filter((id) => !knownIds.has(id));\n    if (droppedIds.length > 0) {\n      invokeLog.warn('Dropped unknown retraction ids', { count: droppedIds.length, droppedIds });\n    }\n    output.retractedPremiseIds = output.retractedPremiseIds.filter((id) => knownIds.has(id));\n\n    // A revised bio is only meaningful when we offered one to revise. Also\n    // normalize structured-output quirks: literal \"null\", empty strings, and\n    // no-op rewrites all mean \"bio unaffected\".\n    const normalizedBio = output.revisedBio?.trim();\n    if (\n      !currentBio?.trim() ||\n      !normalizedBio ||\n      normalizedBio.toLowerCase() === 'null' ||\n      normalizedBio === currentBio.trim()\n    ) {\n      output.revisedBio = null;\n    } else {\n      output.revisedBio = normalizedBio;\n    }\n\n    invokeLog.verbose('Extracted premises and retractions', {\n      premiseCount: output.premises.length,\n      retractionCount: output.retractedPremiseIds.length,\n      hasRevisedBio: Boolean(output.revisedBio),\n    });\n    return output;\n  }\n}\n"]}

package/dist/premise/premise.graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.graph.d.ts","sourceRoot":"/","sources":["premise/premise.graph.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAKtD,OAAO,KAAK,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,4CAA4C,CAAC;AACxG,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAC;AAG3E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AAmCtE;;GAEG;AACH,qBAAa,mBAAmB;IAE5B,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,cAAc;IACtB,OAAO,CAAC,eAAe;gBAHf,QAAQ,EAAE,oBAAoB,EAC9B,QAAQ,EAAE,QAAQ,EAClB,cAAc,GAAE,cAAqC,EACrD,eAAe,GAAE;QAAE,MAAM,CAAC,WAAW,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAA;KAA0B;IAG3I;;;;OAIG;IACI,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;2BAqK0B,MAAM;gCAAkB,MAAM;;;;;CA6F3E"}

package/dist/premise/premise.graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.graph.js","sourceRoot":"/","sources":["premise/premise.graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAE9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,8BAA8B,EAAE,6BAA6B,EAAE,MAAM,mDAAmD,CAAC;AAClI,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AAGnE,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAC5E,OAAO,EAAE,KAAK,EAAE,MAAM,wCAAwC,CAAC;AAG/D,MAAM,MAAM,GAAG,cAAc,CAAC,qBAAqB,CAAC,CAAC;AACrD,MAAM,QAAQ,GAAG,cAAc,CAAC,oBAAoB,CAAC,CAAC;AACtD,MAAM,UAAU,GAAG,cAAc,CAAC,sBAAsB,CAAC,CAAC;AAC1D,MAAM,QAAQ,GAAG,cAAc,CAAC,oBAAoB,CAAC,CAAC;AACtD,MAAM,UAAU,GAAG,cAAc,CAAC,sBAAsB,CAAC,CAAC;AAC1D,MAAM,QAAQ,GAAG,cAAc,CAAC,oBAAoB,CAAC,CAAC;AACtD,MAAM,SAAS,GAAG,cAAc,CAAC,qBAAqB,CAAC,CAAC;AAExD;;;;;;GAMG;AACH,MAAM,0BAA0B,GAAG,CAAC,GAAG,EAAE;IACvC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAClE,CAAC,CAAC,EAAE,CAAC;AAEL;;;;GAIG;AACH,SAAS,0BAA0B,CAAC,QAAqC;IACvE,IAAI,CAAC,QAAQ;QAAE,OAAO,GAAG,CAAC;IAC1B,MAAM,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,eAAe,EAAE,GAAG,QAAQ,CAAC;IAC3E,MAAM,IAAI,GAAG,CAAC,iBAAiB,GAAG,iBAAiB,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IAC3E,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC;IACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAC9B,YACU,QAA8B,EAC9B,QAAkB,EAClB,iBAAiC,IAAI,cAAc,EAAE,EACrD,kBAA4G,IAAI,eAAe,EAAE;QAHjI,aAAQ,GAAR,QAAQ,CAAsB;QAC9B,aAAQ,GAAR,QAAQ,CAAU;QAClB,mBAAc,GAAd,cAAc,CAAuC;QACrD,oBAAe,GAAf,eAAe,CAAkH;IACxI,CAAC;IAEJ;;;;OAIG;IACI,WAAW;QAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC;QAEpC,MAAM,SAAS,GAAG,KAAK,EAAE,KAAqC,EAAE,EAAE;YAChE,OAAO,KAAK,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE;gBAC5C,QAAQ,CAAC,OAAO,CAAC,4BAA4B,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;gBACzE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAChF,OAAO;oBACL,UAAU,EAAE;wBACV,QAAQ;wBACR,KAAK,EAAE,QAAQ,CAAC,MAAM;qBACvB;iBACF,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,KAAK,EAAE,KAAqC,EAAE,EAAE;YAClE,OAAO,KAAK,CAAC,sBAAsB,EAAE,KAAK,IAAI,EAAE;gBAC9C,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;oBACzB,OAAO,EAAE,KAAK,EAAE,kDAAkD,EAAE,CAAC;gBACvE,CAAC;gBAED,UAAU,CAAC,OAAO,CAAC,0BAA0B,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAElG,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;gBAC1D,MAAM,MAAM,GAAmB;oBAC7B,IAAI,EAAE,kBAAkB;oBACxB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;iBAC/B,CAAC;gBAEF,MAAM,QAAQ,GAAoB;oBAChC,aAAa,EAAE,MAAM,CAAC,aAAa;oBACnC,iBAAiB,EAAE,MAAM,CAAC,iBAAiB;oBAC3C,iBAAiB,EAAE,MAAM,CAAC,iBAAiB;oBAC3C,eAAe,EAAE,MAAM,CAAC,eAAe;oBACvC,eAAe,EAAE,MAAM,CAAC,eAAe;iBACxC,CAAC;gBAEF,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9C,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,MAAM,SAAS,GAAG,KAAK,EAAE,KAAqC,EAAE,EAAE;YAChE,OAAO,KAAK,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE;gBAC5C,IAAI,KAAK,CAAC,KAAK;oBAAE,OAAO,EAAE,CAAC;gBAE3B,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC;oBACzB,OAAO,EAAE,KAAK,EAAE,yCAAyC,EAAE,CAAC;gBAC9D,CAAC;gBAED,QAAQ,CAAC,OAAO,CAAC,kCAAkC,CAAC,CAAC;gBAErD,gFAAgF;gBAChF,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,EAAE,SAAS,EAAE,oBAAoB,EAAE,CAAa,CAAC;gBACnH,OAAO,EAAE,SAAS,EAAE,CAAC;YACvB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,4DAA4D;QAC5D,kCAAkC;QAClC,+EAA+E;QAC/E,+EAA+E;QAC/E,+EAA+E;QAC/E,iFAAiF;QACjF,4DAA4D;QAC5D,MAAM,UAAU,GAAG,KAAK,EAAE,KAAqC,EAAE,EAAE;YACjE,OAAO,KAAK,CAAC,qBAAqB,EAAE,KAAK,IAAI,EAAE;gBAC7C,IAAI,KAAK,CAAC,KAAK;oBAAE,OAAO,EAAE,CAAC;gBAC3B,IAAI,KAAK,CAAC,aAAa,KAAK,QAAQ;oBAAE,OAAO,EAAE,CAAC;gBAChD,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,EAAE,CAAC;gBAChE,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,wBAAwB,KAAK,UAAU;oBAAE,OAAO,EAAE,CAAC;gBAE5E,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,wBAAwB,CAAC;oBACzD,MAAM,EAAE,KAAK,CAAC,MAAM;oBACpB,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,SAAS,EAAE,0BAA0B;iBACtC,CAAC,CAAC;gBAEH,IAAI,KAAK,EAAE,CAAC;oBACV,SAAS,CAAC,OAAO,CAAC,iCAAiC,EAAE;wBACnD,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC/C,SAAS,EAAE,0BAA0B;wBACrC,SAAS,EAAE,KAAK,CAAC,SAAS;qBAC3B,CAAC,CAAC;oBACH,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;gBAChC,CAAC;gBACD,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,KAAK,EAAE,KAAqC,EAAE,EAAE;YAClE,OAAO,KAAK,CAAC,sBAAsB,EAAE,KAAK,IAAI,EAAE;gBAC9C,IAAI,KAAK,CAAC,KAAK;oBAAE,OAAO,EAAE,CAAC;gBAE3B,IAAI,KAAK,CAAC,aAAa,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;oBAC/D,OAAO,EAAE,KAAK,EAAE,6CAA6C,EAAE,CAAC;gBAClE,CAAC;gBAED,IAAI,KAAK,CAAC,aAAa,KAAK,QAAQ,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;oBAC9D,UAAU,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,eAAe,EAAE,CAAC,CAAC;oBAE7E,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,eAAe,EAAE;wBACvE,SAAS,EAAE;4BACT,IAAI,EAAE,KAAK,CAAC,aAAc;4BAC1B,IAAI,EAAE,KAAK,CAAC,IAAI;yBACjB;wBACD,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,SAAS;wBACrC,QAAQ,EAAE;4BACR,SAAS,EAAE,KAAK,CAAC,SAAS;4BAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;4BAC5B,QAAQ,EAAE,KAAK,CAAC,QAAQ;yBACzB;wBACD,SAAS,EAAE,KAAK,CAAC,SAAS;qBAC3B,CAAC,CAAC;oBACH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;gBAC9B,CAAC;gBAED,UAAU,CAAC,OAAO,CAAC,+BAA+B,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;gBAE9E,6EAA6E;gBAC7E,6EAA6E;gBAC7E,uEAAuE;gBACvE,kDAAkD;gBAClD,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACrE,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;oBAChD,MAAM,EAAE,KAAK,CAAC,MAAM;oBACpB,SAAS,EAAE;wBACT,IAAI,EAAE,KAAK,CAAC,aAAc;wBAC1B,IAAI,EAAE,KAAK,CAAC,IAAI;qBACjB;oBACD,UAAU,EAAE;wBACV,MAAM,EAAE,KAAK,CAAC,gBAAgB,IAAI,UAAU;wBAC5C,QAAQ,EAAE,KAAK,CAAC,kBAAkB;wBAClC,UAAU,EAAE,KAAK,CAAC,oBAAoB,IAAI,iBAAiB;wBAC3D,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;qBACpC;oBACD,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,SAAS;oBACrC,QAAQ,EAAE;wBACR,SAAS,EAAE,KAAK,CAAC,SAAS;wBAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;wBAC5B,QAAQ,EAAE,KAAK,CAAC,QAAQ;qBACzB;oBACD,SAAS,EAAE,KAAK,CAAC,SAAS;iBAC3B,CAAC,CAAC;gBACH,OAAO,EAAE,OAAO,EAAE,CAAC;YACrB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,MAAM,SAAS,GAAG,KAAK,EAAE,KAAqC,EAAE,EAAE;YAChE,OAAO,KAAK,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE;gBAC5C,IAAI,CAAC,KAAK,CAAC,OAAO;oBAAE,OAAO,EAAE,CAAC;gBAE9B,QAAQ,CAAC,OAAO,CAAC,uCAAuC,CAAC,CAAC;gBAE1D,MAAM,qBAAqB,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,sCAAsC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBACvG,MAAM,YAAY,GAAG,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO;oBACnD,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;oBACxD,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;gBAC7C,MAAM,QAAQ,GAAG,6BAA6B,CAAC;oBAC7C,WAAW,EAAE,qBAAqB;oBAClC,GAAG,YAAY;iBAChB,CAAC,CAAC;gBACH,MAAM,KAAK,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAC5D,MAAM,WAAW,GAAyD,EAAE,CAAC;gBAC7E,MAAM,YAAY,GAAqB,EAAE,CAAC;gBAE1C,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;oBACjC,IAAI,CAAC;wBACH,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,2BAA2B,CAAC,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;wBACnG,IAAI,CAAC,iBAAiB;4BAAE,SAAS;wBACjC,MAAM,WAAW,GAAG,iBAAiB,CAAC,WAAW,CAAC;wBAClD,MAAM,YAAY,GAAG,iBAAiB,CAAC,YAAY,CAAC;wBACpD,MAAM,UAAU,GAAG,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,YAAY,EAAE,IAAI,EAAE,CAAC;wBACnE,IAAI,SAAoE,CAAC;wBACzE,IAAI,MAA0B,CAAC;wBAE/B,IAAI,UAAU,EAAE,CAAC;4BACf,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;4BACzB,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC;gCAClC,WAAW,EAAE,KAAK,CAAC,aAAc;gCACjC,WAAW,EAAE,WAAW,IAAI,EAAE;gCAC9B,YAAY,EAAE,YAAY,IAAI,SAAS;6BACxC,CAAC,CAAC;4BACH,MAAM,MAAM,GAAmB;gCAC7B,IAAI,EAAE,iBAAiB;gCACvB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;6BAC/B,CAAC;4BACF,SAAS,GAAG,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC;4BAC/E,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC;4BAC1B,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC5B,CAAC;wBAED,MAAM,QAAQ,GAAG,8BAA8B,CAAC;4BAC9C,YAAY,EAAE,SAAS;4BACvB,IAAI,EAAE,WAAW;4BACjB,KAAK;4BACL,WAAW;4BACX,YAAY;4BACZ,SAAS;4BACT,SAAS,EAAE,iBAAiB;4BAC5B,MAAM,EAAE,eAAe;4BACvB,MAAM;4BACN,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;yBACpC,CAAC,CAAC;wBAEH,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;4BACtB,MAAM,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CACxC,KAAK,CAAC,OAAO,CAAC,EAAE,EAChB,SAAS,EACT,QAAQ,CAAC,UAAU,EACnB,QAAQ,CAAC,QAAQ,CAClB,CAAC;4BACF,WAAW,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,cAAc,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;wBACvE,CAAC;oBACH,CAAC;oBAAC,OAAO,GAAG,EAAE,CAAC;wBACb,QAAQ,CAAC,OAAO,CAAC,mCAAmC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;oBACnF,CAAC;gBACH,CAAC;gBAED,QAAQ,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;gBAExE,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,YAAY,EAAE,CAAC;YAC3D,CAAC,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,CAAC,KAAqC,EAAE,EAAE;YAC5D,IAAI,KAAK,CAAC,KAAK;gBAAE,OAAO,KAAK,CAAC;YAC9B,IAAI,KAAK,CAAC,aAAa,KAAK,OAAO;gBAAE,OAAO,OAAO,CAAC;YACpD,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC;QAEF,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,iBAAiB,CAAC;aAC5C,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC;aAC3B,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC;aAC/B,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC;aAC3B,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC;aAC7B,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC;aAC/B,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC;aAC3B,mBAAmB,CAAC,KAAK,EAAE,WAAW,EAAE;YACvC,KAAK,EAAE,OAAO;YACd,OAAO,EAAE,SAAS;YAClB,GAAG,EAAE,GAAG;SACT,CAAC;aACD,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC;aACrB,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC;aAC3B,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC;YAC3B,0EAA0E;aACzE,mBAAmB,CAAC,QAAQ,EAAE,CAAC,KAAqC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;YACjH,OAAO,EAAE,SAAS;YAClB,GAAG,EAAE,GAAG;SACT,CAAC;aACD,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC;aAC3B,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAEzB,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;CACF","sourcesContent":["import { StateGraph, START, END } from \"@langchain/langgraph\";\n\nimport { PremiseGraphState } from \"./premise.state.js\";\nimport { PremiseAnalyzer } from \"./premise.analyzer.js\";\nimport type { PremiseAnalyzerOutput } from \"./premise.analyzer.js\";\nimport { PremiseIndexer } from \"./premise.indexer.js\";\n\nimport { buildNetworkAssignmentDecision, resolveAssignmentNetworkScope } from \"../shared/assignment/network-assignment.policy.js\";\nimport { getAbortSignalConfig } from \"../shared/agent/model-signal.js\";\nimport { scopeFromNetworkId } from \"../shared/agent/tool.scope.js\";\nimport type { PremiseGraphDatabase, PremiseAnalysis } from \"../shared/interfaces/database.interface.js\";\nimport type { Embedder } from \"../shared/interfaces/embedder.interface.js\";\nimport { protocolLogger } from \"../shared/observability/protocol.logger.js\";\nimport { timed } from \"../shared/observability/performance.js\";\nimport type { DebugMetaAgent } from \"../chat/chat-streaming.types.js\";\n\nconst logger = protocolLogger(\"PremiseGraphFactory\");\nconst queryLog = protocolLogger(\"PremiseGraph:query\");\nconst analyzeLog = protocolLogger(\"PremiseGraph:analyze\");\nconst embedLog = protocolLogger(\"PremiseGraph:embed\");\nconst persistLog = protocolLogger(\"PremiseGraph:persist\");\nconst indexLog = protocolLogger(\"PremiseGraph:index\");\nconst dedupeLog = protocolLogger(\"PremiseGraph:dedupe\");\n\n/**\n * Minimum cosine similarity (0-1) at which a freshly-decomposed premise is treated\n * as a near-duplicate of an existing ACTIVE premise for the same user and skipped\n * on create. Tuned high so genuine paraphrases collapse while distinct facts (e.g.\n * \"I work at Google\" vs \"I worked at Google\") still persist. Override with\n * PREMISE_DEDUP_SIMILARITY.\n */\nconst DEDUP_SIMILARITY_THRESHOLD = (() => {\n  const raw = Number(process.env.PREMISE_DEDUP_SIMILARITY);\n  return Number.isFinite(raw) && raw > 0 && raw <= 1 ? raw : 0.93;\n})();\n\n/**\n * Derive a premise provenance confidence (0-1) from the analyzer's felicity scores.\n * Averages authority, sincerity, and clarity — the dimensions that speak to how\n * trustworthy the self-assertion is. Falls back to 1.0 when no analysis is present.\n */\nfunction deriveProvenanceConfidence(analysis: PremiseAnalysis | undefined): number {\n  if (!analysis) return 1.0;\n  const { felicityAuthority, felicitySincerity, felicityClarity } = analysis;\n  const mean = (felicityAuthority + felicitySincerity + felicityClarity) / 3;\n  if (!Number.isFinite(mean)) return 1.0;\n  return Math.min(1, Math.max(0, mean));\n}\n\n/**\n * Graph factory for premise lifecycle: create, update, and query modes.\n */\nexport class PremiseGraphFactory {\n  constructor(\n    private database: PremiseGraphDatabase,\n    private embedder: Embedder,\n    private premiseIndexer: PremiseIndexer = new PremiseIndexer(),\n    private premiseAnalyzer: { invoke(premiseText: string, profileContext?: string): Promise<PremiseAnalyzerOutput> } = new PremiseAnalyzer(),\n  ) {}\n\n  /**\n   * Compiles and returns the premise lifecycle graph.\n   *\n   * @returns A compiled LangGraph graph handling create, update, and query modes.\n   */\n  public createGraph() {\n    const analyzer = this.premiseAnalyzer;\n    const indexer = this.premiseIndexer;\n\n    const queryNode = async (state: typeof PremiseGraphState.State) => {\n      return timed(\"PremiseGraph.query\", async () => {\n        queryLog.verbose('Fetching premises for user', { userId: state.userId });\n        const premises = await this.database.getPremisesForUser(state.userId, 'ACTIVE');\n        return {\n          readResult: {\n            premises,\n            count: premises.length,\n          },\n        };\n      });\n    };\n\n    const analyzeNode = async (state: typeof PremiseGraphState.State) => {\n      return timed(\"PremiseGraph.analyze\", async () => {\n        if (!state.assertionText) {\n          return { error: \"assertionText is required for create/update mode\" };\n        }\n\n        analyzeLog.verbose('Analyzing assertion text', { preview: state.assertionText.substring(0, 50) });\n\n        const start = Date.now();\n        const result = await analyzer.invoke(state.assertionText);\n        const timing: DebugMetaAgent = {\n          name: \"premise-analyzer\",\n          durationMs: Date.now() - start,\n        };\n\n        const analysis: PremiseAnalysis = {\n          speechActType: result.speechActType,\n          felicityAuthority: result.felicityAuthority,\n          felicitySincerity: result.felicitySincerity,\n          felicityClarity: result.felicityClarity,\n          semanticEntropy: result.semanticEntropy,\n        };\n\n        return { analysis, agentTimings: [timing] };\n      });\n    };\n\n    const embedNode = async (state: typeof PremiseGraphState.State) => {\n      return timed(\"PremiseGraph.embed\", async () => {\n        if (state.error) return {};\n\n        if (!state.assertionText) {\n          return { error: \"assertionText is required for embedding\" };\n        }\n\n        embedLog.verbose(`Generating embedding for premise`);\n\n        // Embedder.generate returns number[] | number[][], cast for single string input\n        const embedding = await this.embedder.generate(state.assertionText, undefined, getAbortSignalConfig()) as number[];\n        return { embedding };\n      });\n    };\n\n    // ─────────────────────────────────────────────────────────\n    // NODE: Dedupe (create mode only)\n    // Skips persisting a near-duplicate of an existing ACTIVE premise for the same\n    // user. Re-running similar input (e.g. repeated enrichment) therefore does not\n    // accumulate near-identical premises. No-op for update mode, when no embedding\n    // is available, or when the adapter does not implement findSimilarActivePremise.\n    // ─────────────────────────────────────────────────────────\n    const dedupeNode = async (state: typeof PremiseGraphState.State) => {\n      return timed(\"PremiseGraph.dedupe\", async () => {\n        if (state.error) return {};\n        if (state.operationMode === 'update') return {};\n        if (!state.embedding || state.embedding.length === 0) return {};\n        if (typeof this.database.findSimilarActivePremise !== 'function') return {};\n\n        const match = await this.database.findSimilarActivePremise({\n          userId: state.userId,\n          embedding: state.embedding,\n          threshold: DEDUP_SIMILARITY_THRESHOLD,\n        });\n\n        if (match) {\n          dedupeLog.verbose('Skipping near-duplicate premise', {\n            similarity: Number(match.similarity.toFixed(3)),\n            threshold: DEDUP_SIMILARITY_THRESHOLD,\n            premiseId: match.premiseId,\n          });\n          return { duplicateOf: match };\n        }\n        return {};\n      });\n    };\n\n    const persistNode = async (state: typeof PremiseGraphState.State) => {\n      return timed(\"PremiseGraph.persist\", async () => {\n        if (state.error) return {};\n\n        if (state.operationMode === 'update' && !state.targetPremiseId) {\n          return { error: \"targetPremiseId is required for update mode\" };\n        }\n\n        if (state.operationMode === 'update' && state.targetPremiseId) {\n          persistLog.verbose('Updating premise', { premiseId: state.targetPremiseId });\n\n          const updated = await this.database.updatePremise(state.targetPremiseId, {\n            assertion: {\n              text: state.assertionText!,\n              tier: state.tier,\n            },\n            analysis: state.analysis ?? undefined,\n            validity: {\n              validFrom: state.validFrom,\n              validUntil: state.validUntil,\n              volatile: state.volatile,\n            },\n            embedding: state.embedding,\n          });\n          return { premise: updated };\n        }\n\n        persistLog.verbose('Creating new premise for user', { userId: state.userId });\n\n        // Provenance confidence: prefer an explicit caller-supplied value; otherwise\n        // derive it from the analyzer's felicity scores (how authoritative, sincere,\n        // and clear the assertion is) rather than a blanket 1.0, so the stored\n        // provenance reflects per-premise signal quality.\n        const derivedConfidence = deriveProvenanceConfidence(state.analysis);\n        const premise = await this.database.createPremise({\n          userId: state.userId,\n          assertion: {\n            text: state.assertionText!,\n            tier: state.tier,\n          },\n          provenance: {\n            source: state.provenanceSource ?? 'explicit',\n            sourceId: state.provenanceSourceId,\n            confidence: state.provenanceConfidence ?? derivedConfidence,\n            timestamp: new Date().toISOString(),\n          },\n          analysis: state.analysis ?? undefined,\n          validity: {\n            validFrom: state.validFrom,\n            validUntil: state.validUntil,\n            volatile: state.volatile,\n          },\n          embedding: state.embedding,\n        });\n        return { premise };\n      });\n    };\n\n    const indexNode = async (state: typeof PremiseGraphState.State) => {\n      return timed(\"PremiseGraph.index\", async () => {\n        if (!state.premise) return {};\n\n        indexLog.verbose(`Scoring premise against user networks`);\n\n        const assignmentMemberships = await this.database.getAssignmentNetworkMembershipsForUser(state.userId);\n        const requestScope = state.scopeType && state.scopeId\n          ? { scopeType: state.scopeType, scopeId: state.scopeId }\n          : scopeFromNetworkId(state.networkScopeId);\n        const indexIds = resolveAssignmentNetworkScope({\n          memberships: assignmentMemberships,\n          ...requestScope,\n        });\n        const scope = requestScope.scopeType ? \"network\" : \"global\";\n        const assignments: Array<{ networkId: string; relevancyScore: number }> = [];\n        const agentTimings: DebugMetaAgent[] = [];\n\n        for (const networkId of indexIds) {\n          try {\n            const assignmentContext = await this.database.getNetworkAssignmentContext(networkId, state.userId);\n            if (!assignmentContext) continue;\n            const indexPrompt = assignmentContext.indexPrompt;\n            const memberPrompt = assignmentContext.memberPrompt;\n            const hasPrompts = !!indexPrompt?.trim() || !!memberPrompt?.trim();\n            let rawScores: { indexScore?: number; memberScore?: number } | undefined;\n            let reason: string | undefined;\n\n            if (hasPrompts) {\n              const start = Date.now();\n              const result = await indexer.invoke({\n                premiseText: state.assertionText!,\n                indexPrompt: indexPrompt ?? \"\",\n                memberPrompt: memberPrompt ?? undefined,\n              });\n              const timing: DebugMetaAgent = {\n                name: \"premise-indexer\",\n                durationMs: Date.now() - start,\n              };\n              rawScores = { indexScore: result.indexScore, memberScore: result.memberScore };\n              reason = result.reasoning;\n              agentTimings.push(timing);\n            }\n\n            const decision = buildNetworkAssignmentDecision({\n              resourceType: \"premise\",\n              mode: \"automatic\",\n              scope,\n              indexPrompt,\n              memberPrompt,\n              rawScores,\n              evaluator: \"premise-indexer\",\n              source: \"premise-graph\",\n              reason,\n              createdAt: new Date().toISOString(),\n            });\n\n            if (decision.assigned) {\n              await this.database.assignPremiseToNetwork(\n                state.premise.id,\n                networkId,\n                decision.finalScore,\n                decision.metadata,\n              );\n              assignments.push({ networkId, relevancyScore: decision.finalScore });\n            }\n          } catch (err) {\n            indexLog.verbose('Failed to score network, skipping', { networkId, error: err });\n          }\n        }\n\n        indexLog.verbose('Assigned to networks', { count: assignments.length });\n\n        return { networkAssignments: assignments, agentTimings };\n      });\n    };\n\n    const routeByMode = (state: typeof PremiseGraphState.State) => {\n      if (state.error) return \"end\";\n      if (state.operationMode === 'query') return \"query\";\n      return \"analyze\";\n    };\n\n    const graph = new StateGraph(PremiseGraphState)\n      .addNode(\"query\", queryNode)\n      .addNode(\"analyze\", analyzeNode)\n      .addNode(\"embed\", embedNode)\n      .addNode(\"dedupe\", dedupeNode)\n      .addNode(\"persist\", persistNode)\n      .addNode(\"index\", indexNode)\n      .addConditionalEdges(START, routeByMode, {\n        query: \"query\",\n        analyze: \"analyze\",\n        end: END,\n      })\n      .addEdge(\"query\", END)\n      .addEdge(\"analyze\", \"embed\")\n      .addEdge(\"embed\", \"dedupe\")\n      // A near-duplicate short-circuits straight to END (no persist, no index).\n      .addConditionalEdges(\"dedupe\", (state: typeof PremiseGraphState.State) => (state.duplicateOf ? \"end\" : \"persist\"), {\n        persist: \"persist\",\n        end: END,\n      })\n      .addEdge(\"persist\", \"index\")\n      .addEdge(\"index\", END);\n\n    return graph.compile();\n  }\n}\n"]}

package/dist/premise/premise.indexer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.indexer.d.ts","sourceRoot":"/","sources":["premise/premise.indexer.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAiCxB,QAAA,MAAM,cAAc;;;;;;;;;;;;EAIlB,CAAC;AAEH,MAAM,MAAM,oBAAoB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,CAAC;AAElE;;GAEG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAA2C;;IAQxD;;;;;OAKG;IAEU,MAAM,CAAC,KAAK,EAAE;QACzB,WAAW,EAAE,MAAM,CAAC;QACpB,WAAW,EAAE,MAAM,CAAC;QACpB,YAAY,CAAC,EAAE,MAAM,CAAC;QACtB,cAAc,CAAC,EAAE,MAAM,CAAC;KACzB,GAAG,OAAO,CAAC,oBAAoB,CAAC;CAuBlC"}

package/dist/premise/premise.indexer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.indexer.js","sourceRoot":"/","sources":["premise/premise.indexer.ts"],"names":[],"mappings":";;;;;;;;;AAAA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAC5E,OAAO,EAAE,KAAK,EAAE,MAAM,wCAAwC,CAAC;AAC/D,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AAExE,MAAM,MAAM,GAAG,cAAc,CAAC,gBAAgB,CAAC,CAAC;AAChD,MAAM,SAAS,GAAG,cAAc,CAAC,uBAAuB,CAAC,CAAC;AAE1D,MAAM,YAAY,GAAG;;;;;;;;;;;;;;;;;;;;;;CAsBpB,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC;IAC9B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,qCAAqC,CAAC;IACpF,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,6CAA6C,CAAC;IAC7F,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gCAAgC,CAAC;CACjE,CAAC,CAAC;AAIH;;GAEG;AACH,MAAM,OAAO,cAAc;IAGzB;QACE,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAAC,gBAAgB,EAAE,cAAc,EAAE;YACnE,IAAI,EAAE,iBAAiB;SACxB,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IAEU,AAAN,KAAK,CAAC,MAAM,CAAC,KAKnB;QACC,SAAS,CAAC,OAAO,CAAC,+BAA+B,CAAC,CAAC;QAEnD,MAAM,MAAM,GAAG;YACb,WAAW;YACX,KAAK,CAAC,WAAW;YACjB,EAAE;YACF,kBAAkB;YAClB,KAAK,CAAC,WAAW,IAAI,8BAA8B;YACnD,EAAE;YACF,iBAAiB;YACjB,KAAK,CAAC,YAAY,IAAI,6BAA6B;YACnD,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,mBAAmB,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SACjF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,MAAM,QAAQ,GAAG;YACf,IAAI,aAAa,CAAC,YAAY,CAAC;YAC/B,IAAI,YAAY,CAAC,MAAM,CAAC;SACzB,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACjE,OAAO,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;CACF;AA5Bc;IADZ,KAAK,EAAE;;;;4CA4BP","sourcesContent":["import { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\nimport { protocolLogger } from \"../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../shared/observability/performance.js\";\nimport { createStructuredModel } from \"../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../shared/agent/model-signal.js\";\n\nconst logger = protocolLogger(\"PremiseIndexer\");\nconst invokeLog = protocolLogger(\"PremiseIndexer:invoke\");\n\nconst systemPrompt = `\nYou are a Premise Evaluator for a social networking protocol.\n\nTASK:\nDetermine if a User Premise (a self-descriptive proposition about who someone is) is relevant to a specific Index (community).\n\nINPUTS:\n1. Premise: A self-description the user asserts about themselves.\n2. Network Prompt: The purpose/scope of the target community (Index).\n3. Member Prompt: The specific sharing preferences of the user in that community (optional).\n\nSCORING RUBRIC:\n- 0.9-1.0: Highly relevant. The premise directly relates to the community's purpose.\n- 0.7-0.8: Good relevance. The premise is clearly adjacent to the community's focus.\n- 0.5-0.6: Moderate. Borderline relevance.\n- 0.3-0.4: Low relevance. Weak connection.\n- 0.0-0.2: Not relevant. The premise has no connection to this community.\n\nOUTPUT RULES:\n- Provide indexScore based on how well the Premise fits the Network Prompt.\n- Provide memberScore based on how well the Premise fits the Member Prompt (if provided). If Member Prompt is missing/empty, return 0.0.\n- Provide concise reasoning.\n`;\n\nconst responseFormat = z.object({\n  indexScore: z.number().min(0).max(1).describe(\"Score for index relevance (0.0-1.0)\"),\n  memberScore: z.number().min(0).max(1).describe(\"Score for member preference match (0.0-1.0)\"),\n  reasoning: z.string().describe(\"Brief reasoning for the scores\"),\n});\n\nexport type PremiseIndexerOutput = z.infer<typeof responseFormat>;\n\n/**\n * Scores a premise's relevancy to a network based on the index and member prompts.\n */\nexport class PremiseIndexer {\n  private model: ReturnType<typeof createStructuredModel>;\n\n  constructor() {\n    this.model = createStructuredModel(\"premiseIndexer\", responseFormat, {\n      name: \"premise_indexer\"\n    });\n  }\n\n  /**\n   * Scores the relevancy of a premise to a network index and member preferences.\n   *\n   * @param input - The premise text, network prompt, member prompt, and optional network context.\n   * @returns Structured output with indexScore, memberScore, and reasoning.\n   */\n  @Timed()\n  public async invoke(input: {\n    premiseText: string;\n    indexPrompt: string;\n    memberPrompt?: string;\n    networkContext?: string;\n  }): Promise<PremiseIndexerOutput> {\n    invokeLog.verbose(`Scoring premise against index`);\n\n    const prompt = [\n      \"# Premise\",\n      input.premiseText,\n      \"\",\n      \"# Network Prompt\",\n      input.indexPrompt || \"(No network prompt provided)\",\n      \"\",\n      \"# Member Prompt\",\n      input.memberPrompt || \"(No member prompt provided)\",\n      ...(input.networkContext ? [\"\", \"# Network Context\", input.networkContext] : []),\n    ].join(\"\\n\");\n\n    const messages = [\n      new SystemMessage(systemPrompt),\n      new HumanMessage(prompt),\n    ];\n\n    const result = await invokeWithAbortSignal(this.model, messages);\n    return responseFormat.parse(result);\n  }\n}\n"]}

package/dist/premise/premise.state.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.state.d.ts","sourceRoot":"/","sources":["premise/premise.state.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,eAAe,EAAqB,aAAa,EAAE,MAAM,4CAA4C,CAAC;AACpH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,+BAA+B,CAAC;AAEnE,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;IAgD5B,wDAAwD;;IAMxD,6FAA6F;;IAM7F,0FAA0F;;;;;;;mBA6BrD,MAAM;uBAAiB,MAAM;oBAAc,MAAM;;mBAAjD,MAAM;uBAAiB,MAAM;oBAAc,MAAM;;mBAAjD,MAAM;uBAAiB,MAAM;oBAAc,MAAM;;;mBAKpC,MAAM;wBAAkB,MAAM;;mBAA9B,MAAM;wBAAkB,MAAM;;mBAA9B,MAAM;wBAAkB,MAAM;;;;kBAWpE,aAAa,EAAE;eAClB,MAAM;kBACH,MAAM;;kBAFN,aAAa,EAAE;eAClB,MAAM;kBACH,MAAM;;kBAFN,aAAa,EAAE;eAClB,MAAM;kBACH,MAAM;;;EAUlB,CAAC"}

package/dist/premise/premise.state.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.state.js","sourceRoot":"/","sources":["premise/premise.state.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAKlD,MAAM,CAAC,MAAM,iBAAiB,GAAG,UAAU,CAAC,IAAI,CAAC;IAC/C,MAAM,EAAE,CAAA,UAAkB,CAAA;IAE1B,aAAa,EAAE,UAAU,CAAqB;QAC5C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,IAAI,EAAE,UAAU,CAA6B;QAC3C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,WAAW;KAC3B,CAAC;IAEF,SAAS,EAAE,UAAU,CAAqB;QACxC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,UAAU,EAAE,UAAU,CAAqB;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,QAAQ,EAAE,UAAU,CAAU;QAC5B,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK;KACrB,CAAC;IAEF,gBAAgB,EAAE,UAAU,CAA0C;QACpE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,kBAAkB,EAAE,UAAU,CAAqB;QACjD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,oBAAoB,EAAE,UAAU,CAAqB;QACnD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,aAAa,EAAE,UAAU,CAAgC;QACvD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,QAAQ;KACxB,CAAC;IAEF,wDAAwD;IACxD,SAAS,EAAE,UAAU,CAA4B;QAC/C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,6FAA6F;IAC7F,OAAO,EAAE,UAAU,CAAqB;QACtC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,0FAA0F;IAC1F,cAAc,EAAE,UAAU,CAAqB;QAC7C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,eAAe,EAAE,UAAU,CAAqB;QAC9C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,QAAQ,EAAE,UAAU,CAA8B;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,SAAS,EAAE,UAAU,CAAuB;QAC1C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,OAAO,EAAE,UAAU,CAA4B;QAC7C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,iFAAiF;IACjF,6EAA6E;IAC7E,gEAAgE;IAChE,WAAW,EAAE,UAAU,CAA+E;QACpG,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,kBAAkB,EAAE,UAAU,CAAuD;QACnF,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,KAAK,EAAE,UAAU,CAAqB;QACpC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,UAAU,EAAE,UAAU,CAIP;QACb,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,YAAY,EAAE,UAAU,CAAmB;QACzC,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;QACvC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;CACH,CAAC,CAAC","sourcesContent":["import { Annotation } from \"@langchain/langgraph\";\nimport type { PremiseAnalysis, PremiseProvenance, PremiseRecord } from \"../shared/interfaces/database.interface.js\";\nimport type { DebugMetaAgent } from '../chat/chat-streaming.types.js';\nimport type { ToolScopeType } from '../shared/agent/tool.scope.js';\n\nexport const PremiseGraphState = Annotation.Root({\n  userId: Annotation<string>,\n\n  assertionText: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  tier: Annotation<'assertive' | 'contextual'>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'assertive',\n  }),\n\n  validFrom: Annotation<string | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  validUntil: Annotation<string | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  volatile: Annotation<boolean>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => false,\n  }),\n\n  provenanceSource: Annotation<PremiseProvenance['source'] | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  provenanceSourceId: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  provenanceConfidence: Annotation<number | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  operationMode: Annotation<'create' | 'update' | 'query'>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'create',\n  }),\n\n  /** Focused request scope type for assignment writes. */\n  scopeType: Annotation<ToolScopeType | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Focused request scope id. When scopeType is `network`, this is the focused network id. */\n  scopeId: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** @deprecated Use scopeType/scopeId. Retained temporarily for older enqueue handlers. */\n  networkScopeId: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  targetPremiseId: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  analysis: Annotation<PremiseAnalysis | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  embedding: Annotation<number[] | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  premise: Annotation<PremiseRecord | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  // Set by the dedupe node when a near-duplicate ACTIVE premise already exists for\n  // the user (create mode only). When present, persist/index are skipped — the\n  // candidate is treated as already represented by `duplicateOf`.\n  duplicateOf: Annotation<{ premiseId: string; assertionText: string; similarity: number } | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  networkAssignments: Annotation<Array<{ networkId: string; relevancyScore: number }>>({\n    reducer: (curr, next) => next,\n    default: () => [],\n  }),\n\n  error: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  readResult: Annotation<{\n    premises: PremiseRecord[];\n    count: number;\n    message?: string;\n  } | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  agentTimings: Annotation<DebugMetaAgent[]>({\n    reducer: (acc, val) => [...acc, ...val],\n    default: () => [],\n  }),\n});\n"]}

package/dist/premise/premise.tools.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.tools.d.ts","sourceRoot":"/","sources":["premise/premise.tools.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,iCAAiC,CAAC;AAY5E,wBAAgB,kBAAkB,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,SAuRxE"}

package/dist/premise/premise.tools.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"premise.tools.js","sourceRoot":"/","sources":["premise/premise.tools.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAC7E,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAE5E,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AAExE,MAAM,MAAM,GAAG,cAAc,CAAC,mBAAmB,CAAC,CAAC;AACnD,MAAM,gBAAgB,GAAG,cAAc,CAAC,iCAAiC,CAAC,CAAC;AAC3E,MAAM,eAAe,GAAG,cAAc,CAAC,gCAAgC,CAAC,CAAC;AACzE,MAAM,gBAAgB,GAAG,cAAc,CAAC,iCAAiC,CAAC,CAAC;AAC3E,MAAM,iBAAiB,GAAG,cAAc,CAAC,kCAAkC,CAAC,CAAC;AAE7E,MAAM,UAAU,kBAAkB,CAAC,UAAsB,EAAE,IAAc;IACvE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;IAEzC,gFAAgF;IAChF,eAAe;IACf,gFAAgF;IAEhF,MAAM,aAAa,GAAG,UAAU,CAAC;QAC/B,IAAI,EAAE,gBAAgB;QACtB,WAAW,EACT,wFAAwF;YACxF,wFAAwF;YACxF,oCAAoC;YACpC,cAAc;YACd,wGAAwG;YACxG,4DAA4D;YAC5D,yFAAyF;YACzF,+FAA+F;YAC/F,6DAA6D;YAC7D,8FAA8F;YAC9F,6FAA6F;YAC7F,8FAA8F;QAChG,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,sHAAsH,CAAC;YAC/J,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,wHAAwH,CAAC;YACjM,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oFAAoF,CAAC;YAC1I,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,yIAAyI,CAAC;YAChM,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oIAAoI,CAAC;SAChL,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,OAAO,KAAK,CAAC,8BAA8B,CAAC,CAAC;YAC/C,CAAC;YAED,MAAM,iBAAiB,GAAG,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACzF,MAAM,aAAa,GAAG,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,OAAO;gBACxD,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE;gBAC5D,CAAC,CAAC,EAAE,CAAC;YAEP,gBAAgB,CAAC,OAAO,CAAC,2BAA2B,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAExH,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,YAAY,EAAE;gBACvD,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,aAAa,EAAE,KAAK,CAAC,IAAI;gBACzB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;gBAC5B,QAAQ,EAAE,iBAAiB;gBAC3B,aAAa,EAAE,QAAQ;gBACvB,GAAG,aAAa;aACjB,CAAC,CAAC;YAEH,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACjB,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,OAAO,KAAK,CAAC,gDAAgD,CAAC,CAAC;YACjE,CAAC;YAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;YAC/B,MAAM,eAAe,GAAG,MAAM,CAAC,kBAAkB,EAAE,MAAM,IAAI,CAAC,CAAC;YAC/D,MAAM,eAAe,GAAG,OAAO,CAAC,QAAQ;gBACtC,CAAC,CAAC,kBAAkB,OAAO,CAAC,QAAQ,CAAC,aAAa,cAAc,OAAO,CAAC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE;gBACvH,CAAC,CAAC,aAAa,CAAC;YAElB,MAAM,YAAY,GAAG,OAAO,CAAC;gBAC3B,EAAE,EAAE,OAAO,CAAC,EAAE;gBACd,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI;gBACjC,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI;gBAC5B,eAAe;gBACf,eAAe;gBACf,OAAO,EAAE,mCAAmC,eAAe,SAAS,eAAe,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG;aACzG,CAAC,CAAC;YACH,OAAO,YAAY,CAAC;QACtB,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,YAAY,GAAG,UAAU,CAAC;QAC9B,IAAI,EAAE,eAAe;QACrB,WAAW,EACT,+FAA+F;YAC/F,6FAA6F;YAC7F,oBAAoB;YACpB,8DAA8D;YAC9D,gGAAgG;YAChG,iIAAiI;YACjI,iFAAiF;YACjF,sGAAsG;YACtG,sFAAsF;QACxF,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,+EAA+E,CAAC;YACvH,gBAAgB,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,qHAAqH,CAAC;SAC7K,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,MAAM,CAAC;YAE5D,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBAClE,OAAO,KAAK,CAAC,wBAAwB,CAAC,CAAC;YACzC,CAAC;YAED,eAAe,CAAC,OAAO,CAAC,4BAA4B,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;YAEhF,mEAAmE;YACnE,sEAAsE;YACtE,8CAA8C;YAC9C,MAAM,YAAY,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAiB,CAAC;YAC5E,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;YAE/E,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAgB,EAAE,EAAE,CAAC,CAAC;gBACjD,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,IAAI;gBACtB,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,IAAI;gBACtB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,eAAe,EAAE,CAAC,CAAC,QAAQ;oBACzB,CAAC,CAAC,kBAAkB,CAAC,CAAC,QAAQ,CAAC,aAAa,IAAI,KAAK,cAAc,CAAC,CAAC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE;oBACpH,CAAC,CAAC,aAAa;gBACjB,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,SAAS,IAAI,IAAI;gBACvC,UAAU,EAAE,CAAC,CAAC,QAAQ,CAAC,UAAU,IAAI,IAAI;gBACzC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,IAAI,KAAK;aACvC,CAAC,CAAC,CAAC;YAEJ,OAAO,OAAO,CAAC;gBACb,QAAQ,EAAE,MAAM;gBAChB,KAAK,EAAE,MAAM,CAAC,MAAM;aACrB,CAAC,CAAC;QACL,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,UAAU,CAAC;QAC/B,IAAI,EAAE,gBAAgB;QACtB,WAAW,EACT,yFAAyF;YACzF,4DAA4D;YAC5D,2FAA2F;YAC3F,6CAA6C;YAC7C,4FAA4F;YAC5F,+DAA+D;YAC/D,0EAA0E;QAC5E,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,wDAAwD,CAAC;YACxF,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,0EAA0E,CAAC;YAC9H,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,oCAAoC,CAAC;YAC1F,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;YAC5F,QAAQ,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,2BAA2B,CAAC;SACvE,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBACtC,OAAO,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAC5C,CAAC;YAED,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YAC5D,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,OAAO,KAAK,CAAC,oBAAoB,CAAC,CAAC;YACrC,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;gBACvC,OAAO,KAAK,CAAC,wCAAwC,CAAC,CAAC;YACzD,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBACpC,OAAO,KAAK,CAAC,sEAAsE,CAAC,CAAC;YACvF,CAAC;YAED,gBAAgB,CAAC,OAAO,CAAC,2BAA2B,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YAE9G,iEAAiE;YACjE,sEAAsE;YACtE,sDAAsD;YACtD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC7B,MAAM,iBAAiB,GACrB,KAAK,CAAC,SAAS,KAAK,SAAS;oBAC7B,KAAK,CAAC,UAAU,KAAK,SAAS;oBAC9B,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC;gBAE/B,IAAI,CAAC,iBAAiB,EAAE,CAAC;oBACvB,OAAO,KAAK,CAAC,wEAAwE,CAAC,CAAC;gBACzF,CAAC;gBAED,MAAM,cAAc,GAAoB;oBACtC,GAAG,QAAQ,CAAC,QAAQ;oBACpB,GAAG,CAAC,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC;oBACpE,GAAG,CAAC,KAAK,CAAC,UAAU,KAAK,SAAS,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;oBACvE,GAAG,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC;iBAClE,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC;gBAE5F,MAAM,cAAc,GAAG,OAAO,CAAC;oBAC7B,EAAE,EAAE,OAAO,CAAC,EAAE;oBACd,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI;oBACjC,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI;oBAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;oBACtB,OAAO,EAAE,+DAA+D;iBACzE,CAAC,CAAC;gBACH,OAAO,cAAc,CAAC;YACxB,CAAC;YAED,kEAAkE;YAClE,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,OAAO,KAAK,CAAC,8BAA8B,CAAC,CAAC;YAC/C,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,YAAY,EAAE;gBACvD,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,aAAa,EAAE,KAAK,CAAC,IAAI;gBACzB,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,IAAI;gBAC7B,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,QAAQ,CAAC,QAAQ,CAAC,SAAS,IAAI,SAAS;gBACtE,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,QAAQ,CAAC,QAAQ,CAAC,UAAU,IAAI,SAAS;gBACzE,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,QAAQ,CAAC,QAAQ,CAAC,QAAQ;gBACtD,aAAa,EAAE,QAAQ;gBACvB,eAAe,EAAE,KAAK,CAAC,SAAS;gBAChC,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC5G,CAAC,CAAC;YAEH,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACjB,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,OAAO,KAAK,CAAC,sDAAsD,CAAC,CAAC;YACvE,CAAC;YAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;YAE/B,MAAM,YAAY,GAAG,OAAO,CAAC;gBAC3B,EAAE,EAAE,OAAO,CAAC,EAAE;gBACd,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI;gBACjC,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI;gBAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,OAAO,EAAE,+BAA+B;aACzC,CAAC,CAAC;YACH,OAAO,YAAY,CAAC;QACtB,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,cAAc,GAAG,UAAU,CAAC;QAChC,IAAI,EAAE,iBAAiB;QACvB,WAAW,EACT,sFAAsF;YACtF,yEAAyE;YACzE,kGAAkG;YAClG,qDAAqD;YACrD,sFAAsF;YACtF,wGAAwG;QAC1G,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,yDAAyD,CAAC;SAC1F,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBACtC,OAAO,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAC5C,CAAC;YAED,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YAC5D,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,OAAO,KAAK,CAAC,oBAAoB,CAAC,CAAC;YACrC,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;gBACvC,OAAO,KAAK,CAAC,yCAAyC,CAAC,CAAC;YAC1D,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBACpC,OAAO,KAAK,CAAC,+BAA+B,CAAC,CAAC;YAChD,CAAC;YAED,iBAAiB,CAAC,OAAO,CAAC,6BAA6B,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YAEjH,MAAM,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,SAAS,EAAE;gBAC5C,MAAM,EAAE,WAAW;gBACnB,WAAW,EAAE,IAAI,IAAI,EAAE;aACxB,CAAC,CAAC;YAEH,MAAM,aAAa,GAAG,OAAO,CAAC;gBAC5B,EAAE,EAAE,KAAK,CAAC,SAAS;gBACnB,OAAO,EAAE,iCAAiC;aAC3C,CAAC,CAAC;YACH,OAAO,aAAa,CAAC;QACvB,CAAC;KACF,CAAC,CAAC;IAEH,OAAO,CAAC,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;AACtE,CAAC","sourcesContent":["import { z } from \"zod\";\n\nimport type { DefineTool, ToolDeps } from \"../shared/agent/tool.helpers.js\";\nimport { success, error, UUID_REGEX } from \"../shared/agent/tool.helpers.js\";\nimport { protocolLogger } from \"../shared/observability/protocol.logger.js\";\nimport type { PremiseRecord, PremiseValidity } from \"../shared/interfaces/database.interface.js\";\nimport { invokeWithAbortSignal } from \"../shared/agent/model-signal.js\";\n\nconst logger = protocolLogger(\"ChatTools:Premise\");\nconst createPremiseLog = protocolLogger(\"ChatTools:Premise:createPremise\");\nconst readPremisesLog = protocolLogger(\"ChatTools:Premise:readPremises\");\nconst updatePremiseLog = protocolLogger(\"ChatTools:Premise:updatePremise\");\nconst retractPremiseLog = protocolLogger(\"ChatTools:Premise:retractPremise\");\n\nexport function createPremiseTools(defineTool: DefineTool, deps: ToolDeps) {\n  const database = deps.database;\n  const premiseGraph = deps.graphs.premise;\n\n  // ─────────────────────────────────────────────────────────────────────────────\n  // PREMISE CRUD\n  // ─────────────────────────────────────────────────────────────────────────────\n\n  const createPremise = defineTool({\n    name: \"create_premise\",\n    description:\n      \"Creates a premise — a self-descriptive proposition the user asserts about themselves. \" +\n      \"Premises are the foundational facts that shape how the system understands who you are \" +\n      \"and what contexts you inhabit.\\n\\n\" +\n      \"**Tiers:**\\n\" +\n      \"- `assertive` (default): stable identity facts (e.g. 'I am a software engineer', 'I live in Berlin'). \" +\n      \"Use for things that are durably true and not time-bound.\\n\" +\n      \"- `contextual`: temporal or situational facts (e.g. 'I am attending DevCon this week', \" +\n      \"'I am fundraising for my Series A right now'). Use when the user shares something time-bound \" +\n      \"or context-specific. These default to `volatile: true`.\\n\\n\" +\n      \"**When to use:** Call this whenever the user shares a fact about themselves in first person \" +\n      \"('I am', 'I work at', 'I just joined', 'I am currently'). Do not infer premises from vague \" +\n      \"statements — only create them when the user is clearly asserting something about themselves.\",\n    querySchema: z.object({\n      text: z.string().trim().min(1).describe(\"The premise text — a self-descriptive proposition in first person, e.g. 'I am a machine learning researcher at MIT'.\"),\n      tier: z.enum([\"assertive\", \"contextual\"]).default(\"assertive\").describe(\"Tier of the premise. 'assertive' = stable identity fact. 'contextual' = temporal/situational. Defaults to 'assertive'.\"),\n      validFrom: z.string().datetime().optional().describe(\"ISO 8601 date-time string for when this premise becomes valid. Omit for immediate.\"),\n      validUntil: z.string().datetime().optional().describe(\"ISO 8601 date-time string for when this premise expires. Recommended for contextual premises with a known end date; omit if open-ended.\"),\n      volatile: z.boolean().optional().describe(\"Whether this premise should be automatically retracted when it expires. Defaults to true for contextual tier, false for assertive.\"),\n    }),\n    handler: async ({ context, query }) => {\n      if (!premiseGraph) {\n        return error(\"Premise graph not available.\");\n      }\n\n      const effectiveVolatile = query.volatile ?? (query.tier === \"contextual\" ? true : false);\n      const scopeEnvelope = context.scopeType && context.scopeId\n        ? { scopeType: context.scopeType, scopeId: context.scopeId }\n        : {};\n\n      createPremiseLog.verbose('Creating premise for user', { userId: context.userId, preview: query.text.substring(0, 60) });\n\n      const result = await invokeWithAbortSignal(premiseGraph, {\n        userId: context.userId,\n        assertionText: query.text,\n        tier: query.tier,\n        validFrom: query.validFrom,\n        validUntil: query.validUntil,\n        volatile: effectiveVolatile,\n        operationMode: \"create\",\n        ...scopeEnvelope,\n      });\n\n      if (result.error) {\n        return error(result.error);\n      }\n\n      if (!result.premise) {\n        return error(\"Premise creation failed — no premise returned.\");\n      }\n\n      const premise = result.premise;\n      const indexesAssigned = result.networkAssignments?.length ?? 0;\n      const analysisSummary = premise.analysis\n        ? `speechActType: ${premise.analysis.speechActType}, clarity: ${premise.analysis.felicityClarity?.toFixed(2) ?? \"n/a\"}`\n        : \"no analysis\";\n\n      const createResult = success({\n        id: premise.id,\n        assertion: premise.assertion.text,\n        tier: premise.assertion.tier,\n        analysisSummary,\n        indexesAssigned,\n        message: `Premise created and assigned to ${indexesAssigned} index${indexesAssigned === 1 ? \"\" : \"es\"}.`,\n      });\n      return createResult;\n    },\n  });\n\n  const readPremises = defineTool({\n    name: \"read_premises\",\n    description:\n      \"Retrieves premises — the self-descriptive propositions a user has asserted about themselves. \" +\n      \"Premises represent stable identity facts (assertive) and temporal context (contextual).\\n\\n\" +\n      \"**Usage modes:**\\n\" +\n      \"- No parameters: returns the caller's own active premises.\\n\" +\n      \"- With `userId`: returns that user's premises (use when reviewing another member's context).\\n\" +\n      \"- With `includeRetracted: true`: returns all premises regardless of status (active, retracted, expired) for history review.\\n\\n\" +\n      \"**When to use:** Call before creating a premise to check if it already exists. \" +\n      \"Call when the user asks what they have shared about themselves, or to review their current context. \" +\n      \"Each premise includes: id, text, tier, status, analysis summary, and validity range.\",\n    querySchema: z.object({\n      userId: z.string().optional().describe(\"User ID to fetch premises for. Omit to fetch the current user's own premises.\"),\n      includeRetracted: z.boolean().default(false).describe(\"When true, returns all premises regardless of status (active, retracted, expired). Defaults to false (active only).\"),\n    }),\n    handler: async ({ context, query }) => {\n      const targetUserId = query.userId?.trim() || context.userId;\n\n      if (query.userId?.trim() && !UUID_REGEX.test(query.userId.trim())) {\n        return error(\"Invalid userId format.\");\n      }\n\n      readPremisesLog.verbose('Fetching premises for user', { userId: targetUserId });\n\n      // Query DB directly (bypassing graph) to support status filtering.\n      // The graph's query node hardcodes ACTIVE status, so includeRetracted\n      // would be dead code if we routed through it.\n      const statusFilter = query.includeRetracted ? undefined : \"ACTIVE\" as const;\n      const premises = await database.getPremisesForUser(targetUserId, statusFilter);\n\n      const mapped = premises.map((p: PremiseRecord) => ({\n        id: p.id,\n        text: p.assertion.text,\n        tier: p.assertion.tier,\n        status: p.status,\n        analysisSummary: p.analysis\n          ? `speechActType: ${p.analysis.speechActType ?? \"n/a\"}, clarity: ${p.analysis.felicityClarity?.toFixed(2) ?? \"n/a\"}`\n          : \"no analysis\",\n        validFrom: p.validity.validFrom ?? null,\n        validUntil: p.validity.validUntil ?? null,\n        volatile: p.validity.volatile ?? false,\n      }));\n\n      return success({\n        premises: mapped,\n        count: mapped.length,\n      });\n    },\n  });\n\n  const updatePremise = defineTool({\n    name: \"update_premise\",\n    description:\n      \"Modifies an existing premise. Updating the text triggers re-analysis and re-embedding, \" +\n      \"which may change how it influences opportunity discovery. \" +\n      \"Use when the user corrects or refines something they previously stated about themselves, \" +\n      \"or when validity dates need adjustment.\\n\\n\" +\n      \"**When to use:** When the user says 'actually, I meant...', 'update my premise about...', \" +\n      \"or provides a corrected version of a previously stated fact. \" +\n      \"Requires the premise ID — call read_premises first if you don't have it.\",\n    querySchema: z.object({\n      premiseId: z.string().describe(\"UUID of the premise to update. Get from read_premises.\"),\n      text: z.string().trim().min(1).optional().describe(\"New assertion text. Triggers re-analysis and re-embedding when provided.\"),\n      validFrom: z.string().datetime().optional().describe(\"New ISO 8601 valid-from date-time.\"),\n      validUntil: z.string().datetime().optional().describe(\"New ISO 8601 valid-until date-time.\"),\n      volatile: z.boolean().optional().describe(\"Update the volatile flag.\"),\n    }),\n    handler: async ({ context, query }) => {\n      if (!UUID_REGEX.test(query.premiseId)) {\n        return error(\"Invalid premiseId format.\");\n      }\n\n      const existing = await database.getPremise(query.premiseId);\n      if (!existing) {\n        return error(\"Premise not found.\");\n      }\n      if (existing.userId !== context.userId) {\n        return error(\"You can only update your own premises.\");\n      }\n      if (existing.status === \"RETRACTED\") {\n        return error(\"Cannot update a retracted premise. Retracted premises are immutable.\");\n      }\n\n      updatePremiseLog.verbose('Updating premise for user', { premiseId: query.premiseId, userId: context.userId });\n\n      // When text is unchanged, skip the graph (avoids unnecessary LLM\n      // re-analysis and non-deterministic re-embedding). Only route through\n      // the graph when the assertion text actually changes.\n      if (query.text === undefined) {\n        const hasValidityChange =\n          query.validFrom !== undefined ||\n          query.validUntil !== undefined ||\n          query.volatile !== undefined;\n\n        if (!hasValidityChange) {\n          return error(\"No fields to update. Provide text, validFrom, validUntil, or volatile.\");\n        }\n\n        const mergedValidity: PremiseValidity = {\n          ...existing.validity,\n          ...(query.validFrom !== undefined && { validFrom: query.validFrom }),\n          ...(query.validUntil !== undefined && { validUntil: query.validUntil }),\n          ...(query.volatile !== undefined && { volatile: query.volatile }),\n        };\n\n        const updated = await database.updatePremise(query.premiseId, { validity: mergedValidity });\n\n        const metadataResult = success({\n          id: updated.id,\n          assertion: updated.assertion.text,\n          tier: updated.assertion.tier,\n          status: updated.status,\n          message: \"Premise updated successfully (metadata only, no re-analysis).\",\n        });\n        return metadataResult;\n      }\n\n      // Text change requires the graph for re-analysis and re-embedding\n      if (!premiseGraph) {\n        return error(\"Premise graph not available.\");\n      }\n\n      const result = await invokeWithAbortSignal(premiseGraph, {\n        userId: context.userId,\n        assertionText: query.text,\n        tier: existing.assertion.tier,\n        validFrom: query.validFrom ?? existing.validity.validFrom ?? undefined,\n        validUntil: query.validUntil ?? existing.validity.validUntil ?? undefined,\n        volatile: query.volatile ?? existing.validity.volatile,\n        operationMode: \"update\",\n        targetPremiseId: query.premiseId,\n        ...(context.scopeType && context.scopeId ? { scopeType: context.scopeType, scopeId: context.scopeId } : {}),\n      });\n\n      if (result.error) {\n        return error(result.error);\n      }\n\n      if (!result.premise) {\n        return error(\"Premise update failed — no updated premise returned.\");\n      }\n\n      const updated = result.premise;\n\n      const updateResult = success({\n        id: updated.id,\n        assertion: updated.assertion.text,\n        tier: updated.assertion.tier,\n        status: updated.status,\n        message: \"Premise updated successfully.\",\n      });\n      return updateResult;\n    },\n  });\n\n  const retractPremise = defineTool({\n    name: \"retract_premise\",\n    description:\n      \"Retracts a premise — a soft delete that preserves the history of what was asserted. \" +\n      \"Retracted premises are no longer active but remain in the audit trail. \" +\n      \"Use when the user explicitly wants to remove something they previously stated about themselves, \" +\n      \"or when a contextual premise is no longer true.\\n\\n\" +\n      \"**When to use:** When the user says 'remove my premise about...', 'I no longer...', \" +\n      \"or 'that's not true anymore'. Do not retract premises proactively — only on explicit user instruction.\",\n    querySchema: z.object({\n      premiseId: z.string().describe(\"UUID of the premise to retract. Get from read_premises.\"),\n    }),\n    handler: async ({ context, query }) => {\n      if (!UUID_REGEX.test(query.premiseId)) {\n        return error(\"Invalid premiseId format.\");\n      }\n\n      const existing = await database.getPremise(query.premiseId);\n      if (!existing) {\n        return error(\"Premise not found.\");\n      }\n      if (existing.userId !== context.userId) {\n        return error(\"You can only retract your own premises.\");\n      }\n      if (existing.status === \"RETRACTED\") {\n        return error(\"Premise is already retracted.\");\n      }\n\n      retractPremiseLog.verbose('Retracting premise for user', { premiseId: query.premiseId, userId: context.userId });\n\n      await database.updatePremise(query.premiseId, {\n        status: \"RETRACTED\",\n        retractedAt: new Date(),\n      });\n\n      const retractResult = success({\n        id: query.premiseId,\n        message: \"Premise retracted successfully.\",\n      });\n      return retractResult;\n    },\n  });\n\n  return [createPremise, readPremises, updatePremise, retractPremise];\n}\n"]}

package/dist/questioner/questioner.agent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.agent.d.ts","sourceRoot":"/","sources":["questioner/questioner.agent.ts"],"names":[],"mappings":"AAWA,OAAO,EAAkD,KAAK,wBAAwB,EAAoD,MAAM,sCAAsC,CAAC;AACvL,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AAKxE,OAAO,EAAkC,KAAK,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAO7F,MAAM,WAAW,qBAAqB;IACpC,sCAAsC;IACtC,WAAW,CAAC,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3D;AAED;;;;GAIG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,KAAK,CAA2C;gBAE5C,MAAM,CAAC,EAAE,qBAAqB;IAM1C;;;;;;;;OAQG;IAEG,MAAM,CACV,KAAK,EAAE,eAAe,EACtB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GACjC,OAAO,CAAC,wBAAwB,GAAG,IAAI,CAAC;CAmD5C"}

package/dist/questioner/questioner.agent.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.agent.js","sourceRoot":"/","sources":["questioner/questioner.agent.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAEvE,OAAO,EAAE,+BAA+B,EAAkG,MAAM,sCAAsC,CAAC;AACvL,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAC5E,OAAO,EAAE,KAAK,EAAE,MAAM,wCAAwC,CAAC;AAC/D,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,8BAA8B,EAAwB,MAAM,uBAAuB,CAAC;AAE7F,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,CAAC,CAAC;AAEjD,oEAAoE;AACpE,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAO5B;;;;GAIG;AACH,MAAM,OAAO,eAAe;IAG1B,YAAY,MAA8B;QACxC,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAAC,YAAY,EAAE,+BAA+B,EAAE;YAChF,IAAI,EAAE,sBAAsB;SAC7B,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;;;;OAQG;IAEG,AAAN,KAAK,CAAC,MAAM,CACV,KAAsB,EACtB,OAAkC;QAElC,IAAI,CAAC,8BAA8B,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC,gEAAgE,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YACpG,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAEtD,IAAI,GAAY,CAAC;QACjB,IAAI,CAAC;YACH,GAAG,GAAG,MAAM,qBAAqB,CAC/B,IAAI,CAAC,KAAK,EACV,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC,EACvE,OAAO,EAAE,MAAM,CAChB,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,OAAO,EAAE,MAAM,EAAE,OAAO,IAAI,KAAK,CAAC;YAClD,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,CAAC,IAAI,CAAC,mCAAmC,EAAE;oBAC/C,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,KAAK;wBAC9C,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO;wBAC/B,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,SAAS,CAAC;iBACjD,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,iCAAiC,EAAE;oBAC7C,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;iBACxD,CAAC,CAAC;YACL,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,MAAM,GAAG,+BAA+B,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC9D,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,8BAA8B,EAAE;gBAC1C,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO;aAC5B,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEvC,OAAO;YACL,SAAS,EAAE,QAAQ,CAAC,GAAG,CAAC,qBAAqB,CAAC;YAC9C,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;YAC3C,uBAAuB,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,sBAAsB,CAAC;SACvE,CAAC;IACJ,CAAC;CACF;AAtDO;IADL,KAAK,EAAE;;;;6CAsDP;AAGH,iFAAiF;AAEjF,SAAS,eAAe,CAAC,SAAiC;IACxD,MAAM,cAAc,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;IAC/C,OAAO,wBAAwB,CAAC,cAAc,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,YAAY,CAAC,SAAiC;IACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,SAAS;QAChC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,wBAAwB,CAC/B,SAAiC;IAEjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA4B,CAAC;IACnD,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,iBAAiB;YAAE,SAAS;QACrC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAuB;IACpD,MAAM,EACJ,QAAQ,EAAE,SAAS,EACnB,sBAAsB,EAAE,uBAAuB,EAC/C,GAAG,WAAW,EACf,GAAG,CAAC,CAAC;IACN,OAAO,WAAW,CAAC;AACrB,CAAC","sourcesContent":["/**\n * QuestionerAgent — stateless, mode-driven agent that generates structured\n * decision questions from arbitrary protocol contexts.\n *\n * Follows the IndexNegotiator pattern: constructor takes optional config,\n * single public `invoke()` method receives the full context per call.\n * The LLM model is bound once at construction; the preset (system prompt +\n * builder) is selected per invocation based on `input.mode`.\n */\nimport { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\n\nimport { QuestionGeneratorResponseSchema, type Question, type QuestionGenerationResult, type QuestionStrategy, type QuestionWithStrategy } from \"../shared/schemas/question.schema.js\";\nimport { createStructuredModel } from \"../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../shared/agent/model-signal.js\";\nimport { protocolLogger } from \"../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../shared/observability/performance.js\";\nimport { getPreset } from \"./questioner.presets.js\";\nimport { isValidQuestionerInputContract, type QuestionerInput } from \"./questioner.types.js\";\n\nconst logger = protocolLogger(\"QuestionerAgent\");\n\n/** Maximum same-strategy questions allowed in a single emission. */\nconst MAX_SAME_STRATEGY = 2;\n\nexport interface QuestionerAgentConfig {\n  /** Optional model config override. */\n  modelConfig?: Parameters<typeof createStructuredModel>[3];\n}\n\n/**\n * Stateless question-generation agent. Accepts a `QuestionerInput` envelope,\n * selects the preset for the given mode, invokes the LLM, and applies\n * guardrails (dedup + strategy diversity).\n */\nexport class QuestionerAgent {\n  private model: ReturnType<typeof createStructuredModel>;\n\n  constructor(config?: QuestionerAgentConfig) {\n    this.model = createStructuredModel(\"questioner\", QuestionGeneratorResponseSchema, {\n      name: \"clarifying_questions\",\n    }, config?.modelConfig);\n  }\n\n  /**\n   * Generate up to 3 decision questions from the given input.\n   *\n   * @param input  Envelope with mode, userId, source info, and mode-specific context.\n   * @param options.signal  Optional AbortSignal to cancel the in-flight LLM call.\n   * @returns A result with parallel questions[] and strategies[] arrays,\n   *   or null when generation failed, guardrails dropped all candidates,\n   *   the LLM threw, or the call was aborted.\n   */\n  @Timed()\n  async invoke(\n    input: QuestionerInput,\n    options?: { signal?: AbortSignal },\n  ): Promise<QuestionGenerationResult | null> {\n    if (!isValidQuestionerInputContract(input)) {\n      logger.warn('QuestionerAgent rejected invalid mode/purpose/context contract', { mode: input.mode });\n      return null;\n    }\n    const preset = getPreset(input.mode, input.purpose);\n    const userMessage = preset.buildPrompt(input.context);\n\n    let raw: unknown;\n    try {\n      raw = await invokeWithAbortSignal(\n        this.model,\n        [new SystemMessage(preset.systemPrompt), new HumanMessage(userMessage)],\n        options?.signal,\n      );\n    } catch (err) {\n      const aborted = options?.signal?.aborted ?? false;\n      if (aborted) {\n        logger.info(\"QuestionerAgent aborted by signal\", {\n          mode: input.mode,\n          reason: options?.signal?.reason instanceof Error\n            ? options.signal.reason.message\n            : String(options?.signal?.reason ?? \"unknown\"),\n        });\n      } else {\n        logger.warn(\"QuestionerAgent LLM call failed\", {\n          mode: input.mode,\n          error: err instanceof Error ? err.message : String(err),\n        });\n      }\n      return null;\n    }\n\n    const parsed = QuestionGeneratorResponseSchema.safeParse(raw);\n    if (!parsed.success) {\n      logger.warn(\"QuestionerAgent parse failed\", {\n        mode: input.mode,\n        error: parsed.error.message,\n      });\n      return null;\n    }\n\n    const filtered = applyGuardrails(parsed.data.questions);\n    if (filtered.length === 0) return null;\n\n    return {\n      questions: filtered.map(stripInternalMetadata),\n      strategies: filtered.map((q) => q.strategy),\n      underspecificationTypes: filtered.map((q) => q.underspecificationType),\n    };\n  }\n}\n\n// --- Guardrails (migrated from question.generator.ts) -------------------------\n\nfunction applyGuardrails(questions: QuestionWithStrategy[]): QuestionWithStrategy[] {\n  const dedupedByTitle = dedupByTitle(questions);\n  return enforceStrategyDiversity(dedupedByTitle);\n}\n\nfunction dedupByTitle(questions: QuestionWithStrategy[]): QuestionWithStrategy[] {\n  const seen = new Set<string>();\n  const out: QuestionWithStrategy[] = [];\n  for (const q of questions) {\n    if (seen.has(q.title)) continue;\n    seen.add(q.title);\n    out.push(q);\n  }\n  return out;\n}\n\nfunction enforceStrategyDiversity(\n  questions: QuestionWithStrategy[],\n): QuestionWithStrategy[] {\n  const counts = new Map<QuestionStrategy, number>();\n  const out: QuestionWithStrategy[] = [];\n  for (const q of questions) {\n    const n = counts.get(q.strategy) ?? 0;\n    if (n >= MAX_SAME_STRATEGY) continue;\n    counts.set(q.strategy, n + 1);\n    out.push(q);\n  }\n  return out;\n}\n\nfunction stripInternalMetadata(q: QuestionWithStrategy): Question {\n  const {\n    strategy: _strategy,\n    underspecificationType: _underspecificationType,\n    ...publicShape\n  } = q;\n  return publicShape;\n}\n"]}

package/dist/questioner/questioner.ask.tool.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.ask.tool.d.ts","sourceRoot":"/","sources":["questioner/questioner.ask.tool.ts"],"names":[],"mappings":"AA4BA,OAAO,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,iCAAiC,CAAC;AAM5E,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AA8BxD,8EAA8E;AAC9E,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,eAAe,GAAG,IAAI,GAAG,IAAI,CAEhF;AAqCD;;;;;;;GAOG;AACH,wBAAgB,0BAA0B,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,kBAsMhF"}

package/dist/questioner/questioner.ask.tool.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.ask.tool.js","sourceRoot":"/","sources":["questioner/questioner.ask.tool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAC5E,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAG5E,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,yBAAyB,EAAE,MAAM,qBAAqB,CAAC;AAGhE,MAAM,MAAM,GAAG,cAAc,CAAC,qBAAqB,CAAC,CAAC;AAGrD,2EAA2E;AAC3E,MAAM,iBAAiB,GAAG,KAAM,CAAC;AAEjC,gFAAgF;AAChF,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAEjC;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,qDAAqD;AACrD,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAElC,+EAA+E;AAC/E,IAAI,eAAe,GAA2B,IAAI,CAAC;AACnD,SAAS,kBAAkB;IACzB,IAAI,CAAC,eAAe;QAAE,eAAe,GAAG,IAAI,eAAe,EAAE,CAAC;IAC9D,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,4BAA4B,CAAC,KAA6B;IACxE,eAAe,GAAG,KAAK,CAAC;AAC1B,CAAC;AAED,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IACnC,MAAM,EAAE,CAAC;SACN,MAAM,EAAE;SACR,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,GAAG,CAAC;SACR,QAAQ,CAAC,gFAAgF,CAAC;IAC7F,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;SACjC,GAAG,CAAC,CAAC,CAAC;SACN,GAAG,CAAC,CAAC,CAAC;SACN,QAAQ,EAAE;SACV,QAAQ,CAAC,uFAAuF,CAAC;IACpG,WAAW,EAAE,CAAC;SACX,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CAAC,yEAAyE,CAAC;CACvF,CAAC,CAAC;AAEH;;;GAGG;AACH,SAAS,iBAAiB,CAAC,KAA0C,EAAE,KAAa;IAClF,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,OAAO;QACL,KAAK,EAAE,YAAY,KAAK,GAAG,CAAC,EAAE;QAC9B,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;QAClC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACjD,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;YAC1B,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;SACjC,CAAC,CAAC;QACH,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,KAAK;KACxC,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,0BAA0B,CAAC,UAAsB,EAAE,IAAc;IAC/E,MAAM,eAAe,GAAG,UAAU,CAAC;QACjC,IAAI,EAAE,mBAAmB;QACzB,WAAW,EACT,gGAAgG;YAChG,iGAAiG;YACjG,+CAA+C;YAC/C,8FAA8F;YAC9F,2FAA2F;YAC3F,sGAAsG;YACtG,sFAAsF;YACtF,wGAAwG;YACxG,6FAA6F;YAC7F,6FAA6F;YAC7F,+FAA+F;YAC/F,sFAAsF;YACtF,4FAA4F;QAC9F,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,OAAO,EAAE,CAAC;iBACP,MAAM,EAAE;iBACR,GAAG,CAAC,EAAE,CAAC;iBACP,GAAG,CAAC,GAAG,CAAC;iBACR,QAAQ,CAAC,2EAA2E,CAAC;YACxF,SAAS,EAAE,CAAC;iBACT,KAAK,CAAC,mBAAmB,CAAC;iBAC1B,GAAG,CAAC,CAAC,CAAC;iBACN,GAAG,CAAC,CAAC,CAAC;iBACN,QAAQ,EAAE;iBACV,QAAQ,CAAC,8EAA8E,CAAC;SAC5F,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC;YAChC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,KAAK,CACV,mHAAmH,CACpH,CAAC;YACJ,CAAC;YACD,IAAI,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;gBACxC,OAAO,KAAK,CACV,yGAAyG,CAC1G,CAAC;YACJ,CAAC;YACD,MAAM,KAAK,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,KAAK,EAAE,YAAY,CAAC;YACjC,MAAM,MAAM,GAAG,KAAK,EAAE,WAAW,CAAC;YAClC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,KAAK,CACV,2GAA2G,CAC5G,CAAC;YACJ,CAAC;YAED,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YAEpC,sEAAsE;YACtE,MAAM,CAAC,mBAAmB,EAAE,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBAC3D,uBAAuB,CAAC,IAAI,EAAE,SAAS,CAAC;gBACxC,IAAI,CAAC,kBAAkB,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;aACjF,CAAC,CAAC;YAEH,0EAA0E;YAC1E,MAAM,WAAW,GAAgB;gBAC/B,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvE,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE,mBAAmB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvD,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACxC,CAAC;YAEF,IAAI,SAAS,GAAoC,IAAI,CAAC;YACtD,IAAI,CAAC;gBACH,SAAS,GAAG,MAAM,kBAAkB,EAAE,CAAC,MAAM,CAC3C;oBACE,IAAI,EAAE,MAAM;oBACZ,MAAM,EAAE,OAAO,CAAC,MAAM;oBACtB,UAAU,EAAE,cAAc;oBAC1B,QAAQ,EAAE,SAAS;oBACnB,OAAO,EAAE,WAAW;oBACpB,cAAc,EAAE,SAAS;iBAC1B,EACD,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAChC,CAAC;YACJ,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC,mCAAmC,EAAE;oBAC/C,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;iBACxD,CAAC,CAAC;YACL,CAAC;YAED,IAAI,cAA0B,CAAC;YAC/B,IAAI,UAA8B,CAAC;YACnC,IAAI,uBAA6D,CAAC;YAClE,IAAI,SAAS,IAAI,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChD,cAAc,GAAG,SAAS,CAAC,SAAS,CAAC;gBACrC,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;gBAClC,uBAAuB,GAAG,SAAS,CAAC,uBAAuB,CAAC;YAC9D,CAAC;iBAAM,CAAC;gBACN,2EAA2E;gBAC3E,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;qBACvC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;qBACtC,MAAM,CAAC,CAAC,CAAC,EAAiB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;gBAC5C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC5B,OAAO,KAAK,CACV,8FAA8F,CAC/F,CAAC;gBACJ,CAAC;gBACD,cAAc,GAAG,UAAU,CAAC;gBAC5B,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,wBAAiC,CAAC,CAAC;gBACrE,uBAAuB,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACvD,CAAC;YAED,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;gBACpB,OAAO,KAAK,CAAC,kEAAkE,CAAC,CAAC;YACnF,CAAC;YAED,sEAAsE;YACtE,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YAC3C,MAAM,KAAK,GAA0B,cAAc,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvE,SAAS,EAAE;oBACT,IAAI,EAAE,MAAM;oBACZ,UAAU,EAAE,cAAc;oBAC1B,QAAQ,EAAE,SAAS;oBACnB,SAAS;iBACV;gBACD,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,SAAkB,EAAE,CAAC;gBAC9D,OAAO;gBACP,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,wBAAwB;gBACnD,sBAAsB,EAAE,uBAAuB,CAAC,CAAC,CAAC,IAAI,IAAI;gBAC1D,cAAc,EAAE,SAAS;aAC1B,CAAC,CAAC,CAAC;YAEJ,IAAI,SAA8B,CAAC;YACnC,IAAI,CAAC;gBACH,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACxC,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE;oBAC/C,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;iBACxD,CAAC,CAAC;gBACH,OAAO,KAAK,CAAC,0FAA0F,CAAC,CAAC;YAC3G,CAAC;YAED,sEAAsE;YACtE,IAAI,CAAC;gBACH,IAAI,EAAE,eAAe;gBACrB,sEAAsE;gBACtE,gEAAgE;gBAChE,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;aAChD,CAAC,CAAC;YAEH,sEAAsE;YACtE,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE;gBACjC,IAAI,CAAC;oBACH,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,0BAA0B,EAAE,CAAC,CAAC;gBAChE,CAAC;gBAAC,MAAM,CAAC;oBACP,gEAAgE;gBAClE,CAAC;YACH,CAAC,EAAE,iBAAiB,CAAC,CAAC;YAEtB,IAAI,QAAqC,CAAC;YAC1C,IAAI,CAAC;gBACH,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,CAChC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAC1B,EAAE,SAAS,EAAE,yBAAyB,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAC1E,CAAC;YACJ,CAAC;oBAAS,CAAC;gBACT,aAAa,CAAC,SAAS,CAAC,CAAC;YAC3B,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACjC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBACjC,OAAO;oBACL,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,IAAI,EAAE;oBAC/B,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,GAAG,CAAC,CAAC,CAAC,MAAM;wBACV,CAAC,CAAC;4BACE,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,eAAe;4BACzC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;yBAC9D;wBACH,CAAC,CAAC,EAAE,CAAC;iBACR,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;YAC5E,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;YAE7D,OAAO,OAAO,CAAC;gBACb,OAAO,EAAE,OAAO;gBAChB,OAAO,EAAE,GAAG,aAAa,OAAO,OAAO,CAAC,MAAM,uBAAuB;gBACrE,GAAG,CAAC,QAAQ;oBACV,CAAC,CAAC;wBACE,QAAQ,EACN,+KAA+K;qBAClL;oBACH,CAAC,CAAC,EAAE,CAAC;aACR,CAAC,CAAC;QACL,CAAC;KACF,CAAC,CAAC;IAEH,OAAO,CAAC,eAAe,CAAU,CAAC;AACpC,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,uBAAuB,CAAC,IAAc,EAAE,SAAiB;IACtE,IAAI,CAAC,IAAI,CAAC,WAAW;QAAE,OAAO,EAAE,CAAC;IACjC,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;QAC3F,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAClD,OAAO,QAAQ;aACZ,KAAK,CAAC,CAAC,qBAAqB,CAAC;aAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC;YAC3D,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,OAAO,GAAG,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,qBAAqB,CAAC,EAAE,CAAC;QAC5D,CAAC,CAAC;aACD,IAAI,CAAC,IAAI,CAAC,CAAC;IAChB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,CAAC,IAAI,CAAC,qCAAqC,EAAE;YACjD,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;SACxD,CAAC,CAAC;QACH,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC","sourcesContent":["/**\n * ask_user_question — blocking mid-conversation questions for the chat\n * orchestrator (AskUserQuestion-style human-in-the-loop).\n *\n * Flow (hybrid authoring):\n * 1. The orchestrator states what it needs to learn (`purpose`) plus optional\n *    draft questions.\n * 2. The QuestionerAgent (mode `chat`) refines that into polished structured\n *    questions, grounded in the recent conversation excerpt and the user's\n *    global context.\n * 3. Questions are persisted (`questions` table, mode `chat`,\n *    `conversationId = sessionId`) via the injected {@link ChatQuestionsHost}.\n * 4. A `user_question` trace event streams the persisted questions to the\n *    frontend, which renders them inline while the turn stays open.\n * 5. The tool blocks on `awaitAnswers` until the user answers/dismisses\n *    through the questions REST endpoints, the wait budget elapses, or the\n *    run is aborted. Answers come back as the tool result so the model\n *    continues the SAME turn.\n *\n * On timeout the questions remain `pending`: they survive reloads via the\n * conversation-linked question fetch, and a later answer re-enters the chat\n * as a new user turn (frontend responsibility).\n *\n * Chat-only: not registered in the MCP tool registry. The handler also fails\n * gracefully when the session/stream context or host bridge is missing.\n */\nimport { z } from \"zod\";\n\nimport type { DefineTool, ToolDeps } from \"../shared/agent/tool.helpers.js\";\nimport { error, success } from \"../shared/agent/tool.helpers.js\";\nimport { requestContext } from \"../shared/observability/request-context.js\";\nimport { protocolLogger } from \"../shared/observability/protocol.logger.js\";\nimport type { PersistableQuestion, PersistedQuestion, ChatQuestionAnswerOutcome } from \"../shared/interfaces/questioner.interface.js\";\nimport type { Question, QuestionGenerationResult, QuestionStrategy, UnderspecificationType } from \"../shared/schemas/question.schema.js\";\nimport { QuestionerAgent } from \"./questioner.agent.js\";\nimport { chatQuestionWaitTimeoutMs } from \"./questioner.env.js\";\nimport type { ChatContext } from \"./questioner.types.js\";\n\nconst logger = protocolLogger(\"AskUserQuestionTool\");\n\n\n/** Heartbeat interval while blocked, so SSE transports do not idle out. */\nconst WAIT_HEARTBEAT_MS = 15_000;\n\n/** Messages included in the conversation excerpt fed to the QuestionerAgent. */\nconst EXCERPT_MESSAGE_COUNT = 10;\n\n/**\n * Fetch window for the excerpt. Host adapters return the FIRST N messages\n * (ascending) when a limit is passed, so we fetch a wide window and keep the\n * tail to get the most recent exchange.\n */\nconst EXCERPT_FETCH_LIMIT = 100;\n\n/** Max characters per message inside the excerpt. */\nconst EXCERPT_MESSAGE_CHARS = 400;\n\n// Lazy singleton — construction binds the LLM once; invocations are stateless.\nlet questionerAgent: QuestionerAgent | null = null;\nfunction getQuestionerAgent(): QuestionerAgent {\n  if (!questionerAgent) questionerAgent = new QuestionerAgent();\n  return questionerAgent;\n}\n\n/** Test seam: replace or reset the module-level QuestionerAgent singleton. */\nexport function setQuestionerAgentForTesting(agent: QuestionerAgent | null): void {\n  questionerAgent = agent;\n}\n\nconst draftQuestionSchema = z.object({\n  prompt: z\n    .string()\n    .min(5)\n    .max(400)\n    .describe(\"The question to ask, ending in a question mark. Self-contained plain language.\"),\n  options: z\n    .array(z.string().min(1).max(120))\n    .min(2)\n    .max(4)\n    .optional()\n    .describe(\"2-4 mutually distinct answer options. Omit to let the question generator derive them.\"),\n  multiSelect: z\n    .boolean()\n    .optional()\n    .describe(\"True when several options can be picked together (priorities, bundles).\"),\n});\n\n/**\n * Build a fallback Question directly from an orchestrator draft when the\n * QuestionerAgent produced nothing. Requires the draft to carry options.\n */\nfunction questionFromDraft(draft: z.infer<typeof draftQuestionSchema>, index: number): Question | null {\n  if (!draft.options || draft.options.length < 2) return null;\n  return {\n    title: `Question ${index + 1}`,\n    prompt: draft.prompt.slice(0, 400),\n    options: draft.options.slice(0, 4).map((label) => ({\n      label: label.slice(0, 120),\n      description: label.slice(0, 280),\n    })),\n    multiSelect: draft.multiSelect ?? false,\n  };\n}\n\n/**\n * Creates the chat-only `ask_user_question` tool. Registered by\n * `createChatTools` only when `deps.chatQuestions` is provided — never part\n * of the MCP tool registry (MCP clients have their own elicitation surface).\n *\n * @param defineTool - Tool factory provided by the composition root.\n * @param deps       - Shared tool dependencies; requires `chatQuestions`.\n */\nexport function createAskUserQuestionTools(defineTool: DefineTool, deps: ToolDeps) {\n  const askUserQuestion = defineTool({\n    name: \"ask_user_question\",\n    description:\n      \"Ask the user 1-3 structured clarifying questions and WAIT for their answer before continuing. \" +\n      \"The conversation pauses: the user sees interactive question cards inline and your turn resumes \" +\n      \"with their selections as the tool result.\\n\\n\" +\n      \"**Use when** a decision materially changes what you do next — before an expensive operation \" +\n      \"(discovery, creating an intent from ambiguous input), when facing meaningfully different \" +\n      \"directions, or when one concrete missing detail (timing, scope, budget, format) blocks progress.\\n\\n\" +\n      \"**Do not use** for facts already visible in the conversation or profile, procedural \" +\n      \"confirmations (\\\"Should I proceed?\\\"), or open-ended questions better asked in your response text.\\n\\n\" +\n      \"**Input:** `purpose` states what you need to learn and why. Optionally propose `questions` \" +\n      \"drafts (prompt + 2-4 options); a question generator refines wording and option quality.\\n\\n\" +\n      \"**Returns:** One entry per question with `status` (`answered`/`dismissed`/`timeout`) and the \" +\n      \"user's `selectedOptions`/`freeText`. On `timeout` the questions stay visible in the \" +\n      \"conversation — acknowledge briefly and end your turn; do NOT repeat the questions in text.\",\n    querySchema: z.object({\n      purpose: z\n        .string()\n        .min(10)\n        .max(600)\n        .describe(\"What you need to learn from the user and why it changes what you do next.\"),\n      questions: z\n        .array(draftQuestionSchema)\n        .min(1)\n        .max(3)\n        .optional()\n        .describe(\"Draft questions to ask. The question generator polishes them before display.\"),\n    }),\n    handler: async ({ context, query }) => {\n      const host = deps.chatQuestions;\n      if (!host) {\n        return error(\n          \"Interactive questions are not available in this environment. Ask the user directly in your response text instead.\",\n        );\n      }\n      if (context.isMcp || !context.sessionId) {\n        return error(\n          \"Interactive questions require a live chat session. Ask the user directly in your response text instead.\",\n        );\n      }\n      const store = requestContext.getStore();\n      const emit = store?.traceEmitter;\n      const signal = store?.abortSignal;\n      if (!emit) {\n        return error(\n          \"Interactive questions require a streaming chat turn. Ask the user directly in your response text instead.\",\n        );\n      }\n\n      const sessionId = context.sessionId;\n\n      // ── 1. Gather grounding context ────────────────────────────────────\n      const [conversationExcerpt, userContext] = await Promise.all([\n        loadConversationExcerpt(deps, sessionId),\n        deps.getUserContextText?.(context.userId).catch(() => \"\") ?? Promise.resolve(\"\"),\n      ]);\n\n      // ── 2. Generate polished questions (hybrid: drafts + QuestionerAgent) ──\n      const chatContext: ChatContext = {\n        purpose: query.purpose,\n        ...(query.questions?.length ? { draftQuestions: query.questions } : {}),\n        ...(conversationExcerpt ? { conversationExcerpt } : {}),\n        ...(userContext ? { userContext } : {}),\n      };\n\n      let generated: QuestionGenerationResult | null = null;\n      try {\n        generated = await getQuestionerAgent().invoke(\n          {\n            mode: \"chat\",\n            userId: context.userId,\n            sourceType: \"conversation\",\n            sourceId: sessionId,\n            context: chatContext,\n            conversationId: sessionId,\n          },\n          signal ? { signal } : undefined,\n        );\n      } catch (err) {\n        logger.warn(\"QuestionerAgent invocation failed\", {\n          error: err instanceof Error ? err.message : String(err),\n        });\n      }\n\n      let finalQuestions: Question[];\n      let strategies: QuestionStrategy[];\n      let underspecificationTypes: Array<UnderspecificationType | null>;\n      if (generated && generated.questions.length > 0) {\n        finalQuestions = generated.questions;\n        strategies = generated.strategies;\n        underspecificationTypes = generated.underspecificationTypes;\n      } else {\n        // Fallback: use the orchestrator's own drafts verbatim (options required).\n        const fromDrafts = (query.questions ?? [])\n          .map((d, i) => questionFromDraft(d, i))\n          .filter((q): q is Question => q !== null);\n        if (fromDrafts.length === 0) {\n          return error(\n            \"Could not prepare structured questions. Ask the user directly in your response text instead.\",\n          );\n        }\n        finalQuestions = fromDrafts;\n        strategies = fromDrafts.map(() => \"surface_missing_detail\" as const);\n        underspecificationTypes = fromDrafts.map(() => null);\n      }\n\n      if (signal?.aborted) {\n        return error(\"The chat turn was cancelled before the questions could be shown.\");\n      }\n\n      // ── 3. Persist (mode `chat`, linked to this conversation) ──────────\n      const timestamp = new Date().toISOString();\n      const batch: PersistableQuestion[] = finalQuestions.map((payload, i) => ({\n        detection: {\n          mode: \"chat\",\n          sourceType: \"conversation\",\n          sourceId: sessionId,\n          timestamp,\n        },\n        actors: [{ userId: context.userId, role: \"subject\" as const }],\n        payload,\n        strategy: strategies[i] ?? \"surface_missing_detail\",\n        underspecificationType: underspecificationTypes[i] ?? null,\n        conversationId: sessionId,\n      }));\n\n      let persisted: PersistedQuestion[];\n      try {\n        persisted = await host.persist(batch);\n      } catch (err) {\n        logger.error(\"Failed to persist chat questions\", {\n          error: err instanceof Error ? err.message : String(err),\n        });\n        return error(\"Could not deliver the questions to the user. Ask directly in your response text instead.\");\n      }\n\n      // ── 4. Stream the cards to the frontend ────────────────────────────\n      emit({\n        type: \"user_question\",\n        // The event is an opaque action reference. Question text is canonical\n        // only after the recipient resolves this ID through the server.\n        questions: persisted.map((q) => ({ id: q.id })),\n      });\n\n      // ── 5. Block until answered / dismissed / timeout / abort ──────────\n      const heartbeat = setInterval(() => {\n        try {\n          emit({ type: \"status\", message: \"Waiting for your answer…\" });\n        } catch {\n          /* stream may be closing; the wait resolves via timeout/abort */\n        }\n      }, WAIT_HEARTBEAT_MS);\n\n      let outcomes: ChatQuestionAnswerOutcome[];\n      try {\n        outcomes = await host.awaitAnswers(\n          persisted.map((q) => q.id),\n          { timeoutMs: chatQuestionWaitTimeoutMs(), ...(signal ? { signal } : {}) },\n        );\n      } finally {\n        clearInterval(heartbeat);\n      }\n\n      const byId = new Map(persisted.map((q) => [q.id, q]));\n      const results = outcomes.map((o) => {\n        const q = byId.get(o.questionId);\n        return {\n          questionId: o.questionId,\n          prompt: q?.payload.prompt ?? \"\",\n          status: o.status,\n          ...(o.answer\n            ? {\n                selectedOptions: o.answer.selectedOptions,\n                ...(o.answer.freeText ? { freeText: o.answer.freeText } : {}),\n              }\n            : {}),\n        };\n      });\n\n      const answeredCount = results.filter((r) => r.status === \"answered\").length;\n      const timedOut = results.some((r) => r.status === \"timeout\");\n\n      return success({\n        answers: results,\n        summary: `${answeredCount} of ${results.length} question(s) answered`,\n        ...(timedOut\n          ? {\n              guidance:\n                \"The user has not answered the remaining question(s) yet. They stay visible in the conversation — acknowledge briefly, do NOT repeat the questions in text, and end your turn.\",\n            }\n          : {}),\n      });\n    },\n  });\n\n  return [askUserQuestion] as const;\n}\n\n/**\n * Load a compact excerpt of the most recent conversation messages for the\n * QuestionerAgent's grounding. Best-effort: returns \"\" on any failure or when\n * no chat session reader is available. Note: the in-flight user message is\n * not yet persisted; the orchestrator's `purpose` carries that context.\n */\nasync function loadConversationExcerpt(deps: ToolDeps, sessionId: string): Promise<string> {\n  if (!deps.chatSession) return \"\";\n  try {\n    const messages = await deps.chatSession.getSessionMessages(sessionId, EXCERPT_FETCH_LIMIT);\n    if (!messages || messages.length === 0) return \"\";\n    return messages\n      .slice(-EXCERPT_MESSAGE_COUNT)\n      .map((m) => {\n        const role = m.role === \"assistant\" ? \"Assistant\" : \"User\";\n        const text = (m.content ?? \"\").replace(/\\s+/g, \" \").trim();\n        return `${role}: ${text.slice(0, EXCERPT_MESSAGE_CHARS)}`;\n      })\n      .join(\"\\n\");\n  } catch (err) {\n    logger.warn(\"Failed to load conversation excerpt\", {\n      error: err instanceof Error ? err.message : String(err),\n    });\n    return \"\";\n  }\n}\n"]}

package/dist/questioner/questioner.discovery.prompt.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.discovery.prompt.d.ts","sourceRoot":"/","sources":["questioner/questioner.discovery.prompt.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,sBAAsB,EAAmB,MAAM,gDAAgD,CAAC;AAG9G,gEAAgE;AAChE,eAAO,MAAM,uBAAuB,yyLA0CgJ,CAAC;AAErL;;;GAGG;AACH,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,sBAAsB,GAAG,MAAM,CAmClF"}

package/dist/questioner/questioner.discovery.prompt.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.discovery.prompt.js","sourceRoot":"/","sources":["questioner/questioner.discovery.prompt.ts"],"names":[],"mappings":"AAeA,gEAAgE;AAChE,MAAM,CAAC,MAAM,uBAAuB,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;oLA0C6I,CAAC;AAErL;;;GAGG;AACH,MAAM,UAAU,4BAA4B,CAAC,KAA6B;IACxE,MAAM,cAAc,GAAG,KAAK,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,mBAAmB,CAAC;IACxE,MAAM,sBAAsB,GAAG,6BAA6B,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACvF,MAAM,gBAAgB,GAAG,KAAK,CAAC,WAAW;QACxC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,WAAW,CAAC;QACjC,CAAC,CAAC,6BAA6B,CAAC;IAClC,MAAM,iBAAiB,GAAG,uBAAuB,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;IAElF,OAAO;QACL,mBAAmB;QACnB,KAAK,CAAC,KAAK;QACX,EAAE;QACF,mBAAmB;QACnB,cAAc;QACd,EAAE;QACF,wBAAwB;QACxB,KAAK,KAAK,CAAC,OAAO,CAAC,eAAe,kBAAkB;QACpD,KAAK,KAAK,CAAC,OAAO,CAAC,kBAAkB,8BAA8B;QACnE,KAAK,KAAK,CAAC,OAAO,CAAC,kBAAkB,qCAAqC,KAAK,CAAC,OAAO,CAAC,YAAY,8BAA8B;QAClI,yBAAyB,iBAAiB,EAAE;QAC5C,EAAE;QACF,iDAAiD;QACjD,sBAAsB;QACtB,EAAE;QACF,mDAAmD;QACnD,gBAAgB;QAChB,EAAE;QACF,QAAQ;QACR,KAAK,CAAC,GAAG;QACT,EAAE;QACF,cAAc;QACd,+EAA+E;QAC/E,2EAA2E;QAC3E,kFAAkF;KACnF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,6BAA6B,CAAC,OAAqC;IAC1E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,yBAAyB,CAAC;IAC3D,OAAO,OAAO;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACT,MAAM,kBAAkB,GAAG,CAAC,CAAC,cAAc;YACzC,CAAC,CAAC,CAAC,0BAA0B,wBAAwB,CAAC,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC;YAC1E,CAAC,CAAC,EAAE,CAAC;QACP,OAAO;YACL,aAAa,CAAC,CAAC,gBAAgB,EAAE;YACjC,wBAAwB,CAAC,CAAC,YAAY,EAAE;YACxC,cAAc,aAAa,CAAC,CAAC,CAAC,EAAE;YAChC,GAAG,kBAAkB;YACrB,WAAW,CAAC,CAAC,OAAO,EAAE;SACvB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC;SACD,IAAI,CAAC,MAAM,CAAC,CAAC;AAClB,CAAC;AAED,SAAS,uBAAuB,CAAC,IAA8C;IAC7E,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,wBAAwB,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC/E,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,+CAA+C,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,wDAAwD,CAAC,CAAC;IACtF,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,mCAAmC,CAAC;AACnF,CAAC;AAED,SAAS,aAAa,CAAC,MAAkC;IACvD,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,KAAK,aAAa;QAClD,CAAC,CAAC,sBAAsB;QACxB,CAAC,CAAC,gBAAgB,CAAC;IACrB,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;AACrD,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAmD;IAC9E,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,UAAU;YACb,OAAO,oBAAoB,CAAC;QAC9B,KAAK,SAAS;YACZ,OAAO,iBAAiB,CAAC;QAC3B,KAAK,UAAU;YACb,OAAO,4BAA4B,CAAC;QACtC,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,KAAK,cAAc;YACjB,OAAO,gDAAgD,CAAC;QAC1D,KAAK,IAAI;YACP,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,wBAAwB,CAAC,KAAgE;IAChG,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,MAAM;QAAE,OAAO,sBAAsB,CAAC;IAC1F,IAAI,KAAK,CAAC,OAAO,KAAK,OAAO,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;QAC/D,OAAO,wCAAwC,CAAC;IAClD,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,SAAS,KAAK,OAAO,EAAE,CAAC;QAC/D,OAAO,iDAAiD,CAAC;IAC3D,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,KAAK,OAAO;QAAE,OAAO,wCAAwC,CAAC;IAC/E,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,iDAAiD,CAAC;IAC1F,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAED,SAAS,YAAY,CAAC,CAAoB;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,IAAI,CAAC,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,CAAC,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,gBAAgB;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,IAAI,CAAC,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,gBAAgB;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC;AACnE,CAAC","sourcesContent":["/**\n * Discovery-mode prompt for the QuestionerAgent: the system prompt constant\n * and a pure string-building `buildDiscoveryQuestionPrompt` that assembles the\n * user message from a `DiscoveryQuestionInput`.\n *\n * Pure: no I/O, no LLM call. The QuestionerAgent (via the `discovery` preset\n * in `questioner.presets.ts`) orchestrates this module + an LLM client.\n *\n * Relocated from the removed `opportunity/question.prompt.ts` (IND-458); the\n * input types live in `shared/schemas/discovery-question.schema.ts`.\n */\nimport type { ChatContextDigest } from \"../shared/schemas/chat-context.schema.js\";\nimport type { DiscoveryQuestionInput, NegotiationRole } from \"../shared/schemas/discovery-question.schema.js\";\nimport type { DiscoveryNegotiationDigest } from \"../shared/schemas/negotiation-digest.schema.js\";\n\n/** System prompt for the QuestionerAgent's `discovery` mode. */\nexport const DISCOVERY_SYSTEM_PROMPT = `You help write user-facing follow-up questions after Index has reviewed potential connections for a human. Your job: surface the minimum set of structured decision questions the human must answer to make the next discovery turn sharper, or improve their outlook on the intent.\n\nYou may pick from five strategies. Choose contextually; mix when multiple questions genuinely complement.\n- refine_intent: ask the user to sharpen or pivot their original signal.\n- surface_missing_detail: ask for one concrete missing input (stage, location, timing, scope, …).\n- open_adjacent_thread: offer a pivot suggested by recurring connection signals.\n- reflective_summary: mirror what the connection review revealed and ask the user to decide.\n- surface_emergent_knowledge: cite a fact you learned from the connection review and ask the user to decide in light of it.\n\nAsk a question only when ALL of these hold:\n1. Index cannot resolve the decision autonomously from the evidence shown.\n2. The answer would materially change which people surface next.\n3. The same fact is NOT already in chatContext.statedFacts, NOT already asked in chatContext.openQuestions, and NOT already shared in chatContext.surfacedFindings.\n\nStandalone prompt rule. Every generated \\`prompt\\` must be understandable outside the conversation where it was created. Naturally include the original query, discovery pattern, connection pattern, or concrete learned fact in the question text itself. Do not rely on \\`title\\`, UI labels, hidden metadata, or surrounding digest/chat text to explain what the question is about. For example, prefer \"For your AI crypto decentralized deep-tech search, which area is most critical right now?\" over \"Which area is most critical right now?\"\n\nReferential closure. The prompt must resolve entirely on its own, with no dangling references. The reader sees ONLY the question text — never the people you reviewed, the events on their calendar, or this conversation. Do not use demonstratives or definite anaphora that point at things the reader cannot see: \"these builders\", \"those founders\", \"these researchers\", \"these conversations\", \"this lunch\", \"the speaker\". If you reference a person, name them. If you reference a group, restate the concrete shared attribute inside the question itself (\"founders working on decentralized identity\"), never \"these founders\". Never imply a list, set, or prior exchange the reader is not currently looking at.\n- Bad: \"What kind of collaboration are you looking for with these builders?\"\n- Good: \"You're meeting people building agent infrastructure — what kind of collaboration are you looking for?\"\n\nNo process narration. Never describe Index's own activity or internal state. Forbidden: \"the previous negotiation\", \"the negotiation stalled\", \"opportunities found so far\", \"my search\", \"the counterparty\", \"candidates reviewed\", restating why a match did or did not happen, or quoting words a counterparty did or did not use. Ask about the user's goal or intent directly, never about the matching pipeline.\n- Bad: \"All opportunities found so far are related to 'Edge Esmeralda'. Would you like to broaden the search?\"\n- Good: \"Do you want to focus on people at Edge Esmeralda, or also connect beyond it?\"\n\nCardinality. Default one question. Add a second only when a DIFFERENT strategy genuinely complements the first (e.g. one surface_emergent_knowledge + one refine_intent). Add a third only when there are ≥3 substantive people reviewed and three distinct strategies each unblock a real decision. Two questions of the same strategy are acceptable only if their decision domains differ (different titles). Avoid stacking three pulls (info-from-user); balance with pushes (info-to-user via reflective_summary / surface_emergent_knowledge).\n\nOrdering. Questions whose answer unblocks the most connection reviews come first; then highest-impact; then ambiguity-clarifying. Reviews that needed more detail or ran out of time signal under-specification — prioritize.\n\nUser-facing language. Every title, prompt, option label, and option description is shown directly to the user. Never mention raw protocol mechanics or internal labels such as \"agent\", \"patient\", \"peer\", \"suggestedRoles\", \"role distribution\", \"counterparty\", \"negotiation\", \"turn_cap\", \"timeout\", or \"candidate\". Use natural language instead: people, matches, connections, mutual collaboration, someone who can help, or someone seeking help.\n\nOption construction. Each option must represent a meaningfully different outcome. Suffix the safest path with \" (Recommended)\" and list it first. The description states the CONSEQUENCE of choosing the option, not its definition. 2–4 options. Never add an \"Other\" option — clients provide a free-text fallback automatically. For surface_emergent_knowledge questions, anchor the prompt in the concrete cited fact (\"Multiple people flagged that…\") and let the options represent decisions in light of that fact, not different versions of the fact.\n\nTitle rules. ≤12 chars. Noun of the decision domain. Discovery examples: \"Stage\", \"Timing\", \"Role\", \"Location\", \"Stack\", \"Budget\", \"Scope\", \"Format\".\n\nAnti-patterns — never do these.\n- Don't ask procedural confirmations (\"Should I look again?\").\n- Don't ask about hypothetical edge cases that didn't occur.\n- Don't ask about specific person identities; treat the provided person summary as the only allowed reference.\n- Don't repeat anything in chatContext.openQuestions.\n- Don't re-surface anything in chatContext.surfacedFindings.\n- Don't ask for facts in chatContext.statedFacts.\n\nOutput. Return at most 3 entries in the \"questions\" array. Each entry must include a \"strategy\" field (one of the five values). If nothing is worth asking, return \"questions\": [].`;\n\n/**\n * Pure builder: assembles the discovery-mode user message string from a\n * structured input.\n */\nexport function buildDiscoveryQuestionPrompt(input: DiscoveryQuestionInput): string {\n  const profileSummary = input.userContext?.trim() || \"(no profile data)\";\n  const connectionReviewBlocks = renderConnectionReviewDigests(input.negotiationDigests);\n  const chatContextBlock = input.chatContext\n    ? renderDigest(input.chatContext)\n    : \"(no chat context available)\";\n  const engagementPattern = renderEngagementPattern(input.summary.roleDistribution);\n\n  return [\n    \"## Seeker's query\",\n    input.query,\n    \"\",\n    \"## Seeker profile\",\n    profileSummary,\n    \"\",\n    \"## This discovery turn\",\n    `- ${input.summary.totalCandidates} people reviewed`,\n    `- ${input.summary.opportunitiesFound} promising connections found`,\n    `- ${input.summary.noOpportunityCount} reviews did not find enough fit (${input.summary.timeoutCount} needed more detail or time)`,\n    `- Engagement pattern: ${engagementPattern}`,\n    \"\",\n    \"## Connection review evidence (compact digests)\",\n    connectionReviewBlocks,\n    \"\",\n    \"## What the user has already said in this session\",\n    chatContextBlock,\n    \"\",\n    \"## Now\",\n    input.now,\n    \"\",\n    \"## Your task\",\n    \"Identify the minimum set of decision questions the seeker must answer to make\",\n    \"the next discovery turn sharper. Apply every rule from your system prompt\",\n    \"before outputting. Return an empty `questions` array if nothing is worth asking.\",\n  ].join(\"\\n\");\n}\n\n/**\n * Render the negotiation-digest collection into compact one-liners. Each digest\n * is fixed-size (≤ ~400 chars after rendering), so the rendered block scales\n * linearly with candidate count: 10 candidates ≈ 4 KB, well within budget.\n */\nfunction renderConnectionReviewDigests(digests: DiscoveryNegotiationDigest[]): string {\n  if (digests.length === 0) return \"(no connection reviews)\";\n  return digests\n    .map((d) => {\n      const relationshipSignal = d.suggestedRoles\n        ? [`  Relationship signal: ${renderRelationshipSignal(d.suggestedRoles)}`]\n        : [];\n      return [\n        `- Person: ${d.counterpartyHint}`,\n        `  Community context: ${d.indexContext}`,\n        `  Outcome: ${renderOutcome(d)}`,\n        ...relationshipSignal,\n        `  Take: ${d.keyTake}`,\n      ].join(\"\\n\");\n    })\n    .join(\"\\n\\n\");\n}\n\nfunction renderEngagementPattern(dist: Partial<Record<NegotiationRole, number>>): string {\n  const parts: string[] = [];\n  if ((dist.peer ?? 0) > 0) {\n    parts.push(`${dist.peer} mutual collaboration${dist.peer === 1 ? \"\" : \"s\"}`);\n  }\n  if ((dist.agent ?? 0) > 0) {\n    parts.push(`${dist.agent} where the user could offer help or expertise`);\n  }\n  if ((dist.patient ?? 0) > 0) {\n    parts.push(`${dist.patient} where the user seemed to be seeking help or expertise`);\n  }\n  return parts.length > 0 ? parts.join(\", \") : \"(no engagement pattern available)\";\n}\n\nfunction renderOutcome(digest: DiscoveryNegotiationDigest): string {\n  const outcome = digest.outcomeRole === \"opportunity\"\n    ? \"promising connection\"\n    : \"not enough fit\";\n  const reason = renderOutcomeReason(digest.outcomeReason);\n  return reason ? `${outcome} (${reason})` : outcome;\n}\n\nfunction renderOutcomeReason(reason: DiscoveryNegotiationDigest[\"outcomeReason\"]): string {\n  switch (reason) {\n    case \"turn_cap\":\n      return \"needed more detail\";\n    case \"timeout\":\n      return \"ran out of time\";\n    case \"rejected\":\n      return \"not enough mutual interest\";\n    case \"stalled\":\n      return \"stalled\";\n    case \"screened_out\":\n      return \"didn't look like a strong enough fit to pursue\";\n    case null:\n      return \"\";\n  }\n}\n\nfunction renderRelationshipSignal(roles: NonNullable<DiscoveryNegotiationDigest[\"suggestedRoles\"]>): string {\n  if (roles.ownUser === \"peer\" && roles.otherUser === \"peer\") return \"mutual collaboration\";\n  if (roles.ownUser === \"agent\" && roles.otherUser === \"patient\") {\n    return \"the user could offer help or expertise\";\n  }\n  if (roles.ownUser === \"patient\" && roles.otherUser === \"agent\") {\n    return \"the user seemed to be seeking help or expertise\";\n  }\n  if (roles.ownUser === \"agent\") return \"the user could offer help or expertise\";\n  if (roles.ownUser === \"patient\") return \"the user seemed to be seeking help or expertise\";\n  return \"collaboration fit\";\n}\n\nfunction renderDigest(d: ChatContextDigest): string {\n  const lines: string[] = [];\n  if (d.statedFacts.length > 0) {\n    lines.push(\"Stated facts:\");\n    for (const f of d.statedFacts) lines.push(`  - ${f}`);\n  }\n  if (d.openQuestions.length > 0) {\n    lines.push(\"Open questions (assistant already asked):\");\n    for (const q of d.openQuestions) lines.push(`  - ${q}`);\n  }\n  if (d.rejectionReasons.length > 0) {\n    lines.push(\"User pushback / rejections:\");\n    for (const r of d.rejectionReasons) lines.push(`  - ${r}`);\n  }\n  if (d.surfacedFindings.length > 0) {\n    lines.push(\"Findings already surfaced to user:\");\n    for (const f of d.surfacedFindings) lines.push(`  - ${f}`);\n  }\n  return lines.length > 0 ? lines.join(\"\\n\") : \"(digest is empty)\";\n}\n"]}

package/dist/questioner/questioner.env.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.env.d.ts","sourceRoot":"/","sources":["questioner/questioner.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH;;;;;;;GAOG;AACH,eAAO,MAAM,sCAAsC,QAAS,CAAC;AAC7D,eAAO,MAAM,qCAAqC,SAAU,CAAC;AAC7D,eAAO,MAAM,kCAAkC,KAAK,CAAC;AAerD,oEAAoE;AACpE,wBAAgB,mBAAmB,IAAI,OAAO,CAE7C;AAED;;;GAGG;AACH,wBAAgB,2BAA2B,IAAI,OAAO,CAErD;AAED,2FAA2F;AAC3F,wBAAgB,oBAAoB,IAAI,OAAO,CAE9C;AAED,2EAA2E;AAC3E,wBAAgB,wBAAwB,IAAI,MAAM,CAMjD;AAED;;;;GAIG;AACH,wBAAgB,2BAA2B,IAAI,aAAa,GAAG,UAAU,CAIxE;AAED,8DAA8D;AAC9D,wBAAgB,2BAA2B,IAAI,MAAM,CAEpD;AAED,gEAAgE;AAChE,wBAAgB,yBAAyB,IAAI,MAAM,CAElD"}

package/dist/questioner/questioner.env.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.env.js","sourceRoot":"/","sources":["questioner/questioner.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,sCAAsC,GAAG,KAAM,CAAC;AAC7D,MAAM,CAAC,MAAM,qCAAqC,GAAG,MAAO,CAAC;AAC7D,MAAM,CAAC,MAAM,kCAAkC,GAAG,EAAE,CAAC;AAErD;;;;GAIG;AACH,SAAS,cAAc,CAAC,IAAY,EAAE,QAAgB;IACpD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,gBAAgB;QAAE,OAAO,QAAQ,CAAC;IACjG,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,mBAAmB;IACjC,OAAO,OAAO,CAAC,GAAG,CAAC,kBAAkB,KAAK,MAAM,CAAC;AACnD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,2BAA2B;IACzC,OAAO,mBAAmB,EAAE,IAAI,OAAO,CAAC,GAAG,CAAC,4BAA4B,KAAK,MAAM,CAAC;AACtF,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,oBAAoB;IAClC,OAAO,mBAAmB,EAAE,IAAI,OAAO,CAAC,GAAG,CAAC,yBAAyB,KAAK,MAAM,CAAC;AACnF,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,wBAAwB;IACtC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,qCAAqC,CAAC;IAC9D,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE;QAAE,OAAO,kCAAkC,CAAC;IAC5D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAAE,OAAO,kCAAkC,CAAC;IAC3E,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACxC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B;IACzC,OAAO,OAAO,CAAC,GAAG,CAAC,+BAA+B,EAAE,IAAI,EAAE,KAAK,UAAU;QACvE,CAAC,CAAC,UAAU;QACZ,CAAC,CAAC,aAAa,CAAC;AACpB,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,2BAA2B;IACzC,OAAO,cAAc,CAAC,iCAAiC,EAAE,sCAAsC,CAAC,CAAC;AACnG,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,yBAAyB;IACvC,OAAO,cAAc,CAAC,iCAAiC,EAAE,qCAAqC,CAAC,CAAC;AAClG,CAAC","sourcesContent":["/**\n * Centralized accessors for all question-generation environment variables.\n *\n * Naming scheme (one prefix, hierarchical):\n *\n *   QUESTIONER_ENABLED                  master switch — QuestionerQueue worker +\n *                                       enqueue closures at every composition site.\n *   QUESTIONER_UPTAKE_ENABLED           per-surface switch — advisory pre-accept uptake\n *                                       interlock. Requires the master switch.\n *   QUESTIONER_UPTAKE_AUTHORITY_THRESHOLD\n *                                       authority threshold (0-100, default 70).\n *   QUESTIONER_DISCOVERY_ENABLED        per-surface switch — decision questions during\n *                                       chat/MCP opportunity discovery. Only effective\n *                                       when the master switch is on (the discovery\n *                                       question step adds inline summarizer latency,\n *                                       so operators can turn it off independently).\n *   QUESTIONER_DISCOVERY_INPUT_MODE     'transcripts' | 'insights' generator input.\n *   QUESTIONER_DISCOVERY_TIMEOUT_MS     per-call deadline for the discovery-questions\n *                                       LLM step (default 12s).\n *   QUESTIONER_CHAT_WAIT_TIMEOUT_MS     how long the blocking ask_user_question chat\n *                                       tool waits for an inline answer (default 4 min).\n *\n * All reads go through this module — do not read these variables via\n * `process.env` elsewhere. Values are read on every call (no caching) so tests\n * and long-lived processes observe changes.\n */\n\n/**\n * Question-generator budget. Sized against Railway's ~60 s edge timeout:\n * the discovery + evaluation + negotiate phases consume ~50 s on the slow\n * path, leaving ~10 s of headroom for the tail. 12 s is the larger end of\n * \"fits\"; the question step usually completes in 4-8 s, so most legitimate\n * calls finish well inside. Aborted calls return `null` (no questions);\n * the rest of the discovery payload still ships.\n */\nexport const DISCOVERY_QUESTIONS_TIMEOUT_MS_DEFAULT = 12_000;\nexport const CHAT_QUESTION_WAIT_TIMEOUT_MS_DEFAULT = 240_000;\nexport const UPTAKE_AUTHORITY_THRESHOLD_DEFAULT = 70;\n\n/**\n * Parse a positive integer env var, clamped to the safe-integer range so a\n * malformed env value cannot crash `AbortSignal.timeout` (which throws on\n * values outside `[0, MAX_SAFE_INTEGER]`).\n */\nfunction positiveIntEnv(name: string, fallback: number): number {\n  const raw = process.env[name];\n  if (!raw) return fallback;\n  const parsed = Number.parseInt(raw, 10);\n  if (!Number.isFinite(parsed) || parsed <= 0 || parsed > Number.MAX_SAFE_INTEGER) return fallback;\n  return parsed;\n}\n\n/** Master switch: is any background question generation enabled? */\nexport function isQuestionerEnabled(): boolean {\n  return process.env.QUESTIONER_ENABLED === \"true\";\n}\n\n/**\n * Per-surface switch: should chat/MCP opportunity discovery produce decision\n * questions? Hierarchical — always false when the master switch is off.\n */\nexport function isDiscoveryQuestionsEnabled(): boolean {\n  return isQuestionerEnabled() && process.env.QUESTIONER_DISCOVERY_ENABLED === \"true\";\n}\n\n/** Advisory uptake interlock. Flag-off by default and subordinate to the master switch. */\nexport function isUptakeGuardEnabled(): boolean {\n  return isQuestionerEnabled() && process.env.QUESTIONER_UPTAKE_ENABLED === \"true\";\n}\n\n/** Authority threshold below which hosts may generate uptake questions. */\nexport function uptakeAuthorityThreshold(): number {\n  const raw = process.env.QUESTIONER_UPTAKE_AUTHORITY_THRESHOLD;\n  if (!raw?.trim()) return UPTAKE_AUTHORITY_THRESHOLD_DEFAULT;\n  if (!/^-?\\d+$/.test(raw.trim())) return UPTAKE_AUTHORITY_THRESHOLD_DEFAULT;\n  const parsed = Number.parseInt(raw, 10);\n  return Math.min(100, Math.max(0, parsed));\n}\n\n/**\n * Input mode for the discovery question generator. Only `transcripts` is\n * implemented; any other value falls back to `transcripts` (startup.env.ts\n * warns on invalid values).\n */\nexport function discoveryQuestionsInputMode(): \"transcripts\" | \"insights\" {\n  return process.env.QUESTIONER_DISCOVERY_INPUT_MODE?.trim() === \"insights\"\n    ? \"insights\"\n    : \"transcripts\";\n}\n\n/** Per-call deadline for the discovery-questions LLM step. */\nexport function discoveryQuestionsTimeoutMs(): number {\n  return positiveIntEnv(\"QUESTIONER_DISCOVERY_TIMEOUT_MS\", DISCOVERY_QUESTIONS_TIMEOUT_MS_DEFAULT);\n}\n\n/** Wait budget for the blocking ask_user_question chat tool. */\nexport function chatQuestionWaitTimeoutMs(): number {\n  return positiveIntEnv(\"QUESTIONER_CHAT_WAIT_TIMEOUT_MS\", CHAT_QUESTION_WAIT_TIMEOUT_MS_DEFAULT);\n}\n"]}

package/dist/questioner/questioner.presets.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"questioner.presets.d.ts","sourceRoot":"/","sources":["questioner/questioner.presets.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,sCAAsC,CAAC;AAsB1F,MAAM,WAAW,gBAAgB;IAC/B,2CAA2C;IAC3C,YAAY,EAAE,MAAM,CAAC;IACrB,qEAAqE;IACrE,WAAW,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,MAAM,CAAC;CAC3C;AA2dD;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,YAAY,EAAE,OAAO,CAAC,EAAE,eAAe,GAAG,gBAAgB,CAYzF"}