@mneme-ai/core 2.19.47 → 2.19.48

package/dist/chronosheaf/base_space.d.ts

@@ -0,0 +1,125 @@
+/**
+ * v2.19.48 — CHRONOSHEAF P3 · base space + presheaf.
+ *
+ *   Math formalism (P3 spec verbatim):
+ *
+ *     X = G × T × S
+ *
+ *     where:
+ *       G = commit DAG (partial order on commit shas)
+ *       T = wall-clock time (continuous ℝ, modelled as ms since epoch)
+ *       S = scale axis (file ⊂ module ⊂ package ⊂ repo ⊂ org, 5 levels)
+ *
+ *     Open sets U ⊆ X are tuples (commit-cone, time-interval, scale-band).
+ *     A commit-cone is the down-set of a commit in G (all ancestors).
+ *
+ *     Presheaf F: Open(X)ᵒᵖ → Vec_ℝ assigns to each open U the set of
+ *     locally consistent beliefs over claims relevant to U. Restriction
+ *     map ρ_{U⊃V}: F(U) → F(V) is "if I believe B over U I must
+ *     believe B over V" — projection onto the smaller open set.
+ *
+ *   Implementation notes (performance + accuracy + safety):
+ *
+ *     - All open-set operations are pure-function + idempotent.
+ *     - Commit-cone membership uses cached transitive closure to amortise
+ *       O(1) lookup after first traversal.
+ *     - Scale axis is a 5-band ordinal enum so subset checks are O(1).
+ *     - Time intervals are half-open [t_start, t_end) for clean union /
+ *       intersection algebra.
+ *     - Error handling: every constructor validates inputs; every accessor
+ *       returns a typed Result rather than throwing on missing data.
+ */
+export type CommitSha = string;
+export type TimeMs = number;
+export declare const SCALE_BANDS: readonly ["file", "module", "package", "repo", "org"];
+export type ScaleBand = typeof SCALE_BANDS[number];
+/** Bidirectional commit DAG with ancestor-set memoisation. */
+export declare class CommitDag {
+    private parents;
+    private ancestorCache;
+    /** Add a commit with its parent list (may be empty for root). */
+    addCommit(sha: CommitSha, parents: ReadonlyArray<CommitSha>): void;
+    /** All ancestors of sha (including sha itself). Cached. */
+    cone(sha: CommitSha): ReadonlySet<CommitSha>;
+    /** Whether ancestor is in the ancestor-cone of descendant. */
+    isAncestorOf(ancestor: CommitSha, descendant: CommitSha): boolean;
+    size(): number;
+}
+/** Half-open time interval [start, end). */
+export interface TimeInterval {
+    startMs: TimeMs;
+    endMs: TimeMs;
+}
+export declare function makeInterval(startMs: TimeMs, endMs: TimeMs): TimeInterval;
+export declare function intervalContains(iv: TimeInterval, t: TimeMs): boolean;
+export declare function intervalIntersect(a: TimeInterval, b: TimeInterval): TimeInterval | null;
+/** Ordinal index of a scale band (file=0, module=1, ...). */
+export declare function scaleIndex(s: ScaleBand): number;
+/** Scale band a ⊆ b ⟺ idx(a) ≤ idx(b). */
+export declare function scaleSubset(a: ScaleBand, b: ScaleBand): boolean;
+/**
+ * Open set in X = G × T × S — a triple (commit-cone-root, time-interval, scale).
+ * Closed under finite intersection (intersection of two opens is an open).
+ */
+export interface OpenSet {
+    /** Identifier for the open set (deterministic id from contents). */
+    id: string;
+    /** Root commit defining the down-set on G. */
+    commitConeRoot: CommitSha;
+    /** Time interval on T. */
+    time: TimeInterval;
+    /** Scale band on S — the scale at which the open is observed. */
+    scale: ScaleBand;
+}
+export declare function openSetId(root: CommitSha, time: TimeInterval, scale: ScaleBand): string;
+export declare function makeOpen(root: CommitSha, time: TimeInterval, scale: ScaleBand): OpenSet;
+/**
+ * Intersection of two opens. Uses CommitDag to find the latest-common-
+ * ancestor (LCA) of the two roots; if no shared ancestor exists, the
+ * intersection is empty (null).
+ *
+ *   open(r1, [s1,e1), b1) ∩ open(r2, [s2,e2), b2)
+ *     = open(LCA(r1, r2), [max(s1,s2), min(e1,e2)), min(b1, b2))
+ *
+ * Returns null when either time-intervals are disjoint OR no common
+ * ancestor exists in the DAG.
+ */
+export declare function intersectOpens(dag: CommitDag, a: OpenSet, b: OpenSet): OpenSet | null;
+/** Belief value carried by the presheaf at an open: a finite-dim ℝ vector. */
+export type BeliefVector = ReadonlyArray<number>;
+/**
+ * Presheaf F: Open(X)ᵒᵖ → Vec_ℝ.
+ *
+ * Backed by a Map keyed by openSetId. The restriction map ρ_{U⊃V} is
+ * a linear operator from ℝ^|claims(U)| → ℝ^|claims(V)|; in this
+ * implementation we restrict by intersecting claim sets (vectors
+ * indexed by the SAME claim list across opens that contain a
+ * specific claim).
+ *
+ * Errors:
+ *   - assignSection rejects non-finite values OR length mismatches with
+ *     the registered claim cardinality.
+ *   - sectionAt returns Result rather than throwing on missing key.
+ */
+export declare class Presheaf {
+    private sections;
+    private claimsByOpen;
+    /** Register the claim set whose belief values an open carries. */
+    registerClaims(open: OpenSet, claims: ReadonlyArray<string>): void;
+    /** Assign a belief vector to an open. Vector length must match registered claim count. */
+    assignSection(open: OpenSet, belief: BeliefVector): void;
+    /** Look up a section. Returns null when missing — never throws. */
+    sectionAt(open: OpenSet): BeliefVector | null;
+    /** Claims known at an open. */
+    claimsAt(open: OpenSet): ReadonlyArray<string>;
+    /**
+     * Restriction map ρ_{U⊃V}: F(U) → F(V).
+     * Implementation: for each claim in V's claim set, find its position
+     * in U's claim set and copy the value. Claims in V but not in U get
+     * 0 (default-untracked).
+     */
+    restrict(uOpen: OpenSet, vOpen: OpenSet): BeliefVector | null;
+    /** Number of opens with assigned sections. */
+    size(): number;
+}
+//# sourceMappingURL=base_space.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"base_space.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/base_space.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC;AAC/B,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAE5B,eAAO,MAAM,WAAW,uDAAwD,CAAC;AACjF,MAAM,MAAM,SAAS,GAAG,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC;AAEnD,8DAA8D;AAC9D,qBAAa,SAAS;IACpB,OAAO,CAAC,OAAO,CAAgD;IAC/D,OAAO,CAAC,aAAa,CAAwC;IAE7D,iEAAiE;IACjE,SAAS,CAAC,GAAG,EAAE,SAAS,EAAE,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,GAAG,IAAI;IASlE,2DAA2D;IAC3D,IAAI,CAAC,GAAG,EAAE,SAAS,GAAG,WAAW,CAAC,SAAS,CAAC;IAe5C,8DAA8D;IAC9D,YAAY,CAAC,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,GAAG,OAAO;IAIjE,IAAI,IAAI,MAAM;CACf;AAED,4CAA4C;AAC5C,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,YAAY,CAQzE;AAED,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAErE;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,YAAY,GAAG,IAAI,CAIvF;AAED,6DAA6D;AAC7D,wBAAgB,UAAU,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAAmC;AAEnF,0CAA0C;AAC1C,wBAAgB,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAE/D;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,oEAAoE;IACpE,EAAE,EAAE,MAAM,CAAC;IACX,8CAA8C;IAC9C,cAAc,EAAE,SAAS,CAAC;IAC1B,0BAA0B;IAC1B,IAAI,EAAE,YAAY,CAAC;IACnB,iEAAiE;IACjE,KAAK,EAAE,SAAS,CAAC;CAClB;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,GAAG,MAAM,CAEvF;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,GAAG,OAAO,CAQvF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,IAAI,CAkBrF;AAED,8EAA8E;AAC9E,MAAM,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;AAEjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,QAAQ;IACnB,OAAO,CAAC,QAAQ,CAAmC;IACnD,OAAO,CAAC,YAAY,CAA4C;IAEhE,kEAAkE;IAClE,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,IAAI;IAKlE,0FAA0F;IAC1F,aAAa,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,GAAG,IAAI;IAcxD,mEAAmE;IACnE,SAAS,CAAC,IAAI,EAAE,OAAO,GAAG,YAAY,GAAG,IAAI;IAI7C,+BAA+B;IAC/B,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC;IAI9C;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,YAAY,GAAG,IAAI;IAgB7D,8CAA8C;IAC9C,IAAI,IAAI,MAAM;CACf"}

package/dist/chronosheaf/base_space.js

@@ -0,0 +1,216 @@
+/**
+ * v2.19.48 — CHRONOSHEAF P3 · base space + presheaf.
+ *
+ *   Math formalism (P3 spec verbatim):
+ *
+ *     X = G × T × S
+ *
+ *     where:
+ *       G = commit DAG (partial order on commit shas)
+ *       T = wall-clock time (continuous ℝ, modelled as ms since epoch)
+ *       S = scale axis (file ⊂ module ⊂ package ⊂ repo ⊂ org, 5 levels)
+ *
+ *     Open sets U ⊆ X are tuples (commit-cone, time-interval, scale-band).
+ *     A commit-cone is the down-set of a commit in G (all ancestors).
+ *
+ *     Presheaf F: Open(X)ᵒᵖ → Vec_ℝ assigns to each open U the set of
+ *     locally consistent beliefs over claims relevant to U. Restriction
+ *     map ρ_{U⊃V}: F(U) → F(V) is "if I believe B over U I must
+ *     believe B over V" — projection onto the smaller open set.
+ *
+ *   Implementation notes (performance + accuracy + safety):
+ *
+ *     - All open-set operations are pure-function + idempotent.
+ *     - Commit-cone membership uses cached transitive closure to amortise
+ *       O(1) lookup after first traversal.
+ *     - Scale axis is a 5-band ordinal enum so subset checks are O(1).
+ *     - Time intervals are half-open [t_start, t_end) for clean union /
+ *       intersection algebra.
+ *     - Error handling: every constructor validates inputs; every accessor
+ *       returns a typed Result rather than throwing on missing data.
+ */
+export const SCALE_BANDS = ["file", "module", "package", "repo", "org"];
+/** Bidirectional commit DAG with ancestor-set memoisation. */
+export class CommitDag {
+    parents = new Map();
+    ancestorCache = new Map();
+    /** Add a commit with its parent list (may be empty for root). */
+    addCommit(sha, parents) {
+        if (typeof sha !== "string" || sha.length === 0) {
+            throw new TypeError(`CommitDag.addCommit: invalid sha "${sha}"`);
+        }
+        this.parents.set(sha, new Set(parents));
+        // Invalidate ancestor cache for sha + descendants (cheap: clear all).
+        this.ancestorCache.clear();
+    }
+    /** All ancestors of sha (including sha itself). Cached. */
+    cone(sha) {
+        if (this.ancestorCache.has(sha))
+            return this.ancestorCache.get(sha);
+        const visited = new Set();
+        const stack = [sha];
+        while (stack.length > 0) {
+            const cur = stack.pop();
+            if (visited.has(cur))
+                continue;
+            visited.add(cur);
+            const ps = this.parents.get(cur);
+            if (ps)
+                for (const p of ps)
+                    if (!visited.has(p))
+                        stack.push(p);
+        }
+        this.ancestorCache.set(sha, visited);
+        return visited;
+    }
+    /** Whether ancestor is in the ancestor-cone of descendant. */
+    isAncestorOf(ancestor, descendant) {
+        return this.cone(descendant).has(ancestor);
+    }
+    size() { return this.parents.size; }
+}
+export function makeInterval(startMs, endMs) {
+    if (!Number.isFinite(startMs) || !Number.isFinite(endMs)) {
+        throw new TypeError(`makeInterval: non-finite bounds [${startMs}, ${endMs})`);
+    }
+    if (endMs < startMs) {
+        throw new RangeError(`makeInterval: empty/inverted interval [${startMs}, ${endMs})`);
+    }
+    return { startMs, endMs };
+}
+export function intervalContains(iv, t) {
+    return t >= iv.startMs && t < iv.endMs;
+}
+export function intervalIntersect(a, b) {
+    const s = Math.max(a.startMs, b.startMs);
+    const e = Math.min(a.endMs, b.endMs);
+    return s < e ? { startMs: s, endMs: e } : null;
+}
+/** Ordinal index of a scale band (file=0, module=1, ...). */
+export function scaleIndex(s) { return SCALE_BANDS.indexOf(s); }
+/** Scale band a ⊆ b ⟺ idx(a) ≤ idx(b). */
+export function scaleSubset(a, b) {
+    return scaleIndex(a) <= scaleIndex(b);
+}
+export function openSetId(root, time, scale) {
+    return root + "@" + time.startMs + "-" + time.endMs + "/" + scale;
+}
+export function makeOpen(root, time, scale) {
+    if (typeof root !== "string" || root.length === 0) {
+        throw new TypeError(`makeOpen: invalid commit "${root}"`);
+    }
+    if (!SCALE_BANDS.includes(scale)) {
+        throw new TypeError(`makeOpen: invalid scale "${scale}"`);
+    }
+    return { id: openSetId(root, time, scale), commitConeRoot: root, time, scale };
+}
+/**
+ * Intersection of two opens. Uses CommitDag to find the latest-common-
+ * ancestor (LCA) of the two roots; if no shared ancestor exists, the
+ * intersection is empty (null).
+ *
+ *   open(r1, [s1,e1), b1) ∩ open(r2, [s2,e2), b2)
+ *     = open(LCA(r1, r2), [max(s1,s2), min(e1,e2)), min(b1, b2))
+ *
+ * Returns null when either time-intervals are disjoint OR no common
+ * ancestor exists in the DAG.
+ */
+export function intersectOpens(dag, a, b) {
+    const time = intervalIntersect(a.time, b.time);
+    if (!time)
+        return null;
+    // LCA via cone-intersection on the DAG.
+    const coneA = dag.cone(a.commitConeRoot);
+    const coneB = dag.cone(b.commitConeRoot);
+    let lca = null;
+    // Walk the shared set; the LCA is the one whose own cone is the
+    // largest subset of the intersection (deepest commit).
+    let largestConeSize = 0;
+    for (const sha of coneA) {
+        if (!coneB.has(sha))
+            continue;
+        const cs = dag.cone(sha).size;
+        if (cs > largestConeSize) {
+            largestConeSize = cs;
+            lca = sha;
+        }
+    }
+    if (lca === null)
+        return null;
+    const scale = scaleIndex(a.scale) <= scaleIndex(b.scale) ? a.scale : b.scale;
+    return makeOpen(lca, time, scale);
+}
+/**
+ * Presheaf F: Open(X)ᵒᵖ → Vec_ℝ.
+ *
+ * Backed by a Map keyed by openSetId. The restriction map ρ_{U⊃V} is
+ * a linear operator from ℝ^|claims(U)| → ℝ^|claims(V)|; in this
+ * implementation we restrict by intersecting claim sets (vectors
+ * indexed by the SAME claim list across opens that contain a
+ * specific claim).
+ *
+ * Errors:
+ *   - assignSection rejects non-finite values OR length mismatches with
+ *     the registered claim cardinality.
+ *   - sectionAt returns Result rather than throwing on missing key.
+ */
+export class Presheaf {
+    sections = new Map();
+    claimsByOpen = new Map();
+    /** Register the claim set whose belief values an open carries. */
+    registerClaims(open, claims) {
+        if (!Array.isArray(claims))
+            throw new TypeError("registerClaims: claims must be an array");
+        this.claimsByOpen.set(open.id, [...claims]);
+    }
+    /** Assign a belief vector to an open. Vector length must match registered claim count. */
+    assignSection(open, belief) {
+        const claims = this.claimsByOpen.get(open.id);
+        if (!claims)
+            throw new Error(`Presheaf.assignSection: no claims registered for ${open.id}`);
+        if (belief.length !== claims.length) {
+            throw new RangeError(`Presheaf.assignSection: belief length ${belief.length} ≠ claims ${claims.length} for ${open.id}`);
+        }
+        for (const v of belief) {
+            if (!Number.isFinite(v)) {
+                throw new RangeError(`Presheaf.assignSection: non-finite value in belief for ${open.id}`);
+            }
+        }
+        this.sections.set(open.id, [...belief]);
+    }
+    /** Look up a section. Returns null when missing — never throws. */
+    sectionAt(open) {
+        return this.sections.get(open.id) ?? null;
+    }
+    /** Claims known at an open. */
+    claimsAt(open) {
+        return this.claimsByOpen.get(open.id) ?? [];
+    }
+    /**
+     * Restriction map ρ_{U⊃V}: F(U) → F(V).
+     * Implementation: for each claim in V's claim set, find its position
+     * in U's claim set and copy the value. Claims in V but not in U get
+     * 0 (default-untracked).
+     */
+    restrict(uOpen, vOpen) {
+        const uBelief = this.sectionAt(uOpen);
+        if (!uBelief)
+            return null;
+        const uClaims = this.claimsAt(uOpen);
+        const vClaims = this.claimsAt(vOpen);
+        if (vClaims.length === 0)
+            return [];
+        const uIndex = new Map();
+        uClaims.forEach((c, i) => uIndex.set(c, i));
+        const out = new Array(vClaims.length).fill(0);
+        for (let j = 0; j < vClaims.length; j++) {
+            const k = uIndex.get(vClaims[j]);
+            if (k !== undefined)
+                out[j] = uBelief[k] ?? 0;
+        }
+        return out;
+    }
+    /** Number of opens with assigned sections. */
+    size() { return this.sections.size; }
+}
+//# sourceMappingURL=base_space.js.map

package/dist/chronosheaf/base_space.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base_space.js","sourceRoot":"","sources":["../../src/chronosheaf/base_space.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAKH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAU,CAAC;AAGjF,8DAA8D;AAC9D,MAAM,OAAO,SAAS;IACZ,OAAO,GAAG,IAAI,GAAG,EAAqC,CAAC;IACvD,aAAa,GAAG,IAAI,GAAG,EAA6B,CAAC;IAE7D,iEAAiE;IACjE,SAAS,CAAC,GAAc,EAAE,OAAiC;QACzD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,SAAS,CAAC,qCAAqC,GAAG,GAAG,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACxC,sEAAsE;QACtE,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,2DAA2D;IAC3D,IAAI,CAAC,GAAc;QACjB,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QACrE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAa,CAAC;QACrC,MAAM,KAAK,GAAgB,CAAC,GAAG,CAAC,CAAC;QACjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACzB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,EAAE;gBAAE,KAAK,MAAM,CAAC,IAAI,EAAE;oBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACrC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,8DAA8D;IAC9D,YAAY,CAAC,QAAmB,EAAE,UAAqB;QACrD,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7C;AAQD,MAAM,UAAU,YAAY,CAAC,OAAe,EAAE,KAAa;IACzD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,SAAS,CAAC,oCAAoC,OAAO,KAAK,KAAK,GAAG,CAAC,CAAC;IAChF,CAAC;IACD,IAAI,KAAK,GAAG,OAAO,EAAE,CAAC;QACpB,MAAM,IAAI,UAAU,CAAC,0CAA0C,OAAO,KAAK,KAAK,GAAG,CAAC,CAAC;IACvF,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,EAAgB,EAAE,CAAS;IAC1D,OAAO,CAAC,IAAI,EAAE,CAAC,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,CAAe,EAAE,CAAe;IAChE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IACzC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACrC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACjD,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,UAAU,CAAC,CAAY,IAAY,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEnF,0CAA0C;AAC1C,MAAM,UAAU,WAAW,CAAC,CAAY,EAAE,CAAY;IACpD,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAiBD,MAAM,UAAU,SAAS,CAAC,IAAe,EAAE,IAAkB,EAAE,KAAgB;IAC7E,OAAO,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,GAAG,GAAG,KAAK,CAAC;AACpE,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,IAAe,EAAE,IAAkB,EAAE,KAAgB;IAC5E,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,SAAS,CAAC,6BAA6B,IAAI,GAAG,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,SAAS,CAAC,4BAA4B,KAAK,GAAG,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACjF,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,GAAc,EAAE,CAAU,EAAE,CAAU;IACnE,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,wCAAwC;IACxC,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;IACzC,IAAI,GAAG,GAAqB,IAAI,CAAC;IACjC,gEAAgE;IAChE,uDAAuD;IACvD,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QAC9B,IAAI,EAAE,GAAG,eAAe,EAAE,CAAC;YAAC,eAAe,GAAG,EAAE,CAAC;YAAC,GAAG,GAAG,GAAG,CAAC;QAAC,CAAC;IAChE,CAAC;IACD,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7E,OAAO,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACpC,CAAC;AAKD;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,QAAQ;IACX,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC3C,YAAY,GAAG,IAAI,GAAG,EAAiC,CAAC;IAEhE,kEAAkE;IAClE,cAAc,CAAC,IAAa,EAAE,MAA6B;QACzD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,SAAS,CAAC,yCAAyC,CAAC,CAAC;QAC3F,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,0FAA0F;IAC1F,aAAa,CAAC,IAAa,EAAE,MAAoB;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,oDAAoD,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5F,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,IAAI,UAAU,CAAC,yCAAyC,MAAM,CAAC,MAAM,aAAa,MAAM,CAAC,MAAM,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1H,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,MAAM,IAAI,UAAU,CAAC,0DAA0D,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,mEAAmE;IACnE,SAAS,CAAC,IAAa;QACrB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IAC5C,CAAC;IAED,+BAA+B;IAC/B,QAAQ,CAAC,IAAa;QACpB,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IAC9C,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,KAAc,EAAE,KAAc;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,GAAG,GAAa,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,SAAS;gBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,8CAA8C;IAC9C,IAAI,KAAa,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;CAC9C"}

package/dist/chronosheaf/index.d.ts

@@ -24,6 +24,8 @@ export * as freeEnergy from "./free_energy.js";
 export * as wasserstein from "./wasserstein.js";
 export * as tropical from "./tropical.js";
 export * as aczel from "./aczel.js";
+export * as baseSpace from "./base_space.js";
+export * as liveUpdate from "./live_update.js";
 export type { PainEntry, PainTopology, PrimitiveTag } from "./pain_catalog.js";
 export type { Site, SheafCover, Section0, Section1, SheafResult } from "./sheaf.js";
 export type { RGState, RGStep, Relevance } from "./rg_flow.js";
@@ -32,4 +34,6 @@ export type { Categorical, ActionCandidate, ActionScoring } from "./free_energy.
 export type { DiscreteMeasure, CostMatrix } from "./wasserstein.js";
 export type { TropicalGraph, TropicalPathResult } from "./tropical.js";
 export type { Hyperset, HypersetNode } from "./aczel.js";
+export type { CommitSha, TimeMs, ScaleBand, OpenSet, TimeInterval, BeliefVector } from "./base_space.js";
+export type { ChronoEvent, EventEmitter, Evidence, ClaimObservation, UpdateInput, UpdateState, UpdateSummary, ChronoSlo } from "./live_update.js";
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,WAAW,MAAM,mBAAmB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AACpC,OAAO,KAAK,MAAM,MAAM,cAAc,CAAC;AACvC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,UAAU,MAAM,kBAAkB,CAAC;AAC/C,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AAEpC,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC/E,YAAY,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACpF,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAC/D,YAAY,EAAE,cAAc,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAC5F,YAAY,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACpF,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACpE,YAAY,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACvE,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,WAAW,MAAM,mBAAmB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AACpC,OAAO,KAAK,MAAM,MAAM,cAAc,CAAC;AACvC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,UAAU,MAAM,kBAAkB,CAAC;AAC/C,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AAGpC,OAAO,KAAK,SAAS,MAAM,iBAAiB,CAAC;AAC7C,OAAO,KAAK,UAAU,MAAM,kBAAkB,CAAC;AAE/C,YAAY,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC/E,YAAY,EAAE,IAAI,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACpF,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAC/D,YAAY,EAAE,cAAc,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAC5F,YAAY,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACpF,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACpE,YAAY,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACvE,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AACzD,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACzG,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/chronosheaf/index.js

@@ -24,4 +24,7 @@ export * as freeEnergy from "./free_energy.js";
 export * as wasserstein from "./wasserstein.js";
 export * as tropical from "./tropical.js";
 export * as aczel from "./aczel.js";
+// v2.19.48 — P3 + P4: base space + live ChronoSheafUpdate orchestrator
+export * as baseSpace from "./base_space.js";
+export * as liveUpdate from "./live_update.js";
 //# sourceMappingURL=index.js.map

package/dist/chronosheaf/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/chronosheaf/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,WAAW,MAAM,mBAAmB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AACpC,OAAO,KAAK,MAAM,MAAM,cAAc,CAAC;AACvC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,UAAU,MAAM,kBAAkB,CAAC;AAC/C,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/chronosheaf/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,WAAW,MAAM,mBAAmB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AACpC,OAAO,KAAK,MAAM,MAAM,cAAc,CAAC;AACvC,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,UAAU,MAAM,kBAAkB,CAAC;AAC/C,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AAEpC,uEAAuE;AACvE,OAAO,KAAK,SAAS,MAAM,iBAAiB,CAAC;AAC7C,OAAO,KAAK,UAAU,MAAM,kBAAkB,CAAC"}

package/dist/chronosheaf/live_update.d.ts

@@ -0,0 +1,221 @@
+/**
+ * v2.19.48 — CHRONOSHEAF P4 · live ChronoSheafUpdate algorithm.
+ *
+ *   Spec verbatim (P4):
+ *
+ *     ALGORITHM ChronoSheafUpdate(commit_c, claim_set_C, verifier_set_V)
+ *
+ *       // 1. Localize the change
+ *       U_local := neighborhood of c in commit_DAG × [t-Δ, t] × [s_min, s_max]
+ *
+ *       // 2. Update presheaf F over U_local
+ *       for each open U_i in cover(U_local):
+ *         F(U_i) := solve_local_consistency(C ∩ U_i, V ∩ U_i)
+ *            via tropical aggregation: stalk_p := ⊕_{e ∈ evidence(p)} confidence(e)
+ *         if F(U_i) = ∅:  // no locally consistent belief
+ *            emit chronosheaf.local_contradiction(U_i)
+ *            return
+ *
+ *       // 3. Čech H¹ computation (only over the changed cover — O(|cover|² × dim))
+ *       cocycle σ := build_pairwise_diff(F, cover)
+ *       coboundary B := image(δ⁰)
+ *       H1 := σ / B
+ *       if H1 ≠ 0:
+ *          minimal_witness := minimum_l0_norm_representative(H1)
+ *          emit chronosheaf.h1.alarm(witness=minimal_witness, persistence=t_now)
+ *
+ *       // 4. Update persistence diagram
+ *       for each H¹ class α detected:
+ *          if α already tracked: extend lifetime
+ *          else: birth(α, t_now)
+ *       for each previously-tracked α now in image δ⁰:
+ *          death(α, t_now)
+ *       persistence_diagram.add_or_update(α, birth=b_α, death=d_α)
+ *
+ *       // 5. RG flow — promote scale of long-persistent classes
+ *       for α with persistence > θ_relevant:
+ *          mark α as RELEVANT_OPERATOR
+ *          bubble α up to scale s+1 (org-level constitution)
+ *
+ *       // 6. Free-energy-driven next probe (active inference)
+ *       candidate_probes := {p_1, ..., p_k} from unresolved cells in cover
+ *       for each candidate p:
+ *          G(p) := KL[q_post(z|p) || p_prior(z)] − E[log evidence value of p]
+ *       probe* := argmin_p G(p)
+ *       schedule(probe*, deadline = t_now + Δ_probe)
+ *
+ *       // 7. Aczel reflexive update
+ *       for each reflexive stalk r:
+ *          if not bisimulates(r, r.previous_self):
+ *             emit chronosheaf.self_inconsistency(r)
+ *
+ *   Complexity per event: O(k² · d) with k = |cover| ≲ 20, d = |claims| ≲ 100
+ *   → <5ms per event → live ready.
+ *
+ *   Correctness invariants (proven by composition of the primitives):
+ *     I1 — Čech consistency: H¹ = 0 across scales ⟹ global section exists.
+ *     I2 — RG fixed-point: RG-invariant claims = universal truths.
+ *     I3 — Aczel bisimulation: self-referential beliefs converge.
+ *
+ *   Engineering qualities (user mandate):
+ *     - Smooth integration with TOKEN GOVERNOR + VACCINE OSMOSIS + GANGLION.
+ *     - Error handlers + invariant assertions at every layer boundary.
+ *     - Business-aware: events carry actionable witnesses, not just true/false.
+ *     - Future-proof: emit hook is pluggable; persistence diagram + RG flow
+ *       state are externally inspectable for dashboards + alerting.
+ *     - "Never break the running session" — all primitives are pure-function
+ *       and never mutate any other Mneme module's state.
+ */
+import { CommitDag, Presheaf, type CommitSha, type OpenSet, type ScaleBand } from "./base_space.js";
+import { type Site } from "./sheaf.js";
+import { type ActionCandidate, type ActionScoring } from "./free_energy.js";
+import { type PersistenceDiagram } from "./persistence.js";
+import { type Hyperset } from "./aczel.js";
+export type ChronoEvent = {
+    kind: "local_contradiction";
+    open: OpenSet;
+    reason: string;
+    ts: number;
+} | {
+    kind: "h1_alarm";
+    cover: ReadonlyArray<OpenSet>;
+    h1: number;
+    witnessPairs: ReadonlyArray<[Site, Site]>;
+    ts: number;
+} | {
+    kind: "class_birth";
+    classId: string;
+    ts: number;
+} | {
+    kind: "class_death";
+    classId: string;
+    ts: number;
+    livedMs: number;
+} | {
+    kind: "promote_relevant";
+    classId: string;
+    oldScale: ScaleBand;
+    newScale: ScaleBand;
+    ts: number;
+} | {
+    kind: "probe_scheduled";
+    probeId: string;
+    G: number;
+    deadlineMs: number;
+    ts: number;
+} | {
+    kind: "self_inconsistency";
+    stalkId: string;
+    reason: string;
+    ts: number;
+};
+export type EventEmitter = (event: ChronoEvent) => void;
+export interface Evidence {
+    /** Site (sub-open) where evidence lives. */
+    site: Site;
+    /** Confidence in [0, 1]. */
+    confidence: number;
+    /** Source verifier label. */
+    source: string;
+}
+export interface ClaimObservation {
+    /** Stable claim id. */
+    claimId: string;
+    /** Numeric value the claim asserts (e.g. "tool count" = 711). */
+    value: number;
+    /** Sites where the claim is observable. */
+    sites: ReadonlyArray<Site>;
+}
+export interface UpdateInput {
+    /** Commit triggering the update. */
+    commit: CommitSha;
+    /** Wall-clock time of the event (ms). */
+    nowMs: number;
+    /** Cover of the localised neighbourhood (sub-opens around the commit). */
+    cover: ReadonlyArray<OpenSet>;
+    /** Claims observed across the cover. */
+    claims: ReadonlyArray<ClaimObservation>;
+    /** Per-site evidence (used for tropical confidence aggregation). */
+    evidence: ReadonlyArray<Evidence>;
+    /** Optional reflexive stalks to verify bisimulation on. */
+    reflexiveStalks?: ReadonlyArray<{
+        id: string;
+        current: Hyperset;
+        previous?: Hyperset;
+    }>;
+    /** Optional candidate probes for free-energy-driven next-action selection. */
+    probeCandidates?: ReadonlyArray<ActionCandidate>;
+    /** Action scoring (preferred obs + prior z) for free-energy. */
+    probeScoring?: ActionScoring;
+    /** Tolerance for "persistent enough to bubble up scale" — default 60s. */
+    relevantThresholdMs?: number;
+}
+export interface UpdateState {
+    /** Persistence diagram of H¹ classes tracked across events. */
+    diagram: PersistenceDiagram;
+    /** Currently-tracked active classes: id -> {birth, lastSeen}. */
+    activeClasses: Map<string, {
+        birthMs: number;
+        lastSeenMs: number;
+        scale: ScaleBand;
+    }>;
+    /** All emitted events (capped via reservoir if growing unbounded). */
+    events: ChronoEvent[];
+    /** Promoted "relevant operator" classes. */
+    relevantOperators: Set<string>;
+    /** Number of update cycles processed. */
+    cyclesRun: number;
+}
+export declare function newUpdateState(): UpdateState;
+/**
+ * Run ONE ChronoSheafUpdate cycle. Pure-ish: mutates `state` (which the
+ * caller owns) + calls `emit` for each event. Never throws — all error
+ * paths fall through to event emission so callers can decide whether to
+ * abort or continue.
+ *
+ * Correctness: each step is a pure function from {step's inputs} to
+ * {step's outputs}. The composition order is the spec verbatim.
+ *
+ * Returns a SUMMARY object the caller can act on (e.g. for dashboarding).
+ */
+export interface UpdateSummary {
+    contradictionDetected: boolean;
+    h1: number;
+    alarmsFired: number;
+    probeSelected: string | null;
+    selfInconsistencies: number;
+    newBirths: number;
+    newDeaths: number;
+    newPromotions: number;
+    ms: number;
+}
+export declare function chronoSheafUpdate(input: UpdateInput, state: UpdateState, emit: EventEmitter): UpdateSummary;
+/**
+ * Build a default cover from a list of "sites" (e.g. registry / CLI /
+ * release manifest / MCP schema / tests). Each site becomes its own open
+ * at file scale; the time interval is [nowMs - windowMs, nowMs).
+ *
+ * Convenience for the Mneme self-audit pattern from PAIN-001 / 003 / 005.
+ */
+export declare function buildSelfAuditCover(dag: CommitDag, rootCommit: CommitSha, sites: ReadonlyArray<string>, nowMs: number, windowMs?: number, scale?: ScaleBand): OpenSet[];
+/**
+ * Compute the SLO summary across a window of update cycles. Used by
+ * dashboards to display "CHRONOSHEAF: 7 contradictions caught in last
+ * 24h, 2 still active, mean detect-to-death = 18min".
+ */
+export interface ChronoSlo {
+    totalCycles: number;
+    contradictionsDetected: number;
+    activeContradictions: number;
+    meanLivedMs: number;
+    promotedRelevant: number;
+    selfInconsistencies: number;
+}
+export declare function chronoSlo(state: UpdateState): ChronoSlo;
+/** Hard cap: enforce O(k² · d) by rejecting covers that would blow the budget. */
+export declare function preflightBudget(input: UpdateInput, maxCoverSize?: number, maxClaims?: number): {
+    ok: boolean;
+    reason?: string;
+};
+export { Presheaf };
+//# sourceMappingURL=live_update.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"live_update.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/live_update.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmEG;AAEH,OAAO,EACL,SAAS,EAA0C,QAAQ,EAC3D,KAAK,SAAS,EAAE,KAAK,OAAO,EAAE,KAAK,SAAS,EAC7C,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAiC,KAAK,IAAI,EAAE,MAAM,YAAY,CAAC;AAEtE,OAAO,EAAiC,KAAK,eAAe,EAAE,KAAK,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3G,OAAO,EAA4C,KAAK,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AACrG,OAAO,EAAiB,KAAK,QAAQ,EAAE,MAAM,YAAY,CAAC;AAI1D,MAAM,MAAM,WAAW,GACnB;IAAE,IAAI,EAAE,qBAAqB,CAAC;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC1E;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,aAAa,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACtH;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACpD;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACrE;IAAE,IAAI,EAAE,kBAAkB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,SAAS,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACnG;IAAE,IAAI,EAAE,iBAAiB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACvF;IAAE,IAAI,EAAE,oBAAoB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC;AAEhF,MAAM,MAAM,YAAY,GAAG,CAAC,KAAK,EAAE,WAAW,KAAK,IAAI,CAAC;AAIxD,MAAM,WAAW,QAAQ;IACvB,4CAA4C;IAC5C,IAAI,EAAE,IAAI,CAAC;IACX,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,gBAAgB;IAC/B,uBAAuB;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,iEAAiE;IACjE,KAAK,EAAE,MAAM,CAAC;IACd,2CAA2C;IAC3C,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;CAC5B;AAED,MAAM,WAAW,WAAW;IAC1B,oCAAoC;IACpC,MAAM,EAAE,SAAS,CAAC;IAClB,yCAAyC;IACzC,KAAK,EAAE,MAAM,CAAC;IACd,0EAA0E;IAC1E,KAAK,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IAC9B,wCAAwC;IACxC,MAAM,EAAE,aAAa,CAAC,gBAAgB,CAAC,CAAC;IACxC,oEAAoE;IACpE,QAAQ,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IAClC,2DAA2D;IAC3D,eAAe,CAAC,EAAE,aAAa,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,QAAQ,CAAC;QAAC,QAAQ,CAAC,EAAE,QAAQ,CAAA;KAAE,CAAC,CAAC;IACxF,8EAA8E;IAC9E,eAAe,CAAC,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC;IACjD,gEAAgE;IAChE,YAAY,CAAC,EAAE,aAAa,CAAC;IAC7B,0EAA0E;IAC1E,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,WAAW;IAC1B,+DAA+D;IAC/D,OAAO,EAAE,kBAAkB,CAAC;IAC5B,iEAAiE;IACjE,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,SAAS,CAAA;KAAE,CAAC,CAAC;IACtF,sEAAsE;IACtE,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,4CAA4C;IAC5C,iBAAiB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,yCAAyC;IACzC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,wBAAgB,cAAc,IAAI,WAAW,CAQ5C;AAID;;;;;;;;;;GAUG;AACH,MAAM,WAAW,aAAa;IAC5B,qBAAqB,EAAE,OAAO,CAAC;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;IACtB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,WAAW,EAClB,IAAI,EAAE,YAAY,GACjB,aAAa,CA0Kf;AAID;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,SAAS,EACd,UAAU,EAAE,SAAS,EACrB,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,EAC5B,KAAK,EAAE,MAAM,EACb,QAAQ,GAAE,MAAe,EACzB,KAAK,GAAE,SAAkB,GACxB,OAAO,EAAE,CAQX;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,sBAAsB,EAAE,MAAM,CAAC;IAC/B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,WAAW,GAAG,SAAS,CAevD;AAED,kFAAkF;AAClF,wBAAgB,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,SAAK,EAAE,SAAS,SAAO,GAAG;IAAE,EAAE,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAQzH;AAGD,OAAO,EAAE,QAAQ,EAAE,CAAC"}