@vinaes/succ 1.3.19

package/dist/lib/public-api.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"public-api.js","sourceRoot":"","sources":["../../src/lib/public-api.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,mCAAmC;AACnC,OAAO,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AAExF,iBAAiB;AACjB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,EACpB,0BAA0B,GAC3B,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAErD,mBAAmB;AACnB,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,cAAc,EACd,iBAAiB,EACjB,aAAa,EACb,YAAY,EACZ,uBAAuB,EACvB,mBAAmB,EACnB,mBAAmB,EACnB,iBAAiB,EACjB,kBAAkB,EAClB,cAAc,EACd,qBAAqB,EACrB,0BAA0B,GAC3B,MAAM,oBAAoB,CAAC;AAE5B,0BAA0B;AAC1B,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,uBAAuB,EACvB,kBAAkB,EAClB,oBAAoB,EACpB,uBAAuB,GACxB,MAAM,oBAAoB,CAAC;AAE5B,0BAA0B;AAC1B,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,cAAc,EACd,kBAAkB,EAClB,qBAAqB,EACrB,6BAA6B,EAC7B,eAAe,EACf,uBAAuB,EACvB,aAAa,EACb,gBAAgB,EAChB,qBAAqB,EACrB,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAE5B,+BAA+B;AAC/B,OAAO,EACL,cAAc,EACd,oBAAoB,EACpB,8BAA8B,EAC9B,qBAAqB,EACrB,QAAQ,EACR,WAAW,EACX,WAAW,EACX,cAAc,EACd,gBAAgB,EAChB,aAAa,GACd,MAAM,oBAAoB,CAAC;AAG5B,qBAAqB;AACrB,OAAO,EACL,YAAY,EACZ,aAAa,EACb,gBAAgB,EAChB,iBAAiB,EACjB,gBAAgB,GACjB,MAAM,iBAAiB,CAAC;AAGzB,iBAAiB;AACjB,OAAO,EACL,SAAS,EACT,cAAc,EACd,UAAU,EACV,oBAAoB,EACpB,gBAAgB,EAChB,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,aAAa,CAAC;AAGrB,gCAAgC;AAChC,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,uBAAuB,EACvB,2BAA2B,EAC3B,mBAAmB,EACnB,uBAAuB,GACxB,MAAM,oBAAoB,CAAC;AAE5B,sBAAsB;AACtB,OAAO,EAAE,uBAAuB,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAEnF,qBAAqB;AACrB,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAC/F,OAAO,EAAE,oBAAoB,EAAE,MAAM,UAAU,CAAC;AAGhD,uBAAuB;AACvB,OAAO,EAAE,yBAAyB,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAEtF,oBAAoB;AACpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAElD,sBAAsB;AACtB,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAEpE,qCAAqC;AACrC,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AACvE,OAAO,EAAE,iBAAiB,EAAE,MAAM,gCAAgC,CAAC;AACnE,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAEtD,uBAAuB;AACvB,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhD,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC7E,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAEzC,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGrE,yBAAyB;AACzB,OAAO,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAEpE,yBAAyB;AACzB,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,WAAW,EACX,WAAW,EACX,aAAa,EACb,YAAY,EACZ,iBAAiB,EACjB,gBAAgB,EAChB,cAAc,GACf,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAWxE,mEAAmE;AACnE,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAGtD,8BAA8B;AAC9B,OAAO,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AAIjE,iBAAiB;AACjB,OAAO,EACL,SAAS,EACT,WAAW,EACX,YAAY,EACZ,eAAe,EACf,YAAY,EACZ,aAAa,EACb,eAAe,EACf,WAAW,GACZ,MAAM,aAAa,CAAC"}

package/dist/lib/quality.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Quality Scoring for Memories
+ *
+ * Modes:
+ * - local: ONNX-based zero-shot classification (no external API needed)
+ * - custom: Ollama, LM Studio, llama.cpp (local LLM API)
+ * - openrouter: OpenRouter API
+ */
+import { type SuccConfig } from './config.js';
+export interface QualityScore {
+    score: number;
+    confidence: number;
+    factors: {
+        specificity: number;
+        clarity: number;
+        relevance: number;
+        uniqueness: number;
+    };
+    mode: 'local' | 'api' | 'heuristic';
+}
+/**
+ * Heuristic-based quality scoring (no LLM needed)
+ * Fast and works offline, but less accurate than LLM-based scoring
+ */
+export declare function scoreWithHeuristics(content: string, existingSimilarity?: number): QualityScore;
+/**
+ * Estimate content specificity using embedding similarity to reference phrases.
+ * Returns 0-1 where higher = more specific/technical content.
+ * Language-agnostic — works for any language the embedding model supports.
+ */
+export declare function estimateSpecificityByEmbedding(content: string): Promise<number>;
+/**
+ * Clear cached specificity reference embeddings (for tests).
+ */
+export declare function clearSpecificityEmbeddingCache(): void;
+/**
+ * Cleanup classifier pipeline to free memory
+ */
+export declare function cleanupQualityScoring(): void;
+/**
+ * Score memory using local ONNX model (zero-shot classification)
+ * Uses Xenova/nli-deberta-v3-xsmall for efficient classification
+ *
+ * Hybrid approach: combines ONNX classification with heuristic checks
+ * - ONNX is good at detecting technical content with code references
+ * - Heuristics act as a "gate" - if content fails basic quality checks, cap the score
+ */
+export declare function scoreWithLocal(content: string, existingSimilarity?: number): Promise<QualityScore>;
+/**
+ * Score memory using any OpenAI-compatible API (Ollama, OpenRouter, LM Studio, etc.)
+ * Auto-adds OpenRouter-specific headers when api_url contains 'openrouter.ai'.
+ */
+export declare function scoreWithApi(content: string, apiUrl: string, model: string, apiKey?: string): Promise<QualityScore>;
+/**
+ * Main scoring function - uses configured mode from llm.quality.*
+ */
+export declare function scoreMemory(content: string, existingSimilarity?: number, configOverride?: Partial<SuccConfig>): Promise<QualityScore>;
+/**
+ * Check if memory passes quality threshold
+ */
+export declare function passesQualityThreshold(score: QualityScore, threshold?: number): boolean;
+/**
+ * Format quality score for display
+ */
+export declare function formatQualityScore(score: QualityScore): string;
+//# sourceMappingURL=quality.d.ts.map

package/dist/lib/quality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality.d.ts","sourceRoot":"","sources":["../../src/lib/quality.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAA+B,KAAK,UAAU,EAAE,MAAM,aAAa,CAAC;AAqB3E,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE;QACP,WAAW,EAAE,MAAM,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,MAAM,CAAC;QAClB,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC;IACF,IAAI,EAAE,OAAO,GAAG,KAAK,GAAG,WAAW,CAAC;CACrC;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GAAG,YAAY,CAqB9F;AA+JD;;;;GAIG;AACH,wBAAsB,8BAA8B,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CA2BrF;AAED;;GAEG;AACH,wBAAgB,8BAA8B,IAAI,IAAI,CAErD;AAkDD;;GAEG;AACH,wBAAgB,qBAAqB,IAAI,IAAI,CAO5C;AAED;;;;;;;GAOG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,MAAM,EACf,kBAAkB,CAAC,EAAE,MAAM,GAC1B,OAAO,CAAC,YAAY,CAAC,CA8EvB;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAChC,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,YAAY,CAAC,CAwCvB;AA0ED;;GAEG;AACH,wBAAsB,WAAW,CAC/B,OAAO,EAAE,MAAM,EACf,kBAAkB,CAAC,EAAE,MAAM,EAC3B,cAAc,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,GACnC,OAAO,CAAC,YAAY,CAAC,CA6BvB;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAIvF;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,CAM9D"}

package/dist/lib/quality.js

@@ -0,0 +1,486 @@
+/**
+ * Quality Scoring for Memories
+ *
+ * Modes:
+ * - local: ONNX-based zero-shot classification (no external API needed)
+ * - custom: Ollama, LM Studio, llama.cpp (local LLM API)
+ * - openrouter: OpenRouter API
+ */
+import { getConfig, getLLMTaskConfig } from './config.js';
+import { QUALITY_SCORER_SYSTEM } from '../prompts/index.js';
+import { logWarn } from './fault-logger.js';
+import { NetworkError, ValidationError } from './errors.js';
+// Lazy-loaded zero-shot classification pipeline for local scoring
+let classifierPipeline = null;
+const CLASSIFIER_MODEL = 'Xenova/nli-deberta-v3-xsmall';
+// Labels for zero-shot classification
+// Using single classification with optimized labels (31pp separation in benchmark)
+const QUALITY_LABELS = {
+    // Primary quality indicator - best performing labels from benchmark
+    quality: [
+        'specific technical detail with code or file references',
+        'vague statement without concrete details',
+    ],
+    // Secondary checks for additional signal
+    relevance: ['relevant to software development', 'not related to programming'],
+};
+/**
+ * Heuristic-based quality scoring (no LLM needed)
+ * Fast and works offline, but less accurate than LLM-based scoring
+ */
+export function scoreWithHeuristics(content, existingSimilarity) {
+    const factors = {
+        specificity: calculateSpecificity(content),
+        clarity: calculateClarity(content),
+        relevance: 0.5, // Can't determine without context, default to neutral
+        uniqueness: existingSimilarity !== undefined ? 1 - existingSimilarity : 0.5,
+    };
+    // Weighted average
+    const score = factors.specificity * 0.3 +
+        factors.clarity * 0.3 +
+        factors.relevance * 0.2 +
+        factors.uniqueness * 0.2;
+    return {
+        score,
+        confidence: 0.6, // Heuristics are less confident than LLM
+        factors,
+        mode: 'heuristic',
+    };
+}
+/**
+ * Calculate specificity score
+ * Higher for content with specific details, lower for vague statements
+ * Supports multiple languages: English, Russian, and code-agnostic patterns
+ */
+function calculateSpecificity(content) {
+    let score = 0.5; // Base score
+    // Content length checks (more nuanced)
+    const wordCount = content.trim().split(/\s+/).length;
+    const charCount = content.length;
+    // === POSITIVE SIGNALS (language-agnostic and multilingual) ===
+    // Code patterns (universal)
+    const hasNumbers = /\d+/.test(content);
+    const hasCodeReference = /`[^`]+`|```[\s\S]*?```/.test(content);
+    const hasFilePath = /\.(ts|js|tsx|jsx|py|go|rs|java|cpp|c|h|md|json|yaml|yml|sql|sh|bash|css|scss|html)\b/.test(content);
+    const hasLineReference = /:\d+/.test(content); // file:line references
+    const hasProperNouns = /[A-Z][a-z]+(?:[A-Z][a-z]+)+/.test(content); // CamelCase
+    const hasSnakeCase = /[a-z]+_[a-z]+/.test(content); // snake_case identifiers
+    // Technical terms - English
+    const hasEnglishTechnicalTerms = /\b(function|class|method|variable|parameter|return|error|bug|fix|feature|api|endpoint|database|table|column|component|module|service|handler|controller|config|deploy|server|client|request|response|query|mutation|schema|model|view|route|middleware|hook|callback|promise|async|await)\b/i.test(content);
+    // Technical terms - Russian
+    const hasRussianTechnicalTerms = /\b(функция|класс|метод|переменная|параметр|ошибка|баг|фикс|исправлен|фича|апи|эндпоинт|база данных|таблица|колонка|компонент|модуль|сервис|хендлер|контроллер|конфиг|деплой|сервер|клиент|запрос|ответ|схема|модель|роут|миддлвар|хук|коллбэк|промис)\b/i.test(content);
+    // Actionable verbs - English
+    const hasEnglishActionableVerbs = /\b(implement|create|add|remove|fix|update|refactor|migrate|configure|deploy|test|resolve|optimize|integrate|delete|modify|change|setup|install|build|run|execute|debug|trace|log|handle|process|validate|parse|serialize|fetch|send|receive|connect|disconnect)\b/i.test(content);
+    // Actionable verbs - Russian
+    const hasRussianActionableVerbs = /\b(реализовать|создать|добавить|удалить|исправить|обновить|рефакторить|мигрировать|настроить|задеплоить|тестировать|решить|оптимизировать|интегрировать|изменить|установить|собрать|запустить|выполнить|дебажить|отладить|логировать|обработать|валидировать|парсить|сериализовать|отправить|получить|подключить)\b/i.test(content);
+    // Preference/personal facts — short but high-value for recall
+    const isPreferenceFact = /\b(user|i|he|she|they|we)\s+(use[sd]?|like[sd]?|prefer[sd]?|has|have|had|want[sd]?|chose|always|never|switch)/i.test(content) ||
+        /\b(пользователь|юзер|я|он|она|мы)\s+(использу[еюёт]|предпочита[еюёт]|любит|хоч[еу]т|выбрал|всегда|никогда)/i.test(content);
+    if (hasNumbers)
+        score += 0.1;
+    if (hasCodeReference)
+        score += 0.2;
+    if (hasFilePath)
+        score += 0.15;
+    if (hasLineReference)
+        score += 0.1;
+    if (hasEnglishTechnicalTerms || hasRussianTechnicalTerms)
+        score += 0.1;
+    if (hasProperNouns || hasSnakeCase)
+        score += 0.05;
+    if (hasEnglishActionableVerbs || hasRussianActionableVerbs)
+        score += 0.1;
+    if (isPreferenceFact)
+        score += 0.2;
+    // === NEGATIVE SIGNALS (multilingual) ===
+    // Vague words - English
+    const isVagueEnglish = /\b(maybe|perhaps|somehow|something|stuff|things|whatever|somewhere|anyone|anything|some|kinda|sorta)\b/i.test(content);
+    // Vague words - Russian
+    const isVagueRussian = /\b(может быть|возможно|как-то|что-то|где-то|кто-то|как-нибудь|где-нибудь|что-нибудь|какой-то|некий|вроде|типа|наверное)\b/i.test(content);
+    // Length checks
+    const isTooShort = charCount < 30 || wordCount < 5;
+    const isVeryShort = charCount < 15 || wordCount < 3;
+    // Generic praise - English
+    const isGenericEnglish = /\b(good|bad|nice|cool|great|interesting|awesome|works|fine|ok|okay|perfect|excellent)\b/i.test(content) &&
+        !/\b(good practice|bad pattern|nice feature|works well because|works by|good for)\b/i.test(content);
+    // Generic praise - Russian (include adjective forms: хороший/хорошая/хорошее, плохой/плохая/плохое, etc.)
+    const isGenericRussian = /\b(хорош[иоеая]{1,2}|плох[оиеая]{1,2}|отлично|отличн[ыоеая]{1,2}|круто|крут[оыеая]{1,2}|класс|классн[оыеая]{1,2}|супер|норм|нормальн[оыеая]{1,2}|работает|ок|окей|идеальн[оыеая]{1,2}|прекрасн[оыеая]{1,2})\b/i.test(content) &&
+        !/\b(хорошая практика|плохой паттерн|работает потому что|работает за счёт)\b/i.test(content);
+    // Only generic praise patterns
+    const isOnlyGenericPraiseEnglish = /^(the )?(code|it|this|that)?\s*(is|are|was|were)?\s*(good|nice|great|fine|ok|cool|awesome|works|working)/i.test(content.trim());
+    const isOnlyGenericPraiseRussian = /^(код|это|оно|всё)?\s*(хорош[иоеая]{0,2}|отлично|работает|норм|класс|супер)/i.test(content.trim());
+    const lacksSubstance = wordCount < 8 && !hasCodeReference && !hasFilePath && !hasNumbers;
+    if (isVagueEnglish || isVagueRussian)
+        score -= 0.2;
+    // Reduce short-content penalties for preference facts (short but high-value)
+    if (isPreferenceFact) {
+        if (isVeryShort)
+            score -= 0.15;
+        else if (isTooShort)
+            score -= 0.05;
+    }
+    else {
+        if (isVeryShort)
+            score -= 0.35;
+        else if (isTooShort)
+            score -= 0.2;
+    }
+    if (isGenericEnglish || isGenericRussian)
+        score -= 0.15;
+    if (isOnlyGenericPraiseEnglish || isOnlyGenericPraiseRussian)
+        score -= 0.25;
+    if (lacksSubstance && !isPreferenceFact)
+        score -= 0.15;
+    return Math.max(0, Math.min(1, score));
+}
+// ============================================================================
+// Embedding-based specificity (language-agnostic fallback)
+// ============================================================================
+/**
+ * Reference phrases for embedding-based specificity estimation.
+ * High-specificity: technical, actionable, detailed.
+ * Low-specificity: vague, generic, meaningless.
+ */
+const HIGH_SPECIFICITY_REFS = [
+    'Implement JWT authentication middleware for the REST API endpoints',
+    'Fix SQL injection vulnerability in the user registration handler',
+    'Configure nginx reverse proxy with SSL termination on port 443',
+    'Refactor the database schema to support multi-tenant isolation',
+    'Add retry logic with exponential backoff for failed API requests',
+];
+const LOW_SPECIFICITY_REFS = [
+    'This is good',
+    'Something happened with the code',
+    'Maybe we should change stuff',
+    'It works fine I think',
+];
+const SPECIFICITY_HIGH_SET = 'specificity-high';
+const SPECIFICITY_LOW_SET = 'specificity-low';
+let _specificityRefsRegistered = false;
+/**
+ * Estimate content specificity using embedding similarity to reference phrases.
+ * Returns 0-1 where higher = more specific/technical content.
+ * Language-agnostic — works for any language the embedding model supports.
+ */
+export async function estimateSpecificityByEmbedding(content) {
+    try {
+        const { registerReferenceSet, avgSimilarityToReference } = await import('./reference-embeddings.js');
+        const { getEmbedding } = await import('./embeddings.js');
+        if (!_specificityRefsRegistered) {
+            registerReferenceSet(SPECIFICITY_HIGH_SET, HIGH_SPECIFICITY_REFS);
+            registerReferenceSet(SPECIFICITY_LOW_SET, LOW_SPECIFICITY_REFS);
+            _specificityRefsRegistered = true;
+        }
+        const contentEmb = await getEmbedding(content);
+        const [highSim, lowSim] = await Promise.all([
+            avgSimilarityToReference(contentEmb, SPECIFICITY_HIGH_SET),
+            avgSimilarityToReference(contentEmb, SPECIFICITY_LOW_SET),
+        ]);
+        // Clamp negatives (cosine range is -1..1), then normalize
+        const clampedHigh = Math.max(0, highSim);
+        const clampedLow = Math.max(0, lowSim);
+        const total = clampedHigh + clampedLow;
+        if (total === 0)
+            return 0.5;
+        return clampedHigh / total;
+    }
+    catch {
+        return 0.5; // neutral fallback
+    }
+}
+/**
+ * Clear cached specificity reference embeddings (for tests).
+ */
+export function clearSpecificityEmbeddingCache() {
+    _specificityRefsRegistered = false;
+}
+/**
+ * Calculate clarity score
+ * Higher for well-structured, readable content
+ */
+function calculateClarity(content) {
+    let score = 0.5;
+    // Positive signals
+    const sentences = content.split(/[.!?]+/).filter((s) => s.trim().length > 0);
+    const avgSentenceLength = content.length / Math.max(sentences.length, 1);
+    const hasGoodLength = avgSentenceLength >= 30 && avgSentenceLength <= 150;
+    const hasStructure = /^[-*•]|\n[-*•]|\n\d+\./.test(content); // Lists
+    const hasSeparators = /\n{2,}|:\s*\n/.test(content); // Paragraphs
+    const hasProperPunctuation = /[.!?]$/.test(content.trim());
+    if (hasGoodLength)
+        score += 0.15;
+    if (hasStructure)
+        score += 0.1;
+    if (hasSeparators)
+        score += 0.05;
+    if (hasProperPunctuation)
+        score += 0.1;
+    // Negative signals
+    const hasExcessiveCaps = (content.match(/[A-Z]{3,}/g) || []).length > 2;
+    const hasNoSpaces = content.length > 50 && !content.includes(' ');
+    const hasRepeatedChars = /(.)\1{4,}/.test(content);
+    if (hasExcessiveCaps)
+        score -= 0.1;
+    if (hasNoSpaces)
+        score -= 0.3;
+    if (hasRepeatedChars)
+        score -= 0.2;
+    return Math.max(0, Math.min(1, score));
+}
+/**
+ * Get the zero-shot classification pipeline (lazy loaded)
+ */
+async function getClassifierPipeline() {
+    if (!classifierPipeline) {
+        const { pipeline } = await import('@huggingface/transformers');
+        console.log(`Loading quality scoring model: ${CLASSIFIER_MODEL}...`);
+        classifierPipeline = await pipeline('zero-shot-classification', CLASSIFIER_MODEL, {
+            device: 'cpu',
+        });
+        console.log('Quality scoring model loaded.');
+    }
+    return classifierPipeline;
+}
+/**
+ * Cleanup classifier pipeline to free memory
+ */
+export function cleanupQualityScoring() {
+    if (classifierPipeline) {
+        classifierPipeline = null;
+        if (global.gc) {
+            global.gc();
+        }
+    }
+}
+/**
+ * Score memory using local ONNX model (zero-shot classification)
+ * Uses Xenova/nli-deberta-v3-xsmall for efficient classification
+ *
+ * Hybrid approach: combines ONNX classification with heuristic checks
+ * - ONNX is good at detecting technical content with code references
+ * - Heuristics act as a "gate" - if content fails basic quality checks, cap the score
+ */
+export async function scoreWithLocal(content, existingSimilarity) {
+    try {
+        // First, run quick heuristic checks
+        const heuristicResult = scoreWithHeuristics(content, existingSimilarity);
+        // If heuristic specificity is uncertain (< 0.5), try embedding-based estimation.
+        // This helps non-EN/RU content that heuristic regex can't score fairly.
+        if (heuristicResult.factors.specificity < 0.5) {
+            try {
+                const embSpec = await estimateSpecificityByEmbedding(content);
+                if (embSpec > heuristicResult.factors.specificity) {
+                    heuristicResult.factors.specificity = embSpec;
+                    // Recalculate overall score with updated specificity
+                    heuristicResult.score =
+                        heuristicResult.factors.specificity * 0.3 +
+                            heuristicResult.factors.clarity * 0.3 +
+                            heuristicResult.factors.relevance * 0.2 +
+                            heuristicResult.factors.uniqueness * 0.2;
+                }
+            }
+            catch {
+                // Non-fatal — continue with heuristic score
+            }
+        }
+        // If content is clearly low quality by heuristics, don't bother with ONNX
+        // This catches: too short, vague words, generic praise, etc.
+        if (heuristicResult.factors.specificity < 0.4) {
+            return { ...heuristicResult, mode: 'local' }; // Return heuristic score but mark as local
+        }
+        const classifier = await getClassifierPipeline();
+        // Run zero-shot classification for quality and relevance
+        const [qualityResult, relevanceResult] = await Promise.all([
+            classifier(content, QUALITY_LABELS.quality, { multi_label: false }),
+            classifier(content, QUALITY_LABELS.relevance, { multi_label: false }),
+        ]);
+        // Extract ONNX scores
+        const onnxQuality = qualityResult.scores[qualityResult.labels.indexOf(QUALITY_LABELS.quality[0])];
+        const onnxRelevance = relevanceResult.scores[relevanceResult.labels.indexOf(QUALITY_LABELS.relevance[0])];
+        // Uniqueness from similarity if provided
+        const uniqueness = existingSimilarity !== undefined ? 1 - existingSimilarity : 0.5;
+        // Combine ONNX with heuristics
+        // Use minimum of ONNX and heuristic specificity to catch edge cases
+        const specificity = Math.min(onnxQuality, heuristicResult.factors.specificity + 0.15);
+        const factors = {
+            specificity,
+            clarity: heuristicResult.factors.clarity,
+            relevance: onnxRelevance,
+            uniqueness,
+        };
+        // Weighted average for overall score
+        const score = factors.specificity * 0.35 + // Hybrid specificity
+            factors.clarity * 0.15 + // Heuristic clarity
+            factors.relevance * 0.25 + // ONNX relevance
+            factors.uniqueness * 0.25; // Similarity-based uniqueness
+        return {
+            score: clamp(score, 0, 1),
+            confidence: 0.85,
+            factors,
+            mode: 'local',
+        };
+    }
+    catch (error) {
+        // Fall back to heuristics if model fails
+        logWarn('quality', 'Local ONNX scoring failed, falling back to heuristics', {
+            error: String(error),
+        });
+        return scoreWithHeuristics(content, existingSimilarity);
+    }
+}
+/**
+ * Score memory using any OpenAI-compatible API (Ollama, OpenRouter, LM Studio, etc.)
+ * Auto-adds OpenRouter-specific headers when api_url contains 'openrouter.ai'.
+ */
+export async function scoreWithApi(content, apiUrl, model, apiKey) {
+    const prompt = buildScoringPrompt(content);
+    const headers = {
+        'Content-Type': 'application/json',
+    };
+    if (apiKey) {
+        headers['Authorization'] = `Bearer ${apiKey}`;
+    }
+    if (apiUrl.includes('openrouter.ai')) {
+        headers['HTTP-Referer'] = 'https://succ.ai';
+        headers['X-Title'] = 'succ';
+    }
+    try {
+        const response = await fetch(`${apiUrl}/chat/completions`, {
+            method: 'POST',
+            headers,
+            body: JSON.stringify({
+                model,
+                messages: [
+                    { role: 'system', content: QUALITY_SCORER_SYSTEM },
+                    { role: 'user', content: prompt },
+                ],
+                temperature: 0.1,
+                max_tokens: 200,
+            }),
+        });
+        if (!response.ok) {
+            throw new NetworkError(`API error: ${response.status}`, response.status);
+        }
+        const data = await response.json();
+        const result = parseScoreResponse(data.choices[0]?.message?.content || '');
+        return { ...result, mode: 'api' };
+    }
+    catch (error) {
+        logWarn('quality', 'API scoring failed, falling back to heuristics', { error: String(error) });
+        return scoreWithHeuristics(content);
+    }
+}
+/**
+ * Build the prompt for LLM-based scoring
+ */
+function buildScoringPrompt(content) {
+    return `Rate the quality of this development memory on a scale of 0 to 1.
+
+Memory content:
+"""
+${content}
+"""
+
+Evaluate these factors (each 0-1):
+- specificity: How specific and actionable is the content?
+- clarity: How clear and well-written is it?
+- relevance: How relevant is this to software development?
+- uniqueness: How unique/non-obvious is this insight?
+
+Respond with JSON only:
+{
+  "score": <overall 0-1>,
+  "confidence": <your confidence 0-1>,
+  "factors": {
+    "specificity": <0-1>,
+    "clarity": <0-1>,
+    "relevance": <0-1>,
+    "uniqueness": <0-1>
+  }
+}`;
+}
+/**
+ * Parse LLM response to QualityScore
+ */
+function parseScoreResponse(response) {
+    try {
+        // Extract JSON from response (may have markdown wrapping)
+        const jsonMatch = response.match(/\{[\s\S]*\}/);
+        if (!jsonMatch) {
+            throw new ValidationError('No JSON found in response');
+        }
+        const parsed = JSON.parse(jsonMatch[0]);
+        return {
+            score: clamp(parsed.score || 0.5, 0, 1),
+            confidence: clamp(parsed.confidence || 0.8, 0, 1),
+            factors: {
+                specificity: clamp(parsed.factors?.specificity || 0.5, 0, 1),
+                clarity: clamp(parsed.factors?.clarity || 0.5, 0, 1),
+                relevance: clamp(parsed.factors?.relevance || 0.5, 0, 1),
+                uniqueness: clamp(parsed.factors?.uniqueness || 0.5, 0, 1),
+            },
+        };
+    }
+    catch {
+        // Return default scores on parse error
+        return {
+            score: 0.5,
+            confidence: 0.3,
+            factors: {
+                specificity: 0.5,
+                clarity: 0.5,
+                relevance: 0.5,
+                uniqueness: 0.5,
+            },
+        };
+    }
+}
+function clamp(value, min, max) {
+    return Math.max(min, Math.min(max, value));
+}
+/**
+ * Main scoring function - uses configured mode from llm.quality.*
+ */
+export async function scoreMemory(content, existingSimilarity, configOverride) {
+    const config = { ...getConfig(), ...configOverride };
+    // If scoring disabled, return neutral score
+    if (config.quality_scoring_enabled === false) {
+        return {
+            score: 0.5,
+            confidence: 1,
+            factors: { specificity: 0.5, clarity: 0.5, relevance: 0.5, uniqueness: 0.5 },
+            mode: 'heuristic',
+        };
+    }
+    const taskCfg = getLLMTaskConfig('quality');
+    switch (taskCfg.mode) {
+        case 'local':
+            return scoreWithLocal(content);
+        case 'api':
+            if (!taskCfg.model) {
+                logWarn('quality', 'API scoring requires llm.quality.model');
+                return scoreWithHeuristics(content, existingSimilarity);
+            }
+            return scoreWithApi(content, taskCfg.api_url, taskCfg.model, taskCfg.api_key);
+        default:
+            return scoreWithHeuristics(content, existingSimilarity);
+    }
+}
+/**
+ * Check if memory passes quality threshold
+ */
+export function passesQualityThreshold(score, threshold) {
+    const config = getConfig();
+    const minScore = threshold ?? config.quality_scoring_threshold ?? 0;
+    return score.score >= minScore;
+}
+/**
+ * Format quality score for display
+ */
+export function formatQualityScore(score) {
+    const percent = Math.round(score.score * 100);
+    const stars = Math.round(score.score * 5);
+    const starStr = '★'.repeat(stars) + '☆'.repeat(5 - stars);
+    return `${starStr} ${percent}% (${score.mode})`;
+}
+//# sourceMappingURL=quality.js.map

package/dist/lib/quality.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"quality.js","sourceRoot":"","sources":["../../src/lib/quality.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAmB,MAAM,aAAa,CAAC;AAC3E,OAAO,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE5D,kEAAkE;AAClE,IAAI,kBAAkB,GAAQ,IAAI,CAAC;AACnC,MAAM,gBAAgB,GAAG,8BAA8B,CAAC;AAExD,sCAAsC;AACtC,mFAAmF;AACnF,MAAM,cAAc,GAAG;IACrB,oEAAoE;IACpE,OAAO,EAAE;QACP,wDAAwD;QACxD,0CAA0C;KAC3C;IACD,yCAAyC;IACzC,SAAS,EAAE,CAAC,kCAAkC,EAAE,4BAA4B,CAAC;CAC9E,CAAC;AAcF;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAe,EAAE,kBAA2B;IAC9E,MAAM,OAAO,GAAG;QACd,WAAW,EAAE,oBAAoB,CAAC,OAAO,CAAC;QAC1C,OAAO,EAAE,gBAAgB,CAAC,OAAO,CAAC;QAClC,SAAS,EAAE,GAAG,EAAE,sDAAsD;QACtE,UAAU,EAAE,kBAAkB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAAG;KAC5E,CAAC;IAEF,mBAAmB;IACnB,MAAM,KAAK,GACT,OAAO,CAAC,WAAW,GAAG,GAAG;QACzB,OAAO,CAAC,OAAO,GAAG,GAAG;QACrB,OAAO,CAAC,SAAS,GAAG,GAAG;QACvB,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC;IAE3B,OAAO;QACL,KAAK;QACL,UAAU,EAAE,GAAG,EAAE,yCAAyC;QAC1D,OAAO;QACP,IAAI,EAAE,WAAW;KAClB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,OAAe;IAC3C,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC,aAAa;IAE9B,uCAAuC;IACvC,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACrD,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC;IAEjC,gEAAgE;IAEhE,4BAA4B;IAC5B,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvC,MAAM,gBAAgB,GAAG,wBAAwB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChE,MAAM,WAAW,GACf,sFAAsF,CAAC,IAAI,CACzF,OAAO,CACR,CAAC;IACJ,MAAM,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,uBAAuB;IACtE,MAAM,cAAc,GAAG,6BAA6B,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY;IAChF,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,yBAAyB;IAE7E,4BAA4B;IAC5B,MAAM,wBAAwB,GAC5B,8RAA8R,CAAC,IAAI,CACjS,OAAO,CACR,CAAC;IAEJ,4BAA4B;IAC5B,MAAM,wBAAwB,GAC5B,0PAA0P,CAAC,IAAI,CAC7P,OAAO,CACR,CAAC;IAEJ,6BAA6B;IAC7B,MAAM,yBAAyB,GAC7B,oQAAoQ,CAAC,IAAI,CACvQ,OAAO,CACR,CAAC;IAEJ,6BAA6B;IAC7B,MAAM,yBAAyB,GAC7B,sTAAsT,CAAC,IAAI,CACzT,OAAO,CACR,CAAC;IAEJ,8DAA8D;IAC9D,MAAM,gBAAgB,GACpB,gHAAgH,CAAC,IAAI,CACnH,OAAO,CACR;QACD,6GAA6G,CAAC,IAAI,CAChH,OAAO,CACR,CAAC;IAEJ,IAAI,UAAU;QAAE,KAAK,IAAI,GAAG,CAAC;IAC7B,IAAI,gBAAgB;QAAE,KAAK,IAAI,GAAG,CAAC;IACnC,IAAI,WAAW;QAAE,KAAK,IAAI,IAAI,CAAC;IAC/B,IAAI,gBAAgB;QAAE,KAAK,IAAI,GAAG,CAAC;IACnC,IAAI,wBAAwB,IAAI,wBAAwB;QAAE,KAAK,IAAI,GAAG,CAAC;IACvE,IAAI,cAAc,IAAI,YAAY;QAAE,KAAK,IAAI,IAAI,CAAC;IAClD,IAAI,yBAAyB,IAAI,yBAAyB;QAAE,KAAK,IAAI,GAAG,CAAC;IACzE,IAAI,gBAAgB;QAAE,KAAK,IAAI,GAAG,CAAC;IAEnC,0CAA0C;IAE1C,wBAAwB;IACxB,MAAM,cAAc,GAClB,yGAAyG,CAAC,IAAI,CAC5G,OAAO,CACR,CAAC;IAEJ,wBAAwB;IACxB,MAAM,cAAc,GAClB,4HAA4H,CAAC,IAAI,CAC/H,OAAO,CACR,CAAC;IAEJ,gBAAgB;IAChB,MAAM,UAAU,GAAG,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,CAAC,CAAC;IAEpD,2BAA2B;IAC3B,MAAM,gBAAgB,GACpB,0FAA0F,CAAC,IAAI,CAC7F,OAAO,CACR;QACD,CAAC,oFAAoF,CAAC,IAAI,CACxF,OAAO,CACR,CAAC;IAEJ,0GAA0G;IAC1G,MAAM,gBAAgB,GACpB,gNAAgN,CAAC,IAAI,CACnN,OAAO,CACR;QACD,CAAC,6EAA6E,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAE/F,+BAA+B;IAC/B,MAAM,0BAA0B,GAC9B,2GAA2G,CAAC,IAAI,CAC9G,OAAO,CAAC,IAAI,EAAE,CACf,CAAC;IACJ,MAAM,0BAA0B,GAC9B,8EAA8E,CAAC,IAAI,CACjF,OAAO,CAAC,IAAI,EAAE,CACf,CAAC;IAEJ,MAAM,cAAc,GAAG,SAAS,GAAG,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,WAAW,IAAI,CAAC,UAAU,CAAC;IAEzF,IAAI,cAAc,IAAI,cAAc;QAAE,KAAK,IAAI,GAAG,CAAC;IACnD,6EAA6E;IAC7E,IAAI,gBAAgB,EAAE,CAAC;QACrB,IAAI,WAAW;YAAE,KAAK,IAAI,IAAI,CAAC;aAC1B,IAAI,UAAU;YAAE,KAAK,IAAI,IAAI,CAAC;IACrC,CAAC;SAAM,CAAC;QACN,IAAI,WAAW;YAAE,KAAK,IAAI,IAAI,CAAC;aAC1B,IAAI,UAAU;YAAE,KAAK,IAAI,GAAG,CAAC;IACpC,CAAC;IACD,IAAI,gBAAgB,IAAI,gBAAgB;QAAE,KAAK,IAAI,IAAI,CAAC;IACxD,IAAI,0BAA0B,IAAI,0BAA0B;QAAE,KAAK,IAAI,IAAI,CAAC;IAC5E,IAAI,cAAc,IAAI,CAAC,gBAAgB;QAAE,KAAK,IAAI,IAAI,CAAC;IAEvD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,+EAA+E;AAC/E,2DAA2D;AAC3D,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,qBAAqB,GAAG;IAC5B,oEAAoE;IACpE,kEAAkE;IAClE,gEAAgE;IAChE,gEAAgE;IAChE,kEAAkE;CACnE,CAAC;AAEF,MAAM,oBAAoB,GAAG;IAC3B,cAAc;IACd,kCAAkC;IAClC,8BAA8B;IAC9B,uBAAuB;CACxB,CAAC;AAEF,MAAM,oBAAoB,GAAG,kBAAkB,CAAC;AAChD,MAAM,mBAAmB,GAAG,iBAAiB,CAAC;AAC9C,IAAI,0BAA0B,GAAG,KAAK,CAAC;AAEvC;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,8BAA8B,CAAC,OAAe;IAClE,IAAI,CAAC;QACH,MAAM,EAAE,oBAAoB,EAAE,wBAAwB,EAAE,GACtD,MAAM,MAAM,CAAC,2BAA2B,CAAC,CAAC;QAC5C,MAAM,EAAE,YAAY,EAAE,GAAG,MAAM,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAEzD,IAAI,CAAC,0BAA0B,EAAE,CAAC;YAChC,oBAAoB,CAAC,oBAAoB,EAAE,qBAAqB,CAAC,CAAC;YAClE,oBAAoB,CAAC,mBAAmB,EAAE,oBAAoB,CAAC,CAAC;YAChE,0BAA0B,GAAG,IAAI,CAAC;QACpC,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC1C,wBAAwB,CAAC,UAAU,EAAE,oBAAoB,CAAC;YAC1D,wBAAwB,CAAC,UAAU,EAAE,mBAAmB,CAAC;SAC1D,CAAC,CAAC;QAEH,0DAA0D;QAC1D,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,WAAW,GAAG,UAAU,CAAC;QACvC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC5B,OAAO,WAAW,GAAG,KAAK,CAAC;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,GAAG,CAAC,CAAC,mBAAmB;IACjC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,8BAA8B;IAC5C,0BAA0B,GAAG,KAAK,CAAC;AACrC,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,OAAe;IACvC,IAAI,KAAK,GAAG,GAAG,CAAC;IAEhB,mBAAmB;IACnB,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7E,MAAM,iBAAiB,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACzE,MAAM,aAAa,GAAG,iBAAiB,IAAI,EAAE,IAAI,iBAAiB,IAAI,GAAG,CAAC;IAE1E,MAAM,YAAY,GAAG,wBAAwB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ;IACrE,MAAM,aAAa,GAAG,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa;IAClE,MAAM,oBAAoB,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IAE3D,IAAI,aAAa;QAAE,KAAK,IAAI,IAAI,CAAC;IACjC,IAAI,YAAY;QAAE,KAAK,IAAI,GAAG,CAAC;IAC/B,IAAI,aAAa;QAAE,KAAK,IAAI,IAAI,CAAC;IACjC,IAAI,oBAAoB;QAAE,KAAK,IAAI,GAAG,CAAC;IAEvC,mBAAmB;IACnB,MAAM,gBAAgB,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACxE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAClE,MAAM,gBAAgB,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAEnD,IAAI,gBAAgB;QAAE,KAAK,IAAI,GAAG,CAAC;IACnC,IAAI,WAAW;QAAE,KAAK,IAAI,GAAG,CAAC;IAC9B,IAAI,gBAAgB;QAAE,KAAK,IAAI,GAAG,CAAC;IAEnC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,qBAAqB;IAClC,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACxB,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,MAAM,CAAC,2BAA2B,CAAC,CAAC;QAC/D,OAAO,CAAC,GAAG,CAAC,kCAAkC,gBAAgB,KAAK,CAAC,CAAC;QACrE,kBAAkB,GAAG,MAAM,QAAQ,CAAC,0BAA0B,EAAE,gBAAgB,EAAE;YAChF,MAAM,EAAE,KAAK;SACd,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,+BAA+B,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,kBAAkB,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB;IACnC,IAAI,kBAAkB,EAAE,CAAC;QACvB,kBAAkB,GAAG,IAAI,CAAC;QAC1B,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;YACd,MAAM,CAAC,EAAE,EAAE,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAe,EACf,kBAA2B;IAE3B,IAAI,CAAC;QACH,oCAAoC;QACpC,MAAM,eAAe,GAAG,mBAAmB,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;QAEzE,iFAAiF;QACjF,wEAAwE;QACxE,IAAI,eAAe,CAAC,OAAO,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;YAC9C,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,8BAA8B,CAAC,OAAO,CAAC,CAAC;gBAC9D,IAAI,OAAO,GAAG,eAAe,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;oBAClD,eAAe,CAAC,OAAO,CAAC,WAAW,GAAG,OAAO,CAAC;oBAC9C,qDAAqD;oBACrD,eAAe,CAAC,KAAK;wBACnB,eAAe,CAAC,OAAO,CAAC,WAAW,GAAG,GAAG;4BACzC,eAAe,CAAC,OAAO,CAAC,OAAO,GAAG,GAAG;4BACrC,eAAe,CAAC,OAAO,CAAC,SAAS,GAAG,GAAG;4BACvC,eAAe,CAAC,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC;gBAC7C,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,4CAA4C;YAC9C,CAAC;QACH,CAAC;QAED,0EAA0E;QAC1E,6DAA6D;QAC7D,IAAI,eAAe,CAAC,OAAO,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;YAC9C,OAAO,EAAE,GAAG,eAAe,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,2CAA2C;QAC3F,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,qBAAqB,EAAE,CAAC;QAEjD,yDAAyD;QACzD,MAAM,CAAC,aAAa,EAAE,eAAe,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACzD,UAAU,CAAC,OAAO,EAAE,cAAc,CAAC,OAAO,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;YACnE,UAAU,CAAC,OAAO,EAAE,cAAc,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;SACtE,CAAC,CAAC;QAEH,sBAAsB;QACtB,MAAM,WAAW,GACf,aAAa,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF,MAAM,aAAa,GACjB,eAAe,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtF,yCAAyC;QACzC,MAAM,UAAU,GAAG,kBAAkB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAAG,CAAC;QAEnF,+BAA+B;QAC/B,oEAAoE;QACpE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,eAAe,CAAC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;QAEtF,MAAM,OAAO,GAAG;YACd,WAAW;YACX,OAAO,EAAE,eAAe,CAAC,OAAO,CAAC,OAAO;YACxC,SAAS,EAAE,aAAa;YACxB,UAAU;SACX,CAAC;QAEF,qCAAqC;QACrC,MAAM,KAAK,GACT,OAAO,CAAC,WAAW,GAAG,IAAI,GAAG,qBAAqB;YAClD,OAAO,CAAC,OAAO,GAAG,IAAI,GAAG,oBAAoB;YAC7C,OAAO,CAAC,SAAS,GAAG,IAAI,GAAG,iBAAiB;YAC5C,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,8BAA8B;QAE3D,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACzB,UAAU,EAAE,IAAI;YAChB,OAAO;YACP,IAAI,EAAE,OAAO;SACd,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,yCAAyC;QACzC,OAAO,CAAC,SAAS,EAAE,uDAAuD,EAAE;YAC1E,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC;SACrB,CAAC,CAAC;QACH,OAAO,mBAAmB,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,OAAe,EACf,MAAc,EACd,KAAa,EACb,MAAe;IAEf,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAE3C,MAAM,OAAO,GAA2B;QACtC,cAAc,EAAE,kBAAkB;KACnC,CAAC;IACF,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,CAAC,eAAe,CAAC,GAAG,UAAU,MAAM,EAAE,CAAC;IAChD,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,EAAE,CAAC;QACrC,OAAO,CAAC,cAAc,CAAC,GAAG,iBAAiB,CAAC;QAC5C,OAAO,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC;IAC9B,CAAC;IAED,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,MAAM,mBAAmB,EAAE;YACzD,MAAM,EAAE,MAAM;YACd,OAAO;YACP,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK;gBACL,QAAQ,EAAE;oBACR,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,qBAAqB,EAAE;oBAClD,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE;iBAClC;gBACD,WAAW,EAAE,GAAG;gBAChB,UAAU,EAAE,GAAG;aAChB,CAAC;SACH,CAAC,CAAC;QAEH,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;YACjB,MAAM,IAAI,YAAY,CAAC,cAAc,QAAQ,CAAC,MAAM,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;QAC3E,OAAO,EAAE,GAAG,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACpC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,SAAS,EAAE,gDAAgD,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/F,OAAO,mBAAmB,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,OAAe;IACzC,OAAO;;;;EAIP,OAAO;;;;;;;;;;;;;;;;;;;EAmBP,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,QAAgB;IAC1C,IAAI,CAAC;QACH,0DAA0D;QAC1D,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAChD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,eAAe,CAAC,2BAA2B,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAExC,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACvC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,UAAU,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACjD,OAAO,EAAE;gBACP,WAAW,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,WAAW,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC5D,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACpD,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACxD,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,UAAU,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;aAC3D;SACF,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,uCAAuC;QACvC,OAAO;YACL,KAAK,EAAE,GAAG;YACV,UAAU,EAAE,GAAG;YACf,OAAO,EAAE;gBACP,WAAW,EAAE,GAAG;gBAChB,OAAO,EAAE,GAAG;gBACZ,SAAS,EAAE,GAAG;gBACd,UAAU,EAAE,GAAG;aAChB;SACF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,KAAK,CAAC,KAAa,EAAE,GAAW,EAAE,GAAW;IACpD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,OAAe,EACf,kBAA2B,EAC3B,cAAoC;IAEpC,MAAM,MAAM,GAAG,EAAE,GAAG,SAAS,EAAE,EAAE,GAAG,cAAc,EAAE,CAAC;IAErD,4CAA4C;IAC5C,IAAI,MAAM,CAAC,uBAAuB,KAAK,KAAK,EAAE,CAAC;QAC7C,OAAO;YACL,KAAK,EAAE,GAAG;YACV,UAAU,EAAE,CAAC;YACb,OAAO,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE;YAC5E,IAAI,EAAE,WAAW;SAClB,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAE5C,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACrB,KAAK,OAAO;YACV,OAAO,cAAc,CAAC,OAAO,CAAC,CAAC;QAEjC,KAAK,KAAK;YACR,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;gBACnB,OAAO,CAAC,SAAS,EAAE,wCAAwC,CAAC,CAAC;gBAC7D,OAAO,mBAAmB,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;YAC1D,CAAC;YACD,OAAO,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;QAEhF;YACE,OAAO,mBAAmB,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAmB,EAAE,SAAkB;IAC5E,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,SAAS,IAAI,MAAM,CAAC,yBAAyB,IAAI,CAAC,CAAC;IACpE,OAAO,KAAK,CAAC,KAAK,IAAI,QAAQ,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAmB;IACpD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAE1D,OAAO,GAAG,OAAO,IAAI,OAAO,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC;AAClD,CAAC"}

package/dist/lib/query-expansion.d.ts

@@ -0,0 +1,16 @@
+/**
+ * LLM-based query expansion for richer recall.
+ *
+ * Takes a user query and generates additional search terms
+ * to improve retrieval coverage. Disabled by default.
+ */
+import type { LLMBackend } from './llm.js';
+/**
+ * Expand a query into multiple search terms using LLM.
+ *
+ * @param query - The original user query
+ * @param mode - LLM backend override (defaults to configured backend)
+ * @returns Array of expanded queries (NOT including the original)
+ */
+export declare function expandQuery(query: string, mode?: LLMBackend): Promise<string[]>;
+//# sourceMappingURL=query-expansion.d.ts.map

package/dist/lib/query-expansion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-expansion.d.ts","sourceRoot":"","sources":["../../src/lib/query-expansion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AAe3C;;;;;;GAMG;AACH,wBAAsB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAgCrF"}

package/dist/lib/query-expansion.js

@@ -0,0 +1,53 @@
+/**
+ * LLM-based query expansion for richer recall.
+ *
+ * Takes a user query and generates additional search terms
+ * to improve retrieval coverage. Disabled by default.
+ */
+import { callLLM, getLLMConfig } from './llm.js';
+const EXPANSION_PROMPT = `You are a search query expander. Given a user's search query about code, software development, or technical decisions, generate 3-5 alternative search queries that would help find relevant information.
+
+Rules:
+- Each query should capture a different aspect or phrasing of the original intent
+- Include synonyms, related concepts, and alternative terminology
+- Keep queries concise (3-8 words each)
+- Return ONLY the queries, one per line, no numbering or bullets
+- Do not repeat the original query
+
+User query: "{query}"
+
+Alternative queries:`;
+/**
+ * Expand a query into multiple search terms using LLM.
+ *
+ * @param query - The original user query
+ * @param mode - LLM backend override (defaults to configured backend)
+ * @returns Array of expanded queries (NOT including the original)
+ */
+export async function expandQuery(query, mode) {
+    const prompt = EXPANSION_PROMPT.replace('{query}', query);
+    const llmConfig = getLLMConfig();
+    const backend = mode ?? llmConfig.backend;
+    try {
+        const configOverride = backend !== llmConfig.backend ? { backend } : undefined;
+        const response = await callLLM(prompt, {
+            maxTokens: 200,
+            temperature: 0.7,
+        }, configOverride);
+        if (!response || response.trim().length === 0)
+            return [];
+        // Parse response: one query per line, filter empty/invalid
+        const expanded = response
+            .split('\n')
+            .map((line) => line.replace(/^[\d\-*.)]+\s*/, '').trim()) // strip numbering
+            .filter((line) => line.length >= 3 && line.length <= 200)
+            .filter((line) => !/^(alternative|here are|queries?:)/i.test(line))
+            .slice(0, 5);
+        return expanded;
+    }
+    catch {
+        // LLM failure should never break search — silently fall back to no expansion
+        return [];
+    }
+}
+//# sourceMappingURL=query-expansion.js.map