@indexnetwork/protocol 5.0.0 → 5.2.0-rc.368.1

package/dist/opportunity/opportunity.state.js.map

@@ -1 +1 @@
-{"version":3,"file":"opportunity.state.js","sourceRoot":"/","sources":["opportunity/opportunity.state.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AA6HlD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAA2B,EAC3B,QAAuC;IAEvC,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IAC5C,OAAO,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC;AAChE,CAAC;AA+BD;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,UAAU,CAAC,IAAI,CAAC;IACnD,kCAAkC;IAClC,MAAM,EAAE,UAAU,CAAc;QAC9B,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAiB;KACjC,CAAC;IAEF,WAAW,EAAE,UAAU,CAAqB;QAC1C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,SAAS,EAAE,UAAU,CAA6B;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF;;;;;;OAMG;IACH,UAAU,EAAE,UAAU,CAA+B;QACnD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,mIAAmI;IACnI,eAAe,EAAE,UAAU,CAA4B;QACrD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,sFAAsF;IACtF,YAAY,EAAE,UAAU,CAA0B;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,uJAAuJ;IACvJ,gBAAgB,EAAE,UAAU,CAA0B;QACpD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,OAAO,EAAE,UAAU,CAA0B;QAC3C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;KACpB,CAAC;IAEF;;;;;;;;;OASG;IACH,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;;;;;;;;;OASG;IACH,oBAAoB,EAAE,UAAU,CAG5B;QACF,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF;;;;;;;;;;;;;;;OAeG;IACH,aAAa,EAAE,UAAU,CAAkJ;QACzK,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,QAAiB;KACjC,CAAC;IAEF,+EAA+E;IAC/E,oBAAoB,EAAE,UAAU,CAAoB;QAClD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,4DAA4D;IAC5D,gBAAgB,EAAE,UAAU,CAAqB;QAC/C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,6DAA6D;IAC7D,iBAAiB,EAAE,UAAU,CAA6B;QACxD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,+FAA+F;IAC/F,mBAAmB,EAAE,UAAU,CAAyC;QACtE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,0DAA0D;IAC1D,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,gEAAgE;IAChE,SAAS,EAAE,UAAU,CAAqB;QACxC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,4CAA4C;IAE5C,6DAA6D;IAC7D,cAAc,EAAE,UAAU,CAAkB;QAC1C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,6CAA6C;IAC7C,YAAY,EAAE,UAAU,CAAmB;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,mDAAmD;IACnD,cAAc,EAAE,UAAU,CAAkB;QAC1C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,wIAAwI;IACxI,oBAAoB,EAAE,UAAU,CAAyB;QACvD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;KACpB,CAAC;IAEF,yJAAyJ;IACzJ,eAAe,EAAE,UAAU,CAAuB;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,QAAQ;KACxB,CAAC;IAEF,mHAAmH;IACnH,uBAAuB,EAAE,UAAU,CAA4B;QAC7D,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,wFAAwF;IACxF,aAAa,EAAE,UAAU,CAA2B;QAClD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;KACpB,CAAC;IAEF,wGAAwG;IACxG,cAAc,EAAE,UAAU,CAA4D;QACpF,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,6FAA6F;IAC7F,cAAc,EAAE,UAAU,CAA6F;QACrH,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,qEAAqE;IACrE,qBAAqB,EAAE,UAAU,CAAU;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK;KACrB,CAAC;IAEF,sHAAsH;IACtH,qBAAqB,EAAE,UAAU,CAAU;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK;KACrB,CAAC;IAEF,kFAAkF;IAClF,0BAA0B,EAAE,UAAU,CAAqB;QACzD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,sDAAsD;IACtD,cAAc,EAAE,UAAU,CAA2B;QACnD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;KACpB,CAAC;IAEF,8DAA8D;IAC9D,UAAU,EAAE,UAAU,CAAmB;QACvC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,kFAAkF;IAClF,mBAAmB,EAAE,UAAU,CAAmB;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,qEAAqE;IACrE,WAAW,EAAE,UAAU,CAAgB;QACrC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;KACpB,CAAC;IAEF,iEAAiE;IACjE,mBAAmB,EAAE,UAAU,CAAuB;QACpD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,yEAAyE;IACzE,sBAAsB,EAAE,UAAU,CAAyB;QACzD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,6CAA6C;IAE7C,+CAA+C;IAC/C,aAAa,EAAE,UAAU,CAAgB;QACvC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,+HAA+H;IAC/H,qBAAqB,EAAE,UAAU,CAK7B;QACF,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,sCAAsC;IACtC,KAAK,EAAE,UAAU,CAAqB;QACpC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,4DAA4D;IAC5D,UAAU,EAAE,UAAU,CAcP;QACb,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,2CAA2C;IAC3C,cAAc,EAAE,UAAU,CAOX;QACb,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,uBAAuB;IAEvB;;;;OAIG;IACH,KAAK,EAAE,UAAU,CAA2E;QAC1F,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,sEAAsE;IACtE,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;IAEF;;;;;;;;OAQG;IACH,qBAAqB,EAAE,UAAU,CAAyB;QACxD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,sFAAsF;IACtF,gBAAgB,EAAE,UAAU,CAA0B;QACpD,OAAO,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACtC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;KACpB,CAAC;CACH,CAAC,CAAC","sourcesContent":["import { Annotation } from \"@langchain/langgraph\";\nimport type { Id } from '../shared/interfaces/database.interface.js';\nimport type { OpportunityStatus, Opportunity } from '../shared/interfaces/database.interface.js';\nimport type { Lens } from '../shared/interfaces/embedder.interface.js';\nimport type { EvaluatorEntity } from './opportunity.evaluator.js';\nimport type { DebugMetaAgent } from '../chat/chat-streaming.types.js';\nimport type { OpportunityEvidence } from '../shared/schemas/network-assignment.schema.js';\nimport type { DiscoveryNegotiation, DiscoverySummary } from \"./question.prompt.js\";\n\n/**\n * Opportunity Graph State (Linear Multi-Step Workflow)\n *\n * Flow: Prep → Scope → Discovery → Evaluation → Ranking → Persist → END\n *\n * Following the intent graph pattern with Annotation-based state management.\n */\n\n/** Asker's profile shape (identity + context). Used by sourceProfile annotation. */\nexport interface SourceProfileData {\n  identity?: { name?: string; bio?: string; location?: string };\n  context?: string;\n}\n\n/**\n * Indexed intent with hyde document (from prep node)\n */\nexport interface IndexedIntent {\n  intentId: Id<'intents'>;\n  payload: string;\n  summary?: string;\n  hydeDocumentId?: string;\n  hydeEmbedding?: number[];\n  indexes: Id<'networks'>[];\n}\n\n/**\n * Target index for search (from scope node)\n */\nexport interface TargetNetwork {\n  networkId: Id<'networks'>;\n  title: string;\n  memberCount: number;\n}\n\n/**\n * Candidate match from discovery (semantic search).\n */\nexport interface CandidateMatch {\n  candidateUserId: Id<'users'>;\n  candidateIntentId?: Id<'intents'>;\n  /** Source premise that produced this candidate (set when discoverySource is 'premise-similarity'). */\n  sourcePremiseId?: Id<'premises'>;\n  /** Candidate premise that matched this candidate (set for premise-based matches). */\n  candidatePremiseId?: Id<'premises'>;\n  /** Source context that produced this candidate (set when discoverySource is 'context-to-intent'). */\n  sourceContextId?: string;\n  networkId: Id<'networks'>;\n  similarity: number;\n  /** Free-text lens label that produced this match. */\n  lens: string;\n  candidatePayload: string;\n  candidateSummary?: string;\n  /** How this candidate was found: 'query' (HyDE from search text), 'premise-similarity', or 'context-to-intent'. */\n  discoverySource?: 'query' | 'premise-similarity' | 'context-to-intent';\n  /** Which discovery strategies found this candidate (set by mergeStrategyCandidates). */\n  matchedStrategies?: string[];\n  /** Typed evidence that explains why this candidate entered evaluation. */\n  evidence?: OpportunityEvidence[];\n}\n\n/**\n * Evaluated candidate with LLM scoring (legacy; used when evaluator returns source/candidate pair).\n * candidateIntentId is set for intent matches; omitted for profile-only matches.\n */\nexport interface EvaluatedCandidate {\n  sourceUserId: Id<'users'>;\n  candidateUserId: Id<'users'>;\n  sourceIntentId?: Id<'intents'>;\n  candidateIntentId?: Id<'intents'>;\n  networkId: Id<'networks'>;\n  score: number; // 0-100\n  reasoning: string; // Third-party analytical explanation of the match (for LLM agents)\n  valencyRole: 'Agent' | 'Patient' | 'Peer';\n  /** Free-text lens label that produced this match. */\n  lens: string;\n}\n\n/**\n * Actor in an evaluated opportunity (from entity-bundle evaluator).\n * networkId is filled from the entity bundle in the graph, not by the evaluator.\n */\nexport interface EvaluatedOpportunityActor {\n  userId: Id<'users'>;\n  role: 'agent' | 'patient' | 'peer';\n  intentId?: Id<'intents'>;\n  networkId: Id<'networks'>;\n}\n\n/**\n * Evaluated opportunity with multi-actor output (entity-bundle evaluator).\n */\nexport interface EvaluatedOpportunity {\n  actors: EvaluatedOpportunityActor[];\n  score: number;\n  reasoning: string;\n  evidence?: OpportunityEvidence[];\n}\n\n/**\n * Which flow triggered this graph invocation. Determines initial persist status,\n * park-window timeout, streaming behavior, and whether AbortSignal is honored.\n *\n * - 'ambient' (default): queue-driven. Persists at the trigger default of\n *   `pending` unless `options.initialStatus` overrides (the queue worker\n *   passes `'latent'`, chat-bound ambient discovery passes `'draft'`). 5-min\n *   park window, no streaming, ignores abort.\n * - 'orchestrator': chat-driven. Persists at the trigger default of\n *   `negotiating` unless `options.initialStatus` overrides. 60s park window,\n *   streams `opportunity_draft_ready` events, honors abort.\n *\n * See {@link resolveInitialStatus} for the exact fallback used when\n * `options.initialStatus` is undefined.\n */\nexport type OpportunityTrigger = 'ambient' | 'orchestrator';\n\n/**\n * Resolves the initial status for opportunities created in the persist node.\n *\n * Explicit `options.initialStatus` always wins (callers like the chat tool or\n * maintenance scripts override per-call). When the caller leaves it\n * undefined, the trigger drives the default:\n * - 'orchestrator' → 'negotiating' (chat-driven; negotiations run before the\n *   user sees a draft card).\n * - 'ambient' (or any other trigger) → 'pending' (long-standing default for\n *   queue- and intent-driven discovery).\n *\n * Lives here rather than in opportunity.graph.ts so unit tests can exercise\n * it without pulling in the full graph (and the evaluator's LLM requirements).\n *\n * @param trigger - The graph invocation's trigger\n * @param explicit - Caller-supplied initial status from options.initialStatus\n */\nexport function resolveInitialStatus(\n  trigger: OpportunityTrigger,\n  explicit: OpportunityStatus | undefined,\n): OpportunityStatus {\n  if (explicit !== undefined) return explicit;\n  return trigger === 'orchestrator' ? 'negotiating' : 'pending';\n}\n\n/**\n * Options passed to the graph\n */\nexport interface OpportunityGraphOptions {\n  /** Initial status for created opportunities (default: 'pending') */\n  initialStatus?: OpportunityStatus;\n  /** Minimum score threshold (default: 50) */\n  minScore?: number;\n  /** Maximum opportunities to return (default: 20) */\n  limit?: number;\n  /** Pre-inferred lenses (if not provided, lens inference runs automatically in HyDE graph) */\n  lenses?: Lens[];\n  /** User's search query for HyDE generation */\n  hydeDescription?: string;\n  /** Existing opportunities summary for evaluator deduplication */\n  existingOpportunities?: string;\n  /** Chat session ID for draft opportunities; stored as context.conversationId for visibility filtering. */\n  conversationId?: string;\n  /**\n   * MCP-only: cap the negotiate-phase wall-clock at this many milliseconds.\n   * When set, `negotiateNode` races `negotiateCandidates(...)` against a timer;\n   * if the timer wins, the node returns early with a `timed_out` trace and the\n   * unawaited negotiation chains finalize each opp's DB status in the\n   * background. Set to 20_000 by the MCP `discover_opportunities` handler.\n   * Chat, ambient queue, and all other callers omit this — existing behavior.\n   */\n  negotiateTimeoutMs?: number;\n}\n\n/**\n * Opportunity Graph State Annotation\n */\nexport const OpportunityGraphState = Annotation.Root({\n  // ─── Input Fields (Required) ───\n  userId: Annotation<Id<'users'>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => '' as Id<'users'>,\n  }),\n\n  searchQuery: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  networkId: Annotation<Id<'networks'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /**\n   * Optional set of indexes discovery may search within (e.g. a network-scoped\n   * agent's reachable networks: the bound network plus the user's personal network).\n   * The scope node intersects this with the user's actual memberships. Ignored\n   * when `networkId` is set (single-network override). When unset, discovery\n   * spans all of the user's networks.\n   */\n  indexScope: Annotation<Id<'networks'>[] | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Optional intent to use as discovery source and for triggeredBy. When set, used for search text (if query empty) and persist. */\n  triggerIntentId: Annotation<Id<'intents'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Optional: restrict discovery to this specific user ID only (direct connection). */\n  targetUserId: Annotation<Id<'users'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Optional: discover on behalf of this user (introducer flow). When set, prep/eval use this user's profile/intents; userId becomes the introducer. */\n  onBehalfOfUserId: Annotation<Id<'users'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  options: Annotation<OpportunityGraphOptions>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => ({}),\n  }),\n\n  /**\n   * Which flow triggered this graph invocation. See {@link OpportunityTrigger}\n   * for the exact branch behavior and {@link resolveInitialStatus} for the\n   * persist default when `options.initialStatus` is unset.\n   *\n   * - 'ambient' (default): queue-driven, persist default `pending`, 5-min\n   *   park window, no streaming, ignores abort.\n   * - 'orchestrator': chat-driven, persist default `negotiating`, 60s park\n   *   window, streams `opportunity_draft_ready` events, honors abort.\n   */\n  trigger: Annotation<OpportunityTrigger>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'ambient',\n  }),\n\n  /**\n   * Accepted opportunities the persist node discovered between the discoverer\n   * and a candidate actor (same pair, status='accepted'). The orchestrator\n   * branch populates this so the discover_opportunities tool (Task 7) can tell\n   * the LLM \"these pairs are already connected, surface the existing chat\n   * rather than creating a new draft\". Always empty for the ambient trigger.\n   *\n   * Left intentionally minimal — conversationId/URL resolution happens at\n   * Start Chat time (Task 8), not here.\n   */\n  dedupAlreadyAccepted: Annotation<Array<{\n    opportunityId: string;\n    counterpartyUserId: string;\n  }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /**\n   * Operation mode controls graph flow:\n   * - 'create': Existing discover pipeline (Prep → Scope → Discovery → Evaluation → Ranking → Persist)\n   * - 'create_introduction': Introduction path (validation → evaluation → persist) for chat-driven intros\n   * - 'continue_discovery': Pagination path (Prep → Evaluation → Ranking → Persist) using pre-loaded candidates\n   * - 'read': List opportunities filtered by userId and optionally networkId (fast path)\n   * - 'update': Change opportunity status (accept, reject, etc.)\n   * - 'delete': Expire/archive an opportunity\n   * - 'send': Promote latent opportunity to pending + queue notification\n   * - 'negotiate_existing': Load an existing opportunity by opportunityId and run bilateral negotiation.\n   *   Used after introducer approval to trigger the normal negotiation flow.\n   * - 'approve_introduction': Mark the caller as having approved a latent introducer opportunity,\n   *   then enqueue a negotiate_existing job for that opportunity.\n   *\n   * Defaults to 'create' for backward compatibility.\n   */\n  operationMode: Annotation<'create' | 'create_introduction' | 'continue_discovery' | 'read' | 'update' | 'delete' | 'send' | 'negotiate_existing' | 'approve_introduction'>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'create' as const,\n  }),\n\n  /** Introduction mode: pre-gathered entities (profiles + intents per party). */\n  introductionEntities: Annotation<EvaluatorEntity[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Introduction mode: optional hint from the introducer. */\n  introductionHint: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** When set (e.g. chat scope), networkId must match this. */\n  requiredNetworkId: Annotation<Id<'networks'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Set by intro_evaluation; used by persist to build manual detection and introducer actor. */\n  introductionContext: Annotation<{ createdByName?: string } | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Target opportunity ID for update/delete/send modes. */\n  opportunityId: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** New status for update mode (e.g. 'accepted', 'rejected'). */\n  newStatus: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  // ─── Intermediate Fields (Accumulated) ───\n\n  /** User's indexed intents with hyde documents (from prep) */\n  indexedIntents: Annotation<IndexedIntent[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** User's network memberships (from prep) */\n  userNetworks: Annotation<Id<'networks'>[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Target indexes to search within (from scope) */\n  targetNetworks: Annotation<TargetNetwork[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Per-index relevancy scores for dedup tie-breaking. Background path: from intent_indexes. Chat path: transient from IntentIndexer. */\n  indexRelevancyScores: Annotation<Record<string, number>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => ({}),\n  }),\n\n  /** Whether discovery used intent (path A) or user context (path B/C). Used by persist for triggeredBy. In-memory routing state only; never persisted. */\n  discoverySource: Annotation<'intent' | 'context'>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'intent',\n  }),\n\n  /** Resolved intent ID used for this discovery run (when discoverySource is 'intent'). Set by intent-resolution. */\n  resolvedTriggerIntentId: Annotation<Id<'intents'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Asker's profile (from prep). Used for profile-as-source discovery and evaluation. */\n  sourceProfile: Annotation<SourceProfileData | null>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => null,\n  }),\n\n  /** User's active premises with embeddings (from prep). Used for premise-to-premise discovery path D. */\n  sourcePremises: Annotation<Array<{ premiseId: Id<'premises'>; embedding: number[] }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** User context embeddings per network (from prep). Used for context-to-intent discovery. */\n  sourceContexts: Annotation<Array<{ contextId: string; networkId: Id<'networks'>; text: string; embedding: number[] }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Resolved intent is in at least one target index (path A vs C). */\n  resolvedIntentInIndex: Annotation<boolean>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => false,\n  }),\n\n  /** Create-intent signal: when true, tool should return createIntentSuggested so agent can auto-call create_intent. */\n  createIntentSuggested: Annotation<boolean>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => false,\n  }),\n\n  /** Suggested description for create_intent when createIntentSuggested is true. */\n  suggestedIntentDescription: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** HyDE embeddings per lens label (from discovery) */\n  hydeEmbeddings: Annotation<Record<string, number[]>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => ({}),\n  }),\n\n  /** Candidate matches from semantic search (from discovery) */\n  candidates: Annotation<CandidateMatch[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Candidates not yet evaluated (for pagination -- cached in Redis by caller). */\n  remainingCandidates: Annotation<CandidateMatch[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Discovery session ID for pagination (maps to Redis cache key). */\n  discoveryId: Annotation<string | null>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => null,\n  }),\n\n  /** Evaluated candidates with scores (from evaluation; legacy) */\n  evaluatedCandidates: Annotation<EvaluatedCandidate[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Evaluated opportunities with actors (from entity-bundle evaluator) */\n  evaluatedOpportunities: Annotation<EvaluatedOpportunity[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  // ─── Output Fields (Overwrite per turn) ───\n\n  /** Final ranked and persisted opportunities */\n  opportunities: Annotation<Opportunity[]>({\n    reducer: (curr, next) => next,\n    default: () => [],\n  }),\n\n  /** Discovery path: pairs skipped because an opportunity already exists between viewer and candidate (no duplicate created). */\n  existingBetweenActors: Annotation<Array<{\n    candidateUserId: Id<'users'>;\n    networkId: Id<'networks'>;\n    existingOpportunityId?: Id<'opportunities'>;\n    existingStatus?: OpportunityStatus;\n  }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Error message if any step fails */\n  error: Annotation<string | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  /** Output for read mode: enriched list of opportunities. */\n  readResult: Annotation<{\n    count: number;\n    message?: string;\n    opportunities: Array<{\n      id: string;\n      indexName: string;\n      connectedWith: string[];\n      suggestedBy: string | null;\n      reasoning: string;\n      status: string;\n      category: string;\n      confidence: number | null;\n      source: string | null;\n    }>;\n  } | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  /** Output for update/delete/send modes. */\n  mutationResult: Annotation<{\n    success: boolean;\n    message?: string;\n    opportunityId?: string;\n    notified?: string[];\n    conversationId?: string;\n    error?: string;\n  } | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  // ─── Trace Output ───\n\n  /**\n   * Accumulated trace entries from each graph node.\n   * Used for observability: surfaces internal processing steps (search query, HyDE strategies,\n   * candidates found, evaluation results) to the frontend.\n   */\n  trace: Annotation<Array<{ node: string; detail?: string; data?: Record<string, unknown> }>>({\n    reducer: (curr, next) => [...curr, ...(next || [])],\n    default: () => [],\n  }),\n\n  /** Timing records for each agent invocation within this graph run. */\n  agentTimings: Annotation<DebugMetaAgent[]>({\n    reducer: (acc, val) => [...acc, ...val],\n    default: () => [],\n  }),\n\n  /**\n   * Per-candidate negotiation records captured by `negotiateNode`. Populated\n   * regardless of accept/reject so the question generator sees a complete\n   * picture. Populated for ALL triggers (ambient + orchestrator) since the\n   * negotiate node's `onCandidateResolved` hook is unconditional; only the\n   * orchestrator streaming side-effects (opportunity_draft_ready emission)\n   * are trigger-gated. Empty when the negotiate node was skipped (no\n   * opportunities to negotiate).\n   */\n  discoveryNegotiations: Annotation<DiscoveryNegotiation[]>({\n    reducer: (curr, next) => [...curr, ...(next || [])],\n    default: () => [],\n  }),\n\n  /** Aggregate counters across `discoveryNegotiations`. Built in the negotiate node. */\n  discoverySummary: Annotation<DiscoverySummary | null>({\n    reducer: (_curr, next) => next ?? null,\n    default: () => null,\n  }),\n});\n"]}
+{"version":3,"file":"opportunity.state.js","sourceRoot":"/","sources":["opportunity/opportunity.state.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AA6HlD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAA2B,EAC3B,QAAuC;IAEvC,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IAC5C,OAAO,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC;AAChE,CAAC;AA+BD;;GAEG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,UAAU,CAAC,IAAI,CAAC;IACnD,kCAAkC;IAClC,MAAM,EAAE,UAAU,CAAc;QAC9B,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAiB;KACjC,CAAC;IAEF,WAAW,EAAE,UAAU,CAAqB;QAC1C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,SAAS,EAAE,UAAU,CAA6B;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF;;;;;;OAMG;IACH,UAAU,EAAE,UAAU,CAA+B;QACnD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,mIAAmI;IACnI,eAAe,EAAE,UAAU,CAA4B;QACrD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,sFAAsF;IACtF,YAAY,EAAE,UAAU,CAA0B;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,uJAAuJ;IACvJ,gBAAgB,EAAE,UAAU,CAA0B;QACpD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,OAAO,EAAE,UAAU,CAA0B;QAC3C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;KACpB,CAAC;IAEF;;;;;;;;;OASG;IACH,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;;;;;;;;;OASG;IACH,oBAAoB,EAAE,UAAU,CAG5B;QACF,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF;;;;;;;;;;;;;;;OAeG;IACH,aAAa,EAAE,UAAU,CAAkJ;QACzK,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,QAAiB;KACjC,CAAC;IAEF,+EAA+E;IAC/E,oBAAoB,EAAE,UAAU,CAAoB;QAClD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,4DAA4D;IAC5D,gBAAgB,EAAE,UAAU,CAAqB;QAC/C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,6DAA6D;IAC7D,iBAAiB,EAAE,UAAU,CAA6B;QACxD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,+FAA+F;IAC/F,mBAAmB,EAAE,UAAU,CAAyC;QACtE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,0DAA0D;IAC1D,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,gEAAgE;IAChE,SAAS,EAAE,UAAU,CAAqB;QACxC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,4CAA4C;IAE5C,6DAA6D;IAC7D,cAAc,EAAE,UAAU,CAAkB;QAC1C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,6CAA6C;IAC7C,YAAY,EAAE,UAAU,CAAmB;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,mDAAmD;IACnD,cAAc,EAAE,UAAU,CAAkB;QAC1C,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,wIAAwI;IACxI,oBAAoB,EAAE,UAAU,CAAyB;QACvD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;KACpB,CAAC;IAEF,yJAAyJ;IACzJ,eAAe,EAAE,UAAU,CAAuB;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,QAAQ;KACxB,CAAC;IAEF,mHAAmH;IACnH,uBAAuB,EAAE,UAAU,CAA4B;QAC7D,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,wFAAwF;IACxF,aAAa,EAAE,UAAU,CAA2B;QAClD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;KACpB,CAAC;IAEF,wGAAwG;IACxG,cAAc,EAAE,UAAU,CAA4D;QACpF,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,6FAA6F;IAC7F,cAAc,EAAE,UAAU,CAA6F;QACrH,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,qEAAqE;IACrE,qBAAqB,EAAE,UAAU,CAAU;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK;KACrB,CAAC;IAEF,sHAAsH;IACtH,qBAAqB,EAAE,UAAU,CAAU;QACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK;KACrB,CAAC;IAEF,kFAAkF;IAClF,0BAA0B,EAAE,UAAU,CAAqB;QACzD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,sDAAsD;IACtD,cAAc,EAAE,UAAU,CAA2B;QACnD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;KACpB,CAAC;IAEF,8DAA8D;IAC9D,UAAU,EAAE,UAAU,CAAmB;QACvC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,kFAAkF;IAClF,mBAAmB,EAAE,UAAU,CAAmB;QAChD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,qEAAqE;IACrE,WAAW,EAAE,UAAU,CAAgB;QACrC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;KACpB,CAAC;IAEF,iEAAiE;IACjE,mBAAmB,EAAE,UAAU,CAAuB;QACpD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,yEAAyE;IACzE,sBAAsB,EAAE,UAAU,CAAyB;QACzD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,6CAA6C;IAE7C,+CAA+C;IAC/C,aAAa,EAAE,UAAU,CAAgB;QACvC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,+HAA+H;IAC/H,qBAAqB,EAAE,UAAU,CAK7B;QACF,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,sCAAsC;IACtC,KAAK,EAAE,UAAU,CAAqB;QACpC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,4DAA4D;IAC5D,UAAU,EAAE,UAAU,CAcP;QACb,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,2CAA2C;IAC3C,cAAc,EAAE,UAAU,CAOX;QACb,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC7B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,uBAAuB;IAEvB;;;;OAIG;IACH,KAAK,EAAE,UAAU,CAA2E;QAC1F,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,sEAAsE;IACtE,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;IAEF;;;;;;;;OAQG;IACH,qBAAqB,EAAE,UAAU,CAAyB;QACxD,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE;KAClB,CAAC;IAEF,sFAAsF;IACtF,gBAAgB,EAAE,UAAU,CAA0B;QACpD,OAAO,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACtC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;KACpB,CAAC;CACH,CAAC,CAAC","sourcesContent":["import { Annotation } from \"@langchain/langgraph\";\nimport type { Id } from '../shared/interfaces/database.interface.js';\nimport type { OpportunityStatus, Opportunity } from '../shared/interfaces/database.interface.js';\nimport type { Lens } from '../shared/interfaces/embedder.interface.js';\nimport type { EvaluatorEntity } from './opportunity.evaluator.js';\nimport type { DebugMetaAgent } from '../chat/chat-streaming.types.js';\nimport type { OpportunityEvidence } from '../shared/schemas/network-assignment.schema.js';\nimport type { DiscoveryNegotiation, DiscoverySummary } from \"../shared/schemas/discovery-question.schema.js\";\n\n/**\n * Opportunity Graph State (Linear Multi-Step Workflow)\n *\n * Flow: Prep → Scope → Discovery → Evaluation → Ranking → Persist → END\n *\n * Following the intent graph pattern with Annotation-based state management.\n */\n\n/** Asker's profile shape (identity + context). Used by sourceProfile annotation. */\nexport interface SourceProfileData {\n  identity?: { name?: string; bio?: string; location?: string };\n  context?: string;\n}\n\n/**\n * Indexed intent with hyde document (from prep node)\n */\nexport interface IndexedIntent {\n  intentId: Id<'intents'>;\n  payload: string;\n  summary?: string;\n  hydeDocumentId?: string;\n  hydeEmbedding?: number[];\n  indexes: Id<'networks'>[];\n}\n\n/**\n * Target index for search (from scope node)\n */\nexport interface TargetNetwork {\n  networkId: Id<'networks'>;\n  title: string;\n  memberCount: number;\n}\n\n/**\n * Candidate match from discovery (semantic search).\n */\nexport interface CandidateMatch {\n  candidateUserId: Id<'users'>;\n  candidateIntentId?: Id<'intents'>;\n  /** Source premise that produced this candidate (set when discoverySource is 'premise-similarity'). */\n  sourcePremiseId?: Id<'premises'>;\n  /** Candidate premise that matched this candidate (set for premise-based matches). */\n  candidatePremiseId?: Id<'premises'>;\n  /** Source context that produced this candidate (set when discoverySource is 'context-to-intent'). */\n  sourceContextId?: string;\n  networkId: Id<'networks'>;\n  similarity: number;\n  /** Free-text lens label that produced this match. */\n  lens: string;\n  candidatePayload: string;\n  candidateSummary?: string;\n  /** How this candidate was found: 'query' (HyDE from search text), 'premise-similarity', or 'context-to-intent'. */\n  discoverySource?: 'query' | 'premise-similarity' | 'context-to-intent';\n  /** Which discovery strategies found this candidate (set by mergeStrategyCandidates). */\n  matchedStrategies?: string[];\n  /** Typed evidence that explains why this candidate entered evaluation. */\n  evidence?: OpportunityEvidence[];\n}\n\n/**\n * Evaluated candidate with LLM scoring (legacy; used when evaluator returns source/candidate pair).\n * candidateIntentId is set for intent matches; omitted for profile-only matches.\n */\nexport interface EvaluatedCandidate {\n  sourceUserId: Id<'users'>;\n  candidateUserId: Id<'users'>;\n  sourceIntentId?: Id<'intents'>;\n  candidateIntentId?: Id<'intents'>;\n  networkId: Id<'networks'>;\n  score: number; // 0-100\n  reasoning: string; // Third-party analytical explanation of the match (for LLM agents)\n  valencyRole: 'Agent' | 'Patient' | 'Peer';\n  /** Free-text lens label that produced this match. */\n  lens: string;\n}\n\n/**\n * Actor in an evaluated opportunity (from entity-bundle evaluator).\n * networkId is filled from the entity bundle in the graph, not by the evaluator.\n */\nexport interface EvaluatedOpportunityActor {\n  userId: Id<'users'>;\n  role: 'agent' | 'patient' | 'peer';\n  intentId?: Id<'intents'>;\n  networkId: Id<'networks'>;\n}\n\n/**\n * Evaluated opportunity with multi-actor output (entity-bundle evaluator).\n */\nexport interface EvaluatedOpportunity {\n  actors: EvaluatedOpportunityActor[];\n  score: number;\n  reasoning: string;\n  evidence?: OpportunityEvidence[];\n}\n\n/**\n * Which flow triggered this graph invocation. Determines initial persist status,\n * park-window timeout, streaming behavior, and whether AbortSignal is honored.\n *\n * - 'ambient' (default): queue-driven. Persists at the trigger default of\n *   `pending` unless `options.initialStatus` overrides (the queue worker\n *   passes `'latent'`, chat-bound ambient discovery passes `'draft'`). 5-min\n *   park window, no streaming, ignores abort.\n * - 'orchestrator': chat-driven. Persists at the trigger default of\n *   `negotiating` unless `options.initialStatus` overrides. 60s park window,\n *   streams `opportunity_draft_ready` events, honors abort.\n *\n * See {@link resolveInitialStatus} for the exact fallback used when\n * `options.initialStatus` is undefined.\n */\nexport type OpportunityTrigger = 'ambient' | 'orchestrator';\n\n/**\n * Resolves the initial status for opportunities created in the persist node.\n *\n * Explicit `options.initialStatus` always wins (callers like the chat tool or\n * maintenance scripts override per-call). When the caller leaves it\n * undefined, the trigger drives the default:\n * - 'orchestrator' → 'negotiating' (chat-driven; negotiations run before the\n *   user sees a draft card).\n * - 'ambient' (or any other trigger) → 'pending' (long-standing default for\n *   queue- and intent-driven discovery).\n *\n * Lives here rather than in opportunity.graph.ts so unit tests can exercise\n * it without pulling in the full graph (and the evaluator's LLM requirements).\n *\n * @param trigger - The graph invocation's trigger\n * @param explicit - Caller-supplied initial status from options.initialStatus\n */\nexport function resolveInitialStatus(\n  trigger: OpportunityTrigger,\n  explicit: OpportunityStatus | undefined,\n): OpportunityStatus {\n  if (explicit !== undefined) return explicit;\n  return trigger === 'orchestrator' ? 'negotiating' : 'pending';\n}\n\n/**\n * Options passed to the graph\n */\nexport interface OpportunityGraphOptions {\n  /** Initial status for created opportunities (default: 'pending') */\n  initialStatus?: OpportunityStatus;\n  /** Minimum score threshold (default: 50) */\n  minScore?: number;\n  /** Maximum opportunities to return (default: 20) */\n  limit?: number;\n  /** Pre-inferred lenses (if not provided, lens inference runs automatically in HyDE graph) */\n  lenses?: Lens[];\n  /** User's search query for HyDE generation */\n  hydeDescription?: string;\n  /** Existing opportunities summary for evaluator deduplication */\n  existingOpportunities?: string;\n  /** Chat session ID for draft opportunities; stored as context.conversationId for visibility filtering. */\n  conversationId?: string;\n  /**\n   * MCP-only: cap the negotiate-phase wall-clock at this many milliseconds.\n   * When set, `negotiateNode` races `negotiateCandidates(...)` against a timer;\n   * if the timer wins, the node returns early with a `timed_out` trace and the\n   * unawaited negotiation chains finalize each opp's DB status in the\n   * background. Set to 20_000 by the MCP `discover_opportunities` handler.\n   * Chat, ambient queue, and all other callers omit this — existing behavior.\n   */\n  negotiateTimeoutMs?: number;\n}\n\n/**\n * Opportunity Graph State Annotation\n */\nexport const OpportunityGraphState = Annotation.Root({\n  // ─── Input Fields (Required) ───\n  userId: Annotation<Id<'users'>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => '' as Id<'users'>,\n  }),\n\n  searchQuery: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  networkId: Annotation<Id<'networks'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /**\n   * Optional set of indexes discovery may search within (e.g. a network-scoped\n   * agent's reachable networks: the bound network plus the user's personal network).\n   * The scope node intersects this with the user's actual memberships. Ignored\n   * when `networkId` is set (single-network override). When unset, discovery\n   * spans all of the user's networks.\n   */\n  indexScope: Annotation<Id<'networks'>[] | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Optional intent to use as discovery source and for triggeredBy. When set, used for search text (if query empty) and persist. */\n  triggerIntentId: Annotation<Id<'intents'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Optional: restrict discovery to this specific user ID only (direct connection). */\n  targetUserId: Annotation<Id<'users'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Optional: discover on behalf of this user (introducer flow). When set, prep/eval use this user's profile/intents; userId becomes the introducer. */\n  onBehalfOfUserId: Annotation<Id<'users'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  options: Annotation<OpportunityGraphOptions>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => ({}),\n  }),\n\n  /**\n   * Which flow triggered this graph invocation. See {@link OpportunityTrigger}\n   * for the exact branch behavior and {@link resolveInitialStatus} for the\n   * persist default when `options.initialStatus` is unset.\n   *\n   * - 'ambient' (default): queue-driven, persist default `pending`, 5-min\n   *   park window, no streaming, ignores abort.\n   * - 'orchestrator': chat-driven, persist default `negotiating`, 60s park\n   *   window, streams `opportunity_draft_ready` events, honors abort.\n   */\n  trigger: Annotation<OpportunityTrigger>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'ambient',\n  }),\n\n  /**\n   * Accepted opportunities the persist node discovered between the discoverer\n   * and a candidate actor (same pair, status='accepted'). The orchestrator\n   * branch populates this so the discover_opportunities tool (Task 7) can tell\n   * the LLM \"these pairs are already connected, surface the existing chat\n   * rather than creating a new draft\". Always empty for the ambient trigger.\n   *\n   * Left intentionally minimal — conversationId/URL resolution happens at\n   * Start Chat time (Task 8), not here.\n   */\n  dedupAlreadyAccepted: Annotation<Array<{\n    opportunityId: string;\n    counterpartyUserId: string;\n  }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /**\n   * Operation mode controls graph flow:\n   * - 'create': Existing discover pipeline (Prep → Scope → Discovery → Evaluation → Ranking → Persist)\n   * - 'create_introduction': Introduction path (validation → evaluation → persist) for chat-driven intros\n   * - 'continue_discovery': Pagination path (Prep → Evaluation → Ranking → Persist) using pre-loaded candidates\n   * - 'read': List opportunities filtered by userId and optionally networkId (fast path)\n   * - 'update': Change opportunity status (accept, reject, etc.)\n   * - 'delete': Expire/archive an opportunity\n   * - 'send': Promote latent opportunity to pending + queue notification\n   * - 'negotiate_existing': Load an existing opportunity by opportunityId and run bilateral negotiation.\n   *   Used after introducer approval to trigger the normal negotiation flow.\n   * - 'approve_introduction': Mark the caller as having approved a latent introducer opportunity,\n   *   then enqueue a negotiate_existing job for that opportunity.\n   *\n   * Defaults to 'create' for backward compatibility.\n   */\n  operationMode: Annotation<'create' | 'create_introduction' | 'continue_discovery' | 'read' | 'update' | 'delete' | 'send' | 'negotiate_existing' | 'approve_introduction'>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'create' as const,\n  }),\n\n  /** Introduction mode: pre-gathered entities (profiles + intents per party). */\n  introductionEntities: Annotation<EvaluatorEntity[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Introduction mode: optional hint from the introducer. */\n  introductionHint: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** When set (e.g. chat scope), networkId must match this. */\n  requiredNetworkId: Annotation<Id<'networks'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Set by intro_evaluation; used by persist to build manual detection and introducer actor. */\n  introductionContext: Annotation<{ createdByName?: string } | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Target opportunity ID for update/delete/send modes. */\n  opportunityId: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** New status for update mode (e.g. 'accepted', 'rejected'). */\n  newStatus: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  // ─── Intermediate Fields (Accumulated) ───\n\n  /** User's indexed intents with hyde documents (from prep) */\n  indexedIntents: Annotation<IndexedIntent[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** User's network memberships (from prep) */\n  userNetworks: Annotation<Id<'networks'>[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Target indexes to search within (from scope) */\n  targetNetworks: Annotation<TargetNetwork[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Per-index relevancy scores for dedup tie-breaking. Background path: from intent_indexes. Chat path: transient from IntentIndexer. */\n  indexRelevancyScores: Annotation<Record<string, number>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => ({}),\n  }),\n\n  /** Whether discovery used intent (path A) or user context (path B/C). Used by persist for triggeredBy. In-memory routing state only; never persisted. */\n  discoverySource: Annotation<'intent' | 'context'>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'intent',\n  }),\n\n  /** Resolved intent ID used for this discovery run (when discoverySource is 'intent'). Set by intent-resolution. */\n  resolvedTriggerIntentId: Annotation<Id<'intents'> | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** Asker's profile (from prep). Used for profile-as-source discovery and evaluation. */\n  sourceProfile: Annotation<SourceProfileData | null>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => null,\n  }),\n\n  /** User's active premises with embeddings (from prep). Used for premise-to-premise discovery path D. */\n  sourcePremises: Annotation<Array<{ premiseId: Id<'premises'>; embedding: number[] }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** User context embeddings per network (from prep). Used for context-to-intent discovery. */\n  sourceContexts: Annotation<Array<{ contextId: string; networkId: Id<'networks'>; text: string; embedding: number[] }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Resolved intent is in at least one target index (path A vs C). */\n  resolvedIntentInIndex: Annotation<boolean>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => false,\n  }),\n\n  /** Create-intent signal: when true, tool should return createIntentSuggested so agent can auto-call create_intent. */\n  createIntentSuggested: Annotation<boolean>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => false,\n  }),\n\n  /** Suggested description for create_intent when createIntentSuggested is true. */\n  suggestedIntentDescription: Annotation<string | undefined>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => undefined,\n  }),\n\n  /** HyDE embeddings per lens label (from discovery) */\n  hydeEmbeddings: Annotation<Record<string, number[]>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => ({}),\n  }),\n\n  /** Candidate matches from semantic search (from discovery) */\n  candidates: Annotation<CandidateMatch[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Candidates not yet evaluated (for pagination -- cached in Redis by caller). */\n  remainingCandidates: Annotation<CandidateMatch[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Discovery session ID for pagination (maps to Redis cache key). */\n  discoveryId: Annotation<string | null>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => null,\n  }),\n\n  /** Evaluated candidates with scores (from evaluation; legacy) */\n  evaluatedCandidates: Annotation<EvaluatedCandidate[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Evaluated opportunities with actors (from entity-bundle evaluator) */\n  evaluatedOpportunities: Annotation<EvaluatedOpportunity[]>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  // ─── Output Fields (Overwrite per turn) ───\n\n  /** Final ranked and persisted opportunities */\n  opportunities: Annotation<Opportunity[]>({\n    reducer: (curr, next) => next,\n    default: () => [],\n  }),\n\n  /** Discovery path: pairs skipped because an opportunity already exists between viewer and candidate (no duplicate created). */\n  existingBetweenActors: Annotation<Array<{\n    candidateUserId: Id<'users'>;\n    networkId: Id<'networks'>;\n    existingOpportunityId?: Id<'opportunities'>;\n    existingStatus?: OpportunityStatus;\n  }>>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => [],\n  }),\n\n  /** Error message if any step fails */\n  error: Annotation<string | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  /** Output for read mode: enriched list of opportunities. */\n  readResult: Annotation<{\n    count: number;\n    message?: string;\n    opportunities: Array<{\n      id: string;\n      indexName: string;\n      connectedWith: string[];\n      suggestedBy: string | null;\n      reasoning: string;\n      status: string;\n      category: string;\n      confidence: number | null;\n      source: string | null;\n    }>;\n  } | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  /** Output for update/delete/send modes. */\n  mutationResult: Annotation<{\n    success: boolean;\n    message?: string;\n    opportunityId?: string;\n    notified?: string[];\n    conversationId?: string;\n    error?: string;\n  } | undefined>({\n    reducer: (curr, next) => next,\n    default: () => undefined,\n  }),\n\n  // ─── Trace Output ───\n\n  /**\n   * Accumulated trace entries from each graph node.\n   * Used for observability: surfaces internal processing steps (search query, HyDE strategies,\n   * candidates found, evaluation results) to the frontend.\n   */\n  trace: Annotation<Array<{ node: string; detail?: string; data?: Record<string, unknown> }>>({\n    reducer: (curr, next) => [...curr, ...(next || [])],\n    default: () => [],\n  }),\n\n  /** Timing records for each agent invocation within this graph run. */\n  agentTimings: Annotation<DebugMetaAgent[]>({\n    reducer: (acc, val) => [...acc, ...val],\n    default: () => [],\n  }),\n\n  /**\n   * Per-candidate negotiation records captured by `negotiateNode`. Populated\n   * regardless of accept/reject so the question generator sees a complete\n   * picture. Populated for ALL triggers (ambient + orchestrator) since the\n   * negotiate node's `onCandidateResolved` hook is unconditional; only the\n   * orchestrator streaming side-effects (opportunity_draft_ready emission)\n   * are trigger-gated. Empty when the negotiate node was skipped (no\n   * opportunities to negotiate).\n   */\n  discoveryNegotiations: Annotation<DiscoveryNegotiation[]>({\n    reducer: (curr, next) => [...curr, ...(next || [])],\n    default: () => [],\n  }),\n\n  /** Aggregate counters across `discoveryNegotiations`. Built in the negotiate node. */\n  discoverySummary: Annotation<DiscoverySummary | null>({\n    reducer: (_curr, next) => next ?? null,\n    default: () => null,\n  }),\n});\n"]}

package/dist/opportunity/outcome/outcome.env.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Centralized accessors for Lens B outcome-question environment variables
+ * (IND-434).
+ *
+ *   OUTCOME_QUESTIONS_MODE   off | shadow | on — Lens B "explicit opportunity
+ *                            outcomes → grounded questions" pipeline.
+ *
+ *                            off (default): no outcome feedback events are
+ *                              captured and no hypothesis mining runs. Zero
+ *                              behavior change.
+ *                            shadow: capture one idempotent append-only
+ *                              feedback event per explicit owner action, mine
+ *                              neutral trade-off hypotheses for the exact
+ *                              recipient + intent + fingerprint, and emit
+ *                              aggregate telemetry only. No question, ranking,
+ *                              intent, premise, memory, newborn-stamp, or push
+ *                              writes.
+ *                            on: reserved for a later phase (IND-438) that
+ *                              turns a grounded hypothesis into a user-facing
+ *                              question. This slice treats "on" exactly like
+ *                              "shadow" for capture + mining; it never emits
+ *                              questions.
+ *
+ * All reads go through this module — do not read this variable via
+ * `process.env` elsewhere. Values are read on every call (no caching) so tests
+ * and long-lived processes observe changes.
+ */
+/** Lens B outcome-question mode. */
+export type OutcomeQuestionsMode = "off" | "shadow" | "on";
+/**
+ * Current OUTCOME_QUESTIONS_MODE (default off). Only the exact trimmed literals
+ * "shadow" and "on" activate; every other value (including unset/empty) is off.
+ */
+export declare function outcomeQuestionsMode(): OutcomeQuestionsMode;
+/**
+ * True when Lens B capture + mining should run at all. Both "shadow" and "on"
+ * activate the shadow pipeline; only the future question-emitting behavior is
+ * gated on "on" (not part of this slice).
+ */
+export declare function isOutcomeQuestionsActivated(): boolean;
+/**
+ * Independent-support threshold (k). Every compared group (discriminator side)
+ * must have at least this many INDEPENDENT (related-opportunity-deduplicated)
+ * examples before the hypothesis is eligible. Enforced per side, so no side
+ * can be traced back to a small handful of individuals.
+ */
+export declare const OUTCOME_MIN_INDEPENDENT_SUPPORT = 5;
+/** Minimum number of qualified sides (each ≥ k) for a hypothesis to compare. */
+export declare const OUTCOME_MIN_COMPARED_SIDES = 2;
+/**
+ * k-anonymity floor for attempting a mining pass at all: the number of
+ * distinct independent examples (after related-opportunity dedup) required
+ * before the miner is invoked. Set to k × minimum compared sides so a pass can
+ * never produce an eligible hypothesis below the aggregate floor.
+ */
+export declare const OUTCOME_MIN_INDEPENDENT_EXAMPLES: number;
+/** Max independent examples sent to the miner LLM (most recent first). */
+export declare const OUTCOME_MAX_CANDIDATES = 48;
+/** Max chars of presentation-safe candidate snapshot stored/sent per example. */
+export declare const OUTCOME_MAX_PUBLIC_CONTEXT_CHARS = 400;
+//# sourceMappingURL=outcome.env.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"outcome.env.d.ts","sourceRoot":"/","sources":["opportunity/outcome/outcome.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,oCAAoC;AACpC,MAAM,MAAM,oBAAoB,GAAG,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC;AAE3D;;;GAGG;AACH,wBAAgB,oBAAoB,IAAI,oBAAoB,CAG3D;AAED;;;;GAIG;AACH,wBAAgB,2BAA2B,IAAI,OAAO,CAErD;AAED;;;;;GAKG;AACH,eAAO,MAAM,+BAA+B,IAAI,CAAC;AAEjD,gFAAgF;AAChF,eAAO,MAAM,0BAA0B,IAAI,CAAC;AAE5C;;;;;GAKG;AACH,eAAO,MAAM,gCAAgC,QACiB,CAAC;AAE/D,0EAA0E;AAC1E,eAAO,MAAM,sBAAsB,KAAK,CAAC;AAEzC,iFAAiF;AACjF,eAAO,MAAM,gCAAgC,MAAM,CAAC"}

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

@@ -0,0 +1,64 @@
+/**
+ * Centralized accessors for Lens B outcome-question environment variables
+ * (IND-434).
+ *
+ *   OUTCOME_QUESTIONS_MODE   off | shadow | on — Lens B "explicit opportunity
+ *                            outcomes → grounded questions" pipeline.
+ *
+ *                            off (default): no outcome feedback events are
+ *                              captured and no hypothesis mining runs. Zero
+ *                              behavior change.
+ *                            shadow: capture one idempotent append-only
+ *                              feedback event per explicit owner action, mine
+ *                              neutral trade-off hypotheses for the exact
+ *                              recipient + intent + fingerprint, and emit
+ *                              aggregate telemetry only. No question, ranking,
+ *                              intent, premise, memory, newborn-stamp, or push
+ *                              writes.
+ *                            on: reserved for a later phase (IND-438) that
+ *                              turns a grounded hypothesis into a user-facing
+ *                              question. This slice treats "on" exactly like
+ *                              "shadow" for capture + mining; it never emits
+ *                              questions.
+ *
+ * All reads go through this module — do not read this variable via
+ * `process.env` elsewhere. Values are read on every call (no caching) so tests
+ * and long-lived processes observe changes.
+ */
+/**
+ * Current OUTCOME_QUESTIONS_MODE (default off). Only the exact trimmed literals
+ * "shadow" and "on" activate; every other value (including unset/empty) is off.
+ */
+export function outcomeQuestionsMode() {
+    const value = process.env.OUTCOME_QUESTIONS_MODE?.trim();
+    return value === "shadow" || value === "on" ? value : "off";
+}
+/**
+ * True when Lens B capture + mining should run at all. Both "shadow" and "on"
+ * activate the shadow pipeline; only the future question-emitting behavior is
+ * gated on "on" (not part of this slice).
+ */
+export function isOutcomeQuestionsActivated() {
+    return outcomeQuestionsMode() !== "off";
+}
+/**
+ * Independent-support threshold (k). Every compared group (discriminator side)
+ * must have at least this many INDEPENDENT (related-opportunity-deduplicated)
+ * examples before the hypothesis is eligible. Enforced per side, so no side
+ * can be traced back to a small handful of individuals.
+ */
+export const OUTCOME_MIN_INDEPENDENT_SUPPORT = 5;
+/** Minimum number of qualified sides (each ≥ k) for a hypothesis to compare. */
+export const OUTCOME_MIN_COMPARED_SIDES = 2;
+/**
+ * k-anonymity floor for attempting a mining pass at all: the number of
+ * distinct independent examples (after related-opportunity dedup) required
+ * before the miner is invoked. Set to k × minimum compared sides so a pass can
+ * never produce an eligible hypothesis below the aggregate floor.
+ */
+export const OUTCOME_MIN_INDEPENDENT_EXAMPLES = OUTCOME_MIN_INDEPENDENT_SUPPORT * OUTCOME_MIN_COMPARED_SIDES;
+/** Max independent examples sent to the miner LLM (most recent first). */
+export const OUTCOME_MAX_CANDIDATES = 48;
+/** Max chars of presentation-safe candidate snapshot stored/sent per example. */
+export const OUTCOME_MAX_PUBLIC_CONTEXT_CHARS = 400;
+//# sourceMappingURL=outcome.env.js.map

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,30 @@
+/**
+ * Lens B outcome join + threshold — pure functions, no LLM, no I/O (IND-434).
+ *
+ * Given discriminators whose candidate → side assignments were produced BLIND
+ * to outcome (the miner never saw which side the user chose), this module joins
+ * the explicit owner-outcome labels and produces aggregate-only telemetry:
+ *
+ *   - Independence: capture admits only one unique counterpart per opportunity;
+ *     the caller then deduplicates by that recipient-scoped counterpart hash.
+ *     Every retained entry therefore represents one distinct counterpart.
+ *   - Threshold: a discriminator side is "qualified" only when it holds at
+ *     least `minIndependentSupport` (k) independent examples. A hypothesis is
+ *     eligible only when at least `minComparedSides` sides qualify.
+ *   - Small-cell suppression: only qualified sides (≥ k) are ever emitted, so
+ *     no aggregate row can be traced to a small handful of individuals.
+ *
+ * The outcome label is joined here and ONLY here — the miner and the side
+ * assignments upstream are independent of it, so association can never leak
+ * into classification.
+ */
+import type { JoinOutcomeHypothesesInput, OutcomeShadowResult } from "./outcome.types.js";
+/**
+ * Join outcome labels onto blind side assignments and keep only hypotheses that
+ * clear the independent-support threshold on at least `minComparedSides` sides.
+ *
+ * @returns Aggregate telemetry: eligible hypotheses sorted by (min support desc,
+ *   label asc) for deterministic ordering, each carrying only qualified sides.
+ */
+export declare function joinOutcomeHypotheses(input: JoinOutcomeHypothesesInput): OutcomeShadowResult;
+//# sourceMappingURL=outcome.hypotheses.d.ts.map

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,118 @@
+/**
+ * Lens B outcome join + threshold — pure functions, no LLM, no I/O (IND-434).
+ *
+ * Given discriminators whose candidate → side assignments were produced BLIND
+ * to outcome (the miner never saw which side the user chose), this module joins
+ * the explicit owner-outcome labels and produces aggregate-only telemetry:
+ *
+ *   - Independence: capture admits only one unique counterpart per opportunity;
+ *     the caller then deduplicates by that recipient-scoped counterpart hash.
+ *     Every retained entry therefore represents one distinct counterpart.
+ *   - Threshold: a discriminator side is "qualified" only when it holds at
+ *     least `minIndependentSupport` (k) independent examples. A hypothesis is
+ *     eligible only when at least `minComparedSides` sides qualify.
+ *   - Small-cell suppression: only qualified sides (≥ k) are ever emitted, so
+ *     no aggregate row can be traced to a small handful of individuals.
+ *
+ * The outcome label is joined here and ONLY here — the miner and the side
+ * assignments upstream are independent of it, so association can never leak
+ * into classification.
+ */
+import { OUTCOME_MIN_COMPARED_SIDES, OUTCOME_MIN_INDEPENDENT_SUPPORT } from "./outcome.env.js";
+/** Round a rate to 0.01 for telemetry (never a raw count). */
+function roundRate(n) {
+    return Math.round(n * 100) / 100;
+}
+/**
+ * Join outcome labels onto blind side assignments and keep only hypotheses that
+ * clear the independent-support threshold on at least `minComparedSides` sides.
+ *
+ * @returns Aggregate telemetry: eligible hypotheses sorted by (min support desc,
+ *   label asc) for deterministic ordering, each carrying only qualified sides.
+ */
+export function joinOutcomeHypotheses(input) {
+    const minSupport = input.minIndependentSupport ?? OUTCOME_MIN_INDEPENDENT_SUPPORT;
+    const minSides = input.minComparedSides ?? OUTCOME_MIN_COMPARED_SIDES;
+    // Distinct independent examples with a joinable outcome label.
+    const poolSize = input.examples.size;
+    const hypotheses = [];
+    for (const discriminator of input.discriminators) {
+        // Normalize sides by trimming, then reject the ENTIRE discriminator if any
+        // side is empty or if labels are not unique after normalization. Silently
+        // deduplicating malformed model output would turn an ambiguous comparison
+        // into apparently valid evidence.
+        const normalizedSides = discriminator.sides.map((side) => side.trim());
+        if (normalizedSides.some((side) => side.length === 0))
+            continue;
+        if (new Set(normalizedSides).size !== normalizedSides.length)
+            continue;
+        if (normalizedSides.length < minSides)
+            continue;
+        const validSides = new Set(normalizedSides);
+        // First normalize VERIFIED, labelled assignments by candidate id. If the
+        // same independent example is assigned to different sides, mark it
+        // ambiguous and exclude it from every side; it must never support two cells.
+        const sideById = new Map();
+        const ambiguousIds = new Set();
+        for (const assignment of discriminator.assignments) {
+            if (assignment.side === null || !assignment.verified)
+                continue;
+            const side = assignment.side.trim();
+            if (!validSides.has(side) || !input.examples.has(assignment.id))
+                continue;
+            const previous = sideById.get(assignment.id);
+            if (previous !== undefined && previous !== side)
+                ambiguousIds.add(assignment.id);
+            else if (previous === undefined)
+                sideById.set(assignment.id, side);
+        }
+        // Tally DISTINCT independent example ids per unambiguous side. Repeating
+        // the same assignment never increases support.
+        const idsBySide = new Map();
+        const acceptedIdsBySide = new Map();
+        for (const [id, side] of sideById) {
+            if (ambiguousIds.has(id))
+                continue;
+            const label = input.examples.get(id);
+            if (label === undefined)
+                continue;
+            if (!idsBySide.has(side))
+                idsBySide.set(side, new Set());
+            idsBySide.get(side).add(id);
+            if (label === "accepted") {
+                if (!acceptedIdsBySide.has(side))
+                    acceptedIdsBySide.set(side, new Set());
+                acceptedIdsBySide.get(side).add(id);
+            }
+        }
+        // Keep only sides that clear the independent-support threshold (>= k
+        // genuinely distinct independent examples).
+        const qualifiedSides = [];
+        for (const side of normalizedSides) {
+            const support = idsBySide.get(side)?.size ?? 0;
+            if (support < minSupport)
+                continue; // small-cell: never emitted
+            const accepted = acceptedIdsBySide.get(side)?.size ?? 0;
+            qualifiedSides.push({
+                side,
+                independentSupport: support,
+                acceptRate: roundRate(accepted / support),
+            });
+        }
+        if (qualifiedSides.length < minSides)
+            continue; // not enough to compare
+        // Deterministic side ordering: support desc, then label asc.
+        qualifiedSides.sort((a, b) => b.independentSupport - a.independentSupport || a.side.localeCompare(b.side));
+        hypotheses.push({
+            label: discriminator.label,
+            questionSeed: discriminator.questionSeed,
+            sides: qualifiedSides,
+            evidenceRate: discriminator.evidenceRate,
+            minIndependentSupport: Math.min(...qualifiedSides.map((s) => s.independentSupport)),
+        });
+    }
+    // Deterministic hypothesis ordering: strongest support first, then label.
+    hypotheses.sort((a, b) => b.minIndependentSupport - a.minIndependentSupport || a.label.localeCompare(b.label));
+    return { poolSize, eligibleCount: hypotheses.length, hypotheses };
+}
+//# sourceMappingURL=outcome.hypotheses.js.map

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,57 @@
+/**
+ * Lens B shadow orchestrator (IND-434): deduplicate related opportunities,
+ * mine neutral axes over the deduplicated historical pool BLIND to outcome,
+ * then join the owner-outcome labels and threshold the result.
+ *
+ * No persistence, no questions, no UI. The output is consumed only by aggregate
+ * telemetry for human review.
+ *
+ * Pipeline:
+ *   1. Dedup related opportunities: collapse examples sharing a dedup key to a
+ *      single representative (most recent), so a cluster of related opps can
+ *      neither dominate the miner nor inflate a side's independent support.
+ *   2. Cap to the most recent OUTCOME_MAX_CANDIDATES for a bounded LLM pass.
+ *   3. Build the miner pool — PoolCandidate carries id + publicContext + score
+ *      and, critically, NO outcome label. The miner is structurally blind.
+ *   4. Mine neutral axes + assign candidates (evidence-verified).
+ *   5. Join outcome labels (only now) and apply the k-support threshold.
+ */
+import type { PoolDiscriminatorMiner } from "../discriminator/discriminator.miner.js";
+import type { OutcomeExample, OutcomeShadowResult } from "./outcome.types.js";
+/** Input for one Lens B shadow mining+join pass. */
+export interface OutcomeShadowInput {
+    /**
+     * Intent payload (+ summary) text that owns this scope. Used only as miner
+     * context; never mixed with outcome labels.
+     */
+    intentText: string;
+    /**
+     * Captured owner-outcome examples for exactly one recipient + intent +
+     * fingerprint scope. Each carries a presentation-safe snapshot and a dedup
+     * key; outcome labels live here but are withheld from the miner.
+     */
+    examples: OutcomeExample[];
+    miner: Pick<PoolDiscriminatorMiner, "mine">;
+    /** Override the independent-support threshold (defaults to k). */
+    minIndependentSupport?: number;
+    /** Override the minimum qualified sides. */
+    minComparedSides?: number;
+    /** Override the LLM candidate cap. */
+    maxCandidates?: number;
+    signal?: AbortSignal;
+}
+/**
+ * Collapse related opportunities to independent examples: one representative
+ * (most recent by occurredAt) per distinct dedup key. Deterministic — ties on
+ * occurredAt fall back to opportunityId ordering.
+ */
+export declare function deduplicateOutcomeExamples(examples: OutcomeExample[]): OutcomeExample[];
+/**
+ * Run the Lens B shadow pipeline for one scope.
+ *
+ * Throws only when *mining* fails (callers are fire-and-forget and must catch).
+ * A pool that is empty or below the compare floor after dedup returns an empty
+ * result rather than throwing.
+ */
+export declare function runOutcomeShadow(input: OutcomeShadowInput): Promise<OutcomeShadowResult>;
+//# sourceMappingURL=outcome.shadow.d.ts.map

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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,88 @@
+/**
+ * Lens B shadow orchestrator (IND-434): deduplicate related opportunities,
+ * mine neutral axes over the deduplicated historical pool BLIND to outcome,
+ * then join the owner-outcome labels and threshold the result.
+ *
+ * No persistence, no questions, no UI. The output is consumed only by aggregate
+ * telemetry for human review.
+ *
+ * Pipeline:
+ *   1. Dedup related opportunities: collapse examples sharing a dedup key to a
+ *      single representative (most recent), so a cluster of related opps can
+ *      neither dominate the miner nor inflate a side's independent support.
+ *   2. Cap to the most recent OUTCOME_MAX_CANDIDATES for a bounded LLM pass.
+ *   3. Build the miner pool — PoolCandidate carries id + publicContext + score
+ *      and, critically, NO outcome label. The miner is structurally blind.
+ *   4. Mine neutral axes + assign candidates (evidence-verified).
+ *   5. Join outcome labels (only now) and apply the k-support threshold.
+ */
+import { protocolLogger } from "../../shared/observability/protocol.logger.js";
+import { OUTCOME_MAX_CANDIDATES, OUTCOME_MIN_COMPARED_SIDES, OUTCOME_MIN_INDEPENDENT_SUPPORT } from "./outcome.env.js";
+import { joinOutcomeHypotheses } from "./outcome.hypotheses.js";
+const logger = protocolLogger("OutcomeQuestionShadow");
+/**
+ * Collapse related opportunities to independent examples: one representative
+ * (most recent by occurredAt) per distinct dedup key. Deterministic — ties on
+ * occurredAt fall back to opportunityId ordering.
+ */
+export function deduplicateOutcomeExamples(examples) {
+    const byKey = new Map();
+    for (const example of examples) {
+        const existing = byKey.get(example.dedupKey);
+        if (existing === undefined) {
+            byKey.set(example.dedupKey, example);
+            continue;
+        }
+        const newer = example.occurredAt > existing.occurredAt ||
+            (example.occurredAt === existing.occurredAt && example.opportunityId > existing.opportunityId);
+        if (newer)
+            byKey.set(example.dedupKey, example);
+    }
+    return [...byKey.values()].sort((a, b) => b.occurredAt.localeCompare(a.occurredAt) || a.opportunityId.localeCompare(b.opportunityId));
+}
+/**
+ * Run the Lens B shadow pipeline for one scope.
+ *
+ * Throws only when *mining* fails (callers are fire-and-forget and must catch).
+ * A pool that is empty or below the compare floor after dedup returns an empty
+ * result rather than throwing.
+ */
+export async function runOutcomeShadow(input) {
+    const minSupport = input.minIndependentSupport ?? OUTCOME_MIN_INDEPENDENT_SUPPORT;
+    const minSides = input.minComparedSides ?? OUTCOME_MIN_COMPARED_SIDES;
+    const maxCandidates = input.maxCandidates ?? OUTCOME_MAX_CANDIDATES;
+    // 1–2. Dedup related opportunities, then cap to a bounded, recent pool.
+    const independent = deduplicateOutcomeExamples(input.examples).slice(0, maxCandidates);
+    if (independent.length < minSupport * minSides) {
+        return { poolSize: independent.length, eligibleCount: 0, hypotheses: [] };
+    }
+    // 3. Build the miner pool with RUN-LOCAL aliases (c0, c1, …) as candidate ids
+    //    — raw opportunity ids are never sent to the LLM. The alias→outcome map is
+    //    kept internally for the join. PoolCandidate deliberately excludes the
+    //    outcome label, so the miner cannot condition on which side was chosen.
+    const aliased = independent.map((example, index) => ({ alias: `c${index}`, example }));
+    const candidates = aliased.map(({ alias, example }) => ({
+        id: alias,
+        publicContext: example.publicContext,
+        score: example.score ?? 1,
+    }));
+    // 4. Blind assignment (assignments come back keyed by the run-local alias).
+    const mined = await input.miner.mine({ intentText: input.intentText, candidates }, input.signal ? { signal: input.signal } : undefined);
+    if (mined.length === 0) {
+        return { poolSize: independent.length, eligibleCount: 0, hypotheses: [] };
+    }
+    // 5. Join outcome labels (only now) by alias, and threshold.
+    const examples = new Map(aliased.map(({ alias, example }) => [alias, example.label]));
+    const result = joinOutcomeHypotheses({
+        discriminators: mined,
+        examples,
+        minIndependentSupport: minSupport,
+        minComparedSides: minSides,
+    });
+    logger.debug("shadow join complete", {
+        poolSize: result.poolSize,
+        eligibleCount: result.eligibleCount,
+    });
+    return result;
+}
+//# sourceMappingURL=outcome.shadow.js.map