@mneme-ai/core 2.19.46 → 2.19.48

package/dist/chronosheaf/sheaf.d.ts

@@ -0,0 +1,116 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-a · sheaf cohomology over ℝ-valued presheaves.
+ *
+ *   Math foundation (Leray / Grothendieck / Čech):
+ *
+ *     For a base space X (we model as a finite set of "sites"), an open
+ *     cover U = {U₀, U₁, ...}, and a presheaf F : Open(X)ᵒᵖ → Vec_ℝ,
+ *     the Čech complex is
+ *
+ *       Č^p(U, F) = ⊕_{i₀<…<i_p} F(U_{i₀} ∩ … ∩ U_{i_p})
+ *
+ *     with coboundary
+ *
+ *       (δσ)_{i₀…i_{p+1}} = Σ_{k=0}^{p+1} (−1)^k · ρ(σ_{i₀…î_k…i_{p+1}})
+ *
+ *     and the p-th Čech cohomology
+ *
+ *       H^p(U, F) = ker δ^p / im δ^{p−1}.
+ *
+ *     We focus on H¹: dim H¹(U, F) = (number of independent 1-cocycles)
+ *     − (number of independent 1-coboundaries). H¹ ≠ 0 ⟺ there exist
+ *     local sections that agree pairwise on overlaps but cannot be glued
+ *     into a single global section — the canonical "local OK, global
+ *     contradiction" signal CHRONOSHEAF chases.
+ *
+ *   Implementation strategy (performance + accuracy):
+ *
+ *     We restrict to ℝ-valued (scalar) sections per site — sufficient
+ *     for the AI-memory use case where each verifier returns a single
+ *     number per overlap (a "claim value"). For overlaps the restriction
+ *     map is the identity on ℝ.
+ *
+ *     The δ⁰ matrix is the signed incidence of pairs to sites:
+ *
+ *       δ⁰[ij, k] = +1 if k == j,  −1 if k == i,  0 otherwise
+ *
+ *     For overlaps with NO triple overlap (most code-base covers), every
+ *     1-cochain is automatically a cocycle (ker δ¹ = whole space), so
+ *
+ *       dim H¹ = E − rank(δ⁰)
+ *
+ *     where E is the number of pairs and rank(δ⁰) = N − c (vertices N
+ *     minus connected components c of the nerve 1-skeleton). This
+ *     reduces to a graph-theoretic computation that runs in O(N + E).
+ *
+ *     When triple overlaps exist we compute δ¹ explicitly and rank-reduce
+ *     via integer Gaussian elimination (O(min(E,T)² · max(E,T))) — fast
+ *     enough for a Mneme catalog cover of a few hundred sites.
+ *
+ *   Composes with PAIN-001 (time-direction), PAIN-004 (self-reference
+ *   via reflexive cover), PAIN-005 (interface-coherence as global section).
+ */
+export type Site = string;
+export interface SheafCover {
+    /** Sites (open sets) — identified by string keys. */
+    sites: ReadonlyArray<Site>;
+    /** Pairwise overlaps as unordered pairs [i, j] with i < j (by sites index). */
+    overlaps: ReadonlyArray<[Site, Site]>;
+    /** Optional triple overlaps [i, j, k] with i < j < k. */
+    triples?: ReadonlyArray<[Site, Site, Site]>;
+}
+/** Section on each site (the 0-cochain): site → real value. */
+export type Section0 = ReadonlyMap<Site, number>;
+/** Section on each overlap (the 1-cochain): pair-key → real value. */
+export type Section1 = ReadonlyMap<string, number>;
+export interface SheafResult {
+    /** Number of 1-cochains (= |overlaps|). */
+    cochainDim: number;
+    /** rank δ⁰ — dim image of 0→1 coboundary. */
+    rankDelta0: number;
+    /** Estimated dim ker δ¹. With no triples = |overlaps|. */
+    kerDelta1: number;
+    /** dim H¹ = ker δ¹ − im δ⁰. ≥0 by construction. */
+    h1: number;
+    /** True when H¹ > 0 — pairwise OK but globally inconsistent. */
+    hasObstruction: boolean;
+    /** Minimal witnesses: 1-cochains that are cocycles but not coboundaries. */
+    obstructions: Array<{
+        pair: [Site, Site];
+        value: number;
+    }>;
+    /** Connected components of the nerve 1-skeleton (auxiliary). */
+    components: number;
+}
+/**
+ * Compute δ⁰(σ) for a 0-cochain σ — returns 1-cochain on every overlap.
+ *   (δ⁰σ)_{ij} = σ_j − σ_i.
+ */
+export declare function delta0(cover: SheafCover, sigma0: Section0): Section1;
+/**
+ * Compute δ¹(σ) for a 1-cochain σ — returns 2-cochain on every triple.
+ *   (δ¹σ)_{ijk} = σ_{jk} − σ_{ik} + σ_{ij}.
+ */
+export declare function delta1(cover: SheafCover, sigma1: Section1): Map<string, number>;
+/** Check the cocycle condition δ¹σ = 0 on all triples. */
+export declare function isCocycle(cover: SheafCover, sigma1: Section1, tol?: number): boolean;
+/**
+ * Compute dim H¹(U, F) by reducing to graph connectivity when triples
+ * are absent + Gaussian elimination when they're present.
+ */
+export declare function cohomologyH1(cover: SheafCover): SheafResult;
+/**
+ * Given a presheaf assignment (each site → numeric "claim value"), check
+ * whether the implied pairwise differences glue: returns the same
+ * SheafResult plus the gluing-residual vector.
+ *
+ *   residual_{ij} = (claim_j - claim_i) restricted to U_i ∩ U_j
+ *
+ * If H¹ = 0, the residual lies in im δ⁰ → there exists a global section
+ * (effectively the user's claim values are all consistent). If H¹ > 0,
+ * the residual carries a non-trivial cocycle component.
+ */
+export declare function gluingDiagnostic(cover: SheafCover, claimPerSite: Section0): SheafResult & {
+    residual: Section1;
+};
+//# sourceMappingURL=sheaf.d.ts.map

package/dist/chronosheaf/sheaf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sheaf.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/sheaf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AAEH,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAE1B,MAAM,WAAW,UAAU;IACzB,qDAAqD;IACrD,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;IAC3B,+EAA+E;IAC/E,QAAQ,EAAE,aAAa,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACtC,yDAAyD;IACzD,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;CAC7C;AAED,+DAA+D;AAC/D,MAAM,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAEjD,sEAAsE;AACtE,MAAM,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEnD,MAAM,WAAW,WAAW;IAC1B,2CAA2C;IAC3C,UAAU,EAAE,MAAM,CAAC;IACnB,6CAA6C;IAC7C,UAAU,EAAE,MAAM,CAAC;IACnB,0DAA0D;IAC1D,SAAS,EAAE,MAAM,CAAC;IAClB,mDAAmD;IACnD,EAAE,EAAE,MAAM,CAAC;IACX,gEAAgE;IAChE,cAAc,EAAE,OAAO,CAAC;IACxB,4EAA4E;IAC5E,YAAY,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC3D,gEAAgE;IAChE,UAAU,EAAE,MAAM,CAAC;CACpB;AAkCD;;;GAGG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,GAAG,QAAQ,CASpE;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAY/E;AAED,0DAA0D;AAC1D,wBAAgB,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,SAAO,GAAG,OAAO,CAKlF;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,UAAU,GAAG,WAAW,CAkD3D;AAiDD;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,QAAQ,GAAG,WAAW,GAAG;IAAE,QAAQ,EAAE,QAAQ,CAAA;CAAE,CAIhH"}

package/dist/chronosheaf/sheaf.js

@@ -0,0 +1,278 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-a · sheaf cohomology over ℝ-valued presheaves.
+ *
+ *   Math foundation (Leray / Grothendieck / Čech):
+ *
+ *     For a base space X (we model as a finite set of "sites"), an open
+ *     cover U = {U₀, U₁, ...}, and a presheaf F : Open(X)ᵒᵖ → Vec_ℝ,
+ *     the Čech complex is
+ *
+ *       Č^p(U, F) = ⊕_{i₀<…<i_p} F(U_{i₀} ∩ … ∩ U_{i_p})
+ *
+ *     with coboundary
+ *
+ *       (δσ)_{i₀…i_{p+1}} = Σ_{k=0}^{p+1} (−1)^k · ρ(σ_{i₀…î_k…i_{p+1}})
+ *
+ *     and the p-th Čech cohomology
+ *
+ *       H^p(U, F) = ker δ^p / im δ^{p−1}.
+ *
+ *     We focus on H¹: dim H¹(U, F) = (number of independent 1-cocycles)
+ *     − (number of independent 1-coboundaries). H¹ ≠ 0 ⟺ there exist
+ *     local sections that agree pairwise on overlaps but cannot be glued
+ *     into a single global section — the canonical "local OK, global
+ *     contradiction" signal CHRONOSHEAF chases.
+ *
+ *   Implementation strategy (performance + accuracy):
+ *
+ *     We restrict to ℝ-valued (scalar) sections per site — sufficient
+ *     for the AI-memory use case where each verifier returns a single
+ *     number per overlap (a "claim value"). For overlaps the restriction
+ *     map is the identity on ℝ.
+ *
+ *     The δ⁰ matrix is the signed incidence of pairs to sites:
+ *
+ *       δ⁰[ij, k] = +1 if k == j,  −1 if k == i,  0 otherwise
+ *
+ *     For overlaps with NO triple overlap (most code-base covers), every
+ *     1-cochain is automatically a cocycle (ker δ¹ = whole space), so
+ *
+ *       dim H¹ = E − rank(δ⁰)
+ *
+ *     where E is the number of pairs and rank(δ⁰) = N − c (vertices N
+ *     minus connected components c of the nerve 1-skeleton). This
+ *     reduces to a graph-theoretic computation that runs in O(N + E).
+ *
+ *     When triple overlaps exist we compute δ¹ explicitly and rank-reduce
+ *     via integer Gaussian elimination (O(min(E,T)² · max(E,T))) — fast
+ *     enough for a Mneme catalog cover of a few hundred sites.
+ *
+ *   Composes with PAIN-001 (time-direction), PAIN-004 (self-reference
+ *   via reflexive cover), PAIN-005 (interface-coherence as global section).
+ */
+/** Key for an unordered pair (canonical i<j by lex order of strings). */
+function pairKey(a, b) {
+    return a < b ? `${a}${b}` : `${b}${a}`;
+}
+/** Union-Find for connected components. */
+class UnionFind {
+    parent = new Map();
+    rank = new Map();
+    add(x) { if (!this.parent.has(x)) {
+        this.parent.set(x, x);
+        this.rank.set(x, 0);
+    } }
+    find(x) {
+        let root = x;
+        while (this.parent.get(root) !== root)
+            root = this.parent.get(root);
+        let cur = x;
+        while (cur !== root) {
+            const next = this.parent.get(cur);
+            this.parent.set(cur, root);
+            cur = next;
+        }
+        return root;
+    }
+    union(a, b) {
+        const ra = this.find(a);
+        const rb = this.find(b);
+        if (ra === rb)
+            return;
+        const r1 = this.rank.get(ra) ?? 0;
+        const r2 = this.rank.get(rb) ?? 0;
+        if (r1 < r2)
+            this.parent.set(ra, rb);
+        else if (r1 > r2)
+            this.parent.set(rb, ra);
+        else {
+            this.parent.set(rb, ra);
+            this.rank.set(ra, r1 + 1);
+        }
+    }
+    countComponents() {
+        const roots = new Set();
+        for (const k of this.parent.keys())
+            roots.add(this.find(k));
+        return roots.size;
+    }
+}
+/**
+ * Compute δ⁰(σ) for a 0-cochain σ — returns 1-cochain on every overlap.
+ *   (δ⁰σ)_{ij} = σ_j − σ_i.
+ */
+export function delta0(cover, sigma0) {
+    const out = new Map();
+    for (const [a, b] of cover.overlaps) {
+        const va = sigma0.get(a) ?? 0;
+        const vb = sigma0.get(b) ?? 0;
+        const key = pairKey(a, b);
+        out.set(key, (a < b ? vb - va : va - vb));
+    }
+    return out;
+}
+/**
+ * Compute δ¹(σ) for a 1-cochain σ — returns 2-cochain on every triple.
+ *   (δ¹σ)_{ijk} = σ_{jk} − σ_{ik} + σ_{ij}.
+ */
+export function delta1(cover, sigma1) {
+    const out = new Map();
+    if (!cover.triples)
+        return out;
+    for (const [i, j, k] of cover.triples) {
+        const get = (a, b) => {
+            const v = sigma1.get(pairKey(a, b)) ?? 0;
+            return a < b ? v : -v;
+        };
+        const tripleKey = [i, j, k].sort().join("");
+        out.set(tripleKey, get(j, k) - get(i, k) + get(i, j));
+    }
+    return out;
+}
+/** Check the cocycle condition δ¹σ = 0 on all triples. */
+export function isCocycle(cover, sigma1, tol = 1e-9) {
+    if (!cover.triples)
+        return true;
+    const d = delta1(cover, sigma1);
+    for (const v of d.values())
+        if (Math.abs(v) > tol)
+            return false;
+    return true;
+}
+/**
+ * Compute dim H¹(U, F) by reducing to graph connectivity when triples
+ * are absent + Gaussian elimination when they're present.
+ */
+export function cohomologyH1(cover) {
+    // Build connected components of the nerve 1-skeleton.
+    const uf = new UnionFind();
+    for (const s of cover.sites)
+        uf.add(s);
+    for (const [a, b] of cover.overlaps) {
+        uf.add(a);
+        uf.add(b);
+        uf.union(a, b);
+    }
+    const components = uf.countComponents();
+    const E = cover.overlaps.length;
+    const N = cover.sites.length;
+    // rank δ⁰ = N - c (number of independent edges in a spanning forest).
+    const rankDelta0 = Math.max(0, N - components);
+    // dim ker δ¹: when no triples, every 1-cochain is a cocycle → ker = E.
+    // When triples exist, we count rank δ¹ and ker = E - rank δ¹.
+    let kerDelta1 = E;
+    if (cover.triples && cover.triples.length > 0) {
+        const rankD1 = rankOfDelta1(cover);
+        kerDelta1 = Math.max(0, E - rankD1);
+    }
+    const h1 = Math.max(0, kerDelta1 - rankDelta0);
+    // Minimal obstruction witnesses: pairs whose value is the largest
+    // contributors to H¹. We approximate via cycle space of the multigraph:
+    // any edge NOT in a spanning forest is part of an independent cycle and
+    // contributes to H¹ when there are no triple overlaps to kill it.
+    const inForest = new Set();
+    const uf2 = new UnionFind();
+    for (const s of cover.sites)
+        uf2.add(s);
+    const obstructions = [];
+    for (const [a, b] of cover.overlaps) {
+        uf2.add(a);
+        uf2.add(b);
+        if (uf2.find(a) !== uf2.find(b)) {
+            uf2.union(a, b);
+            inForest.add(pairKey(a, b));
+        }
+        else {
+            // This edge closes a cycle → contributes to H¹ when triples don't kill it.
+            obstructions.push({ pair: [a, b], value: 1 });
+        }
+    }
+    return {
+        cochainDim: E,
+        rankDelta0,
+        kerDelta1,
+        h1,
+        hasObstruction: h1 > 0,
+        obstructions: obstructions.slice(0, h1),
+        components,
+    };
+}
+/**
+ * Rank of δ¹ via integer Gaussian elimination on the {-1, 0, +1}
+ * matrix indexed by triples (rows) × pairs (columns).
+ */
+function rankOfDelta1(cover) {
+    const triples = cover.triples ?? [];
+    if (triples.length === 0)
+        return 0;
+    const pairCols = new Map();
+    cover.overlaps.forEach((p, idx) => pairCols.set(pairKey(p[0], p[1]), idx));
+    const rows = [];
+    for (const [i, j, k] of triples) {
+        const row = new Array(cover.overlaps.length).fill(0);
+        const sign = (a, b) => (a < b ? 1 : -1);
+        const col = (a, b) => pairCols.get(pairKey(a, b)) ?? -1;
+        const cij = col(i, j);
+        if (cij >= 0)
+            row[cij] += sign(i, j);
+        const cjk = col(j, k);
+        if (cjk >= 0)
+            row[cjk] += sign(j, k);
+        const cik = col(i, k);
+        if (cik >= 0)
+            row[cik] -= sign(i, k);
+        rows.push(row);
+    }
+    return gaussianRank(rows);
+}
+/** Row-reduce + return rank. Pure integer arithmetic in this code path. */
+function gaussianRank(rows) {
+    if (rows.length === 0)
+        return 0;
+    const m = rows.length;
+    const n = rows[0].length;
+    const A = rows.map((r) => [...r]);
+    let rank = 0;
+    let col = 0;
+    for (let row = 0; row < m && col < n; col++) {
+        let pivot = -1;
+        for (let r = row; r < m; r++)
+            if ((A[r][col] ?? 0) !== 0) {
+                pivot = r;
+                break;
+            }
+        if (pivot < 0)
+            continue;
+        [A[row], A[pivot]] = [A[pivot], A[row]];
+        const piv = A[row][col];
+        for (let r = 0; r < m; r++) {
+            if (r === row)
+                continue;
+            const factor = (A[r][col] ?? 0) / piv;
+            if (factor === 0)
+                continue;
+            for (let c = col; c < n; c++)
+                A[r][c] = (A[r][c] ?? 0) - factor * (A[row][c] ?? 0);
+        }
+        rank++;
+        row++;
+    }
+    return rank;
+}
+/**
+ * Given a presheaf assignment (each site → numeric "claim value"), check
+ * whether the implied pairwise differences glue: returns the same
+ * SheafResult plus the gluing-residual vector.
+ *
+ *   residual_{ij} = (claim_j - claim_i) restricted to U_i ∩ U_j
+ *
+ * If H¹ = 0, the residual lies in im δ⁰ → there exists a global section
+ * (effectively the user's claim values are all consistent). If H¹ > 0,
+ * the residual carries a non-trivial cocycle component.
+ */
+export function gluingDiagnostic(cover, claimPerSite) {
+    const h1 = cohomologyH1(cover);
+    const residual = delta0(cover, claimPerSite);
+    return { ...h1, residual };
+}
+//# sourceMappingURL=sheaf.js.map

package/dist/chronosheaf/sheaf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sheaf.js","sourceRoot":"","sources":["../../src/chronosheaf/sheaf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmDG;AAoCH,yEAAyE;AACzE,SAAS,OAAO,CAAC,CAAO,EAAE,CAAO;IAC/B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;AACzC,CAAC;AAED,2CAA2C;AAC3C,MAAM,SAAS;IACb,MAAM,GAAG,IAAI,GAAG,EAAc,CAAC;IAC/B,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAC;IAC/B,GAAG,CAAC,CAAO,IAAU,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAAC,CAAC,CAAC,CAAC;IAC/F,IAAI,CAAC,CAAO;QACV,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QACrE,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;YAAC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAAC,GAAG,GAAG,IAAI,CAAC;QAAC,CAAC;QACpG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,KAAK,CAAC,CAAO,EAAE,CAAO;QACpB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAAC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,EAAE,GAAG,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;aAChC,IAAI,EAAE,GAAG,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;aACrC,CAAC;YAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAAC,CAAC;IAC9D,CAAC;IACD,eAAe;QACb,MAAM,KAAK,GAAG,IAAI,GAAG,EAAQ,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,KAAiB,EAAE,MAAgB;IACxD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,KAAiB,EAAE,MAAgB;IACxD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,IAAI,CAAC,KAAK,CAAC,OAAO;QAAE,OAAO,GAAG,CAAC;IAC/B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,CAAC,CAAO,EAAE,CAAO,EAAU,EAAE;YACvC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACzC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,CAAC;QACF,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5C,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,SAAS,CAAC,KAAiB,EAAE,MAAgB,EAAE,GAAG,GAAG,IAAI;IACvE,IAAI,CAAC,KAAK,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;IAChE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAiB;IAC5C,sDAAsD;IACtD,MAAM,EAAE,GAAG,IAAI,SAAS,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAAC,CAAC;IAC9E,MAAM,UAAU,GAAG,EAAE,CAAC,eAAe,EAAE,CAAC;IACxC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;IAChC,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;IAE7B,sEAAsE;IACtE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;IAE/C,uEAAuE;IACvE,8DAA8D;IAC9D,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,UAAU,CAAC,CAAC;IAE/C,kEAAkE;IAClE,wEAAwE;IACxE,wEAAwE;IACxE,kEAAkE;IAClE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,SAAS,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxC,MAAM,YAAY,GAAgC,EAAE,CAAC;IACrD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChB,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,2EAA2E;YAC3E,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,OAAO;QACL,UAAU,EAAE,CAAC;QACb,UAAU;QACV,SAAS;QACT,EAAE;QACF,cAAc,EAAE,EAAE,GAAG,CAAC;QACtB,YAAY,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;QACvC,UAAU;KACX,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,KAAiB;IACrC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC;IACpC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC3E,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,CAAC,CAAO,EAAE,CAAO,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,CAAC,CAAO,EAAE,CAAO,EAAU,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,IAAI,GAAG,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,IAAI,GAAG,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAAC,IAAI,GAAG,IAAI,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED,2EAA2E;AAC3E,SAAS,YAAY,CAAC,IAAgB;IACpC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC;IACjD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QAC5C,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAC,KAAK,GAAG,CAAC,CAAC;gBAAC,MAAM;YAAC,CAAC;QAChF,IAAI,KAAK,GAAG,CAAC;YAAE,SAAS;QACxB,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAE,EAAE,CAAC,CAAC,GAAG,CAAE,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAE,CAAC,GAAG,CAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG;gBAAE,SAAS;YACxB,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;YACvC,IAAI,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC3B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,EAAE,CAAC;QACP,GAAG,EAAE,CAAC;IACR,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAiB,EAAE,YAAsB;IACxE,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAC7C,OAAO,EAAE,GAAG,EAAE,EAAE,QAAQ,EAAE,CAAC;AAC7B,CAAC"}

package/dist/chronosheaf/tropical.d.ts

@@ -0,0 +1,98 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-f · tropical semiring (max-plus algebra).
+ *
+ *   Math foundation (Maslov / Litvinov / Pin):
+ *
+ *     The tropical (max-plus) semiring (ℝ ∪ {−∞}, ⊕, ⊗) replaces
+ *
+ *       a ⊕ b = max(a, b)
+ *       a ⊗ b = a + b
+ *       0_⊕   = −∞
+ *       1_⊗   = 0
+ *
+ *     Linear algebra over this semiring computes shortest / longest paths
+ *     in weighted graphs WITHOUT iteration: matrix product A ⊗ B has
+ *     entry (A ⊗ B)_{ij} = max_k (A_{ik} + B_{kj}). The "tropical
+ *     polynomial" min/max of sums is exactly the Bellman-Ford fixed
+ *     point. Inference in tropical algebra is shortest-path inference
+ *     in polyhedral fans — and the BOTTLENECK edge (the one that
+ *     determines the max) is always uniquely identifiable: there is
+ *     ONE critical edge whose perturbation perturbs the result, the
+ *     rest are slack. This makes tropical inference INTERPRETABLE in
+ *     a way that real-number ML rarely is.
+ *
+ *   AI-memory mapping (PAIN-005 interface-coherence + PAIN-006
+ *   confidence):
+ *
+ *     Verifier chains compose tropically. If verifier A returns confidence
+ *     c_A and B returns c_B and we combine sequentially, the
+ *     bottleneck is min(c_A, c_B) — exactly a tropical operation. The
+ *     critical edge tells you which verifier is the weakest link, which
+ *     gives an interpretable explanation for any composite confidence
+ *     number (PAIN-006 fix: instead of "60%" we say "60% limited by
+ *     verifier B which scored 60%; raise B to raise overall").
+ *
+ *   Implementation: graph as adjacency map; Bellman-Ford with critical-
+ *   edge tracking. Pure-function; O(V·E).
+ */
+export declare const TROPICAL_ZERO: number;
+export declare const TROPICAL_ONE = 0;
+/** Tropical addition: a ⊕ b = max(a, b). */
+export declare function tropicalAdd(a: number, b: number): number;
+/** Tropical multiplication: a ⊗ b = a + b. */
+export declare function tropicalMul(a: number, b: number): number;
+/** Graph for tropical shortest/longest path. */
+export interface TropicalGraph {
+    nodes: ReadonlyArray<string>;
+    /** Directed edges: from → [{to, weight}]. */
+    edges: ReadonlyMap<string, ReadonlyArray<{
+        to: string;
+        weight: number;
+        label?: string;
+    }>>;
+}
+export interface TropicalPathResult {
+    source: string;
+    target: string;
+    /** Optimal value (sum of weights along the best path). */
+    value: number;
+    /** Sequence of nodes in the path. */
+    path: string[];
+    /** Sequence of edges with their weights. */
+    edges: Array<{
+        from: string;
+        to: string;
+        weight: number;
+        label?: string;
+    }>;
+    /** The CRITICAL (bottleneck) edge — the one whose perturbation changes the result. */
+    criticalEdge: {
+        from: string;
+        to: string;
+        weight: number;
+        label?: string;
+    } | null;
+}
+/**
+ * Longest-path computation (semiring with ⊕ = max). For shortest-path,
+ * negate all weights first. We do not allow positive cycles (would
+ * diverge); throws if detected.
+ */
+export declare function tropicalLongestPath(graph: TropicalGraph, source: string, target: string): TropicalPathResult | null;
+/**
+ * Verifier chain composition. Each verifier outputs a confidence
+ * c ∈ [0, 1]; chain confidence = min over the chain (worst-link).
+ * Returns the chain value PLUS the critical verifier so we can
+ * explain WHY confidence is what it is (PAIN-006 interpretability).
+ */
+export declare function verifierChainConfidence(chain: ReadonlyArray<{
+    id: string;
+    confidence: number;
+}>): {
+    chainConfidence: number;
+    criticalVerifier: {
+        id: string;
+        confidence: number;
+    } | null;
+};
+//# sourceMappingURL=tropical.d.ts.map

package/dist/chronosheaf/tropical.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tropical.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/tropical.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,eAAO,MAAM,aAAa,QAAY,CAAC;AACvC,eAAO,MAAM,YAAY,IAAK,CAAC;AAE/B,4CAA4C;AAC5C,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAA2B;AACpF,8CAA8C;AAC9C,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAkB;AAE3E,gDAAgD;AAChD,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;IAC7B,6CAA6C;IAC7C,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;CAC3F;AAED,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,0DAA0D;IAC1D,KAAK,EAAE,MAAM,CAAC;IACd,qCAAqC;IACrC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,4CAA4C;IAC5C,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAC3E,sFAAsF;IACtF,YAAY,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC;CACnF;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,kBAAkB,GAAG,IAAI,CA8DnH;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,aAAa,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,GACvD;IAAE,eAAe,EAAE,MAAM,CAAC;IAAC,gBAAgB,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAA;CAAE,CAK1F"}

package/dist/chronosheaf/tropical.js

@@ -0,0 +1,140 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-f · tropical semiring (max-plus algebra).
+ *
+ *   Math foundation (Maslov / Litvinov / Pin):
+ *
+ *     The tropical (max-plus) semiring (ℝ ∪ {−∞}, ⊕, ⊗) replaces
+ *
+ *       a ⊕ b = max(a, b)
+ *       a ⊗ b = a + b
+ *       0_⊕   = −∞
+ *       1_⊗   = 0
+ *
+ *     Linear algebra over this semiring computes shortest / longest paths
+ *     in weighted graphs WITHOUT iteration: matrix product A ⊗ B has
+ *     entry (A ⊗ B)_{ij} = max_k (A_{ik} + B_{kj}). The "tropical
+ *     polynomial" min/max of sums is exactly the Bellman-Ford fixed
+ *     point. Inference in tropical algebra is shortest-path inference
+ *     in polyhedral fans — and the BOTTLENECK edge (the one that
+ *     determines the max) is always uniquely identifiable: there is
+ *     ONE critical edge whose perturbation perturbs the result, the
+ *     rest are slack. This makes tropical inference INTERPRETABLE in
+ *     a way that real-number ML rarely is.
+ *
+ *   AI-memory mapping (PAIN-005 interface-coherence + PAIN-006
+ *   confidence):
+ *
+ *     Verifier chains compose tropically. If verifier A returns confidence
+ *     c_A and B returns c_B and we combine sequentially, the
+ *     bottleneck is min(c_A, c_B) — exactly a tropical operation. The
+ *     critical edge tells you which verifier is the weakest link, which
+ *     gives an interpretable explanation for any composite confidence
+ *     number (PAIN-006 fix: instead of "60%" we say "60% limited by
+ *     verifier B which scored 60%; raise B to raise overall").
+ *
+ *   Implementation: graph as adjacency map; Bellman-Ford with critical-
+ *   edge tracking. Pure-function; O(V·E).
+ */
+export const TROPICAL_ZERO = -Infinity; // 0 in (R∪{-∞}, ⊕)
+export const TROPICAL_ONE = 0; // 1 in (R∪{-∞}, ⊗)
+/** Tropical addition: a ⊕ b = max(a, b). */
+export function tropicalAdd(a, b) { return Math.max(a, b); }
+/** Tropical multiplication: a ⊗ b = a + b. */
+export function tropicalMul(a, b) { return a + b; }
+/**
+ * Longest-path computation (semiring with ⊕ = max). For shortest-path,
+ * negate all weights first. We do not allow positive cycles (would
+ * diverge); throws if detected.
+ */
+export function tropicalLongestPath(graph, source, target) {
+    // Bellman-Ford on the max-plus semiring.
+    const dist = new Map();
+    const pred = new Map();
+    for (const n of graph.nodes)
+        dist.set(n, TROPICAL_ZERO);
+    dist.set(source, TROPICAL_ONE);
+    const V = graph.nodes.length;
+    let changed = true;
+    let iters = 0;
+    while (changed && iters < V) {
+        changed = false;
+        iters++;
+        for (const [u, out] of graph.edges) {
+            const du = dist.get(u) ?? TROPICAL_ZERO;
+            if (du === TROPICAL_ZERO)
+                continue;
+            for (const { to, weight, label } of out) {
+                const candidate = tropicalMul(du, weight);
+                const dv = dist.get(to) ?? TROPICAL_ZERO;
+                if (candidate > dv) {
+                    dist.set(to, candidate);
+                    const p = { from: u, weight };
+                    if (label !== undefined)
+                        p.label = label;
+                    pred.set(to, p);
+                    changed = true;
+                }
+            }
+        }
+    }
+    // Detect positive cycles: one more pass; if anything improves, throw.
+    for (const [u, out] of graph.edges) {
+        const du = dist.get(u) ?? TROPICAL_ZERO;
+        if (du === TROPICAL_ZERO)
+            continue;
+        for (const { to, weight } of out) {
+            if (tropicalMul(du, weight) > (dist.get(to) ?? TROPICAL_ZERO)) {
+                throw new Error(`tropicalLongestPath: positive cycle reachable through ${u}→${to}`);
+            }
+        }
+    }
+    const targetVal = dist.get(target);
+    if (targetVal === undefined || targetVal === TROPICAL_ZERO)
+        return null;
+    // Reconstruct path.
+    const reverseNodes = [target];
+    const reverseEdges = [];
+    let cur = target;
+    let safety = 0;
+    while (cur !== source && safety++ < V + 1) {
+        const p = pred.get(cur);
+        if (!p)
+            return null;
+        const edge = { from: p.from, to: cur, weight: p.weight };
+        if (p.label !== undefined)
+            edge.label = p.label;
+        reverseEdges.push(edge);
+        reverseNodes.push(p.from);
+        cur = p.from;
+    }
+    const path = reverseNodes.reverse();
+    const edges = reverseEdges.reverse();
+    // Critical edge: the one with the smallest weight along the path
+    // (the bottleneck under min-of-sums). Equivalently, the edge whose
+    // ε-perturbation perturbs the path value 1:1 (slack-free edge).
+    let critical = null;
+    let minWeight = Infinity;
+    for (const e of edges) {
+        if (e.weight < minWeight) {
+            minWeight = e.weight;
+            critical = e;
+        }
+    }
+    return { source, target, value: targetVal, path, edges, criticalEdge: critical };
+}
+/**
+ * Verifier chain composition. Each verifier outputs a confidence
+ * c ∈ [0, 1]; chain confidence = min over the chain (worst-link).
+ * Returns the chain value PLUS the critical verifier so we can
+ * explain WHY confidence is what it is (PAIN-006 interpretability).
+ */
+export function verifierChainConfidence(chain) {
+    if (chain.length === 0)
+        return { chainConfidence: 1, criticalVerifier: null };
+    let worst = chain[0];
+    for (const v of chain)
+        if (v.confidence < worst.confidence)
+            worst = v;
+    return { chainConfidence: worst.confidence, criticalVerifier: worst };
+}
+//# sourceMappingURL=tropical.js.map

package/dist/chronosheaf/tropical.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tropical.js","sourceRoot":"","sources":["../../src/chronosheaf/tropical.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,QAAQ,CAAC,CAAK,mBAAmB;AAC/D,MAAM,CAAC,MAAM,YAAY,GAAI,CAAC,CAAC,CAAa,mBAAmB;AAE/D,4CAA4C;AAC5C,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS,IAAY,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACpF,8CAA8C;AAC9C,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS,IAAY,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAsB3E;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAoB,EAAE,MAAc,EAAE,MAAc;IACtF,yCAAyC;IACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAA4D,CAAC;IACjF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;IACxD,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;IAC7B,IAAI,OAAO,GAAG,IAAI,CAAC;IAAC,IAAI,KAAK,GAAG,CAAC,CAAC;IAClC,OAAO,OAAO,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO,GAAG,KAAK,CAAC;QAAC,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC;YACxC,IAAI,EAAE,KAAK,aAAa;gBAAE,SAAS;YACnC,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC;gBACxC,MAAM,SAAS,GAAG,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,aAAa,CAAC;gBACzC,IAAI,SAAS,GAAG,EAAE,EAAE,CAAC;oBACnB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;oBACxB,MAAM,CAAC,GAAqD,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;oBAChF,IAAI,KAAK,KAAK,SAAS;wBAAE,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;oBACzC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;oBAChB,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,sEAAsE;IACtE,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC;QACxC,IAAI,EAAE,KAAK,aAAa;YAAE,SAAS;QACnC,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACjC,IAAI,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,aAAa,CAAC,EAAE,CAAC;gBAC9D,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtF,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,aAAa;QAAE,OAAO,IAAI,CAAC;IACxE,oBAAoB;IACpB,MAAM,YAAY,GAAa,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,YAAY,GAAgC,EAAE,CAAC;IACrD,IAAI,GAAG,GAAG,MAAM,CAAC;IACjB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,GAAG,KAAK,MAAM,IAAI,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAC7C,MAAM,IAAI,GAAiE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;QACvH,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAChD,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC;IACf,CAAC;IACD,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;IACrC,iEAAiE;IACjE,mEAAmE;IACnE,gEAAgE;IAChE,IAAI,QAAQ,GAAuC,IAAI,CAAC;IACxD,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;YAAC,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC;YAAC,QAAQ,GAAG,CAAC,CAAC;QAAC,CAAC;IACnE,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC;AACnF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAwD;IAExD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,eAAe,EAAE,CAAC,EAAE,gBAAgB,EAAE,IAAI,EAAE,CAAC;IAC9E,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU;YAAE,KAAK,GAAG,CAAC,CAAC;IACtE,OAAO,EAAE,eAAe,EAAE,KAAK,CAAC,UAAU,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC;AACxE,CAAC"}