@xenos1996/usa 2.0.0

package/dist/evolution/propose.d.ts

@@ -0,0 +1,50 @@
+import type { Suggestion } from '../learn/index.js';
+import type { CapabilityGap, CandidateCapability, CoverageModel } from './types.js';
+/**
+ * The PROPOSAL stage of the evolution loop.
+ *
+ * A coverage blind spot yields a `CapabilityGap`; this module turns that gap
+ * into a concrete, *unreleased* `CandidateCapability` — deterministically and
+ * without any LLM. The proposal is drawn from the same bootstrap catalog that
+ * `usa bootstrap` uses, so there is exactly one source of truth for "what could
+ * cover this language".
+ *
+ * This stage never registers anything: the candidate carries a
+ * REVIEW-REQUIRED pack and status `PROPOSED`, and is only trusted after it
+ * passes the benchmark + release gate. Producer ≠ judge holds end to end.
+ */
+export interface ProposeOptions {
+    /** Called with the language to propose a capability for. */
+    language?: string;
+    /** Who/what authored the proposal (provenance only). */
+    createdBy?: string;
+    /** Override the clock for reproducible tests. */
+    now?: string;
+    /** Emit a reason when no candidate can be proposed. */
+    explain?: (reason: string) => void;
+}
+/**
+ * Propose a candidate capability that would close `gap`. Only
+ * `unsupported-technology` gaps are proposable today, and only when the
+ * bootstrap catalog (or its fallback) can render a pack for the language.
+ * Returns `null` when the gap is not proposable — never a half-built candidate.
+ */
+export declare function proposeCandidate(gap: CapabilityGap, opts?: ProposeOptions): CandidateCapability | null;
+/**
+ * Propose candidates for every open gap in a coverage model. Gaps that cannot
+ * be turned into a candidate are reported via `onUnproposable` and skipped —
+ * the caller decides whether that is fatal.
+ */
+export declare function proposeCandidates(coverage: CoverageModel, gaps: CapabilityGap[], opts?: ProposeOptions & {
+    onUnproposable?: (gap: CapabilityGap, reason: string) => void;
+}): CandidateCapability[];
+/**
+ * Turn `usa learn` suggestions into a single candidate capability pack of
+ * manual checks. Manual checks are honest: they assert nothing automatically,
+ * they queue a judgement. They are the correct proposal when the engine cannot
+ * express the missing check as data yet. Still PROPOSED, still REVIEW-REQUIRED.
+ */
+export declare function proposeFromSuggestions(suggestions: Suggestion[], opts?: ProposeOptions & {
+    packId?: string;
+}): CandidateCapability | null;
+//# sourceMappingURL=propose.d.ts.map

package/dist/evolution/propose.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"propose.d.ts","sourceRoot":"","sources":["../../src/evolution/propose.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,OAAO,KAAK,EAAE,aAAa,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEpF;;;;;;;;;;;;GAYG;AAEH,MAAM,WAAW,cAAc;IAC7B,4DAA4D;IAC5D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,wDAAwD;IACxD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iDAAiD;IACjD,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,uDAAuD;IACvD,OAAO,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;CACpC;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,GAAG,EAAE,aAAa,EAClB,IAAI,GAAE,cAAmB,GACxB,mBAAmB,GAAG,IAAI,CAsB5B;AA4CD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,aAAa,EACvB,IAAI,EAAE,aAAa,EAAE,EACrB,IAAI,GAAE,cAAc,GAAG;IAAE,cAAc,CAAC,EAAE,CAAC,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,KAAK,IAAI,CAAA;CAAO,GAC5F,mBAAmB,EAAE,CAyBvB;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,WAAW,EAAE,UAAU,EAAE,EACzB,IAAI,GAAE,cAAc,GAAG;IAAE,MAAM,CAAC,EAAE,MAAM,CAAA;CAAO,GAC9C,mBAAmB,GAAG,IAAI,CA+C5B"}

package/dist/evolution/propose.js

@@ -0,0 +1,188 @@
+import { bootstrapPacks } from '../bootstrap/index.js';
+import { parsePackText } from '../engine/loader.js';
+import { capabilityFromPack } from './capability.js';
+/**
+ * Propose a candidate capability that would close `gap`. Only
+ * `unsupported-technology` gaps are proposable today, and only when the
+ * bootstrap catalog (or its fallback) can render a pack for the language.
+ * Returns `null` when the gap is not proposable — never a half-built candidate.
+ */
+export function proposeCandidate(gap, opts = {}) {
+    const lang = proposableLanguage(gap, opts);
+    if (lang === null)
+        return null;
+    const pack = bootstrapPackFor(gap.requiredCapability, lang, opts);
+    if (!pack)
+        return null;
+    const capability = capabilityFromPack(pack, {
+        version: pack.version ?? '0.1.0-proposed',
+        description: pack.description,
+        createdBy: opts.createdBy ?? 'evolution:propose',
+        createdAt: opts.now,
+        languages: [lang],
+    });
+    return {
+        id: capability.id,
+        capability,
+        gapIds: [gap.id],
+        status: 'PROPOSED',
+        createdAt: opts.now ?? new Date().toISOString(),
+    };
+}
+/** The language a gap can be proposed for, or null (with an explanation). */
+function proposableLanguage(gap, opts) {
+    if (gap.kind !== 'unsupported-technology') {
+        opts.explain?.(`gap ${gap.id} is not a technology gap (kind: ${gap.kind})`);
+        return null;
+    }
+    const lang = opts.language ?? gap.target;
+    if (lang !== gap.target) {
+        opts.explain?.(`requested language ${lang} does not match gap target ${gap.target}`);
+        return null;
+    }
+    return lang;
+}
+/**
+ * Render the bootstrap starter pack for `lang` and parse it back into a
+ * RulePack. The bootstrap generator is the single source of truth for a
+ * starter pack; we feed it exactly the fact the gap was derived from so the
+ * proposal carries the same `skip_when: lang:<lang> absent` guard as a real one.
+ */
+function bootstrapPackFor(requiredCapability, lang, opts) {
+    const outcome = bootstrapPacks({ flags: new Set([`lang:${lang}`]), metrics: {} });
+    const proposal = outcome.packs.find((p) => p.packId === requiredCapability);
+    if (!proposal) {
+        opts.explain?.(`no bootstrap proposal exists for ${lang} (${requiredCapability})`);
+        return null;
+    }
+    const warnings = [];
+    const pack = parsePackText(proposal.yaml, proposal.filename, new Map(), warnings);
+    if (!pack) {
+        opts.explain?.(`bootstrap proposal for ${lang} did not parse as a rule pack: ${warnings.join('; ')}`);
+        return null;
+    }
+    return pack;
+}
+/**
+ * Propose candidates for every open gap in a coverage model. Gaps that cannot
+ * be turned into a candidate are reported via `onUnproposable` and skipped —
+ * the caller decides whether that is fatal.
+ */
+export function proposeCandidates(coverage, gaps, opts = {}) {
+    const out = [];
+    const seen = new Set();
+    // Prefer explicit language order from the coverage model so results are
+    // deterministic regardless of map/Set iteration in the caller.
+    const order = new Map(coverage.detectedLanguages.map((lang, i) => [lang, i]));
+    const ordered = [...gaps].sort((a, b) => {
+        const ai = order.get(a.target) ?? Number.MAX_SAFE_INTEGER;
+        const bi = order.get(b.target) ?? Number.MAX_SAFE_INTEGER;
+        return ai - bi || a.id.localeCompare(b.id);
+    });
+    for (const gap of ordered) {
+        if (gap.state !== 'open')
+            continue;
+        if (seen.has(gap.requiredCapability))
+            continue;
+        const candidate = proposeCandidate(gap, opts);
+        if (!candidate) {
+            opts.onUnproposable?.(gap, `no proposal for ${gap.requiredCapability}`);
+            continue;
+        }
+        seen.add(gap.requiredCapability);
+        out.push(candidate);
+    }
+    return out;
+}
+/**
+ * Turn `usa learn` suggestions into a single candidate capability pack of
+ * manual checks. Manual checks are honest: they assert nothing automatically,
+ * they queue a judgement. They are the correct proposal when the engine cannot
+ * express the missing check as data yet. Still PROPOSED, still REVIEW-REQUIRED.
+ */
+export function proposeFromSuggestions(suggestions, opts = {}) {
+    if (suggestions.length === 0) {
+        opts.explain?.('no learn suggestions to propose from');
+        return null;
+    }
+    const packId = opts.packId ?? 'learn-proposals';
+    const rules = suggestions.map((s) => ({
+        id: s.id,
+        title: s.title,
+        section: s.section,
+        sectionTitle: s.sectionTitle,
+        severity: s.severity,
+        ruleClass: toRuleClass(s.ruleClass),
+        check: { kind: 'manual' },
+        why: s.why,
+        remediation: s.remediation,
+        evidence: s.evidence,
+        references: s.references,
+    }));
+    const pack = parsePackText(renderProposalPackYaml(packId, rules), `${packId}.yaml`, new Map(), []);
+    if (!pack) {
+        opts.explain?.(`could not render proposal pack ${packId}`);
+        return null;
+    }
+    const capability = capabilityFromPack(pack, {
+        version: pack.version ?? '0.1.0-proposed',
+        description: 'Manual checks proposed by usa learn from open findings.',
+        createdBy: opts.createdBy ?? 'evolution:propose:learn',
+        createdAt: opts.now,
+        languages: [],
+    });
+    return {
+        id: capability.id,
+        capability,
+        gapIds: suggestions.map((s) => s.triggeredBy),
+        status: 'PROPOSED',
+        createdAt: opts.now ?? new Date().toISOString(),
+    };
+}
+const VALID_RULE_CLASSES = new Set([
+    'security',
+    'supply-chain',
+    'correctness',
+    'maintainability',
+    'operations',
+    'performance',
+    'compliance',
+    'documentation',
+    'style',
+]);
+function toRuleClass(value) {
+    return VALID_RULE_CLASSES.has(value) ? value : 'maintainability';
+}
+/** Minimal YAML emitter for a proposal pack; values are quoted defensively. */
+function renderProposalPackYaml(packId, rules) {
+    const q = (s) => JSON.stringify(s);
+    const lines = [
+        `id: ${packId}`,
+        `title: ${q('Proposals from usa learn')}`,
+        `section: S0`,
+        `section_title: ${q('Generated Proposals')}`,
+        `description: ${q('Unreviewed manual checks proposed from open audit findings.')}`,
+        `version: '0.1.0-proposed'`,
+        'rules:',
+    ];
+    for (const r of rules) {
+        lines.push(`  - id: ${r.id}`);
+        lines.push(`    title: ${q(r.title)}`);
+        lines.push(`    section: ${r.section}`);
+        lines.push(`    section_title: ${q(r.sectionTitle ?? r.section)}`);
+        lines.push(`    severity: ${r.severity}`);
+        lines.push(`    class: ${r.ruleClass}`);
+        lines.push(`    check:`);
+        lines.push(`      kind: manual`);
+        lines.push(`    why: ${q(r.why ?? '')}`);
+        if (r.remediation)
+            lines.push(`    remediation: ${q(r.remediation)}`);
+        if (r.evidence)
+            lines.push(`    evidence: ${q(r.evidence)}`);
+        if (r.references?.length) {
+            lines.push(`    references: [${r.references.map(q).join(', ')}]`);
+        }
+    }
+    return `${lines.join('\n')}\n`;
+}
+//# sourceMappingURL=propose.js.map

package/dist/evolution/propose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"propose.js","sourceRoot":"","sources":["../../src/evolution/propose.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AA8BrD;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,GAAkB,EAClB,OAAuB,EAAE;IAEzB,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAC3C,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAE/B,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,kBAAkB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAClE,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,EAAE;QAC1C,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,gBAAgB;QACzC,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,mBAAmB;QAChD,SAAS,EAAE,IAAI,CAAC,GAAG;QACnB,SAAS,EAAE,CAAC,IAAI,CAAC;KAClB,CAAC,CAAC;IAEH,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,EAAE;QACjB,UAAU;QACV,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAChB,MAAM,EAAE,UAAU;QAClB,SAAS,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KAChD,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,SAAS,kBAAkB,CAAC,GAAkB,EAAE,IAAoB;IAClE,IAAI,GAAG,CAAC,IAAI,KAAK,wBAAwB,EAAE,CAAC;QAC1C,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,GAAG,CAAC,EAAE,mCAAmC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC;IACzC,IAAI,IAAI,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,EAAE,CAAC,sBAAsB,IAAI,8BAA8B,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QACrF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CACvB,kBAA0B,EAC1B,IAAY,EACZ,IAAoB;IAEpB,MAAM,OAAO,GAAG,cAAc,CAAC,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAClF,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,kBAAkB,CAAC,CAAC;IAC5E,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,IAAI,CAAC,OAAO,EAAE,CAAC,oCAAoC,IAAI,KAAK,kBAAkB,GAAG,CAAC,CAAC;QACnF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC;IAClF,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,IAAI,CAAC,OAAO,EAAE,CACZ,0BAA0B,IAAI,kCAAkC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACtF,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAuB,EACvB,IAAqB,EACrB,OAA2F,EAAE;IAE7F,MAAM,GAAG,GAA0B,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,wEAAwE;IACxE,+DAA+D;IAC/D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;QAC1D,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;QAC1D,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,KAAK,KAAK,MAAM;YAAE,SAAS;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,kBAAkB,CAAC;YAAE,SAAS;QAC/C,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,EAAE,CAAC,GAAG,EAAE,mBAAmB,GAAG,CAAC,kBAAkB,EAAE,CAAC,CAAC;YACxE,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;QACjC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,WAAyB,EACzB,OAA6C,EAAE;IAE/C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,EAAE,CAAC,sCAAsC,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,iBAAiB,CAAC;IAChD,MAAM,KAAK,GAAW,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,YAAY,EAAE,CAAC,CAAC,YAAY;QAC5B,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QACnC,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;QACzB,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,UAAU,EAAE,CAAC,CAAC,UAAU;KACzB,CAAC,CAAC,CAAC;IAEJ,MAAM,IAAI,GAAG,aAAa,CACxB,sBAAsB,CAAC,MAAM,EAAE,KAAK,CAAC,EACrC,GAAG,MAAM,OAAO,EAChB,IAAI,GAAG,EAAE,EACT,EAAE,CACH,CAAC;IACF,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,IAAI,CAAC,OAAO,EAAE,CAAC,kCAAkC,MAAM,EAAE,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,EAAE;QAC1C,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,gBAAgB;QACzC,WAAW,EAAE,yDAAyD;QACtE,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,yBAAyB;QACtD,SAAS,EAAE,IAAI,CAAC,GAAG;QACnB,SAAS,EAAE,EAAE;KACd,CAAC,CAAC;IAEH,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,EAAE;QACjB,UAAU;QACV,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;QAC7C,MAAM,EAAE,UAAU;QAClB,SAAS,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KAChD,CAAC;AACJ,CAAC;AAED,MAAM,kBAAkB,GAA2B,IAAI,GAAG,CAAY;IACpE,UAAU;IACV,cAAc;IACd,aAAa;IACb,iBAAiB;IACjB,YAAY;IACZ,aAAa;IACb,YAAY;IACZ,eAAe;IACf,OAAO;CACR,CAAC,CAAC;AAEH,SAAS,WAAW,CAAC,KAAa;IAChC,OAAO,kBAAkB,CAAC,GAAG,CAAC,KAAkB,CAAC,CAAC,CAAC,CAAE,KAAmB,CAAC,CAAC,CAAC,iBAAiB,CAAC;AAC/F,CAAC;AAED,+EAA+E;AAC/E,SAAS,sBAAsB,CAAC,MAAc,EAAE,KAAa;IAC3D,MAAM,CAAC,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAa;QACtB,OAAO,MAAM,EAAE;QACf,UAAU,CAAC,CAAC,0BAA0B,CAAC,EAAE;QACzC,aAAa;QACb,kBAAkB,CAAC,CAAC,qBAAqB,CAAC,EAAE;QAC5C,gBAAgB,CAAC,CAAC,6DAA6D,CAAC,EAAE;QAClF,2BAA2B;QAC3B,QAAQ;KACT,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QACxC,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnE,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QACxC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,CAAC,CAAC,WAAW;YAAE,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,CAAC,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACjC,CAAC"}

package/dist/evolution/queue.d.ts

@@ -0,0 +1,64 @@
+import type { Store } from '../store/index.js';
+import type { CapabilityGap } from './types.js';
+/**
+ * Persistent, content-addressed gap queue.
+ *
+ * Gaps arrive with every audit; the same gap reappears run after run. The queue
+ * is the durable memory that answers "which gaps are currently open?" without
+ * mutating anything: every state change is one append-only record in the Store,
+ * and the latest state is a pure fold over those records.
+ *
+ * A record is one transition. Because records are content-addressed, recording
+ * the *same* transition twice writes the same bytes and therefore the same
+ * object — re-running a cycle is idempotent by construction.
+ *
+ * Deriving latest state from records (never from a mutable index) means the
+ * queue cannot drift: replay the records and you get exactly the same answer.
+ */
+export interface QueueSummary {
+    open: number;
+    closed: number;
+    total: number;
+    byKind: Record<string, number>;
+    byPriority: Record<string, number>;
+}
+export interface GapTransition {
+    gapId: string;
+    from: CapabilityGap['state'] | 'absent';
+    to: CapabilityGap['state'];
+    at: string;
+    reason?: string;
+}
+export declare class GapQueue {
+    private readonly store;
+    private readonly namespace;
+    constructor(store: Store, namespace?: string);
+    recordGaps(gaps: CapabilityGap[]): {
+        opened: string[];
+        reopened: string[];
+        existing: string[];
+    };
+    closeGaps(gapIds: string[], reason?: string): string[];
+    acceptGaps(gapIds: string[], reason?: string): string[];
+    openGaps(): CapabilityGap[];
+    allGaps(): CapabilityGap[];
+    history(gapId: string): GapTransition[];
+    summarize(): QueueSummary;
+    /**
+     * Record one gap. Returns which bucket it landed in. Never mutates an existing
+     * record: a new state (or changed evidence) appends a new transition.
+     */
+    private recordOne;
+    private transitionGaps;
+    /** Append a transition record; the gap's state field is set to `to`. */
+    private append;
+    private nextSeq;
+    /** Latest state for a gap, or null when unknown. Pure fold over records. */
+    private latestFor;
+    /** Latest gap per known id, unsorted. */
+    private latest;
+    /** All records in this namespace, ordered by (gapId, seq). */
+    private records;
+    private recordsFor;
+}
+//# sourceMappingURL=queue.d.ts.map

package/dist/evolution/queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../../src/evolution/queue.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD;;;;;;;;;;;;;;GAcG;AAEH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,aAAa,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC;IACxC,EAAE,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAoBD,qBAAa,QAAQ;IACnB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAQ;IAC9B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBAEvB,KAAK,EAAE,KAAK,EAAE,SAAS,SAAoB;IAKvD,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG;QAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE;IAa/F,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAItD,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAIvD,QAAQ,IAAI,aAAa,EAAE;IAM3B,OAAO,IAAI,aAAa,EAAE;IAI1B,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,EAAE;IAMvC,SAAS,IAAI,YAAY;IAiBzB;;;OAGG;IACH,OAAO,CAAC,SAAS;IAejB,OAAO,CAAC,cAAc;IActB,wEAAwE;IACxE,OAAO,CAAC,MAAM;IAsBd,OAAO,CAAC,OAAO;IAMf,4EAA4E;IAC5E,OAAO,CAAC,SAAS;IAKjB,yCAAyC;IACzC,OAAO,CAAC,MAAM;IAMd,8DAA8D;IAC9D,OAAO,CAAC,OAAO;IAQf,OAAO,CAAC,UAAU;CAGnB"}

package/dist/evolution/queue.js

@@ -0,0 +1,192 @@
+import { canonicalJson } from '../snapshot/index.js';
+const DEFAULT_NAMESPACE = 'gaps';
+const PRIORITY_RANK = {
+    high: 0,
+    medium: 1,
+    low: 2,
+};
+export class GapQueue {
+    store;
+    namespace;
+    constructor(store, namespace = DEFAULT_NAMESPACE) {
+        this.store = store;
+        this.namespace = namespace;
+    }
+    recordGaps(gaps) {
+        const opened = [];
+        const reopened = [];
+        const existing = [];
+        for (const gap of gaps) {
+            const bucket = this.recordOne(gap);
+            if (bucket === 'opened')
+                opened.push(gap.id);
+            else if (bucket === 'reopened')
+                reopened.push(gap.id);
+            else
+                existing.push(gap.id);
+        }
+        return { opened, reopened, existing };
+    }
+    closeGaps(gapIds, reason) {
+        return this.transitionGaps(gapIds, 'closed', reason);
+    }
+    acceptGaps(gapIds, reason) {
+        return this.transitionGaps(gapIds, 'accepted', reason);
+    }
+    openGaps() {
+        return this.latest()
+            .filter((g) => g.state === 'open')
+            .sort(compareForQueue);
+    }
+    allGaps() {
+        return this.latest().sort((a, b) => a.id.localeCompare(b.id));
+    }
+    history(gapId) {
+        return this.records()
+            .filter((r) => r.gapId === gapId)
+            .map((r) => r.transition);
+    }
+    summarize() {
+        const gaps = this.latest();
+        const byKind = {};
+        const byPriority = {};
+        let open = 0;
+        let closed = 0;
+        for (const gap of gaps) {
+            if (gap.state === 'closed')
+                closed += 1;
+            else
+                open += 1;
+            byKind[gap.kind] = (byKind[gap.kind] ?? 0) + 1;
+            byPriority[gap.priority] = (byPriority[gap.priority] ?? 0) + 1;
+        }
+        return { open, closed, total: gaps.length, byKind, byPriority };
+    }
+    /* ------------------------------------------------------------------- core -- */
+    /**
+     * Record one gap. Returns which bucket it landed in. Never mutates an existing
+     * record: a new state (or changed evidence) appends a new transition.
+     */
+    recordOne(gap) {
+        const prior = this.latestFor(gap.id);
+        if (!prior) {
+            this.append(gap, 'absent', 'open');
+            return 'opened';
+        }
+        if (prior.state === 'closed') {
+            this.append(gap, 'closed', 'open');
+            return 'reopened';
+        }
+        if (sameGap(prior.gap, gap))
+            return 'existing';
+        this.append(gap, prior.state, prior.state);
+        return 'existing';
+    }
+    transitionGaps(gapIds, to, reason) {
+        const changed = [];
+        for (const gapId of gapIds) {
+            const prior = this.latestFor(gapId);
+            // Only a currently-open gap can transition: closed is terminal until a
+            // re-observation reopens it (recordGaps), and an accepted gap is not
+            // "open" either.
+            if (!prior || prior.state !== 'open')
+                continue;
+            this.append(prior.gap, prior.state, to, reason);
+            changed.push(gapId);
+        }
+        return changed;
+    }
+    /** Append a transition record; the gap's state field is set to `to`. */
+    append(gap, from, to, reason) {
+        const seq = this.nextSeq(gap.id);
+        const at = new Date().toISOString();
+        const transition = { gapId: gap.id, from, to, at };
+        if (reason !== undefined)
+            transition.reason = reason;
+        const record = {
+            kind: 'gap-record',
+            namespace: this.namespace,
+            gapId: gap.id,
+            seq,
+            state: to,
+            gap: { ...gap, state: to },
+            transition,
+        };
+        this.store.put(record);
+    }
+    nextSeq(gapId) {
+        const records = this.recordsFor(gapId);
+        const last = records[records.length - 1];
+        return last ? last.seq + 1 : 1;
+    }
+    /** Latest state for a gap, or null when unknown. Pure fold over records. */
+    latestFor(gapId) {
+        const records = this.recordsFor(gapId);
+        return records.length > 0 ? records[records.length - 1] : null;
+    }
+    /** Latest gap per known id, unsorted. */
+    latest() {
+        const byId = new Map();
+        for (const record of this.records())
+            byId.set(record.gapId, record);
+        return [...byId.values()].map((r) => r.gap);
+    }
+    /** All records in this namespace, ordered by (gapId, seq). */
+    records() {
+        return this.store
+            .ids()
+            .map((id) => this.store.get(id))
+            .filter((r) => isGapRecord(r, this.namespace))
+            .sort(compareRecords);
+    }
+    recordsFor(gapId) {
+        return this.records().filter((r) => r.gapId === gapId);
+    }
+}
+/* -------------------------------------------------------------------- utils -- */
+const GAP_STATES = new Set([
+    'open',
+    'accepted',
+    'closed',
+]);
+function isGapRecord(value, namespace) {
+    if (!value || typeof value !== 'object')
+        return false;
+    const r = value;
+    return (r.kind === 'gap-record' &&
+        r.namespace === namespace &&
+        typeof r.gapId === 'string' &&
+        typeof r.seq === 'number' &&
+        GAP_STATES.has(r.state) &&
+        !!r.gap &&
+        !!r.transition);
+}
+function compareRecords(a, b) {
+    return a.gapId.localeCompare(b.gapId) || a.seq - b.seq;
+}
+function compareForQueue(a, b) {
+    return PRIORITY_RANK[a.priority] - PRIORITY_RANK[b.priority] || a.id.localeCompare(b.id);
+}
+/**
+ * Whether two observations describe the same gap *logically*. Provenance that
+ * changes on every run (audit run id, snapshot, timestamp) is excluded so
+ * re-observing an unchanged gap is idempotent; the evidence trail IS compared,
+ * because new facts on a known gap are a genuine update worth recording.
+ */
+function sameGap(a, b) {
+    return canonicalJson(stableIdentity(a)) === canonicalJson(stableIdentity(b));
+}
+/** The parts of a gap that decide whether it is "the same, unchanged" gap. */
+function stableIdentity(gap) {
+    return {
+        id: gap.id,
+        kind: gap.kind,
+        target: gap.target,
+        problem: gap.problem,
+        requiredCapability: gap.requiredCapability,
+        priority: gap.priority,
+        state: gap.state,
+        evidence: gap.evidence,
+    };
+}
+//# sourceMappingURL=queue.js.map

package/dist/evolution/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/evolution/queue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AA8CrD,MAAM,iBAAiB,GAAG,MAAM,CAAC;AAEjC,MAAM,aAAa,GAA8C;IAC/D,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,GAAG,EAAE,CAAC;CACP,CAAC;AAEF,MAAM,OAAO,QAAQ;IACF,KAAK,CAAQ;IACb,SAAS,CAAS;IAEnC,YAAY,KAAY,EAAE,SAAS,GAAG,iBAAiB;QACrD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,UAAU,CAAC,IAAqB;QAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,MAAM,KAAK,QAAQ;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBACxC,IAAI,MAAM,KAAK,UAAU;gBAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;;gBACjD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACxC,CAAC;IAED,SAAS,CAAC,MAAgB,EAAE,MAAe;QACzC,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;IAED,UAAU,CAAC,MAAgB,EAAE,MAAe;QAC1C,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IACzD,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,MAAM,EAAE;aACjB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC;aACjC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC3B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,CAAC,KAAa;QACnB,OAAO,IAAI,CAAC,OAAO,EAAE;aAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC;aAChC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAC9B,CAAC;IAED,SAAS;QACP,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,MAAM,UAAU,GAA2B,EAAE,CAAC;QAC9C,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,KAAK,KAAK,QAAQ;gBAAE,MAAM,IAAI,CAAC,CAAC;;gBACnC,IAAI,IAAI,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/C,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IAClE,CAAC;IAED,iFAAiF;IAEjF;;;OAGG;IACK,SAAS,CAAC,GAAkB;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACnC,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACnC,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,IAAI,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC;YAAE,OAAO,UAAU,CAAC;QAC/C,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3C,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,cAAc,CAAC,MAAgB,EAAE,EAA0B,EAAE,MAAe;QAClF,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACpC,uEAAuE;YACvE,qEAAqE;YACrE,iBAAiB;YACjB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM;gBAAE,SAAS;YAC/C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;YAChD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,wEAAwE;IAChE,MAAM,CACZ,GAAkB,EAClB,IAAuC,EACvC,EAA0B,EAC1B,MAAe;QAEf,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,UAAU,GAAkB,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QAClE,IAAI,MAAM,KAAK,SAAS;YAAE,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC;QACrD,MAAM,MAAM,GAAc;YACxB,IAAI,EAAE,YAAY;YAClB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,GAAG,CAAC,EAAE;YACb,GAAG;YACH,KAAK,EAAE,EAAE;YACT,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE;YAC1B,UAAU;SACX,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACzB,CAAC;IAEO,OAAO,CAAC,KAAa;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,4EAA4E;IACpE,SAAS,CAAC,KAAa;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvC,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAClE,CAAC;IAED,yCAAyC;IACjC,MAAM;QACZ,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC1C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE;YAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACpE,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,8DAA8D;IACtD,OAAO;QACb,OAAO,IAAI,CAAC,KAAK;aACd,GAAG,EAAE;aACL,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAY,EAAE,CAAC,CAAC;aAC1C,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;aAC7D,IAAI,CAAC,cAAc,CAAC,CAAC;IAC1B,CAAC;IAEO,UAAU,CAAC,KAAa;QAC9B,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;IACzD,CAAC;CACF;AAED,mFAAmF;AAEnF,MAAM,UAAU,GAAyB,IAAI,GAAG,CAAyB;IACvE,MAAM;IACN,UAAU;IACV,QAAQ;CACT,CAAC,CAAC;AAEH,SAAS,WAAW,CAAC,KAAc,EAAE,SAAiB;IACpD,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IACtD,MAAM,CAAC,GAAG,KAA2B,CAAC;IACtC,OAAO,CACL,CAAC,CAAC,IAAI,KAAK,YAAY;QACvB,CAAC,CAAC,SAAS,KAAK,SAAS;QACzB,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ;QAC3B,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ;QACzB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;QACvB,CAAC,CAAC,CAAC,CAAC,GAAG;QACP,CAAC,CAAC,CAAC,CAAC,UAAU,CACf,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,CAAY,EAAE,CAAY;IAChD,OAAO,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;AACzD,CAAC;AAED,SAAS,eAAe,CAAC,CAAgB,EAAE,CAAgB;IACzD,OAAO,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC3F,CAAC;AAED;;;;;GAKG;AACH,SAAS,OAAO,CAAC,CAAgB,EAAE,CAAgB;IACjD,OAAO,aAAa,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,aAAa,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,8EAA8E;AAC9E,SAAS,cAAc,CAAC,GAAkB;IACxC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,kBAAkB,EAAE,GAAG,CAAC,kBAAkB;QAC1C,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,QAAQ,EAAE,GAAG,CAAC,QAAQ;KACvB,CAAC;AACJ,CAAC"}

package/dist/evolution/release.d.ts

@@ -0,0 +1,11 @@
+import type { BenchmarkResult, ReleaseDecision, ReleaseGate } from './types.js';
+/** Default gate: perfect precision/recall on the fleet, zero regressions. */
+export declare const DEFAULT_RELEASE_GATE: ReleaseGate;
+/**
+ * Deterministic release decision. A candidate ships only when the benchmark
+ * fixtures match ground truth (no FP, no FN), precision/recall meet policy, and
+ * no existing rule regressed. The decision is a pure function of the benchmark
+ * result + gate, so it is auditable and reproducible.
+ */
+export declare function evaluateRelease(bench: BenchmarkResult, gate: ReleaseGate): ReleaseDecision;
+//# sourceMappingURL=release.d.ts.map

package/dist/evolution/release.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"release.d.ts","sourceRoot":"","sources":["../../src/evolution/release.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEhF,6EAA6E;AAC7E,eAAO,MAAM,oBAAoB,EAAE,WAIlC,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,EAAE,IAAI,EAAE,WAAW,GAAG,eAAe,CA6B1F"}

package/dist/evolution/release.js

@@ -0,0 +1,55 @@
+/** Default gate: perfect precision/recall on the fleet, zero regressions. */
+export const DEFAULT_RELEASE_GATE = {
+    minPrecision: 1,
+    minRecall: 1,
+    requireNoRegressions: true,
+};
+/**
+ * Deterministic release decision. A candidate ships only when the benchmark
+ * fixtures match ground truth (no FP, no FN), precision/recall meet policy, and
+ * no existing rule regressed. The decision is a pure function of the benchmark
+ * result + gate, so it is auditable and reproducible.
+ */
+export function evaluateRelease(bench, gate) {
+    const s = bench.summary;
+    const precision = s.tp + s.fp > 0 ? s.tp / (s.tp + s.fp) : 1;
+    const recall = s.tp + s.fn > 0 ? s.tp / (s.tp + s.fn) : 1;
+    // Evidence over claims: a benchmark with no cases proves nothing, so it can
+    // never release. Otherwise an unbenchmarked candidate would sail through on
+    // vacuous 1.000/1.000 scores.
+    const hasEvidence = bench.cases.length > 0;
+    const testsPassed = hasEvidence && s.fp === 0 && s.fn === 0;
+    const benchmarkPassed = hasEvidence && precision >= gate.minPrecision && recall >= gate.minRecall;
+    const noRegressions = !gate.requireNoRegressions || s.regressions === 0;
+    const decision = decide(hasEvidence, testsPassed, benchmarkPassed, noRegressions);
+    return {
+        decision,
+        reasons: buildReasons(bench.cases.length, s, precision, recall, gate, testsPassed, noRegressions),
+        testsPassed,
+        benchmarkPassed,
+        precision,
+        recall,
+        regressions: s.regressions,
+    };
+}
+/** All four conditions must hold; a missing benchmark is never a pass. */
+function decide(hasEvidence, testsPassed, benchmarkPassed, noRegressions) {
+    if (!hasEvidence || !testsPassed || !benchmarkPassed || !noRegressions)
+        return 'REJECT';
+    return 'ACCEPT';
+}
+function buildReasons(cases, s, precision, recall, gate, testsPassed, noRegressions) {
+    const reasons = [];
+    if (cases === 0)
+        reasons.push('no benchmark cases: a release requires positive evidence');
+    if (cases > 0 && !testsPassed)
+        reasons.push(`fixture results diverge from ground truth (${s.fp} FP, ${s.fn} FN)`);
+    if (!noRegressions)
+        reasons.push(`${s.regressions} regression(s) against existing rules`);
+    if (cases > 0 && precision < gate.minPrecision)
+        reasons.push(`precision ${precision.toFixed(3)} < ${gate.minPrecision}`);
+    if (cases > 0 && recall < gate.minRecall)
+        reasons.push(`recall ${recall.toFixed(3)} < ${gate.minRecall}`);
+    return reasons;
+}
+//# sourceMappingURL=release.js.map

package/dist/evolution/release.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"release.js","sourceRoot":"","sources":["../../src/evolution/release.ts"],"names":[],"mappings":"AAEA,6EAA6E;AAC7E,MAAM,CAAC,MAAM,oBAAoB,GAAgB;IAC/C,YAAY,EAAE,CAAC;IACf,SAAS,EAAE,CAAC;IACZ,oBAAoB,EAAE,IAAI;CAC3B,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB,EAAE,IAAiB;IACvE,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IACxB,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,4EAA4E;IAC5E,4EAA4E;IAC5E,8BAA8B;IAC9B,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,WAAW,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5D,MAAM,eAAe,GAAG,WAAW,IAAI,SAAS,IAAI,IAAI,CAAC,YAAY,IAAI,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC;IAClG,MAAM,aAAa,GAAG,CAAC,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC;IACxE,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;IAClF,OAAO;QACL,QAAQ;QACR,OAAO,EAAE,YAAY,CACnB,KAAK,CAAC,KAAK,CAAC,MAAM,EAClB,CAAC,EACD,SAAS,EACT,MAAM,EACN,IAAI,EACJ,WAAW,EACX,aAAa,CACd;QACD,WAAW;QACX,eAAe;QACf,SAAS;QACT,MAAM;QACN,WAAW,EAAE,CAAC,CAAC,WAAW;KAC3B,CAAC;AACJ,CAAC;AAED,0EAA0E;AAC1E,SAAS,MAAM,CACb,WAAoB,EACpB,WAAoB,EACpB,eAAwB,EACxB,aAAsB;IAEtB,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,IAAI,CAAC,eAAe,IAAI,CAAC,aAAa;QAAE,OAAO,QAAQ,CAAC;IACxF,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,YAAY,CACnB,KAAa,EACb,CAA6B,EAC7B,SAAiB,EACjB,MAAc,EACd,IAAiB,EACjB,WAAoB,EACpB,aAAsB;IAEtB,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;IAC1F,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,WAAW;QAC3B,OAAO,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrF,IAAI,CAAC,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,uCAAuC,CAAC,CAAC;IAC1F,IAAI,KAAK,GAAG,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY;QAC5C,OAAO,CAAC,IAAI,CAAC,aAAa,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IAC3E,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS;QACtC,OAAO,CAAC,IAAI,CAAC,UAAU,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IAClE,OAAO,OAAO,CAAC;AACjB,CAAC"}