@mneme-ai/core 2.19.46 → 2.19.48

package/dist/chronosheaf/chronosheaf.test.js

@@ -0,0 +1,360 @@
+/**
+ * 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.
+ */
+import { describe, it, expect } from "vitest";
+// ─── P1 pain_catalog ───────────────────────────────────────────────────
+import { PAIN_CATALOG, catalogStats, painsForPrimitive, primitivesForPain } from "./pain_catalog.js";
+describe("v2.19.47 CHRONOSHEAF P1 · pain_catalog", () => {
+    it("contains exactly 7 user-reported pains", () => {
+        expect(PAIN_CATALOG.length).toBe(7);
+    });
+    it("every pain has all required fields", () => {
+        for (const e of PAIN_CATALOG) {
+            expect(e.painId).toMatch(/^PAIN-\d{3}$/);
+            expect(typeof e.pain).toBe("string");
+            expect(typeof e.currentToolsSee).toBe("string");
+            expect(typeof e.whatTheyMiss).toBe("string");
+            expect(typeof e.topology).toBe("string");
+            expect(Array.isArray(e.primitives)).toBe(true);
+            expect(e.primitives.length).toBeGreaterThan(0);
+        }
+    });
+    it("painsForPrimitive returns every pain the primitive addresses", () => {
+        const sheafPains = painsForPrimitive("sheaf");
+        expect(sheafPains.length).toBeGreaterThan(0);
+        for (const p of sheafPains)
+            expect(p.primitives).toContain("sheaf");
+    });
+    it("primitivesForPain inverts correctly", () => {
+        expect(primitivesForPain("PAIN-001")).toContain("sheaf");
+        expect(primitivesForPain("NONEXISTENT")).toEqual([]);
+    });
+    it("catalogStats counts everything correctly", () => {
+        const s = catalogStats();
+        expect(s.totalPains).toBe(7);
+        expect(Object.keys(s.byTopology).length).toBeGreaterThan(0);
+        expect(s.primitiveLoad.length).toBeGreaterThan(0);
+        const total = s.primitiveLoad.reduce((acc, x) => acc + x.pains, 0);
+        let expected = 0;
+        for (const e of PAIN_CATALOG)
+            expected += e.primitives.length;
+        expect(total).toBe(expected);
+    });
+});
+// ─── P2-a sheaf cohomology ─────────────────────────────────────────────
+import { delta0, delta1, isCocycle, cohomologyH1, gluingDiagnostic, } from "./sheaf.js";
+describe("v2.19.47 CHRONOSHEAF P2-a · sheaf cohomology", () => {
+    it("tree cover (no cycle): H¹ = 0", () => {
+        const cover = {
+            sites: ["A", "B", "C"],
+            overlaps: [["A", "B"], ["B", "C"]],
+        };
+        const r = cohomologyH1(cover);
+        expect(r.h1).toBe(0);
+        expect(r.hasObstruction).toBe(false);
+    });
+    it("3-cycle without triple overlap: H¹ = 1 (the canonical obstruction)", () => {
+        const cover = {
+            sites: ["A", "B", "C"],
+            overlaps: [["A", "B"], ["B", "C"], ["A", "C"]],
+        };
+        const r = cohomologyH1(cover);
+        expect(r.h1).toBe(1);
+        expect(r.hasObstruction).toBe(true);
+        expect(r.obstructions.length).toBe(1);
+    });
+    it("3-cycle WITH triple overlap: H¹ = 0 (the triangle kills it)", () => {
+        const cover = {
+            sites: ["A", "B", "C"],
+            overlaps: [["A", "B"], ["B", "C"], ["A", "C"]],
+            triples: [["A", "B", "C"]],
+        };
+        const r = cohomologyH1(cover);
+        expect(r.h1).toBe(0);
+    });
+    it("delta0 of consistent claim values is zero everywhere", () => {
+        const cover = {
+            sites: ["A", "B", "C"],
+            overlaps: [["A", "B"], ["B", "C"]],
+        };
+        const sigma0 = new Map([["A", 5], ["B", 5], ["C", 5]]);
+        const d = delta0(cover, sigma0);
+        for (const v of d.values())
+            expect(v).toBe(0);
+    });
+    it("delta0 of inconsistent claim values is non-zero on the discordant pair", () => {
+        const cover = {
+            sites: ["A", "B"],
+            overlaps: [["A", "B"]],
+        };
+        const sigma0 = new Map([["A", 1], ["B", 3]]);
+        const d = delta0(cover, sigma0);
+        // Pair key is sorted lex: "A" + "B" → "AB". Value = b_B − b_A = 3 − 1 = 2.
+        const v = d.get("AB") ?? d.get("BA");
+        expect(v).toBe(2);
+    });
+    it("isCocycle returns true on tree cover with no triples", () => {
+        const cover = { sites: ["A", "B"], overlaps: [["A", "B"]] };
+        const sigma1 = new Map([["AB", 7]]);
+        expect(isCocycle(cover, sigma1)).toBe(true);
+    });
+    it("gluingDiagnostic reports H¹ and residual together", () => {
+        const cover = {
+            sites: ["A", "B", "C"],
+            overlaps: [["A", "B"], ["B", "C"], ["A", "C"]],
+        };
+        const claim = new Map([["A", 711], ["B", 711], ["C", 712]]);
+        const r = gluingDiagnostic(cover, claim);
+        expect(r.h1).toBe(1);
+        expect(r.residual.size).toBe(3);
+    });
+    it("delta1 on a triangle is the alternating sum", () => {
+        const cover = {
+            sites: ["A", "B", "C"],
+            overlaps: [["A", "B"], ["B", "C"], ["A", "C"]],
+            triples: [["A", "B", "C"]],
+        };
+        const sigma1 = new Map([["AB", 1], ["BC", 1], ["AC", 2]]);
+        const d = delta1(cover, sigma1);
+        expect(d.size).toBe(1);
+        const v = Array.from(d.values())[0];
+        expect(v).toBe(0); // 1 + 1 - 2 = 0
+    });
+});
+// ─── P2-b rg_flow ──────────────────────────────────────────────────────
+import { rgStep, rgFixedPoint, classifyRelevance, smallestScaleForBudget } from "./rg_flow.js";
+describe("v2.19.47 CHRONOSHEAF P2-b · RG flow", () => {
+    it("rgStep mean aggregator halves length and averages", () => {
+        const s = rgStep({ vector: [1, 3, 5, 7], scale: 0 }, { factor: 2, aggregator: "mean" });
+        expect(s.vector).toEqual([2, 6]);
+        expect(s.scale).toBe(1);
+    });
+    it("rgFixedPoint reaches scalar state in finite iterations", () => {
+        const r = rgFixedPoint({ vector: [1, 2, 3, 4, 5, 6, 7, 8], scale: 0 }, { factor: 2, aggregator: "sum" });
+        expect(r.reachedFixedPoint).toBe(true);
+        expect(r.state.vector.length).toBeLessThanOrEqual(1);
+    });
+    it("classifyRelevance labels constant vector — mean shrinks L2 norm → irrelevant", () => {
+        const r = classifyRelevance({ vector: [1, 1, 1, 1], scale: 0 }, { factor: 2, aggregator: "mean" }, [1, 1, 1, 1]);
+        // [1,1,1,1] mean → [1,1] mean → [1]. L2 norms: 2 → √2 → 1 → ratio < 1 → irrelevant.
+        expect(["irrelevant", "marginal"]).toContain(r.class);
+    });
+    it("classifyRelevance labels constant vector under SUM → relevant (L2 grows)", () => {
+        const r = classifyRelevance({ vector: [1, 1, 1, 1], scale: 0 }, { factor: 2, aggregator: "sum" }, [1, 1, 1, 1]);
+        // sum: [1,1,1,1] → [2,2] → [4]. L2 norms: 2 → 2√2 → 4 → growth ratio > 1 → relevant.
+        expect(["relevant", "marginal"]).toContain(r.class);
+    });
+    it("smallestScaleForBudget returns state with size ≤ target", () => {
+        const r = smallestScaleForBudget({ vector: [1, 2, 3, 4, 5, 6, 7, 8], scale: 0 }, { factor: 2, aggregator: "mean" }, 2);
+        expect(r.state.vector.length).toBeLessThanOrEqual(2);
+    });
+});
+// ─── P2-c persistence ──────────────────────────────────────────────────
+import { persistentHomology0, bottleneckDistance } from "./persistence.js";
+describe("v2.19.47 CHRONOSHEAF P2-c · persistent homology", () => {
+    it("two isolated vertices → 2 essential 0-classes", () => {
+        const filt = [{ value: 0, add: [["x"], ["y"]] }];
+        const pd = persistentHomology0(filt);
+        expect(pd.essentialByDim[0]).toBe(2);
+    });
+    it("vertices then edge → 1 essential, 1 finite-persistence pair", () => {
+        const filt = [
+            { value: 0, add: [["x"], ["y"]] },
+            { value: 1, add: [["x", "y"]] },
+        ];
+        const pd = persistentHomology0(filt);
+        expect(pd.essentialByDim[0]).toBe(1);
+        const finite = pd.pairs.filter((p) => isFinite(p.persistence));
+        expect(finite.length).toBe(1);
+        expect(finite[0].persistence).toBe(1);
+    });
+    it("bottleneckDistance is 0 between identical diagrams", () => {
+        const filt = [
+            { value: 0, add: [["a"], ["b"]] },
+            { value: 1, add: [["a", "b"]] },
+        ];
+        const a = persistentHomology0(filt);
+        const b = persistentHomology0(filt);
+        expect(bottleneckDistance(a, b)).toBe(0);
+    });
+});
+// ─── P2-d free_energy ──────────────────────────────────────────────────
+import { klDivergence, entropy, variationalFreeEnergy, selectAction, confidenceToPosterior, normalise, } from "./free_energy.js";
+describe("v2.19.47 CHRONOSHEAF P2-d · free energy", () => {
+    it("KL(p ‖ p) = 0", () => {
+        const p = normalise([1, 2, 3]);
+        expect(klDivergence(p, p)).toBeCloseTo(0, 9);
+    });
+    it("entropy of uniform = log(n)", () => {
+        const p = normalise([1, 1, 1, 1]);
+        expect(entropy(p)).toBeCloseTo(Math.log(4), 9);
+    });
+    it("variational F is finite for valid inputs", () => {
+        const q = normalise([0.7, 0.3]);
+        const prior = normalise([0.5, 0.5]);
+        const logLik = [Math.log(0.9), Math.log(0.1)];
+        const F = variationalFreeEnergy(q, prior, logLik);
+        expect(Number.isFinite(F)).toBe(true);
+    });
+    it("selectAction picks the candidate with minimal G", () => {
+        const scoring = { preferredObs: normalise([0.9, 0.1]), priorZ: normalise([0.5, 0.5]) };
+        const candidates = [
+            { id: "good", predictedObs: normalise([0.85, 0.15]), predictedQz: normalise([0.7, 0.3]) },
+            { id: "bad", predictedObs: normalise([0.1, 0.9]), predictedQz: normalise([0.5, 0.5]) },
+        ];
+        const r = selectAction(candidates, scoring);
+        expect(r.winner.id).toBe("good");
+    });
+    it("confidenceToPosterior turns 0.6 into a Beta posterior mean near 0.6", () => {
+        const r = confidenceToPosterior(0.6, 100);
+        expect(r.posterior[0]).toBeGreaterThan(0.55);
+        expect(r.posterior[0]).toBeLessThan(0.65);
+        expect(r.entropyBits).toBeGreaterThan(0);
+    });
+});
+// ─── P2-e wasserstein ──────────────────────────────────────────────────
+import { wasserstein1D, sinkhorn, catalogDrift } from "./wasserstein.js";
+describe("v2.19.47 CHRONOSHEAF P2-e · wasserstein", () => {
+    it("W_1 between identical distributions = 0", () => {
+        const mu = new Map([["0", 0.5], ["1", 0.5]]);
+        expect(wasserstein1D(mu, mu)).toBe(0);
+    });
+    it("W_1 between point masses at 0 and 1 = 1", () => {
+        const mu = new Map([["0", 1]]);
+        const nu = new Map([["1", 1]]);
+        expect(wasserstein1D(mu, nu)).toBeCloseTo(1, 9);
+    });
+    it("sinkhorn returns a coupling with given marginals (approximately)", () => {
+        const mu = [0.5, 0.5];
+        const nu = [0.5, 0.5];
+        const C = [[0, 1], [1, 0]];
+        const r = sinkhorn(mu, nu, C, { epsilon: 0.1, maxIter: 200 });
+        expect(r.iterations).toBeGreaterThan(0);
+        // Row sums approximately match mu.
+        for (let i = 0; i < mu.length; i++) {
+            const rowSum = r.coupling[i].reduce((a, x) => a + x, 0);
+            expect(Math.abs(rowSum - mu[i])).toBeLessThan(0.01);
+        }
+    });
+    it("catalogDrift = 0 between identical snapshots", () => {
+        const snap = ["mneme.x.y", "mneme.a.b"];
+        expect(catalogDrift(snap, snap)).toBe(0);
+    });
+    it("catalogDrift > 0 between disjoint family snapshots", () => {
+        const a = ["mneme.x.y"];
+        const b = ["mneme.z.w"];
+        expect(catalogDrift(a, b)).toBeGreaterThan(0);
+    });
+});
+// ─── P2-f tropical ─────────────────────────────────────────────────────
+import { tropicalAdd, tropicalMul, tropicalLongestPath, verifierChainConfidence, } from "./tropical.js";
+describe("v2.19.47 CHRONOSHEAF P2-f · tropical semiring", () => {
+    it("tropical add = max, mul = sum", () => {
+        expect(tropicalAdd(3, 5)).toBe(5);
+        expect(tropicalMul(3, 5)).toBe(8);
+    });
+    it("longest path through a 3-node chain returns sum of edge weights", () => {
+        const g = {
+            nodes: ["A", "B", "C"],
+            edges: new Map([
+                ["A", [{ to: "B", weight: 2, label: "AB" }]],
+                ["B", [{ to: "C", weight: 3, label: "BC" }]],
+            ]),
+        };
+        const r = tropicalLongestPath(g, "A", "C");
+        expect(r).toBeTruthy();
+        expect(r.value).toBe(5);
+        expect(r.path).toEqual(["A", "B", "C"]);
+        expect(r.criticalEdge?.label).toBe("AB"); // smaller weight
+    });
+    it("verifierChainConfidence is the min + identifies critical verifier", () => {
+        const r = verifierChainConfidence([
+            { id: "a", confidence: 0.9 },
+            { id: "b", confidence: 0.6 },
+            { id: "c", confidence: 0.95 },
+        ]);
+        expect(r.chainConfidence).toBe(0.6);
+        expect(r.criticalVerifier?.id).toBe("b");
+    });
+    it("empty chain returns confidence 1 + null critical", () => {
+        const r = verifierChainConfidence([]);
+        expect(r.chainConfidence).toBe(1);
+        expect(r.criticalVerifier).toBeNull();
+    });
+});
+// ─── P2-g aczel ────────────────────────────────────────────────────────
+import { bisimulationPartition, bisimilar, quineAtom, liarHyperset, isTrustworthy } from "./aczel.js";
+describe("v2.19.47 CHRONOSHEAF P2-g · Aczel anti-foundation", () => {
+    it("two Quine atoms are bisimilar", () => {
+        const a = quineAtom("X");
+        const b = quineAtom("Y");
+        expect(bisimilar(a, b)).toBe(true);
+    });
+    it("Quine atom ≠ labelled LIAR atom (different labels disambiguate)", () => {
+        const q = quineAtom("Q");
+        const l = liarHyperset("L");
+        expect(bisimilar(q, l)).toBe(false);
+    });
+    it("isTrustworthy returns true for an unlabelled Quine atom", () => {
+        const q = quineAtom();
+        const r = isTrustworthy(q);
+        expect(r.trust).toBe(true);
+    });
+    it("isTrustworthy returns false for a LIAR hyperset", () => {
+        const l = liarHyperset();
+        const r = isTrustworthy(l);
+        expect(r.trust).toBe(false);
+        expect(r.reason).toContain("LIAR");
+    });
+    it("bisimulationPartition on a singleton labelled graph yields 1 class", () => {
+        const h = quineAtom();
+        const p = bisimulationPartition(h);
+        expect(new Set(p.values()).size).toBe(1);
+    });
+});
+// ─── 1000-iter fuzz ────────────────────────────────────────────────────
+describe("v2.19.47 CHRONOSHEAF · 1000-iter cross-primitive fuzz", () => {
+    it("sheaf cohomologyH1 never throws on random small covers", () => {
+        for (let i = 0; i < 1000; i++) {
+            const n = 3 + (i % 5);
+            const sites = [];
+            for (let k = 0; k < n; k++)
+                sites.push(`S${k}`);
+            const overlaps = [];
+            for (let a = 0; a < n; a++)
+                for (let b = a + 1; b < n; b++) {
+                    if (Math.random() < 0.5)
+                        overlaps.push([sites[a], sites[b]]);
+                }
+            expect(() => cohomologyH1({ sites, overlaps })).not.toThrow();
+        }
+    });
+    it("RG flow never throws on random vectors", () => {
+        for (let i = 0; i < 200; i++) {
+            const len = 1 + (i % 32);
+            const vector = Array.from({ length: len }, () => Math.random() * 100);
+            expect(() => rgFixedPoint({ vector, scale: 0 }, { factor: 2, aggregator: "mean" }, 20)).not.toThrow();
+        }
+    });
+    it("free_energy.selectAction never throws on random candidate sets", () => {
+        for (let i = 0; i < 200; i++) {
+            const supportSize = 2 + (i % 4);
+            const rand = () => Array.from({ length: supportSize }, () => Math.random());
+            const cands = Array.from({ length: 3 }, (_, k) => ({
+                id: `c${k}`,
+                predictedObs: normalise(rand()),
+                predictedQz: normalise(rand()),
+            }));
+            const scoring = { preferredObs: normalise(rand()), priorZ: normalise(rand()) };
+            expect(() => selectAction(cands, scoring)).not.toThrow();
+        }
+    });
+});
+//# sourceMappingURL=chronosheaf.test.js.map

package/dist/chronosheaf/chronosheaf.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chronosheaf.test.js","sourceRoot":"","sources":["../../src/chronosheaf/chronosheaf.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE9C,0EAA0E;AAE1E,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,iBAAiB,EAAE,iBAAiB,EAAqC,MAAM,mBAAmB,CAAC;AAExI,QAAQ,CAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,CAAC,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7C,MAAM,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,UAAU,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAC9C,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,YAAY,EAAE,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,KAAK,GAAG,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACnE,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,YAAY;YAAE,QAAQ,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QAC9D,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,OAAO,EACL,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY,EAAE,gBAAgB,GAE1D,MAAM,YAAY,CAAC;AAEpB,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACnC,CAAC;QACF,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SAC/C,CAAC;QACF,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9C,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;SAC3B,CAAC;QACF,MAAM,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACnC,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACjB,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACvB,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAChC,2EAA2E;QAC3E,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAe,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACxE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SAC/C,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9C,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;SAC3B,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAChC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,iBAAiB,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAE/F,QAAQ,CAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC;QACxF,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;QACzG,MAAM,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjH,oFAAoF;QACpF,MAAM,CAAC,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,0EAA0E,EAAE,GAAG,EAAE;QAClF,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChH,qFAAqF;QACrF,MAAM,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,sBAAsB,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QACvH,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAuB,MAAM,kBAAkB,CAAC;AAEhG,QAAQ,CAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,IAAI,GAAqB,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACnE,MAAM,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,IAAI,GAAqB;YAC7B,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE;YACjC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE;SAChC,CAAC;QACF,MAAM,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,IAAI,GAAqB;YAC7B,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE;YACjC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE;SAChC,CAAC;QACF,MAAM,CAAC,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,OAAO,EACL,YAAY,EAAE,OAAO,EAAE,qBAAqB,EACxB,YAAY,EAAE,qBAAqB,EAAE,SAAS,GACnE,MAAM,kBAAkB,CAAC;AAE1B,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACvB,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,qBAAqB,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAClD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,OAAO,GAAG,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;QACvF,MAAM,UAAU,GAAG;YACjB,EAAE,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE;YACzF,EAAE,EAAE,EAAE,KAAK,EAAG,YAAY,EAAE,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAG,WAAW,EAAE,SAAS,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE;SACzF,CAAC;QACF,MAAM,CAAC,GAAG,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,CAAC,GAAG,qBAAqB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,YAAY,EAAwB,MAAM,kBAAkB,CAAC;AAE/F,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,EAAE,GAAoB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,EAAE,GAAoB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,EAAE,GAAoB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9D,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxC,mCAAmC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;IACH,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,IAAI,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACxC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACxB,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,OAAO,EACL,WAAW,EAAE,WAAW,EAAE,mBAAmB,EAAE,uBAAuB,GAEvE,MAAM,eAAe,CAAC;AAEvB,QAAQ,CAAC,+CAA+C,EAAE,GAAG,EAAE;IAC7D,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,CAAC,GAAkB;YACvB,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACtB,KAAK,EAAE,IAAI,GAAG,CAAC;gBACb,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC5C,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;aAC7C,CAAC;SACH,CAAC;QACF,MAAM,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;QACvB,MAAM,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,CAAE,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,iBAAiB;IAC9D,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,CAAC,GAAG,uBAAuB,CAAC;YAChC,EAAE,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE;YAC5B,EAAE,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE;YAC5B,EAAE,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE;SAC9B,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,CAAC,GAAG,uBAAuB,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,QAAQ,EAAE,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,OAAO,EAAE,qBAAqB,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEtG,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;IACjE,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,YAAY,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,0EAA0E;AAE1E,QAAQ,CAAC,uDAAuD,EAAE,GAAG,EAAE;IACrE,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtB,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChD,MAAM,QAAQ,GAA4B,EAAE,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3D,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG;wBAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBACjE,CAAC;YACD,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QAChE,CAAC;IACH,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YACzB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;YACtE,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QACxG,CAAC;IACH,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,GAAa,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YACtF,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACjD,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,YAAY,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC;gBAC/B,WAAW,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC;aAC/B,CAAC,CAAC,CAAC;YACJ,MAAM,OAAO,GAAG,EAAE,YAAY,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YAC/E,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QAC3D,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/chronosheaf/free_energy.d.ts

@@ -0,0 +1,109 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-d · Friston Free Energy / Active Inference.
+ *
+ *   Math foundation (Friston 2010, Karl Friston's "Free-Energy Principle"):
+ *
+ *     Variational Free Energy
+ *
+ *       F = E_q[log q(z) − log p(z, o)]
+ *         = D_KL(q(z) ‖ p(z|o)) − log p(o)
+ *         ≥ −log p(o)             (Jensen)
+ *
+ *     where q(z) is the agent's recognition density, p(z, o) is the
+ *     generative model over hidden states z and observations o.
+ *     Minimising F over q yields q(z) ≈ p(z|o) (Bayes-optimal posterior)
+ *     and the residual −log p(o) is the surprise/marginal likelihood.
+ *
+ *     Expected Free Energy (action selection)
+ *
+ *       G(a) = E_{q(o,z|a)}[log q(z|a) − log p(z, o)]
+ *            ≈ epistemic_value(a) + extrinsic_value(a)
+ *
+ *     An agent picks a* = argmin_a G(a). G splits into
+ *       (i) epistemic: information gained about hidden states
+ *       (ii) extrinsic: log-prior preferences over observations.
+ *
+ *   AI-memory mapping (PAIN-001 time-direction + PAIN-006 confidence
+ *   + PAIN-007 substrate-mutation):
+ *
+ *     The CLI / MCP server is an active inference agent. Hidden state z =
+ *     "is upgrade safe to run now". Observations o = exit codes, pulse
+ *     drift, daemon process state. Actions a = {wait, queue, run-now,
+ *     remediation-message}. Minimising G picks the action that BOTH
+ *     reduces uncertainty about safety AND respects user-preference
+ *     priors (e.g. "do not break the running session"). The 60% verify
+ *     confidence number (PAIN-006) becomes a measure-theoretic posterior,
+ *     not a vibe.
+ *
+ *   Implementation: KL divergence + expected-free-energy computation on
+ *   categorical distributions. Pure-function, numerically stable
+ *   (log-sum-exp where needed).
+ */
+/** Categorical distribution as an array of probabilities (sums to 1). */
+export type Categorical = ReadonlyArray<number>;
+/** Normalise an array to a probability distribution (handles zeros). */
+export declare function normalise(v: ReadonlyArray<number>): number[];
+/** D_KL(p ‖ q) = Σ p_i · log(p_i / q_i). */
+export declare function klDivergence(p: Categorical, q: Categorical): number;
+/** Shannon entropy H[p] = −Σ p_i log p_i. */
+export declare function entropy(p: Categorical): number;
+/**
+ * Variational free energy F = D_KL(q ‖ p_prior) − E_q[log p(o|z)].
+ * Where:
+ *   q       = recognition density over hidden states z
+ *   prior   = p(z)
+ *   logLikelihood[z] = log p(o|z) for each state z
+ */
+export declare function variationalFreeEnergy(q: Categorical, prior: Categorical, logLikelihood: ReadonlyArray<number>): number;
+export interface ActionCandidate {
+    /** Human-readable id (e.g. "wait", "run-now", "queue"). */
+    id: string;
+    /** Predicted distribution over observations given this action: p(o|a). */
+    predictedObs: Categorical;
+    /** Predicted posterior over hidden states given this action: q(z|a). */
+    predictedQz: Categorical;
+}
+export interface ActionScoring {
+    /** Prior over preferred observations: p(o) (the agent's goals). */
+    preferredObs: Categorical;
+    /** Prior over hidden states: p(z). */
+    priorZ: Categorical;
+}
+/**
+ * Expected Free Energy G(a) = epistemic + extrinsic.
+ *   epistemic(a) = E_{p(o|a)}[D_KL(q(z|a, o) ‖ q(z|a))]
+ *               (information gain about z from observing o)
+ *   extrinsic(a) = D_KL(p(o|a) ‖ p(o))
+ *               (divergence of predicted obs from preferred obs)
+ *
+ * Lower G = better action. We approximate epistemic via the entropy
+ * reduction of the predicted posterior vs the prior on z; that's a
+ * standard simplification when q(z|a, o) is hard to evaluate.
+ */
+export declare function expectedFreeEnergy(action: ActionCandidate, scoring: ActionScoring): {
+    G: number;
+    epistemic: number;
+    extrinsic: number;
+};
+/** Pick the action that minimises Expected Free Energy. */
+export declare function selectAction(candidates: ReadonlyArray<ActionCandidate>, scoring: ActionScoring): {
+    winner: ActionCandidate;
+    ranked: Array<{
+        id: string;
+        G: number;
+        epistemic: number;
+        extrinsic: number;
+    }>;
+};
+/**
+ * Convert a verify-style confidence number (0..1) into a measure-
+ * theoretic posterior on a two-state {TRUE, FALSE} model. This is the
+ * PAIN-006 fix: instead of returning 60% as a vibe, we return a Beta
+ * posterior + the entropy of the posterior (epistemic uncertainty).
+ */
+export declare function confidenceToPosterior(confidence: number, observations: number): {
+    posterior: Categorical;
+    entropyBits: number;
+    surprise: number;
+};
+//# sourceMappingURL=free_energy.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"free_energy.d.ts","sourceRoot":"","sources":["../../src/chronosheaf/free_energy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AAEH,yEAAyE;AACzE,MAAM,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;AAIhD,wEAAwE;AACxE,wBAAgB,SAAS,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE,CAQ5D;AAED,4CAA4C;AAC5C,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,GAAG,MAAM,CAWnE;AAED,6CAA6C;AAC7C,wBAAgB,OAAO,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAI9C;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,WAAW,EACd,KAAK,EAAE,WAAW,EAClB,aAAa,EAAE,aAAa,CAAC,MAAM,CAAC,GACnC,MAAM,CAUR;AAED,MAAM,WAAW,eAAe;IAC9B,2DAA2D;IAC3D,EAAE,EAAE,MAAM,CAAC;IACX,0EAA0E;IAC1E,YAAY,EAAE,WAAW,CAAC;IAC1B,wEAAwE;IACxE,WAAW,EAAE,WAAW,CAAC;CAC1B;AAED,MAAM,WAAW,aAAa;IAC5B,mEAAmE;IACnE,YAAY,EAAE,WAAW,CAAC;IAC1B,sCAAsC;IACtC,MAAM,EAAE,WAAW,CAAC;CACrB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,EAAE,aAAa,GAAG;IACnF,CAAC,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;CACjD,CAIA;AAED,2DAA2D;AAC3D,wBAAgB,YAAY,CAC1B,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,EAC1C,OAAO,EAAE,aAAa,GACrB;IAAE,MAAM,EAAE,eAAe,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CAU7G;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,GACnB;IAAE,SAAS,EAAE,WAAW,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAWnE"}

package/dist/chronosheaf/free_energy.js

@@ -0,0 +1,142 @@
+/**
+ * v2.19.47 — CHRONOSHEAF P2-d · Friston Free Energy / Active Inference.
+ *
+ *   Math foundation (Friston 2010, Karl Friston's "Free-Energy Principle"):
+ *
+ *     Variational Free Energy
+ *
+ *       F = E_q[log q(z) − log p(z, o)]
+ *         = D_KL(q(z) ‖ p(z|o)) − log p(o)
+ *         ≥ −log p(o)             (Jensen)
+ *
+ *     where q(z) is the agent's recognition density, p(z, o) is the
+ *     generative model over hidden states z and observations o.
+ *     Minimising F over q yields q(z) ≈ p(z|o) (Bayes-optimal posterior)
+ *     and the residual −log p(o) is the surprise/marginal likelihood.
+ *
+ *     Expected Free Energy (action selection)
+ *
+ *       G(a) = E_{q(o,z|a)}[log q(z|a) − log p(z, o)]
+ *            ≈ epistemic_value(a) + extrinsic_value(a)
+ *
+ *     An agent picks a* = argmin_a G(a). G splits into
+ *       (i) epistemic: information gained about hidden states
+ *       (ii) extrinsic: log-prior preferences over observations.
+ *
+ *   AI-memory mapping (PAIN-001 time-direction + PAIN-006 confidence
+ *   + PAIN-007 substrate-mutation):
+ *
+ *     The CLI / MCP server is an active inference agent. Hidden state z =
+ *     "is upgrade safe to run now". Observations o = exit codes, pulse
+ *     drift, daemon process state. Actions a = {wait, queue, run-now,
+ *     remediation-message}. Minimising G picks the action that BOTH
+ *     reduces uncertainty about safety AND respects user-preference
+ *     priors (e.g. "do not break the running session"). The 60% verify
+ *     confidence number (PAIN-006) becomes a measure-theoretic posterior,
+ *     not a vibe.
+ *
+ *   Implementation: KL divergence + expected-free-energy computation on
+ *   categorical distributions. Pure-function, numerically stable
+ *   (log-sum-exp where needed).
+ */
+function safeLog(x) { return x <= 0 ? -1e9 : Math.log(x); }
+/** Normalise an array to a probability distribution (handles zeros). */
+export function normalise(v) {
+    let s = 0;
+    for (const x of v)
+        s += Math.max(0, x);
+    if (s <= 0) {
+        // Degenerate input → uniform.
+        return new Array(v.length).fill(1 / Math.max(1, v.length));
+    }
+    return v.map((x) => Math.max(0, x) / s);
+}
+/** D_KL(p ‖ q) = Σ p_i · log(p_i / q_i). */
+export function klDivergence(p, q) {
+    if (p.length !== q.length)
+        throw new Error("KL: distributions must have same support");
+    let kl = 0;
+    for (let i = 0; i < p.length; i++) {
+        const pi = p[i] ?? 0;
+        const qi = q[i] ?? 0;
+        if (pi <= 0)
+            continue;
+        if (qi <= 0)
+            return Infinity;
+        kl += pi * (Math.log(pi) - Math.log(qi));
+    }
+    return kl;
+}
+/** Shannon entropy H[p] = −Σ p_i log p_i. */
+export function entropy(p) {
+    let h = 0;
+    for (const x of p)
+        if (x > 0)
+            h -= x * Math.log(x);
+    return h;
+}
+/**
+ * Variational free energy F = D_KL(q ‖ p_prior) − E_q[log p(o|z)].
+ * Where:
+ *   q       = recognition density over hidden states z
+ *   prior   = p(z)
+ *   logLikelihood[z] = log p(o|z) for each state z
+ */
+export function variationalFreeEnergy(q, prior, logLikelihood) {
+    if (q.length !== prior.length || q.length !== logLikelihood.length) {
+        throw new Error("F: q, prior, and likelihood must have same support");
+    }
+    const kl = klDivergence(q, prior);
+    let expectedNegLogLik = 0;
+    for (let i = 0; i < q.length; i++) {
+        expectedNegLogLik -= (q[i] ?? 0) * (logLikelihood[i] ?? 0);
+    }
+    return kl + expectedNegLogLik;
+}
+/**
+ * Expected Free Energy G(a) = epistemic + extrinsic.
+ *   epistemic(a) = E_{p(o|a)}[D_KL(q(z|a, o) ‖ q(z|a))]
+ *               (information gain about z from observing o)
+ *   extrinsic(a) = D_KL(p(o|a) ‖ p(o))
+ *               (divergence of predicted obs from preferred obs)
+ *
+ * Lower G = better action. We approximate epistemic via the entropy
+ * reduction of the predicted posterior vs the prior on z; that's a
+ * standard simplification when q(z|a, o) is hard to evaluate.
+ */
+export function expectedFreeEnergy(action, scoring) {
+    const epistemic = Math.max(0, entropy(scoring.priorZ) - entropy(action.predictedQz));
+    const extrinsic = klDivergence(action.predictedObs, scoring.preferredObs);
+    return { G: epistemic + extrinsic, epistemic, extrinsic };
+}
+/** Pick the action that minimises Expected Free Energy. */
+export function selectAction(candidates, scoring) {
+    const scored = candidates.map((a) => {
+        const s = expectedFreeEnergy(a, scoring);
+        return { action: a, ...s };
+    });
+    scored.sort((a, b) => a.G - b.G);
+    return {
+        winner: scored[0].action,
+        ranked: scored.map(({ action, G, epistemic, extrinsic }) => ({ id: action.id, G, epistemic, extrinsic })),
+    };
+}
+/**
+ * Convert a verify-style confidence number (0..1) into a measure-
+ * theoretic posterior on a two-state {TRUE, FALSE} model. This is the
+ * PAIN-006 fix: instead of returning 60% as a vibe, we return a Beta
+ * posterior + the entropy of the posterior (epistemic uncertainty).
+ */
+export function confidenceToPosterior(confidence, observations) {
+    const c = Math.max(0, Math.min(1, confidence));
+    // Treat confidence as the mean of a Beta(α, β) with α + β = max(observations, 2).
+    const n = Math.max(2, observations);
+    const alpha = c * n + 1;
+    const beta = (1 - c) * n + 1;
+    const mean = alpha / (alpha + beta);
+    const posterior = normalise([mean, 1 - mean]);
+    const h = entropy(posterior);
+    const surprise = -safeLog(mean); // -log p(TRUE)
+    return { posterior, entropyBits: h / Math.log(2), surprise };
+}
+//# sourceMappingURL=free_energy.js.map