@indexnetwork/protocol 0.1.0

package/dist/streamers/response.streamer.js

@@ -0,0 +1,46 @@
+import { createTokenEvent, createErrorEvent, } from "../types/chat-streaming.types.js";
+import { protocolLogger } from "../support/protocol.logger.js";
+const logger = protocolLogger("ResponseStreamer");
+// ══════════════════════════════════════════════════════════════════════════════
+// RESPONSE STREAMER
+// ══════════════════════════════════════════════════════════════════════════════
+/**
+ * Streams the final response from the chat agent.
+ *
+ * Processes the `on_chain_end` event emitted by the `agent_loop` node and
+ * yields either a token event (with the full response text) or an error event.
+ *
+ * Note on token streaming:
+ * We do NOT emit from `on_chat_model_stream` because `streamEvents` yields
+ * events from ALL model invocations, including nested ones
+ * (ExplicitIntentInferrer, SemanticVerifier, IntentReconciler, IntentIndexer)
+ * inside tools. Those emit structured JSON that must not reach the user. The
+ * chat agent uses `model.invoke()` so we don't get token-by-token streaming
+ * anyway. We only emit the clean final response from `on_chain_end`.
+ */
+export class ResponseStreamer {
+    /**
+     * Processes an `on_chain_end` event whose name is `agent_loop`.
+     *
+     * @returns An array of stream events to yield (token and/or error), plus
+     *          metadata for the caller to log.
+     */
+    handleAgentLoopEnd(sessionId, event) {
+        const output = event.data?.output;
+        const responseText = typeof output?.responseText === "string" ? output.responseText : "";
+        const agentError = typeof output?.error === "string" ? output.error : undefined;
+        logger.debug("Agent loop output", { output, responseText, agentError });
+        const events = [];
+        if (agentError) {
+            logger.warn("Agent loop returned error", { agentError });
+            events.push(createErrorEvent(sessionId, agentError === "JSON error injected into SSE stream"
+                ? "The response could not be sent correctly. Please try again."
+                : agentError, "AGENT_ERROR"));
+        }
+        if (responseText) {
+            events.push(createTokenEvent(sessionId, responseText));
+        }
+        return { events, responseText, hadError: !!agentError };
+    }
+}
+//# sourceMappingURL=response.streamer.js.map

package/dist/streamers/response.streamer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"response.streamer.js","sourceRoot":"","sources":["../../src/streamers/response.streamer.ts"],"names":[],"mappings":"AACA,OAAO,EACL,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAE/D,MAAM,MAAM,GAAG,cAAc,CAAC,kBAAkB,CAAC,CAAC;AAElD,iFAAiF;AACjF,oBAAoB;AACpB,iFAAiF;AAEjF;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,gBAAgB;IAC3B;;;;;OAKG;IACH,kBAAkB,CAChB,SAAiB,EACjB,KAAwE;QAExE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;QAClC,MAAM,YAAY,GAAG,OAAO,MAAM,EAAE,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QACzF,MAAM,UAAU,GAAG,OAAO,MAAM,EAAE,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAEhF,MAAM,CAAC,KAAK,CAAC,mBAAmB,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC;QAExE,MAAM,MAAM,GAAsB,EAAE,CAAC;QAErC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;YACzD,MAAM,CAAC,IAAI,CACT,gBAAgB,CACd,SAAS,EACT,UAAU,KAAK,qCAAqC;gBAClD,CAAC,CAAC,6DAA6D;gBAC/D,CAAC,CAAC,UAAU,EACd,aAAa,CACd,CACF,CAAC;QACJ,CAAC;QAED,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC;IAC1D,CAAC;CACF"}

package/dist/support/chat.utils.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Token utilities for context window management.
+ * Estimates token counts and truncates message arrays to fit within model limits.
+ * Uses a simple heuristic (~4 chars per token for English).
+ */
+import { BaseMessage } from "@langchain/core/messages";
+/**
+ * Default maximum tokens to allow for context.
+ * Reserves space for system prompt and response generation.
+ */
+export declare const MAX_CONTEXT_TOKENS = 8000;
+/**
+ * Estimate token count for a string using a simple heuristic.
+ *
+ * This uses a rough estimate of ~4 characters per token, which works
+ * reasonably well for English text. For more accuracy with specific
+ * models, use tiktoken or the model's native tokenizer.
+ *
+ * @param text - The text to estimate tokens for
+ * @returns Estimated token count
+ */
+export declare function estimateTokenCount(text: string): number;
+/**
+ * Estimate token count for a message, including role overhead.
+ *
+ * @param message - The LangChain message to estimate
+ * @returns Estimated token count including message overhead
+ */
+export declare function estimateMessageTokens(message: BaseMessage): number;
+/**
+ * Truncate messages to fit within token limit, keeping most recent messages.
+ *
+ * Messages are processed from newest to oldest, accumulating until the
+ * token limit is reached. The first message (usually system) is always
+ * kept if present.
+ *
+ * @param messages - Array of messages to truncate
+ * @param maxTokens - Maximum total tokens allowed (default: MAX_CONTEXT_TOKENS)
+ * @returns Array of messages that fit within the token limit
+ */
+export declare function truncateToTokenLimit(messages: BaseMessage[], maxTokens?: number): BaseMessage[];
+//# sourceMappingURL=chat.utils.d.ts.map

package/dist/support/chat.utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chat.utils.d.ts","sourceRoot":"","sources":["../../src/support/chat.utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAEvD;;;GAGG;AACH,eAAO,MAAM,kBAAkB,OAAO,CAAC;AAKvC;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAKvD;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,WAAW,GAAG,MAAM,CAQlE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,WAAW,EAAE,EACvB,SAAS,GAAE,MAA2B,GACrC,WAAW,EAAE,CA2Cf"}

package/dist/support/chat.utils.js

@@ -0,0 +1,89 @@
+/**
+ * Token utilities for context window management.
+ * Estimates token counts and truncates message arrays to fit within model limits.
+ * Uses a simple heuristic (~4 chars per token for English).
+ */
+/**
+ * Default maximum tokens to allow for context.
+ * Reserves space for system prompt and response generation.
+ */
+export const MAX_CONTEXT_TOKENS = 8000;
+/** Minimum tokens to reserve for the model's response (internal use in truncateToTokenLimit). */
+const RESERVED_RESPONSE_TOKENS = 2000;
+/**
+ * Estimate token count for a string using a simple heuristic.
+ *
+ * This uses a rough estimate of ~4 characters per token, which works
+ * reasonably well for English text. For more accuracy with specific
+ * models, use tiktoken or the model's native tokenizer.
+ *
+ * @param text - The text to estimate tokens for
+ * @returns Estimated token count
+ */
+export function estimateTokenCount(text) {
+    if (!text)
+        return 0;
+    // Rough estimate: ~4 characters per token for English
+    // This tends to slightly overestimate, which is safer for truncation
+    return Math.ceil(text.length / 4);
+}
+/**
+ * Estimate token count for a message, including role overhead.
+ *
+ * @param message - The LangChain message to estimate
+ * @returns Estimated token count including message overhead
+ */
+export function estimateMessageTokens(message) {
+    const content = typeof message.content === "string"
+        ? message.content
+        : JSON.stringify(message.content);
+    // Add ~4 tokens overhead per message for role and formatting
+    return estimateTokenCount(content) + 4;
+}
+/**
+ * Truncate messages to fit within token limit, keeping most recent messages.
+ *
+ * Messages are processed from newest to oldest, accumulating until the
+ * token limit is reached. The first message (usually system) is always
+ * kept if present.
+ *
+ * @param messages - Array of messages to truncate
+ * @param maxTokens - Maximum total tokens allowed (default: MAX_CONTEXT_TOKENS)
+ * @returns Array of messages that fit within the token limit
+ */
+export function truncateToTokenLimit(messages, maxTokens = MAX_CONTEXT_TOKENS) {
+    if (messages.length === 0)
+        return [];
+    // Calculate available tokens (reserve space for response)
+    const availableTokens = maxTokens - RESERVED_RESPONSE_TOKENS;
+    // If only one message, return it (truncation within message not supported)
+    if (messages.length === 1) {
+        return messages;
+    }
+    let totalTokens = 0;
+    const result = [];
+    // Check if first message is a system message (should always be kept)
+    const firstMessage = messages[0];
+    const hasSystemMessage = firstMessage._getType() === "system";
+    if (hasSystemMessage) {
+        const systemTokens = estimateMessageTokens(firstMessage);
+        totalTokens += systemTokens;
+        result.push(firstMessage);
+    }
+    // Process remaining messages from newest to oldest
+    const remainingMessages = hasSystemMessage ? messages.slice(1) : messages;
+    const recentMessages = [];
+    for (let i = remainingMessages.length - 1; i >= 0; i--) {
+        const msg = remainingMessages[i];
+        const msgTokens = estimateMessageTokens(msg);
+        if (totalTokens + msgTokens > availableTokens) {
+            // Stop adding more messages
+            break;
+        }
+        recentMessages.unshift(msg);
+        totalTokens += msgTokens;
+    }
+    // Combine system message (if any) with recent messages
+    return hasSystemMessage ? [firstMessage, ...recentMessages] : recentMessages;
+}
+//# sourceMappingURL=chat.utils.js.map

package/dist/support/chat.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chat.utils.js","sourceRoot":"","sources":["../../src/support/chat.utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEvC,iGAAiG;AACjG,MAAM,wBAAwB,GAAG,IAAI,CAAC;AAEtC;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IACpB,sDAAsD;IACtD,qEAAqE;IACrE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAoB;IACxD,MAAM,OAAO,GACX,OAAO,OAAO,CAAC,OAAO,KAAK,QAAQ;QACjC,CAAC,CAAC,OAAO,CAAC,OAAO;QACjB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAEtC,6DAA6D;IAC7D,OAAO,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAuB,EACvB,YAAoB,kBAAkB;IAEtC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,0DAA0D;IAC1D,MAAM,eAAe,GAAG,SAAS,GAAG,wBAAwB,CAAC;IAE7D,2EAA2E;IAC3E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,MAAM,GAAkB,EAAE,CAAC;IAEjC,qEAAqE;IACrE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,gBAAgB,GAAG,YAAY,CAAC,QAAQ,EAAE,KAAK,QAAQ,CAAC;IAE9D,IAAI,gBAAgB,EAAE,CAAC;QACrB,MAAM,YAAY,GAAG,qBAAqB,CAAC,YAAY,CAAC,CAAC;QACzD,WAAW,IAAI,YAAY,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC5B,CAAC;IAED,mDAAmD;IACnD,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC1E,MAAM,cAAc,GAAkB,EAAE,CAAC;IAEzC,KAAK,IAAI,CAAC,GAAG,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvD,MAAM,GAAG,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,SAAS,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;QAE7C,IAAI,WAAW,GAAG,SAAS,GAAG,eAAe,EAAE,CAAC;YAC9C,4BAA4B;YAC5B,MAAM;QACR,CAAC;QAED,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5B,WAAW,IAAI,SAAS,CAAC;IAC3B,CAAC;IAED,uDAAuD;IACvD,OAAO,gBAAgB,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC;AAC/E,CAAC"}

package/dist/support/debug-meta.sanitizer.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Sanitizes objects for inclusion in chat debug meta.
+ * Strips embeddings, truncates long strings, and handles circular refs.
+ */
+/** Exported for tests that assert on circular-ref placeholder. */
+export declare const SANITIZATION_ERROR_PLACEHOLDER = "[sanitization error]";
+/**
+ * Sanitizes an object for safe inclusion in debug meta.
+ * - Replaces embedding/vector keys and long number arrays with placeholders.
+ * - Truncates strings over maxStringLength.
+ * - On circular reference or error, returns a placeholder string.
+ *
+ * @param obj - Value to sanitize (object, array, or primitive)
+ * @param maxStringLength - Max string length before truncation (default 2048)
+ * @returns Sanitized copy or "[sanitization error]" on failure
+ */
+export declare function sanitizeForDebugMeta(obj: unknown, maxStringLength?: number): unknown;
+//# sourceMappingURL=debug-meta.sanitizer.d.ts.map

package/dist/support/debug-meta.sanitizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug-meta.sanitizer.d.ts","sourceRoot":"","sources":["../../src/support/debug-meta.sanitizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH,kEAAkE;AAClE,eAAO,MAAM,8BAA8B,yBAAyB,CAAC;AAwDrE;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,OAAO,EACZ,eAAe,GAAE,MAAkC,GAClD,OAAO,CAOT"}

package/dist/support/debug-meta.sanitizer.js

@@ -0,0 +1,82 @@
+/**
+ * Sanitizes objects for inclusion in chat debug meta.
+ * Strips embeddings, truncates long strings, and handles circular refs.
+ */
+const BLOCKLIST_KEYS = new Set([
+    "embedding",
+    "embeddingVector",
+    "vector",
+]);
+const BLOCKLIST_SUFFIXES = ["Embedding", "Vector"];
+const EMBEDDING_ARRAY_THRESHOLD = 100;
+const DEFAULT_MAX_STRING_LENGTH = 2048;
+/** Exported for tests that assert on circular-ref placeholder. */
+export const SANITIZATION_ERROR_PLACEHOLDER = "[sanitization error]";
+function isBlocklistedKey(key) {
+    if (BLOCKLIST_KEYS.has(key))
+        return true;
+    return BLOCKLIST_SUFFIXES.some((s) => key.endsWith(s));
+}
+function isNumberArray(arr) {
+    return Array.isArray(arr) && arr.length > 0 && typeof arr[0] === "number";
+}
+function truncateString(str, maxLen) {
+    if (str.length <= maxLen)
+        return str;
+    return `[truncated, ${str.length} chars]`;
+}
+function sanitizeValue(value, maxStringLength, seen) {
+    if (value === null || value === undefined)
+        return value;
+    if (typeof value === "number" || typeof value === "boolean")
+        return value;
+    if (typeof value === "string")
+        return truncateString(value, maxStringLength);
+    if (typeof value === "object") {
+        if (seen.has(value))
+            return SANITIZATION_ERROR_PLACEHOLDER;
+        seen.add(value);
+        if (Array.isArray(value)) {
+            if (isNumberArray(value) && value.length > EMBEDDING_ARRAY_THRESHOLD)
+                return `[embedding, length ${value.length}]`;
+            return value.map((item) => sanitizeValue(item, maxStringLength, seen));
+        }
+        const obj = value;
+        const out = {};
+        for (const [k, v] of Object.entries(obj)) {
+            if (isBlocklistedKey(k)) {
+                if (Array.isArray(v) && isNumberArray(v))
+                    out[k] = `[embedding, length ${v.length}]`;
+                else if (Array.isArray(v))
+                    out[k] = `[array, length ${v.length}]`;
+                else
+                    out[k] = "[redacted]";
+            }
+            else {
+                out[k] = sanitizeValue(v, maxStringLength, seen);
+            }
+        }
+        return out;
+    }
+    return value;
+}
+/**
+ * Sanitizes an object for safe inclusion in debug meta.
+ * - Replaces embedding/vector keys and long number arrays with placeholders.
+ * - Truncates strings over maxStringLength.
+ * - On circular reference or error, returns a placeholder string.
+ *
+ * @param obj - Value to sanitize (object, array, or primitive)
+ * @param maxStringLength - Max string length before truncation (default 2048)
+ * @returns Sanitized copy or "[sanitization error]" on failure
+ */
+export function sanitizeForDebugMeta(obj, maxStringLength = DEFAULT_MAX_STRING_LENGTH) {
+    try {
+        const seen = new WeakSet();
+        return sanitizeValue(obj, maxStringLength, seen);
+    }
+    catch {
+        return SANITIZATION_ERROR_PLACEHOLDER;
+    }
+}
+//# sourceMappingURL=debug-meta.sanitizer.js.map

package/dist/support/debug-meta.sanitizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"debug-meta.sanitizer.js","sourceRoot":"","sources":["../../src/support/debug-meta.sanitizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC;IAC7B,WAAW;IACX,iBAAiB;IACjB,QAAQ;CACT,CAAC,CAAC;AACH,MAAM,kBAAkB,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;AACnD,MAAM,yBAAyB,GAAG,GAAG,CAAC;AACtC,MAAM,yBAAyB,GAAG,IAAI,CAAC;AACvC,kEAAkE;AAClE,MAAM,CAAC,MAAM,8BAA8B,GAAG,sBAAsB,CAAC;AAErE,SAAS,gBAAgB,CAAC,GAAW;IACnC,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,OAAO,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,SAAS,aAAa,CAAC,GAAY;IACjC,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC;AAC5E,CAAC;AAED,SAAS,cAAc,CAAC,GAAW,EAAE,MAAc;IACjD,IAAI,GAAG,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO,GAAG,CAAC;IACrC,OAAO,eAAe,GAAG,CAAC,MAAM,SAAS,CAAC;AAC5C,CAAC;AAED,SAAS,aAAa,CACpB,KAAc,EACd,eAAuB,EACvB,IAAqB;IAErB,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC1E,IAAI,OAAO,KAAK,KAAK,QAAQ;QAC3B,OAAO,cAAc,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;IAEhD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAe,CAAC;YAAE,OAAO,8BAA8B,CAAC;QACrE,IAAI,CAAC,GAAG,CAAC,KAAe,CAAC,CAAC;QAE1B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,yBAAyB;gBAClE,OAAO,sBAAsB,KAAK,CAAC,MAAM,GAAG,CAAC;YAC/C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC;QACzE,CAAC;QAED,MAAM,GAAG,GAAG,KAAgC,CAAC;QAC7C,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACzC,IAAI,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC;oBACtC,GAAG,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,CAAC,MAAM,GAAG,CAAC;qBACxC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBACvB,GAAG,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,MAAM,GAAG,CAAC;;oBAEvC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAClC,GAAY,EACZ,kBAA0B,yBAAyB;IAEnD,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,OAAO,EAAU,CAAC;QACnC,OAAO,aAAa,CAAC,GAAG,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;IACnD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,8BAA8B,CAAC;IACxC,CAAC;AACH,CAAC"}

package/dist/support/feed.health.d.ts

@@ -0,0 +1,32 @@
+/** Input for computing feed health score. */
+export interface FeedHealthInput {
+    connectionCount: number;
+    connectorFlowCount: number;
+    expiredCount: number;
+    totalActionable: number;
+    /** Unix ms timestamp of last rediscovery, or null if never. */
+    lastRediscoveryAt: number | null;
+    /** Window in ms over which freshness decays from 1 → 0 (e.g. 12h). */
+    freshnessWindowMs: number;
+    /** Score threshold below which shouldMaintain is true. Default 0.5. */
+    threshold?: number;
+}
+/** Output of feed health computation. */
+export interface FeedHealthResult {
+    score: number;
+    breakdown: {
+        composition: number;
+        freshness: number;
+        expirationRatio: number;
+    };
+    shouldMaintain: boolean;
+}
+/**
+ * Compute feed health score (0–1) from current feed state.
+ * Pure function, no side effects.
+ *
+ * @param input - Current feed composition and timing data
+ * @returns Health score with breakdown and maintenance recommendation
+ */
+export declare function computeFeedHealth(input: FeedHealthInput): FeedHealthResult;
+//# sourceMappingURL=feed.health.d.ts.map

package/dist/support/feed.health.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"feed.health.d.ts","sourceRoot":"","sources":["../../src/support/feed.health.ts"],"names":[],"mappings":"AAEA,6CAA6C;AAC7C,MAAM,WAAW,eAAe;IAC9B,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,+DAA+D;IAC/D,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,sEAAsE;IACtE,iBAAiB,EAAE,MAAM,CAAC;IAC1B,uEAAuE;IACvE,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,yCAAyC;AACzC,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE;QACT,WAAW,EAAE,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IACF,cAAc,EAAE,OAAO,CAAC;CACzB;AAiDD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,eAAe,GAAG,gBAAgB,CAkC1E"}

package/dist/support/feed.health.js

@@ -0,0 +1,76 @@
+import { FEED_SOFT_TARGETS } from './opportunity.utils.js';
+const WEIGHT_COMPOSITION = 0.4;
+const WEIGHT_FRESHNESS = 0.3;
+const WEIGHT_EXPIRATION = 0.3;
+const DEFAULT_THRESHOLD = 0.5;
+/**
+ * Compute composition sub-score: how close current counts are to soft targets.
+ * Uses normalized distance: 1 - (|actual - target| / max(target, actual, 1)) per category,
+ * then averages across categories.
+ */
+function scoreComposition(connectionCount, connectorFlowCount, expiredCount) {
+    const categories = [
+        { actual: connectionCount, target: FEED_SOFT_TARGETS.connection },
+        { actual: connectorFlowCount, target: FEED_SOFT_TARGETS.connectorFlow },
+        { actual: expiredCount, target: FEED_SOFT_TARGETS.expired },
+    ];
+    let totalScore = 0;
+    for (const { actual, target } of categories) {
+        const diff = Math.abs(actual - target);
+        const denom = Math.max(target, actual, 1);
+        totalScore += 1 - diff / denom;
+    }
+    return totalScore / categories.length;
+}
+/**
+ * Compute freshness sub-score: linear decay from 1 → 0 over freshnessWindowMs.
+ */
+function scoreFreshness(lastRediscoveryAt, freshnessWindowMs) {
+    if (lastRediscoveryAt == null)
+        return 0;
+    const elapsed = Date.now() - lastRediscoveryAt;
+    if (elapsed <= 0)
+        return 1;
+    if (elapsed >= freshnessWindowMs)
+        return 0;
+    return 1 - elapsed / freshnessWindowMs;
+}
+/**
+ * Compute expiration ratio sub-score: 1 - (expired / total).
+ */
+function scoreExpirationRatio(expiredCount, totalActionable) {
+    const total = totalActionable + expiredCount;
+    if (total === 0)
+        return 0;
+    return 1 - expiredCount / total;
+}
+/**
+ * Compute feed health score (0–1) from current feed state.
+ * Pure function, no side effects.
+ *
+ * @param input - Current feed composition and timing data
+ * @returns Health score with breakdown and maintenance recommendation
+ */
+export function computeFeedHealth(input) {
+    const { connectionCount, connectorFlowCount, expiredCount, totalActionable, lastRediscoveryAt, freshnessWindowMs, threshold = DEFAULT_THRESHOLD, } = input;
+    // Empty feed is always unhealthy
+    if (totalActionable === 0 && expiredCount === 0) {
+        return {
+            score: 0,
+            breakdown: { composition: 0, freshness: 0, expirationRatio: 0 },
+            shouldMaintain: true,
+        };
+    }
+    const composition = scoreComposition(connectionCount, connectorFlowCount, expiredCount);
+    const freshness = scoreFreshness(lastRediscoveryAt, freshnessWindowMs);
+    const expirationRatio = scoreExpirationRatio(expiredCount, totalActionable);
+    const score = WEIGHT_COMPOSITION * composition +
+        WEIGHT_FRESHNESS * freshness +
+        WEIGHT_EXPIRATION * expirationRatio;
+    return {
+        score,
+        breakdown: { composition, freshness, expirationRatio },
+        shouldMaintain: score < threshold,
+    };
+}
+//# sourceMappingURL=feed.health.js.map

package/dist/support/feed.health.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"feed.health.js","sourceRoot":"","sources":["../../src/support/feed.health.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AA2B3D,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAC/B,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,eAAuB,EAAE,kBAA0B,EAAE,YAAoB;IACjG,MAAM,UAAU,GAAG;QACjB,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,iBAAiB,CAAC,UAAU,EAAE;QACjE,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,EAAE,iBAAiB,CAAC,aAAa,EAAE;QACvE,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,iBAAiB,CAAC,OAAO,EAAE;KAC5D,CAAC;IAEF,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1C,UAAU,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC;IACjC,CAAC;IAED,OAAO,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,iBAAgC,EAAE,iBAAyB;IACjF,IAAI,iBAAiB,IAAI,IAAI;QAAE,OAAO,CAAC,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,iBAAiB,CAAC;IAC/C,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3B,IAAI,OAAO,IAAI,iBAAiB;QAAE,OAAO,CAAC,CAAC;IAC3C,OAAO,CAAC,GAAG,OAAO,GAAG,iBAAiB,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,YAAoB,EAAE,eAAuB;IACzE,MAAM,KAAK,GAAG,eAAe,GAAG,YAAY,CAAC;IAC7C,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,CAAC,GAAG,YAAY,GAAG,KAAK,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAsB;IACtD,MAAM,EACJ,eAAe,EACf,kBAAkB,EAClB,YAAY,EACZ,eAAe,EACf,iBAAiB,EACjB,iBAAiB,EACjB,SAAS,GAAG,iBAAiB,GAC9B,GAAG,KAAK,CAAC;IAEV,iCAAiC;IACjC,IAAI,eAAe,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;QAChD,OAAO;YACL,KAAK,EAAE,CAAC;YACR,SAAS,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE;YAC/D,cAAc,EAAE,IAAI;SACrB,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,GAAG,gBAAgB,CAAC,eAAe,EAAE,kBAAkB,EAAE,YAAY,CAAC,CAAC;IACxF,MAAM,SAAS,GAAG,cAAc,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;IACvE,MAAM,eAAe,GAAG,oBAAoB,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC;IAE5E,MAAM,KAAK,GACT,kBAAkB,GAAG,WAAW;QAChC,gBAAgB,GAAG,SAAS;QAC5B,iBAAiB,GAAG,eAAe,CAAC;IAEtC,OAAO;QACL,KAAK;QACL,SAAS,EAAE,EAAE,WAAW,EAAE,SAAS,EAAE,eAAe,EAAE;QACtD,cAAc,EAAE,KAAK,GAAG,SAAS;KAClC,CAAC;AACJ,CAAC"}

package/dist/support/introducer.discovery.d.ts

@@ -0,0 +1,78 @@
+/**
+ * Introducer Discovery: proactive discovery of connector-flow opportunities
+ * between a user's contacts.
+ *
+ * Selects top-N contacts from the user's personal index and runs scoped
+ * HyDE discovery for each, creating latent introducer opportunities that
+ * the user (as introducer) must approve before parties see them.
+ */
+/** Maximum contacts to evaluate per maintenance cycle. */
+export declare const MAX_CONTACTS_PER_CYCLE = 5;
+/** Maximum candidate opportunities per contact. */
+export declare const MAX_CANDIDATES_PER_CONTACT = 3;
+/** Detection source value for introducer-discovered opportunities. */
+export declare const INTRODUCER_DISCOVERY_SOURCE: "introducer_discovery";
+/** A contact with their active intents, used for introducer discovery selection. */
+export interface ContactWithIntents {
+    userId: string;
+    /** Most recent intent updatedAt timestamp (ISO string or null). */
+    latestIntentAt: string | null;
+    /** Number of active intents this contact has. */
+    intentCount: number;
+}
+/** Database methods needed for introducer discovery contact selection. */
+export interface IntroducerDiscoveryDatabase {
+    /** Get the user's personal index ID. */
+    getPersonalIndexId(userId: string): Promise<string | null>;
+    /** Get contacts from a personal index with their intent freshness data. */
+    getContactsWithIntentFreshness(personalIndexId: string, ownerId: string, limit: number): Promise<ContactWithIntents[]>;
+}
+/** Queue interface for enqueuing introducer discovery jobs. */
+export interface IntroducerDiscoveryQueue {
+    addJob(data: {
+        intentId: string;
+        userId: string;
+        indexIds?: string[];
+        contactUserId?: string;
+    }, options?: {
+        priority?: number;
+        jobId?: string;
+    }): Promise<unknown>;
+}
+/** Result of a single introducer discovery cycle. */
+export interface IntroducerDiscoveryResult {
+    contactsEvaluated: number;
+    jobsEnqueued: number;
+    skippedReason?: string;
+}
+/**
+ * Select top-N contacts for introducer discovery, sorted by intent freshness.
+ * Contacts with no active intents are excluded.
+ *
+ * @param database - Database adapter with contact/intent queries
+ * @param userId - The introducer user
+ * @param limit - Max contacts to return (default MAX_CONTACTS_PER_CYCLE)
+ * @returns Sorted contacts with intent data
+ */
+export declare function selectContactsForDiscovery(database: IntroducerDiscoveryDatabase, userId: string, limit?: number): Promise<ContactWithIntents[]>;
+/**
+ * Determine whether introducer discovery should run based on the current
+ * connector-flow composition. Triggers when connector-flow count is below
+ * the soft target.
+ *
+ * @param connectorFlowCount - Current number of connector-flow opportunities
+ * @param connectorFlowTarget - Soft target (default 2)
+ * @returns Whether introducer discovery should run
+ */
+export declare function shouldRunIntroducerDiscovery(connectorFlowCount: number, connectorFlowTarget?: number): boolean;
+/**
+ * Run introducer discovery for a user: select contacts, enqueue discovery jobs.
+ * Each job uses onBehalfOfUserId so the opportunity graph treats the user as introducer.
+ *
+ * @param database - Database adapter for contact queries
+ * @param queue - Queue for enqueuing discovery jobs
+ * @param userId - The introducer user
+ * @returns Summary of the discovery cycle
+ */
+export declare function runIntroducerDiscovery(database: IntroducerDiscoveryDatabase, queue: IntroducerDiscoveryQueue, userId: string): Promise<IntroducerDiscoveryResult>;
+//# sourceMappingURL=introducer.discovery.d.ts.map

package/dist/support/introducer.discovery.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"introducer.discovery.d.ts","sourceRoot":"","sources":["../../src/support/introducer.discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAMH,0DAA0D;AAC1D,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAExC,mDAAmD;AACnD,eAAO,MAAM,0BAA0B,IAAI,CAAC;AAE5C,sEAAsE;AACtE,eAAO,MAAM,2BAA2B,EAAG,sBAA+B,CAAC;AAE3E,oFAAoF;AACpF,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,mEAAmE;IACnE,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,iDAAiD;IACjD,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,0EAA0E;AAC1E,MAAM,WAAW,2BAA2B;IAC1C,wCAAwC;IACxC,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAC3D,2EAA2E;IAC3E,8BAA8B,CAC5B,eAAe,EAAE,MAAM,EACvB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;CAClC;AAED,+DAA+D;AAC/D,MAAM,WAAW,wBAAwB;IACvC,MAAM,CACJ,IAAI,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,aAAa,CAAC,EAAE,MAAM,CAAA;KAAE,EACvF,OAAO,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC9C,OAAO,CAAC,OAAO,CAAC,CAAC;CACrB;AAED,qDAAqD;AACrD,MAAM,WAAW,yBAAyB;IACxC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;GAQG;AACH,wBAAsB,0BAA0B,CAC9C,QAAQ,EAAE,2BAA2B,EACrC,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,MAA+B,GACrC,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAgB/B;AAED;;;;;;;;GAQG;AACH,wBAAgB,4BAA4B,CAC1C,kBAAkB,EAAE,MAAM,EAC1B,mBAAmB,GAAE,MAAU,GAC9B,OAAO,CAET;AAED;;;;;;;;GAQG;AACH,wBAAsB,sBAAsB,CAC1C,QAAQ,EAAE,2BAA2B,EACrC,KAAK,EAAE,wBAAwB,EAC/B,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,yBAAyB,CAAC,CAqDpC"}

package/dist/support/introducer.discovery.js

@@ -0,0 +1,101 @@
+/**
+ * Introducer Discovery: proactive discovery of connector-flow opportunities
+ * between a user's contacts.
+ *
+ * Selects top-N contacts from the user's personal index and runs scoped
+ * HyDE discovery for each, creating latent introducer opportunities that
+ * the user (as introducer) must approve before parties see them.
+ */
+import { protocolLogger } from './protocol.logger.js';
+const logger = protocolLogger('IntroducerDiscovery');
+/** Maximum contacts to evaluate per maintenance cycle. */
+export const MAX_CONTACTS_PER_CYCLE = 5;
+/** Maximum candidate opportunities per contact. */
+export const MAX_CANDIDATES_PER_CONTACT = 3;
+/** Detection source value for introducer-discovered opportunities. */
+export const INTRODUCER_DISCOVERY_SOURCE = 'introducer_discovery';
+/**
+ * Select top-N contacts for introducer discovery, sorted by intent freshness.
+ * Contacts with no active intents are excluded.
+ *
+ * @param database - Database adapter with contact/intent queries
+ * @param userId - The introducer user
+ * @param limit - Max contacts to return (default MAX_CONTACTS_PER_CYCLE)
+ * @returns Sorted contacts with intent data
+ */
+export async function selectContactsForDiscovery(database, userId, limit = MAX_CONTACTS_PER_CYCLE) {
+    const personalIndexId = await database.getPersonalIndexId(userId);
+    if (!personalIndexId) {
+        logger.verbose(`[IntroducerDiscovery] No personal index found — userId=${userId}`);
+        return [];
+    }
+    const contacts = await database.getContactsWithIntentFreshness(personalIndexId, userId, limit);
+    logger.verbose(`[IntroducerDiscovery] Selected contacts for discovery — userId=${userId} totalContacts=${contacts.length} limit=${limit}`);
+    return contacts;
+}
+/**
+ * Determine whether introducer discovery should run based on the current
+ * connector-flow composition. Triggers when connector-flow count is below
+ * the soft target.
+ *
+ * @param connectorFlowCount - Current number of connector-flow opportunities
+ * @param connectorFlowTarget - Soft target (default 2)
+ * @returns Whether introducer discovery should run
+ */
+export function shouldRunIntroducerDiscovery(connectorFlowCount, connectorFlowTarget = 2) {
+    return connectorFlowCount < connectorFlowTarget;
+}
+/**
+ * Run introducer discovery for a user: select contacts, enqueue discovery jobs.
+ * Each job uses onBehalfOfUserId so the opportunity graph treats the user as introducer.
+ *
+ * @param database - Database adapter for contact queries
+ * @param queue - Queue for enqueuing discovery jobs
+ * @param userId - The introducer user
+ * @returns Summary of the discovery cycle
+ */
+export async function runIntroducerDiscovery(database, queue, userId) {
+    const personalIndexId = await database.getPersonalIndexId(userId);
+    if (!personalIndexId) {
+        return { contactsEvaluated: 0, jobsEnqueued: 0, skippedReason: 'no_personal_index' };
+    }
+    const contacts = await selectContactsForDiscovery(database, userId);
+    if (contacts.length === 0) {
+        return { contactsEvaluated: 0, jobsEnqueued: 0, skippedReason: 'no_contacts' };
+    }
+    const bucket = Math.floor(Date.now() / (12 * 60 * 60 * 1000)); // 12h dedup bucket
+    let jobsEnqueued = 0;
+    const results = await Promise.allSettled(contacts.map(async (contact) => {
+        // For each contact, we enqueue a discovery job using one of their intents
+        // The opportunity graph will use onBehalfOfUserId to discover on behalf of the contact
+        // while the userId (introducer) gets the introducer role
+        const jobId = `introducer-discovery-${userId}-${contact.userId}-${bucket}`;
+        try {
+            await queue.addJob({
+                intentId: `introducer:${contact.userId}`,
+                userId,
+                indexIds: [personalIndexId],
+                contactUserId: contact.userId,
+            }, { priority: 15, jobId });
+            return true;
+        }
+        catch (err) {
+            const message = err instanceof Error ? err.message : String(err);
+            if (/duplicate|already exists|job.*id/i.test(message)) {
+                logger.verbose(`[IntroducerDiscovery] Job skipped (duplicate) — userId=${userId} contactUserId=${contact.userId} error=${message}`);
+                return false;
+            }
+            throw err;
+        }
+    }));
+    for (const r of results) {
+        if (r.status === 'rejected') {
+            const errMsg = r.reason instanceof Error ? r.reason.message : String(r.reason);
+            logger.error(`[IntroducerDiscovery] Job enqueue failed: ${errMsg}`);
+        }
+    }
+    jobsEnqueued = results.filter((r) => r.status === 'fulfilled' && r.value).length;
+    logger.info(`[IntroducerDiscovery] Discovery cycle complete — userId=${userId} contactsEvaluated=${contacts.length} jobsEnqueued=${jobsEnqueued}`);
+    return { contactsEvaluated: contacts.length, jobsEnqueued };
+}
+//# sourceMappingURL=introducer.discovery.js.map

package/dist/support/introducer.discovery.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"introducer.discovery.js","sourceRoot":"","sources":["../../src/support/introducer.discovery.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,MAAM,MAAM,GAAG,cAAc,CAAC,qBAAqB,CAAC,CAAC;AAErD,0DAA0D;AAC1D,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAExC,mDAAmD;AACnD,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAE5C,sEAAsE;AACtE,MAAM,CAAC,MAAM,2BAA2B,GAAG,sBAA+B,CAAC;AAsC3E;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,0BAA0B,CAC9C,QAAqC,EACrC,MAAc,EACd,QAAgB,sBAAsB;IAEtC,MAAM,eAAe,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAClE,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,MAAM,CAAC,OAAO,CAAC,0DAA0D,MAAM,EAAE,CAAC,CAAC;QACnF,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,8BAA8B,CAC5D,eAAe,EACf,MAAM,EACN,KAAK,CACN,CAAC;IAEF,MAAM,CAAC,OAAO,CAAC,kEAAkE,MAAM,kBAAkB,QAAQ,CAAC,MAAM,UAAU,KAAK,EAAE,CAAC,CAAC;IAE3I,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,4BAA4B,CAC1C,kBAA0B,EAC1B,sBAA8B,CAAC;IAE/B,OAAO,kBAAkB,GAAG,mBAAmB,CAAC;AAClD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,QAAqC,EACrC,KAA+B,EAC/B,MAAc;IAEd,MAAM,eAAe,GAAG,MAAM,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAClE,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,OAAO,EAAE,iBAAiB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,mBAAmB,EAAE,CAAC;IACvF,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,0BAA0B,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACpE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,iBAAiB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,aAAa,EAAE,CAAC;IACjF,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,mBAAmB;IAClF,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CACtC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE;QAC7B,0EAA0E;QAC1E,uFAAuF;QACvF,yDAAyD;QACzD,MAAM,KAAK,GAAG,wBAAwB,MAAM,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;QAC3E,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,MAAM,CAChB;gBACE,QAAQ,EAAE,cAAc,OAAO,CAAC,MAAM,EAAE;gBACxC,MAAM;gBACN,QAAQ,EAAE,CAAC,eAAe,CAAC;gBAC3B,aAAa,EAAE,OAAO,CAAC,MAAM;aAC9B,EACD,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,CACxB,CAAC;YACF,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,IAAI,mCAAmC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtD,MAAM,CAAC,OAAO,CAAC,0DAA0D,MAAM,kBAAkB,OAAO,CAAC,MAAM,UAAU,OAAO,EAAE,CAAC,CAAC;gBACpI,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC,CAAC,CACH,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC/E,MAAM,CAAC,KAAK,CAAC,6CAA6C,MAAM,EAAE,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IACD,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IAEjF,MAAM,CAAC,IAAI,CAAC,2DAA2D,MAAM,sBAAsB,QAAQ,CAAC,MAAM,iBAAiB,YAAY,EAAE,CAAC,CAAC;IAEnJ,OAAO,EAAE,iBAAiB,EAAE,QAAQ,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC;AAC9D,CAAC"}