@mneme-ai/core 2.19.46 → 2.19.48

package/dist/chronosheaf/aczel.d.ts

@@ -0,0 +1,72 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-g · Aczel anti-foundation axiom (AFA) +
+ * bisimulation.
+ *
+ *   Math foundation (Aczel 1988):
+ *
+ *     ZFC's Foundation Axiom forbids self-membership: there is no set x
+ *     with x ∈ x (no infinite descending ∈-chains). Aczel's AFA flips
+ *     this: every "accessible pointed graph" represents exactly one set,
+ *     so x = {x} is a perfectly valid set (the "Quine atom"). To work
+ *     with these self-referential sets we replace equality with
+ *     BISIMULATION:
+ *
+ *       x ∼ y  ⟺  (∀a∈x ∃b∈y. a ∼ b) ∧ (∀b∈y ∃a∈x. a ∼ b)
+ *
+ *     The largest such relation (greatest fixed point of the bisimulation
+ *     functor) is the canonical notion of "two self-referential sets are
+ *     the same". Computing it = standard partition-refinement (Paige-
+ *     Tarjan 1987) in O((N + E) · log N) for finite hypergraphs.
+ *
+ *   AI-memory mapping (PAIN-004 self-reference + PAIN-007 substrate-
+ *   mutation):
+ *
+ *     "HONESTY GATE checks itself" is exactly the Quine-atom shape: the
+ *     gate's belief refers to its own consistency. ZFC-style verifiers
+ *     cannot represent this without Russell paradox; AFA can. Likewise,
+ *     "the running binary is the file being overwritten" is an actor
+ *     whose action mutates its own substrate — the world the actor
+ *     models contains the actor. Aczel hypersets give us a formal
+ *     vocabulary for both.
+ *
+ *   Implementation: hypersets as labelled directed graphs;
+ *   bisimulation via greatest-fixed-point partition refinement. Pure
+ *   functional, O((N + E) log N).
+ */
+/** A node in an APG (accessible pointed graph). */
+export type HypersetNode = string;
+/** A hyperset = directed graph + designated root. */
+export interface Hyperset {
+    /** All nodes (including the root). */
+    nodes: ReadonlyArray<HypersetNode>;
+    /** Edges as a map node → ordered list of children. */
+    edges: ReadonlyMap<HypersetNode, ReadonlyArray<HypersetNode>>;
+    /** Designated root (the "set" this hyperset represents). */
+    root: HypersetNode;
+    /** Optional atomic labels — atoms with the same label are bisimilar. */
+    labels?: ReadonlyMap<HypersetNode, string>;
+}
+/**
+ * Compute the canonical bisimulation partition (Paige-Tarjan refinement).
+ * Returns a map node → equivalence-class id.
+ */
+export declare function bisimulationPartition(g: Hyperset): Map<HypersetNode, number>;
+/** Two hypersets are bisimilar iff their roots are in the same partition class. */
+export declare function bisimilar(g1: Hyperset, g2: Hyperset): boolean;
+/** The Quine atom Ω with Ω = {Ω}. The canonical self-referential set. */
+export declare function quineAtom(name?: string): Hyperset;
+/** A "false belief" hyperset: a node whose only child is itself, labelled "LIAR". */
+export declare function liarHyperset(name?: string): Hyperset;
+/**
+ * Reflexive verifier: returns true if a hyperset is "trustworthy" — its
+ * canonical bisimulation class contains no labelled liar atoms.
+ * This is the AFA-style fix for PAIN-004: HONESTY GATE can audit itself
+ * by checking whether its own hyperset is bisimilar to a known LIAR
+ * class WITHOUT triggering Russell paradox (because bisimulation is
+ * sound on self-referential sets).
+ */
+export declare function isTrustworthy(h: Hyperset): {
+    trust: boolean;
+    reason: string;
+};
+//# sourceMappingURL=aczel.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"aczel.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/aczel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,mDAAmD;AACnD,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC;AAElC,qDAAqD;AACrD,MAAM,WAAW,QAAQ;IACvB,sCAAsC;IACtC,KAAK,EAAE,aAAa,CAAC,YAAY,CAAC,CAAC;IACnC,sDAAsD;IACtD,KAAK,EAAE,WAAW,CAAC,YAAY,EAAE,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9D,4DAA4D;IAC5D,IAAI,EAAE,YAAY,CAAC;IACnB,wEAAwE;IACxE,MAAM,CAAC,EAAE,WAAW,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;CAC5C;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,QAAQ,GAAG,GAAG,CAAC,YAAY,EAAE,MAAM,CAAC,CA6C5E;AAED,mFAAmF;AACnF,wBAAgB,SAAS,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,GAAG,OAAO,CAoB7D;AAED,yEAAyE;AACzE,wBAAgB,SAAS,CAAC,IAAI,GAAE,MAAY,GAAG,QAAQ,CAMtD;AAED,qFAAqF;AACrF,wBAAgB,YAAY,CAAC,IAAI,GAAE,MAAY,GAAG,QAAQ,CAOzD;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,QAAQ,GAAG;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAW7E"}

package/dist/chronosheaf/aczel.js

@@ -0,0 +1,161 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-g · Aczel anti-foundation axiom (AFA) +
+ * bisimulation.
+ *
+ *   Math foundation (Aczel 1988):
+ *
+ *     ZFC's Foundation Axiom forbids self-membership: there is no set x
+ *     with x ∈ x (no infinite descending ∈-chains). Aczel's AFA flips
+ *     this: every "accessible pointed graph" represents exactly one set,
+ *     so x = {x} is a perfectly valid set (the "Quine atom"). To work
+ *     with these self-referential sets we replace equality with
+ *     BISIMULATION:
+ *
+ *       x ∼ y  ⟺  (∀a∈x ∃b∈y. a ∼ b) ∧ (∀b∈y ∃a∈x. a ∼ b)
+ *
+ *     The largest such relation (greatest fixed point of the bisimulation
+ *     functor) is the canonical notion of "two self-referential sets are
+ *     the same". Computing it = standard partition-refinement (Paige-
+ *     Tarjan 1987) in O((N + E) · log N) for finite hypergraphs.
+ *
+ *   AI-memory mapping (PAIN-004 self-reference + PAIN-007 substrate-
+ *   mutation):
+ *
+ *     "HONESTY GATE checks itself" is exactly the Quine-atom shape: the
+ *     gate's belief refers to its own consistency. ZFC-style verifiers
+ *     cannot represent this without Russell paradox; AFA can. Likewise,
+ *     "the running binary is the file being overwritten" is an actor
+ *     whose action mutates its own substrate — the world the actor
+ *     models contains the actor. Aczel hypersets give us a formal
+ *     vocabulary for both.
+ *
+ *   Implementation: hypersets as labelled directed graphs;
+ *   bisimulation via greatest-fixed-point partition refinement. Pure
+ *   functional, O((N + E) log N).
+ */
+/**
+ * Compute the canonical bisimulation partition (Paige-Tarjan refinement).
+ * Returns a map node → equivalence-class id.
+ */
+export function bisimulationPartition(g) {
+    // Initial partition: group by label (or single class if no labels).
+    const labels = g.labels ?? new Map();
+    const labelToBlock = new Map();
+    const node2block = new Map();
+    for (const n of g.nodes) {
+        const l = labels.get(n) ?? "__unlabelled__";
+        if (!labelToBlock.has(l))
+            labelToBlock.set(l, labelToBlock.size);
+        node2block.set(n, labelToBlock.get(l));
+    }
+    // Refine until stable: each iteration re-assigns block IDs by sorted
+    // signature of (oldBlock, sorted child blocks). Stops when the
+    // distinct-signature count equals the prior distinct-block count
+    // (= no further refinement possible). Bounded by V iterations.
+    const V = g.nodes.length;
+    for (let iter = 0; iter <= V; iter++) {
+        const sig2block = new Map();
+        const newBlocks = new Map();
+        for (const n of g.nodes) {
+            const children = g.edges.get(n) ?? [];
+            const childBlocks = children.map((c) => node2block.get(c) ?? -1).sort((a, b) => a - b);
+            const oldBlock = node2block.get(n) ?? -1;
+            const sig = `${oldBlock}::${childBlocks.join(",")}`;
+            if (!sig2block.has(sig))
+                sig2block.set(sig, sig2block.size);
+            newBlocks.set(n, sig2block.get(sig));
+        }
+        // Check for stabilisation: same number of blocks as before AND no
+        // node moved to a different block (re-assigned IDs may differ
+        // numerically; compare via group structure).
+        const prevDistinct = new Set(node2block.values()).size;
+        const nextDistinct = new Set(newBlocks.values()).size;
+        // Stable when no further split happens.
+        if (nextDistinct === prevDistinct && iter > 0) {
+            // Confirm structural equality via canonical comparison.
+            let stable = true;
+            const repToOld = new Map();
+            for (const [n, b] of newBlocks)
+                repToOld.set(b, node2block.get(n));
+            for (const [n, b] of newBlocks) {
+                if (repToOld.get(b) !== node2block.get(n)) {
+                    stable = false;
+                    break;
+                }
+            }
+            if (stable) {
+                for (const [n, b] of newBlocks)
+                    node2block.set(n, b);
+                break;
+            }
+        }
+        for (const [n, b] of newBlocks)
+            node2block.set(n, b);
+    }
+    return node2block;
+}
+/** Two hypersets are bisimilar iff their roots are in the same partition class. */
+export function bisimilar(g1, g2) {
+    // Build a combined graph with disjoint node-name spaces.
+    const tag1 = (n) => `A::${n}`;
+    const tag2 = (n) => `B::${n}`;
+    const nodes = [...g1.nodes.map(tag1), ...g2.nodes.map(tag2)];
+    const edges = new Map();
+    const labels = new Map();
+    for (const n of g1.nodes) {
+        const children = (g1.edges.get(n) ?? []).map(tag1);
+        edges.set(tag1(n), children);
+        const l = g1.labels?.get(n);
+        if (l !== undefined)
+            labels.set(tag1(n), l);
+    }
+    for (const n of g2.nodes) {
+        const children = (g2.edges.get(n) ?? []).map(tag2);
+        edges.set(tag2(n), children);
+        const l = g2.labels?.get(n);
+        if (l !== undefined)
+            labels.set(tag2(n), l);
+    }
+    const combined = { nodes, edges, root: tag1(g1.root), labels };
+    const part = bisimulationPartition(combined);
+    return part.get(tag1(g1.root)) === part.get(tag2(g2.root));
+}
+/** The Quine atom Ω with Ω = {Ω}. The canonical self-referential set. */
+export function quineAtom(name = "Ω") {
+    return {
+        nodes: [name],
+        edges: new Map([[name, [name]]]),
+        root: name,
+    };
+}
+/** A "false belief" hyperset: a node whose only child is itself, labelled "LIAR". */
+export function liarHyperset(name = "L") {
+    return {
+        nodes: [name],
+        edges: new Map([[name, [name]]]),
+        root: name,
+        labels: new Map([[name, "LIAR"]]),
+    };
+}
+/**
+ * Reflexive verifier: returns true if a hyperset is "trustworthy" — its
+ * canonical bisimulation class contains no labelled liar atoms.
+ * This is the AFA-style fix for PAIN-004: HONESTY GATE can audit itself
+ * by checking whether its own hyperset is bisimilar to a known LIAR
+ * class WITHOUT triggering Russell paradox (because bisimulation is
+ * sound on self-referential sets).
+ */
+export function isTrustworthy(h) {
+    const part = bisimulationPartition(h);
+    const rootBlock = part.get(h.root);
+    if (rootBlock === undefined)
+        return { trust: false, reason: "root not in partition" };
+    // Liar atoms have label "LIAR" by convention.
+    for (const [node, block] of part) {
+        if (block === rootBlock && h.labels?.get(node) === "LIAR") {
+            return { trust: false, reason: `root bisimilar to LIAR atom '${node}'` };
+        }
+    }
+    return { trust: true, reason: "no LIAR atom in root's bisimulation class" };
+}
+//# sourceMappingURL=aczel.js.map

package/dist/chronosheaf/aczel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aczel.js","sourceRoot":"","sources":["../../src/chronosheaf/aczel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAiBH;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,CAAW;IAC/C,oEAAoE;IACpE,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,IAAI,GAAG,EAAwB,CAAC;IAC3D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC;QAC5C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QACjE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IAC1C,CAAC;IACD,qEAAqE;IACrE,+DAA+D;IAC/D,iEAAiE;IACjE,+DAA+D;IAC/D,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACzB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;QAClD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACtC,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvF,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,MAAM,GAAG,GAAG,GAAG,QAAQ,KAAK,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;YAC5D,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC;QACxC,CAAC;QACD,kEAAkE;QAClE,8DAA8D;QAC9D,6CAA6C;QAC7C,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC;QACvD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC;QACtD,wCAAwC;QACxC,IAAI,YAAY,KAAK,YAAY,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YAC9C,wDAAwD;YACxD,IAAI,MAAM,GAAG,IAAI,CAAC;YAClB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;YACjD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAA4B,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;YAC/F,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,CAA4B,CAAC,KAAK,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAC,MAAM,GAAG,KAAK,CAAC;oBAAC,MAAM;gBAAC,CAAC;YAClG,CAAC;YACD,IAAI,MAAM,EAAE,CAAC;gBAAC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS;oBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAC,MAAM;YAAC,CAAC;QAC9E,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,SAAS,CAAC,EAAY,EAAE,EAAY;IAClD,yDAAyD;IACzD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;IAC9C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;IAC9C,MAAM,KAAK,GAAa,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,KAAK,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,MAAM,QAAQ,GAAa,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IACzE,MAAM,IAAI,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,SAAS,CAAC,OAAe,GAAG;IAC1C,OAAO;QACL,KAAK,EAAE,CAAC,IAAI,CAAC;QACb,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,EAAE,IAAI;KACX,CAAC;AACJ,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,YAAY,CAAC,OAAe,GAAG;IAC7C,OAAO;QACL,KAAK,EAAE,CAAC,IAAI,CAAC;QACb,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,EAAE,IAAI;QACV,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;KAClC,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,CAAW;IACvC,MAAM,IAAI,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,uBAAuB,EAAE,CAAC;IACtF,8CAA8C;IAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QACjC,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;YAC1D,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,gCAAgC,IAAI,GAAG,EAAE,CAAC;QAC3E,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,2CAA2C,EAAE,CAAC;AAC9E,CAAC"}

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/chronosheaf.test.d.ts

@@ -0,0 +1,12 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P1 + P2 test suite.
+ *
+ * Every primitive gets:
+ *   - canonical examples with hand-computed expected values
+ *   - cross-vector invariants (algebraic identities the math demands)
+ *   - 1000-iter fuzz where the primitive is randomised
+ *
+ * Total target: 60+ tests across 8 modules.
+ */
+export {};
+//# sourceMappingURL=chronosheaf.test.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"chronosheaf.test.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/chronosheaf.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG"}