@descryy/core 0.1.0

package/dist/graph/runtime-confirmation.js

@@ -0,0 +1,318 @@
+/**
+ * Runtime confirmation — architecture §11B.3, the R4 half of the moat.
+ *
+ * > *"A purely static code-graph tool is capped at R3 permanently. It has no
+ * > runtime. This is the one accuracy source that cannot be copied without
+ * > also building the testing half, and it should be treated as the core
+ * > technical moat rather than the graph itself."* — §11B.3
+ *
+ * The schema has held `observed_edges` and `edge_corrections` since the store
+ * was first written, both on the EARNED side of DEC-017's partition, both
+ * carrying a comment explaining why they cannot be recomputed. **Nothing read
+ * or wrote either one.** This module is what they were for.
+ *
+ * ## The three arrows §11B.3 draws, and where each one lands
+ *
+ * | Observation | What happens |
+ * | --- | --- |
+ * | confirms an edge the graph already has, below R4 | **promote** to R4, `observed_by_run` set |
+ * | confirms an edge the graph does not have | **create** it at R4 — "recall gap closed" |
+ * | denies an edge the graph has, below R4 | **correct** it: an `edge_corrections` row, and a {@link GraphDefectRecord} out |
+ *
+ * ## Why a denial demotes confidence and does not delete the edge
+ *
+ * `edges` is DERIVED. Deleting a row there is undone by the next index, which
+ * regenerates the identical guess from the identical source and has no memory
+ * of the run that disproved it — the correction would evaporate exactly when
+ * it was needed again. §11B.5 already states the answer: corrections are
+ * *"stored as graph overrides keyed by stable node IDs, surviving re-index and
+ * adapter upgrades."* So the durable statement is the `edge_corrections` row,
+ * and the effect on the derived graph is a confidence demotion that
+ * {@link reapplyEarnedOverlays} re-applies after every rebuild.
+ *
+ * Demotion rather than deletion is also DEC-284's own stated direction — *"it
+ * fails toward demote, which is the safe direction"* — and it keeps rule 2
+ * intact from the other side: a wrong edge stops being load-bearing without
+ * the graph asserting a *new* fact (that the call does not exist) that no
+ * single observation actually establishes.
+ *
+ * ## What this module refuses to do
+ *
+ * - **Invent a node.** An observation naming a node this graph does not hold
+ *   is refused with its reason, never created. Rule 2, and the same posture
+ *   `correlateExecution` takes one layer down for an ambiguous resolution.
+ * - **Adjudicate R4 against R4.** A denial against an edge already at R4 is
+ *   two runtime observations disagreeing across time — a staleness question
+ *   whose policy is decided (DEC-284 + a 7-day backstop) but whose consumer
+ *   does not exist yet. `contradiction.ts` excludes the case by construction
+ *   and this module reports it as {@link RuntimeConfirmationResult.staleR4}
+ *   rather than laundering it through a path that looks decided.
+ * - **Judge a finding.** Resolution has no opinion on confidence (RT-027).
+ *   Nothing here reads or writes a finding, a hypothesis or a category.
+ *
+ * @see `packages/ir/src/contradiction.ts` — the pure detection this persists.
+ * @see `documents/plans/ai-layer-plan.md` §10 — *"the valuable half."*
+ */
+import { edgeId } from "@descryy/ir";
+const SYSTEM_CLOCK = { now: () => Date.now() };
+/**
+ * Apply a run's edge observations to the graph, writing the earned record and
+ * projecting it onto the derived edges in one transaction.
+ *
+ * Pure with respect to its inputs and total over them: every observation lands
+ * in exactly one of the six result arrays, so a caller can account for all of
+ * them without inspecting the store. Never throws for an observation it cannot
+ * act on — that is a refusal, per the five-result-states rule the tool contract
+ * applies one layer up.
+ */
+export function applyRuntimeObservations(driver, input, clock = SYSTEM_CLOCK) {
+    const promoted = [];
+    const created = [];
+    const confirmed = [];
+    const contradictions = [];
+    const staleR4 = [];
+    const refused = [];
+    const now = clock.now();
+    driver.transaction(() => {
+        for (const observation of input.observations) {
+            const id = edgeId(observation.from, observation.to, observation.edgeType);
+            const existing = readEdge(driver, id);
+            if (observation.held) {
+                // Both endpoints must already be nodes. Creating one would be the
+                // graph inventing a symbol from a runtime string, which is the exact
+                // shape rule 2 exists to forbid.
+                const missing = missingNode(driver, observation.from, observation.to);
+                if (missing !== null) {
+                    refused.push({
+                        from: observation.from,
+                        to: observation.to,
+                        edgeType: observation.edgeType,
+                        reason: `${missing} is not in this graph, so the observed ${observation.edgeType} edge cannot be ` +
+                            "recorded against it. The graph is not extended from a runtime name.",
+                    });
+                    continue;
+                }
+                recordObservedEdge(driver, id, input, observation, now);
+                if (existing === undefined) {
+                    insertEdgeAtR4(driver, id, observation, input.runId, input.commitSha);
+                    created.push(id);
+                }
+                else if (existing.resolution < 4) {
+                    promoteEdge(driver, id, input.runId);
+                    promoted.push(id);
+                }
+                else {
+                    confirmed.push(id);
+                }
+                continue;
+            }
+            // A denial.
+            if (existing === undefined) {
+                refused.push({
+                    from: observation.from,
+                    to: observation.to,
+                    edgeType: observation.edgeType,
+                    reason: `no ${observation.edgeType} edge from ${observation.from} to ${observation.to} exists in this ` +
+                        "graph, so there is nothing for this observation to contradict.",
+                });
+                continue;
+            }
+            if (existing.resolution >= 4) {
+                // contradiction.ts's own exclusion, enforced here rather than restated.
+                staleR4.push({ edgeId: id, observedByRun: existing.observed_by_run, detail: observation.detail });
+                continue;
+            }
+            recordCorrection(driver, id, observation.detail, now);
+            demoteEdge(driver, id);
+            contradictions.push({
+                from: observation.from,
+                to: observation.to,
+                edgeType: observation.edgeType,
+                claimedResolution: existing.resolution,
+                detail: observation.detail,
+            });
+        }
+    });
+    return { promoted, created, confirmed, contradictions, staleR4, refused };
+}
+/**
+ * Re-project the EARNED ledgers onto a freshly rebuilt derived graph.
+ *
+ * **This is what makes the DEC-017 partition pay.** `dropDerived()` removes
+ * `edges` and leaves `observed_edges`/`edge_corrections` standing; a re-index
+ * then regenerates the same static guesses, at their static resolutions, with
+ * no memory of any run. Without this call the moat is silently reset on every
+ * rebuild — the edges would be back at R2 and the R4 rows would sit in a table
+ * nothing consults, which is indistinguishable from never having observed
+ * anything.
+ *
+ * Observations whose endpoints no longer exist are reported as refusals rather
+ * than recreated: the code moved, and re-minting a node from an old run's
+ * record would be the same rule-2 violation one rebuild later.
+ */
+export function reapplyEarnedOverlays(driver) {
+    const rows = observedEdges(driver);
+    const corrections = edgeCorrections(driver).filter((c) => c.verdict === "wrong");
+    const promoted = [];
+    const created = [];
+    const confirmed = [];
+    const refused = [];
+    driver.transaction(() => {
+        for (const row of rows) {
+            const missing = missingNode(driver, row.from, row.to);
+            if (missing !== null) {
+                refused.push({
+                    from: row.from,
+                    to: row.to,
+                    edgeType: row.edgeType,
+                    reason: `${missing} is not in this graph any more; run ${row.runId}'s observation is not re-applied.`,
+                });
+                continue;
+            }
+            const existing = readEdge(driver, row.edgeId);
+            if (existing === undefined) {
+                insertEdgeAtR4(driver, row.edgeId, row, row.runId, row.commitSha);
+                created.push(row.edgeId);
+            }
+            else if (existing.resolution < 4) {
+                promoteEdge(driver, row.edgeId, row.runId);
+                promoted.push(row.edgeId);
+            }
+            else {
+                confirmed.push(row.edgeId);
+            }
+        }
+        for (const correction of corrections) {
+            // A correction never wins over a later observation: an edge re-observed
+            // firing is a stronger, more recent statement than the denial that
+            // demoted it, and `observed_edges` carries the run that saw it.
+            const existing = readEdge(driver, correction.edgeId);
+            if (existing !== undefined && existing.resolution < 4)
+                demoteEdge(driver, correction.edgeId);
+        }
+    });
+    return { promoted, created, confirmed, contradictions: [], staleR4: [], refused };
+}
+/** Every row of the EARNED R4 ledger, oldest first, optionally for one run. */
+export function observedEdges(driver, options = {}) {
+    const where = options.runId === undefined ? "" : " WHERE run_id = ?";
+    const sql = "SELECT edge_id, run_id, from_node_id, to_node_id, edge_type, commit_sha, observed_at" +
+        ` FROM observed_edges${where} ORDER BY observed_at ASC, edge_id ASC`;
+    const args = options.runId === undefined ? [] : [options.runId];
+    return driver
+        .prepare(sql)
+        .all(...args)
+        .map((row) => ({
+        edgeId: row.edge_id,
+        runId: row.run_id,
+        from: row.from_node_id,
+        to: row.to_node_id,
+        edgeType: row.edge_type,
+        commitSha: row.commit_sha,
+        observedAt: row.observed_at,
+    }));
+}
+/** Every row of the EARNED correction ledger (§11B.5), oldest first. */
+export function edgeCorrections(driver) {
+    return driver
+        .prepare("SELECT edge_id, verdict, reason, corrected_at FROM edge_corrections ORDER BY corrected_at ASC, edge_id ASC")
+        .all()
+        .map((row) => ({
+        edgeId: row.edge_id,
+        verdict: row.verdict === "right" ? "right" : "wrong",
+        reason: row.reason,
+        correctedAt: row.corrected_at,
+    }));
+}
+/**
+ * Record a human's verdict on an edge — §11B.5's other producer.
+ *
+ * *"On one team's codebase, a few hundred corrections buy more accuracy than a
+ * quarter of parser work."* Same table the runtime's own denials land in, on
+ * purpose: an edge is wrong or it is not, and who noticed does not change what
+ * the graph should do about it. The `reason` is the correction's provenance and
+ * is never summarised.
+ */
+export function recordEdgeCorrection(driver, input, clock = SYSTEM_CLOCK) {
+    const id = edgeId(input.from, input.to, input.edgeType);
+    driver.transaction(() => {
+        recordCorrectionRow(driver, id, input.verdict, input.reason, clock.now());
+        const existing = readEdge(driver, id);
+        if (input.verdict === "wrong" && existing !== undefined && existing.resolution < 4)
+            demoteEdge(driver, id);
+    });
+    return { edgeId: id };
+}
+// ---------------------------------------------------------------------------
+// Internals.
+// ---------------------------------------------------------------------------
+function readEdge(driver, id) {
+    return driver
+        .prepare("SELECT id, resolution, observed_by_run FROM edges WHERE id = ?")
+        .all(id)[0];
+}
+/** The first of `from`/`to` this graph does not hold, or `null` when it holds both. */
+function missingNode(driver, from, to) {
+    const statement = driver.prepare("SELECT id FROM nodes WHERE id = ?");
+    if (statement.all(from).length === 0)
+        return from;
+    if (statement.all(to).length === 0)
+        return to;
+    return null;
+}
+function recordObservedEdge(driver, id, input, observation, now) {
+    driver
+        .prepare("INSERT INTO observed_edges (edge_id, run_id, from_node_id, to_node_id, edge_type, commit_sha, observed_at)" +
+        " VALUES (?, ?, ?, ?, ?, ?, ?)" +
+        " ON CONFLICT(edge_id, run_id) DO NOTHING")
+        .run(id, input.runId, observation.from, observation.to, observation.edgeType, input.commitSha, now);
+}
+function recordCorrection(driver, id, detail, now) {
+    recordCorrectionRow(driver, id, "wrong", detail, now);
+}
+function recordCorrectionRow(driver, id, verdict, reason, now) {
+    driver
+        .prepare("INSERT INTO edge_corrections (edge_id, verdict, reason, corrected_at) VALUES (?, ?, ?, ?)" +
+        " ON CONFLICT(edge_id) DO UPDATE SET verdict = excluded.verdict, reason = excluded.reason," +
+        " corrected_at = excluded.corrected_at")
+        .run(id, verdict, reason, now);
+}
+function promoteEdge(driver, id, runId) {
+    // Confidence goes to 1 with the resolution: R4 is unconditionally class A
+    // (DEC-115), and leaving a witnessed edge at the guess's own confidence
+    // would let a downstream ranker treat proof as inference.
+    driver
+        .prepare("UPDATE edges SET resolution = 4, observed_by_run = ?, confidence = 1.0 WHERE id = ?")
+        .run(runId, id);
+}
+function demoteEdge(driver, id) {
+    driver.prepare("UPDATE edges SET confidence = 0.0 WHERE id = ?").run(id);
+}
+function insertEdgeAtR4(driver, id, observation, runId, commitSha) {
+    // `run_id` must reference a real `adapter_runs` row (FK), and this edge was
+    // produced by a runtime observation rather than by any adapter — so the pass
+    // owns a run row of its own, created once and reused. Deleting it cascades
+    // exactly the edges this module minted and nothing else, which is the
+    // correct blast radius for invalidating a runtime producer.
+    const producerRunId = ensureRuntimeRun(driver, runId, commitSha);
+    driver
+        .prepare("INSERT INTO edges (id, source, target, type, resolution, confidence, produced_by, observed_by_run, attrs, run_id)" +
+        " VALUES (?, ?, ?, ?, 4, 1.0, ?, ?, NULL, ?)" +
+        " ON CONFLICT(id) DO UPDATE SET resolution = 4, confidence = 1.0, observed_by_run = excluded.observed_by_run")
+        .run(id, observation.from, observation.to, observation.edgeType, RUNTIME_PRODUCER, runId, producerRunId);
+}
+/** The `producedBy` every runtime-minted edge carries. Provenance is load-bearing (§11A.5). */
+export const RUNTIME_ADAPTER_ID = "runtime-confirmation";
+export const RUNTIME_ADAPTER_VERSION = "1";
+export const RUNTIME_PRODUCER = `${RUNTIME_ADAPTER_ID}@${RUNTIME_ADAPTER_VERSION}`;
+function ensureRuntimeRun(driver, runId, commitSha) {
+    const id = `runtime:${runId}`;
+    driver
+        .prepare("INSERT INTO adapter_runs (id, repo, workspace, commit_sha, adapter_id, adapter_version, produced_by," +
+        " reached_resolution, source_files, file_count, written_at)" +
+        " VALUES (?, '', NULL, ?, ?, ?, ?, 4, '[]', 0, ?)" +
+        " ON CONFLICT(id) DO NOTHING")
+        .run(id, commitSha, RUNTIME_ADAPTER_ID, RUNTIME_ADAPTER_VERSION, RUNTIME_PRODUCER, Date.now());
+    return id;
+}
+//# sourceMappingURL=runtime-confirmation.js.map

package/dist/graph/runtime-confirmation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runtime-confirmation.js","sourceRoot":"","sources":["../../src/graph/runtime-confirmation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsDG;AAEH,OAAO,EAAE,MAAM,EAAsE,MAAM,aAAa,CAAC;AAyEzG,MAAM,YAAY,GAAU,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;AAEtD;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAAiB,EACjB,KAA+B,EAC/B,QAAe,YAAY;IAE3B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,cAAc,GAAwB,EAAE,CAAC;IAC/C,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,MAAM,OAAO,GAAgC,EAAE,CAAC;IAEhD,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;IAExB,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE;QACtB,KAAK,MAAM,WAAW,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;YAC1E,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAEtC,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;gBACrB,kEAAkE;gBAClE,qEAAqE;gBACrE,iCAAiC;gBACjC,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC;gBACtE,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;oBACrB,OAAO,CAAC,IAAI,CAAC;wBACX,IAAI,EAAE,WAAW,CAAC,IAAI;wBACtB,EAAE,EAAE,WAAW,CAAC,EAAE;wBAClB,QAAQ,EAAE,WAAW,CAAC,QAAQ;wBAC9B,MAAM,EACJ,GAAG,OAAO,0CAA0C,WAAW,CAAC,QAAQ,kBAAkB;4BAC1F,qEAAqE;qBACxE,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;gBAED,kBAAkB,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;gBAExD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,cAAc,CAAC,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;oBACtE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnB,CAAC;qBAAM,IAAI,QAAQ,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;oBACnC,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;oBACrC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,CAAC;gBACD,SAAS;YACX,CAAC;YAED,YAAY;YACZ,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,WAAW,CAAC,IAAI;oBACtB,EAAE,EAAE,WAAW,CAAC,EAAE;oBAClB,QAAQ,EAAE,WAAW,CAAC,QAAQ;oBAC9B,MAAM,EACJ,MAAM,WAAW,CAAC,QAAQ,cAAc,WAAW,CAAC,IAAI,OAAO,WAAW,CAAC,EAAE,kBAAkB;wBAC/F,gEAAgE;iBACnE,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,IAAI,QAAQ,CAAC,UAAU,IAAI,CAAC,EAAE,CAAC;gBAC7B,wEAAwE;gBACxE,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,QAAQ,CAAC,eAAe,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;gBAClG,SAAS;YACX,CAAC;YAED,gBAAgB,CAAC,MAAM,EAAE,EAAE,EAAE,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACtD,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACvB,cAAc,CAAC,IAAI,CAAC;gBAClB,IAAI,EAAE,WAAW,CAAC,IAAI;gBACtB,EAAE,EAAE,WAAW,CAAC,EAAE;gBAClB,QAAQ,EAAE,WAAW,CAAC,QAAQ;gBAC9B,iBAAiB,EAAE,QAAQ,CAAC,UAAoD;gBAChF,MAAM,EAAE,WAAW,CAAC,MAAM;aAC3B,CAAC,CAAC;QACL,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC5E,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAAiB;IACrD,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IAEjF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAgC,EAAE,CAAC;IAEhD,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE;QACtB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACtD,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,QAAQ,EAAE,GAAG,CAAC,QAAQ;oBACtB,MAAM,EAAE,GAAG,OAAO,uCAAuC,GAAG,CAAC,KAAK,mCAAmC;iBACtG,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,cAAc,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;gBAClE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;iBAAM,IAAI,QAAQ,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;gBACnC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC3C,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,wEAAwE;YACxE,mEAAmE;YACnE,gEAAgE;YAChE,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,UAAU,GAAG,CAAC;gBAAE,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC;AACpF,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,aAAa,CAAC,MAAiB,EAAE,UAAuC,EAAE;IACxF,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC;IACrE,MAAM,GAAG,GACP,sFAAsF;QACtF,uBAAuB,KAAK,wCAAwC,CAAC;IACvE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChE,OAAO,MAAM;SACV,OAAO,CAQL,GAAG,CAAC;SACN,GAAG,CAAC,GAAG,IAAI,CAAC;SACZ,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,MAAM,EAAE,GAAG,CAAC,OAAO;QACnB,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,IAAI,EAAE,GAAG,CAAC,YAAY;QACtB,EAAE,EAAE,GAAG,CAAC,UAAU;QAClB,QAAQ,EAAE,GAAG,CAAC,SAAqB;QACnC,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,UAAU,EAAE,GAAG,CAAC,WAAW;KAC5B,CAAC,CAAC,CAAC;AACR,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,eAAe,CAAC,MAAiB;IAC/C,OAAO,MAAM;SACV,OAAO,CACN,4GAA4G,CAC7G;SACA,GAAG,EAAE;SACL,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,MAAM,EAAE,GAAG,CAAC,OAAO;QACnB,OAAO,EAAE,GAAG,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO;QACpD,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,WAAW,EAAE,GAAG,CAAC,YAAY;KAC9B,CAAC,CAAC,CAAC;AACR,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAiB,EACjB,KAAgJ,EAChJ,QAAe,YAAY;IAE3B,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACxD,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE;QACtB,mBAAmB,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1E,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,OAAO,KAAK,OAAO,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,UAAU,GAAG,CAAC;YAAE,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC7G,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AACxB,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,SAAS,QAAQ,CAAC,MAAiB,EAAE,EAAU;IAC7C,OAAO,MAAM;SACV,OAAO,CAAU,gEAAgE,CAAC;SAClF,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAChB,CAAC;AAED,uFAAuF;AACvF,SAAS,WAAW,CAAC,MAAiB,EAAE,IAAY,EAAE,EAAU;IAC9D,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAiB,mCAAmC,CAAC,CAAC;IACtF,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAClD,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC9C,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,kBAAkB,CACzB,MAAiB,EACjB,EAAU,EACV,KAA+B,EAC/B,WAAmC,EACnC,GAAW;IAEX,MAAM;SACH,OAAO,CACN,4GAA4G;QAC1G,+BAA+B;QAC/B,0CAA0C,CAC7C;SACA,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;AACxG,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAiB,EAAE,EAAU,EAAE,MAAc,EAAE,GAAW;IAClF,mBAAmB,CAAC,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAiB,EAAE,EAAU,EAAE,OAAe,EAAE,MAAc,EAAE,GAAW;IACtG,MAAM;SACH,OAAO,CACN,2FAA2F;QACzF,2FAA2F;QAC3F,uCAAuC,CAC1C;SACA,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAAC,MAAiB,EAAE,EAAU,EAAE,KAAa;IAC/D,0EAA0E;IAC1E,wEAAwE;IACxE,0DAA0D;IAC1D,MAAM;SACH,OAAO,CAAC,qFAAqF,CAAC;SAC9F,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACpB,CAAC;AAED,SAAS,UAAU,CAAC,MAAiB,EAAE,EAAU;IAC/C,MAAM,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC3E,CAAC;AAED,SAAS,cAAc,CACrB,MAAiB,EACjB,EAAU,EACV,WAAwF,EACxF,KAAa,EACb,SAAiB;IAEjB,4EAA4E;IAC5E,6EAA6E;IAC7E,2EAA2E;IAC3E,sEAAsE;IACtE,4DAA4D;IAC5D,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IACjE,MAAM;SACH,OAAO,CACN,mHAAmH;QACjH,6CAA6C;QAC7C,6GAA6G,CAChH;SACA,GAAG,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,QAAQ,EAAE,gBAAgB,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;AAC7G,CAAC;AAED,+FAA+F;AAC/F,MAAM,CAAC,MAAM,kBAAkB,GAAG,sBAAsB,CAAC;AACzD,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAC3C,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,kBAAkB,IAAI,uBAAuB,EAAE,CAAC;AAEnF,SAAS,gBAAgB,CAAC,MAAiB,EAAE,KAAa,EAAE,SAAiB;IAC3E,MAAM,EAAE,GAAG,WAAW,KAAK,EAAE,CAAC;IAC9B,MAAM;SACH,OAAO,CACN,sGAAsG;QACpG,4DAA4D;QAC5D,kDAAkD;QAClD,6BAA6B,CAChC;SACA,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IACjG,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,18 @@
+export declare const CORE_PACKAGE = "@descryy/core";
+export * from "./store/index.ts";
+export * from "./graph/index.ts";
+export * from "./query/index.ts";
+export * from "./worker/index.ts";
+export * from "./sources/git/index.ts";
+export * from "./sources/migrations/index.ts";
+export * from "./sources/workspace/index.ts";
+export * from "./scoping/index.ts";
+export * from "./contracts/index.ts";
+export * from "./capabilities/index.ts";
+export * from "./multipr/index.ts";
+export * from "./tiers/index.ts";
+export * from "./validation/index.ts";
+export * from "./ledger/index.ts";
+export * from "./recording/index.ts";
+export * from "./governance/index.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,eAAO,MAAM,YAAY,kBAAkB,CAAC;AAE5C,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,mBAAmB,CAAC;AAClC,cAAc,wBAAwB,CAAC;AACvC,cAAc,+BAA+B,CAAC;AAC9C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,oBAAoB,CAAC;AACnC,cAAc,sBAAsB,CAAC;AACrC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,uBAAuB,CAAC;AACtC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC;AACrC,cAAc,uBAAuB,CAAC"}

package/dist/index.js

@@ -0,0 +1,19 @@
+// @descryy/core — graph engine: storage, builder, query, traversal, scoping.
+export const CORE_PACKAGE = "@descryy/core";
+export * from "./store/index.js";
+export * from "./graph/index.js";
+export * from "./query/index.js";
+export * from "./worker/index.js";
+export * from "./sources/git/index.js";
+export * from "./sources/migrations/index.js";
+export * from "./sources/workspace/index.js";
+export * from "./scoping/index.js";
+export * from "./contracts/index.js";
+export * from "./capabilities/index.js";
+export * from "./multipr/index.js";
+export * from "./tiers/index.js";
+export * from "./validation/index.js";
+export * from "./ledger/index.js";
+export * from "./recording/index.js";
+export * from "./governance/index.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,MAAM,CAAC,MAAM,YAAY,GAAG,eAAe,CAAC;AAE5C,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,mBAAmB,CAAC;AAClC,cAAc,wBAAwB,CAAC;AACvC,cAAc,+BAA+B,CAAC;AAC9C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,oBAAoB,CAAC;AACnC,cAAc,sBAAsB,CAAC;AACrC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,uBAAuB,CAAC;AACtC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC;AACrC,cAAc,uBAAuB,CAAC"}

package/dist/ledger/index.d.ts

@@ -0,0 +1,5 @@
+export { candidateEnvNames, readDeclaredEnvValues, resolveAgainstDeclared, } from "./resolve.ts";
+export type { DeclaredEnvValue, LedgerAccessorResolution, ResolvedValue, } from "./resolve.ts";
+export { mintEdgesFromConfirmedFacts, MINT_PRODUCED_BY, MINT_SOURCE_ID, MINT_SOURCE_VERSION, } from "./mint.ts";
+export type { EndpointLookup, MintedEdge, MintResult, OrphanedAnswer, UnjoinableAnswer, } from "./mint.ts";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/ledger/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,iBAAiB,EACjB,qBAAqB,EACrB,sBAAsB,GACvB,MAAM,cAAc,CAAC;AACtB,YAAY,EACV,gBAAgB,EAChB,wBAAwB,EACxB,aAAa,GACd,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,2BAA2B,EAC3B,gBAAgB,EAChB,cAAc,EACd,mBAAmB,GACpB,MAAM,WAAW,CAAC;AACnB,YAAY,EACV,cAAc,EACd,UAAU,EACV,UAAU,EACV,cAAc,EACd,gBAAgB,GACjB,MAAM,WAAW,CAAC"}

package/dist/ledger/index.js

@@ -0,0 +1,3 @@
+export { candidateEnvNames, readDeclaredEnvValues, resolveAgainstDeclared, } from "./resolve.js";
+export { mintEdgesFromConfirmedFacts, MINT_PRODUCED_BY, MINT_SOURCE_ID, MINT_SOURCE_VERSION, } from "./mint.js";
+//# sourceMappingURL=index.js.map

package/dist/ledger/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/ledger/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,iBAAiB,EACjB,qBAAqB,EACrB,sBAAsB,GACvB,MAAM,cAAc,CAAC;AAOtB,OAAO,EACL,2BAA2B,EAC3B,gBAAgB,EAChB,cAAc,EACd,mBAAmB,GACpB,MAAM,WAAW,CAAC"}

package/dist/ledger/mint.d.ts

@@ -0,0 +1,81 @@
+/**
+ * DEC-223's answer half, minting side.
+ *
+ * `applyConfirmedFacts` (`../query/confirmed-facts.ts`) decides *which*
+ * refusal-ledger rows a confirmed fact answers. It deliberately does not
+ * mint an edge — it has no target to join against, and said so in its own
+ * header. This module owns that join.
+ *
+ * The confirmed base URL is testimony: it tells us the call is real, not
+ * dynamic, and gives a human's word for what the blocked expression
+ * evaluates to. It is **not** what identifies the endpoint. DEC-054 makes
+ * `API_ENDPOINT` identity `METHOD + normalisedPath`, base-independent by
+ * design — the same mechanism that lets a caller in one repository and a
+ * route in another join on nothing but a shared path template. What
+ * identifies the endpoint here is the row's own `attrs.path`/`attrs.method`
+ * — the relative path adapter-typescript already read from the call site,
+ * before the base blocked it (DEC-260's `templateSuffixAfterFirstSpan`).
+ *
+ * No match, no edge. A row whose candidate id is not in the supplied graph
+ * is reported as an orphan — never guessed into existence (rule 2) and
+ * never silently dropped (rule 5).
+ */
+import type { ConfirmedFact, IdentityScope, IREdge, UnresolvedRef } from "@descryy/ir";
+import type { ConfirmedFactMatch } from "../query/confirmed-facts.ts";
+/**
+ * This module's own `producedBy`, on the same pattern as `git-history`'s
+ * (`sources/git/source.ts`) — a core-owned synthetic producer, not a
+ * language adapter. A minted edge's invalidation is scoped to this id, never
+ * to whichever adapter produced the endpoint or the caller it joins.
+ */
+export declare const MINT_SOURCE_ID = "ledger-mint";
+export declare const MINT_SOURCE_VERSION = "0.1.0";
+export declare const MINT_PRODUCED_BY = "ledger-mint@0.1.0";
+export interface MintedEdge {
+    readonly edge: IREdge;
+    readonly ref: UnresolvedRef;
+    /** Every fact that grounded this edge — see `ConfirmedFactMatch.facts`; never narrowed to one. */
+    readonly facts: readonly ConfirmedFact[];
+}
+/** A row a confirmed fact answered, but whose candidate endpoint matches no known route. */
+export interface OrphanedAnswer {
+    readonly ref: UnresolvedRef;
+    readonly path: string;
+    readonly method: string;
+    readonly candidateEndpointId: string;
+}
+/** A row a confirmed fact answered, but which carries no resolved path/method to join with at all. */
+export interface UnjoinableAnswer {
+    readonly ref: UnresolvedRef;
+    readonly reason: string;
+}
+export interface MintResult {
+    readonly minted: readonly MintedEdge[];
+    readonly orphaned: readonly OrphanedAnswer[];
+    readonly unjoinable: readonly UnjoinableAnswer[];
+}
+/** The one thing mint needs from `AdjacencyProvider` — kept narrow rather than importing the whole query-layer type. */
+export interface EndpointLookup {
+    node(id: string): {
+        readonly id: string;
+    } | undefined;
+}
+/**
+ * Join `applyConfirmedFacts`'s `answered` rows against a real endpoint graph.
+ *
+ * `scope` is the *caller's* identity scope (its own repo, plus the workspace
+ * it shares with whichever repository serves the route) — `API_ENDPOINT`
+ * being workspace-scoped means the repo half is discarded by `scopeOf`
+ * whenever a workspace is set, so passing the caller's own repo here is
+ * correct even though the target endpoint may live in a different one.
+ *
+ * `currentCommit` is the repo's `commitSha` for *this* run (`root.commitSha`
+ * at the call site) — compared against each fact's own `confirmedAtCommit`
+ * so a minted edge discloses whether the human answer it rests on was given
+ * against the code as it stands today. This is the disclosure floor named in
+ * the item this closes, not re-verification: nobody re-checks the fact
+ * against a live source, the edge just stops reading as unconditionally
+ * current when it isn't.
+ */
+export declare function mintEdgesFromConfirmedFacts(matches: readonly ConfirmedFactMatch[], endpoints: EndpointLookup, scope: IdentityScope, producedBy: string, currentCommit?: string): MintResult;
+//# sourceMappingURL=mint.d.ts.map

package/dist/ledger/mint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mint.d.ts","sourceRoot":"","sources":["../../src/ledger/mint.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAGvF,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAgBtE;;;;;GAKG;AACH,eAAO,MAAM,cAAc,gBAAgB,CAAC;AAC5C,eAAO,MAAM,mBAAmB,UAAU,CAAC;AAC3C,eAAO,MAAM,gBAAgB,sBAA6C,CAAC;AAE3E,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;IAC5B,kGAAkG;IAClG,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;CAC1C;AAED,4FAA4F;AAC5F,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC;CACtC;AAED,sGAAsG;AACtG,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,CAAC;IACvC,QAAQ,CAAC,QAAQ,EAAE,SAAS,cAAc,EAAE,CAAC;IAC7C,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;CAClD;AAED,wHAAwH;AACxH,MAAM,WAAW,cAAc;IAC7B,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS,CAAC;CACvD;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,SAAS,kBAAkB,EAAE,EACtC,SAAS,EAAE,cAAc,EACzB,KAAK,EAAE,aAAa,EACpB,UAAU,EAAE,MAAM,EAClB,aAAa,CAAC,EAAE,MAAM,GACrB,UAAU,CAkFZ"}

package/dist/ledger/mint.js

@@ -0,0 +1,138 @@
+/**
+ * DEC-223's answer half, minting side.
+ *
+ * `applyConfirmedFacts` (`../query/confirmed-facts.ts`) decides *which*
+ * refusal-ledger rows a confirmed fact answers. It deliberately does not
+ * mint an edge — it has no target to join against, and said so in its own
+ * header. This module owns that join.
+ *
+ * The confirmed base URL is testimony: it tells us the call is real, not
+ * dynamic, and gives a human's word for what the blocked expression
+ * evaluates to. It is **not** what identifies the endpoint. DEC-054 makes
+ * `API_ENDPOINT` identity `METHOD + normalisedPath`, base-independent by
+ * design — the same mechanism that lets a caller in one repository and a
+ * route in another join on nothing but a shared path template. What
+ * identifies the endpoint here is the row's own `attrs.path`/`attrs.method`
+ * — the relative path adapter-typescript already read from the call site,
+ * before the base blocked it (DEC-260's `templateSuffixAfterFirstSpan`).
+ *
+ * No match, no edge. A row whose candidate id is not in the supplied graph
+ * is reported as an orphan — never guessed into existence (rule 2) and
+ * never silently dropped (rule 5).
+ */
+import { endpointQsp, nodeId, reliabilityCap, reliabilityNote } from "@descryy/ir";
+/**
+ * The evidence a minted edge rests on: a name-level path/method match against
+ * a real route, the same strength any other resolved `USES_API` join in this
+ * adapter carries (`extract.ts` mints those at `resolution: 2` too) — plus
+ * `humanAsserted: true` for the base itself, which `reliabilityCap` treats as
+ * a second, independent ceiling. At R2 with `nameLevel: true` the structural
+ * cap is A; `humanAsserted` pulls that down to B. Not asserted directly —
+ * computed below, so the class actually reported is whatever the two
+ * arguments produce, not a hardcoded "B".
+ */
+const MINT_RESOLUTION = 2;
+const MINT_NAME_LEVEL = true;
+const MINT_CONFIDENCE = 0.9;
+/**
+ * This module's own `producedBy`, on the same pattern as `git-history`'s
+ * (`sources/git/source.ts`) — a core-owned synthetic producer, not a
+ * language adapter. A minted edge's invalidation is scoped to this id, never
+ * to whichever adapter produced the endpoint or the caller it joins.
+ */
+export const MINT_SOURCE_ID = "ledger-mint";
+export const MINT_SOURCE_VERSION = "0.1.0";
+export const MINT_PRODUCED_BY = `${MINT_SOURCE_ID}@${MINT_SOURCE_VERSION}`;
+/**
+ * Join `applyConfirmedFacts`'s `answered` rows against a real endpoint graph.
+ *
+ * `scope` is the *caller's* identity scope (its own repo, plus the workspace
+ * it shares with whichever repository serves the route) — `API_ENDPOINT`
+ * being workspace-scoped means the repo half is discarded by `scopeOf`
+ * whenever a workspace is set, so passing the caller's own repo here is
+ * correct even though the target endpoint may live in a different one.
+ *
+ * `currentCommit` is the repo's `commitSha` for *this* run (`root.commitSha`
+ * at the call site) — compared against each fact's own `confirmedAtCommit`
+ * so a minted edge discloses whether the human answer it rests on was given
+ * against the code as it stands today. This is the disclosure floor named in
+ * the item this closes, not re-verification: nobody re-checks the fact
+ * against a live source, the edge just stops reading as unconditionally
+ * current when it isn't.
+ */
+export function mintEdgesFromConfirmedFacts(matches, endpoints, scope, producedBy, currentCommit) {
+    const minted = [];
+    const orphaned = [];
+    const unjoinable = [];
+    for (const match of matches) {
+        const { ref, facts } = match;
+        const path = ref.attrs?.["path"];
+        const method = ref.attrs?.["method"];
+        if (typeof path !== "string" || path === "" || typeof method !== "string" || method === "") {
+            unjoinable.push({
+                ref,
+                reason: "a confirmed value answers this row's blockedBy, but the row carries no resolved " +
+                    "path/method to join against an endpoint — refusing rather than guessing one",
+            });
+            continue;
+        }
+        const id = nodeId(scope, "API_ENDPOINT", endpointQsp(method, path), null);
+        const target = endpoints.node(id);
+        if (target === undefined) {
+            orphaned.push({ ref, path, method, candidateEndpointId: id });
+            continue;
+        }
+        const reliabilityClass = reliabilityCap(MINT_RESOLUTION, MINT_NAME_LEVEL, true);
+        const note = reliabilityNote(MINT_RESOLUTION, MINT_NAME_LEVEL, true);
+        // Staleness disclosure (the item this closes): "current" only when both
+        // this run's commit and the fact's own commit are known and equal;
+        // "stale" when both are known and differ; "unknown" when either is
+        // missing — a fact confirmed before `confirmedAtCommit` existed, or a run
+        // with no commit available, is disclosed as unknown rather than assumed
+        // fresh. `staleFact` on the edge is `true` the moment any grounding fact
+        // is not affirmatively current, so a consumer can filter on one field
+        // without re-deriving this per-fact logic.
+        const factFreshness = facts.map((f) => {
+            const staleness = currentCommit === undefined || f.confirmedAtCommit === undefined
+                ? "unknown"
+                : f.confirmedAtCommit === currentCommit
+                    ? "current"
+                    : "stale";
+            return { fact: f, staleness };
+        });
+        const staleFact = factFreshness.some((f) => f.staleness !== "current");
+        minted.push({
+            ref,
+            facts,
+            edge: {
+                from: ref.fromNodeId,
+                to: id,
+                type: "USES_API",
+                resolution: MINT_RESOLUTION,
+                confidence: MINT_CONFIDENCE,
+                producedBy,
+                attrs: {
+                    humanAsserted: true,
+                    reliabilityClass,
+                    reliabilityNote: note,
+                    blockedBy: ref.attrs?.["blockedBy"],
+                    staleFact,
+                    // Every fact that answered this row, verbatim — never collapsed to
+                    // one value. A row genuinely answered by facts scoped to two
+                    // different environments stays disclosed as two, not silently
+                    // narrowed to whichever sorted first.
+                    confirmedFacts: factFreshness.map(({ fact: f, staleness }) => ({
+                        value: f.value,
+                        ...(f.environment === undefined ? {} : { environment: f.environment }),
+                        confirmedBy: f.confirmedBy,
+                        confirmedAt: f.confirmedAt,
+                        ...(f.confirmedAtCommit === undefined ? {} : { confirmedAtCommit: f.confirmedAtCommit }),
+                        staleness,
+                    })),
+                },
+            },
+        });
+    }
+    return { minted, orphaned, unjoinable };
+}
+//# sourceMappingURL=mint.js.map

package/dist/ledger/mint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mint.js","sourceRoot":"","sources":["../../src/ledger/mint.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAGH,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAInF;;;;;;;;;GASG;AACH,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,eAAe,GAAG,IAAI,CAAC;AAC7B,MAAM,eAAe,GAAG,GAAG,CAAC;AAE5B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,aAAa,CAAC;AAC5C,MAAM,CAAC,MAAM,mBAAmB,GAAG,OAAO,CAAC;AAC3C,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,cAAc,IAAI,mBAAmB,EAAE,CAAC;AAkC3E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,2BAA2B,CACzC,OAAsC,EACtC,SAAyB,EACzB,KAAoB,EACpB,UAAkB,EAClB,aAAsB;IAEtB,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAqB,EAAE,CAAC;IACtC,MAAM,UAAU,GAAuB,EAAE,CAAC;IAE1C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;QAC7B,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,EAAE,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;YAC3F,UAAU,CAAC,IAAI,CAAC;gBACd,GAAG;gBACH,MAAM,EACJ,kFAAkF;oBAClF,6EAA6E;aAChF,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAC1E,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,mBAAmB,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9D,SAAS;QACX,CAAC;QAED,MAAM,gBAAgB,GAAG,cAAc,CAAC,eAAe,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;QAChF,MAAM,IAAI,GAAG,eAAe,CAAC,eAAe,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;QAErE,wEAAwE;QACxE,mEAAmE;QACnE,mEAAmE;QACnE,0EAA0E;QAC1E,wEAAwE;QACxE,yEAAyE;QACzE,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACpC,MAAM,SAAS,GACb,aAAa,KAAK,SAAS,IAAI,CAAC,CAAC,iBAAiB,KAAK,SAAS;gBAC9D,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,CAAC,CAAC,iBAAiB,KAAK,aAAa;oBACrC,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,OAAO,CAAC;YAChB,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC;QAChC,CAAC,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QAEvE,MAAM,CAAC,IAAI,CAAC;YACV,GAAG;YACH,KAAK;YACL,IAAI,EAAE;gBACJ,IAAI,EAAE,GAAG,CAAC,UAAU;gBACpB,EAAE,EAAE,EAAE;gBACN,IAAI,EAAE,UAAU;gBAChB,UAAU,EAAE,eAAe;gBAC3B,UAAU,EAAE,eAAe;gBAC3B,UAAU;gBACV,KAAK,EAAE;oBACL,aAAa,EAAE,IAAI;oBACnB,gBAAgB;oBAChB,eAAe,EAAE,IAAI;oBACrB,SAAS,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC;oBACnC,SAAS;oBACT,mEAAmE;oBACnE,6DAA6D;oBAC7D,8DAA8D;oBAC9D,sCAAsC;oBACtC,cAAc,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;wBAC7D,KAAK,EAAE,CAAC,CAAC,KAAK;wBACd,GAAG,CAAC,CAAC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;wBACtE,WAAW,EAAE,CAAC,CAAC,WAAW;wBAC1B,WAAW,EAAE,CAAC,CAAC,WAAW;wBAC1B,GAAG,CAAC,CAAC,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC,iBAAiB,EAAE,CAAC;wBACxF,SAAS;qBACV,CAAC,CAAC;iBACJ;aACF;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AAC1C,CAAC"}