@codeledger/engine 0.7.0

package/dist/iole/intent-signature.js

@@ -0,0 +1,112 @@
+/**
+ * IOLE — Intent Signature
+ *
+ * Derives a stable, deterministic hash from a task prompt and optional
+ * CLI parameters. Used to detect intent drift across iterations and
+ * to correlate outcomes with their originating intent.
+ *
+ * Deterministic: same task string → same signature.
+ */
+import { createHash } from 'crypto';
+// ─── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Derive a deterministic IntentSignature from a task description.
+ *
+ * The signature includes:
+ * - A stable hash (SHA-256 truncated to 16 hex chars)
+ * - Normalized task keywords (lowercased, de-duped, sorted)
+ * - Inferred task category (bug_fix, feature_add, refactor, test_update, config, unknown)
+ * - Timestamp of derivation
+ */
+export function deriveIntentSignature(task, params = {}) {
+    const normalized = normalizeTask(task);
+    const keywords = extractIntentKeywords(normalized);
+    const category = inferCategory(normalized, keywords);
+    // Hash: task + sorted params
+    const paramStr = Object.entries(params)
+        .sort(([a], [b]) => a.localeCompare(b))
+        .map(([k, v]) => `${k}=${v}`)
+        .join('&');
+    const hashInput = `${normalized}\n${paramStr}`;
+    const hash = createHash('sha256').update(hashInput).digest('hex').slice(0, 16);
+    return {
+        hash,
+        task_normalized: normalized,
+        keywords,
+        category,
+        derived_at: new Date().toISOString(),
+    };
+}
+/**
+ * Compare two intent signatures to detect drift.
+ *
+ * Returns a DriftLevel:
+ * - 'none'    → same hash (identical intent)
+ * - 'minor'   → same category, similar keywords (Jaccard ≥ 0.6)
+ * - 'major'   → same category, diverged keywords (Jaccard 0.3–0.6)
+ * - 'critical' → different category or Jaccard < 0.3
+ */
+export function compareIntentSignatures(a, b) {
+    if (a.hash === b.hash) {
+        return { level: 'none', jaccard: 1.0, category_changed: false };
+    }
+    const jaccard = jaccardSimilarity(new Set(a.keywords), new Set(b.keywords));
+    const categoryChanged = a.category !== b.category;
+    let level;
+    if (categoryChanged || jaccard < 0.3) {
+        level = 'critical';
+    }
+    else if (jaccard < 0.6) {
+        level = 'major';
+    }
+    else {
+        level = 'minor';
+    }
+    return { level, jaccard, category_changed: categoryChanged };
+}
+// ─── Helpers ──────────────────────────────────────────────────────────────────
+function normalizeTask(task) {
+    return task
+        .toLowerCase()
+        .replace(/[^a-z0-9\s_/-]/g, ' ')
+        .replace(/\s+/g, ' ')
+        .trim();
+}
+function extractIntentKeywords(normalized) {
+    const stopWords = new Set([
+        'a', 'an', 'the', 'in', 'on', 'at', 'to', 'for', 'of', 'and', 'or',
+        'but', 'with', 'from', 'by', 'is', 'are', 'be', 'was', 'were', 'do',
+        'does', 'did', 'will', 'would', 'could', 'should', 'have', 'has', 'had',
+        'this', 'that', 'it', 'its', 'not', 'no', 'so', 'as', 'if', 'then',
+        'into', 'than', 'also', 'all', 'any', 'each', 'when', 'where', 'how',
+    ]);
+    const words = normalized.split(/[\s_/-]+/);
+    const unique = new Set(words.filter((w) => w.length > 2 && !stopWords.has(w)));
+    return [...unique].sort();
+}
+function inferCategory(normalized, keywords) {
+    const all = normalized + ' ' + keywords.join(' ');
+    if (/\b(fix|bug|error|crash|broken|fail|issue|regression)\b/.test(all))
+        return 'bug_fix';
+    if (/\b(add|create|implement|new|build|introduce|feature)\b/.test(all))
+        return 'feature_add';
+    if (/\b(refactor|extract|cleanup|rename|reorganize|simplify|move)\b/.test(all))
+        return 'refactor';
+    if (/\b(test|spec|coverage|assertion|mock|stub|vitest|jest)\b/.test(all))
+        return 'test_update';
+    if (/\b(config|env|setting|deploy|ci|yaml|yml|json|toml)\b/.test(all))
+        return 'config';
+    return 'unknown';
+}
+function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 1.0;
+    let intersection = 0;
+    for (const item of a) {
+        if (b.has(item))
+            intersection++;
+    }
+    const union = a.size + b.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+//# sourceMappingURL=intent-signature.js.map

package/dist/iole/intent-signature.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent-signature.js","sourceRoot":"","sources":["../../src/iole/intent-signature.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAGpC,iFAAiF;AAEjF;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,IAAY,EACZ,SAAiC,EAAE;IAEnC,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAErD,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;SACpC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;SACtC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;SAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACb,MAAM,SAAS,GAAG,GAAG,UAAU,KAAK,QAAQ,EAAE,CAAC;IAC/C,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAE/E,OAAO;QACL,IAAI;QACJ,eAAe,EAAE,UAAU;QAC3B,QAAQ;QACR,QAAQ;QACR,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACrC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,uBAAuB,CACrC,CAAkB,EAClB,CAAkB;IAElB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC;IAClE,CAAC;IAED,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC5E,MAAM,eAAe,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC;IAElD,IAAI,KAAuB,CAAC;IAC5B,IAAI,eAAe,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;QACrC,KAAK,GAAG,UAAU,CAAC;IACrB,CAAC;SAAM,IAAI,OAAO,GAAG,GAAG,EAAE,CAAC;QACzB,KAAK,GAAG,OAAO,CAAC;IAClB,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,OAAO,CAAC;IAClB,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,CAAC;AAC/D,CAAC;AAED,iFAAiF;AAEjF,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,qBAAqB,CAAC,UAAkB;IAC/C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;QACxB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;QAClE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI;QACnE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK;QACvE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM;QAClE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;KACrE,CAAC,CAAC;IAEH,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACvD,CAAC;IACF,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;AAC5B,CAAC;AAID,SAAS,aAAa,CAAC,UAAkB,EAAE,QAAkB;IAC3D,MAAM,GAAG,GAAG,UAAU,GAAG,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAElD,IAAI,wDAAwD,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IACzF,IAAI,wDAAwD,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,aAAa,CAAC;IAC7F,IAAI,gEAAgE,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC;IAClG,IAAI,0DAA0D,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,aAAa,CAAC;IAC/F,IAAI,uDAAuD,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IACvF,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,iBAAiB,CAAC,CAAc,EAAE,CAAc;IACvD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,YAAY,EAAE,CAAC;IAClC,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"}

package/dist/iole/outcome-score.d.ts

@@ -0,0 +1,25 @@
+/**
+ * IOLE — Outcome Score
+ *
+ * Tracks and computes outcome scores for agent iterations.
+ * Used to measure whether context expansion is producing improvement
+ * and to feed the success/fail prior back into the selector's scoring.
+ *
+ * Deterministic: arithmetic aggregation of recorded outcomes.
+ */
+import type { OutcomeScore, OutcomeRecord } from '@codeledger/types';
+/**
+ * Compute the aggregate OutcomeScore from a sequence of recorded outcomes.
+ *
+ * The score tracks:
+ * - Overall pass rate
+ * - Iteration efficiency (pass on first vs Nth try)
+ * - Stability signal (consistent results vs oscillating)
+ * - Improvement trend (is each failure producing less severe errors?)
+ */
+export declare function computeOutcomeScore(records: OutcomeRecord[]): OutcomeScore;
+/**
+ * Create a new OutcomeRecord for a completed iteration.
+ */
+export declare function recordIteration(taskId: string, iteration: number, passed: boolean, contextLevel: number, failureSeverity?: number): OutcomeRecord;
+//# sourceMappingURL=outcome-score.d.ts.map

package/dist/iole/outcome-score.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"outcome-score.d.ts","sourceRoot":"","sources":["../../src/iole/outcome-score.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAIrE;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,aAAa,EAAE,GAAG,YAAY,CAiD1E;AAED;;GAEG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,MAAM,EACpB,eAAe,CAAC,EAAE,MAAM,GACvB,aAAa,CASf"}

package/dist/iole/outcome-score.js

@@ -0,0 +1,128 @@
+/**
+ * IOLE — Outcome Score
+ *
+ * Tracks and computes outcome scores for agent iterations.
+ * Used to measure whether context expansion is producing improvement
+ * and to feed the success/fail prior back into the selector's scoring.
+ *
+ * Deterministic: arithmetic aggregation of recorded outcomes.
+ */
+// ─── Public API ───────────────────────────────────────────────────────────────
+/**
+ * Compute the aggregate OutcomeScore from a sequence of recorded outcomes.
+ *
+ * The score tracks:
+ * - Overall pass rate
+ * - Iteration efficiency (pass on first vs Nth try)
+ * - Stability signal (consistent results vs oscillating)
+ * - Improvement trend (is each failure producing less severe errors?)
+ */
+export function computeOutcomeScore(records) {
+    if (records.length === 0) {
+        return {
+            pass_rate: 0,
+            total_iterations: 0,
+            first_pass_rate: 0,
+            stability_signal: 'unknown',
+            improvement_trend: 'flat',
+            retry_distribution: {},
+            last_updated: new Date().toISOString(),
+        };
+    }
+    const total = records.length;
+    const passed = records.filter((r) => r.passed).length;
+    const passRate = passed / total;
+    // First-pass rate: among tasks, what fraction passed on iteration 1?
+    const byTask = groupByTask(records);
+    let firstPassCount = 0;
+    let taskCount = 0;
+    const retryDist = {};
+    for (const taskRecords of byTask.values()) {
+        taskCount++;
+        const sorted = taskRecords.sort((a, b) => a.iteration - b.iteration);
+        const firstPass = sorted.findIndex((r) => r.passed);
+        const retries = firstPass === -1 ? sorted.length : firstPass;
+        retryDist[retries] = (retryDist[retries] ?? 0) + 1;
+        if (firstPass === 0)
+            firstPassCount++;
+    }
+    const firstPassRate = taskCount > 0 ? firstPassCount / taskCount : 0;
+    // Stability signal: are results consistent across iterations?
+    const stability = computeStabilitySignal(records);
+    // Improvement trend: are failures becoming less severe over time?
+    const trend = computeImprovementTrend(records);
+    return {
+        pass_rate: passRate,
+        total_iterations: total,
+        first_pass_rate: firstPassRate,
+        stability_signal: stability,
+        improvement_trend: trend,
+        retry_distribution: retryDist,
+        last_updated: new Date().toISOString(),
+    };
+}
+/**
+ * Create a new OutcomeRecord for a completed iteration.
+ */
+export function recordIteration(taskId, iteration, passed, contextLevel, failureSeverity) {
+    return {
+        task_id: taskId,
+        iteration,
+        passed,
+        context_level: contextLevel,
+        failure_severity: failureSeverity ?? 0,
+        recorded_at: new Date().toISOString(),
+    };
+}
+// ─── Helpers ──────────────────────────────────────────────────────────────────
+function groupByTask(records) {
+    const byTask = new Map();
+    for (const r of records) {
+        const existing = byTask.get(r.task_id) ?? [];
+        existing.push(r);
+        byTask.set(r.task_id, existing);
+    }
+    return byTask;
+}
+function computeStabilitySignal(records) {
+    if (records.length < 3)
+        return 'unknown';
+    const results = records.map((r) => r.passed);
+    let transitions = 0;
+    for (let i = 1; i < results.length; i++) {
+        if (results[i] !== results[i - 1])
+            transitions++;
+    }
+    const transitionRate = transitions / (results.length - 1);
+    if (transitionRate > 0.5)
+        return 'oscillating';
+    // Check trend
+    const firstHalf = results.slice(0, Math.floor(results.length / 2));
+    const secondHalf = results.slice(Math.floor(results.length / 2));
+    const firstPassRate = firstHalf.filter(Boolean).length / firstHalf.length;
+    const secondPassRate = secondHalf.filter(Boolean).length / secondHalf.length;
+    if (secondPassRate > firstPassRate + 0.2)
+        return 'improving';
+    if (secondPassRate < firstPassRate - 0.2)
+        return 'degrading';
+    return 'stable';
+}
+function computeImprovementTrend(records) {
+    if (records.length < 2)
+        return 'flat';
+    const severities = records
+        .filter((r) => !r.passed && r.failure_severity !== undefined)
+        .map((r) => r.failure_severity ?? 0);
+    if (severities.length < 2)
+        return 'flat';
+    const first = severities.slice(0, Math.ceil(severities.length / 2));
+    const last = severities.slice(Math.floor(severities.length / 2));
+    const avgFirst = first.reduce((s, v) => s + v, 0) / first.length;
+    const avgLast = last.reduce((s, v) => s + v, 0) / last.length;
+    if (avgLast < avgFirst - 0.1)
+        return 'improving';
+    if (avgLast > avgFirst + 0.1)
+        return 'degrading';
+    return 'flat';
+}
+//# sourceMappingURL=outcome-score.js.map

package/dist/iole/outcome-score.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"outcome-score.js","sourceRoot":"","sources":["../../src/iole/outcome-score.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,iFAAiF;AAEjF;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,OAAwB;IAC1D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,SAAS,EAAE,CAAC;YACZ,gBAAgB,EAAE,CAAC;YACnB,eAAe,EAAE,CAAC;YAClB,gBAAgB,EAAE,SAAS;YAC3B,iBAAiB,EAAE,MAAM;YACzB,kBAAkB,EAAE,EAAE;YACtB,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACvC,CAAC;IACJ,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;IAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IACtD,MAAM,QAAQ,GAAG,MAAM,GAAG,KAAK,CAAC;IAEhC,qEAAqE;IACrE,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,SAAS,GAA2B,EAAE,CAAC;IAE7C,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,SAAS,EAAE,CAAC;QACZ,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QACrE,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7D,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnD,IAAI,SAAS,KAAK,CAAC;YAAE,cAAc,EAAE,CAAC;IACxC,CAAC;IAED,MAAM,aAAa,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAErE,8DAA8D;IAC9D,MAAM,SAAS,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;IAElD,kEAAkE;IAClE,MAAM,KAAK,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IAE/C,OAAO;QACL,SAAS,EAAE,QAAQ;QACnB,gBAAgB,EAAE,KAAK;QACvB,eAAe,EAAE,aAAa;QAC9B,gBAAgB,EAAE,SAAS;QAC3B,iBAAiB,EAAE,KAAK;QACxB,kBAAkB,EAAE,SAAS;QAC7B,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACvC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAc,EACd,SAAiB,EACjB,MAAe,EACf,YAAoB,EACpB,eAAwB;IAExB,OAAO;QACL,OAAO,EAAE,MAAM;QACf,SAAS;QACT,MAAM;QACN,aAAa,EAAE,YAAY;QAC3B,gBAAgB,EAAE,eAAe,IAAI,CAAC;QACtC,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACtC,CAAC;AACJ,CAAC;AAED,iFAAiF;AAEjF,SAAS,WAAW,CAAC,OAAwB;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAC7C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAID,SAAS,sBAAsB,CAAC,OAAwB;IACtD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAEzC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;YAAE,WAAW,EAAE,CAAC;IACnD,CAAC;IAED,MAAM,cAAc,GAAG,WAAW,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE1D,IAAI,cAAc,GAAG,GAAG;QAAE,OAAO,aAAa,CAAC;IAE/C,cAAc;IACd,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAC1E,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;IAE7E,IAAI,cAAc,GAAG,aAAa,GAAG,GAAG;QAAE,OAAO,WAAW,CAAC;IAC7D,IAAI,cAAc,GAAG,aAAa,GAAG,GAAG;QAAE,OAAO,WAAW,CAAC;IAC7D,OAAO,QAAQ,CAAC;AAClB,CAAC;AAID,SAAS,uBAAuB,CAAC,OAAwB;IACvD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC;IAEtC,MAAM,UAAU,GAAG,OAAO;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,gBAAgB,KAAK,SAAS,CAAC;SAC5D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,CAAC;IAEvC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC;IAEzC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEjE,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACjE,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAE9D,IAAI,OAAO,GAAG,QAAQ,GAAG,GAAG;QAAE,OAAO,WAAW,CAAC;IACjD,IAAI,OAAO,GAAG,QAAQ,GAAG,GAAG;QAAE,OAAO,WAAW,CAAC;IACjD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/isc/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * ISC (Intent Sufficiency Check) — public exports
+ *
+ * PRE-CONTEXT certification layer. Evaluates task prompt quality before
+ * context construction begins.
+ */
+export { checkIntentSufficiency, ISC_SUFFICIENT_THRESHOLD, ISC_WEAK_THRESHOLD } from './score.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/isc/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/isc/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,sBAAsB,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC"}

package/dist/isc/index.js

@@ -0,0 +1,8 @@
+/**
+ * ISC (Intent Sufficiency Check) — public exports
+ *
+ * PRE-CONTEXT certification layer. Evaluates task prompt quality before
+ * context construction begins.
+ */
+export { checkIntentSufficiency, ISC_SUFFICIENT_THRESHOLD, ISC_WEAK_THRESHOLD } from './score.js';
+//# sourceMappingURL=index.js.map

package/dist/isc/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/isc/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,sBAAsB,EAAE,wBAAwB,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC"}

package/dist/isc/score.d.ts

@@ -0,0 +1,27 @@
+/**
+ * ISC — Intent Sufficiency Check
+ *
+ * PRE-CONTEXT certification layer. Evaluates whether a task prompt carries
+ * enough structured intent to justify context construction.
+ *
+ * Design principles:
+ * - Deterministic: same input → same output (no ML, no external calls)
+ * - Local-first: pure string analysis
+ * - Additive scoring: five independent factors summed with fixed weights
+ *
+ * Decision thresholds:
+ *   SUFFICIENT   ≥ 0.75  → proceed normally
+ *   WEAK         0.50–0.74 → proceed with -0.05 CCS penalty
+ *   INSUFFICIENT < 0.50  → block context construction; surface recommendations
+ */
+import type { IntentSufficiencyCheck } from '@codeledger/types';
+export declare const ISC_SUFFICIENT_THRESHOLD = 0.75;
+export declare const ISC_WEAK_THRESHOLD = 0.5;
+/**
+ * Run the Intent Sufficiency Check on a task prompt.
+ *
+ * Returns a full IntentSufficiencyCheck with score, decision, per-factor
+ * breakdown, issues list, and actionable recommendations.
+ */
+export declare function checkIntentSufficiency(task: string): IntentSufficiencyCheck;
+//# sourceMappingURL=score.d.ts.map

package/dist/isc/score.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"score.d.ts","sourceRoot":"","sources":["../../src/isc/score.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAA4B,MAAM,mBAAmB,CAAC;AAY1F,eAAO,MAAM,wBAAwB,OAAS,CAAC;AAC/C,eAAO,MAAM,kBAAkB,MAAe,CAAC;AAuG/C;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,sBAAsB,CA4D3E"}