@descryy/core 0.1.0

package/dist/tiers/certify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"certify.d.ts","sourceRoot":"","sources":["../../src/tiers/certify.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAEzF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EAAU,KAAK,WAAW,EAAE,KAAK,IAAI,EAA0B,MAAM,aAAa,CAAC;AAM1F;;;;;;;GAOG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC;IACtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAC1B;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiCG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,aAAa,CAAC;IAClC,kEAAkE;IAClE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC;;;OAGG;IACH,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC;IAC9B,qEAAqE;IACrE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B;;;;;;;;;;;;;;;;OAgBG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;CACzG;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,UAAU,EAAE,eAAe,CAAC;IACrC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;CACjC;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,YAAY,EAAE,gBAAgB,CAAC;IACxC,2EAA2E;IAC3E,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IAChD,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IAChD,QAAQ,CAAC,WAAW,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACrD,QAAQ,CAAC,cAAc,EAAE,SAAS,aAAa,EAAE,CAAC;IAClD;;;;;;;;;OASG;IACH,QAAQ,CAAC,kBAAkB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAChD;;;;;;;;;;;;;;;;;;;;;;;;;;OA0BG;IACH,QAAQ,CAAC,gBAAgB,CAAC,EAAE,SAAS,eAAe,EAAE,CAAC;IACvD;;;;OAIG;IACH,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC;CAC5C;AAED,wEAAwE;AACxE,MAAM,WAAW,eAAe;IAC9B,gDAAgD;IAChD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wEAAwE;IACxE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,WAAW,SAAS;IACxB,gDAAgD;IAChD,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,gDAAgD;IAChD,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,gCAAgC;IAChC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB;;;;;;OAMG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,yFAAyF;IACzF,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAMD,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC;CACvC;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;IAClC,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,8EAA8E;IAC9E,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAC3B,yEAAyE;IACzE,QAAQ,CAAC,QAAQ,EAAE,IAAI,GAAG,IAAI,CAAC;IAC/B,QAAQ,CAAC,YAAY,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACnD,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,gBAAgB,EAAE,CAAC,CAAC,CAAC;IACrE;;;OAGG;IACH,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;IACvC;;;;;;OAMG;IACH,QAAQ,CAAC,iBAAiB,EAAE,SAAS,CAAC,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC;IAC5D;;;;;OAKG;IACH,QAAQ,CAAC,WAAW,EAAE,SAAS,eAAe,EAAE,CAAC;IACjD;;;;OAIG;IACH,QAAQ,CAAC,UAAU,EAAE,SAAS,SAAS,EAAE,CAAC;IAC1C;;;;;;;;OAQG;IACH,QAAQ,CAAC,eAAe,EAAE,SAAS,eAAe,EAAE,CAAC;IACrD,kEAAkE;IAClE,QAAQ,CAAC,kBAAkB,EAAE,OAAO,GAAG,SAAS,CAAC;CAClD;AA4SD,wBAAgB,OAAO,CAAC,QAAQ,EAAE,YAAY,GAAG,eAAe,CA6E/D;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,eAAe,GAAG,MAAM,CA+CtE"}

package/dist/tiers/certify.js

@@ -0,0 +1,434 @@
+/**
+ * The capability-tier generator. DEC-075 §6, in code.
+ *
+ * > *"A tier is generated from `capabilities()`, never written in prose, and may
+ * > be published for a language only when the corpus passes at the resolution
+ * > the tier claims, a ≥200-edge precision draw passes on at least two
+ * > repositories the adapter's author did not choose, and `capabilities()`
+ * > declares exactly the node and edge types the adapter emitted."*
+ *
+ * ## The design point: this thing exists to say no
+ *
+ * A generator that awards a tier to everything it is shown is a rubber stamp
+ * with a build step. The output that matters is **the row that failed**, which
+ * is why `unmet` is a list of requirements with their statements rather than a
+ * boolean, and why `certify` never returns a bare tier without also returning
+ * what the next tier up is missing.
+ *
+ * Two rules follow from that, and both are the opposite of what is convenient:
+ *
+ * 1. **Absent evidence is not a pass.** No precision draw recorded means the
+ *    attested requirement is unmet, exactly as if a recorded draw had failed.
+ *    The alternative — treating silence as satisfaction — is how every unearned
+ *    claim in this repository would have been generated.
+ * 2. **An attested requirement is labelled attested, in the output, always.**
+ *    A machine can check "≥200 edges" and "two repositories". It cannot check
+ *    *"the author did not choose them"*, because that is a fact about a person's
+ *    intent. Marking it as declared-by-a-human is what stops this function
+ *    laundering a judgement into a computed result. `certify` therefore reports
+ *    `attestedBy` alongside the tier, and a consumer that prints the tier
+ *    without it has dropped the only part that says who is responsible.
+ *
+ * ## What it does not do
+ *
+ * It does not run the conformance harness or the precision benches. It is given
+ * their results. That keeps it pure and testable, and it keeps the awkward fact
+ * visible: the precision evidence is **recorded by hand today**, because the
+ * benches are throwaway scripts that print to a terminal. `GateEvidence` is
+ * where that hand-recording is written down and dated, rather than living in a
+ * decision document that nothing reads.
+ */
+import { LADDER, TIERS, requirementsFor } from "./ladder.js";
+// ---------------------------------------------------------------------------
+// Checking one requirement
+// ---------------------------------------------------------------------------
+const MIN_DRAW = 200;
+const MIN_PRECISION = 0.98;
+const MAX_CONTROL = 0.02;
+/**
+ * Reused, not reinvented: `bench/lib/stats.mjs`'s own `TYPE_FLOOR`, the
+ * threshold every precision bench already applies before trusting a single
+ * edge type's own precision figure within a draw ("every type with >= 20
+ * samples >= 95%"). `bench/` cannot be imported from `packages/core` — the
+ * dependency runs the other way — so the value is restated here, under the
+ * same name, rather than a second number with no name tying it to the first.
+ * User-ruled (2026-08-17): a capability that moves a language's tier needs
+ * this many decided rows of its OWN edge type in the draws, not just an
+ * aggregate pass — see `checkCapability`'s use of `PrecisionDraw.perEdgeType`.
+ */
+const TYPE_FLOOR = 20;
+const REPOSITORIES_REQUIRED = 2;
+function missing(wanted, have) {
+    if (wanted === undefined)
+        return [];
+    const present = new Set(have);
+    return wanted.filter((w) => !present.has(w));
+}
+function checkCapability(requirement, evidence) {
+    const caps = evidence.capabilities;
+    const gaps = [];
+    const unexercised = new Set(evidence.unpublishableTypes ?? []);
+    const nodeGap = missing(requirement.nodeTypes, caps.nodeTypes);
+    if (nodeGap.length > 0)
+        gaps.push(`capabilities() declares no ${nodeGap.join(", ")}`);
+    const edgeGap = missing(requirement.edgeTypes, caps.edgeTypes);
+    if (edgeGap.length > 0)
+        gaps.push(`capabilities() declares no ${edgeGap.join(", ")}`);
+    // Declared, but nothing in the corpus exercised it. `checkManifest` calls
+    // these `unpublishable`; a tier is exactly the publication they are unfit for.
+    const untested = [...(requirement.nodeTypes ?? []), ...(requirement.edgeTypes ?? [])].filter((t) => unexercised.has(t));
+    if (untested.length > 0) {
+        gaps.push(`${untested.join(", ")} is declared but no corpus pattern exercises it`);
+    }
+    if (requirement.minResolution !== undefined && caps.maxResolution < requirement.minResolution) {
+        gaps.push(`maxResolution is R${caps.maxResolution}, below R${requirement.minResolution}`);
+    }
+    // User-ruled type-floor check, second form. Declaring an edge type is not
+    // the same claim as having validated it: a mixed draw can clear its own
+    // aggregate bar while sampling almost none of one specific type it
+    // declares — Kotlin's `A.callers` passed on one decided `USES_API` row
+    // before this existed. The first version of this check no-opped when no
+    // draw carried `perEdgeType` at all, reasoning it should not newly fail a
+    // capability it had no evidence about. **That reasoning was itself the
+    // bug**: Swift's `A.callers` slipped through exactly that no-op the
+    // moment its `capabilities()` gained `USES_API` from a concurrent commit,
+    // because absence of per-type evidence read as satisfaction rather than
+    // as an open question. Absence of evidence is not evidence of validation,
+    // for a capability requirement any more than it was for `checkPrecisionDraws`'s
+    // staleness flag or the four hardcoded-path scripts this same pass found —
+    // the same defect class, four more times.
+    //
+    // So: a declared type with NO `perEdgeType` recorded anywhere for this
+    // language is now a FAIL, not a no-op — "declared, no per-type evidence
+    // recorded". A declared type WITH some `perEdgeType` recorded is checked
+    // against `TYPE_FLOOR`, reading an absent key within a recorded breakdown
+    // as zero (Kotlin's SERVES_API/USES_API and Swift's own zeros, both
+    // written explicitly rather than left as an absent key, for a human
+    // reading the JSON directly — but the code treats the two identically).
+    //
+    // Scoped to requirements that MOVE a language up a tier (id prefix "A."
+    // or higher — "S." today), never to "B."/"C.". Checked empirically before
+    // being kept, not assumed: applying this unscoped collapsed every tier in
+    // `tiers.test.ts` to C, including "a complete adapter with two qualifying
+    // draws reaches Tier S" — B.declarations (CALLS, IMPORTS) and B.tests
+    // (TESTS) are baseline requirements every real adapter clears via
+    // conformance and B.r2, not a capability claimed to "move" anything, and
+    // no adapter in this fleet (nor any test fixture) has ever recorded a
+    // per-type breakdown for them. Applying the stricter rule there is not
+    // "the same defect class" — it is asking a floor requirement to answer a
+    // question only a promotion requirement was ever meant to ask.
+    const isPromotionRequirement = requirement.id.startsWith("A.") || requirement.id.startsWith("S.");
+    for (const type of requirement.edgeTypes ?? []) {
+        if (!caps.edgeTypes.includes(type))
+            continue; // already named in edgeGap above
+        if (!isPromotionRequirement)
+            continue;
+        const drawsWithBreakdown = evidence.precisionDraws.filter((d) => d.perEdgeType !== undefined);
+        if (drawsWithBreakdown.length === 0) {
+            gaps.push(`${type} declared, no per-type evidence recorded — the capability that would earn this requirement ` +
+                `was never broken out by edge type in any recorded draw`);
+            continue;
+        }
+        const decided = drawsWithBreakdown.reduce((sum, d) => sum + (d.perEdgeType?.[type]?.decided ?? 0), 0);
+        if (decided < TYPE_FLOOR) {
+            gaps.push(`${type} ${decided}/${TYPE_FLOOR} decided rows across the recorded precision draws — declared, ` +
+                `but not validated by the draw at the floor every edge type is otherwise held to`);
+        }
+    }
+    return gaps.length === 0 ? null : { requirement, because: gaps.join("; ") };
+}
+function checkConformance(requirement, evidence) {
+    const wanted = requirement.minResolution ?? 0;
+    // A run at a HIGHER resolution does not stand in for a lower one, and a run at
+    // a lower one certainly does not stand in for a higher. The sweep exists so
+    // every level has its own verdict; take the one asked for.
+    const run = evidence.conformance.find((c) => c.resolution === wanted);
+    if (run === undefined) {
+        return { requirement, because: `no conformance run recorded at R${wanted}` };
+    }
+    if (!run.passed)
+        return { requirement, because: `the corpus does not pass at R${wanted}` };
+    if (!run.manifestClean) {
+        return { requirement, because: `the R${wanted} run's manifest check is not clean (DEC-070)` };
+    }
+    return null;
+}
+/**
+ * DEC-075 §6.2, and the one requirement a machine cannot finish on its own.
+ *
+ * Checked here: the draw size, the precision, the negative control, and that
+ * **two distinct repositories** qualify. Declared, not checked: that the author
+ * did not choose them.
+ */
+function checkPrecisionDraws(requirement, evidence) {
+    const draws = evidence.precisionDraws;
+    if (draws.length === 0) {
+        return {
+            requirement,
+            because: "no precision draw is recorded — absent evidence is not a pass",
+        };
+    }
+    const reasons = [];
+    const qualifying = draws.filter((d) => {
+        if (d.authorChose) {
+            reasons.push(`${d.repository}: the author chose this repository, so it does not count toward the two`);
+            return false;
+        }
+        if (d.drawn < MIN_DRAW) {
+            // A population of zero is not a short sample. Saying "below 200" there
+            // tells a reader to measure harder, when nothing exists to measure.
+            const drawable = drawableFrom(d);
+            reasons.push(drawable === undefined
+                ? `${d.repository}: ${d.drawn} edges drawn, below ${MIN_DRAW} ` +
+                    `(population not recorded, so this cannot be told from an empty one)`
+                : drawable === null
+                    ? `${d.repository}: ${d.drawn} of ${MIN_DRAW} drawn from a ${d.population}-edge population, but the ` +
+                        `drawable count could not be computed — the refusal census ran with no known internal hosts, so every ` +
+                        `absolute target classified as out of scope. Subtracting there would let an adapter improve this row ` +
+                        `by declaring less. Supply internal hosts and re-run`
+                    : drawable === 0
+                        ? `${d.repository}: 0 of ${MIN_DRAW} drawable — ` +
+                            (d.population === 0
+                                ? `the reference set contains no ${d.edgeType} population for this adapter`
+                                : `all ${d.population} candidates target something this workspace does not serve, so none can ever ` +
+                                    `become an edge here`) +
+                            `. That is a fact about the corpus, not about the adapter: the answer is other repositories, ` +
+                            `not more measurement`
+                        : `${d.repository}: ${d.drawn} edges drawn, below ${MIN_DRAW}, of ${drawable} drawable` +
+                            (d.population !== undefined && drawable < d.population
+                                ? ` (${d.population} seen, ${d.population - drawable} out of scope)`
+                                : "") +
+                            ` — measured and short, and the gap is the adapter's`);
+            return false;
+        }
+        // Precision is measured over DECIDED rows, never over the raw draw size
+        // — an adjudicator that honestly refuses to judge a row is not the same
+        // fact as one that judged it wrong, and folding the two into one
+        // denominator punishes the honest refusal exactly as hard as the wrong
+        // answer. Coverage (decided/drawn) is reported separately, never here —
+        // see `PrecisionDraw.decided`'s own comment.
+        const decided = d.decided ?? d.drawn;
+        if (d.correct / decided < MIN_PRECISION) {
+            reasons.push(`${d.repository}: precision ${d.correct}/${decided}` +
+                (decided === d.drawn ? "" : ` (of ${d.drawn} drawn, ${decided} decided)`) +
+                `, below ${MIN_PRECISION * 100}%`);
+            return false;
+        }
+        if (d.controlDrawn > 0 && d.controlCorrect / d.controlDrawn > MAX_CONTROL) {
+            reasons.push(`${d.repository}: negative control ${d.controlCorrect}/${d.controlDrawn}, above ${MAX_CONTROL * 100}%`);
+            return false;
+        }
+        if (d.controlDrawn === 0) {
+            reasons.push(`${d.repository}: no negative control was run, so the precision figure is unguarded`);
+            return false;
+        }
+        return true;
+    });
+    const repositories = new Set(qualifying.map((d) => d.repository));
+    if (repositories.size < REPOSITORIES_REQUIRED) {
+        const head = `${repositories.size} of ${REPOSITORIES_REQUIRED} qualifying repositories`;
+        return {
+            requirement,
+            because: reasons.length > 0 ? `${head} — ${reasons.join("; ")}` : head,
+        };
+    }
+    return null;
+}
+/**
+ * A limit is admissible only if it says what it is and who says so.
+ *
+ * The abuse this guards against is the easy one: labelling an unbuilt
+ * capability "structural" to collect the tier. It cannot be checked mechanically
+ * — whether a language *can* have a failing accessor is a fact about the
+ * language — so the defence is that the claim is attributable and printed.
+ */
+function admissibleLimits(evidence) {
+    return (evidence.structuralLimits ?? []).filter((l) => l.id.trim() !== "" && l.reason.trim() !== "" && l.declaredBy.trim() !== "");
+}
+/**
+ * A cap is admissible only when it says what it would claim, what it does claim,
+ * **what would lift it**, and who declared it. The `pendingOn` requirement is the
+ * one doing real work: without it a cap can never be discharged and would sit on
+ * the certificate indefinitely, reading as caution rather than as a scheduled
+ * reconsideration.
+ */
+function admissibleCaps(evidence) {
+    return (evidence.policyCaps ?? []).filter((c) => c.id.trim() !== "" &&
+        c.claimable.trim() !== "" &&
+        c.claimed.trim() !== "" &&
+        c.pendingOn.trim() !== "" &&
+        c.declaredBy.trim() !== "");
+}
+/**
+ * How many candidates could *ever* have become edges here.
+ *
+ * `null` means **not computable**, which is neither zero nor a number: the
+ * census classified against no known internal hosts, so every absolute target
+ * counted as out of scope and the subtraction would flatter the adapter.
+ */
+function drawableFrom(d) {
+    if (d.population === undefined)
+        return undefined;
+    if (d.refusals === undefined)
+        return d.population;
+    if (!d.refusals.scopeKnown)
+        return null;
+    return Math.max(0, d.population - d.refusals.outOfScope);
+}
+function checkRequirement(requirement, evidence) {
+    switch (requirement.kind) {
+        case "capability":
+            return checkCapability(requirement, evidence);
+        case "conformance":
+            return checkConformance(requirement, evidence);
+        case "attested":
+            return checkPrecisionDraws(requirement, evidence);
+    }
+}
+// ---------------------------------------------------------------------------
+// DEC-075 §6.3
+// ---------------------------------------------------------------------------
+/**
+ * Does `capabilities()` declare exactly what was emitted?
+ *
+ * Returns `"unknown"` when no run was supplied, which is **not** the same as
+ * `true` and is reported as its own value for that reason. Over-declaring is
+ * the failure that matters here: an adapter claiming `MODEL` it never emits
+ * would be handed Tier S by the ladder above on the strength of a declaration.
+ * Under-declaring is DEC-070's `thin` verdict and is caught there.
+ */
+function capabilitiesHonest(evidence) {
+    if (evidence.emittedNodeTypes === undefined || evidence.emittedEdgeTypes === undefined) {
+        return "unknown";
+    }
+    const overNodes = missing(evidence.capabilities.nodeTypes, evidence.emittedNodeTypes);
+    const overEdges = missing(evidence.capabilities.edgeTypes, evidence.emittedEdgeTypes);
+    return overNodes.length === 0 && overEdges.length === 0;
+}
+// ---------------------------------------------------------------------------
+// The generator
+// ---------------------------------------------------------------------------
+export function certify(evidence) {
+    const byTier = { S: [], A: [], B: [], C: [] };
+    const limits = admissibleLimits(evidence);
+    const limitedIds = new Set(limits.map((l) => l.id));
+    for (const definition of LADDER) {
+        byTier[definition.tier] = requirementsFor(definition.tier)
+            // A requirement this language cannot satisfy is NOT-APPLICABLE: it does
+            // not block the tier and it does not disappear. It reappears below as a
+            // published limitation, which is the whole point of the third verdict.
+            .filter((r) => !limitedIds.has(r.id))
+            .map((r) => checkRequirement(r, evidence))
+            .filter((u) => u !== null);
+    }
+    // Highest tier with nothing unmet. TIERS is S-first.
+    const awarded = TIERS.find((t) => byTier[t].length === 0) ?? null;
+    const above = awarded === null ? "C" : awarded === "S" ? null : TIERS[TIERS.indexOf(awarded) - 1] ?? null;
+    const restsOnAttestation = awarded !== null && requirementsFor(awarded).some((r) => r.kind === "attested");
+    const attestedBy = restsOnAttestation
+        ? [...new Set(evidence.precisionDraws.filter((d) => !d.authorChose).map((d) => d.recordedBy))]
+        : [];
+    /**
+     * Which edge types the qualifying draws actually covered.
+     *
+     * `checkPrecisionDraws` has no edge-type filter — a draw of any type that
+     * clears the bar counts toward DEC-075 §6.2's "two repositories", because
+     * the requirement DEC-075 §6 states is "a ≥200-edge precision draw", not
+     * "a draw of the edge type this tier's own capability rows named". That is
+     * correct rather than a gap: `USES_API` is the one edge type that cannot
+     * carry a negative control at all (DEC-164 §2), so requiring the draw be
+     * `USES_API`-specific would make Tier A permanently unreachable in every
+     * language, on every adapter, forever — a bar that cannot be measured is
+     * not a stricter gate, it is a broken one.
+     *
+     * But a tier resting on, say, an `IMPORTS`-only draw has not had its
+     * `USES_API` capability's precision independently sampled — `A.callers`
+     * checked that the edge type is *declared*, not that it is *precise*. That
+     * gap is real and belongs on the certificate, not silently absorbed into
+     * "Tier A". Printed rather than designed around, the same move as
+     * `unreachableHere`: the limit is disclosed, and a reader who wants to know
+     * whether the caller half specifically was adjudicated can see it named
+     * here instead of assuming "Tier A" answers a question it does not.
+     */
+    const attestedEdgeTypes = restsOnAttestation
+        ? [...new Set(evidence.precisionDraws.filter((d) => !d.authorChose).map((d) => d.edgeType))].sort()
+        : [];
+    return {
+        adapter: evidence.adapter,
+        language: evidence.language,
+        tier: awarded,
+        nextTier: above,
+        unmetForNext: above === null ? [] : byTier[above],
+        byTier,
+        attestedBy,
+        attestedEdgeTypes,
+        limitations: limits,
+        // Derived rather than declared: a zero population is measured, so unlike a
+        // StructuralLimit it needs no attribution to be admissible.
+        // Drawable zero, not population zero: a repository whose whole population is
+        // out of scope is as unreachable as one with no population at all, and both
+        // are facts about the corpus rather than about the adapter.
+        unreachableHere: evidence.precisionDraws
+            .filter((d) => drawableFrom(d) === 0)
+            .map((d) => ({ repository: d.repository, edgeType: d.edgeType })),
+        // Deliberately NOT folded into `limitedIds` above: a cap waives nothing, and
+        // a cap that could skip a requirement would be the cheapest route to a tier.
+        policyCaps: admissibleCaps(evidence),
+        capabilitiesHonest: capabilitiesHonest(evidence),
+    };
+}
+/**
+ * The certificate as a developer should read it: the tier, then immediately the
+ * reason it is not higher.
+ *
+ * The failing rows are not an appendix. A support matrix that prints "B" and
+ * stops teaches a reader that B is the ceiling; printing what A is missing
+ * turns the same fact into a work item.
+ */
+export function formatCertificate(certificate) {
+    const lines = [];
+    const tier = certificate.tier ?? "none";
+    lines.push(`${certificate.language} — Tier ${tier}   (${certificate.adapter})`);
+    if (certificate.attestedBy.length > 0) {
+        lines.push(`  rests on a declaration by: ${certificate.attestedBy.join(", ")}`);
+        lines.push(`    precision draw edge type(s) actually sampled: ${certificate.attestedEdgeTypes.join(", ")}`);
+    }
+    // Printed with the tier, never as a footnote. "We found nothing" and "we
+    // cannot check this in this language" are different sentences (§20.2), and
+    // this is the line that keeps them apart at the tier layer.
+    for (const limit of certificate.limitations) {
+        lines.push(`  NOT AVAILABLE in this language — ${limit.id}: ${limit.reason}`);
+        lines.push(`    declared by ${limit.declaredBy}; this is a language boundary, not an unbuilt feature`);
+    }
+    // A deliberate under-claim, printed beside the limits and worded so it cannot
+    // be read as one. "We cannot" and "we could and are not, yet" are different
+    // sentences, and publishing the second as the first understates the adapter.
+    // Beside the limitations, not among the unmet rows: "nothing to measure" and
+    // "measured and short" send a reader to different places.
+    for (const empty of certificate.unreachableHere) {
+        lines.push(`  NOT REACHABLE IN THIS REFERENCE SET — ${empty.edgeType} on ${empty.repository}: population 0`);
+        lines.push("    Nothing here to sample. The remedy is other repositories, not more measurement");
+    }
+    for (const cap of certificate.policyCaps) {
+        lines.push(`  CAPPED BY POLICY — ${cap.id}: claims ${cap.claimed}, evidence supports ${cap.claimable}`);
+        lines.push(`    pending ${cap.pendingOn}; declared by ${cap.declaredBy}. Not a limit — a deliberate under-claim`);
+    }
+    if (certificate.capabilitiesHonest === false) {
+        lines.push("  WARNING: capabilities() declares types this run did not emit (DEC-075 §6.3)");
+    }
+    else if (certificate.capabilitiesHonest === "unknown") {
+        lines.push("  capabilities() not compared against a run — DEC-075 §6.3 unverified here");
+    }
+    if (certificate.nextTier === null) {
+        lines.push("  nothing above this tier");
+        return lines.join("\n");
+    }
+    lines.push(`  not Tier ${certificate.nextTier}, because:`);
+    for (const unmet of certificate.unmetForNext) {
+        const mark = unmet.requirement.kind === "attested" ? " [declared, not measured]" : "";
+        lines.push(`    - ${unmet.requirement.statement}${mark}`);
+        lines.push(`      ${unmet.because}`);
+    }
+    return lines.join("\n");
+}
+//# sourceMappingURL=certify.js.map

package/dist/tiers/certify.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"certify.js","sourceRoot":"","sources":["../../src/tiers/certify.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAKH,OAAO,EAAE,MAAM,EAA+B,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAgV1F,8EAA8E;AAC9E,2BAA2B;AAC3B,8EAA8E;AAE9E,MAAM,QAAQ,GAAG,GAAG,CAAC;AACrB,MAAM,aAAa,GAAG,IAAI,CAAC;AAC3B,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB;;;;;;;;;;GAUG;AACH,MAAM,UAAU,GAAG,EAAE,CAAC;AACtB,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAEhC,SAAS,OAAO,CAAI,MAAgC,EAAE,IAAkB;IACtE,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,eAAe,CAAC,WAAwB,EAAE,QAAsB;IACvE,MAAM,IAAI,GAAG,QAAQ,CAAC,YAAY,CAAC;IACnC,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,kBAAkB,IAAI,EAAE,CAAC,CAAC;IAE/D,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,8BAA8B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEtF,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,8BAA8B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEtF,0EAA0E;IAC1E,+EAA+E;IAC/E,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,WAAW,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAC1F,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAC1B,CAAC;IACF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;IACrF,CAAC;IAED,IAAI,WAAW,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,aAAa,EAAE,CAAC;QAC9F,IAAI,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,aAAa,YAAY,WAAW,CAAC,aAAa,EAAE,CAAC,CAAC;IAC5F,CAAC;IAED,0EAA0E;IAC1E,wEAAwE;IACxE,mEAAmE;IACnE,uEAAuE;IACvE,wEAAwE;IACxE,0EAA0E;IAC1E,uEAAuE;IACvE,oEAAoE;IACpE,0EAA0E;IAC1E,wEAAwE;IACxE,0EAA0E;IAC1E,gFAAgF;IAChF,2EAA2E;IAC3E,0CAA0C;IAC1C,EAAE;IACF,uEAAuE;IACvE,wEAAwE;IACxE,yEAAyE;IACzE,0EAA0E;IAC1E,oEAAoE;IACpE,oEAAoE;IACpE,wEAAwE;IACxE,EAAE;IACF,wEAAwE;IACxE,0EAA0E;IAC1E,0EAA0E;IAC1E,0EAA0E;IAC1E,sEAAsE;IACtE,kEAAkE;IAClE,yEAAyE;IACzE,sEAAsE;IACtE,uEAAuE;IACvE,yEAAyE;IACzE,+DAA+D;IAC/D,MAAM,sBAAsB,GAAG,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClG,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;QAC/C,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,SAAS,CAAC,iCAAiC;QAC/E,IAAI,CAAC,sBAAsB;YAAE,SAAS;QACtC,MAAM,kBAAkB,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;QAC9F,IAAI,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CACP,GAAG,IAAI,6FAA6F;gBAClG,wDAAwD,CAC3D,CAAC;YACF,SAAS;QACX,CAAC;QACD,MAAM,OAAO,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,CAAC,EAAE,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtG,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CACP,GAAG,IAAI,IAAI,OAAO,IAAI,UAAU,gEAAgE;gBAC9F,iFAAiF,CACpF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC9E,CAAC;AAED,SAAS,gBAAgB,CAAC,WAAwB,EAAE,QAAsB;IACxE,MAAM,MAAM,GAAG,WAAW,CAAC,aAAa,IAAI,CAAC,CAAC;IAC9C,+EAA+E;IAC/E,4EAA4E;IAC5E,2DAA2D;IAC3D,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CAAC;IACtE,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,mCAAmC,MAAM,EAAE,EAAE,CAAC;IAC/E,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,MAAM;QAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,gCAAgC,MAAM,EAAE,EAAE,CAAC;IAC3F,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,CAAC;QACvB,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,MAAM,8CAA8C,EAAE,CAAC;IAChG,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAS,mBAAmB,CAAC,WAAwB,EAAE,QAAsB;IAC3E,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC;IACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACL,WAAW;YACX,OAAO,EAAE,+DAA+D;SACzE,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACpC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,UAAU,yEAAyE,CAAC,CAAC;YACvG,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;YACvB,uEAAuE;YACvE,oEAAoE;YACpE,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,OAAO,CAAC,IAAI,CACV,QAAQ,KAAK,SAAS;gBACpB,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,KAAK,uBAAuB,QAAQ,GAAG;oBAC7D,qEAAqE;gBACvE,CAAC,CAAC,QAAQ,KAAK,IAAI;oBACjB,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,KAAK,OAAO,QAAQ,iBAAiB,CAAC,CAAC,UAAU,4BAA4B;wBACnG,uGAAuG;wBACvG,sGAAsG;wBACtG,qDAAqD;oBACvD,CAAC,CAAC,QAAQ,KAAK,CAAC;wBACd,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,UAAU,QAAQ,cAAc;4BAC/C,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC;gCACjB,CAAC,CAAC,iCAAiC,CAAC,CAAC,QAAQ,8BAA8B;gCAC3E,CAAC,CAAC,OAAO,CAAC,CAAC,UAAU,+EAA+E;oCAClG,qBAAqB,CAAC;4BAC1B,8FAA8F;4BAC9F,sBAAsB;wBACxB,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,KAAK,uBAAuB,QAAQ,QAAQ,QAAQ,WAAW;4BACrF,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,IAAI,QAAQ,GAAG,CAAC,CAAC,UAAU;gCACpD,CAAC,CAAC,KAAK,CAAC,CAAC,UAAU,UAAU,CAAC,CAAC,UAAU,GAAG,QAAQ,gBAAgB;gCACpE,CAAC,CAAC,EAAE,CAAC;4BACP,qDAAqD,CAC9D,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,wEAAwE;QACxE,wEAAwE;QACxE,iEAAiE;QACjE,uEAAuE;QACvE,wEAAwE;QACxE,6CAA6C;QAC7C,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC;QACrC,IAAI,CAAC,CAAC,OAAO,GAAG,OAAO,GAAG,aAAa,EAAE,CAAC;YACxC,OAAO,CAAC,IAAI,CACV,GAAG,CAAC,CAAC,UAAU,eAAe,CAAC,CAAC,OAAO,IAAI,OAAO,EAAE;gBAClD,CAAC,OAAO,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,WAAW,OAAO,WAAW,CAAC;gBACzE,WAAW,aAAa,GAAG,GAAG,GAAG,CACpC,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,CAAC,YAAY,GAAG,CAAC,IAAI,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,YAAY,GAAG,WAAW,EAAE,CAAC;YAC1E,OAAO,CAAC,IAAI,CACV,GAAG,CAAC,CAAC,UAAU,sBAAsB,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,YAAY,WAAW,WAAW,GAAG,GAAG,GAAG,CACvG,CAAC;YACF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,CAAC,YAAY,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,UAAU,qEAAqE,CAAC,CAAC;YACnG,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAClE,IAAI,YAAY,CAAC,IAAI,GAAG,qBAAqB,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,GAAG,YAAY,CAAC,IAAI,OAAO,qBAAqB,0BAA0B,CAAC;QACxF,OAAO;YACL,WAAW;YACX,OAAO,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI;SACvE,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,gBAAgB,CAAC,QAAsB;IAC9C,OAAO,CAAC,QAAQ,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,MAAM,CAC7C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,CAClF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,QAAsB;IAC5C,OAAO,CAAC,QAAQ,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,MAAM,CACvC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE;QAClB,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE;QACzB,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE;QACvB,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE;QACzB,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,CAC7B,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,CAAgB;IACpC,IAAI,CAAC,CAAC,UAAU,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjD,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,UAAU,CAAC;IAClD,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,gBAAgB,CAAC,WAAwB,EAAE,QAAsB;IACxE,QAAQ,WAAW,CAAC,IAAI,EAAE,CAAC;QACzB,KAAK,YAAY;YACf,OAAO,eAAe,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QAChD,KAAK,aAAa;YAChB,OAAO,gBAAgB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QACjD,KAAK,UAAU;YACb,OAAO,mBAAmB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACtD,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,QAAsB;IAChD,IAAI,QAAQ,CAAC,gBAAgB,KAAK,SAAS,IAAI,QAAQ,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;QACvF,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,SAAS,EAAE,QAAQ,CAAC,gBAAgB,CAAC,CAAC;IACtF,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,SAAS,EAAE,QAAQ,CAAC,gBAAgB,CAAC,CAAC;IACtF,OAAO,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC;AAC1D,CAAC;AAED,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E,MAAM,UAAU,OAAO,CAAC,QAAsB;IAC5C,MAAM,MAAM,GAA8C,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;IAEzF,MAAM,MAAM,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpD,KAAK,MAAM,UAAU,IAAI,MAAM,EAAE,CAAC;QAChC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC;YACxD,wEAAwE;YACxE,wEAAwE;YACxE,uEAAuE;aACtE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACpC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;aACzC,MAAM,CAAC,CAAC,CAAC,EAAyB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IACtD,CAAC;IAED,qDAAqD;IACrD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC;IAElE,MAAM,KAAK,GACT,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC;IAE9F,MAAM,kBAAkB,GAAG,OAAO,KAAK,IAAI,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IAE3G,MAAM,UAAU,GAAG,kBAAkB;QACnC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAC9F,CAAC,CAAC,EAAE,CAAC;IAEP;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,MAAM,iBAAiB,GAAG,kBAAkB;QAC1C,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;QACnG,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO;QACL,OAAO,EAAE,QAAQ,CAAC,OAAO;QACzB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,IAAI,EAAE,OAAO;QACb,QAAQ,EAAE,KAAK;QACf,YAAY,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;QACjD,MAAM;QACN,UAAU;QACV,iBAAiB;QACjB,WAAW,EAAE,MAAM;QACnB,2EAA2E;QAC3E,4DAA4D;QAC5D,6EAA6E;QAC7E,4EAA4E;QAC5E,4DAA4D;QAC5D,eAAe,EAAE,QAAQ,CAAC,cAAc;aACrC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aACpC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QACnE,6EAA6E;QAC7E,6EAA6E;QAC7E,UAAU,EAAE,cAAc,CAAC,QAAQ,CAAC;QACpC,kBAAkB,EAAE,kBAAkB,CAAC,QAAQ,CAAC;KACjD,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,WAA4B;IAC5D,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,IAAI,MAAM,CAAC;IACxC,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,QAAQ,WAAW,IAAI,OAAO,WAAW,CAAC,OAAO,GAAG,CAAC,CAAC;IAEhF,IAAI,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,gCAAgC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChF,KAAK,CAAC,IAAI,CAAC,qDAAqD,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9G,CAAC;IACD,yEAAyE;IACzE,2EAA2E;IAC3E,4DAA4D;IAC5D,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,WAAW,EAAE,CAAC;QAC5C,KAAK,CAAC,IAAI,CAAC,sCAAsC,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9E,KAAK,CAAC,IAAI,CAAC,mBAAmB,KAAK,CAAC,UAAU,uDAAuD,CAAC,CAAC;IACzG,CAAC;IACD,8EAA8E;IAC9E,4EAA4E;IAC5E,6EAA6E;IAC7E,6EAA6E;IAC7E,0DAA0D;IAC1D,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,eAAe,EAAE,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,2CAA2C,KAAK,CAAC,QAAQ,OAAO,KAAK,CAAC,UAAU,gBAAgB,CAAC,CAAC;QAC7G,KAAK,CAAC,IAAI,CAAC,oFAAoF,CAAC,CAAC;IACnG,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,wBAAwB,GAAG,CAAC,EAAE,YAAY,GAAG,CAAC,OAAO,uBAAuB,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;QACxG,KAAK,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,SAAS,iBAAiB,GAAG,CAAC,UAAU,0CAA0C,CAAC,CAAC;IACpH,CAAC;IACD,IAAI,WAAW,CAAC,kBAAkB,KAAK,KAAK,EAAE,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,+EAA+E,CAAC,CAAC;IAC9F,CAAC;SAAM,IAAI,WAAW,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;QACxD,KAAK,CAAC,IAAI,CAAC,4EAA4E,CAAC,CAAC;IAC3F,CAAC;IAED,IAAI,WAAW,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,cAAc,WAAW,CAAC,QAAQ,YAAY,CAAC,CAAC;IAC3D,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,YAAY,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,2BAA2B,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,KAAK,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,WAAW,CAAC,SAAS,GAAG,IAAI,EAAE,CAAC,CAAC;QAC1D,KAAK,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/tiers/index.d.ts

@@ -0,0 +1,5 @@
+export { certify, formatCertificate } from "./certify.ts";
+export type { ConformanceEvidence, EmptyPopulation, GateEvidence, PolicyCap, PrecisionDraw, StructuralLimit, TierCertificate, UnmetRequirement, } from "./certify.ts";
+export { LADDER, TIERS, requirementsFor } from "./ladder.ts";
+export type { Requirement, RequirementKind, Tier, TierDefinition } from "./ladder.ts";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tiers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAC1D,YAAY,EACV,mBAAmB,EACnB,eAAe,EACf,YAAY,EACZ,SAAS,EACT,aAAa,EACb,eAAe,EACf,eAAe,EACf,gBAAgB,GACjB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC7D,YAAY,EAAE,WAAW,EAAE,eAAe,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC"}

package/dist/tiers/index.js

@@ -0,0 +1,3 @@
+export { certify, formatCertificate } from "./certify.js";
+export { LADDER, TIERS, requirementsFor } from "./ladder.js";
+//# sourceMappingURL=index.js.map

package/dist/tiers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tiers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAW1D,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}

package/dist/tiers/ladder.d.ts

@@ -0,0 +1,73 @@
+/**
+ * The four capability tiers of §11A.11, expressed as requirements a machine can
+ * check — and the ones it cannot, named as such.
+ *
+ * ## Why this file exists at all
+ *
+ * Nine adapters state a tier in a doc comment. **DEC-075 §6 says a tier is
+ * generated from `capabilities()` and the gate results, never written in
+ * prose**, and until now nothing implemented that, so the only tier claims in
+ * the repository were the ones a human typed. That is the single piece of
+ * standing dishonesty in the codebase: a claim about what works for a language,
+ * made by the person who wanted it to be true, in a comment nothing checks.
+ *
+ * ## The ladder, from §11A.11
+ *
+ * | tier | what works | what it costs |
+ * | --- | --- | --- |
+ * | **S — Full** | contract *shape* matching, data propagation, oracle-derived tests | R3 + router extractor + ORM extractor |
+ * | **A — Contract** | endpoint matching, path-level orphans, migration DAG | R2/R3 + router extractor |
+ * | **B — Graph** | blast radius, impact scoring, test discovery, in-language root cause | R2 adapter |
+ * | **C — Signal** | env/config, rollback readiness, hidden dependency, file-level blast radius | R0, one grammar and one query set |
+ *
+ * A tier is **cumulative**: S implies A implies B implies C. So a language is
+ * awarded the highest tier whose requirements are *all* met, and the
+ * requirements of every tier below it are re-checked rather than assumed —
+ * because an adapter can reach R3 and still not emit a `FUNCTION`, and a ladder
+ * that assumed monotonicity would hand it an A on the strength of its routes.
+ *
+ * ## What a requirement may be
+ *
+ * Three kinds, and the split is the honest part:
+ *
+ * - **`capability`** — read straight off `capabilities()`. Machine-checked, no
+ *   judgement. `capabilities()` is itself machine-checked against what the
+ *   adapter actually emitted (DEC-070), so this is evidence, not a promise.
+ * - **`conformance`** — the corpus passes at the resolution the tier claims.
+ *   Machine-checked by running the harness.
+ * - **`attested`** — a fact no machine in this repository can establish, so it
+ *   is *declared* with its evidence and marked as declared. There is exactly
+ *   one, and it is DEC-075's second condition: a ≥200-edge precision draw on
+ *   two repositories **the adapter's author did not choose**. A machine can
+ *   check the 200 and the two; it cannot check "did not choose", which is a
+ *   fact about a person's intent. Recording it as attested is what stops the
+ *   generator laundering a human judgement into a computed result.
+ */
+import type { EdgeType, NodeType, ResolutionLevel } from "@descryy/ir";
+export type Tier = "S" | "A" | "B" | "C";
+/** Highest first. The order the generator walks, and the only place it lives. */
+export declare const TIERS: readonly Tier[];
+export type RequirementKind = "capability" | "conformance" | "attested";
+export interface Requirement {
+    readonly id: string;
+    readonly kind: RequirementKind;
+    /** One sentence, phrased as the thing that must be true. Printed on failure. */
+    readonly statement: string;
+    readonly nodeTypes?: readonly NodeType[];
+    readonly edgeTypes?: readonly EdgeType[];
+    readonly minResolution?: ResolutionLevel;
+}
+export interface TierDefinition {
+    readonly tier: Tier;
+    readonly name: string;
+    readonly requires: readonly Requirement[];
+}
+export declare const LADDER: readonly TierDefinition[];
+/**
+ * Every requirement a tier needs, including the tiers beneath it.
+ *
+ * Cumulative and re-checked rather than assumed — see the header. `C` is the
+ * floor, so `requirementsFor("C")` is C's own list.
+ */
+export declare function requirementsFor(tier: Tier): readonly Requirement[];
+//# sourceMappingURL=ladder.d.ts.map

package/dist/tiers/ladder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ladder.d.ts","sourceRoot":"","sources":["../../src/tiers/ladder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAEvE,MAAM,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAEzC,iFAAiF;AACjF,eAAO,MAAM,KAAK,EAAE,SAAS,IAAI,EAAyB,CAAC;AAE3D,MAAM,MAAM,eAAe,GAAG,YAAY,GAAG,aAAa,GAAG,UAAU,CAAC;AAExE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAC/B,gFAAgF;IAChF,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IACzC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,CAAC,EAAE,eAAe,CAAC;CAC1C;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,SAAS,WAAW,EAAE,CAAC;CAC3C;AAyID,eAAO,MAAM,MAAM,EAAE,SAAS,cAAc,EAK3C,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,SAAS,WAAW,EAAE,CAOlE"}