@xenos1996/usa 2.0.0

package/dist/evolution/run.d.ts

@@ -0,0 +1,88 @@
+import { type Snapshot } from '../snapshot/index.js';
+import { Store } from '../store/index.js';
+import type { AuditReport, Facts } from '../types.js';
+import { type QueueSummary } from './queue.js';
+import { type ScheduleResult } from './schedule.js';
+import type { AuditRun, BenchmarkCase, Capability, CapabilityGap, CandidateCapability, CoverageModel, ReAuditDelta, ReleaseDecision, ReleaseGate } from './types.js';
+export interface EvolutionCycleInput {
+    target: string;
+    rulesDir?: string;
+    engineVersion?: string;
+    repository?: string;
+    candidateCapability?: Capability;
+    benchmarkCases?: BenchmarkCase[];
+    releaseGate?: ReleaseGate;
+    store?: Store;
+    /**
+     * When no explicit candidate is supplied, propose one (or more) from the
+     * BEFORE gaps, deterministically, and run the first proposable candidate
+     * through benchmark + release. Nothing is registered — the proposal is a
+     * candidate only. Records the full proposal list on the output.
+     */
+    proposeFromGaps?: boolean;
+    /** Called for each gap that could not be turned into a candidate. */
+    onUnproposable?: (gap: CapabilityGap, reason: string) => void;
+    /**
+     * Path to a previously generated USA report. When no explicit candidate is
+     * supplied, its open findings are turned into a `learn-proposals` candidate of
+     * manual checks (`usa learn` → proposal). Lower precedence than
+     * `candidateCapability`; higher than `proposeFromGaps`.
+     */
+    learnReportPath?: string;
+    /** Minimum severity considered when learning from `learnReportPath`. */
+    learnMinSeverity?: 'CRITICAL' | 'HIGH' | 'MEDIUM' | 'LOW' | 'FUTURE';
+    /**
+     * When true, and only when there is no explicit `candidateCapability` and no
+     * `learnReportPath`, evaluate EVERY proposable candidate (one per open gap)
+     * via `scheduleCandidates` instead of just the first. Ignored otherwise.
+     */
+    allGaps?: boolean;
+    /**
+     * Persist gaps into the persistent queue and close the targeted gap(s) when a
+     * candidate is accepted. Defaults to true when a `store` is present. Requires
+     * a store; ignored otherwise.
+     */
+    persistGaps?: boolean;
+}
+export interface AuditWithCoverage {
+    report: AuditReport;
+    facts: Facts;
+    coverage: CoverageModel;
+    gaps: CapabilityGap[];
+    capabilitySetId: string;
+    auditRunId: string;
+    runRecord: AuditRun;
+}
+export interface EvolutionCycleOutput {
+    snapshot: Snapshot;
+    before: AuditWithCoverage;
+    /** Candidate actually benchmarked/released (explicit or auto-proposed). */
+    candidate?: {
+        capabilityId: string;
+        gapIds: string[];
+        release?: ReleaseDecision;
+    };
+    /** All candidates proposed from gaps (empty when none were requested). */
+    proposed: CandidateCapability[];
+    /** Suggestion count when the candidate was learned from a report. */
+    learnedSuggestions?: number;
+    /** Persistent-queue view after the run (when a store was used). */
+    queue?: QueueSummary;
+    /** Batch scheduler outcome (only in `allGaps` mode). */
+    schedule?: ScheduleResult;
+    after?: AuditWithCoverage & {
+        delta: ReAuditDelta;
+    };
+}
+/**
+ * The full, deterministic evolution cycle:
+ *
+ *     SNAPSHOT → AUDIT → COVERAGE → GAPS → (CANDIDATE → BENCHMARK → RELEASE)
+ *              → RE-AUDIT → DELTA
+ *
+ * No LLM is required: every stage is a deterministic function of the snapshot +
+ * capability set + engine version. Records written to the Store are
+ * content-addressed and reproducible.
+ */
+export declare function runEvolutionCycle(input: EvolutionCycleInput): EvolutionCycleOutput;
+//# sourceMappingURL=run.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../../src/evolution/run.ts"],"names":[],"mappings":"AAGA,OAAO,EAA8C,KAAK,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AACjG,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAQtD,OAAO,EAAY,KAAK,YAAY,EAAE,MAAM,YAAY,CAAC;AACzD,OAAO,EAAsB,KAAK,cAAc,EAAE,MAAM,eAAe,CAAC;AACxE,OAAO,KAAK,EACV,QAAQ,EACR,aAAa,EACb,UAAU,EACV,aAAa,EACb,mBAAmB,EACnB,aAAa,EACb,YAAY,EACZ,eAAe,EACf,WAAW,EACZ,MAAM,YAAY,CAAC;AAEpB,MAAM,WAAW,mBAAmB;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,mBAAmB,CAAC,EAAE,UAAU,CAAC;IACjC,cAAc,CAAC,EAAE,aAAa,EAAE,CAAC;IACjC,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,KAAK,CAAC,EAAE,KAAK,CAAC;IACd;;;;;OAKG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,qEAAqE;IACrE,cAAc,CAAC,EAAE,CAAC,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;IAC9D;;;;;OAKG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,wEAAwE;IACxE,gBAAgB,CAAC,EAAE,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,GAAG,QAAQ,CAAC;IACrE;;;;OAIG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB;;;;OAIG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,WAAW,CAAC;IACpB,KAAK,EAAE,KAAK,CAAC;IACb,QAAQ,EAAE,aAAa,CAAC;IACxB,IAAI,EAAE,aAAa,EAAE,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,QAAQ,CAAC;CACrB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE,QAAQ,CAAC;IACnB,MAAM,EAAE,iBAAiB,CAAC;IAC1B,2EAA2E;IAC3E,SAAS,CAAC,EAAE;QACV,YAAY,EAAE,MAAM,CAAC;QACrB,MAAM,EAAE,MAAM,EAAE,CAAC;QACjB,OAAO,CAAC,EAAE,eAAe,CAAC;KAC3B,CAAC;IACF,0EAA0E;IAC1E,QAAQ,EAAE,mBAAmB,EAAE,CAAC;IAChC,qEAAqE;IACrE,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,mEAAmE;IACnE,KAAK,CAAC,EAAE,YAAY,CAAC;IACrB,wDAAwD;IACxD,QAAQ,CAAC,EAAE,cAAc,CAAC;IAC1B,KAAK,CAAC,EAAE,iBAAiB,GAAG;QAAE,KAAK,EAAE,YAAY,CAAA;KAAE,CAAC;CACrD;AAID;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,mBAAmB,GAAG,oBAAoB,CA2ClF"}

package/dist/evolution/run.js

@@ -0,0 +1,258 @@
+import { runAudit } from '../engine/audit.js';
+import { detect, loadDetectorFile } from '../detect/index.js';
+import { Project } from '../util/project.js';
+import { canonicalJson, hashText, snapshotOfProject } from '../snapshot/index.js';
+import { computeCoverage } from './coverage.js';
+import { deriveGaps } from './gap.js';
+import { basePackIds, resolveCapabilitySetId } from './capability.js';
+import { runBenchmark } from './benchmark.js';
+import { DEFAULT_RELEASE_GATE, evaluateRelease } from './release.js';
+import { proposeCandidates, proposeFromSuggestions } from './propose.js';
+import { learnFromReport } from '../learn/index.js';
+import { GapQueue } from './queue.js';
+import { scheduleCandidates } from './schedule.js';
+const OPEN = new Set(['FAIL', 'WRONG', 'MISSING', 'DEPRECATED', 'EXPERIMENTAL']);
+/**
+ * The full, deterministic evolution cycle:
+ *
+ *     SNAPSHOT → AUDIT → COVERAGE → GAPS → (CANDIDATE → BENCHMARK → RELEASE)
+ *              → RE-AUDIT → DELTA
+ *
+ * No LLM is required: every stage is a deterministic function of the snapshot +
+ * capability set + engine version. Records written to the Store are
+ * content-addressed and reproducible.
+ */
+export function runEvolutionCycle(input) {
+    const engineVersion = input.engineVersion ?? 'dev';
+    const snapshot = makeSnapshot(input.target);
+    const before = audit(input, snapshot, engineVersion, [], input.repository);
+    const out = { snapshot, before, proposed: [] };
+    const queue = useQueue(input);
+    if (queue) {
+        queue.recordGaps(before.gaps);
+        out.queue = queue.summarize();
+    }
+    const candidate = resolveCandidate(input, before, out);
+    if (isAllGapsMode(input)) {
+        runAllGaps(input, snapshot, before, out, queue, engineVersion);
+        return out;
+    }
+    if (!candidate)
+        return out;
+    const gate = input.releaseGate ?? DEFAULT_RELEASE_GATE;
+    const bench = runBenchmark(candidate, input.benchmarkCases ?? [], input.rulesDir, engineVersion);
+    const release = evaluateRelease(bench, gate);
+    // Gaps this candidate provably targets, by required capability. This drives
+    // the queue — it must be exact, never a "the candidate is about everything"
+    // fallback, or an unrelated release would close unrelated gaps.
+    const targeted = before.gaps
+        .filter((g) => g.requiredCapability === candidate.id)
+        .map((g) => g.id);
+    out.candidate = {
+        capabilityId: candidate.id,
+        gapIds: targeted,
+        release,
+    };
+    input.store?.put({ kind: 'benchmark', capabilityId: candidate.id, ...bench });
+    input.store?.put({ kind: 'release', capabilityId: candidate.id, ...release });
+    if (release.decision === 'ACCEPT') {
+        const after = audit(input, snapshot, engineVersion, [candidate], input.repository);
+        out.after = { ...after, delta: compareReAudit(before, after) };
+        releaseIntoQueue(queue, out, candidate, targeted);
+    }
+    return out;
+}
+/**
+ * Whether this run should sweep every proposable candidate. Only an explicit
+ * `allGaps` with no explicit candidate and no report to learn from qualifies;
+ * everything else keeps the single-candidate behavior.
+ */
+function isAllGapsMode(input) {
+    return !!input.allGaps && !input.candidateCapability && !input.learnReportPath;
+}
+/**
+ * The batch, queue-driven half of the loop: evaluate EVERY proposable
+ * candidate (one per open gap) through the scheduler. The first RELEASED
+ * candidate defines the output `candidate` and drives a single re-audit; if
+ * nothing releases, `candidate` reflects the first attempt and `after` stays
+ * undefined. Never runs the single-candidate path, so nothing is benchmarked
+ * twice.
+ */
+function runAllGaps(input, snapshot, before, out, queue, engineVersion) {
+    const proposed = proposeCandidates(before.coverage, before.gaps, {
+        createdBy: 'evolution:propose',
+        onUnproposable: input.onUnproposable,
+    });
+    out.proposed = proposed;
+    const result = scheduleCandidates({
+        candidates: proposed,
+        gaps: before.gaps,
+        benchmarkCases: input.benchmarkCases,
+        rulesDir: input.rulesDir,
+        engineVersion,
+        releaseGate: input.releaseGate,
+        queue,
+        persist: input.store ? (kind, body) => input.store.put({ kind, ...body }) : undefined,
+    });
+    out.schedule = result;
+    if (queue)
+        out.queue = queue.summarize();
+    const firstReleased = result.candidates.find((c) => c.outcome === 'RELEASED');
+    const primary = firstReleased ?? result.candidates[0];
+    if (!primary)
+        return;
+    out.candidate = {
+        capabilityId: primary.capabilityId,
+        gapIds: primary.gapIds,
+        release: primary.release,
+    };
+    if (!firstReleased)
+        return;
+    const capability = proposed.find((c) => c.capability.id === firstReleased.capabilityId)?.capability;
+    if (!capability)
+        return;
+    const after = audit(input, snapshot, engineVersion, [capability], input.repository);
+    out.after = { ...after, delta: compareReAudit(before, after) };
+}
+/** A released capability closes exactly the queue gaps it targeted. */
+function releaseIntoQueue(queue, out, candidate, targeted) {
+    if (!queue || targeted.length === 0)
+        return;
+    queue.closeGaps(targeted, `released ${candidate.id}@${candidate.version ?? '?'}`);
+    out.queue = queue.summarize();
+}
+/** The persistent gap queue, when a store backs this run. */
+function useQueue(input) {
+    const enabled = input.persistGaps ?? input.store !== undefined;
+    if (!enabled || !input.store)
+        return undefined;
+    return new GapQueue(input.store);
+}
+/**
+ * Choose the capability to benchmark: the explicit one, or the first candidate
+ * auto-proposed from the BEFORE gaps. When proposing, all proposals are
+ * recorded on the output (even though only the first is evaluated this run).
+ */
+function resolveCandidate(input, before, out) {
+    if (input.candidateCapability)
+        return input.candidateCapability;
+    if (input.learnReportPath)
+        return learnCandidate(input, out);
+    if (!input.proposeFromGaps)
+        return undefined;
+    const proposed = proposeCandidates(before.coverage, before.gaps, {
+        createdBy: 'evolution:propose',
+        onUnproposable: input.onUnproposable,
+    });
+    out.proposed = proposed;
+    return proposed[0]?.capability;
+}
+/** Turn a report's open findings into a `learn-proposals` candidate. */
+function learnCandidate(input, out) {
+    let suggestions;
+    try {
+        suggestions = learnFromReport({
+            reportPath: input.learnReportPath,
+            minSeverity: input.learnMinSeverity,
+        });
+    }
+    catch (err) {
+        // A malformed/foreign report must not abort the audit: warn and continue
+        // with the BEFORE half (consistent with ADR-0009: fail closed, not crash).
+        input.onUnproposable?.({ id: 'learn-proposals' }, `could not learn from ${input.learnReportPath}: ${err.message}`);
+        return undefined;
+    }
+    out.learnedSuggestions = suggestions.length;
+    const candidate = proposeFromSuggestions(suggestions, { createdBy: 'evolution:learn' });
+    if (!candidate) {
+        input.onUnproposable?.({ id: 'learn-proposals' }, `no actionable suggestions in ${input.learnReportPath}`);
+        return undefined;
+    }
+    out.proposed = [candidate];
+    return candidate.capability;
+}
+/* -------------------------------------------------------------------- core -- */
+function makeSnapshot(target) {
+    const project = new Project(target);
+    const git = project.gitInfo();
+    return snapshotOfProject(project, git.isRepo ? { commit: git.commit, ref: git.ref, repoUrl: git.repoUrl } : null);
+}
+function audit(input, snapshot, engineVersion, extraCapabilities, repository) {
+    const started = new Date().toISOString();
+    const outcome = runAudit({
+        target: snapshot.root,
+        rulesDir: input.rulesDir,
+        usaVersion: engineVersion,
+        extraPacks: extraCapabilities.map((c) => c.pack).filter((p) => !!p),
+    });
+    const report = outcome.report;
+    // Capability set identity is resolved from the *same* rules dir the audit
+    // used, so the reproducibility boundary is exactly what ran.
+    const capabilitySetId = resolveCapabilitySetId(basePackIds(report.options.rulesDir), extraCapabilities, engineVersion);
+    const project = new Project(snapshot.root);
+    const git = project.gitInfo();
+    const detection = detect(project, loadDetectorFile(report.options.rulesDir), git, []);
+    const facts = detection.facts;
+    const extraLangs = extraCapabilities.flatMap((c) => c.languages ?? []);
+    const coverage = computeCoverage(report, facts, extraLangs);
+    const resultId = input.store ? input.store.put(report) : undefined;
+    const body = {
+        repository: repository ?? git.repoUrl ?? snapshot.root,
+        snapshotId: snapshot.id,
+        capabilitySetId,
+        engineVersion,
+        status: 'completed',
+        startedAt: started,
+        endedAt: new Date().toISOString(),
+        resultId,
+        provenance: {},
+    };
+    // The run's identity is its content address (stored without an `id` field so
+    // the address is exactly the hash of the stored bytes, hence retrievable).
+    const auditRunId = input.store ? input.store.put(body) : hashText(canonicalJson(body));
+    const runRecord = { id: auditRunId, ...body };
+    const gaps = deriveGaps(coverage, auditRunId, snapshot.id);
+    return { report, facts, coverage, gaps, capabilitySetId, auditRunId, runRecord };
+}
+/* ------------------------------------------------------------------ delta -- */
+function openStatuses(report) {
+    const map = new Map();
+    for (const f of report.findings)
+        map.set(f.ruleId, f.status);
+    return map;
+}
+function compareReAudit(before, after) {
+    const gapReduced = before.gaps.some((g) => g.kind === 'unsupported-technology' && after.coverage.coveredLanguages.includes(g.target));
+    const b = openStatuses(before.report);
+    const a = openStatuses(after.report);
+    const findingsAdded = [];
+    const findingsRemoved = [];
+    for (const id of new Set([...b.keys(), ...a.keys()])) {
+        const was = b.get(id) ?? 'NOT_APPLICABLE';
+        const is = a.get(id) ?? 'NOT_APPLICABLE';
+        const wasOpen = OPEN.has(was);
+        const isOpen = OPEN.has(is);
+        if (!wasOpen && isOpen)
+            findingsAdded.push(id);
+        else if (wasOpen && !isOpen)
+            findingsRemoved.push(id);
+    }
+    return {
+        before: {
+            automationCoverage: before.coverage.automationCoverage,
+            languageCoverage: before.coverage.languageCoverage,
+            unsupported: before.coverage.unsupportedLanguages,
+        },
+        after: {
+            automationCoverage: after.coverage.automationCoverage,
+            languageCoverage: after.coverage.languageCoverage,
+            unsupported: after.coverage.unsupportedLanguages,
+        },
+        coverageDelta: after.coverage.languageCoverage - before.coverage.languageCoverage,
+        findingsAdded,
+        findingsRemoved,
+        gapReduced,
+        intendedFindingDetectable: findingsAdded.length > 0,
+    };
+}
+//# sourceMappingURL=run.js.map

package/dist/evolution/run.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run.js","sourceRoot":"","sources":["../../src/evolution/run.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,iBAAiB,EAAiB,MAAM,sBAAsB,CAAC;AAGjG,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,oBAAoB,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AACrE,OAAO,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AACzE,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAqB,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,kBAAkB,EAAuB,MAAM,eAAe,CAAC;AAoFxE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC,CAAC;AAEjF;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAA0B;IAC1D,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC;IACnD,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,EAAE,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAE3E,MAAM,GAAG,GAAyB,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACrE,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,KAAK,EAAE,CAAC;QACV,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9B,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;IAChC,CAAC;IAED,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACvD,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;QAC/D,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,CAAC,SAAS;QAAE,OAAO,GAAG,CAAC;IAE3B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,IAAI,oBAAoB,CAAC;IACvD,MAAM,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,KAAK,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IACjG,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC7C,4EAA4E;IAC5E,4EAA4E;IAC5E,gEAAgE;IAChE,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,KAAK,SAAS,CAAC,EAAE,CAAC;SACpD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,GAAG,CAAC,SAAS,GAAG;QACd,YAAY,EAAE,SAAS,CAAC,EAAE;QAC1B,MAAM,EAAE,QAAQ;QAChB,OAAO;KACR,CAAC;IACF,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;IAC9E,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;IAE9E,IAAI,OAAO,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;QACnF,GAAG,CAAC,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;QAC/D,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,KAA0B;IAC/C,OAAO,CAAC,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,mBAAmB,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC;AACjF,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,UAAU,CACjB,KAA0B,EAC1B,QAAkB,EAClB,MAAyB,EACzB,GAAyB,EACzB,KAA2B,EAC3B,aAAqB;IAErB,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE;QAC/D,SAAS,EAAE,mBAAmB;QAC9B,cAAc,EAAE,KAAK,CAAC,cAAc;KACrC,CAAC,CAAC;IACH,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAExB,MAAM,MAAM,GAAG,kBAAkB,CAAC;QAChC,UAAU,EAAE,QAAQ;QACpB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,cAAc,EAAE,KAAK,CAAC,cAAc;QACpC,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,aAAa;QACb,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,KAAK;QACL,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,KAAM,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS;KACvF,CAAC,CAAC;IACH,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC;IACtB,IAAI,KAAK;QAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;IAEzC,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC;IAC9E,MAAM,OAAO,GAAG,aAAa,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACtD,IAAI,CAAC,OAAO;QAAE,OAAO;IAErB,GAAG,CAAC,SAAS,GAAG;QACd,YAAY,EAAE,OAAO,CAAC,YAAY;QAClC,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,OAAO,EAAE,OAAO,CAAC,OAAO;KACzB,CAAC;IACF,IAAI,CAAC,aAAa;QAAE,OAAO;IAE3B,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,KAAK,aAAa,CAAC,YAAY,CACtD,EAAE,UAAU,CAAC;IACd,IAAI,CAAC,UAAU;QAAE,OAAO;IACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACpF,GAAG,CAAC,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;AACjE,CAAC;AAED,uEAAuE;AACvE,SAAS,gBAAgB,CACvB,KAA2B,EAC3B,GAAyB,EACzB,SAAqB,EACrB,QAAkB;IAElB,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAC5C,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,YAAY,SAAS,CAAC,EAAE,IAAI,SAAS,CAAC,OAAO,IAAI,GAAG,EAAE,CAAC,CAAC;IAClF,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;AAChC,CAAC;AAED,6DAA6D;AAC7D,SAAS,QAAQ,CAAC,KAA0B;IAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC;IAC/D,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAC/C,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,KAA0B,EAC1B,MAAyB,EACzB,GAAyB;IAEzB,IAAI,KAAK,CAAC,mBAAmB;QAAE,OAAO,KAAK,CAAC,mBAAmB,CAAC;IAChE,IAAI,KAAK,CAAC,eAAe;QAAE,OAAO,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC7D,IAAI,CAAC,KAAK,CAAC,eAAe;QAAE,OAAO,SAAS,CAAC;IAC7C,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE;QAC/D,SAAS,EAAE,mBAAmB;QAC9B,cAAc,EAAE,KAAK,CAAC,cAAc;KACrC,CAAC,CAAC;IACH,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC;IACxB,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC;AACjC,CAAC;AAED,wEAAwE;AACxE,SAAS,cAAc,CACrB,KAA0B,EAC1B,GAAyB;IAEzB,IAAI,WAAW,CAAC;IAChB,IAAI,CAAC;QACH,WAAW,GAAG,eAAe,CAAC;YAC5B,UAAU,EAAE,KAAK,CAAC,eAAgB;YAClC,WAAW,EAAE,KAAK,CAAC,gBAAgB;SACpC,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,yEAAyE;QACzE,2EAA2E;QAC3E,KAAK,CAAC,cAAc,EAAE,CACpB,EAAE,EAAE,EAAE,iBAAiB,EAAmB,EAC1C,wBAAwB,KAAK,CAAC,eAAe,KAAM,GAAa,CAAC,OAAO,EAAE,CAC3E,CAAC;QACF,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,GAAG,CAAC,kBAAkB,GAAG,WAAW,CAAC,MAAM,CAAC;IAC5C,MAAM,SAAS,GAAG,sBAAsB,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC,CAAC;IACxF,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,KAAK,CAAC,cAAc,EAAE,CACpB,EAAE,EAAE,EAAE,iBAAiB,EAAmB,EAC1C,gCAAgC,KAAK,CAAC,eAAe,EAAE,CACxD,CAAC;QACF,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,GAAG,CAAC,QAAQ,GAAG,CAAC,SAAS,CAAC,CAAC;IAC3B,OAAO,SAAS,CAAC,UAAU,CAAC;AAC9B,CAAC;AAED,kFAAkF;AAElF,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IAC9B,OAAO,iBAAiB,CACtB,OAAO,EACP,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAC/E,CAAC;AACJ,CAAC;AAED,SAAS,KAAK,CACZ,KAA0B,EAC1B,QAAkB,EAClB,aAAqB,EACrB,iBAA+B,EAC/B,UAA8B;IAE9B,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAEzC,MAAM,OAAO,GAAG,QAAQ,CAAC;QACvB,MAAM,EAAE,QAAQ,CAAC,IAAI;QACrB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,UAAU,EAAE,aAAa;QACzB,UAAU,EAAE,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAA8B,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;KAChG,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAE9B,0EAA0E;IAC1E,6DAA6D;IAC7D,MAAM,eAAe,GAAG,sBAAsB,CAC5C,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EACpC,iBAAiB,EACjB,aAAa,CACd,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,EAAE,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IACtF,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;IAE9B,MAAM,UAAU,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IACvE,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;IAE5D,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnE,MAAM,IAAI,GAAyB;QACjC,UAAU,EAAE,UAAU,IAAI,GAAG,CAAC,OAAO,IAAI,QAAQ,CAAC,IAAI;QACtD,UAAU,EAAE,QAAQ,CAAC,EAAE;QACvB,eAAe;QACf,aAAa;QACb,MAAM,EAAE,WAAW;QACnB,SAAS,EAAE,OAAO;QAClB,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,QAAQ;QACR,UAAU,EAAE,EAAE;KACf,CAAC;IACF,6EAA6E;IAC7E,2EAA2E;IAC3E,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;IACvF,MAAM,SAAS,GAAa,EAAE,EAAE,EAAE,UAAU,EAAE,GAAG,IAAI,EAAE,CAAC;IACxD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;IAE3D,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,eAAe,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;AACnF,CAAC;AAED,iFAAiF;AAEjF,SAAS,YAAY,CAAC,MAAmB;IACvC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC7D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,cAAc,CAAC,MAAyB,EAAE,KAAwB;IACzE,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,wBAAwB,IAAI,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAC5F,CAAC;IAEF,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;QACrD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,gBAAgB,CAAC;QAC1C,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,gBAAgB,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,CAAC,OAAO,IAAI,MAAM;YAAE,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC1C,IAAI,OAAO,IAAI,CAAC,MAAM;YAAE,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,OAAO;QACL,MAAM,EAAE;YACN,kBAAkB,EAAE,MAAM,CAAC,QAAQ,CAAC,kBAAkB;YACtD,gBAAgB,EAAE,MAAM,CAAC,QAAQ,CAAC,gBAAgB;YAClD,WAAW,EAAE,MAAM,CAAC,QAAQ,CAAC,oBAAoB;SAClD;QACD,KAAK,EAAE;YACL,kBAAkB,EAAE,KAAK,CAAC,QAAQ,CAAC,kBAAkB;YACrD,gBAAgB,EAAE,KAAK,CAAC,QAAQ,CAAC,gBAAgB;YACjD,WAAW,EAAE,KAAK,CAAC,QAAQ,CAAC,oBAAoB;SACjD;QACD,aAAa,EAAE,KAAK,CAAC,QAAQ,CAAC,gBAAgB,GAAG,MAAM,CAAC,QAAQ,CAAC,gBAAgB;QACjF,aAAa;QACb,eAAe;QACf,UAAU;QACV,yBAAyB,EAAE,aAAa,CAAC,MAAM,GAAG,CAAC;KACpD,CAAC;AACJ,CAAC"}

package/dist/evolution/schedule.d.ts

@@ -0,0 +1,59 @@
+import type { GapQueue } from './queue.js';
+import type { BenchmarkCase, BenchmarkResult, CandidateCapability, CapabilityGap, ReleaseDecision, ReleaseGate } from './types.js';
+/**
+ * The queue-driven scheduler: the unattended half of the loop.
+ *
+ * A single cycle evaluates one candidate. The scheduler walks a *batch* of
+ * candidates (one per open gap, produced by the proposal stage) and runs each
+ * through BENCHMARK → RELEASE, closing the queue gap for every accepted
+ * capability. It is still fully deterministic and offline: the same candidates,
+ * cases, and gate produce the same outcome list, and nothing is ever registered.
+ *
+ * The scheduler never proposes and never audits — it is a pure coordination of
+ * the stages that already exist, so it cannot invent work the proposal and gate
+ * steps would not have produced anyway.
+ */
+export interface ScheduledCandidate {
+    capabilityId: string;
+    /** Gaps this candidate targeted (by required capability). */
+    gapIds: string[];
+    release: ReleaseDecision;
+    outcome: 'RELEASED' | 'REJECTED';
+    /** Queue gaps actually closed by this release (empty when rejected). */
+    closedGapIds: string[];
+    benchmark: BenchmarkResult;
+    /**
+     * Set when the scheduler overrode an ACCEPT to a REJECT because the candidate
+     * offers no automated detection to prove (e.g. only `manual` checks).
+     */
+    blockedReason?: string;
+}
+export interface ScheduleResult {
+    attempted: number;
+    released: number;
+    rejected: number;
+    candidates: ScheduledCandidate[];
+}
+export interface ScheduleInput {
+    /** Candidates to evaluate, in the order they should be attempted. */
+    candidates: CandidateCapability[];
+    /** The BEFORE gaps, used to map each candidate to the gaps it targets. */
+    gaps: CapabilityGap[];
+    benchmarkCases?: BenchmarkCase[];
+    rulesDir?: string;
+    engineVersion?: string;
+    releaseGate?: ReleaseGate;
+    /** When present, accepted candidates close their targeted gaps. */
+    queue?: GapQueue;
+    /** Persist benchmark + release records (needs a store). */
+    persist?: (kind: 'benchmark' | 'release', body: Record<string, unknown>) => void;
+}
+/**
+ * Evaluate every candidate in order and return one outcome per candidate.
+ *
+ * The order is significant and preserved: the caller (which sorted gaps by
+ * priority then id) decides what "first" means. Each candidate is independent,
+ * so a rejection never blocks a later release.
+ */
+export declare function scheduleCandidates(input: ScheduleInput): ScheduleResult;
+//# sourceMappingURL=schedule.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"schedule.d.ts","sourceRoot":"","sources":["../../src/evolution/schedule.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC3C,OAAO,KAAK,EACV,aAAa,EACb,eAAe,EACf,mBAAmB,EACnB,aAAa,EACb,eAAe,EACf,WAAW,EACZ,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;;;;GAYG;AAEH,MAAM,WAAW,kBAAkB;IACjC,YAAY,EAAE,MAAM,CAAC;IACrB,6DAA6D;IAC7D,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,OAAO,EAAE,eAAe,CAAC;IACzB,OAAO,EAAE,UAAU,GAAG,UAAU,CAAC;IACjC,wEAAwE;IACxE,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,SAAS,EAAE,eAAe,CAAC;IAC3B;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,kBAAkB,EAAE,CAAC;CAClC;AAED,MAAM,WAAW,aAAa;IAC5B,qEAAqE;IACrE,UAAU,EAAE,mBAAmB,EAAE,CAAC;IAClC,0EAA0E;IAC1E,IAAI,EAAE,aAAa,EAAE,CAAC;IACtB,cAAc,CAAC,EAAE,aAAa,EAAE,CAAC;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,mEAAmE;IACnE,KAAK,CAAC,EAAE,QAAQ,CAAC;IACjB,2DAA2D;IAC3D,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,GAAG,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,IAAI,CAAC;CAClF;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,aAAa,GAAG,cAAc,CAIvE"}

package/dist/evolution/schedule.js

@@ -0,0 +1,77 @@
+import { runBenchmark } from './benchmark.js';
+import { evaluateRelease, DEFAULT_RELEASE_GATE } from './release.js';
+/**
+ * Evaluate every candidate in order and return one outcome per candidate.
+ *
+ * The order is significant and preserved: the caller (which sorted gaps by
+ * priority then id) decides what "first" means. Each candidate is independent,
+ * so a rejection never blocks a later release.
+ */
+export function scheduleCandidates(input) {
+    const gate = input.releaseGate ?? DEFAULT_RELEASE_GATE;
+    const candidates = input.candidates.map((candidate) => evaluateCandidate(candidate, input, gate));
+    return summarize(candidates);
+}
+/** Benchmark → gate → (release ⇒ close) for one candidate. */
+function evaluateCandidate(candidate, input, gate) {
+    const benchmark = runBenchmark(candidate.capability, input.benchmarkCases ?? [], input.rulesDir, input.engineVersion ?? 'dev');
+    const release = evaluateRelease(benchmark, gate);
+    const gapIds = targetedGapIds(input.gaps, candidate.capability.id);
+    input.persist?.('benchmark', { capabilityId: candidate.capability.id, ...benchmark });
+    input.persist?.('release', { capabilityId: candidate.capability.id, ...release });
+    // A gate ACCEPT only proves the candidate matches its fixtures. A candidate
+    // whose pack is entirely `manual` checks proves nothing automated: every
+    // `manual` check is UNKNOWN, so it trivially has zero FP/FN and would pass
+    // on a vacuous benchmark. Releasing it would close a real gap with a
+    // capability that detects nothing — so the scheduler refuses.
+    const blockedReason = release.decision === 'ACCEPT' ? unbenchmarkable(candidate) : undefined;
+    const released = release.decision === 'ACCEPT' && blockedReason === undefined;
+    const entry = {
+        capabilityId: candidate.capability.id,
+        gapIds,
+        release,
+        outcome: released ? 'RELEASED' : 'REJECTED',
+        closedGapIds: released ? closeTargets(input, candidate, gapIds) : [],
+        benchmark,
+    };
+    if (blockedReason)
+        entry.blockedReason = blockedReason;
+    return entry;
+}
+/** Close the queue gaps a released candidate targets (empty when no queue). */
+function closeTargets(input, candidate, gapIds) {
+    if (!input.queue)
+        return [];
+    return input.queue.closeGaps(gapIds, `released ${candidate.capability.id}@${candidate.capability.version ?? '?'}`);
+}
+/**
+ * Why a candidate must not be released despite a passing gate, or undefined if
+ * it is genuinely releasable. Today: a pack with no automated (non-`manual`)
+ * rule cannot be proven to detect anything.
+ */
+function unbenchmarkable(candidate) {
+    const rules = candidate.capability.pack?.rules ?? [];
+    if (rules.length === 0)
+        return 'capability contributes no rules';
+    const automated = rules.filter((r) => r.check.kind !== 'manual');
+    if (automated.length === 0) {
+        return `only manual checks (${rules.length}) — no automated detection to prove`;
+    }
+    return undefined;
+}
+/** Gaps a candidate provably targets, by required capability. Never a fallback. */
+function targetedGapIds(gaps, capabilityId) {
+    return gaps.filter((g) => g.requiredCapability === capabilityId).map((g) => g.id);
+}
+function summarize(candidates) {
+    let released = 0;
+    let rejected = 0;
+    for (const c of candidates) {
+        if (c.outcome === 'RELEASED')
+            released += 1;
+        else
+            rejected += 1;
+    }
+    return { attempted: candidates.length, released, rejected, candidates };
+}
+//# sourceMappingURL=schedule.js.map

package/dist/evolution/schedule.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schedule.js","sourceRoot":"","sources":["../../src/evolution/schedule.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AA+DrE;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAoB;IACrD,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,IAAI,oBAAoB,CAAC;IACvD,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,iBAAiB,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IAClG,OAAO,SAAS,CAAC,UAAU,CAAC,CAAC;AAC/B,CAAC;AAED,8DAA8D;AAC9D,SAAS,iBAAiB,CACxB,SAA8B,EAC9B,KAAoB,EACpB,IAAiB;IAEjB,MAAM,SAAS,GAAG,YAAY,CAC5B,SAAS,CAAC,UAAU,EACpB,KAAK,CAAC,cAAc,IAAI,EAAE,EAC1B,KAAK,CAAC,QAAQ,EACd,KAAK,CAAC,aAAa,IAAI,KAAK,CAC7B,CAAC;IACF,MAAM,OAAO,GAAG,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;IACnE,KAAK,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,EAAE,YAAY,EAAE,SAAS,CAAC,UAAU,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,CAAC;IACtF,KAAK,CAAC,OAAO,EAAE,CAAC,SAAS,EAAE,EAAE,YAAY,EAAE,SAAS,CAAC,UAAU,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;IAElF,4EAA4E;IAC5E,yEAAyE;IACzE,2EAA2E;IAC3E,qEAAqE;IACrE,8DAA8D;IAC9D,MAAM,aAAa,GAAG,OAAO,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,KAAK,QAAQ,IAAI,aAAa,KAAK,SAAS,CAAC;IAE9E,MAAM,KAAK,GAAuB;QAChC,YAAY,EAAE,SAAS,CAAC,UAAU,CAAC,EAAE;QACrC,MAAM;QACN,OAAO;QACP,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU;QAC3C,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;QACpE,SAAS;KACV,CAAC;IACF,IAAI,aAAa;QAAE,KAAK,CAAC,aAAa,GAAG,aAAa,CAAC;IACvD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAC/E,SAAS,YAAY,CACnB,KAAoB,EACpB,SAA8B,EAC9B,MAAgB;IAEhB,IAAI,CAAC,KAAK,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IAC5B,OAAO,KAAK,CAAC,KAAK,CAAC,SAAS,CAC1B,MAAM,EACN,YAAY,SAAS,CAAC,UAAU,CAAC,EAAE,IAAI,SAAS,CAAC,UAAU,CAAC,OAAO,IAAI,GAAG,EAAE,CAC7E,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,SAA8B;IACrD,MAAM,KAAK,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;IACrD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,iCAAiC,CAAC;IACjE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IACjE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,uBAAuB,KAAK,CAAC,MAAM,qCAAqC,CAAC;IAClF,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,mFAAmF;AACnF,SAAS,cAAc,CAAC,IAAqB,EAAE,YAAoB;IACjE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,KAAK,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,SAAS,CAAC,UAAgC;IACjD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,OAAO,KAAK,UAAU;YAAE,QAAQ,IAAI,CAAC,CAAC;;YACvC,QAAQ,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AAC1E,CAAC"}