@indexnetwork/protocol 6.12.1-rc.404.1 → 6.14.0-rc.406.1

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

@@ -1 +0,0 @@
-{"version":3,"file":"network.state.d.ts","sourceRoot":"/","sources":["network/network.state.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,eAAO,MAAM,iBAAiB;IAG5B,mDAAmD;;;;;;IAGnD,sFAAsF;;IAMtF,sBAAsB;;IAQtB,4CAA4C;;eAEnC,MAAM;iBACJ,MAAM;mBACJ,MAAM,GAAG,IAAI;qBACX,QAAQ,GAAG,aAAa;;eAH9B,MAAM;iBACJ,MAAM;mBACJ,MAAM,GAAG,IAAI;qBACX,QAAQ,GAAG,aAAa;;eAH9B,MAAM;iBACJ,MAAM;mBACJ,MAAM,GAAG,IAAI;qBACX,QAAQ,GAAG,aAAa;;IAMvC,yCAAyC;;gBAE/B,MAAM;iBACL,MAAM,GAAG,IAAI;mBACX,MAAM,GAAG,IAAI;qBACX,QAAQ,GAAG,aAAa;8BACf,OAAO;;gBAJrB,MAAM;iBACL,MAAM,GAAG,IAAI;mBACX,MAAM,GAAG,IAAI;qBACX,QAAQ,GAAG,aAAa;8BACf,OAAO;;gBAJrB,MAAM;iBACL,MAAM,GAAG,IAAI;mBACX,MAAM,GAAG,IAAI;qBACX,QAAQ,GAAG,aAAa;8BACf,OAAO;;IAM/B,yFAAyF;;IAQzF,4BAA4B;;kBAEhB,KAAK,CAAC;YACd,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,UAAU,EAAE,OAAO,CAAC;YACpB,UAAU,EAAE,OAAO,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC;SAChB,CAAC;cACI,KAAK,CAAC;YACV,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,WAAW,EAAE,MAAM,CAAC;YACpB,WAAW,EAAE,MAAM,CAAC;YACpB,UAAU,EAAE,MAAM,CAAC;SACpB,CAAC;yBACe,KAAK,CAAC;YACrB,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,WAAW,EAAE,MAAM,CAAC;YACpB,KAAK,EAAE;gBAAE,IAAI,EAAE,MAAM,CAAC;gBAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;aAAE,GAAG,IAAI,CAAC;SACvD,CAAC;eACK;YACL,aAAa,EAAE,MAAM,CAAC;YACtB,SAAS,EAAE,MAAM,CAAC;YAClB,mBAAmB,CAAC,EAAE,MAAM,CAAC;YAC7B,SAAS,CAAC,EAAE,MAAM,CAAC;SACpB;;kBA5BS,KAAK,CAAC;YACd,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,UAAU,EAAE,OAAO,CAAC;YACpB,UAAU,EAAE,OAAO,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC;SAChB,CAAC;cACI,KAAK,CAAC;YACV,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,WAAW,EAAE,MAAM,CAAC;YACpB,WAAW,EAAE,MAAM,CAAC;YACpB,UAAU,EAAE,MAAM,CAAC;SACpB,CAAC;yBACe,KAAK,CAAC;YACrB,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,WAAW,EAAE,MAAM,CAAC;YACpB,KAAK,EAAE;gBAAE,IAAI,EAAE,MAAM,CAAC;gBAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;aAAE,GAAG,IAAI,CAAC;SACvD,CAAC;eACK;YACL,aAAa,EAAE,MAAM,CAAC;YACtB,SAAS,EAAE,MAAM,CAAC;YAClB,mBAAmB,CAAC,EAAE,MAAM,CAAC;YAC7B,SAAS,CAAC,EAAE,MAAM,CAAC;SACpB;;kBA5BS,KAAK,CAAC;YACd,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,UAAU,EAAE,OAAO,CAAC;YACpB,UAAU,EAAE,OAAO,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC;SAChB,CAAC;cACI,KAAK,CAAC;YACV,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,WAAW,EAAE,MAAM,CAAC;YACpB,WAAW,EAAE,MAAM,CAAC;YACpB,UAAU,EAAE,MAAM,CAAC;SACpB,CAAC;yBACe,KAAK,CAAC;YACrB,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,CAAC;YACd,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;YACtB,WAAW,EAAE,MAAM,CAAC;YACpB,KAAK,EAAE;gBAAE,IAAI,EAAE,MAAM,CAAC;gBAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;aAAE,GAAG,IAAI,CAAC;SACvD,CAAC;eACK;YACL,aAAa,EAAE,MAAM,CAAC;YACtB,SAAS,EAAE,MAAM,CAAC;YAClB,mBAAmB,CAAC,EAAE,MAAM,CAAC;YAC7B,SAAS,CAAC,EAAE,MAAM,CAAC;SACpB;;IAMH,6CAA6C;;iBAElC,OAAO;oBACJ,MAAM;gBACV,MAAM;kBACJ,MAAM;gBACR,MAAM;;iBAJL,OAAO;oBACJ,MAAM;gBACV,MAAM;kBACJ,MAAM;gBACR,MAAM;;iBAJL,OAAO;oBACJ,MAAM;gBACV,MAAM;kBACJ,MAAM;gBACR,MAAM;;IAMhB,iDAAiD;;EAKjD,CAAC"}

package/dist/network/network.state.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"network.state.js","sourceRoot":"/","sources":["network/network.state.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAElD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,UAAU,CAAC,IAAI,CAAC;IAC/C,uDAAuD;IAEvD,mDAAmD;IACnD,MAAM,EAAE,CAAA,UAAkB,CAAA;IAE1B,sFAAsF;IACtF,SAAS,EAAE,UAAU,CAAqB;QACxC,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC1B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,sBAAsB;IACtB,aAAa,EAAE,UAAU,CAA0C;QACjE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,IAAI;QACrC,OAAO,EAAE,GAAG,EAAE,CAAC,MAAe;KAC/B,CAAC;IAEF,+BAA+B;IAE/B,4CAA4C;IAC5C,WAAW,EAAE,UAAU,CAKR;QACb,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC1B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,yCAAyC;IACzC,WAAW,EAAE,UAAU,CAMR;QACb,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC1B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,yFAAyF;IACzF,OAAO,EAAE,UAAU,CAAU;QAC3B,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC1B,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK;KACrB,CAAC;IAEF,kBAAkB;IAElB,4BAA4B;IAC5B,UAAU,EAAE,UAAU,CA8BP;QACb,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC1B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,6CAA6C;IAC7C,cAAc,EAAE,UAAU,CAMX;QACb,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC1B,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS;KACzB,CAAC;IAEF,iDAAiD;IACjD,KAAK,EAAE,UAAU,CAAgB;QAC/B,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI;QAC1B,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI;KACpB,CAAC;CACH,CAAC,CAAC","sourcesContent":["import { Annotation } from \"@langchain/langgraph\";\n\n/**\n * Network Graph State.\n * Handles CRUD operations for indexes (communities).\n *\n * Flow:\n * START → routerNode → {createNode | readNode | updateNode | deleteNode} → END\n */\nexport const NetworkGraphState = Annotation.Root({\n  // --- Core Inputs (from ChatGraph via ToolContext) ---\n\n  /** User performing the action. Always required. */\n  userId: Annotation<string>,\n\n  /** Target network ID. Required for read/update/delete. From ChatGraph or tool arg. */\n  networkId: Annotation<string | undefined>({\n    reducer: (_, next) => next,\n    default: () => undefined,\n  }),\n\n  /** Operation mode. */\n  operationMode: Annotation<'create' | 'read' | 'update' | 'delete'>({\n    reducer: (curr, next) => next ?? curr,\n    default: () => 'read' as const,\n  }),\n\n  // --- Mode-Specific Inputs ---\n\n  /** For create mode: index creation data. */\n  createInput: Annotation<{\n    title: string;\n    prompt?: string;\n    imageUrl?: string | null;\n    joinPolicy?: 'anyone' | 'invite_only';\n  } | undefined>({\n    reducer: (_, next) => next,\n    default: () => undefined,\n  }),\n\n  /** For update mode: fields to update. */\n  updateInput: Annotation<{\n    title?: string;\n    prompt?: string | null;\n    imageUrl?: string | null;\n    joinPolicy?: 'anyone' | 'invite_only';\n    allowGuestVibeCheck?: boolean;\n  } | undefined>({\n    reducer: (_, next) => next,\n    default: () => undefined,\n  }),\n\n  /** When true and network-scoped, read returns all user indexes (not just scoped one). */\n  showAll: Annotation<boolean>({\n    reducer: (_, next) => next,\n    default: () => false,\n  }),\n\n  // --- Outputs ---\n\n  /** Output for read mode. */\n  readResult: Annotation<{\n    memberOf: Array<{\n      networkId: string;\n      title: string;\n      prompt: string | null;\n      autoAssign: boolean;\n      isPersonal: boolean;\n      joinedAt: Date;\n    }>;\n    owns: Array<{\n      networkId: string;\n      title: string;\n      prompt: string | null;\n      memberCount: number;\n      intentCount: number;\n      joinPolicy: string;\n    }>;\n    publicNetworks?: Array<{\n      networkId: string;\n      title: string;\n      prompt: string | null;\n      memberCount: number;\n      owner: { name: string; avatar: string | null } | null;\n    }>;\n    stats: {\n      memberOfCount: number;\n      ownsCount: number;\n      publicNetworksCount?: number;\n      scopeNote?: string;\n    };\n  } | undefined>({\n    reducer: (_, next) => next,\n    default: () => undefined,\n  }),\n\n  /** Output for create/update/delete modes. */\n  mutationResult: Annotation<{\n    success: boolean;\n    networkId?: string;\n    title?: string;\n    message?: string;\n    error?: string;\n  } | undefined>({\n    reducer: (_, next) => next,\n    default: () => undefined,\n  }),\n\n  /** Error message if graph could not complete. */\n  error: Annotation<string | null>({\n    reducer: (_, next) => next,\n    default: () => null,\n  }),\n});\n"]}

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

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

package/dist/network/network.tools.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"network.tools.js","sourceRoot":"/","sources":["network/network.tools.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,cAAc,EAAE,MAAM,4CAA4C,CAAC;AAC5E,OAAO,EAAE,GAAG,EAAE,MAAM,gCAAgC,CAAC;AACrD,OAAO,EAAE,oBAAoB,EAAE,MAAM,wCAAwC,CAAC;AAG9E,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AAC7E,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAE9D,8EAA8E;AAC9E,0EAA0E;AAC1E,IAAI,WAA2C,CAAC;AAEhD,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;AAEtD,MAAM,UAAU,kBAAkB,CAAC,UAAsB,EAAE,IAAc;IACvE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IAE1C,MAAM,iBAAiB,GAAG,CAAC,QAAwC,EAAE,EAAE,CACrE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnB,GAAG,CAAC;QACJ,eAAe,EAAE,oBAAoB,CAAC;YACpC,IAAI,EAAG,CAAC,CAAC,IAAe,IAAI,WAAW;YACvC,KAAK,EAAG,CAAC,CAAC,KAAgB,IAAI,EAAE;YAChC,MAAM,EAAE,CAAC,CAAC,MAA4B;YACtC,QAAQ,EAAG,CAAC,CAAC,QAAoC,IAAI,EAAE;SACxD,CAAC;KACH,CAAC,CAAC,CAAC;IAEN,MAAM,WAAW,GAAG,UAAU,CAAC;QAC7B,IAAI,EAAE,eAAe;QACrB,WAAW,EACT,0HAA0H;YAC1H,sIAAsI;YACtI,2DAA2D;YAC3D,mIAAmI;YACnI,2IAA2I;YAC3I,uBAAuB;YACvB,iHAAiH;YACjH,4KAA4K;QAC9K,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,+EAA+E,CAAC;SACxH,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC3D,OAAO,KAAK,CAAC,oFAAoF,CAAC,CAAC;YACrG,CAAC;YAED,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACxC,MAAM,sBAAsB,GAAG,cAAc,CAAC,QAAQ,EAAE,EAAE,YAAY,CAAC;YACvE,sBAAsB,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YACjE,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBACvC,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,SAAS;gBACzC,aAAa,EAAE,MAAe;gBAC9B,OAAO,EAAE,KAAK,EAAE,gDAAgD;aACjE,CAAC,CAAC;YACH,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,oBAAoB,CAAC;YAC5D,sBAAsB,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,CAAC,CAAC;YAE9F,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACjB,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YACD,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;gBACtB,MAAM,EAAE,GAAG,MAAM,CAAC,UAAqC,CAAC;gBACxD,MAAM,QAAQ,GAAG;oBACf,GAAG,EAAE;oBACL,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,iBAAiB,CAAC,EAAE,CAAC,QAA0C,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrH,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,iBAAiB,CAAC,EAAE,CAAC,IAAsC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzG,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,iBAAiB,CAAC,EAAE,CAAC,cAAgD,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBACxI,CAAC;gBAEF,qEAAqE;gBACrE,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;oBACtB,OAAO,OAAO,CAAC;wBACb,GAAG,QAAQ;wBACX,gBAAgB,EAAE;4BAChB,QAAQ,EAAE,IAAI;4BACd,aAAa,EAAE,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS;4BACrD,OAAO,EAAE,2BAA2B,OAAO,CAAC,SAAS,IAAI,cAAc,2GAA2G;yBACnL;wBACD,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;qBACrG,CAAC,CAAC;gBACL,CAAC;gBACD,0EAA0E;gBAC1E,4EAA4E;gBAC5E,0EAA0E;gBAC1E,6EAA6E;gBAC7E,IAAI,iBAAuC,CAAC;gBAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjG,IACE,OAAO,CAAC,YAAY;oBACpB,WAAW;oBACX,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC;oBACrC,QAAQ,CAAC,cAAiD,CAAC,MAAM,GAAG,CAAC,EACtE,CAAC;oBACD,+FAA+F;oBAC/F,MAAM,wBAAwB,GAAI,QAAQ,CAAC,cAAiD;yBACzF,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;yBACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBACX,SAAS,EAAE,CAAC,CAAC,SAAmB;wBAChC,eAAe,EAAG,CAAC,CAAC,eAA0B,IAAI,MAAM,CAAC,CAAC,KAAe,EAAE;qBAC5E,CAAC,CAAC,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;wBACpD,IAAI,CAAC;4BACH,WAAW,KAAX,WAAW,GAAK,IAAI,kBAAkB,EAAE,EAAC;4BACzC,OAAO,MAAM,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBACzC,CAAC;wBAAC,OAAO,GAAG,EAAE,CAAC;4BACb,+EAA+E;4BAC/E,MAAM,CAAC,IAAI,CAAC,iEAAiE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;4BAC/F,OAAO,IAAI,CAAC;wBACd,CAAC;oBACH,CAAC,CAAC,CAAC;oBACH,MAAM,aAAa,GAAG,MAAM,MAAM,CAAC;wBACjC,WAAW;wBACX,QAAQ,EAAE,wBAAwB;qBACnC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;wBACxB,wEAAwE;wBACxE,kFAAkF;wBAClF,MAAM,CAAC,IAAI,CAAC,sDAAsD,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;wBACpF,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;wBACjH,OAAO,IAAI,CAAC;oBACd,CAAC,CAAC,CAAC;oBACH,IAAI,aAAa,EAAE,CAAC;wBAClB,0DAA0D;wBAC1D,mEAAmE;wBACnE,qEAAqE;wBACrE,sEAAsE;wBACtE,6DAA6D;wBAC7D,MAAM,QAAQ,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;wBAClE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACrC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;wBAC/B,MAAM,UAAU,GAAa,EAAE,CAAC;wBAChC,KAAK,MAAM,EAAE,IAAI,aAAa,CAAC,gBAAgB,EAAE,CAAC;4BAChD,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gCACxC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gCACpB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;4BACf,CAAC;wBACH,CAAC;wBACD,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;4BAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gCAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACzC,CAAC;wBACD,iBAAiB,GAAG,UAAU,CAAC;oBACjC,CAAC;gBACH,CAAC;gBAED,OAAO,OAAO,CAAC;oBACb,GAAG,QAAQ;oBACX,GAAG,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjE,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;iBACrG,CAAC,CAAC;YACL,CAAC;YACD,OAAO,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACrD,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,oBAAoB,GAAG,UAAU,CAAC;QACtC,IAAI,EAAE,0BAA0B;QAChC,WAAW,EACT,wHAAwH;YACxH,kDAAkD;YAClD,oBAAoB;YACpB,kJAAkJ;YAClJ,iGAAiG;YACjG,8IAA8I;YAC9I,4IAA4I;YAC5I,2HAA2H;YAC3H,wDAAwD;YACxD,sHAAsH;YACtH,4GAA4G;YAC5G,6GAA6G;YAC7G,0CAA0C;YAC1C,oGAAoG;YACpG,sGAAsG;YACtG,gGAAgG;YAChG,wGAAwG;YACxG,uCAAuC;QACzC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,0IAA0I,CAAC;YACrL,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,2KAA2K,CAAC;SACpN,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,SAAS,CAAC;YACvD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,SAAS,CAAC;YAEjD,IAAI,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7C,OAAO,KAAK,CAAC,mEAAmE,CAAC,CAAC;YACpF,CAAC;YAED,mCAAmC;YACnC,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,CAAC;gBACzB,oFAAoF;gBACpF,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,KAAK,OAAO,CAAC,SAAS,EAAE,CAAC;oBACzD,OAAO,KAAK,CACV,0BAA0B,OAAO,CAAC,SAAS,IAAI,cAAc,+CAA+C,CAC7G,CAAC;gBACJ,CAAC;gBAED,MAAM,sBAAsB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC1C,MAAM,wBAAwB,GAAG,cAAc,CAAC,QAAQ,EAAE,EAAE,YAAY,CAAC;gBACzE,wBAAwB,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC,CAAC;gBAChF,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;oBACnD,MAAM,EAAE,OAAO,CAAC,MAAM;oBACtB,SAAS;oBACT,aAAa,EAAE,MAAe;iBAC/B,CAAC,CAAC;gBACH,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,sBAAsB,CAAC;gBAChE,wBAAwB,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,oBAAoB,EAAE,UAAU,EAAE,mBAAmB,EAAE,CAAC,CAAC;gBAE/G,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;oBACjB,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC7B,CAAC;gBACD,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;oBACtB,OAAO,OAAO,CAAC,EAAE,GAAG,MAAM,CAAC,UAAU,EAAE,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,UAAU,EAAE,mBAAmB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAChK,CAAC;gBACD,OAAO,KAAK,CAAC,kCAAkC,CAAC,CAAC;YACnD,CAAC;YAED,6DAA6D;YAC7D,MAAM,YAAY,GAAG,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC;YAE9C,+FAA+F;YAC/F,IAAI,WAAqE,CAAC;YAC1E,IAAI,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;gBACpC,sEAAsE;gBACtE,MAAM,iBAAiB,GAAG,MAAM,MAAM,CAAC,qBAAqB,EAAE,CAAC;gBAC/D,IAAI,SAAS,EAAE,CAAC;oBACd,wFAAwF;oBACxF,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,KAAK,OAAO,CAAC,SAAS,EAAE,CAAC;wBACzD,OAAO,KAAK,CACV,0BAA0B,OAAO,CAAC,SAAS,IAAI,cAAc,oDAAoD,CAClH,CAAC;oBACJ,CAAC;oBAED,MAAM,aAAa,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;oBAC/E,IAAI,CAAC,aAAa,EAAE,CAAC;wBACnB,OAAO,KAAK,CACV,mJAAmJ,CACpJ,CAAC;oBACJ,CAAC;oBACD,kEAAkE;oBAClE,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,eAAe,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;oBACzE,IAAI,QAAQ,EAAE,CAAC;wBACb,OAAO,OAAO,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC;oBACtE,CAAC;oBACD,OAAO,OAAO,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,uCAAuC,EAAE,CAAC,CAAC;gBACzH,CAAC;qBAAM,CAAC;oBACN,qFAAqF;oBACrF,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;wBACtB,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;wBACjF,IAAI,QAAQ,EAAE,CAAC;4BACb,OAAO,OAAO,CAAC;gCACb,QAAQ,EAAE,IAAI;gCACd,MAAM,EAAE,YAAY;gCACpB,SAAS,EAAE,OAAO,CAAC,SAAS;gCAC5B,gBAAgB,EAAE;oCAChB,QAAQ,EAAE,IAAI;oCACd,aAAa,EAAE,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS;oCACrD,OAAO,EAAE,2BAA2B,OAAO,CAAC,SAAS,IAAI,cAAc,gDAAgD;iCACxH;6BACF,CAAC,CAAC;wBACL,CAAC;wBACD,OAAO,OAAO,CAAC;4BACb,QAAQ,EAAE,KAAK;4BACf,MAAM,EAAE,YAAY;4BACpB,SAAS,EAAE,OAAO,CAAC,SAAS;4BAC5B,OAAO,EAAE,yCAAyC;4BAClD,gBAAgB,EAAE;gCAChB,QAAQ,EAAE,IAAI;gCACd,aAAa,EAAE,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS;gCACrD,OAAO,EAAE,2BAA2B,OAAO,CAAC,SAAS,IAAI,cAAc,mDAAmD;6BAC3H;yBACF,CAAC,CAAC;oBACL,CAAC;oBAED,mGAAmG;oBACnG,MAAM,aAAa,GAA6B,EAAE,CAAC;oBACnD,KAAK,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;wBAClC,IAAI,MAAM,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,EAAE,CAAC;4BAC9D,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACxB,CAAC;oBACH,CAAC;oBACD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAC/B,OAAO,KAAK,CACV,8HAA8H,CAC/H,CAAC;oBACJ,CAAC;oBACD,0CAA0C;oBAC1C,OAAO,OAAO,CAAC;wBACb,MAAM,EAAE,YAAY;wBACpB,KAAK,EAAE,aAAa,CAAC,MAAM;wBAC3B,WAAW,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;4BACrC,SAAS,EAAE,CAAC,CAAC,SAAS;4BACtB,YAAY,EAAE,CAAC,CAAC,YAAY;yBAC7B,CAAC,CAAC;wBACH,IAAI,EAAE,+BAA+B;qBACtC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,+BAA+B;gBAC/B,WAAW,GAAG,MAAM,MAAM,CAAC,qBAAqB,EAAE,CAAC;gBAEnD,8EAA8E;gBAC9E,0EAA0E;gBAC1E,gFAAgF;gBAChF,mGAAmG;gBACnG,IAAI,OAAO,CAAC,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;oBACpC,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC7E,CAAC;YACH,CAAC;YAED,mEAAmE;YACnE,IAAI,SAAS,EAAE,CAAC;gBACd,wFAAwF;gBACxF,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,KAAK,OAAO,CAAC,SAAS,EAAE,CAAC;oBACzD,OAAO,KAAK,CACV,0BAA0B,OAAO,CAAC,SAAS,IAAI,cAAc,oDAAoD,CAClH,CAAC;gBACJ,CAAC;gBAED,MAAM,iBAAiB,GAAG,MAAM,MAAM,CAAC,qBAAqB,EAAE,CAAC;gBAC/D,MAAM,aAAa,GACjB,YAAY,KAAK,OAAO,CAAC,MAAM;oBAC/B,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;gBAC3D,IAAI,CAAC,aAAa,EAAE,CAAC;oBACnB,OAAO,KAAK,CACV,uEAAuE,CACxE,CAAC;gBACJ,CAAC;gBACD,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;gBACjE,IAAI,CAAC,KAAK,EAAE,CAAC;oBACX,OAAO,OAAO,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,uCAAuC,EAAE,CAAC,CAAC;gBACzH,CAAC;gBACD,OAAO,OAAO,CAAC;oBACb,QAAQ,EAAE,IAAI;oBACd,MAAM,EAAE,YAAY;oBACpB,SAAS;oBACT,YAAY,EAAE,KAAK,CAAC,YAAY;oBAChC,WAAW,EAAE,KAAK,CAAC,WAAW;oBAC9B,QAAQ,EAAE,KAAK,CAAC,QAAQ;iBACzB,CAAC,CAAC;YACL,CAAC;YAED,qEAAqE;YACrE,IAAI,OAAO,CAAC,SAAS,IAAI,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;gBACzD,OAAO,OAAO,CAAC;oBACb,MAAM,EAAE,YAAY;oBACpB,KAAK,EAAE,WAAW,CAAC,MAAM;oBACzB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBACnC,SAAS,EAAE,CAAC,CAAC,SAAS;wBACtB,YAAY,EAAE,CAAC,CAAC,YAAY;wBAC5B,WAAW,EAAE,CAAC,CAAC,WAAW;wBAC1B,QAAQ,EAAE,CAAC,CAAC,QAAQ;qBACrB,CAAC,CAAC;oBACH,gBAAgB,EAAE;wBAChB,QAAQ,EAAE,IAAI;wBACd,aAAa,EAAE,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS;wBACrD,OAAO,EAAE,2BAA2B,OAAO,CAAC,SAAS,IAAI,cAAc,2GAA2G;qBACnL;iBACF,CAAC,CAAC;YACL,CAAC;YAED,OAAO,OAAO,CAAC;gBACb,MAAM,EAAE,YAAY;gBACpB,KAAK,EAAE,WAAW,CAAC,MAAM;gBACzB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACnC,SAAS,EAAE,CAAC,CAAC,SAAS;oBACtB,YAAY,EAAE,CAAC,CAAC,YAAY;oBAC5B,WAAW,EAAE,CAAC,CAAC,WAAW;oBAC1B,QAAQ,EAAE,CAAC,CAAC,QAAQ;iBACrB,CAAC,CAAC;aACJ,CAAC,CAAC;QACL,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,2BAA2B,GAAG,CAAC,CAAC,MAAM,CAAC;QAC3C,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC5B,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;QACxC,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;QAChD,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE;QACxD,mBAAmB,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;KAC5C,CAAC,CAAC,MAAM,EAAE,CAAC;IAEZ,MAAM,aAAa,GAAG,UAAU,CAAC;QAC/B,IAAI,EAAE,gBAAgB;QACtB,WAAW,EACT,sGAAsG;YACtG,4GAA4G;YAC5G,uIAAuI;YACvI,0HAA0H;YAC1H,qEAAqE;YACrE,mHAAmH;YACnH,uEAAuE;YACvE,wEAAwE;QAC1E,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,uGAAuG,CAAC;YAClJ,QAAQ,EAAE,2BAA2B,CAAC,QAAQ,CAAC,mSAAmS,CAAC;SACpV,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,MAAM,gBAAgB,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;YAChF,IAAI,CAAC,gBAAgB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC;gBAC5D,OAAO,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAC5C,CAAC;YAED,wFAAwF;YACxF,IAAI,OAAO,CAAC,SAAS,IAAI,gBAAgB,KAAK,OAAO,CAAC,SAAS,EAAE,CAAC;gBAChE,OAAO,KAAK,CACV,0BAA0B,OAAO,CAAC,SAAS,IAAI,cAAc,kDAAkD,CAChH,CAAC;YACJ,CAAC;YAED,MAAM,wBAAwB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5C,MAAM,0BAA0B,GAAG,cAAc,CAAC,QAAQ,EAAE,EAAE,YAAY,CAAC;YAC3E,0BAA0B,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YACrE,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBACvC,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,SAAS,EAAE,gBAAgB;gBAC3B,aAAa,EAAE,QAAiB;gBAChC,WAAW,EAAE,KAAK,CAAC,QAAQ;aAC5B,CAAC,CAAC;YACH,MAAM,qBAAqB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,wBAAwB,CAAC;YACpE,0BAA0B,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,CAAC,CAAC;YAEtG,IAAI,MAAM,CAAC,cAAc,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;gBAC5D,OAAO,KAAK,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,IAAI,yBAAyB,CAAC,CAAC;YACzE,CAAC;YACD,OAAO,OAAO,CAAC,EAAE,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QACjM,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,UAAU,CAAC;QAC/B,IAAI,EAAE,gBAAgB;QACtB,WAAW,EACT,uIAAuI;YACvI,qIAAqI;YACrI,wGAAwG;YACxG,oIAAoI;YACpI,2HAA2H;YAC3H,+FAA+F;QACjG,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,oFAAoF,CAAC;YAChH,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iQAAiQ,CAAC;YACzS,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;YACjG,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,sHAAsH,CAAC;SAC1L,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;gBACzB,OAAO,KAAK,CAAC,oBAAoB,CAAC,CAAC;YACrC,CAAC;YAED,MAAM,wBAAwB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5C,MAAM,0BAA0B,GAAG,cAAc,CAAC,QAAQ,EAAE,EAAE,YAAY,CAAC;YAC3E,0BAA0B,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YACrE,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBACvC,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,aAAa,EAAE,QAAiB;gBAChC,WAAW,EAAE;oBACX,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE;oBACzB,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,SAAS;oBACzC,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,SAAS;oBACrC,UAAU,EAAE,KAAK,CAAC,UAAU;iBAC7B;aACF,CAAC,CAAC;YACH,MAAM,qBAAqB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,wBAAwB,CAAC;YACpE,0BAA0B,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,CAAC,CAAC;YAEtG,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;gBAC1B,IAAI,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;oBAClC,OAAO,OAAO,CAAC;wBACb,OAAO,EAAE,IAAI;wBACb,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,SAAS;wBAC1C,KAAK,EAAE,MAAM,CAAC,cAAc,CAAC,KAAK;wBAClC,OAAO,EAAE,MAAM,CAAC,cAAc,CAAC,OAAO;wBACtC,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;qBACzG,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,KAAK,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,IAAI,2BAA2B,CAAC,CAAC;YAC3E,CAAC;YACD,OAAO,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,UAAU,CAAC;QAC/B,IAAI,EAAE,gBAAgB;QACtB,WAAW,EACT,mHAAmH;YACnH,qGAAqG;YACrG,gJAAgJ;YAChJ,oGAAoG;YACpG,yDAAyD;QAC3D,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,qIAAqI,CAAC;SACjL,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,SAAS,CAAC;YAC/D,IAAI,CAAC,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9C,OAAO,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAC5C,CAAC;YAED,wFAAwF;YACxF,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,KAAK,OAAO,CAAC,SAAS,EAAE,CAAC;gBACzD,OAAO,KAAK,CACV,0BAA0B,OAAO,CAAC,SAAS,IAAI,cAAc,uCAAuC,CACrG,CAAC;YACJ,CAAC;YAED,MAAM,wBAAwB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5C,MAAM,0BAA0B,GAAG,cAAc,CAAC,QAAQ,EAAE,EAAE,YAAY,CAAC;YAC3E,0BAA0B,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YACrE,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;gBACvC,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,SAAS;gBACT,aAAa,EAAE,QAAiB;aACjC,CAAC,CAAC;YACH,MAAM,qBAAqB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,wBAAwB,CAAC;YACpE,0BAA0B,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,CAAC,CAAC;YAEtG,IAAI,MAAM,CAAC,cAAc,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;gBAC5D,OAAO,KAAK,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,IAAI,2BAA2B,CAAC,CAAC;YAC3E,CAAC;YACD,OAAO,OAAO,CAAC,EAAE,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5J,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,uBAAuB,GAAG,UAAU,CAAC;QACzC,IAAI,EAAE,2BAA2B;QACjC,WAAW,EACT,iIAAiI;YACjI,oDAAoD;YACpD,oBAAoB;YACpB,gFAAgF;YAChF,qGAAqG;YACrG,sHAAsH;YACtH,mGAAmG;YACnG,2GAA2G;QAC7G,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,8IAA8I,CAAC;YACtL,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,kHAAkH,CAAC;SAC9J,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,SAAS,CAAC;YAC/D,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,MAAM,CAAC;YAC5D,IAAI,CAAC,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9C,OAAO,KAAK,CAAC,mEAAmE,CAAC,CAAC;YACpF,CAAC;YAED,yFAAyF;YACzF,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,KAAK,OAAO,CAAC,SAAS,EAAE,CAAC;gBACzD,OAAO,KAAK,CACV,0BAA0B,OAAO,CAAC,SAAS,IAAI,cAAc,+CAA+C,CAC7G,CAAC;YACJ,CAAC;YAED,MAAM,2BAA2B,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC/C,MAAM,6BAA6B,GAAG,cAAc,CAAC,QAAQ,EAAE,EAAE,YAAY,CAAC;YAC9E,6BAA6B,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC,CAAC;YACrF,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;gBACnD,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,SAAS;gBACT,YAAY;gBACZ,aAAa,EAAE,QAAiB;aACjC,CAAC,CAAC;YACH,MAAM,wBAAwB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,2BAA2B,CAAC;YAC1E,6BAA6B,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,oBAAoB,EAAE,UAAU,EAAE,wBAAwB,EAAE,CAAC,CAAC;YAEzH,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;gBAC1B,IAAI,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;oBAClC,MAAM,aAAa,GAAG,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;oBACzE,OAAO,OAAO,CAAC;wBACb,OAAO,EAAE,CAAC,aAAa;wBACvB,OAAO,EAAE,MAAM,CAAC,cAAc,CAAC,OAAO;wBACtC,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,UAAU,EAAE,wBAAwB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;qBACzH,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,KAAK,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,IAAI,uBAAuB,CAAC,CAAC;YACvE,CAAC;YACD,OAAO,KAAK,CAAC,uBAAuB,CAAC,CAAC;QACxC,CAAC;KACF,CAAC,CAAC;IAEH,MAAM,uBAAuB,GAAG,UAAU,CAAC;QACzC,IAAI,EAAE,2BAA2B;QACjC,WAAW,EACT,8GAA8G;YAC9G,4EAA4E;YAC5E,sIAAsI;YACtI,qFAAqF;YACrF,8FAA8F;YAC9F,wDAAwD;QAC1D,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC;YACpB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,6GAA6G,CAAC;YAC1I,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,uHAAuH,CAAC;SACnK,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE;YACpC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,SAAS,CAAC;YAC/D,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC;YAE1C,IAAI,CAAC,SAAS,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9C,OAAO,KAAK,CAAC,kEAAkE,CAAC,CAAC;YACnF,CAAC;YACD,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,OAAO,KAAK,CAAC,qBAAqB,CAAC,CAAC;YACtC,CAAC;YAED,+EAA+E;YAC/E,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,KAAK,OAAO,CAAC,SAAS,EAAE,CAAC;gBACzD,OAAO,KAAK,CACV,0BAA0B,OAAO,CAAC,SAAS,IAAI,cAAc,kDAAkD,CAChH,CAAC;YACJ,CAAC;YAED,MAAM,2BAA2B,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC/C,MAAM,6BAA6B,GAAG,cAAc,CAAC,QAAQ,EAAE,EAAE,YAAY,CAAC;YAC9E,6BAA6B,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,oBAAoB,EAAE,CAAC,CAAC;YACrF,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;gBACnD,MAAM,EAAE,OAAO,CAAC,MAAM;gBACtB,SAAS;gBACT,YAAY;gBACZ,aAAa,EAAE,QAAiB;aACjC,CAAC,CAAC;YACH,MAAM,wBAAwB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,2BAA2B,CAAC;YAC1E,6BAA6B,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,oBAAoB,EAAE,UAAU,EAAE,wBAAwB,EAAE,CAAC,CAAC;YAEzH,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;gBAC1B,IAAI,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;oBAClC,OAAO,OAAO,CAAC;wBACb,OAAO,EAAE,IAAI;wBACb,OAAO,EAAE,MAAM,CAAC,cAAc,CAAC,OAAO;wBACtC,aAAa,EAAE,CAAC,EAAE,IAAI,EAAE,oBAAoB,EAAE,UAAU,EAAE,wBAAwB,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;qBACzH,CAAC,CAAC;gBACL,CAAC;gBACD,OAAO,KAAK,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,IAAI,0BAA0B,CAAC,CAAC;YAC1E,CAAC;YACD,OAAO,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAC3C,CAAC;KACF,CAAC,CAAC;IAEH,OAAO,CAAC,WAAW,EAAE,oBAAoB,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,uBAAuB,EAAE,uBAAuB,CAAU,CAAC;AACrJ,CAAC","sourcesContent":["import { z } from \"zod\";\n\nimport { requestContext } from \"../shared/observability/request-context.js\";\nimport { log } from \"../shared/observability/log.js\";\nimport { renderNetworkContext } from '../shared/network/metadata.renderer.js';\n\nimport type { DefineTool, ToolDeps } from \"../shared/agent/tool.helpers.js\";\nimport { success, error, UUID_REGEX } from \"../shared/agent/tool.helpers.js\";\nimport { NetworkRecommender } from \"./network.recommender.js\";\n\n// Lazy singleton — only instantiated on first onboarding ranking call so that\n// importing this module does not require OPENROUTER_API_KEY at load time.\nlet recommender: NetworkRecommender | undefined;\n\nconst logger = log.protocol.from(\"ChatTools:Network\");\n\nexport function createNetworkTools(defineTool: DefineTool, deps: ToolDeps) {\n  const { graphs, userDb, systemDb } = deps;\n\n  const enrichWithContext = (networks: Array<Record<string, unknown>>) =>\n    networks.map((n) => ({\n      ...n,\n      renderedContext: renderNetworkContext({\n        type: (n.type as string) ?? 'community',\n        title: (n.title as string) ?? '',\n        prompt: n.prompt as string | undefined,\n        metadata: (n.metadata as Record<string, unknown>) ?? {},\n      }),\n    }));\n\n  const readIndexes = defineTool({\n    name: \"read_networks\",\n    description:\n      \"Lists the authenticated user's networks (communities), including ones they own and public communities they can join.\\n\\n\" +\n      \"**When to use:** To find network IDs for scoping other operations (read_intents, discover_opportunities, read_network_memberships), \" +\n      \"or to show the user which communities they belong to.\\n\\n\" +\n      \"**Returns:** Up to three lists — `memberOf` (networks the user joined), `owns` (networks the user created), and `publicNetworks` \" +\n      \"(publicly joinable communities the user is not yet a member of). Entries in `memberOf` include `isPersonal` set to `true` for the user's \" +\n      \"personal network.\\n\\n\" +\n      \"**Note:** In network-scoped chats, only the scoped network is returned. During onboarding, `orderedNetworkIds` \" +\n      \"may be returned alongside `publicNetworks` \\u2014 a ranked array of network IDs ordered by relevance to the user's profile (omitted when ranking is unavailable or fails).\",\n    querySchema: z.object({\n      userId: z.string().optional().describe(\"Must be the current user's ID or omitted. Cannot list another user's indexes.\"),\n    }),\n    handler: async ({ context, query }) => {\n      if (query.userId && query.userId.trim() !== context.userId) {\n        return error(\"You can only list your own indexes. Omit userId to see the current user's indexes.\");\n      }\n\n      const _readIndexGraphStart = Date.now();\n      const _readIndexTraceEmitter = requestContext.getStore()?.traceEmitter;\n      _readIndexTraceEmitter?.({ type: \"graph_start\", name: \"index\" });\n      const result = await graphs.index.invoke({\n        userId: context.userId,\n        networkId: context.networkId || undefined,\n        operationMode: 'read' as const,\n        showAll: false, // Never allow bypass - strict scope enforcement\n      });\n      const _readIndexGraphMs = Date.now() - _readIndexGraphStart;\n      _readIndexTraceEmitter?.({ type: \"graph_end\", name: \"index\", durationMs: _readIndexGraphMs });\n\n      if (result.error) {\n        return error(result.error);\n      }\n      if (result.readResult) {\n        const rr = result.readResult as Record<string, unknown>;\n        const enriched = {\n          ...rr,\n          ...(Array.isArray(rr.memberOf) ? { memberOf: enrichWithContext(rr.memberOf as Array<Record<string, unknown>>) } : {}),\n          ...(Array.isArray(rr.owns) ? { owns: enrichWithContext(rr.owns as Array<Record<string, unknown>>) } : {}),\n          ...(Array.isArray(rr.publicNetworks) ? { publicNetworks: enrichWithContext(rr.publicNetworks as Array<Record<string, unknown>>) } : {}),\n        };\n\n        // When scoped, add clear metadata so model knows results are limited\n        if (context.networkId) {\n          return success({\n            ...enriched,\n            scopeRestriction: {\n              isScoped: true,\n              scopedToIndex: context.indexName ?? context.networkId,\n              message: `Results are limited to \"${context.indexName ?? 'this network'}\" because this chat is scoped to that community. The user may belong to other communities not shown here.`,\n            },\n            _graphTimings: [{ name: 'index', durationMs: _readIndexGraphMs, agents: result.agentTimings ?? [] }],\n          });\n        }\n        // Onboarding-only: rank public networks by relevance to the user's global\n        // user_context paragraph (the profile-replacing identity text). Guard: only\n        // when isOnboarding, not scoped, there are public networks to rank, and a\n        // user_context is resolvable (generated on demand by the injected resolver).\n        let orderedNetworkIds: string[] | undefined;\n        const userContext = deps.getUserContextText ? await deps.getUserContextText(context.userId) : \"\";\n        if (\n          context.isOnboarding &&\n          userContext &&\n          Array.isArray(enriched.publicNetworks) &&\n          (enriched.publicNetworks as Array<Record<string, unknown>>).length > 0\n        ) {\n          // Cap at 50 to bound LLM context window usage (matches the UI's discoverPublicIndexes(1, 50)).\n          const publicNetworksForRanking = (enriched.publicNetworks as Array<Record<string, unknown>>)\n            .slice(0, 50)\n            .map((n) => ({\n              networkId: n.networkId as string,\n              renderedContext: (n.renderedContext as string) ?? `## ${n.title as string}`,\n            }));\n          const rankFn = deps.networkRanker ?? (async (input) => {\n            try {\n              recommender ??= new NetworkRecommender();\n              return await recommender.invoke(input);\n            } catch (err) {\n              // e.g. missing OPENROUTER_API_KEY — degrade gracefully, omit orderedNetworkIds\n              logger.warn(\"read_networks: NetworkRecommender unavailable, skipping ranking\", { error: err });\n              return null;\n            }\n          });\n          const rankingResult = await rankFn({\n            userContext,\n            networks: publicNetworksForRanking,\n          }).catch((err: unknown) => {\n            // Catches errors from a custom deps.networkRanker (the default fallback\n            // handles its own errors internally). Degrade gracefully: omit orderedNetworkIds.\n            logger.warn(\"read_networks: networkRanker threw, skipping ranking\", { error: err });\n            deps.reportToolError?.(err, { operation: \"network-ranking\", toolName: \"read_networks\", userId: context.userId });\n            return null;\n          });\n          if (rankingResult) {\n            // Normalize LLM output against the ranked slice (top 50):\n            // keep only IDs from the input set, de-dupe preserving order, then\n            // append any slice IDs the model omitted. Networks beyond the top-50\n            // slice are not in orderedNetworkIds and will sort to the tail in the\n            // frontend (consistent with the UI's own 50-item page size).\n            const inputIds = publicNetworksForRanking.map((n) => n.networkId);\n            const inputIdSet = new Set(inputIds);\n            const seen = new Set<string>();\n            const normalized: string[] = [];\n            for (const id of rankingResult.rankedNetworkIds) {\n              if (inputIdSet.has(id) && !seen.has(id)) {\n                normalized.push(id);\n                seen.add(id);\n              }\n            }\n            for (const id of inputIds) {\n              if (!seen.has(id)) normalized.push(id);\n            }\n            orderedNetworkIds = normalized;\n          }\n        }\n\n        return success({\n          ...enriched,\n          ...(orderedNetworkIds !== undefined ? { orderedNetworkIds } : {}),\n          _graphTimings: [{ name: 'index', durationMs: _readIndexGraphMs, agents: result.agentTimings ?? [] }],\n        });\n      }\n      return error(\"Failed to fetch index information.\");\n    },\n  });\n\n  const readIndexMemberships = defineTool({\n    name: \"read_network_memberships\",\n    description:\n      \"Reads network membership information — who is in which community. Essential for understanding the social graph before \" +\n      \"creating introductions or exploring intents.\\n\\n\" +\n      \"**Usage modes:**\\n\" +\n      \"- With `networkId` only: lists ALL members of that index — returns userId, name, avatar, permissions (owner/member), intentCount, and joinedAt. \" +\n      \"Use this to see who's in a community before browsing their intents or creating introductions.\\n\" +\n      \"- With `userId` only (or omit for self): lists all networks that user belongs to — returns networkId, networkTitle, permissions, joinedAt.\\n\" +\n      \"- With both `networkId` and `userId`: checks whether that specific user is a member of that specific index (returns isMember boolean).\\n\\n\" +\n      \"**When to use:** Before creating introductions (need to verify shared network membership), to explore community members, \" +\n      \"or to check if a user belongs to a specific index.\\n\\n\" +\n      \"**Returns:** Member list with user details, or membership list with index details, or a membership check result.\\n\\n\" +\n      \"**Personal network semantics.** The personal network (`isPersonal: true` on the membership) is the user's \" +\n      \"contact list — members of that index are the user's contacts. For another user, this tool only reveals the \" +\n      \"indexes you already share with them.\\n\\n\" +\n      \"**Shared-context pattern.** To find overlap with another user: (1) omit `userId` to read your own \" +\n      \"memberships, (2) call this tool with the other person's actual `userId` to get the shared networks, \" +\n      \"(3) call read_intents for each shared network to see what each is looking for there, (4) call \" +\n      \"read_user_contexts for the other party. That sequence gives you enough to decide whether to propose a \" +\n      \"direct connection or an introduction.\",\n    querySchema: z.object({\n      networkId: z.string().optional().describe(\"Network UUID — lists all members of this network. Get from read_networks. In network-scoped chats, only the scoped index can be queried.\"),\n      userId: z.string().optional().describe(\"User ID — lists that user's network memberships. Omit to get the current user's memberships. When combined with networkId, checks if this user is in that specific index.\"),\n    }),\n    handler: async ({ context, query }) => {\n      const networkId = query.networkId?.trim() || undefined;\n      const userId = query.userId?.trim() || undefined;\n\n      if (networkId && !UUID_REGEX.test(networkId)) {\n        return error(\"Invalid network ID format. Use the exact UUID from read_networks.\");\n      }\n\n      // Mode 1: list members of an index\n      if (networkId && !userId) {\n        // Enforce strict scope: when chat is network-scoped, only allow querying that index\n        if (context.networkId && networkId !== context.networkId) {\n          return error(\n            `This chat is scoped to ${context.indexName ?? 'this network'}. You can only query members of this network.`\n          );\n        }\n\n        const _readMembersGraphStart = Date.now();\n        const _readMembersTraceEmitter = requestContext.getStore()?.traceEmitter;\n        _readMembersTraceEmitter?.({ type: \"graph_start\", name: \"network_membership\" });\n        const result = await graphs.networkMembership.invoke({\n          userId: context.userId,\n          networkId,\n          operationMode: 'read' as const,\n        });\n        const _readMembersGraphMs = Date.now() - _readMembersGraphStart;\n        _readMembersTraceEmitter?.({ type: \"graph_end\", name: \"network_membership\", durationMs: _readMembersGraphMs });\n\n        if (result.error) {\n          return error(result.error);\n        }\n        if (result.readResult) {\n          return success({ ...result.readResult, _graphTimings: [{ name: 'network_membership', durationMs: _readMembersGraphMs, agents: result.agentTimings ?? [] }] });\n        }\n        return error(\"Failed to fetch network members.\");\n      }\n\n      // Mode 2: list a user's memberships (indexes they belong to)\n      const targetUserId = userId || context.userId;\n\n      // Use userDb for own memberships, but systemDb access is implicit through shared network scope\n      let memberships: Awaited<ReturnType<typeof userDb.getNetworkMemberships>>;\n      if (targetUserId !== context.userId) {\n        // Cross-user access: systemDb will validate shared network membership\n        const callerMemberships = await userDb.getNetworkMemberships();\n        if (networkId) {\n          // Strict scope enforcement: when chat is network-scoped, only allow querying that index\n          if (context.networkId && networkId !== context.networkId) {\n            return error(\n              `This chat is scoped to ${context.indexName ?? 'this network'}. You can only query membership in this community.`\n            );\n          }\n\n          const callerInIndex = callerMemberships.some((m) => m.networkId === networkId);\n          if (!callerInIndex) {\n            return error(\n              \"Unauthorized: you can only view another user's membership in an index you belong to. Provide your own userId or omit userId for your memberships.\",\n            );\n          }\n          // Check if target user is in the index (systemDb validates scope)\n          const isMember = await systemDb.isNetworkMember(networkId, targetUserId);\n          if (isMember) {\n            return success({ isMember: true, userId: targetUserId, networkId });\n          }\n          return success({ isMember: false, userId: targetUserId, networkId, message: \"User is not a member of this network.\" });\n        } else {\n          // Strict scope enforcement: when chat is network-scoped, only check the scoped index\n          if (context.networkId) {\n            const isMember = await systemDb.isNetworkMember(context.networkId, targetUserId);\n            if (isMember) {\n              return success({\n                isMember: true,\n                userId: targetUserId,\n                networkId: context.networkId,\n                scopeRestriction: {\n                  isScoped: true,\n                  scopedToIndex: context.indexName ?? context.networkId,\n                  message: `This chat is scoped to \"${context.indexName ?? 'this network'}\". Only membership in this community is shown.`,\n                },\n              });\n            }\n            return success({\n              isMember: false,\n              userId: targetUserId,\n              networkId: context.networkId,\n              message: \"User is not a member of this community.\",\n              scopeRestriction: {\n                isScoped: true,\n                scopedToIndex: context.indexName ?? context.networkId,\n                message: `This chat is scoped to \"${context.indexName ?? 'this network'}\". Only membership in this community was checked.`,\n              },\n            });\n          }\n\n          // Unscoped chat: show overlap with shared networks (intersection of caller and target memberships)\n          const sharedIndexes: typeof callerMemberships = [];\n          for (const m of callerMemberships) {\n            if (await systemDb.isNetworkMember(m.networkId, targetUserId)) {\n              sharedIndexes.push(m);\n            }\n          }\n          if (sharedIndexes.length === 0) {\n            return error(\n              \"Unauthorized: you can only view another user's memberships if you share at least one index, or request your own memberships.\",\n            );\n          }\n          // Return only the indexes that are shared\n          return success({\n            userId: targetUserId,\n            count: sharedIndexes.length,\n            memberships: sharedIndexes.map((m) => ({\n              networkId: m.networkId,\n              networkTitle: m.networkTitle,\n            })),\n            note: \"Only showing shared networks.\",\n          });\n        }\n      } else {\n        // Own memberships - use userDb\n        memberships = await userDb.getNetworkMemberships();\n\n        // NOTE: context.networkId here is the *focus* of the scoped chat — it filters\n        // what we show, not what we can reach. indexScope is the reach; the bound\n        // network is one element of it. See IND-306 for the equivalent in read_intents.\n        // Strict scope enforcement: when chat is network-scoped, only return the scoped network membership\n        if (context.networkId && !networkId) {\n          memberships = memberships.filter((m) => m.networkId === context.networkId);\n        }\n      }\n\n      // If both networkId and userId: filter to that specific membership\n      if (networkId) {\n        // Strict scope enforcement: when chat is network-scoped, only allow querying that index\n        if (context.networkId && networkId !== context.networkId) {\n          return error(\n            `This chat is scoped to ${context.indexName ?? 'this network'}. You can only query membership in this community.`\n          );\n        }\n\n        const callerMemberships = await userDb.getNetworkMemberships();\n        const callerInIndex =\n          targetUserId === context.userId ||\n          callerMemberships.some((m) => m.networkId === networkId);\n        if (!callerInIndex) {\n          return error(\n            \"Unauthorized: you can only view membership in an index you belong to.\",\n          );\n        }\n        const match = memberships.find((m) => m.networkId === networkId);\n        if (!match) {\n          return success({ isMember: false, userId: targetUserId, networkId, message: \"User is not a member of this network.\" });\n        }\n        return success({\n          isMember: true,\n          userId: targetUserId,\n          networkId,\n          networkTitle: match.networkTitle,\n          permissions: match.permissions,\n          joinedAt: match.joinedAt,\n        });\n      }\n\n      // When scoped, add clear metadata so model knows results are limited\n      if (context.networkId && targetUserId === context.userId) {\n        return success({\n          userId: targetUserId,\n          count: memberships.length,\n          memberships: memberships.map((m) => ({\n            networkId: m.networkId,\n            networkTitle: m.networkTitle,\n            permissions: m.permissions,\n            joinedAt: m.joinedAt,\n          })),\n          scopeRestriction: {\n            isScoped: true,\n            scopedToIndex: context.indexName ?? context.networkId,\n            message: `Results are limited to \"${context.indexName ?? 'this network'}\" because this chat is scoped to that community. The user may belong to other communities not shown here.`,\n          },\n        });\n      }\n\n      return success({\n        userId: targetUserId,\n        count: memberships.length,\n        memberships: memberships.map((m) => ({\n          networkId: m.networkId,\n          networkTitle: m.networkTitle,\n          permissions: m.permissions,\n          joinedAt: m.joinedAt,\n        })),\n      });\n    },\n  });\n\n  const updateNetworkSettingsSchema = z.object({\n    title: z.string().optional(),\n    prompt: z.string().nullable().optional(),\n    imageUrl: z.string().url().nullable().optional(),\n    joinPolicy: z.enum(['anyone', 'invite_only']).optional(),\n    allowGuestVibeCheck: z.boolean().optional(),\n  }).strict();\n\n  const updateNetwork = defineTool({\n    name: \"update_network\",\n    description:\n      \"Updates settings of an existing network (community). Only the network owner can perform updates.\\n\\n\" +\n      \"**Updatable fields:** title (display name), prompt (purpose description used for intent auto-assignment), \" +\n      \"imageUrl (community avatar), joinPolicy ('anyone' for open or 'invite_only'), allowGuestVibeCheck (allow non-members to preview).\\n\\n\" +\n      \"**When to use:** When a network owner wants to change their community's settings — e.g. update the purpose description, \" +\n      \"change from invite-only to open, or update the community image.\\n\\n\" +\n      \"**Important:** Changing the prompt affects how future intents are evaluated for auto-assignment to this network. \" +\n      \"Existing intent-network links are not re-evaluated automatically.\\n\\n\" +\n      \"**Returns:** Confirmation with the list of settings that were updated.\",\n    querySchema: z.object({\n      networkId: z.string().optional().describe(\"Network UUID to update. Get from read_networks. Defaults to the scoped index in network-scoped chats.\"),\n      settings: updateNetworkSettingsSchema.describe(\"Object with fields to update. All fields are optional — only include the ones to change. title: display name. prompt: purpose description (used for intent auto-assignment). imageUrl: community image URL (null to remove). joinPolicy: 'anyone' or 'invite_only'. allowGuestVibeCheck: boolean.\"),\n    }),\n    handler: async ({ context, query }) => {\n      const effectiveIndexId = (query.networkId?.trim() || context.networkId) ?? null;\n      if (!effectiveIndexId || !UUID_REGEX.test(effectiveIndexId)) {\n        return error(\"Valid networkId required.\");\n      }\n\n      // Strict scope enforcement: when chat is network-scoped, only allow updating that index\n      if (context.networkId && effectiveIndexId !== context.networkId) {\n        return error(\n          `This chat is scoped to ${context.indexName ?? 'this network'}. You can only update this community's settings.`\n        );\n      }\n\n      const _updateNetworkGraphStart = Date.now();\n      const _updateNetworkTraceEmitter = requestContext.getStore()?.traceEmitter;\n      _updateNetworkTraceEmitter?.({ type: \"graph_start\", name: \"index\" });\n      const result = await graphs.index.invoke({\n        userId: context.userId,\n        networkId: effectiveIndexId,\n        operationMode: 'update' as const,\n        updateInput: query.settings,\n      });\n      const _updateNetworkGraphMs = Date.now() - _updateNetworkGraphStart;\n      _updateNetworkTraceEmitter?.({ type: \"graph_end\", name: \"index\", durationMs: _updateNetworkGraphMs });\n\n      if (result.mutationResult && !result.mutationResult.success) {\n        return error(result.mutationResult.error || \"Failed to update index.\");\n      }\n      return success({ message: \"Index updated.\", settings: Object.keys(query.settings), _graphTimings: [{ name: 'index', durationMs: _updateNetworkGraphMs, agents: result.agentTimings ?? [] }] });\n    },\n  });\n\n  const createNetwork = defineTool({\n    name: \"create_network\",\n    description:\n      \"Creates a new network (community/group). The authenticated user becomes the owner with full control over settings and membership.\\n\\n\" +\n      \"**What is a network?** A shared space where members post intents (what they're looking for) and the system discovers opportunities \" +\n      \"(complementary matches) between members. The network's prompt guides what kinds of intents belong.\\n\\n\" +\n      \"**When to use:** When the user wants to create a new community — e.g. a professional network, interest group, or project team.\\n\\n\" +\n      \"**Returns:** The new network's networkId (UUID) and title. Use the networkId to add members (create_network_membership), \" +\n      \"link intents (create_intent_index), or run discovery (discover_opportunities with networkId).\",\n    querySchema: z.object({\n      title: z.string().describe(\"Display name of the network (e.g. 'AI Founders Berlin', 'Design Co-op'). Required.\"),\n      prompt: z.string().optional().describe(\"Description of what this community is about (e.g. 'Early-stage AI/ML founders in Berlin looking for co-founders, advisors, and investors'). Used by the system to evaluate which intents belong in this network. Highly recommended for better auto-assignment.\"),\n      imageUrl: z.string().url().optional().describe(\"URL for the community's avatar/image. Optional.\"),\n      joinPolicy: z.enum(['anyone', 'invite_only']).optional().describe(\"'anyone' = open (any user can self-join), 'invite_only' = only the owner can add members. Defaults to 'invite_only'.\"),\n    }),\n    handler: async ({ context, query }) => {\n      if (!query.title?.trim()) {\n        return error(\"Title is required.\");\n      }\n\n      const _createNetworkGraphStart = Date.now();\n      const _createNetworkTraceEmitter = requestContext.getStore()?.traceEmitter;\n      _createNetworkTraceEmitter?.({ type: \"graph_start\", name: \"index\" });\n      const result = await graphs.index.invoke({\n        userId: context.userId,\n        operationMode: 'create' as const,\n        createInput: {\n          title: query.title.trim(),\n          prompt: query.prompt?.trim() || undefined,\n          imageUrl: query.imageUrl || undefined,\n          joinPolicy: query.joinPolicy,\n        },\n      });\n      const _createNetworkGraphMs = Date.now() - _createNetworkGraphStart;\n      _createNetworkTraceEmitter?.({ type: \"graph_end\", name: \"index\", durationMs: _createNetworkGraphMs });\n\n      if (result.mutationResult) {\n        if (result.mutationResult.success) {\n          return success({\n            created: true,\n            networkId: result.mutationResult.networkId,\n            title: result.mutationResult.title,\n            message: result.mutationResult.message,\n            _graphTimings: [{ name: 'index', durationMs: _createNetworkGraphMs, agents: result.agentTimings ?? [] }],\n          });\n        }\n        return error(result.mutationResult.error || \"Failed to create network.\");\n      }\n      return error(\"Failed to create network.\");\n    },\n  });\n\n  const deleteNetwork = defineTool({\n    name: \"delete_network\",\n    description:\n      \"Permanently deletes a network (community). Only the owner can delete, and the network must have no other members \" +\n      \"(remove all members first with delete_network_membership). Personal networks cannot be deleted.\\n\\n\" +\n      \"**When to use:** When the owner wants to disband a community. This is irreversible — all intent-network links to this network are removed.\\n\\n\" +\n      \"**Prerequisites:** Must be the owner. Must be the sole remaining member (remove others first).\\n\\n\" +\n      \"**Returns:** Confirmation that the network was deleted.\",\n    querySchema: z.object({\n      networkId: z.string().optional().describe(\"Network UUID to delete. Get from read_networks. Defaults to the scoped index in network-scoped chats. Cannot be a personal network.\"),\n    }),\n    handler: async ({ context, query }) => {\n      const networkId = query.networkId?.trim() || context.networkId;\n      if (!networkId || !UUID_REGEX.test(networkId)) {\n        return error(\"Valid networkId required.\");\n      }\n\n      // Strict scope enforcement: when chat is network-scoped, only allow deleting that index\n      if (context.networkId && networkId !== context.networkId) {\n        return error(\n          `This chat is scoped to ${context.indexName ?? 'this network'}. You can only delete this community.`\n        );\n      }\n\n      const _deleteNetworkGraphStart = Date.now();\n      const _deleteNetworkTraceEmitter = requestContext.getStore()?.traceEmitter;\n      _deleteNetworkTraceEmitter?.({ type: \"graph_start\", name: \"index\" });\n      const result = await graphs.index.invoke({\n        userId: context.userId,\n        networkId,\n        operationMode: 'delete' as const,\n      });\n      const _deleteNetworkGraphMs = Date.now() - _deleteNetworkGraphStart;\n      _deleteNetworkTraceEmitter?.({ type: \"graph_end\", name: \"index\", durationMs: _deleteNetworkGraphMs });\n\n      if (result.mutationResult && !result.mutationResult.success) {\n        return error(result.mutationResult.error || \"Failed to delete network.\");\n      }\n      return success({ message: \"Network deleted.\", _graphTimings: [{ name: 'index', durationMs: _deleteNetworkGraphMs, agents: result.agentTimings ?? [] }] });\n    },\n  });\n\n  const createNetworkMembership = defineTool({\n    name: \"create_network_membership\",\n    description:\n      \"Adds a user as a member of a network (community). Membership enables the user to post intents in the network and be discovered \" +\n      \"by other members through opportunity matching.\\n\\n\" +\n      \"**Usage modes:**\\n\" +\n      \"- Omit userId: self-join (only works for networks with joinPolicy 'anyone').\\n\" +\n      \"- With userId: add another user (only the network owner can do this for 'invite_only' indexes).\\n\\n\" +\n      \"**When to use:** When the user wants to join an open community, or when a network owner wants to invite someone.\\n\\n\" +\n      \"**Returns:** Confirmation that the member was added (or a note that they were already a member). \" +\n      \"After joining, the user's existing intents with autoAssign=true may be evaluated against the new network.\",\n    querySchema: z.object({\n      userId: z.string().optional().describe(\"User ID to add as a member. Omit to join the network yourself. Get user IDs from read_user_contexts(query=name) or read_network_memberships.\"),\n      networkId: z.string().optional().describe(\"Network UUID to add the member to. Get from read_networks. Defaults to the scoped index in network-scoped chats.\"),\n    }),\n    handler: async ({ context, query }) => {\n      const networkId = query.networkId?.trim() || context.networkId;\n      const targetUserId = query.userId?.trim() || context.userId;\n      if (!networkId || !UUID_REGEX.test(networkId)) {\n        return error(\"Invalid network ID format. Use the exact UUID from read_networks.\");\n      }\n\n      // Strict scope enforcement: when chat is network-scoped, only allow adding to that index\n      if (context.networkId && networkId !== context.networkId) {\n        return error(\n          `This chat is scoped to ${context.indexName ?? 'this network'}. You can only add members to this community.`\n        );\n      }\n\n      const _createMembershipGraphStart = Date.now();\n      const _createMembershipTraceEmitter = requestContext.getStore()?.traceEmitter;\n      _createMembershipTraceEmitter?.({ type: \"graph_start\", name: \"network_membership\" });\n      const result = await graphs.networkMembership.invoke({\n        userId: context.userId,\n        networkId,\n        targetUserId,\n        operationMode: 'create' as const,\n      });\n      const _createMembershipGraphMs = Date.now() - _createMembershipGraphStart;\n      _createMembershipTraceEmitter?.({ type: \"graph_end\", name: \"network_membership\", durationMs: _createMembershipGraphMs });\n\n      if (result.mutationResult) {\n        if (result.mutationResult.success) {\n          const alreadyMember = result.mutationResult.message?.includes(\"already\");\n          return success({\n            created: !alreadyMember,\n            message: result.mutationResult.message,\n            _graphTimings: [{ name: 'network_membership', durationMs: _createMembershipGraphMs, agents: result.agentTimings ?? [] }],\n          });\n        }\n        return error(result.mutationResult.error || \"Failed to add member.\");\n      }\n      return error(\"Failed to add member.\");\n    },\n  });\n\n  const deleteNetworkMembership = defineTool({\n    name: \"delete_network_membership\",\n    description:\n      \"Removes a user from a network (community). After removal, the user's intents are unlinked from this network \" +\n      \"and they can no longer participate in opportunity discovery within it.\\n\\n\" +\n      \"**Permissions:** Only the network owner can remove members. The owner themselves cannot be removed (delete the network instead).\\n\\n\" +\n      \"**When to use:** When a network owner wants to remove a member from the community. \" +\n      \"Use read_network_memberships(networkId) first to get the userId of the member to remove.\\n\\n\" +\n      \"**Returns:** Confirmation that the member was removed.\",\n    querySchema: z.object({\n      userId: z.string().describe(\"User ID of the member to remove. Get from read_network_memberships(networkId). Cannot be the network owner.\"),\n      networkId: z.string().optional().describe(\"Network UUID to remove the member from. Get from read_networks. Defaults to the scoped index in network-scoped chats.\"),\n    }),\n    handler: async ({ context, query }) => {\n      const networkId = query.networkId?.trim() || context.networkId;\n      const targetUserId = query.userId?.trim();\n\n      if (!networkId || !UUID_REGEX.test(networkId)) {\n        return error(\"Valid networkId required. Use the exact UUID from read_networks.\");\n      }\n      if (!targetUserId) {\n        return error(\"userId is required.\");\n      }\n\n      // Strict scope enforcement: when chat is network-scoped, only allow that index\n      if (context.networkId && networkId !== context.networkId) {\n        return error(\n          `This chat is scoped to ${context.indexName ?? 'this network'}. You can only manage members of this community.`\n        );\n      }\n\n      const _deleteMembershipGraphStart = Date.now();\n      const _deleteMembershipTraceEmitter = requestContext.getStore()?.traceEmitter;\n      _deleteMembershipTraceEmitter?.({ type: \"graph_start\", name: \"network_membership\" });\n      const result = await graphs.networkMembership.invoke({\n        userId: context.userId,\n        networkId,\n        targetUserId,\n        operationMode: 'delete' as const,\n      });\n      const _deleteMembershipGraphMs = Date.now() - _deleteMembershipGraphStart;\n      _deleteMembershipTraceEmitter?.({ type: \"graph_end\", name: \"network_membership\", durationMs: _deleteMembershipGraphMs });\n\n      if (result.mutationResult) {\n        if (result.mutationResult.success) {\n          return success({\n            removed: true,\n            message: result.mutationResult.message,\n            _graphTimings: [{ name: 'network_membership', durationMs: _deleteMembershipGraphMs, agents: result.agentTimings ?? [] }],\n          });\n        }\n        return error(result.mutationResult.error || \"Failed to remove member.\");\n      }\n      return error(\"Failed to remove member.\");\n    },\n  });\n\n  return [readIndexes, readIndexMemberships, updateNetwork, createNetwork, deleteNetwork, createNetworkMembership, deleteNetworkMembership] as const;\n}\n"]}

package/dist/opportunity/delivery-card.cache.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"delivery-card.cache.d.ts","sourceRoot":"/","sources":["opportunity/delivery-card.cache.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,yCAAyC,CAAC;AACrE,OAAO,KAAK,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAI1F,MAAM,WAAW,kBAAkB;IACjC,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;IACjB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,qFAAqF;IACrF,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,sBAAsB;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAChD,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB;AAED,eAAO,MAAM,uBAAuB,QAAe,CAAC;AAEpD,wBAAsB,4BAA4B,CAChD,KAAK,EAAE,KAAK,EACZ,SAAS,EAAE,oBAAoB,EAC/B,WAAW,EAAE,iBAAiB,EAC9B,aAAa,EAAE,sBAAsB,EAAE,EACvC,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE;IAAE,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,GACzB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC,CAsD1C"}

package/dist/opportunity/delivery-card.cache.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"delivery-card.cache.js","sourceRoot":"/","sources":["opportunity/delivery-card.cache.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AACpE,OAAO,EAAE,qCAAqC,EAAE,MAAM,qCAAqC,CAAC;AAoB5F,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,WAAW;AAEhE,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,KAAY,EACZ,SAA+B,EAC/B,WAA8B,EAC9B,aAAuC,EACvC,QAAgB,EAChB,OAA0B;IAE1B,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,IAAI,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,EAAE,GAAG,IAAI,uBAAuB,CAAC;IACpD,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CACrC,qCAAqC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CACpE,CAAC;IACF,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,CAAqB,IAAI,CAAC,CAAC;IAE1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAA8B,CAAC;IACrD,MAAM,MAAM,GAA0D,EAAE,CAAC;IAEzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,MAAM,OAAO,CAAC,GAAG,CACf,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE;QAClC,MAAM,cAAc,GAAG,MAAM,sBAAsB,CACjD,WAAW,EACX,GAAmD,EACnD,QAAQ,CACT,CAAC;QACF,cAAc,CAAC,iBAAiB,GAAG,GAAG,CAAC,MAAM,CAAC;QAE9C,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QAClE,MAAM,IAAI,GAAuB;YAC/B,aAAa,EAAE,GAAG,CAAC,EAAE;YACrB,QAAQ,EAAE,SAAS,CAAC,QAAQ;YAC5B,mBAAmB,EAAE,SAAS,CAAC,mBAAmB;YAClD,eAAe,EAAE,SAAS,CAAC,eAAe;YAC1C,cAAc,EAAE,SAAS,CAAC,cAAc;YACxC,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,EAAE;SACnC,CAAC;QAEF,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEzB,yEAAyE;QACzE,qEAAqE;QACrE,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;YAC1B,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC,CAAC,CACH,CAAC;IAEF,OAAO,MAAM,CAAC;AAChB,CAAC","sourcesContent":["import type { Cache } from '../shared/interfaces/cache.interface.js';\nimport type { OpportunityPresenter, PresenterDatabase } from './opportunity.presenter.js';\nimport { gatherPresenterContext } from './opportunity.presenter.js';\nimport { buildDeliveryCardPresentationCacheKey } from './opportunity.presentation-cache.js';\n\nexport interface CachedDeliveryCard {\n  opportunityId: string;\n  headline: string;\n  personalizedSummary: string;\n  suggestedAction: string;\n  narratorRemark: string;\n  /** Empty string means presenter did not generate one (LLM error / fallback path). */\n  greeting: string;\n}\n\nexport interface OpportunityWithContext {\n  id: string;\n  status: string;\n  actors: Array<{ userId: string; role: string }>;\n  interpretation?: unknown;\n  detection?: unknown;\n}\n\nexport const DELIVERY_CARD_CACHE_TTL = 24 * 60 * 60; // 24 hours\n\nexport async function getOrCreateDeliveryCardBatch(\n  cache: Cache,\n  presenter: OpportunityPresenter,\n  presenterDb: PresenterDatabase,\n  opportunities: OpportunityWithContext[],\n  viewerId: string,\n  options?: { ttl?: number }\n): Promise<Map<string, CachedDeliveryCard>> {\n  if (opportunities.length === 0) {\n    return new Map();\n  }\n\n  const ttl = options?.ttl ?? DELIVERY_CARD_CACHE_TTL;\n  const keys = opportunities.map((opp) =>\n    buildDeliveryCardPresentationCacheKey(opp.id, opp.status, viewerId)\n  );\n  const cached = await cache.mget<CachedDeliveryCard>(keys);\n\n  const result = new Map<string, CachedDeliveryCard>();\n  const misses: Array<{ opp: OpportunityWithContext; index: number }> = [];\n\n  for (let i = 0; i < opportunities.length; i++) {\n    const item = cached[i];\n    if (item) {\n      result.set(opportunities[i].id, item);\n    } else {\n      misses.push({ opp: opportunities[i], index: i });\n    }\n  }\n\n  // Generate cards for cache misses\n  await Promise.all(\n    misses.map(async ({ opp, index }) => {\n      const presenterInput = await gatherPresenterContext(\n        presenterDb,\n        opp as Parameters<typeof gatherPresenterContext>[1],\n        viewerId\n      );\n      presenterInput.opportunityStatus = opp.status;\n\n      const presented = await presenter.presentHomeCard(presenterInput);\n      const card: CachedDeliveryCard = {\n        opportunityId: opp.id,\n        headline: presented.headline,\n        personalizedSummary: presented.personalizedSummary,\n        suggestedAction: presented.suggestedAction,\n        narratorRemark: presented.narratorRemark,\n        greeting: presented.greeting ?? '',\n      };\n\n      result.set(opp.id, card);\n\n      // Presenter fallbacks are safe for this request but are deliberately not\n      // persisted for 24 hours; a later request should retry genuine copy.\n      if (!presented.isFallback) {\n        await cache.set(keys[index], card, { ttl });\n      }\n    })\n  );\n\n  return result;\n}\n"]}

package/dist/opportunity/discovery-question.helper.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discovery-question.helper.d.ts","sourceRoot":"/","sources":["opportunity/discovery-question.helper.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0CAA0C,CAAC;AAClF,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,gDAAgD,CAAC;AACjG,OAAO,KAAK,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,gDAAgD,CAAC;AAE/G,MAAM,WAAW,+BAA+B;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,oFAAoF;IACpF,WAAW,EAAE,MAAM,CAAC;IACpB,kBAAkB,EAAE,0BAA0B,EAAE,CAAC;IACjD,OAAO,EAAE,gBAAgB,CAAC;IAC1B,WAAW,CAAC,EAAE,iBAAiB,CAAC;IAChC,GAAG,EAAE,MAAM,CAAC;CACb;AAED,qGAAqG;AACrG,wBAAgB,2BAA2B,CAAC,IAAI,EAAE,+BAA+B,GAAG,sBAAsB,CASzG"}

package/dist/opportunity/discovery-question.helper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"discovery-question.helper.js","sourceRoot":"/","sources":["opportunity/discovery-question.helper.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAgBH,qGAAqG;AACrG,MAAM,UAAU,2BAA2B,CAAC,IAAqC;IAC/E,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;QAC3C,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,GAAG,CAAC,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5E,GAAG,EAAE,IAAI,CAAC,GAAG;KACd,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Pure mapper from opportunity-graph outputs + optional chat digest to a\n * `DiscoveryQuestionInput`. No I/O. Side-effect-free.\n */\n\nimport type { ChatContextDigest } from \"../shared/schemas/chat-context.schema.js\";\nimport type { DiscoveryNegotiationDigest } from \"../shared/schemas/negotiation-digest.schema.js\";\nimport type { DiscoveryQuestionInput, DiscoverySummary } from \"../shared/schemas/discovery-question.schema.js\";\n\nexport interface BuildDiscoveryQuestionInputArgs {\n  query: string;\n  /** The seeker's global user_context paragraph (profile-replacing identity text). */\n  userContext: string;\n  negotiationDigests: DiscoveryNegotiationDigest[];\n  summary: DiscoverySummary;\n  chatContext?: ChatContextDigest;\n  now: string;\n}\n\n/** @deprecated Use QuestionerAgent discovery preset instead. Will be removed in a future version. */\nexport function buildDiscoveryQuestionInput(args: BuildDiscoveryQuestionInputArgs): DiscoveryQuestionInput {\n  return {\n    query: args.query,\n    userContext: args.userContext,\n    negotiationDigests: args.negotiationDigests,\n    summary: args.summary,\n    ...(args.chatContext !== undefined ? { chatContext: args.chatContext } : {}),\n    now: args.now,\n  };\n}\n"]}

package/dist/opportunity/discriminator/discriminator.adjustments.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.adjustments.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.adjustments.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AAEzF,uEAAuE;AACvE,MAAM,WAAW,wBAAwB;IACvC,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,qFAAqF;AACrF,MAAM,WAAW,cAAe,SAAQ,wBAAwB;IAC9D,0EAA0E;IAC1E,UAAU,EAAE,MAAM,CAAC;IACnB,iEAAiE;IACjE,KAAK,EAAE,MAAM,CAAC;IACd,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAC;IACb,iEAAiE;IACjE,MAAM,EAAE,MAAM,CAAC;IACf,4EAA4E;IAC5E,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,gCAAgC;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,8EAA8E;IAC9E,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,qFAAqF;IACrF,KAAK,CAAC,EAAE,IAAI,CAAC;CACd;AAED,8EAA8E;AAC9E,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,SAAS,EACpD,UAAU,CAAC,EAAE,wBAAwB,GACpC,cAAc,EAAE,CAiBlB;AAED,gFAAgF;AAChF,wBAAgB,yBAAyB,CACvC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,SAAS,EACpD,UAAU,CAAC,EAAE,wBAAwB,GACpC,cAAc,EAAE,CAElB;AAED;;;GAGG;AACH,wBAAgB,wBAAwB,CACtC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,SAAS,EACpD,UAAU,EAAE,wBAAwB,GACnC,MAAM,CAKR;AAED,6DAA6D;AAC7D,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,SAAS,EACpD,UAAU,EAAE,wBAAwB,GACnC,MAAM,CAER;AAED,uEAAuE;AACvE,MAAM,WAAW,oBAAqB,SAAQ,wBAAwB;IACpE,IAAI,EAAE,oBAAoB,CAAC;IAC3B,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,uEAAuE;AACvE,MAAM,WAAW,wBAAyB,SAAQ,wBAAwB;IACxE,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,0EAA0E;IAC1E,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,8EAA8E;IAC9E,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,wBAAwB,GAAG;IACpE,UAAU,EAAE,cAAc,CAAC;IAC3B,MAAM,EAAE,oBAAoB,CAAC;CAC9B,CA2BA;AAED,mEAAmE;AACnE,MAAM,WAAW,uBAAuB;IACtC,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,cAAc,CAAC;IAC3B,MAAM,EAAE,oBAAoB,CAAC;CAC9B;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CACjC,aAAa,EAAE,yBAAyB,EACxC,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAClB,eAAe,EAAE,MAAM,EACvB,QAAQ,EAAE,MAAM,EAChB,GAAG,EAAE,MAAM,EACX,iBAAiB,CAAC,EAAE,MAAM,GACzB,uBAAuB,EAAE,CAwB3B;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,SAAS,EACpD,UAAU,EAAE,cAAc,GACzB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAOzB;AAED,4EAA4E;AAC5E,wBAAgB,wBAAwB,CACtC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,GAAG,SAAS,EACpD,UAAU,EAAE,wBAAwB,GACnC,MAAM,GAAG,SAAS,CAKpB"}

package/dist/opportunity/discriminator/discriminator.adjustments.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.adjustments.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.adjustments.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAAE,4BAA4B,EAAE,8BAA8B,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AA6B7H,8EAA8E;AAC9E,MAAM,UAAU,mBAAmB,CACjC,QAAoD,EACpD,UAAqC;IAErC,MAAM,GAAG,GAAG,QAAQ,EAAE,eAAe,CAAC;IACtC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAuB,EAAE;QAC3C,IACE,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI;YACnC,OAAQ,CAAoB,CAAC,UAAU,KAAK,QAAQ;YACpD,OAAQ,CAAoB,CAAC,eAAe,KAAK,QAAQ;YACzD,OAAQ,CAAoB,CAAC,QAAQ,KAAK,QAAQ;YAClD,OAAQ,CAAoB,CAAC,MAAM,KAAK,QAAQ;YAChD,CAAE,CAAoB,CAAC,KAAK,KAAK,SAAS,IAAK,CAAoB,CAAC,KAAK,KAAK,IAAI,CAAC;YACnF,OAAO,KAAK,CAAC;QACf,OAAO,UAAU,KAAK,SAAS,IAAI,CAChC,CAAoB,CAAC,eAAe,KAAK,UAAU,CAAC,eAAe;YACnE,CAAoB,CAAC,QAAQ,KAAK,UAAU,CAAC,QAAQ,CACvD,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,yBAAyB,CACvC,QAAoD,EACpD,UAAqC;IAErC,OAAO,mBAAmB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;AACrG,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CACtC,QAAoD,EACpD,UAAoC;IAEpC,MAAM,WAAW,GAAG,yBAAyB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IACpE,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACvC,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpH,OAAO,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,OAAO,CAAC,CAAC;AAClD,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,kBAAkB,CAChC,UAAkB,EAClB,QAAoD,EACpD,UAAoC;IAEpC,OAAO,UAAU,GAAG,wBAAwB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AACrE,CAAC;AAsBD;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAA+B;IAIjE,MAAM,SAAS,GAAG,KAAK,CAAC,YAAY,KAAK,IAAI,CAAC;IAC9C,MAAM,QAAQ,GAAG,CAAC,SAAS,IAAI,KAAK,CAAC,YAAY,KAAK,KAAK,CAAC,UAAU,CAAC;IACvE,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,4BAA4B,CAAC;IACxG,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,IAAI,SAAS,CAAC;IAC7C,OAAO;QACL,UAAU,EAAE;YACV,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,eAAe,EAAE,KAAK,CAAC,eAAe;YACtC,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,IAAI;YACJ,MAAM;YACN,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,eAAe,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/F,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,GAAG,CAAC,KAAK,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACjG;QACD,MAAM,EAAE;YACN,IAAI,EAAE,oBAAoB;YAC1B,MAAM;YACN,eAAe,EAAE,KAAK,CAAC,eAAe;YACtC,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,UAAU,EAAE;YACxF,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B;KACF,CAAC;AACJ,CAAC;AASD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,mBAAmB,CACjC,aAAwC,EACxC,UAAkB,EAClB,UAAkB,EAClB,eAAuB,EACvB,QAAgB,EAChB,GAAW,EACX,iBAA0B;IAE1B,2EAA2E;IAC3E,MAAM,WAAW,GAAG,CAAC,IAAY,EAAW,EAAE,CAC5C,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACrD,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC,CAAC,yDAAyD;IAEjF,MAAM,IAAI,GAA8B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,aAAa,CAAC,WAAW,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC;YACR,aAAa,EAAE,CAAC,CAAC,aAAa;YAC9B,GAAG,mBAAmB,CAAC;gBACrB,UAAU;gBACV,eAAe;gBACf,QAAQ;gBACR,KAAK,EAAE,aAAa,CAAC,KAAK;gBAC1B,YAAY,EAAE,CAAC,CAAC,IAAI;gBACpB,UAAU,EAAE,MAAM;gBAClB,SAAS,EAAE,GAAG;gBACd,GAAG,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAClE,CAAC;SACH,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAAoD,EACpD,UAA0B;IAE1B,MAAM,QAAQ,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAC5D,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,UAAU;QACtC,CAAC,CAAC,eAAe,KAAK,UAAU,CAAC,eAAe;QAChD,CAAC,CAAC,QAAQ,KAAK,UAAU,CAAC,QAAQ,CACnC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,GAAG,QAAQ,EAAE,UAAU,CAAC,EAAE,CAAC;AAC7E,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,wBAAwB,CACtC,QAAoD,EACpD,UAAoC;IAEpC,OAAO,CAAC,GAAG,yBAAyB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;SACxD,OAAO,EAAE;SACT,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,UAAU,CAAC,MAAM,KAAK,QAAQ,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACrH,EAAE,MAAM,CAAC;AACb,CAAC","sourcesContent":["/**\n * Pool-adjustment domain logic (IND-419) — pure functions, no I/O.\n *\n * When a user answers a pool_discovery question, every candidate the mining\n * pass assigned to a side gets a multiplicative adjustment written to\n * `opportunities.metadata.poolAdjustments`. The home feed (flag-gated) orders\n * by `confidence × Π factor`, floored so demoted candidates stay visible.\n *\n * Invariants:\n * - Deterministic and O(pool): no LLM at answer time — the applyPlan was\n *   computed (and evidence-verified) at mining time.\n * - Reversible: entries are keyed by questionId; re-answering replaces them,\n *   dismissal-driven reversal removes them.\n * - `detail` carries the template chip text built from the user's OWN answer\n *   (\"Hands-on builders vs advisors: you chose Advisor\") — never LLM\n *   reasoning (review-opportunity-presentation).\n */\nimport { POOL_ADJUSTMENT_FACTOR_OTHER, POOL_ADJUSTMENT_FACTOR_UNKNOWN, POOL_ADJUSTMENT_FLOOR } from \"./discriminator.env.js\";\nimport type { QuestionPoolDiscriminator } from \"../../shared/schemas/question.schema.js\";\n\n/** Recipient and intent provenance that scopes one pool preference. */\nexport interface PoolAdjustmentProvenance {\n  recipientUserId: string;\n  intentId: string;\n}\n\n/** One applied adjustment on an opportunity (stored in metadata.poolAdjustments). */\nexport interface PoolAdjustment extends PoolAdjustmentProvenance {\n  /** The answered question that produced this adjustment (reversal key). */\n  questionId: string;\n  /** Discriminator label, e.g. \"Hands-on builders vs advisors\". */\n  label: string;\n  /** Side this candidate was assigned to (or \"unknown\"). */\n  side: string;\n  /** Multiplicative factor: chosen 1.0, other 0.6, unknown 0.9. */\n  factor: number;\n  /** Template chip text from the user's own answer. Set on demotions only. */\n  detail?: string;\n  /** ISO-8601 apply timestamp. */\n  appliedAt: string;\n  /** Full intent fingerprint authoritative when this adjustment was created. */\n  intentFingerprint?: string;\n  /** Audit-only marker: stale adjustments remain stored but have no ranking effect. */\n  stale?: true;\n}\n\n/** Reads valid adjustments, optionally narrowed to one recipient + intent. */\nexport function readPoolAdjustments(\n  metadata: Record<string, unknown> | null | undefined,\n  provenance?: PoolAdjustmentProvenance,\n): PoolAdjustment[] {\n  const raw = metadata?.poolAdjustments;\n  if (!Array.isArray(raw)) return [];\n  return raw.filter((a): a is PoolAdjustment => {\n    if (\n      typeof a !== \"object\" || a === null ||\n      typeof (a as PoolAdjustment).questionId !== \"string\" ||\n      typeof (a as PoolAdjustment).recipientUserId !== \"string\" ||\n      typeof (a as PoolAdjustment).intentId !== \"string\" ||\n      typeof (a as PoolAdjustment).factor !== \"number\" ||\n      ((a as PoolAdjustment).stale !== undefined && (a as PoolAdjustment).stale !== true)\n    ) return false;\n    return provenance === undefined || (\n      (a as PoolAdjustment).recipientUserId === provenance.recipientUserId &&\n      (a as PoolAdjustment).intentId === provenance.intentId\n    );\n  });\n}\n\n/** Reads valid, non-stale adjustments for ranking and presentation behavior. */\nexport function readActivePoolAdjustments(\n  metadata: Record<string, unknown> | null | undefined,\n  provenance?: PoolAdjustmentProvenance,\n): PoolAdjustment[] {\n  return readPoolAdjustments(metadata, provenance).filter((adjustment) => adjustment.stale !== true);\n}\n\n/**\n * Cumulative adjustment multiplier for an opportunity, floored at\n * {@link POOL_ADJUSTMENT_FLOOR}. 1 when no scoped adjustments exist.\n */\nexport function poolAdjustmentMultiplier(\n  metadata: Record<string, unknown> | null | undefined,\n  provenance: PoolAdjustmentProvenance,\n): number {\n  const adjustments = readActivePoolAdjustments(metadata, provenance);\n  if (adjustments.length === 0) return 1;\n  const product = adjustments.reduce((acc, a) => acc * (Number.isFinite(a.factor) && a.factor > 0 ? a.factor : 1), 1);\n  return Math.max(POOL_ADJUSTMENT_FLOOR, product);\n}\n\n/** Adjusted confidence: `confidence × Π factor`, floored. */\nexport function adjustedConfidence(\n  confidence: number,\n  metadata: Record<string, unknown> | null | undefined,\n  provenance: PoolAdjustmentProvenance,\n): number {\n  return confidence * poolAdjustmentMultiplier(metadata, provenance);\n}\n\n/** Deterministic provenance signal stored alongside one adjustment. */\nexport interface PoolAdjustmentSignal extends PoolAdjustmentProvenance {\n  type: \"pool_discriminator\";\n  weight: 1 | -1 | 0;\n  detail: string;\n  questionId: string;\n}\n\n/** Pure helper input shared by Tier-0 answers and newborn stamping. */\nexport interface BuildPoolAdjustmentInput extends PoolAdjustmentProvenance {\n  questionId: string;\n  label: string;\n  /** Verified side assignment, or null when the candidate is unassigned. */\n  assignedSide: string | null;\n  chosenSide: string;\n  appliedAt: string;\n  /** Full intent fingerprint authoritative when this adjustment was created. */\n  intentFingerprint?: string;\n}\n\n/**\n * Build one P3-compatible adjustment and signal. This is the only place that\n * defines chosen/other/unknown factors, weights, and safe template details.\n */\nexport function buildPoolAdjustment(input: BuildPoolAdjustmentInput): {\n  adjustment: PoolAdjustment;\n  signal: PoolAdjustmentSignal;\n} {\n  const isUnknown = input.assignedSide === null;\n  const isChosen = !isUnknown && input.assignedSide === input.chosenSide;\n  const factor = isUnknown ? POOL_ADJUSTMENT_FACTOR_UNKNOWN : isChosen ? 1 : POOL_ADJUSTMENT_FACTOR_OTHER;\n  const weight = isUnknown ? 0 : isChosen ? 1 : -1;\n  const side = input.assignedSide ?? \"unknown\";\n  return {\n    adjustment: {\n      questionId: input.questionId,\n      recipientUserId: input.recipientUserId,\n      intentId: input.intentId,\n      label: input.label,\n      side,\n      factor,\n      ...(!isChosen && !isUnknown ? { detail: `${input.label}: you chose ${input.chosenSide}` } : {}),\n      appliedAt: input.appliedAt,\n      ...(input.intentFingerprint !== undefined ? { intentFingerprint: input.intentFingerprint } : {}),\n    },\n    signal: {\n      type: \"pool_discriminator\",\n      weight,\n      recipientUserId: input.recipientUserId,\n      intentId: input.intentId,\n      detail: isUnknown ? `${input.label}: unassigned` : `${input.label}: ${input.chosenSide}`,\n      questionId: input.questionId,\n    },\n  };\n}\n\n/** Plan entry: what to write on one opportunity for one answer. */\nexport interface PoolAdjustmentPlanEntry {\n  opportunityId: string;\n  adjustment: PoolAdjustment;\n  signal: PoolAdjustmentSignal;\n}\n\n/**\n * Computes the write plan for one answered discriminator. Pure: the caller\n * loads/patches rows. \"Both matter\" (or any label not in `sides`) yields an\n * empty plan — no preference, no adjustments.\n *\n * @param discriminator  The asked discriminator (from detection.pool).\n * @param chosenSide     The selected option label (chip label = side label).\n * @param questionId     Reversal key.\n * @param recipientUserId User whose answer produced the preference.\n * @param intentId       Intent whose candidate pool was ranked.\n * @param now            ISO-8601 timestamp.\n * @param intentFingerprint Full intent fingerprint authoritative at apply time.\n */\nexport function planPoolAdjustments(\n  discriminator: QuestionPoolDiscriminator,\n  chosenSide: string,\n  questionId: string,\n  recipientUserId: string,\n  intentId: string,\n  now: string,\n  intentFingerprint?: string,\n): PoolAdjustmentPlanEntry[] {\n  // Chip labels are word-capped side labels; match on the capped prefix too.\n  const matchesSide = (side: string): boolean =>\n    side === chosenSide || side.startsWith(chosenSide) || chosenSide.startsWith(side);\n  const chosen = discriminator.sides.find(matchesSide);\n  if (!chosen) return []; // \"Both matter\" or unrecognized option → no adjustments.\n\n  const plan: PoolAdjustmentPlanEntry[] = [];\n  for (const a of discriminator.assignments) {\n    plan.push({\n      opportunityId: a.opportunityId,\n      ...buildPoolAdjustment({\n        questionId,\n        recipientUserId,\n        intentId,\n        label: discriminator.label,\n        assignedSide: a.side,\n        chosenSide: chosen,\n        appliedAt: now,\n        ...(intentFingerprint !== undefined ? { intentFingerprint } : {}),\n      }),\n    });\n  }\n  return plan;\n}\n\n/**\n * Merges one adjustment into an opportunity's existing metadata, replacing\n * only the entry for the same question + recipient + intent provenance.\n * Returns the NEW metadata object (caller persists it wholesale).\n */\nexport function mergePoolAdjustment(\n  metadata: Record<string, unknown> | null | undefined,\n  adjustment: PoolAdjustment,\n): Record<string, unknown> {\n  const existing = readPoolAdjustments(metadata).filter((a) => !(\n    a.questionId === adjustment.questionId &&\n    a.recipientUserId === adjustment.recipientUserId &&\n    a.intentId === adjustment.intentId\n  ));\n  return { ...(metadata ?? {}), poolAdjustments: [...existing, adjustment] };\n}\n\n/** Latest scoped user-explainable demotion detail for card presentation. */\nexport function latestPoolDemotionDetail(\n  metadata: Record<string, unknown> | null | undefined,\n  provenance: PoolAdjustmentProvenance,\n): string | undefined {\n  return [...readActivePoolAdjustments(metadata, provenance)]\n    .reverse()\n    .find((adjustment) => adjustment.factor < 1 && typeof adjustment.detail === 'string' && adjustment.detail.length > 0)\n    ?.detail;\n}\n"]}

package/dist/opportunity/discriminator/discriminator.assigner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.assigner.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.assigner.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAM3E,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAY9D,QAAA,MAAM,UAAU;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAGd,CAAC;AAWH,KAAK,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,CAAC;AAY1C,0EAA0E;AAC1E,MAAM,WAAW,+BAA+B;IAC9C,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,mCAAmC;AACnC,MAAM,WAAW,gCAAgC;IAC/C,IAAI,EAAE,+BAA+B,EAAE,CAAC;IACxC,UAAU,EAAE,aAAa,EAAE,CAAC;CAC7B;AAED,iFAAiF;AACjF,MAAM,WAAW,oCAAoC;IACnD,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED,+EAA+E;AAC/E,MAAM,WAAW,6BAA6B;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,oCAAoC,EAAE,CAAC;CACrD;AAED,kEAAkE;AAClE,MAAM,WAAW,+BAA+B;IAC9C,WAAW,CAAC,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3D;AAED,sEAAsE;AACtE,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,gCAAgC,GAAG,MAAM,CAWrF;AAED,6EAA6E;AAC7E,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,OAAO,EACZ,KAAK,EAAE,gCAAgC,GACtC,6BAA6B,GAAG,IAAI,CAwCtC;AAED,uDAAuD;AACvD,qBAAa,yBAAyB;IACpC,OAAO,CAAC,KAAK,CAA+D;gBAEhE,MAAM,CAAC,EAAE,+BAA+B;IASpD;;;;OAIG;IAEG,MAAM,CACV,KAAK,EAAE,gCAAgC,EACvC,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GACjC,OAAO,CAAC,6BAA6B,EAAE,CAAC;CA6B5C"}

package/dist/opportunity/discriminator/discriminator.assigner.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.assigner.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.assigner.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAC/E,OAAO,EAAE,KAAK,EAAE,MAAM,2CAA2C,CAAC;AAClE,OAAO,EAAE,iCAAiC,EAAE,MAAM,wBAAwB,CAAC;AAC3E,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAG/D,uEAAuE;AACvE,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,MAAM,GAAG,cAAc,CAAC,2BAA2B,CAAC,CAAC;AAE3D,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IAChC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE;IACvB,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IAC3B,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;CACzC,CAAC,CAAC;AAEH,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE;IACtB,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,iCAAiC,CAAC;CAC9E,CAAC,CAAC;AAEH,4EAA4E;AAC5E,6EAA6E;AAC7E,4DAA4D;AAC5D,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC;IAClC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACjC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAC,QAAQ,EAAE;CACzF,CAAC,CAAC,WAAW,EAAE,CAAC;AACjB,MAAM,cAAc,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;AAIhG,MAAM,aAAa,GAAG;;;;;;;;kEAQ4C,CAAC;AAiCnE,sEAAsE;AACtE,MAAM,UAAU,qBAAqB,CAAC,KAAuC;IAC3E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACrC,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,KAAK,EAAE,IAAI,CAAC,KAAK;KAClB,CAAC,CAAC,CAAC;IACJ,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACtD,WAAW,EAAE,SAAS,CAAC,EAAE;QACzB,aAAa,EAAE,SAAS,CAAC,aAAa;KACvC,CAAC,CAAC,CAAC;IACJ,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACvD,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,kBAAkB,CAChC,GAAY,EACZ,KAAuC;IAEvC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,UAAU,CAAC,CAAC;IAChF,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgD,CAAC;IAC1E,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QACxD,IAAI,OAAO,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC;YAAE,SAAS;QAC7E,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE;gBACpC,WAAW,EAAE,UAAU,CAAC,WAAW;gBACnC,IAAI,EAAE,IAAI;gBACV,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE;gBACpC,WAAW,EAAE,UAAU,CAAC,WAAW;gBACnC,IAAI,EAAE,IAAI;gBACV,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE;YACpC,WAAW,EAAE,UAAU,CAAC,WAAW;YACnC,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;SAC9B,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,WAAW,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI;YAC9E,WAAW,EAAE,SAAS,CAAC,EAAE;YACzB,IAAI,EAAE,IAAI;YACV,QAAQ,EAAE,IAAI;SACf,CAAC;KACH,CAAC;AACJ,CAAC;AAED,uDAAuD;AACvD,MAAM,OAAO,yBAAyB;IAGpC,YAAY,MAAwC;QAClD,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAChC,2BAA2B,EAC3B,cAAc,EACd,EAAE,IAAI,EAAE,0BAA0B,EAAE,EACpC,MAAM,EAAE,WAAW,CACpB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IAEG,AAAN,KAAK,CAAC,MAAM,CACV,KAAuC,EACvC,OAAkC;QAElC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACxE,MAAM,YAAY,GAAqC;YACrD,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC;YAC9C,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,iCAAiC,CAAC;SACzE,CAAC;QACF,MAAM,GAAG,GAAG,MAAM,qBAAqB,CACrC,IAAI,CAAC,KAAK,EACV,CAAC,IAAI,aAAa,CAAC,aAAa,CAAC,EAAE,IAAI,YAAY,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,EACzF,OAAO,EAAE,MAAM,CAChB,CAAC;QACF,MAAM,MAAM,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,8CAA8C,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YACpG,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,QAAQ,GAAoC,EAAE,CAAC;QACrD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;gBAAE,SAAS;YAC9D,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAC3D,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAhCO;IADL,KAAK,EAAE;;;;uDAgCP","sourcesContent":["/**\n * Evidence-verified assignment of call-local newborn candidates to already\n * answered pool-discriminator axes (IND-420 P4b).\n *\n * One structured model call batches every fixed axis and candidate. The model\n * never receives the owner's chosen side; it only classifies public candidate\n * context. Code owns all identifiers, allowed sides, and evidence verification.\n */\nimport { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\n\nimport { createStructuredModel } from \"../../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../../shared/agent/model-signal.js\";\nimport { protocolLogger } from \"../../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../../shared/observability/performance.js\";\nimport { POOL_DISCRIMINATOR_MAX_CANDIDATES } from \"./discriminator.env.js\";\nimport { poolEvidenceMatches } from \"./discriminator.miner.js\";\nimport type { PoolCandidate } from \"./discriminator.types.js\";\n\n/** QuestionerAdapter caps fresh answered preferences at this count. */\nconst MAX_ASSIGNMENT_AXES = 10;\nconst logger = protocolLogger(\"PoolDiscriminatorAssigner\");\n\nconst AssignmentSchema = z.object({\n  candidateId: z.string(),\n  side: z.string().nullable(),\n  evidence: z.string().max(200).nullable(),\n});\n\nconst AxisSchema = z.object({\n  questionId: z.string(),\n  assignments: z.array(AssignmentSchema).max(POOL_DISCRIMINATOR_MAX_CANDIDATES),\n});\n\n// Keep fields optional at the outer response layer so one malformed/missing\n// axis can be skipped independently, while still bounding and describing the\n// nested assignment payload sent through structured output.\nconst ResponseAxisSchema = z.object({\n  questionId: z.string().optional(),\n  assignments: z.array(AssignmentSchema).max(POOL_DISCRIMINATOR_MAX_CANDIDATES).optional(),\n}).passthrough();\nconst ResponseSchema = z.object({ axes: z.array(ResponseAxisSchema).max(MAX_ASSIGNMENT_AXES) });\ntype AssignmentResponse = z.infer<typeof ResponseSchema>;\ntype RawAxis = z.infer<typeof AxisSchema>;\n\nconst SYSTEM_PROMPT = `Classify candidate matches against FIXED preference axes.\n\nRules:\n- Use only the supplied questionId, candidateId, and side labels. Never invent or rename them.\n- Return one axis object per supplied question and one assignment per candidate.\n- Pick a side only when the candidate context clearly supports it; otherwise use side null and evidence null.\n- Every non-null side requires a short VERBATIM substring copied from that candidate's context. It is checked mechanically.\n- Do not infer the user's preference. You are classifying candidates, not choosing which side is better.\n- Return only questionId, candidateId, side, and evidence fields.`;\n\n/** Fixed answered axis; deliberately excludes the owner's chosen side. */\nexport interface PoolDiscriminatorAssignmentAxis {\n  questionId: string;\n  label: string;\n  sides: string[];\n}\n\n/** One batched assignment call. */\nexport interface PoolDiscriminatorAssignmentInput {\n  axes: PoolDiscriminatorAssignmentAxis[];\n  candidates: PoolCandidate[];\n}\n\n/** Verified assignment. Invalid or explicit unknown classifications use null. */\nexport interface PoolDiscriminatorCandidateAssignment {\n  candidateId: string;\n  side: string | null;\n  evidence: string | null;\n}\n\n/** One valid returned axis. Missing or malformed axes are omitted entirely. */\nexport interface PoolDiscriminatorAssignedAxis {\n  questionId: string;\n  assignments: PoolDiscriminatorCandidateAssignment[];\n}\n\n/** Construction options for {@link PoolDiscriminatorAssigner}. */\nexport interface PoolDiscriminatorAssignerConfig {\n  modelConfig?: Parameters<typeof createStructuredModel>[3];\n}\n\n/** Build the classifier prompt without any chosen-side preference. */\nexport function buildAssignmentPrompt(input: PoolDiscriminatorAssignmentInput): string {\n  const axes = input.axes.map((axis) => ({\n    questionId: axis.questionId,\n    label: axis.label,\n    sides: axis.sides,\n  }));\n  const candidates = input.candidates.map((candidate) => ({\n    candidateId: candidate.id,\n    publicContext: candidate.publicContext,\n  }));\n  return JSON.stringify({ axes, candidates }, null, 2);\n}\n\n/** Verify one model-returned axis against fixed IDs, sides, and contexts. */\nexport function verifyAssignedAxis(\n  raw: RawAxis,\n  input: PoolDiscriminatorAssignmentInput,\n): PoolDiscriminatorAssignedAxis | null {\n  const fixedAxis = input.axes.find((axis) => axis.questionId === raw.questionId);\n  if (!fixedAxis) return null;\n\n  const contextById = new Map(input.candidates.map((candidate) => [candidate.id, candidate.publicContext]));\n  const firstById = new Map<string, PoolDiscriminatorCandidateAssignment>();\n  for (const assignment of raw.assignments) {\n    const context = contextById.get(assignment.candidateId);\n    if (context === undefined || firstById.has(assignment.candidateId)) continue;\n    if (assignment.side === null) {\n      firstById.set(assignment.candidateId, {\n        candidateId: assignment.candidateId,\n        side: null,\n        evidence: null,\n      });\n      continue;\n    }\n    if (!fixedAxis.sides.includes(assignment.side) || !poolEvidenceMatches(context, assignment.evidence)) {\n      firstById.set(assignment.candidateId, {\n        candidateId: assignment.candidateId,\n        side: null,\n        evidence: null,\n      });\n      continue;\n    }\n    firstById.set(assignment.candidateId, {\n      candidateId: assignment.candidateId,\n      side: assignment.side,\n      evidence: assignment.evidence,\n    });\n  }\n\n  return {\n    questionId: fixedAxis.questionId,\n    assignments: input.candidates.map((candidate) => firstById.get(candidate.id) ?? {\n      candidateId: candidate.id,\n      side: null,\n      evidence: null,\n    }),\n  };\n}\n\n/** Stateless one-call newborn candidate classifier. */\nexport class PoolDiscriminatorAssigner {\n  private model: ReturnType<typeof createStructuredModel<AssignmentResponse>>;\n\n  constructor(config?: PoolDiscriminatorAssignerConfig) {\n    this.model = createStructuredModel<AssignmentResponse>(\n      \"poolDiscriminatorAssigner\",\n      ResponseSchema,\n      { name: \"pool_newborn_assignments\" },\n      config?.modelConfig,\n    );\n  }\n\n  /**\n   * Classify every candidate against every fixed axis in one provider call.\n   * Provider failures propagate so the host graph's fail-open seam can retain\n   * the original un-stamped create items.\n   */\n  @Timed()\n  async assign(\n    input: PoolDiscriminatorAssignmentInput,\n    options?: { signal?: AbortSignal },\n  ): Promise<PoolDiscriminatorAssignedAxis[]> {\n    if (input.axes.length === 0 || input.candidates.length === 0) return [];\n    const boundedInput: PoolDiscriminatorAssignmentInput = {\n      axes: input.axes.slice(0, MAX_ASSIGNMENT_AXES),\n      candidates: input.candidates.slice(0, POOL_DISCRIMINATOR_MAX_CANDIDATES),\n    };\n    const raw = await invokeWithAbortSignal(\n      this.model,\n      [new SystemMessage(SYSTEM_PROMPT), new HumanMessage(buildAssignmentPrompt(boundedInput))],\n      options?.signal,\n    );\n    const parsed = ResponseSchema.safeParse(raw);\n    if (!parsed.success) {\n      logger.warn(\"Assignment response failed schema validation\", { issues: parsed.error.issues.length });\n      return [];\n    }\n\n    const seen = new Set<string>();\n    const verified: PoolDiscriminatorAssignedAxis[] = [];\n    for (const rawAxis of parsed.data.axes) {\n      const axis = AxisSchema.safeParse(rawAxis);\n      if (!axis.success || seen.has(axis.data.questionId)) continue;\n      const result = verifyAssignedAxis(axis.data, boundedInput);\n      if (!result) continue;\n      seen.add(result.questionId);\n      verified.push(result);\n    }\n    return verified;\n  }\n}\n"]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.env.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,+CAA+C;AAC/C,MAAM,MAAM,uBAAuB,GAAG,KAAK,GAAG,QAAQ,CAAC;AAEvD,wDAAwD;AACxD,wBAAgB,uBAAuB,IAAI,uBAAuB,CAEjE;AAED,uDAAuD;AACvD,MAAM,MAAM,iBAAiB,GAAG,KAAK,GAAG,IAAI,CAAC;AAE7C;;;;;GAKG;AACH,wBAAgB,iBAAiB,IAAI,iBAAiB,CAErD;AAED,gEAAgE;AAChE,MAAM,MAAM,qBAAqB,GAAG,KAAK,GAAG,IAAI,CAAC;AAEjD;;;GAGG;AACH,wBAAgB,qBAAqB,IAAI,qBAAqB,CAE7D;AAED,yEAAyE;AACzE,MAAM,MAAM,6BAA6B,GAAG,KAAK,GAAG,IAAI,CAAC;AAEzD;;;;;;;;GAQG;AACH,wBAAgB,yBAAyB,IAAI,6BAA6B,CAEzE;AAED;;;;GAIG;AACH,eAAO,MAAM,6BAA6B,QAAqB,CAAC;AAEhE,uDAAuD;AACvD,MAAM,MAAM,6BAA6B,GAAG,KAAK,GAAG,IAAI,CAAC;AAEzD;;;GAGG;AACH,wBAAgB,yBAAyB,IAAI,6BAA6B,CAEzE;AAED,uEAAuE;AACvE,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC,mFAAmF;AACnF,eAAO,MAAM,+BAA+B,MAAM,CAAC;AAEnD,gFAAgF;AAChF,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,uEAAuE;AACvE,eAAO,MAAM,oCAAoC,IAAI,CAAC;AAEtD,kEAAkE;AAClE,eAAO,MAAM,2BAA2B,MAAM,CAAC;AAE/C,uEAAuE;AACvE,eAAO,MAAM,kCAAkC,OAAO,CAAC;AAEvD,uEAAuE;AACvE,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,uEAAuE;AACvE,eAAO,MAAM,4BAA4B,IAAI,CAAC;AAE9C,mDAAmD;AACnD,MAAM,MAAM,wBAAwB,GAAG,KAAK,GAAG,IAAI,CAAC;AAEpD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,IAAI,wBAAwB,CAE/D;AAED,4EAA4E;AAC5E,eAAO,MAAM,4BAA4B,MAAM,CAAC;AAEhD,6EAA6E;AAC7E,eAAO,MAAM,8BAA8B,MAAM,CAAC;AAElD,8EAA8E;AAC9E,eAAO,MAAM,qBAAqB,MAAM,CAAC;AAEzC,8EAA8E;AAC9E,eAAO,MAAM,sBAAsB,QAAS,CAAC;AAE7C;;;;GAIG;AACH,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,6DAA6D;AAC7D,eAAO,MAAM,iCAAiC,KAAK,CAAC;AAEpD,qEAAqE;AACrE,eAAO,MAAM,2CAA2C,MAAM,CAAC"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.env.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.env.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,wDAAwD;AACxD,MAAM,UAAU,uBAAuB;IACrC,OAAO,OAAO,CAAC,GAAG,CAAC,qBAAqB,EAAE,IAAI,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;AACnF,CAAC;AAKD;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AACzE,CAAC;AAKD;;;GAGG;AACH,MAAM,UAAU,qBAAqB;IACnC,OAAO,OAAO,CAAC,GAAG,CAAC,mBAAmB,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AACzE,CAAC;AAKD;;;;;;;;GAQG;AACH,MAAM,UAAU,yBAAyB;IACvC,OAAO,OAAO,CAAC,GAAG,CAAC,4BAA4B,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAClF,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAKhE;;;GAGG;AACH,MAAM,UAAU,yBAAyB;IACvC,OAAO,OAAO,CAAC,GAAG,CAAC,4BAA4B,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAClF,CAAC;AAED,uEAAuE;AACvE,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC,mFAAmF;AACnF,MAAM,CAAC,MAAM,+BAA+B,GAAG,GAAG,CAAC;AAEnD,gFAAgF;AAChF,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,uEAAuE;AACvE,MAAM,CAAC,MAAM,oCAAoC,GAAG,CAAC,CAAC;AAEtD,kEAAkE;AAClE,MAAM,CAAC,MAAM,2BAA2B,GAAG,GAAG,CAAC;AAE/C,uEAAuE;AACvE,MAAM,CAAC,MAAM,kCAAkC,GAAG,IAAI,CAAC;AAEvD,uEAAuE;AACvE,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,uEAAuE;AACvE,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,CAAC;AAK9C;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB;IAClC,OAAO,OAAO,CAAC,GAAG,CAAC,sBAAsB,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5E,CAAC;AAED,4EAA4E;AAC5E,MAAM,CAAC,MAAM,4BAA4B,GAAG,GAAG,CAAC;AAEhD,6EAA6E;AAC7E,MAAM,CAAC,MAAM,8BAA8B,GAAG,GAAG,CAAC;AAElD,8EAA8E;AAC9E,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC,8EAA8E;AAC9E,MAAM,CAAC,MAAM,sBAAsB,GAAG,KAAM,CAAC;AAE7C;;;;GAIG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,6DAA6D;AAC7D,MAAM,CAAC,MAAM,iCAAiC,GAAG,EAAE,CAAC;AAEpD,qEAAqE;AACrE,MAAM,CAAC,MAAM,2CAA2C,GAAG,GAAG,CAAC","sourcesContent":["/**\n * Centralized accessors for pool-question environment variables (IND-416).\n *\n *   POOL_QUESTIONS_MINING   off | shadow — P1 shadow axis mining on\n *                           discovery-run completion. `shadow` mines and\n *                           scores axes and logs them; no questions are\n *                           generated and no user-facing behavior changes.\n *                           Any value other than \"shadow\" (including unset)\n *                           means off.\n *\n * All reads go through this module — do not read these variables via\n * `process.env` elsewhere. Values are read on every call (no caching) so\n * tests and long-lived processes observe changes.\n */\n\n/** Mining mode for pool discriminator axes. */\nexport type PoolQuestionsMiningMode = \"off\" | \"shadow\";\n\n/** Current POOL_QUESTIONS_MINING mode (default off). */\nexport function poolQuestionsMiningMode(): PoolQuestionsMiningMode {\n  return process.env.POOL_QUESTIONS_MINING?.trim() === \"shadow\" ? \"shadow\" : \"off\";\n}\n\n/** Question mode for pool discriminators (IND-418). */\nexport type PoolQuestionsMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_MODE (default off). When \"on\", the mining hook also\n * enqueues a pool_discovery question for the top eligible discriminator\n * (still subject to the QUESTIONER_ENABLED master gate and per-intent budget).\n * \"on\" implies mining runs even when POOL_QUESTIONS_MINING is off.\n */\nexport function poolQuestionsMode(): PoolQuestionsMode {\n  return process.env.POOL_QUESTIONS_MODE?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Push delivery mode for high-VoI pool questions (IND-421). */\nexport type PoolQuestionsPushMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_PUSH mode (default off). Callers must additionally\n * require pool-question mode and negotiator availability before delivery.\n */\nexport function poolQuestionsPushMode(): PoolQuestionsPushMode {\n  return process.env.POOL_QUESTIONS_PUSH?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Visit-triggered pool-mining mode (IND-439 visibility-audit slice). */\nexport type PoolQuestionsVisitTriggerMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_VISIT_TRIGGER mode (default off). When \"on\", an\n * intent owner's intent-page pending-questions fetch may enqueue a debounced\n * pool-mining pass for that intent when no live pending pool_discovery\n * question exists. The trigger only adds a *when* — every existing mining\n * gate (POOL_QUESTIONS_MODE, k-anonymity floor, VoI threshold, per-intent\n * budgets, fingerprint freshness, push budgets) applies unchanged, so this\n * is a no-op unless {@link poolQuestionsMode} is also \"on\".\n */\nexport function poolQuestionsVisitTrigger(): PoolQuestionsVisitTriggerMode {\n  return process.env.POOL_QUESTIONS_VISIT_TRIGGER?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/**\n * Debounce window for visit-triggered pool mining, per intent (IND-439).\n * At most one visit-triggered mining run per intent per window, enforced via\n * BullMQ deduplication — no new tables.\n */\nexport const POOL_VISIT_MINING_DEBOUNCE_MS = 6 * 60 * 60 * 1000;\n\n/** Newborn-opportunity stamping mode (IND-420 P4b). */\nexport type PoolQuestionsStampNewbornMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_STAMP_NEWBORN mode (default off). Effective callers\n * additionally require {@link poolQuestionsMode} to be on.\n */\nexport function poolQuestionsStampNewborn(): PoolQuestionsStampNewbornMode {\n  return process.env.POOL_QUESTIONS_STAMP_NEWBORN?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Minimum VoI for a discriminator to become (or chain) a question. */\nexport const POOL_QUESTION_MIN_VOI = 0.2;\n\n/** Minimum evidence-verification rate for a discriminator to become a question. */\nexport const POOL_QUESTION_MIN_EVIDENCE_RATE = 0.6;\n\n/** Max eligible discriminators carried per mining pass (asked + alternates). */\nexport const POOL_QUESTION_MAX_DISCRIMINATORS = 3;\n\n/** Unattended budget: max pending questions of ANY mode per intent. */\nexport const POOL_QUESTION_MAX_PENDING_PER_INTENT = 3;\n\n/** Initial internal VoI threshold for proactive push delivery. */\nexport const POOL_QUESTION_PUSH_BASE_VOI = 0.6;\n\n/** Multiplicative VoI threshold increase per consecutive dismissal. */\nexport const POOL_QUESTION_PUSH_DISMISSAL_DECAY = 1.15;\n\n/** Minimum pool size for proactive delivery (stricter than mining). */\nexport const POOL_QUESTION_PUSH_MIN_POOL_SIZE = 8;\n\n/** Maximum claimed proactive pool pushes per recipient per UTC day. */\nexport const POOL_QUESTION_PUSH_DAILY_CAP = 2;\n\n/** Ranking mode for pool adjustments (IND-419). */\nexport type PoolQuestionsRankingMode = \"off\" | \"on\";\n\n/**\n * Current POOL_QUESTIONS_RANKING (default off). When \"on\", the home feed\n * orders by adjusted confidence (confidence × Π poolAdjustments.factor,\n * floor {@link POOL_ADJUSTMENT_FLOOR}). Adjustments are WRITTEN regardless of\n * this flag — it only gates whether ordering reads them, so the apply path\n * can ship first.\n */\nexport function poolQuestionsRanking(): PoolQuestionsRankingMode {\n  return process.env.POOL_QUESTIONS_RANKING?.trim() === \"on\" ? \"on\" : \"off\";\n}\n\n/** Adjustment factor for candidates on the side the user did NOT choose. */\nexport const POOL_ADJUSTMENT_FACTOR_OTHER = 0.6;\n\n/** Adjustment factor for candidates the miner could not assign (unknown). */\nexport const POOL_ADJUSTMENT_FACTOR_UNKNOWN = 0.9;\n\n/** Floor for the cumulative adjustment multiplier — demoted, never hidden. */\nexport const POOL_ADJUSTMENT_FLOOR = 0.3;\n\n/** Debounce window for answer-triggered re-discovery (Tier 1), per intent. */\nexport const POOL_RERUN_DEBOUNCE_MS = 60_000;\n\n/**\n * k-anonymity floor: axes are only mined when the pool has at least this many\n * candidates, so no axis (or later, question option) can be traced back to a\n * specific individual.\n */\nexport const POOL_DISCRIMINATOR_MIN_POOL_SIZE = 5;\n\n/** Max candidates sent to the miner LLM (top-N by score). */\nexport const POOL_DISCRIMINATOR_MAX_CANDIDATES = 24;\n\n/** Max chars of public context per candidate in the miner prompt. */\nexport const POOL_DISCRIMINATOR_MAX_PUBLIC_CONTEXT_CHARS = 400;\n"]}

package/dist/opportunity/discriminator/discriminator.miner.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.miner.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.miner.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAI3E,OAAO,KAAK,EAAE,kBAAkB,EAAE,wBAAwB,EAAsB,MAAM,0BAA0B,CAAC;AAOjH,QAAA,MAAM,wBAAwB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAoC5B,CAAC;AAEH,KAAK,kBAAkB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,wBAAwB,CAAC,CAAC;AAkBnE,sDAAsD;AACtD,MAAM,WAAW,4BAA4B;IAC3C,mEAAmE;IACnE,WAAW,CAAC,EAAE,UAAU,CAAC,OAAO,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3D;AAED;;;;GAIG;AACH,wBAAgB,6BAA6B,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAS/D;AAED;;;;GAIG;AACH,wBAAgB,gCAAgC,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAElE;AAKD,iEAAiE;AACjE,wBAAgB,mBAAmB,CAAC,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,CAK3F;AAED;;;GAGG;AACH,qBAAa,sBAAsB;IACjC,OAAO,CAAC,KAAK,CAA+D;gBAEhE,MAAM,CAAC,EAAE,4BAA4B;IASjD;;;;;OAKG;IAEG,IAAI,CACR,KAAK,EAAE,wBAAwB,EAC/B,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,GACjC,OAAO,CAAC,kBAAkB,EAAE,CAAC;CAcjC;AAED,gFAAgF;AAChF,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,wBAAwB,GAAG,MAAM,CAQzE;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CACxB,IAAI,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EACxC,UAAU,EAAE,wBAAwB,CAAC,YAAY,CAAC,GACjD,kBAAkB,CAwEpB"}

package/dist/opportunity/discriminator/discriminator.miner.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.miner.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.miner.ts"],"names":[],"mappings":";;;;;;;;;AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAC/E,OAAO,EAAE,KAAK,EAAE,MAAM,2CAA2C,CAAC;AAGlE,MAAM,MAAM,GAAG,cAAc,CAAC,wBAAwB,CAAC,CAAC;AAExD,qEAAqE;AACrE,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,MAAM,wBAAwB,GAAG,CAAC,CAAC,MAAM,CAAC;IACxC,IAAI,EAAE,CAAC;SACJ,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC;aACJ,MAAM,EAAE;aACR,QAAQ,CAAC,iFAAiF,CAAC;QAC9F,YAAY,EAAE,CAAC;aACZ,MAAM,EAAE;aACR,QAAQ,CAAC,sEAAsE,CAAC;QACnF,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;aACjB,GAAG,CAAC,CAAC,CAAC;aACN,GAAG,CAAC,CAAC,CAAC;aACN,QAAQ,CAAC,qDAAqD,CAAC;QAClE,WAAW,EAAE,CAAC;aACX,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;YACP,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+BAA+B,CAAC;YACxD,IAAI,EAAE,CAAC;iBACJ,MAAM,EAAE;iBACR,QAAQ,EAAE;iBACV,QAAQ,CAAC,0EAA0E,CAAC;YACvF,QAAQ,EAAE,CAAC;iBACR,MAAM,EAAE;iBACR,GAAG,CAAC,GAAG,CAAC;iBACR,QAAQ,EAAE;iBACV,QAAQ,CACP,gHAAgH,CACjH;SACJ,CAAC,CACH;aACA,QAAQ,CAAC,yBAAyB,CAAC;KACvC,CAAC,CACH;SACA,GAAG,CAAC,QAAQ,CAAC;CACjB,CAAC,CAAC;AAIH,MAAM,aAAa,GAAG;;;;;;;;;;;;;;2HAcqG,QAAQ,+CAA+C,CAAC;AAQnL;;;;GAIG;AACH,MAAM,UAAU,6BAA6B,CAAC,CAAS;IACrD,OAAO,CAAC;SACL,WAAW,EAAE;SACb,OAAO,CAAC,uBAAuB,EAAE,GAAG,CAAC;SACrC,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC;SACzB,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gCAAgC,CAAC,CAAS;IACxD,OAAO,CAAC,CAAC,OAAO,CAAC,0CAA0C,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,0CAA0C,EAAE,EAAE,CAAC,CAAC;AAC3H,CAAC;AAED,2EAA2E;AAC3E,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC,iEAAiE;AACjE,MAAM,UAAU,mBAAmB,CAAC,aAAqB,EAAE,QAAuB;IAChF,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,MAAM,OAAO,GAAG,6BAA6B,CAAC,aAAa,CAAC,CAAC;IAC7D,MAAM,YAAY,GAAG,6BAA6B,CAAC,gCAAgC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC/F,OAAO,YAAY,CAAC,MAAM,IAAI,uBAAuB,IAAI,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;AAC1F,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,sBAAsB;IAGjC,YAAY,MAAqC;QAC/C,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAChC,wBAAwB,EACxB,wBAAwB,EACxB,EAAE,IAAI,EAAE,WAAW,EAAE,EACrB,MAAM,EAAE,WAAW,CACpB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IAEG,AAAN,KAAK,CAAC,IAAI,CACR,KAA+B,EAC/B,OAAkC;QAElC,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,qBAAqB,CACrC,IAAI,CAAC,KAAK,EACV,CAAC,IAAI,aAAa,CAAC,aAAa,CAAC,EAAE,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,EAC5D,OAAO,EAAE,MAAM,CAChB,CAAC;QACF,MAAM,MAAM,GAAG,wBAAwB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,0CAA0C,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YAChG,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/F,CAAC;CACF;AAjBO;IADL,KAAK,EAAE;;;;kDAiBP;AAGH,gFAAgF;AAChF,MAAM,UAAU,iBAAiB,CAAC,KAA+B;IAC/D,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU;SACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,aAAa,EAAE,CAAC;SAC3C,IAAI,CAAC,MAAM,CAAC,CAAC;IAChB,OAAO;QACL,YAAY,KAAK,CAAC,UAAU,EAAE;QAC9B,mBAAmB,KAAK,CAAC,UAAU,CAAC,MAAM,oCAAoC,eAAe,EAAE;KAChG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CACxB,IAAwC,EACxC,UAAkD;IAElD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAClE,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,KAAK,CAAC,OAAO,CAAC;WACvD,IAAI,GAAG,CAAC,mBAAmB,CAAC,CAAC,IAAI,KAAK,mBAAmB,CAAC,MAAM,CAAC;IACtE,MAAM,yBAAyB,GAAG,IAAI,GAAG,CACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAU,CAAC,CACvD,CAAC;IACF,MAAM,aAAa,GAAG,IAAI,GAAG,EAAgD,CAAC;IAE9E,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QAC1E,MAAM,cAAc,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAI,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;YAClB,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;QACD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;QACjD,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1B,KAAK,CAAC,GAAG,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAA8B,CAAC;IACnD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;QACxC,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC;QACvB,uEAAuE;QACvE,uEAAuE;QACvE,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YAClE,SAAS;QACX,CAAC;QAED,MAAM,CAAC,CAAC,cAAc,EAAE,iBAAiB,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACzD,MAAM,aAAa,GAAG,yBAAyB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QACpE,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACrC,MAAM,aAAa,GAAG,aAAa;YACjC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,mBAAmB,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACvF,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,aAAa,IAAI,aAAa,EAAE,CAAC;YACnC,QAAQ,EAAE,CAAC;YACX,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;gBACX,EAAE;gBACF,IAAI,EAAE,aAAa;gBACnB,QAAQ,EAAE,aAAa,CAAC,QAAQ;gBAChC,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;gBACX,EAAE;gBACF,IAAI,EAAE,IAAI;gBACV,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,IAAI;gBAChD,QAAQ,EAAE,KAAK;aAChB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAyB,UAAU,CAAC,GAAG,CACtD,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;WAChC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CACvE,CAAC;IAEF,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,IAAI;QAChB,YAAY,EAAE,IAAI,CAAC,YAAY;QAC/B,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,WAAW;QACX,YAAY,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;KACrD,CAAC;AACJ,CAAC","sourcesContent":["/**\n * PoolDiscriminatorMiner — one structured LLM pass that proposes discriminating axes\n * over a discovery-run candidate pool, with code-side evidence verification\n * (IND-417).\n *\n * Anti-hallucination contract: every side assignment must quote a short\n * evidence span from that candidate's supplied publicContext. Verification is\n * done in code (substring match, case/whitespace-insensitive), NOT trusted\n * from the prompt. Failed verifications are demoted to `unknown`, which\n * lowers coverage → lowers VoI → buries the axis. The failure mode\n * self-punishes.\n *\n * Follows the QuestionerAgent pattern: constructor binds the structured\n * model once; single public `mine()` per call.\n */\nimport { HumanMessage, SystemMessage } from \"@langchain/core/messages\";\nimport { z } from \"zod\";\n\nimport { createStructuredModel } from \"../../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../../shared/agent/model-signal.js\";\nimport { protocolLogger } from \"../../shared/observability/protocol.logger.js\";\nimport { Timed } from \"../../shared/observability/performance.js\";\nimport type { MinedDiscriminator, DiscriminatorMiningInput, VerifiedAssignment } from \"./discriminator.types.js\";\n\nconst logger = protocolLogger(\"PoolDiscriminatorMiner\");\n\n/** Max axes requested from (and accepted out of) one mining pass. */\nconst MAX_AXES = 6;\n\nconst AxisMiningResponseSchema = z.object({\n  axes: z\n    .array(\n      z.object({\n        axis: z\n          .string()\n          .describe(\"Short discriminating-axis label, e.g. 'Hands-on builders vs strategic advisors'\"),\n        questionSeed: z\n          .string()\n          .describe(\"A direct question the intent owner could answer to resolve this axis\"),\n        sides: z\n          .array(z.string())\n          .min(2)\n          .max(3)\n          .describe(\"2-3 mutually exclusive side labels (2-5 words each)\"),\n        assignments: z\n          .array(\n            z.object({\n              id: z.string().describe(\"Candidate id exactly as given\"),\n              side: z\n                .string()\n                .nullable()\n                .describe(\"One of this axis's side labels, or null when the context is insufficient\"),\n              evidence: z\n                .string()\n                .max(200)\n                .nullable()\n                .describe(\n                  \"VERBATIM span (≤80 chars) copied from this candidate's context that justifies the side. null when side is null\",\n                ),\n            }),\n          )\n          .describe(\"One entry per candidate\"),\n      }),\n    )\n    .max(MAX_AXES),\n});\n\ntype AxisMiningResponse = z.infer<typeof AxisMiningResponseSchema>;\n\nconst SYSTEM_PROMPT = `You analyze a pool of candidate matches for one user intent and propose the preference axes that best SPLIT the pool into meaningfully different groups.\n\nRules for every axis:\n- Sides must be mutually exclusive readings of one dimension (a candidate belongs to at most one side).\n- The axis must NOT already be determined by the intent text itself — only propose axes the intent leaves genuinely open.\n- The axis must be phrased as a preference the intent OWNER could hold and answer (the questionSeed asks them directly).\n- Side labels are terse (2-5 words), concrete, and derived from patterns across MULTIPLE candidates — never from a single person and never naming anyone.\n- BANNED axis families: protected attributes (race, ethnicity, religion, gender, age, nationality, disability, politics, sexual orientation), and vanity/noise splits (profile completeness, bio length, has photo, name alphabet).\n\nRules for assignments:\n- Assign EVERY candidate: pick a side only when the candidate's context contains clear support; otherwise use side null.\n- When you pick a side you MUST quote a short (≤80 chars) VERBATIM substring of that candidate's context as evidence. Copy it exactly — it is checked mechanically, and paraphrased evidence is discarded. Do NOT add punctuation that is not in the source (no trailing period); cutting off mid-sentence is fine.\n- Never invent context. If unsure, use side null with evidence null.\n\nPrefer axes that split the pool close to evenly and that cover many candidates with verifiable evidence. Propose at most ${MAX_AXES} axes; fewer strong axes beat many weak ones.`;\n\n/** Config for PoolDiscriminatorMiner construction. */\nexport interface PoolDiscriminatorMinerConfig {\n  /** Optional model config override (API key / base URL / model). */\n  modelConfig?: Parameters<typeof createStructuredModel>[3];\n}\n\n/**\n * Collapse whitespace, lowercase, and fold typographic punctuation to ASCII\n * (curly quotes/apostrophes, en/em dashes, ellipsis), so evidence matching\n * tolerates formatting drift without weakening the verbatim requirement.\n */\nexport function normalizePoolEvidenceForMatch(s: string): string {\n  return s\n    .toLowerCase()\n    .replace(/[\\u2018\\u2019\\u02bc]/g, \"'\")\n    .replace(/[\\u201c\\u201d]/g, '\"')\n    .replace(/[\\u2013\\u2014]/g, \"-\")\n    .replace(/\\u2026/g, \"...\")\n    .replace(/\\s+/g, \" \")\n    .trim();\n}\n\n/**\n * Strips wrapping quotes and edge punctuation from an evidence span before\n * matching. LLMs habitually sentence-ize copied spans (append a trailing\n * period, wrap in quotes); the meaningful content must still match verbatim.\n */\nexport function stripPoolEvidenceEdgePunctuation(s: string): string {\n  return s.replace(/^[\\s\"'.,;:!?()\\u2018\\u2019\\u201c\\u201d]+/, \"\").replace(/[\\s\"'.,;:!?()\\u2018\\u2019\\u201c\\u201d]+$/, \"\");\n}\n\n/** Minimum normalized span that counts as meaningful verbatim evidence. */\nconst MIN_POOL_EVIDENCE_CHARS = 8;\n\n/** Evidence verifier shared by mining and newborn assignment. */\nexport function poolEvidenceMatches(publicContext: string, evidence: string | null): boolean {\n  if (evidence === null) return false;\n  const context = normalizePoolEvidenceForMatch(publicContext);\n  const evidenceCore = normalizePoolEvidenceForMatch(stripPoolEvidenceEdgePunctuation(evidence));\n  return evidenceCore.length >= MIN_POOL_EVIDENCE_CHARS && context.includes(evidenceCore);\n}\n\n/**\n * Stateless axis-mining agent. One `mine()` call = one structured LLM pass +\n * deterministic evidence verification.\n */\nexport class PoolDiscriminatorMiner {\n  private model: ReturnType<typeof createStructuredModel<AxisMiningResponse>>;\n\n  constructor(config?: PoolDiscriminatorMinerConfig) {\n    this.model = createStructuredModel<AxisMiningResponse>(\n      \"poolDiscriminatorMiner\",\n      AxisMiningResponseSchema,\n      { name: \"pool_axes\" },\n      config?.modelConfig,\n    );\n  }\n\n  /**\n   * Mine discriminating axes for one pool.\n   *\n   * @returns Verified axes (may be empty). Throws on LLM failure — callers\n   *   run this fire-and-forget and must catch.\n   */\n  @Timed()\n  async mine(\n    input: DiscriminatorMiningInput,\n    options?: { signal?: AbortSignal },\n  ): Promise<MinedDiscriminator[]> {\n    const prompt = buildMiningPrompt(input);\n    const raw = await invokeWithAbortSignal(\n      this.model,\n      [new SystemMessage(SYSTEM_PROMPT), new HumanMessage(prompt)],\n      options?.signal,\n    );\n    const parsed = AxisMiningResponseSchema.safeParse(raw);\n    if (!parsed.success) {\n      logger.warn(\"Mining response failed schema validation\", { issues: parsed.error.issues.length });\n      return [];\n    }\n    return parsed.data.axes.slice(0, MAX_AXES).map((axis) => verifyAxis(axis, input.candidates));\n  }\n}\n\n/** Builds the human message: intent text + one numbered block per candidate. */\nexport function buildMiningPrompt(input: DiscriminatorMiningInput): string {\n  const candidateBlocks = input.candidates\n    .map((c) => `[${c.id}]\\n${c.publicContext}`)\n    .join(\"\\n\\n\");\n  return [\n    `Intent:\\n${input.intentText}`,\n    `Candidate pool (${input.candidates.length} candidates, id in brackets):\\n\\n${candidateBlocks}`,\n  ].join(\"\\n\\n\");\n}\n\n/**\n * Deterministic post-pass over one LLM axis:\n * - drops assignments for ids not in the pool,\n * - demotes to unknown: sides not in the axis's side list, missing evidence,\n *   and evidence that does not substring-match the candidate's publicContext,\n * - collapses duplicate proposals to the same trim-normalized side,\n * - demotes a candidate proposed for different sides to unknown (zero support),\n * - guarantees exactly one assignment per pool candidate (missing → unknown),\n * - computes evidenceRate = verified / distinct candidate-side proposals.\n */\nexport function verifyAxis(\n  axis: AxisMiningResponse[\"axes\"][number],\n  candidates: DiscriminatorMiningInput[\"candidates\"],\n): MinedDiscriminator {\n  const contextById = new Map(candidates.map((c) => [c.id, c.publicContext]));\n  const normalizedAxisSides = axis.sides.map((side) => side.trim());\n  const axisSidesAreValid = normalizedAxisSides.every(Boolean)\n    && new Set(normalizedAxisSides).size === normalizedAxisSides.length;\n  const canonicalSideByNormalized = new Map(\n    axis.sides.map((side) => [side.trim(), side] as const),\n  );\n  const proposalsById = new Map<string, Map<string, typeof axis.assignments>>();\n\n  for (const assignment of axis.assignments) {\n    if (!contextById.has(assignment.id) || assignment.side === null) continue;\n    const normalizedSide = assignment.side.trim();\n    let sides = proposalsById.get(assignment.id);\n    if (!sides) {\n      sides = new Map();\n      proposalsById.set(assignment.id, sides);\n    }\n    const sameSide = sides.get(normalizedSide) ?? [];\n    sameSide.push(assignment);\n    sides.set(normalizedSide, sameSide);\n  }\n\n  const byId = new Map<string, VerifiedAssignment>();\n  let proposed = 0;\n  let verified = 0;\n\n  for (const [id, sides] of proposalsById) {\n    proposed += sides.size;\n    // Conflicting classifier output is permanently ambiguous regardless of\n    // proposal order or evidence quality. It must contribute zero support.\n    if (sides.size !== 1 || !axisSidesAreValid) {\n      byId.set(id, { id, side: null, evidence: null, verified: false });\n      continue;\n    }\n\n    const [[normalizedSide, sameSideProposals]] = [...sides];\n    const canonicalSide = canonicalSideByNormalized.get(normalizedSide);\n    const context = contextById.get(id)!;\n    const evidenceValid = canonicalSide\n      ? sameSideProposals.find((proposal) => poolEvidenceMatches(context, proposal.evidence))\n      : undefined;\n    if (canonicalSide && evidenceValid) {\n      verified++;\n      byId.set(id, {\n        id,\n        side: canonicalSide,\n        evidence: evidenceValid.evidence,\n        verified: true,\n      });\n    } else {\n      byId.set(id, {\n        id,\n        side: null,\n        evidence: sameSideProposals[0]?.evidence ?? null,\n        verified: false,\n      });\n    }\n  }\n\n  const assignments: VerifiedAssignment[] = candidates.map(\n    (candidate) => byId.get(candidate.id)\n      ?? { id: candidate.id, side: null, evidence: null, verified: false },\n  );\n\n  return {\n    label: axis.axis,\n    questionSeed: axis.questionSeed,\n    sides: axis.sides,\n    assignments,\n    evidenceRate: proposed > 0 ? verified / proposed : 0,\n  };\n}\n"]}

package/dist/opportunity/discriminator/discriminator.push.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.push.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.push.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,yCAAyC,CAAC;AAEpF,2EAA2E;AAC3E,eAAO,MAAM,kCAAkC,KAAK,CAAC;AAErD,gFAAgF;AAChF,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,IAAI,CAAC,oBAAoB,EAAE,OAAO,GAAG,SAAS,CAAC,GACpD,MAAM,CAGR;AAED,gFAAgF;AAChF,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED,+EAA+E;AAC/E,wBAAgB,4BAA4B,CAAC,KAAK,EAAE;IAClD,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;CACxB,GAAG,MAAM,CAMT"}

package/dist/opportunity/discriminator/discriminator.push.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.push.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.push.ts"],"names":[],"mappings":"AAEA,2EAA2E;AAC3E,MAAM,CAAC,MAAM,kCAAkC,GAAG,EAAE,CAAC;AAErD,gFAAgF;AAChF,MAAM,UAAU,oBAAoB,CAClC,IAAqD;IAErD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;IACjC,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,OAAO,EAAE,CAAC;AAC1D,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,sBAAsB,CAAC,IAAY;IACjD,OAAO,IAAI,CAAC,OAAO,CAAC,4BAA4B,EAAE,MAAM,CAAC,CAAC;AAC5D,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,4BAA4B,CAAC,KAI5C;IACC,MAAM,eAAe,GAAG,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,aAAa,CAAC;IACvF,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,GAAG,kCAAkC;QAC9E,CAAC,CAAC,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,kCAAkC,GAAG,CAAC,CAAC,GAAG;QACxE,CAAC,CAAC,eAAe,CAAC;IACpB,OAAO,oBAAoB,sBAAsB,CAAC,YAAY,CAAC,QAAQ,KAAK,CAAC,QAAQ,MAAM,sBAAsB,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC;AAC5I,CAAC","sourcesContent":["import type { QuestionPoolSnapshot } from \"../../shared/schemas/question.schema.js\";\n\n/** Maximum raw intent-title characters included in a proactive DM line. */\nexport const POOL_QUESTION_PUSH_TITLE_MAX_CHARS = 80;\n\n/** Stable identity for one pool refresh cycle. Chained alternates retain it. */\nexport function poolQuestionCycleKey(\n  pool: Pick<QuestionPoolSnapshot, \"runId\" | \"minedAt\">,\n): string {\n  const runId = pool.runId?.trim();\n  return runId ? `run:${runId}` : `mined:${pool.minedAt}`;\n}\n\n/** Escape plain text so it cannot alter the deterministic Markdown template. */\nexport function escapePoolPushMarkdown(text: string): string {\n  return text.replace(/([\\\\`*_[\\]{}()<>#+\\-.!|])/g, \"\\\\$1\");\n}\n\n/** Build the sole proactive user-facing DM line for a pushed pool question. */\nexport function buildPoolQuestionPushMessage(input: {\n  intentId: string;\n  intentTitle: string;\n  questionPrompt: string;\n}): string {\n  const normalizedTitle = input.intentTitle.replace(/\\s+/g, \" \").trim() || \"your intent\";\n  const boundedTitle = normalizedTitle.length > POOL_QUESTION_PUSH_TITLE_MAX_CHARS\n    ? `${normalizedTitle.slice(0, POOL_QUESTION_PUSH_TITLE_MAX_CHARS - 1)}…`\n    : normalizedTitle;\n  return `Quick one about [${escapePoolPushMarkdown(boundedTitle)}](/i/${input.intentId}): ${escapePoolPushMarkdown(input.questionPrompt)}`;\n}\n"]}

package/dist/opportunity/discriminator/discriminator.question.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.question.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.question.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAkB,yBAAyB,EAAE,oBAAoB,EAAE,MAAM,yCAAyC,CAAC;AAEzI,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAEpE,+EAA+E;AAC/E,eAAO,MAAM,iBAAiB,gBAAgB,CAAC;AAQ/C;;;GAGG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,mBAAmB,GAAG,yBAAyB,CAqBzF;AAED;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAAC,cAAc,EAAE,mBAAmB,EAAE,GAAG,mBAAmB,EAAE,CAIzG;AAkED,wCAAwC;AACxC,MAAM,WAAW,2BAA2B;IAC1C,qEAAqE;IACrE,aAAa,EAAE,yBAAyB,CAAC;IACzC,6EAA6E;IAC7E,UAAU,EAAE,yBAAyB,EAAE,CAAC;IACxC,QAAQ,EAAE,MAAM,CAAC;IACjB,+EAA+E;IAC/E,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,6CAA6C;IAC7C,OAAO,EAAE,MAAM,CAAC;IAChB,oCAAoC;IACpC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mEAAmE;IACnE,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,mEAAmE;AACnE,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,QAAQ,CAAC;IAClB,IAAI,EAAE,oBAAoB,CAAC;CAC5B;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,2BAA2B,GAAG,uBAAuB,GAAG,IAAI,CA2CzG"}

package/dist/opportunity/discriminator/discriminator.question.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.question.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.question.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,gCAAgC,EAAE,gCAAgC,EAAE,+BAA+B,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAGpK,+EAA+E;AAC/E,MAAM,CAAC,MAAM,iBAAiB,GAAG,aAAa,CAAC;AAE/C,mFAAmF;AACnF,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B,sDAAsD;AACtD,MAAM,mBAAmB,GAAG,SAAS,CAAC;AAEtC;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,CAAsB;IAC5D,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,KAAK;QAAE,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjD,MAAM,WAAW,GAAmD,EAAE,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ;YAAE,SAAS;QAC7C,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,UAAU,CAAC;YAAE,SAAS;QACtC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,WAAW,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO;QACL,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,YAAY,EAAE,CAAC,CAAC,YAAY;QAC5B,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,UAAU;QACV,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,YAAY,EAAE,CAAC,CAAC,YAAY;QAC5B,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAClD,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjE,WAAW;KACZ,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B,CAAC,cAAqC;IAChF,OAAO,cAAc;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,qBAAqB,IAAI,CAAC,CAAC,YAAY,IAAI,+BAA+B,CAAC;SAClG,KAAK,CAAC,CAAC,EAAE,gCAAgC,CAAC,CAAC;AAChD,CAAC;AAED,sDAAsD;AACtD,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACnD,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,IAAY;IAClC,OAAO,IAAI;SACR,OAAO,CAAC,0CAA0C,EAAE,CAAC,CAAC,EAAE,IAAY,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC;SACrG,OAAO,CAAC,YAAY,EAAE,SAAS,CAAC;SAChC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC;SACxB,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC;QAC5B,2EAA2E;QAC3E,wCAAwC;SACvC,OAAO,CAAC,4DAA4D,EAAE,SAAS,CAAC;SAChF,OAAO,CAAC,wDAAwD,EAAE,QAAQ,CAAC;SAC3E,OAAO,CAAC,qDAAqD,EAAE,MAAM,CAAC;SACtE,OAAO,CAAC,mDAAmD,EAAE,KAAK,CAAC,CAAC;AACzE,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,MAAc;IACxC,OAAO,sDAAsD,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC7E,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,IAAY,EAAE,IAAY;IAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,aAAa,CAAC;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,yEAAyE;AACzE,SAAS,QAAQ,CAAC,YAAoB,EAAE,KAAe;IACrD,IAAI,CAAC,GAAG,cAAc,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;IACjE,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtE,IAAI,cAAc,GAAG,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC,GAAG,4BAA4B,IAAI,OAAO,IAAI,EAAE,CAAC;IACpD,CAAC;IACD,iFAAiF;IACjF,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;IACvD,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACzB,CAAC;AA8BD;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAkC;IACvE,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAC7C,IAAI,QAAQ,GAAG,gCAAgC;QAAE,OAAO,IAAI,CAAC;IAC7D,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE1D,4EAA4E;IAC5E,2EAA2E;IAC3E,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;IACpE,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;QACjC,CAAC,CAAC,YAAY,QAAQ,qBAAqB,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG;QACrG,CAAC,CAAC,YAAY,QAAQ,8BAA8B,CAAC;IAEvD,MAAM,WAAW,GAAqB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3D,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC;QACtB,WAAW,EAAE,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,QAAQ,gCAAgC;KAC5F,CAAC,CAAC,CAAC;IACJ,MAAM,OAAO,GAAqB;QAChC,GAAG,WAAW;QACd;YACE,KAAK,EAAE,iBAAiB;YACxB,WAAW,EAAE,0CAA0C;SACxD;KACF,CAAC;IAEF,OAAO;QACL,OAAO,EAAE;YACP,KAAK,EAAE,mBAAmB;YAC1B,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC;YACzC,OAAO;YACP,WAAW,EAAE,KAAK;YAClB,QAAQ;SACT;QACD,IAAI,EAAE;YACJ,QAAQ;YACR,cAAc,EAAE,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC;YACzC,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9C,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClF,aAAa,EAAE,CAAC;YAChB,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B;KACF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Deterministic pool_discovery question synthesis (IND-418).\n *\n * A mined discriminator already carries everything a question needs: a label,\n * a question seed, 2–3 sides, and verified per-candidate assignments. This\n * module turns the top discriminator into a `Question` payload + server-side\n * pool snapshot with ZERO generation-time LLM calls — the phrasing was\n * produced (and evidence-verified) at mining time, so synthesis is pure,\n * auditable, and cheap to re-run for interview-mode chaining.\n */\nimport type { Question, QuestionOption, QuestionPoolDiscriminator, QuestionPoolSnapshot } from \"../../shared/schemas/question.schema.js\";\nimport { POOL_DISCRIMINATOR_MIN_POOL_SIZE, POOL_QUESTION_MAX_DISCRIMINATORS, POOL_QUESTION_MIN_EVIDENCE_RATE, POOL_QUESTION_MIN_VOI } from \"./discriminator.env.js\";\nimport type { ScoredDiscriminator } from \"./discriminator.types.js\";\n\n/** Fixed option appended to every pool question — the no-preference escape. */\nexport const BOTH_MATTER_LABEL = \"Both matter\";\n\n/** Max words in a chip-style option label (prototype voice: terse, glanceable). */\nconst MAX_LABEL_WORDS = 5;\n\n/** Question title (≤12 chars, per QuestionSchema). */\nconst POOL_QUESTION_TITLE = \"Matches\";\n\n/**\n * Converts a scored discriminator into the compact snapshot form stored on\n * the question row (verified assignments only; unknowns dropped).\n */\nexport function toQuestionDiscriminator(d: ScoredDiscriminator): QuestionPoolDiscriminator {\n  const sideCounts: Record<string, number> = {};\n  for (const side of d.sides) sideCounts[side] = 0;\n  const assignments: Array<{ opportunityId: string; side: string }> = [];\n  for (const a of d.assignments) {\n    if (a.side === null || !a.verified) continue;\n    if (!(a.side in sideCounts)) continue;\n    sideCounts[a.side] += 1;\n    assignments.push({ opportunityId: a.id, side: a.side });\n  }\n  return {\n    label: d.label,\n    questionSeed: d.questionSeed,\n    sides: d.sides,\n    sideCounts,\n    voi: d.voi,\n    evidenceRate: d.evidenceRate,\n    ...(d.embedding ? { embedding: d.embedding } : {}),\n    ...(d.embeddingModel ? { embeddingModel: d.embeddingModel } : {}),\n    assignments,\n  };\n}\n\n/**\n * Filters a mining pass down to question-eligible discriminators:\n * VoI ≥ {@link POOL_QUESTION_MIN_VOI}, evidenceRate ≥\n * {@link POOL_QUESTION_MIN_EVIDENCE_RATE}, capped at\n * {@link POOL_QUESTION_MAX_DISCRIMINATORS}. Input is already VoI-sorted.\n */\nexport function selectQuestionDiscriminators(discriminators: ScoredDiscriminator[]): ScoredDiscriminator[] {\n  return discriminators\n    .filter((d) => d.voi >= POOL_QUESTION_MIN_VOI && d.evidenceRate >= POOL_QUESTION_MIN_EVIDENCE_RATE)\n    .slice(0, POOL_QUESTION_MAX_DISCRIMINATORS);\n}\n\n/** Truncates a side label to the chip word budget. */\nfunction chipLabel(side: string): string {\n  const words = side.trim().split(/\\s+/);\n  return words.slice(0, MAX_LABEL_WORDS).join(\" \");\n}\n\n/**\n * Miner seeds are sometimes written from the intent owner's POV (\"Do I\n * prefer…\"). The question is asked TO the owner, so normalize to second\n * person. Conservative verb-pair map + bare pronoun/possessive swaps.\n */\nfunction toSecondPerson(seed: string): string {\n  return seed\n    .replace(/\\b(do|should|would|could|can|will) I\\b/gi, (_, verb: string) => `${verb.toLowerCase()} you`)\n    .replace(/\\bam I\\b/gi, \"are you\")\n    .replace(/\\bI\\b/g, \"you\")\n    .replace(/\\bmy\\b/gi, \"your\")\n    // Third-person seeds (\"Is the user primarily involved…\") — the question is\n    // asked TO the owner, never ABOUT them.\n    .replace(/\\b(is|was) (?:the|this) (user|owner|discoverer|client)\\b/gi, \"are you\")\n    .replace(/\\bdoes (?:the|this) (user|owner|discoverer|client)\\b/gi, \"do you\")\n    .replace(/\\b(?:the|this) (user|owner|discoverer|client)'s\\b/gi, \"your\")\n    .replace(/\\b(?:the|this) (user|owner|discoverer|client)\\b/gi, \"you\");\n}\n\n/**\n * Catch-all: after normalization the prompt must be second-person. Any\n * residual third-person reference to the owner means an unanticipated seed\n * shape slipped through — the deterministic two-sided template (always\n * second-person) is the safe fallback.\n */\nfunction isStillThirdPerson(prompt: string): boolean {\n  return /\\b(?:the|this|a) (?:user|owner|discoverer|client)\\b/i.test(prompt);\n}\n\n/**\n * A good discriminator prompt names BOTH sides so the chips read as a real\n * choice. When the seed mentions fewer than two sides (e.g. \"Do you prefer\n * hands-on prototyping?\"), fall back to a deterministic two-sided template.\n */\nfunction mentionsSide(seed: string, side: string): boolean {\n  const lowerSeed = seed.toLowerCase();\n  return side\n    .toLowerCase()\n    .split(/[^a-z0-9-]+/)\n    .filter((w) => w.length > 3)\n    .some((w) => lowerSeed.includes(w));\n}\n\n/** Ensures the prompt reads as one second-person, two-sided question. */\nfunction toPrompt(questionSeed: string, sides: string[]): string {\n  let p = toSecondPerson(questionSeed.trim().replace(/\\s+/g, \" \"));\n  const sidesMentioned = sides.filter((s) => mentionsSide(p, s)).length;\n  if (sidesMentioned < 2 || isStillThirdPerson(p)) {\n    const last = sides[sides.length - 1];\n    const head = sides.slice(0, -1).join(\", \");\n    p = `Which matters more here: ${head} or ${last}`;\n  }\n  // Sentence-case the first character (template + normalization can lowercase it).\n  p = p.charAt(0).toUpperCase() + p.slice(1);\n  if (!/[?]$/.test(p)) p = p.replace(/[.!]+$/, \"\") + \"?\";\n  return p.slice(0, 400);\n}\n\n/** Input for one question synthesis. */\nexport interface SynthesizePoolQuestionInput {\n  /** The discriminator to ask about (already eligibility-filtered). */\n  discriminator: QuestionPoolDiscriminator;\n  /** Remaining ranked eligible discriminators (interview-mode chain stash). */\n  alternates: QuestionPoolDiscriminator[];\n  poolSize: number;\n  /** Exact bounded candidate opportunity IDs supplied to this synthesis pass. */\n  opportunityIds: string[];\n  /** ISO-8601 timestamp of the mining pass. */\n  minedAt: string;\n  /** Discovery run id, when known. */\n  runId?: string;\n  /**\n   * Intent payload snippet — folded into the evidence chip so the question\n   * self-identifies on any surface (\"based on 16 people matching ‘…’\").\n   */\n  intentText?: string;\n  /** Stable hash of the full normalized intent payload + summary. */\n  intentFingerprint?: string;\n}\n\n/** Synthesized question: client payload + server-side snapshot. */\nexport interface SynthesizedPoolQuestion {\n  payload: Question;\n  pool: QuestionPoolSnapshot;\n}\n\n/**\n * Builds the pool_discovery question. Returns null when the pool is below\n * the k-anonymity floor or the discriminator shape is unusable (guards are\n * duplicated here so no caller can bypass them).\n */\nexport function synthesizePoolQuestion(input: SynthesizePoolQuestionInput): SynthesizedPoolQuestion | null {\n  const { discriminator: d, poolSize } = input;\n  if (poolSize < POOL_DISCRIMINATOR_MIN_POOL_SIZE) return null;\n  if (d.sides.length < 2 || d.sides.length > 3) return null;\n\n  // Evidence chip: aggregate count + the intent it belongs to, so the card is\n  // self-identifying on every surface (QuestionSchema caps evidence at 160).\n  const snippet = input.intentText?.trim().replace(/\\s+/g, \" \") ?? \"\";\n  const evidence = snippet.length > 0\n    ? `based on ${poolSize} people matching “${snippet.slice(0, 110)}${snippet.length > 110 ? \"…\" : \"\"}”`\n    : `based on ${poolSize} people matching this intent`;\n\n  const sideOptions: QuestionOption[] = d.sides.map((side) => ({\n    label: chipLabel(side),\n    description: `${d.sideCounts[side] ?? 0} of your ${poolSize} current matches lean this way`,\n  }));\n  const options: QuestionOption[] = [\n    ...sideOptions,\n    {\n      label: BOTH_MATTER_LABEL,\n      description: \"No preference — keep the current ranking\",\n    },\n  ];\n\n  return {\n    payload: {\n      title: POOL_QUESTION_TITLE,\n      prompt: toPrompt(d.questionSeed, d.sides),\n      options,\n      multiSelect: false,\n      evidence,\n    },\n    pool: {\n      poolSize,\n      opportunityIds: [...input.opportunityIds],\n      minedAt: input.minedAt,\n      ...(input.runId ? { runId: input.runId } : {}),\n      ...(snippet.length > 0 ? { intentText: snippet.slice(0, 160) } : {}),\n      ...(input.intentFingerprint ? { intentFingerprint: input.intentFingerprint } : {}),\n      discriminator: d,\n      alternates: input.alternates,\n    },\n  };\n}\n"]}

package/dist/opportunity/discriminator/discriminator.scorer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.scorer.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.scorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAEvG,yFAAyF;AACzF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYjE;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,mBAAmB,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,CAQ/F;AAUD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,kBAAkB,EACxB,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,EAAE,MAAM,GACd,mBAAmB,CA0CrB"}

package/dist/opportunity/discriminator/discriminator.scorer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.scorer.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.scorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,yFAAyF;AACzF,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,aAAuB,EAAE,mBAA+B;IACrF,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,mBAAmB,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,gBAAgB,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,MAAM;YAAE,MAAM,GAAG,GAAG,CAAC;IACjC,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,SAAS,MAAM,CAAC,KAAa;IAC3B,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAwB,EACxB,UAA2B,EAC3B,OAAe;IAEf,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACtB,SAAS,IAAI,CAAC,CAAC;IACjB,CAAC;IACD,yEAAyE;IACzE,MAAM,SAAS,GAAG,SAAS,IAAI,CAAC,CAAC;IACjC,IAAI,SAAS,EAAE,CAAC;QACd,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ;YAAE,SAAS;QAC7C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,SAAS;QAC3C,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACrB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,YAAY,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,YAAY,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,IAAI,GAAG,YAAY,CAAC;YAC9B,IAAI,CAAC,GAAG,CAAC;gBAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IACzD,MAAM,GAAG,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,cAAc,CAAC;IAE/D,OAAO,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC;AACtE,CAAC","sourcesContent":["/**\n * Pool-axis VoI scorer — pure functions, no LLM, no I/O (IND-417).\n *\n * VoI = H_norm × coverage^1.5 × novelty\n *\n *   H_norm    score-weighted entropy over the axis sides, normalized by\n *             log2(k). Entropy is computed over candidate *score mass*\n *             (confidence weights), not head counts, so a balanced split of\n *             low-confidence junk-tail candidates doesn't inflate VoI.\n *   coverage  fraction of total pool score mass with a verified side\n *             assignment. The ^1.5 exponent is the anti-vague-axis knob:\n *             axes the LLM couldn't ground in evidence lose fast.\n *   novelty   1 − max cosine similarity between the axis embedding and\n *             reference embeddings (existing premises, intent sentences).\n *             An axis the user has already answered elsewhere scores ~0.\n */\n\nimport type { MinedDiscriminator, PoolCandidate, ScoredDiscriminator } from \"./discriminator.types.js\";\n\n/** Cosine similarity of two equal-length vectors, in [-1, 1]. 0 for degenerate input. */\nexport function cosineSimilarity(a: number[], b: number[]): number {\n  if (a.length === 0 || a.length !== b.length) return 0;\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  if (normA === 0 || normB === 0) return 0;\n  return dot / (Math.sqrt(normA) * Math.sqrt(normB));\n}\n\n/**\n * Novelty of an axis vs reference texts: 1 − max cosine similarity, clamped\n * to [0, 1]. No references → 1 (fully novel).\n */\nexport function computeNovelty(axisEmbedding: number[], referenceEmbeddings: number[][]): number {\n  if (referenceEmbeddings.length === 0) return 1;\n  let maxSim = 0;\n  for (const ref of referenceEmbeddings) {\n    const sim = cosineSimilarity(axisEmbedding, ref);\n    if (sim > maxSim) maxSim = sim;\n  }\n  return Math.min(1, Math.max(0, 1 - maxSim));\n}\n\n/**\n * Weight for one candidate's score mass. Negative/NaN scores contribute 0;\n * when the whole pool has zero mass the caller falls back to count weights.\n */\nfunction massOf(score: number): number {\n  return Number.isFinite(score) && score > 0 ? score : 0;\n}\n\n/**\n * Score one mined axis against its pool.\n *\n * @param axis        Mined axis with verified assignments (one per candidate).\n * @param candidates  The pool (provides score mass per candidate id).\n * @param novelty     Precomputed novelty in [0,1] (see {@link computeNovelty}).\n */\nexport function scoreDiscriminator(\n  axis: MinedDiscriminator,\n  candidates: PoolCandidate[],\n  novelty: number,\n): ScoredDiscriminator {\n  const massById = new Map<string, number>();\n  let totalMass = 0;\n  for (const c of candidates) {\n    const m = massOf(c.score);\n    massById.set(c.id, m);\n    totalMass += m;\n  }\n  // Degenerate pool (all zero/invalid scores): fall back to count weights.\n  const useCounts = totalMass <= 0;\n  if (useCounts) {\n    totalMass = candidates.length;\n    for (const c of candidates) massById.set(c.id, 1);\n  }\n\n  const sideMass = new Map<string, number>();\n  let assignedMass = 0;\n  for (const a of axis.assignments) {\n    if (a.side === null || !a.verified) continue;\n    if (!axis.sides.includes(a.side)) continue;\n    const m = massById.get(a.id) ?? 0;\n    if (m <= 0) continue;\n    sideMass.set(a.side, (sideMass.get(a.side) ?? 0) + m);\n    assignedMass += m;\n  }\n\n  const k = axis.sides.length;\n  let entropy = 0;\n  if (assignedMass > 0 && k >= 2) {\n    let h = 0;\n    for (const mass of sideMass.values()) {\n      const p = mass / assignedMass;\n      if (p > 0) h -= p * Math.log2(p);\n    }\n    entropy = h / Math.log2(k);\n  }\n\n  const coverage = totalMass > 0 ? assignedMass / totalMass : 0;\n  const clampedNovelty = Math.min(1, Math.max(0, novelty));\n  const voi = entropy * Math.pow(coverage, 1.5) * clampedNovelty;\n\n  return { ...axis, entropy, coverage, novelty: clampedNovelty, voi };\n}\n"]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.shadow.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.shadow.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,+CAA+C,CAAC;AACxF,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAEvE,OAAO,KAAK,EAAsB,aAAa,EAAE,yBAAyB,EAAE,MAAM,0BAA0B,CAAC;AAS7G,gDAAgD;AAChD,MAAM,WAAW,wBAAwB;IACvC,yEAAyE;IACzE,UAAU,EAAE,MAAM,CAAC;IACnB,wDAAwD;IACxD,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5B;;;OAGG;IACH,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,oFAAoF;IACpF,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC/B,4EAA4E;IAC5E,wBAAwB,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IACtC,qEAAqE;IACrE,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,+EAA+E;IAC/E,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,KAAK,EAAE,IAAI,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAC;IAC5C,QAAQ,EAAE,kBAAkB,CAAC;IAC7B,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAOD;;;;GAIG;AACH,wBAAsB,0BAA0B,CAAC,KAAK,EAAE,wBAAwB,GAAG,OAAO,CAAC,yBAAyB,CAAC,CAoEpH"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.shadow.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.shadow.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAG/E,OAAO,EAAE,cAAc,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAG/E,MAAM,MAAM,GAAG,cAAc,CAAC,yBAAyB,CAAC,CAAC;AAEzD,uDAAuD;AACvD,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,yBAAyB,GAAG,EAAE,CAAC;AACrC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AA0BpC,kEAAkE;AAClE,SAAS,0BAA0B,CAAC,CAAqB;IACvD,OAAO,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,YAAY,EAAE,CAAC;AAC1C,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAAC,KAA+B;IAC9E,MAAM,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,CAClC,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,UAAU,EAAE,EAC5C,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CACpD,CAAC;IACF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IAC7D,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,cAAc;SACpC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IAEjC,MAAM,mBAAmB,GAAG,CAAC,KAAK,CAAC,mBAAmB,IAAI,EAAE,CAAC;SAC1D,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;SAC1B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,yBAAyB,CAAC,CAAC;IACvC,MAAM,wBAAwB,GAAG,CAAC,KAAK,CAAC,wBAAwB,IAAI,EAAE,CAAC;SACpE,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC;IAEtC,IAAI,SAAS,GAAa,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,IAAI,uBAAuB,GAAsB,IAAI,CAAC;IACtD,MAAM,WAAW,GAAG,KAAK,CAAC,gBAAgB;WACrC,UAAU,CAAC,MAAM,GAAG,CAAC;WACrB,mBAAmB,CAAC,MAAM,GAAG,CAAC;WAC9B,wBAAwB,CAAC,MAAM,GAAG,CAAC,CAAC;IACzC,IAAI,WAAW,EAAE,CAAC;QAChB,IAAI,CAAC;YACH,MAAM,KAAK,GAAG;gBACZ,GAAG,KAAK,CAAC,GAAG,CAAC,0BAA0B,CAAC;gBACxC,GAAG,UAAU;gBACb,GAAG,mBAAmB;aACvB,CAAC;YACF,MAAM,UAAU,GAAG,CAAC,MAAM,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAe,CAAC;YACxE,IAAI,UAAU,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC9H,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;YAClE,CAAC;YACD,uBAAuB,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC5D,MAAM,mBAAmB,GAAG;gBAC1B,GAAG,wBAAwB;gBAC3B,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;aAClC,CAAC;YACF,SAAS,GAAG,uBAAuB,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,cAAc,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC,CAAC;QACzG,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,CAAC,mDAAmD,EAAE;gBAC/D,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;aACxD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAG,KAAK;SACzB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACZ,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,uBAAuB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACpF,OAAO,SAAS;YACd,CAAC,CAAC;gBACE,GAAG,MAAM;gBACT,SAAS;gBACT,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC1E;YACH,CAAC,CAAC,MAAM,CAAC;IACb,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAEjC,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;AACzD,CAAC","sourcesContent":["/**\n * Shadow orchestrator: mine discriminators for a pool, embed them, score VoI, and\n * return the log payload (IND-417). No persistence, no questions, no UI —\n * P1 output is consumed only by structured logs for human review.\n */\nimport { protocolLogger } from \"../../shared/observability/protocol.logger.js\";\nimport type { EmbeddingGenerator } from \"../../shared/interfaces/embedder.interface.js\";\nimport type { PoolDiscriminatorMiner } from \"./discriminator.miner.js\";\nimport { computeNovelty, scoreDiscriminator } from \"./discriminator.scorer.js\";\nimport type { MinedDiscriminator, PoolCandidate, DiscriminatorShadowResult } from \"./discriminator.types.js\";\n\nconst logger = protocolLogger(\"PoolDiscriminatorShadow\");\n\n/** Max text/vector references compared for novelty. */\nconst MAX_REFERENCE_TEXTS = 24;\nconst MAX_PRIOR_REFERENCE_TEXTS = 24;\nconst MAX_REFERENCE_EMBEDDINGS = 24;\n\n/** Input for one shadow mining+scoring pass. */\nexport interface DiscriminatorShadowInput {\n  /** Intent payload (+ summary) or search query that produced the pool. */\n  intentText: string;\n  /** The pool (already filtered/capped by the caller). */\n  candidates: PoolCandidate[];\n  /**\n   * Novelty references: the intent owner's active premise texts and intent\n   * sentences. An axis semantically equal to any reference scores ~0.\n   */\n  referenceTexts: string[];\n  /** Legacy/model-mismatched resolved axes re-embedded with an independent budget. */\n  priorReferenceTexts?: string[];\n  /** Fresh resolved-axis vectors generated by the current embedding model. */\n  priorReferenceEmbeddings?: number[][];\n  /** Model used for current axis embeddings and persisted metadata. */\n  embeddingModel?: string;\n  /** Retain generated axis vectors on results for durable question snapshots. */\n  retainEmbeddings?: boolean;\n  miner: Pick<PoolDiscriminatorMiner, \"mine\">;\n  embedder: EmbeddingGenerator;\n  signal?: AbortSignal;\n}\n\n/** Text embedded per discriminator for the novelty comparison. */\nfunction discriminatorEmbeddingText(d: MinedDiscriminator): string {\n  return `${d.label} — ${d.questionSeed}`;\n}\n\n/**\n * Runs miner → embeddings → scorer. Throws only when *mining* fails (callers\n * are fire-and-forget); embedding failures degrade to novelty = 1 for all\n * discriminators rather than dropping the pass.\n */\nexport async function runPoolDiscriminatorShadow(input: DiscriminatorShadowInput): Promise<DiscriminatorShadowResult> {\n  const { candidates } = input;\n  const mined = await input.miner.mine(\n    { intentText: input.intentText, candidates },\n    input.signal ? { signal: input.signal } : undefined,\n  );\n  if (mined.length === 0) {\n    return { poolSize: candidates.length, discriminators: [] };\n  }\n\n  const references = input.referenceTexts\n    .map((t) => t.trim())\n    .filter((t) => t.length > 0)\n    .slice(0, MAX_REFERENCE_TEXTS);\n\n  const priorReferenceTexts = (input.priorReferenceTexts ?? [])\n    .map((text) => text.trim())\n    .filter((text) => text.length > 0)\n    .slice(0, MAX_PRIOR_REFERENCE_TEXTS);\n  const priorReferenceEmbeddings = (input.priorReferenceEmbeddings ?? [])\n    .filter((embedding) => embedding.length > 0)\n    .slice(0, MAX_REFERENCE_EMBEDDINGS);\n\n  let novelties: number[] = mined.map(() => 1);\n  let discriminatorEmbeddings: number[][] | null = null;\n  const shouldEmbed = input.retainEmbeddings\n    || references.length > 0\n    || priorReferenceTexts.length > 0\n    || priorReferenceEmbeddings.length > 0;\n  if (shouldEmbed) {\n    try {\n      const texts = [\n        ...mined.map(discriminatorEmbeddingText),\n        ...references,\n        ...priorReferenceTexts,\n      ];\n      const embeddings = (await input.embedder.generate(texts)) as number[][];\n      if (embeddings.length !== texts.length || embeddings.some((embedding) => !Array.isArray(embedding) || embedding.length === 0)) {\n        throw new Error(\"Embedding provider returned an invalid batch\");\n      }\n      discriminatorEmbeddings = embeddings.slice(0, mined.length);\n      const referenceEmbeddings = [\n        ...priorReferenceEmbeddings,\n        ...embeddings.slice(mined.length),\n      ];\n      novelties = discriminatorEmbeddings.map((embedding) => computeNovelty(embedding, referenceEmbeddings));\n    } catch (err) {\n      logger.warn(\"Novelty embedding failed; defaulting novelty to 1\", {\n        error: err instanceof Error ? err.message : String(err),\n      });\n    }\n  }\n\n  const discriminators = mined\n    .map((d, i) => {\n      const scored = scoreDiscriminator(d, candidates, novelties[i]);\n      const embedding = input.retainEmbeddings ? discriminatorEmbeddings?.[i] : undefined;\n      return embedding\n        ? {\n            ...scored,\n            embedding,\n            ...(input.embeddingModel ? { embeddingModel: input.embeddingModel } : {}),\n          }\n        : scored;\n    })\n    .sort((a, b) => b.voi - a.voi);\n\n  return { poolSize: candidates.length, discriminators };\n}\n"]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.types.d.ts","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,8DAA8D;AAC9D,MAAM,WAAW,aAAa;IAC5B,gEAAgE;IAChE,EAAE,EAAE,MAAM,CAAC;IACX;;;;OAIG;IACH,aAAa,EAAE,MAAM,CAAC;IACtB,6EAA6E;IAC7E,KAAK,EAAE,MAAM,CAAC;CACf;AAED,0CAA0C;AAC1C,MAAM,WAAW,wBAAwB;IACvC,gFAAgF;IAChF,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,aAAa,EAAE,CAAC;CAC7B;AAED;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,kCAAkC;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,iFAAiF;IACjF,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,4EAA4E;IAC5E,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB;;;OAGG;IACH,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,yEAAyE;AACzE,MAAM,WAAW,kBAAkB;IACjC,iFAAiF;IACjF,KAAK,EAAE,MAAM,CAAC;IACd,+EAA+E;IAC/E,YAAY,EAAE,MAAM,CAAC;IACrB,0CAA0C;IAC1C,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,4CAA4C;IAC5C,WAAW,EAAE,kBAAkB,EAAE,CAAC;IAClC;;;OAGG;IACH,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,yEAAyE;AACzE,MAAM,WAAW,mBAAoB,SAAQ,kBAAkB;IAC7D,2EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,8CAA8C;IAC9C,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,8DAA8D;IAC9D,OAAO,EAAE,MAAM,CAAC;IAChB,6DAA6D;IAC7D,QAAQ,EAAE,MAAM,CAAC;IACjB,gFAAgF;IAChF,OAAO,EAAE,MAAM,CAAC;IAChB,wCAAwC;IACxC,GAAG,EAAE,MAAM,CAAC;CACb;AAED,wEAAwE;AACxE,MAAM,WAAW,yBAAyB;IACxC,QAAQ,EAAE,MAAM,CAAC;IACjB,uDAAuD;IACvD,cAAc,EAAE,mBAAmB,EAAE,CAAC;CACvC"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"discriminator.types.js","sourceRoot":"/","sources":["opportunity/discriminator/discriminator.types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG","sourcesContent":["/**\n * Pool discriminator mining — shared types (IND-416 / IND-417).\n *\n * A \"pool discriminator\" is a preference dimension that splits a discovery-run\n * candidate pool into meaningfully different groups (e.g. \"hands-on builders\n * vs advisors\"). Discriminators are mined by one structured LLM pass, then\n * scored deterministically (VoI = entropy × coverage^1.5 × novelty) so the\n * highest value question can eventually be asked to the intent owner.\n *\n * Vocabulary note: the LLM wire format (prompt + response schema in the miner)\n * speaks of \"axes\" with mutually exclusive \"sides\" — the clearest way to\n * explain the concept to the model. Everything the rest of the codebase\n * touches (types, exports, logs) uses \"discriminator\".\n *\n * P1 (shadow) uses these types for log-only output; later phases reuse them\n * for question synthesis and answer application.\n */\n\n/** One candidate in the pool as supplied to the miner LLM. */\nexport interface PoolCandidate {\n  /** Opportunity id (stable key for later answer application). */\n  id: string;\n  /**\n   * The exact public-context string shown to the LLM for this candidate\n   * (name + bio + matchReason + headline + premise snippets, ≤400 chars).\n   * Evidence spans are substring-verified against this exact string.\n   */\n  publicContext: string;\n  /** Candidate confidence/score — the mass used for score-weighted entropy. */\n  score: number;\n}\n\n/** Input envelope for one mining pass. */\nexport interface DiscriminatorMiningInput {\n  /** Intent payload (+ summary) or ad-hoc search query that produced the pool. */\n  intentText: string;\n  candidates: PoolCandidate[];\n}\n\n/**\n * One candidate assignment on a discriminator, after code-side evidence verification.\n * `side === null` means unknown (LLM abstained, evidence failed verification,\n * or the candidate was missing from the LLM output).\n */\nexport interface VerifiedAssignment {\n  /** Candidate (opportunity) id. */\n  id: string;\n  /** Verified side label (one of the discriminator's sides), or null = unknown. */\n  side: string | null;\n  /** The evidence span quoted by the LLM (kept for logging/audit), if any. */\n  evidence: string | null;\n  /**\n   * True when the LLM proposed a side AND its evidence span substring-matched\n   * the candidate's publicContext. False for demoted-to-unknown proposals.\n   */\n  verified: boolean;\n}\n\n/** One mined discriminator after evidence verification (pre-scoring). */\nexport interface MinedDiscriminator {\n  /** Short discriminator label, e.g. \"Hands-on builders vs strategic advisors\". */\n  label: string;\n  /** A question the intent owner could be asked to resolve the discriminator. */\n  questionSeed: string;\n  /** 2–3 mutually exclusive side labels. */\n  sides: string[];\n  /** Exactly one entry per pool candidate. */\n  assignments: VerifiedAssignment[];\n  /**\n   * verified-proposals / total side proposals from the LLM for this discriminator\n   * (0 when the LLM proposed no sides at all). The hallucination health metric.\n   */\n  evidenceRate: number;\n}\n\n/** A mined discriminator with its deterministic VoI score components. */\nexport interface ScoredDiscriminator extends MinedDiscriminator {\n  /** Current discriminator embedding retained for durable semantic dedup. */\n  embedding?: number[];\n  /** Model that generated {@link embedding}. */\n  embeddingModel?: string;\n  /** Normalized score-weighted entropy over sides, in [0,1]. */\n  entropy: number;\n  /** Assigned score mass / total pool score mass, in [0,1]. */\n  coverage: number;\n  /** 1 − max cosine similarity vs reference texts (premises/intent), in [0,1]. */\n  novelty: number;\n  /** entropy × coverage^1.5 × novelty. */\n  voi: number;\n}\n\n/** Result of one shadow mining+scoring pass (the log payload shape). */\nexport interface DiscriminatorShadowResult {\n  poolSize: number;\n  /** Scored discriminators, sorted by VoI descending. */\n  discriminators: ScoredDiscriminator[];\n}\n"]}

package/dist/opportunity/feed/feed.categorizer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"feed.categorizer.d.ts","sourceRoot":"/","sources":["opportunity/feed/feed.categorizer.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAKH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AA0B3D,MAAM,MAAM,oBAAoB,GAAG;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B,CAAC;AAEF,MAAM,MAAM,iBAAiB,GAAG;IAC9B,QAAQ,EAAE,mBAAmB,EAAE,CAAC;CACjC,CAAC;AAgFF,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,KAAK,CAA2C;;IAMxD;;OAEG;IAEG,UAAU,CAAC,KAAK,EAAE,oBAAoB,EAAE,GAAG,OAAO,CAAC,iBAAiB,CAAC;CA0D5E"}

package/dist/opportunity/feed/feed.categorizer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"feed.categorizer.js","sourceRoot":"/","sources":["opportunity/feed/feed.categorizer.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;;;;;;;;;;AAEH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAGxB,OAAO,EAAE,qBAAqB,EAAE,yBAAyB,EAAE,MAAM,wCAAwC,CAAC;AAC1G,OAAO,EAAE,cAAc,EAAE,MAAM,+CAA+C,CAAC;AAC/E,OAAO,EAAE,KAAK,EAAE,MAAM,2CAA2C,CAAC;AAClE,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,8BAA8B,EAAE,MAAM,gCAAgC,CAAC;AAEhF,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,CAAC,CAAC;AAEjD,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IACpC,QAAQ,EAAE,CAAC,CAAC,KAAK,CACf,CAAC,CAAC,MAAM,CAAC;QACP,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,qCAAqC,CAAC;QAC9D,KAAK,EAAE,CAAC;aACL,MAAM,EAAE;aACR,QAAQ,CACP,mGAAmG,CACpG;QACH,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,iDAAiD,CAAC;QAC3F,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,sDAAsD,CAAC;QACrF,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,4CAA4C,CAAC;KACxF,CAAC,CACH;CACF,CAAC,CAAC;AAeH,MAAM,wBAAwB,GAAG,eAAe,CAAC;AACjD,MAAM,2BAA2B,GAAG,6BAA6B,CAAC;AAElE,6EAA6E;AAC7E,SAAS,mBAAmB,CAAC,KAA6B;IACxD,OAAO;QACL,QAAQ,EAAE;YACR;gBACE,EAAE,EAAE,eAAe;gBACnB,KAAK,EAAE,eAAe;gBACtB,QAAQ,EAAE,yBAAyB;gBACnC,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;aACvC;SACF;KACF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,KAA6B;IACvD,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACT,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,IAAI,OAAO,CAAC;QACrC,MAAM,MAAM,GAAG,CAAC,CAAC,iBAAiB,IAAI,SAAS,CAAC;QAChD,OAAO,IAAI,CAAC,CAAC,KAAK,UAAU,IAAI,YAAY,MAAM,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,GAAG,CAAC;IAChH,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED,SAAS,iBAAiB,CAAC,QAA+B,EAAE,QAAgB;IAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,MAAM,kBAAkB,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QAClD,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAC9B,IAAI,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,QAAQ,CAAC,CAAC,CAChF,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAExB,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YAClC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QAED,OAAO;YACL,GAAG,OAAO;YACV,WAAW,EAAE,aAAa;SAC3B,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED,MAAM,eAAe,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,wBAAwB,CAAC,CAAC;IACtG,IAAI,eAAe,EAAE,CAAC;QACpB,eAAe,CAAC,WAAW,GAAG,KAAK,CAAC,IAAI,CACtC,IAAI,GAAG,CAAC,CAAC,GAAG,eAAe,CAAC,WAAW,EAAE,GAAG,cAAc,CAAC,CAAC,CAC7D,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED,OAAO;QACL,GAAG,kBAAkB;QACrB;YACE,EAAE,EAAE,wBAAwB;YAC5B,KAAK,EAAE,2BAA2B;YAClC,QAAQ,EAAE,yBAAyB;YACnC,WAAW,EAAE,cAAc;SAC5B;KACF,CAAC;AACJ,CAAC;AAED,MAAM,OAAO,oBAAoB;IAG/B;QACE,IAAI,CAAC,KAAK,GAAG,qBAAqB,CAAC,iBAAiB,EAAE,oBAAoB,EAAE,EAAE,IAAI,EAAE,eAAe,EAAE,CAAC,CAAC;IACzG,CAAC;IAED;;OAEG;IAEG,AAAN,KAAK,CAAC,UAAU,CAAC,KAA6B;QAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QAC1B,CAAC;QACD,MAAM,QAAQ,GAAG,qBAAqB,EAAE,CAAC;QACzC,MAAM,aAAa,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAElC,MAAM,YAAY,GAAG;;;;;;;;oEAQ2C,QAAQ;oFACQ,QAAQ;;;;;;mOAMuI,CAAC;QAEhO,MAAM,WAAW,GAAG,yBAAyB,aAAa,iGAAiG,CAAC;QAE5J,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE;gBACrD,IAAI,aAAa,CAAC,YAAY,CAAC;gBAC/B,IAAI,YAAY,CAAC,WAAW,CAAC;aAC9B,CAAC,CAAC;YACH,MAAM,MAAM,GAAG,oBAAoB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACtD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,8BAA8B,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;gBACrE,OAAO,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACpC,CAAC;YACD,MAAM,QAAQ,GAA0B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvE,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,SAAS;gBACjC,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC;aAClE,CAAC,CAAC,CAAC;YACJ,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAC5B,8BAA8B,CAAC,OAAO,CAAC,KAAK,CAAC;mBAC1C,8BAA8B,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;gBACvD,MAAM,CAAC,IAAI,CAAC,gFAAgF,CAAC,CAAC;gBAC9F,OAAO,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACpC,CAAC;YACD,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACjE,OAAO,EAAE,QAAQ,EAAE,kBAAkB,EAAE,CAAC;QAC1C,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,KAAK,CAAC,mCAAmC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAClE,OAAO,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;CACF;AA1DO;IADL,KAAK,EAAE;;;;sDA0DP","sourcesContent":["/**\n * Home Categorizer Agent\n *\n * Takes a list of presenter-produced opportunity cards and returns dynamic sections\n * with CTA-style titles and Lucide icon names. Used by the home graph after\n * generateCardText.\n */\n\nimport { HumanMessage, SystemMessage } from '@langchain/core/messages';\nimport { z } from 'zod';\n\nimport type { HomeSectionProposal } from './feed.state.js';\nimport { getIconNamesForPrompt, DEFAULT_HOME_SECTION_ICON } from '../../shared/ui/lucide.icon-catalog.js';\nimport { protocolLogger } from '../../shared/observability/protocol.logger.js';\nimport { Timed } from \"../../shared/observability/performance.js\";\nimport { createStructuredModel } from \"../../shared/agent/model.config.js\";\nimport { invokeWithAbortSignal } from \"../../shared/agent/model-signal.js\";\nimport { hasUnsupportedOpportunityClaim } from '../opportunity.claim-safety.js';\n\nconst logger = protocolLogger('HomeCategorizer');\n\nconst categorizationSchema = z.object({\n  sections: z.array(\n    z.object({\n      id: z.string().describe('Short kebab-case id for the section'),\n      title: z\n        .string()\n        .describe(\n          'Call-to-action style section heading (e.g. REACH OUT NOW, YOUR MOVE, CONNECTIONS WAITING FOR YOU)'\n        ),\n      subtitle: z.string().nullable().describe('Optional one-line description; use null if none'),\n      iconName: z.string().describe('Lucide icon name in kebab-case from the allowed list'),\n      itemIndices: z.array(z.number()).describe('Indices of cards in this section (0-based)'),\n    })\n  ),\n});\n\nexport type CategorizerInputItem = {\n  index: number;\n  headline?: string;\n  mainText: string;\n  name: string;\n  viewerRole?: string;\n  opportunityStatus?: string;\n};\n\nexport type CategorizerResult = {\n  sections: HomeSectionProposal[];\n};\n\nconst UNCATEGORIZED_SECTION_ID = 'uncategorized';\nconst UNCATEGORIZED_SECTION_TITLE = 'UNCATEGORIZED OPPORTUNITIES';\n\n/** Single-section fallback grouping every card under one generic heading. */\nfunction buildFallbackResult(cards: CategorizerInputItem[]): CategorizerResult {\n  return {\n    sections: [\n      {\n        id: 'opportunities',\n        title: 'OPPORTUNITIES',\n        iconName: DEFAULT_HOME_SECTION_ICON,\n        itemIndices: cards.map((c) => c.index),\n      },\n    ],\n  };\n}\n\n/**\n * Build card summaries for the categorizer prompt.\n */\nfunction buildCardSummaries(cards: CategorizerInputItem[]): string {\n  return cards\n    .map((c) => {\n      const role = c.viewerRole ?? 'party';\n      const status = c.opportunityStatus ?? 'pending';\n      return `[${c.index}] role=${role}; status=${status}; ${c.headline ?? c.mainText.slice(0, 60)}... (${c.name})`;\n    })\n    .join('\\n');\n}\n\nfunction reconcileSections(sections: HomeSectionProposal[], maxIndex: number): HomeSectionProposal[] {\n  const assigned = new Set<number>();\n\n  const normalizedSections = sections.map((section) => {\n    const uniqueIndices = Array.from(\n      new Set(section.itemIndices.filter((index) => index >= 0 && index <= maxIndex))\n    ).sort((a, b) => a - b);\n\n    for (const index of uniqueIndices) {\n      assigned.add(index);\n    }\n\n    return {\n      ...section,\n      itemIndices: uniqueIndices,\n    };\n  });\n\n  const missingIndices: number[] = [];\n  for (let index = 0; index <= maxIndex; index += 1) {\n    if (!assigned.has(index)) {\n      missingIndices.push(index);\n    }\n  }\n\n  if (missingIndices.length === 0) {\n    return normalizedSections;\n  }\n\n  const fallbackSection = normalizedSections.find((section) => section.id === UNCATEGORIZED_SECTION_ID);\n  if (fallbackSection) {\n    fallbackSection.itemIndices = Array.from(\n      new Set([...fallbackSection.itemIndices, ...missingIndices])\n    ).sort((a, b) => a - b);\n    return normalizedSections;\n  }\n\n  return [\n    ...normalizedSections,\n    {\n      id: UNCATEGORIZED_SECTION_ID,\n      title: UNCATEGORIZED_SECTION_TITLE,\n      iconName: DEFAULT_HOME_SECTION_ICON,\n      itemIndices: missingIndices,\n    },\n  ];\n}\n\nexport class HomeCategorizerAgent {\n  private model: ReturnType<typeof createStructuredModel>;\n\n  constructor() {\n    this.model = createStructuredModel(\"homeCategorizer\", categorizationSchema, { name: 'home_sections' });\n  }\n\n  /**\n   * Categorize presenter-produced cards into 1–5 sections with CTA-style titles and icons.\n   */\n  @Timed()\n  async categorize(cards: CategorizerInputItem[]): Promise<CategorizerResult> {\n    if (cards.length === 0) {\n      return { sections: [] };\n    }\n    const iconList = getIconNamesForPrompt();\n    const cardSummaries = buildCardSummaries(cards);\n    const maxIndex = cards.length - 1;\n\n    const systemPrompt = `You are organizing connection opportunities into dynamic sections for a user's home feed.\n\nGiven a list of opportunity cards (each with index, headline/summary, and name), group them into 1–5 sections.\n\nEach section must have:\n- id: short kebab-case identifier (e.g. waiting-for-action, your-perspective, connector)\n- title: CALL-TO-ACTION style section heading in uppercase. Write as an action or invitation, not a neutral label. Examples: REACH OUT NOW, YOUR MOVE, CONNECTIONS WAITING FOR YOU, INTROS READY TO SEND, PEOPLE YOU SHOULD MEET\n- subtitle: optional one-line description\n- iconName: exactly ONE icon from this list (use the name as-is): ${iconList}\n- itemIndices: array of card indices that belong in this section (each index 0 to ${maxIndex} at most once)\n\nRules:\n- Use only icon names from the list above.\n- Every card index must appear in exactly one section.\n- Section titles must read as calls-to-action or invitations, not passive labels.\n- If a card has role=introducer and status=pending, prioritize grouping those cards under a connector curation section with a CTA title like \"YOU'RE THE CONNECTOR THEY NEED\", \"MAKE THE INTRO\", or \"DECIDE IF IT'S A GOOD MATCH\".`;\n\n    const userContent = `Cards to categorize:\\n${cardSummaries}\\n\\nOutput sections with id, title (CTA-style), subtitle (optional), iconName, and itemIndices.`;\n\n    try {\n      const result = await invokeWithAbortSignal(this.model, [\n        new SystemMessage(systemPrompt),\n        new HumanMessage(userContent),\n      ]);\n      const parsed = categorizationSchema.safeParse(result);\n      if (!parsed.success) {\n        logger.warn('HomeCategorizer parse failed', { error: parsed.error });\n        return buildFallbackResult(cards);\n      }\n      const sections: HomeSectionProposal[] = parsed.data.sections.map((s) => ({\n        id: s.id,\n        title: s.title,\n        subtitle: s.subtitle ?? undefined,\n        iconName: s.iconName,\n        itemIndices: s.itemIndices.filter((i) => i >= 0 && i <= maxIndex),\n      }));\n      if (sections.some((section) =>\n        hasUnsupportedOpportunityClaim(section.title)\n        || hasUnsupportedOpportunityClaim(section.subtitle))) {\n        logger.warn('HomeCategorizer emitted unsupported affiliation/presence claim; using fallback');\n        return buildFallbackResult(cards);\n      }\n      const reconciledSections = reconcileSections(sections, maxIndex);\n      return { sections: reconciledSections };\n    } catch (e) {\n      const err = e instanceof Error ? { message: e.message, name: e.name } : String(e);\n      logger.error('HomeCategorizer categorize failed', { error: err });\n      return buildFallbackResult(cards);\n    }\n  }\n}\n"]}

package/dist/opportunity/feed/feed.graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"feed.graph.d.ts","sourceRoot":"/","sources":["opportunity/feed/feed.graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAMH,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,+CAA+C,CAAC;AAC1G,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,4CAA4C,CAAC;AACnF,OAAO,EAAkB,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,mBAAmB,EAAwB,MAAM,iBAAiB,CAAC;AAStI,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AAiBzE,8HAA8H;AAC9H,KAAK,WAAW,GAAG,iBAAiB,CAAC;AAErC,MAAM,MAAM,oBAAoB,GAAG;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,QAAQ,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;;;OAKG;IACH,YAAY,CAAC,EAAE,MAAM,GAAG,UAAU,CAAC;IACnC;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,iBAAiB,EAAE,CAAC;CAChC,CAAC;AAEF,MAAM,MAAM,qBAAqB,GAAG;IAClC,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,IAAI,EAAE;QAAE,kBAAkB,EAAE,MAAM,CAAC;QAAC,aAAa,EAAE,MAAM,CAAA;KAAE,CAAC;IAC5D,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,kFAAkF;AAClF,eAAO,MAAM,qBAAqB,EAAE,iBAAiB,EAA0B,CAAC;AAgBhF,0HAA0H;AAC1H,eAAO,MAAM,wBAAwB,EAAE,iBAAiB,EAEhC,CAAC;AAOzB,0FAA0F;AAC1F,wBAAgB,2BAA2B,CACzC,IAAI,EAAE,IAAI,CAAC,YAAY,EAAE,qBAAqB,GAAG,uBAAuB,GAAG,MAAM,CAAC,EAClF,MAAM,EAAE,iBAAiB,GAAG,SAAS,GACpC,OAAO,CAST;AASD;;;;GAIG;AACH,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,CAarF;AAmHD,qBAAa,gBAAgB;IACf,OAAO,CAAC,QAAQ;IAAe,OAAO,CAAC,KAAK;gBAApC,QAAQ,EAAE,WAAW,EAAU,KAAK,EAAE,gBAAgB;IAE1E,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAyrBZ"}