@massa-ai/core 1.2.1

package/dist/services/synapse/inhibition/confidence-gate.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Adaptive Confidence Gate.
+ *
+ * The original retrieval uses a static minScore (0.3) regardless of how
+ * specific the query is. That is too permissive for narrow lookups and too
+ * strict for exploratory ones. The gate classifies the query and applies a
+ * threshold proportional to how much precision the caller is implicitly
+ * asking for.
+ */
+import type { SearchResult } from "@massa-ai/shared";
+import type { QueryClass } from "../types.js";
+export interface ConfidenceGateConfig {
+    enabled: boolean;
+    thresholds: {
+        specific: number;
+        focused: number;
+        broad: number;
+    };
+}
+/**
+ * Classify a query into specific / focused / broad based on cheap heuristics.
+ * Sub-millisecond — no LLM call, no tokenizer dependency.
+ */
+export declare function classifyQuery(query: string): QueryClass;
+/**
+ * IMP-16: cheap pre-filter applied BEFORE attention/chain/diversity.
+ *
+ * Cuts only results that *have* a raw vector score below the gate threshold —
+ * they would be cut by the final gate anyway. Saves the downstream pipeline
+ * from re-ranking, tokenizing, and applying chain boosts to candidates that
+ * cannot survive. Results without a raw score are passed through unchanged
+ * and go through the full pipeline as before; the late gate still has the
+ * final word.
+ *
+ * Returns the surviving results plus the threshold/class for callers that
+ * want to log or surface the decision.
+ */
+export declare function prefilterByRawScore(results: SearchResult[], query: string, config: ConfidenceGateConfig): {
+    results: SearchResult[];
+    queryClass: QueryClass;
+    threshold: number;
+    cut: number;
+};
+export declare function applyConfidenceGate(results: SearchResult[], query: string, config: ConfidenceGateConfig): {
+    results: SearchResult[];
+    queryClass: QueryClass;
+    threshold: number;
+};
+//# sourceMappingURL=confidence-gate.d.ts.map

package/dist/services/synapse/inhibition/confidence-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"confidence-gate.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/confidence-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAE9C,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;CAClE;AA6CD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAsBvD;AAmBD;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,YAAY,EAAE,EACvB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,oBAAoB,GAC3B;IAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IAAC,UAAU,EAAE,UAAU,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAoBrF;AAED,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,YAAY,EAAE,EACvB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,oBAAoB,GAC3B;IAAE,OAAO,EAAE,YAAY,EAAE,CAAC;IAAC,UAAU,EAAE,UAAU,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAUxE"}

package/dist/services/synapse/inhibition/confidence-gate.js

@@ -0,0 +1,131 @@
+/**
+ * Adaptive Confidence Gate.
+ *
+ * The original retrieval uses a static minScore (0.3) regardless of how
+ * specific the query is. That is too permissive for narrow lookups and too
+ * strict for exploratory ones. The gate classifies the query and applies a
+ * threshold proportional to how much precision the caller is implicitly
+ * asking for.
+ */
+const FILE_PATH_RE = /\b[\w./-]+\.[a-z]{2,5}\b/i;
+const CAMEL_CASE_RE = /\b[a-z]+[A-Z][A-Za-z0-9]+\b/;
+const PASCAL_CASE_RE = /\b[A-Z][a-z]+[A-Z][A-Za-z0-9]+\b/;
+const SNAKE_CASE_RE = /\b[a-z][a-z0-9]*_[a-z0-9_]+\b/;
+const FUNCTION_CALL_RE = /\b[A-Za-z_][\w]*\s*\(/;
+const QUOTED_SYMBOL_RE = /["`'][^"`']{2,}["`']/;
+const TECHNICAL_KEYWORDS = new Set([
+    "function",
+    "class",
+    "interface",
+    "type",
+    "method",
+    "module",
+    "import",
+    "export",
+    "async",
+    "await",
+    "promise",
+    "callback",
+    "middleware",
+    "handler",
+    "service",
+    "config",
+    "schema",
+    "migration",
+    "query",
+    "endpoint",
+    "route",
+    "controller",
+    "repository",
+    "factory",
+    "provider",
+    "adapter",
+    "decorator",
+    "hook",
+    "store",
+    "reducer",
+    "selector",
+    "component",
+    "plugin",
+]);
+/**
+ * Classify a query into specific / focused / broad based on cheap heuristics.
+ * Sub-millisecond — no LLM call, no tokenizer dependency.
+ */
+export function classifyQuery(query) {
+    const trimmed = query.trim();
+    if (!trimmed)
+        return "broad";
+    if (FILE_PATH_RE.test(trimmed) ||
+        CAMEL_CASE_RE.test(trimmed) ||
+        PASCAL_CASE_RE.test(trimmed) ||
+        SNAKE_CASE_RE.test(trimmed) ||
+        FUNCTION_CALL_RE.test(trimmed) ||
+        QUOTED_SYMBOL_RE.test(trimmed)) {
+        return "specific";
+    }
+    const words = trimmed.toLowerCase().split(/\s+/);
+    const technicalHits = words.filter((w) => TECHNICAL_KEYWORDS.has(w)).length;
+    if (technicalHits >= 1 && words.length <= 8) {
+        return "focused";
+    }
+    return "broad";
+}
+/**
+ * Filter results below the threshold for the detected query class.
+ *
+ * IMP-5: the gate prefers the *raw* vector cosine (`_rrfRawVectorScore`)
+ * over `result.score`. RRF normalization always lifts the top result to
+ * ~1.0 regardless of actual semantic relevance, so applying a threshold
+ * to the normalized score lets noise through on weak queries. The raw
+ * vectorScore is absolute and meaningful across queries. Falls back to
+ * `result.score` when the raw signal is unavailable (e.g., keyword-only
+ * results that never got a vector score).
+ */
+function relevanceScore(result) {
+    const meta = result.metadata;
+    const raw = meta?._rrfRawVectorScore;
+    return typeof raw === "number" ? raw : result.score;
+}
+/**
+ * IMP-16: cheap pre-filter applied BEFORE attention/chain/diversity.
+ *
+ * Cuts only results that *have* a raw vector score below the gate threshold —
+ * they would be cut by the final gate anyway. Saves the downstream pipeline
+ * from re-ranking, tokenizing, and applying chain boosts to candidates that
+ * cannot survive. Results without a raw score are passed through unchanged
+ * and go through the full pipeline as before; the late gate still has the
+ * final word.
+ *
+ * Returns the surviving results plus the threshold/class for callers that
+ * want to log or surface the decision.
+ */
+export function prefilterByRawScore(results, query, config) {
+    const queryClass = classifyQuery(query);
+    const threshold = config.thresholds[queryClass];
+    if (!config.enabled) {
+        return { results, queryClass, threshold, cut: 0 };
+    }
+    let cut = 0;
+    const survivors = [];
+    for (const r of results) {
+        const meta = r.metadata;
+        const raw = meta?._rrfRawVectorScore;
+        if (typeof raw === "number" && raw < threshold) {
+            cut++;
+            continue;
+        }
+        survivors.push(r);
+    }
+    return { results: survivors, queryClass, threshold, cut };
+}
+export function applyConfidenceGate(results, query, config) {
+    const queryClass = classifyQuery(query);
+    const threshold = config.thresholds[queryClass];
+    if (!config.enabled) {
+        return { results, queryClass, threshold };
+    }
+    const filtered = results.filter((r) => relevanceScore(r) >= threshold);
+    return { results: filtered, queryClass, threshold };
+}
+//# sourceMappingURL=confidence-gate.js.map

package/dist/services/synapse/inhibition/confidence-gate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"confidence-gate.js","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/confidence-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAUH,MAAM,YAAY,GAAG,2BAA2B,CAAC;AACjD,MAAM,aAAa,GAAG,6BAA6B,CAAC;AACpD,MAAM,cAAc,GAAG,kCAAkC,CAAC;AAC1D,MAAM,aAAa,GAAG,+BAA+B,CAAC;AACtD,MAAM,gBAAgB,GAAG,uBAAuB,CAAC;AACjD,MAAM,gBAAgB,GAAG,sBAAsB,CAAC;AAEhD,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC;IACjC,UAAU;IACV,OAAO;IACP,WAAW;IACX,MAAM;IACN,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;IACP,SAAS;IACT,UAAU;IACV,YAAY;IACZ,SAAS;IACT,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,WAAW;IACX,OAAO;IACP,UAAU;IACV,OAAO;IACP,YAAY;IACZ,YAAY;IACZ,SAAS;IACT,UAAU;IACV,SAAS;IACT,WAAW;IACX,MAAM;IACN,OAAO;IACP,SAAS;IACT,UAAU;IACV,WAAW;IACX,QAAQ;CACT,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,CAAC,OAAO;QAAE,OAAO,OAAO,CAAC;IAE7B,IACE,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC;QAC1B,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3B,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC;QAC5B,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3B,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC;QAC9B,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,EAC9B,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5E,IAAI,aAAa,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC5C,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,cAAc,CAAC,MAAoB;IAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,QAA+C,CAAC;IACpE,MAAM,GAAG,GAAG,IAAI,EAAE,kBAAkB,CAAC;IACrC,OAAO,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAuB,EACvB,KAAa,EACb,MAA4B;IAE5B,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAEhD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IACpD,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,CAAC,QAA+C,CAAC;QAC/D,MAAM,GAAG,GAAG,IAAI,EAAE,kBAAkB,CAAC;QACrC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,GAAG,SAAS,EAAE,CAAC;YAC/C,GAAG,EAAE,CAAC;YACN,SAAS;QACX,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,OAAuB,EACvB,KAAa,EACb,MAA4B;IAE5B,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAEhD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACpB,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IAC5C,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC;IACvE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;AACtD,CAAC"}

package/dist/services/synapse/inhibition/diversity-penalty.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Diversity Penalty (MMR-inspired).
+ *
+ * Penalizes results that are too similar to results already selected, so the
+ * top-N covers more distinct topics instead of restating the same chunk in
+ * different words. Operates on string similarity (Jaccard over normalized
+ * tokens) rather than embeddings, so it has zero extra cost and no embedding
+ * dependency at this layer.
+ */
+import type { SearchResult } from "@massa-ai/shared";
+export interface DiversityPenaltyConfig {
+    enabled: boolean;
+    threshold: number;
+    lambda: number;
+    /** Additional penalty applied when two results share the same filePath (IMP-4). */
+    samePathPenalty?: number;
+}
+/**
+ * Apply MMR-style diversity penalty in score order.
+ * Returns a new array, sorted by adjusted score DESC. Original list is not mutated.
+ *
+ * IMP-4: in addition to token Jaccard, a same-`filePath` penalty is applied
+ * so chunks from the same file get demoted relative to chunks from new files.
+ * Token similarity between two chunks of the same file is usually low (they
+ * cover different lines), so this is a complementary signal, not a duplicate.
+ */
+export declare function applyDiversityPenalty(results: SearchResult[], config: DiversityPenaltyConfig): SearchResult[];
+//# sourceMappingURL=diversity-penalty.d.ts.map

package/dist/services/synapse/inhibition/diversity-penalty.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diversity-penalty.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/diversity-penalty.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAErD,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,mFAAmF;IACnF,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AA+BD;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,YAAY,EAAE,EACvB,MAAM,EAAE,sBAAsB,GAC7B,YAAY,EAAE,CAsChB"}

package/dist/services/synapse/inhibition/diversity-penalty.js

@@ -0,0 +1,75 @@
+/**
+ * Diversity Penalty (MMR-inspired).
+ *
+ * Penalizes results that are too similar to results already selected, so the
+ * top-N covers more distinct topics instead of restating the same chunk in
+ * different words. Operates on string similarity (Jaccard over normalized
+ * tokens) rather than embeddings, so it has zero extra cost and no embedding
+ * dependency at this layer.
+ */
+const TOKEN_RE = /[a-z0-9_]{2,}/g;
+function tokenize(text) {
+    const lowered = text.toLowerCase();
+    const tokens = new Set();
+    for (const match of lowered.matchAll(TOKEN_RE)) {
+        tokens.add(match[0]);
+    }
+    return tokens;
+}
+function jaccard(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    let intersection = 0;
+    const [smaller, larger] = a.size <= b.size ? [a, b] : [b, a];
+    for (const token of smaller) {
+        if (larger.has(token))
+            intersection++;
+    }
+    const union = a.size + b.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+function extractFilePath(result) {
+    const meta = result.metadata;
+    if (!meta)
+        return null;
+    const raw = meta.filePath ?? meta.file_path;
+    return typeof raw === "string" && raw.length > 0 ? raw : null;
+}
+/**
+ * Apply MMR-style diversity penalty in score order.
+ * Returns a new array, sorted by adjusted score DESC. Original list is not mutated.
+ *
+ * IMP-4: in addition to token Jaccard, a same-`filePath` penalty is applied
+ * so chunks from the same file get demoted relative to chunks from new files.
+ * Token similarity between two chunks of the same file is usually low (they
+ * cover different lines), so this is a complementary signal, not a duplicate.
+ */
+export function applyDiversityPenalty(results, config) {
+    if (!config.enabled || results.length < 2)
+        return results;
+    const samePathPenalty = config.samePathPenalty ?? 0.15;
+    const ordered = [...results].sort((a, b) => b.score - a.score);
+    const selected = [];
+    const output = [];
+    for (const candidate of ordered) {
+        const tokens = tokenize(candidate.content || "");
+        const filePath = extractFilePath(candidate);
+        let adjusted = candidate.score;
+        for (const prior of selected) {
+            const sim = jaccard(tokens, prior.tokens);
+            if (sim > config.threshold) {
+                adjusted *= 1 - config.lambda * sim;
+            }
+            if (samePathPenalty > 0 &&
+                filePath &&
+                prior.filePath &&
+                filePath === prior.filePath) {
+                adjusted *= 1 - samePathPenalty;
+            }
+        }
+        selected.push({ result: { ...candidate, score: adjusted }, tokens, filePath });
+        output.push({ ...candidate, score: adjusted });
+    }
+    return output.sort((a, b) => b.score - a.score);
+}
+//# sourceMappingURL=diversity-penalty.js.map

package/dist/services/synapse/inhibition/diversity-penalty.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diversity-penalty.js","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/diversity-penalty.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAYH,MAAM,QAAQ,GAAG,gBAAgB,CAAC;AAElC,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,OAAO,CAAC,CAAc,EAAE,CAAc;IAC7C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,YAAY,EAAE,CAAC;IACxC,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;IAC7C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAED,SAAS,eAAe,CAAC,MAAoB;IAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,QAA+C,CAAC;IACpE,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC;IAC5C,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAChE,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,OAAuB,EACvB,MAA8B;IAE9B,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,OAAO,CAAC;IAE1D,MAAM,eAAe,GAAG,MAAM,CAAC,eAAe,IAAI,IAAI,CAAC;IAEvD,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAIR,EAAE,CAAC;IACT,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,KAAK,MAAM,SAAS,IAAI,OAAO,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC;QAE/B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,GAAG,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;gBAC3B,QAAQ,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC;YACtC,CAAC;YACD,IACE,eAAe,GAAG,CAAC;gBACnB,QAAQ;gBACR,KAAK,CAAC,QAAQ;gBACd,QAAQ,KAAK,KAAK,CAAC,QAAQ,EAC3B,CAAC;gBACD,QAAQ,IAAI,CAAC,GAAG,eAAe,CAAC;YAClC,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC"}

package/dist/services/synapse/inhibition/index.d.ts

@@ -0,0 +1,5 @@
+export { applyDiversityPenalty, type DiversityPenaltyConfig, } from "./diversity-penalty.js";
+export { applyConfidenceGate, prefilterByRawScore, classifyQuery, type ConfidenceGateConfig, } from "./confidence-gate.js";
+export { applyTemporalInhibition, hasTemporalIndicator, type TemporalInhibitionConfig, } from "./temporal-inhibition.js";
+export { applyChainInhibition, detectIntent, DEFAULT_CHAIN_BOOSTS, type ChainInhibitionConfig, } from "./chain-inhibition.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/services/synapse/inhibition/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,qBAAqB,EACrB,KAAK,sBAAsB,GAC5B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,aAAa,EACb,KAAK,oBAAoB,GAC1B,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,uBAAuB,EACvB,oBAAoB,EACpB,KAAK,wBAAwB,GAC9B,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,oBAAoB,EACpB,YAAY,EACZ,oBAAoB,EACpB,KAAK,qBAAqB,GAC3B,MAAM,uBAAuB,CAAC"}

package/dist/services/synapse/inhibition/index.js

@@ -0,0 +1,5 @@
+export { applyDiversityPenalty, } from "./diversity-penalty.js";
+export { applyConfidenceGate, prefilterByRawScore, classifyQuery, } from "./confidence-gate.js";
+export { applyTemporalInhibition, hasTemporalIndicator, } from "./temporal-inhibition.js";
+export { applyChainInhibition, detectIntent, DEFAULT_CHAIN_BOOSTS, } from "./chain-inhibition.js";
+//# sourceMappingURL=index.js.map

package/dist/services/synapse/inhibition/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,qBAAqB,GAEtB,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,aAAa,GAEd,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,uBAAuB,EACvB,oBAAoB,GAErB,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,oBAAoB,EACpB,YAAY,EACZ,oBAAoB,GAErB,MAAM,uBAAuB,CAAC"}

package/dist/services/synapse/inhibition/temporal-inhibition.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Temporal Inhibition — anti-recency bias.
+ *
+ * Memories just created get an inflated importance simply because they are
+ * fresh. When the query carries no temporal intent, freshness is noise:
+ * the user did not ask for what is new. Penalize young memories so the
+ * historical signal can compete.
+ */
+import type { SearchResult } from "@massa-ai/shared";
+export interface TemporalInhibitionConfig {
+    enabled: boolean;
+    penaltyAgeMs: number;
+    penalty: number;
+}
+export declare function hasTemporalIndicator(query: string): boolean;
+/**
+ * Apply absolute score penalty to results younger than `penaltyAgeMs` when
+ * the query has no temporal intent. Returns a new sorted array.
+ */
+export declare function applyTemporalInhibition(results: SearchResult[], query: string, config: TemporalInhibitionConfig, now?: number): SearchResult[];
+//# sourceMappingURL=temporal-inhibition.d.ts.map

package/dist/services/synapse/inhibition/temporal-inhibition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-inhibition.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/temporal-inhibition.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAErD,MAAM,WAAW,wBAAwB;IACvC,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;CACjB;AA0BD,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAG3D;AAcD;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,YAAY,EAAE,EACvB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,wBAAwB,EAChC,GAAG,GAAE,MAAmB,GACvB,YAAY,EAAE,CAehB"}

package/dist/services/synapse/inhibition/temporal-inhibition.js

@@ -0,0 +1,70 @@
+/**
+ * Temporal Inhibition — anti-recency bias.
+ *
+ * Memories just created get an inflated importance simply because they are
+ * fresh. When the query carries no temporal intent, freshness is noise:
+ * the user did not ask for what is new. Penalize young memories so the
+ * historical signal can compete.
+ */
+const TEMPORAL_INDICATORS = [
+    "recent",
+    "recente",
+    "latest",
+    "último",
+    "ultima",
+    "today",
+    "hoje",
+    "yesterday",
+    "ontem",
+    "now",
+    "agora",
+    "current",
+    "atual",
+    "just",
+    "new",
+    "novo",
+    "this week",
+    "this hour",
+    "minute ago",
+    "horas atrás",
+    "this morning",
+];
+export function hasTemporalIndicator(query) {
+    const lowered = query.toLowerCase();
+    return TEMPORAL_INDICATORS.some((indicator) => lowered.includes(indicator));
+}
+function extractCreatedAt(result) {
+    const meta = result.metadata;
+    const raw = meta?.createdAt;
+    if (raw == null)
+        return null;
+    if (typeof raw === "number")
+        return raw;
+    if (typeof raw === "string" || raw instanceof Date) {
+        const parsed = new Date(raw).getTime();
+        return Number.isFinite(parsed) ? parsed : null;
+    }
+    return null;
+}
+/**
+ * Apply absolute score penalty to results younger than `penaltyAgeMs` when
+ * the query has no temporal intent. Returns a new sorted array.
+ */
+export function applyTemporalInhibition(results, query, config, now = Date.now()) {
+    if (!config.enabled || results.length === 0)
+        return results;
+    if (hasTemporalIndicator(query))
+        return results;
+    const adjusted = results.map((r) => {
+        const createdAt = extractCreatedAt(r);
+        if (createdAt == null)
+            return r;
+        const age = now - createdAt;
+        if (age >= 0 && age < config.penaltyAgeMs) {
+            return { ...r, score: Math.max(0, r.score - config.penalty) };
+        }
+        return r;
+    });
+    return adjusted.sort((a, b) => b.score - a.score);
+}
+//# sourceMappingURL=temporal-inhibition.js.map

package/dist/services/synapse/inhibition/temporal-inhibition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"temporal-inhibition.js","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/temporal-inhibition.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAUH,MAAM,mBAAmB,GAAG;IAC1B,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,MAAM;IACN,WAAW;IACX,OAAO;IACP,KAAK;IACL,OAAO;IACP,SAAS;IACT,OAAO;IACP,MAAM;IACN,KAAK;IACL,MAAM;IACN,WAAW;IACX,WAAW;IACX,YAAY;IACZ,aAAa;IACb,cAAc;CACf,CAAC;AAEF,MAAM,UAAU,oBAAoB,CAAC,KAAa;IAChD,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACpC,OAAO,mBAAmB,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAoB;IAC5C,MAAM,IAAI,GAAG,MAAM,CAAC,QAA+C,CAAC;IACpE,MAAM,GAAG,GAAG,IAAI,EAAE,SAAS,CAAC;IAC5B,IAAI,GAAG,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC;IAC7B,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,GAAG,CAAC;IACxC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,YAAY,IAAI,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;QACvC,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,OAAuB,EACvB,KAAa,EACb,MAAgC,EAChC,MAAc,IAAI,CAAC,GAAG,EAAE;IAExB,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAC5D,IAAI,oBAAoB,CAAC,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAEhD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACjC,MAAM,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,SAAS,IAAI,IAAI;YAAE,OAAO,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;QAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;YAC1C,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACpD,CAAC"}

package/dist/services/synapse/inhibition/type-inference.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Type inference from filePath — heuristics that let chain-inhibition
+ * operate on code-search results which carry no `metadata.type`.
+ *
+ * Rules (most specific first):
+ *   - tests / __tests__ / *.test.ts / *.spec.ts → "code-test"
+ *   - docs/ / *.md / *.mdx / README              → "documentation"
+ *   - changelogs / CHANGELOG / migrations        → "code"  (treated as code)
+ *   - default for source extensions              → "code"
+ *
+ * Returns `null` when the path provides no useful signal.
+ */
+export declare function inferTypeFromPath(filePath: string | undefined | null): string | null;
+//# sourceMappingURL=type-inference.d.ts.map

package/dist/services/synapse/inhibition/type-inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-inference.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/type-inference.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAYH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAWpF"}

package/dist/services/synapse/inhibition/type-inference.js

@@ -0,0 +1,36 @@
+/**
+ * Type inference from filePath — heuristics that let chain-inhibition
+ * operate on code-search results which carry no `metadata.type`.
+ *
+ * Rules (most specific first):
+ *   - tests / __tests__ / *.test.ts / *.spec.ts → "code-test"
+ *   - docs/ / *.md / *.mdx / README              → "documentation"
+ *   - changelogs / CHANGELOG / migrations        → "code"  (treated as code)
+ *   - default for source extensions              → "code"
+ *
+ * Returns `null` when the path provides no useful signal.
+ */
+const TEST_PATH_RE = /(?:^|\/)(?:__tests__|tests?|spec)\//i;
+const TEST_FILE_RE = /\.(?:test|spec)\.(?:ts|tsx|js|jsx|py|go|rs|java|dart)$/i;
+const DOC_PATH_RE = /(?:^|\/)(?:docs?|documentation)\//i;
+const DOC_FILE_RE = /\.(?:md|mdx|rst|txt)$/i;
+const README_RE = /(?:^|\/)README(?:\.|$)/i;
+const CHANGELOG_RE = /(?:^|\/)CHANGELOG(?:\.|$)/i;
+const MIGRATION_RE = /(?:^|\/)migrations\//i;
+const SOURCE_EXT_RE = /\.(?:ts|tsx|js|jsx|py|go|rs|java|cpp|c|h|hpp|cs|rb|kt|swift|dart|scala|php|lua|sh|sql)$/i;
+export function inferTypeFromPath(filePath) {
+    if (!filePath || filePath.length === 0)
+        return null;
+    if (TEST_PATH_RE.test(filePath) || TEST_FILE_RE.test(filePath))
+        return "code-test";
+    if (DOC_PATH_RE.test(filePath) || DOC_FILE_RE.test(filePath) || README_RE.test(filePath))
+        return "documentation";
+    if (CHANGELOG_RE.test(filePath))
+        return "documentation";
+    if (MIGRATION_RE.test(filePath))
+        return "code";
+    if (SOURCE_EXT_RE.test(filePath))
+        return "code";
+    return null;
+}
+//# sourceMappingURL=type-inference.js.map

package/dist/services/synapse/inhibition/type-inference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-inference.js","sourceRoot":"","sources":["../../../../src/services/synapse/inhibition/type-inference.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,MAAM,YAAY,GAAG,sCAAsC,CAAC;AAC5D,MAAM,YAAY,GAAG,yDAAyD,CAAC;AAC/E,MAAM,WAAW,GAAG,oCAAoC,CAAC;AACzD,MAAM,WAAW,GAAG,wBAAwB,CAAC;AAC7C,MAAM,SAAS,GAAG,yBAAyB,CAAC;AAC5C,MAAM,YAAY,GAAG,4BAA4B,CAAC;AAClD,MAAM,YAAY,GAAG,uBAAuB,CAAC;AAC7C,MAAM,aAAa,GACjB,0FAA0F,CAAC;AAE7F,MAAM,UAAU,iBAAiB,CAAC,QAAmC;IACnE,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpD,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC;QAAE,OAAO,WAAW,CAAC;IACnF,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC;QACtF,OAAO,eAAe,CAAC;IACzB,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC;QAAE,OAAO,eAAe,CAAC;IACxD,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC;QAAE,OAAO,MAAM,CAAC;IAC/C,IAAI,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC;QAAE,OAAO,MAAM,CAAC;IAEhD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/services/synapse/metacognition/index.d.ts

@@ -0,0 +1,2 @@
+export { analyzeSpectrum, type ScoreSpectrumConfig, } from "./score-spectrum.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/services/synapse/metacognition/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/metacognition/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,KAAK,mBAAmB,GACzB,MAAM,qBAAqB,CAAC"}

package/dist/services/synapse/metacognition/index.js

@@ -0,0 +1,2 @@
+export { analyzeSpectrum, } from "./score-spectrum.js";
+//# sourceMappingURL=index.js.map

package/dist/services/synapse/metacognition/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/services/synapse/metacognition/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,GAEhB,MAAM,qBAAqB,CAAC"}

package/dist/services/synapse/metacognition/score-spectrum.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Score Spectrum — metacognition over a result set.
+ *
+ * Computes spread/mean/confidence and surfaces flags that let callers know
+ * when the retrieval itself is unsure. "I know that I don't know" is more
+ * useful than ten weak results pretending to be answers.
+ */
+import type { SpectrumFlags } from "../types.js";
+export interface ScoreSpectrumConfig {
+    enabled: boolean;
+    lowConfidenceThreshold: number;
+    definitiveTopScore: number;
+    definitiveGap: number;
+}
+/**
+ * Analyze the distribution of scores in a result set.
+ * Pure function — no side effects, no mutations.
+ *
+ * IMP-12: the three flags are made *mutually exclusive* and prioritized:
+ *   1. definitiveMatch — a clear winner exists (top high, second far below)
+ *   2. noStrongMatch   — nothing crosses the relevance threshold
+ *   3. lowConfidence   — results exist but the distribution is flat
+ *
+ * A single result with `top >= definitiveTopScore` is treated as definitive,
+ * not as low-confidence (spread=0 was previously firing lowConfidence even
+ * for a perfect single hit).
+ */
+export declare function analyzeSpectrum(scores: number[], thresholdForNoMatch: number, config: ScoreSpectrumConfig): SpectrumFlags;
+//# sourceMappingURL=score-spectrum.d.ts.map

package/dist/services/synapse/metacognition/score-spectrum.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"score-spectrum.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/metacognition/score-spectrum.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEjD,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,sBAAsB,EAAE,MAAM,CAAC;IAC/B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,aAAa,EAAE,MAAM,CAAC;CACvB;AAWD;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EAAE,EAChB,mBAAmB,EAAE,MAAM,EAC3B,MAAM,EAAE,mBAAmB,GAC1B,aAAa,CAqCf"}

package/dist/services/synapse/metacognition/score-spectrum.js

@@ -0,0 +1,70 @@
+/**
+ * Score Spectrum — metacognition over a result set.
+ *
+ * Computes spread/mean/confidence and surfaces flags that let callers know
+ * when the retrieval itself is unsure. "I know that I don't know" is more
+ * useful than ten weak results pretending to be answers.
+ */
+const EMPTY_FLAGS = {
+    lowConfidence: false,
+    noStrongMatch: false,
+    definitiveMatch: false,
+    spread: 0,
+    mean: 0,
+    confidence: 0,
+};
+/**
+ * Analyze the distribution of scores in a result set.
+ * Pure function — no side effects, no mutations.
+ *
+ * IMP-12: the three flags are made *mutually exclusive* and prioritized:
+ *   1. definitiveMatch — a clear winner exists (top high, second far below)
+ *   2. noStrongMatch   — nothing crosses the relevance threshold
+ *   3. lowConfidence   — results exist but the distribution is flat
+ *
+ * A single result with `top >= definitiveTopScore` is treated as definitive,
+ * not as low-confidence (spread=0 was previously firing lowConfidence even
+ * for a perfect single hit).
+ */
+export function analyzeSpectrum(scores, thresholdForNoMatch, config) {
+    if (!config.enabled || scores.length === 0) {
+        return { ...EMPTY_FLAGS };
+    }
+    let max = -Infinity;
+    let min = Infinity;
+    let sum = 0;
+    let top = -Infinity;
+    let second = -Infinity;
+    for (const s of scores) {
+        if (s > max)
+            max = s;
+        if (s < min)
+            min = s;
+        sum += s;
+        if (s >= top) {
+            second = top;
+            top = s;
+        }
+        else if (s > second) {
+            second = s;
+        }
+    }
+    if (second === -Infinity)
+        second = 0;
+    const mean = sum / scores.length;
+    const spread = max - min;
+    const confidence = spread * mean;
+    const definitiveMatch = top >= config.definitiveTopScore && top - second >= config.definitiveGap;
+    const noStrongMatch = !definitiveMatch && top < thresholdForNoMatch;
+    // lowConfidence only fires when neither of the above already classified.
+    const lowConfidence = !definitiveMatch && !noStrongMatch && confidence < config.lowConfidenceThreshold;
+    return {
+        lowConfidence,
+        noStrongMatch,
+        definitiveMatch,
+        spread,
+        mean,
+        confidence,
+    };
+}
+//# sourceMappingURL=score-spectrum.js.map

package/dist/services/synapse/metacognition/score-spectrum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"score-spectrum.js","sourceRoot":"","sources":["../../../../src/services/synapse/metacognition/score-spectrum.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAWH,MAAM,WAAW,GAAkB;IACjC,aAAa,EAAE,KAAK;IACpB,aAAa,EAAE,KAAK;IACpB,eAAe,EAAE,KAAK;IACtB,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,UAAU,EAAE,CAAC;CACd,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAgB,EAChB,mBAA2B,EAC3B,MAA2B;IAE3B,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,EAAE,GAAG,WAAW,EAAE,CAAC;IAC5B,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;IACpB,IAAI,GAAG,GAAG,QAAQ,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;IACpB,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;QACrB,GAAG,IAAI,CAAC,CAAC;QACT,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YAAC,MAAM,GAAG,GAAG,CAAC;YAAC,GAAG,GAAG,CAAC,CAAC;QAAC,CAAC;aACnC,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC;YAAC,MAAM,GAAG,CAAC,CAAC;QAAC,CAAC;IACtC,CAAC;IACD,IAAI,MAAM,KAAK,CAAC,QAAQ;QAAE,MAAM,GAAG,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;IACjC,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC;IACzB,MAAM,UAAU,GAAG,MAAM,GAAG,IAAI,CAAC;IAEjC,MAAM,eAAe,GACnB,GAAG,IAAI,MAAM,CAAC,kBAAkB,IAAI,GAAG,GAAG,MAAM,IAAI,MAAM,CAAC,aAAa,CAAC;IAC3E,MAAM,aAAa,GAAG,CAAC,eAAe,IAAI,GAAG,GAAG,mBAAmB,CAAC;IACpE,yEAAyE;IACzE,MAAM,aAAa,GACjB,CAAC,eAAe,IAAI,CAAC,aAAa,IAAI,UAAU,GAAG,MAAM,CAAC,sBAAsB,CAAC;IAEnF,OAAO;QACL,aAAa;QACb,aAAa;QACb,eAAe;QACf,MAAM;QACN,IAAI;QACJ,UAAU;KACX,CAAC;AACJ,CAAC"}