@mneme-ai/core 2.19.26 → 2.19.27

package/dist/dreamspace_pair/dreamspace_pair.test.js

@@ -0,0 +1,175 @@
+import { describe, it, expect } from "vitest";
+import { scorePair, rankAllPairs, verifyPairReport, formatPairLine, } from "./index.js";
+const SECRET = "pair-test-secret-997744";
+function sample(toolName, result) {
+    return { toolName, result };
+}
+function schema(toolName, required, optional = []) {
+    return { toolName, requiredProps: required, optionalProps: optional };
+}
+describe("v2.19.27 PAIR · scorePair (mutual info approximation)", () => {
+    it("perfect coverage: A's output keys cover ALL of B's required + optional", () => {
+        const s = scorePair({
+            toolA: "A",
+            outputsA: [sample("A", { name: "x", count: 3 })],
+            schemaB: schema("B", ["name", "count"], []),
+        });
+        expect(s.requiredCoverage).toBe(1.0);
+        expect(s.optionalCoverage).toBe(1.0);
+        expect(s.mutualInfoScore).toBeCloseTo(0.5 + 0.3 + 0.2 * s.keyOverlapScore, 5);
+    });
+    it("zero coverage: A's keys disjoint from B's required → low MI", () => {
+        const s = scorePair({
+            toolA: "A",
+            outputsA: [sample("A", { foo: 1 })],
+            schemaB: schema("B", ["name", "count"]),
+        });
+        expect(s.requiredCoverage).toBe(0);
+        expect(s.mutualInfoScore).toBeLessThan(0.3);
+    });
+    it("partial required coverage rewards proportionally", () => {
+        const s = scorePair({
+            toolA: "A",
+            outputsA: [sample("A", { name: "x" })],
+            schemaB: schema("B", ["name", "count", "ts"]),
+        });
+        expect(s.requiredCoverage).toBeCloseTo(1 / 3, 5);
+    });
+    it("case-insensitive key matching", () => {
+        const s = scorePair({
+            toolA: "A",
+            outputsA: [sample("A", { NAME: "x" })],
+            schemaB: schema("B", ["name"]),
+        });
+        expect(s.requiredCoverage).toBe(1.0);
+    });
+    it("multiple samples union their keys", () => {
+        const s = scorePair({
+            toolA: "A",
+            outputsA: [sample("A", { name: "x" }), sample("A", { count: 1 })],
+            schemaB: schema("B", ["name", "count"]),
+        });
+        expect(s.requiredCoverage).toBe(1.0);
+    });
+    it("empty required + empty output -> vacuous 1.0 required coverage", () => {
+        const s = scorePair({
+            toolA: "A",
+            outputsA: [sample("A", {})],
+            schemaB: schema("B", [], []),
+        });
+        expect(s.requiredCoverage).toBe(1.0);
+        expect(s.optionalCoverage).toBe(1.0);
+    });
+});
+describe("v2.19.27 PAIR · rankAllPairs (full ordered ranking)", () => {
+    it("scores every ordered (A, B) pair; self-pairs excluded", () => {
+        const r = rankAllPairs({
+            toolOutputs: [
+                [sample("A", { name: "x", count: 1 })],
+                [sample("B", { name: "y" })],
+            ],
+            toolSchemas: [
+                schema("A", ["name"]), // B → A; A → A excluded
+                schema("B", ["name"]),
+            ],
+            minScore: 0,
+            builtAt: 0,
+            secret: SECRET,
+        });
+        // 2 tools, 2 schemas, no self-pairs -> 2 candidate pairs (A→B, B→A)
+        expect(r.totalCandidatePairs).toBe(2);
+    });
+    it("sorts by mutual info desc; filters below minScore", () => {
+        const r = rankAllPairs({
+            toolOutputs: [
+                [sample("good", { name: "x", count: 1, ts: 1 })],
+                [sample("bad", { unrelated: 1 })],
+            ],
+            toolSchemas: [
+                schema("good", []),
+                schema("bad", []),
+                schema("target", ["name", "count", "ts"]),
+            ],
+            minScore: 0.5,
+            builtAt: 0,
+            secret: SECRET,
+        });
+        // good → target should rank high; bad → target low (likely filtered)
+        expect(r.pairs[0].toolA).toBe("good");
+        expect(r.pairs[0].toolB).toBe("target");
+        expect(r.pairs.every((p) => p.mutualInfoScore >= 0.5)).toBe(true);
+    });
+    it("topN respected", () => {
+        const r = rankAllPairs({
+            toolOutputs: Array.from({ length: 5 }, (_, i) => [sample(`t${i}`, { x: 1 })]),
+            toolSchemas: Array.from({ length: 5 }, (_, i) => schema(`t${i}`, ["x"])),
+            minScore: 0,
+            topN: 3,
+            builtAt: 0,
+            secret: SECRET,
+        });
+        expect(r.pairs.length).toBeLessThanOrEqual(3);
+    });
+    it("HMAC sig verifies; rejects tamper", () => {
+        const r = rankAllPairs({
+            toolOutputs: [[sample("a", { x: 1 })]],
+            toolSchemas: [schema("a", []), schema("b", [])],
+            builtAt: 0,
+            secret: SECRET,
+        });
+        expect(verifyPairReport(r, SECRET)).toBe(true);
+        expect(verifyPairReport({ ...r, qualifyingPairs: 999 }, SECRET)).toBe(false);
+    });
+    it("MEASURED 100% determinism: same input -> same sig (30 trials)", () => {
+        const input = {
+            toolOutputs: [[sample("a", { x: 1 })], [sample("b", { y: 1 })]],
+            toolSchemas: [schema("a", ["x"]), schema("b", ["y"])],
+            builtAt: 1_000_000,
+            secret: SECRET,
+        };
+        const firstSig = rankAllPairs(input).sig;
+        let allEqual = true;
+        for (let i = 0; i < 30; i++) {
+            if (rankAllPairs(input).sig !== firstSig) {
+                allEqual = false;
+                break;
+            }
+        }
+        expect(allEqual).toBe(true);
+    });
+    it("MEASURED canonical scenario: truth.forensic→bug_prophet has high MI", () => {
+        // truth.forensic outputs { claim, sniffs, verdict, evidence }
+        // bug_prophet expects { claim, evidence } as input
+        const r = rankAllPairs({
+            toolOutputs: [
+                [sample("mneme.truth.forensic", { claim: "x", sniffs: [], verdict: "ACCEPTED", evidence: [] })],
+                [sample("mneme.bug_prophet", { prophecy: "..." })], // unrelated output
+            ],
+            toolSchemas: [
+                schema("mneme.bug_prophet", ["claim", "evidence"]),
+                schema("mneme.truth.forensic", ["claim"]),
+            ],
+            minScore: 0.3,
+            builtAt: 0,
+            secret: SECRET,
+        });
+        const tfToProphet = r.pairs.find((p) => p.toolA === "mneme.truth.forensic" && p.toolB === "mneme.bug_prophet");
+        expect(tfToProphet).toBeDefined();
+        expect(tfToProphet.mutualInfoScore).toBeGreaterThanOrEqual(0.5);
+    });
+});
+describe("v2.19.27 PAIR · formatter", () => {
+    it("formatPairLine includes A → B + MI% + required% + optional%", () => {
+        const s = scorePair({
+            toolA: "x",
+            outputsA: [sample("x", { name: "y" })],
+            schemaB: schema("y", ["name"]),
+        });
+        const line = formatPairLine(s);
+        expect(line).toContain("PAIR x → y");
+        expect(line).toContain("MI=");
+        expect(line).toContain("req=");
+        expect(line).toContain("opt=");
+    });
+});
+//# sourceMappingURL=dreamspace_pair.test.js.map

package/dist/dreamspace_pair/dreamspace_pair.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dreamspace_pair.test.js","sourceRoot":"","sources":["../../src/dreamspace_pair/dreamspace_pair.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EACL,SAAS,EACT,YAAY,EACZ,gBAAgB,EAChB,cAAc,GAGf,MAAM,YAAY,CAAC;AAEpB,MAAM,MAAM,GAAG,yBAAyB,CAAC;AAEzC,SAAS,MAAM,CAAC,QAAgB,EAAE,MAA+B;IAC/D,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;AAC9B,CAAC;AAED,SAAS,MAAM,CAAC,QAAgB,EAAE,QAAkB,EAAE,WAAqB,EAAE;IAC3E,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;AACxE,CAAC;AAED,QAAQ,CAAC,uDAAuD,EAAE,GAAG,EAAE;IACrE,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAChD,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC;SAC5C,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACnC,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;SACxC,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;YACtC,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;SAC9C,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;YACtC,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;SAC/B,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACjE,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;SACxC,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC3B,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC;SAC7B,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,qDAAqD,EAAE,GAAG,EAAE;IACnE,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,YAAY,CAAC;YACrB,WAAW,EAAE;gBACX,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;gBACtC,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;aAC7B;YACD,WAAW,EAAE;gBACX,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAG,wBAAwB;gBAChD,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;aACtB;YACD,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,MAAM;SACf,CAAC,CAAC;QACH,oEAAoE;QACpE,MAAM,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,YAAY,CAAC;YACrB,WAAW,EAAE;gBACX,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAChD,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;aAClC;YACD,WAAW,EAAE;gBACX,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClB,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;gBACjB,MAAM,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;aAC1C;YACD,QAAQ,EAAE,GAAG;YACb,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,MAAM;SACf,CAAC,CAAC;QACH,qEAAqE;QACrE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACxB,MAAM,CAAC,GAAG,YAAY,CAAC;YACrB,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7E,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACxE,QAAQ,EAAE,CAAC;YACX,IAAI,EAAE,CAAC;YACP,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,MAAM;SACf,CAAC,CAAC;QACH,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,YAAY,CAAC;YACrB,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACtC,WAAW,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC/C,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,MAAM;SACf,CAAC,CAAC;QACH,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,CAAC,gBAAgB,CAAC,EAAE,GAAG,CAAC,EAAE,eAAe,EAAE,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,KAAK,GAAG;YACZ,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/D,WAAW,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACrD,OAAO,EAAE,SAAS;YAClB,MAAM,EAAE,MAAM;SACf,CAAC;QACF,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;QACzC,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;gBAAC,QAAQ,GAAG,KAAK,CAAC;gBAAC,MAAM;YAAC,CAAC;QACxE,CAAC;QACD,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,8DAA8D;QAC9D,mDAAmD;QACnD,MAAM,CAAC,GAAG,YAAY,CAAC;YACrB,WAAW,EAAE;gBACX,CAAC,MAAM,CAAC,sBAAsB,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC/F,CAAC,MAAM,CAAC,mBAAmB,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,mBAAmB;aACxE;YACD,WAAW,EAAE;gBACX,MAAM,CAAC,mBAAmB,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;gBAClD,MAAM,CAAC,sBAAsB,EAAE,CAAC,OAAO,CAAC,CAAC;aAC1C;YACD,QAAQ,EAAE,GAAG;YACb,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,MAAM;SACf,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,sBAAsB,IAAI,CAAC,CAAC,KAAK,KAAK,mBAAmB,CAAC,CAAC;QAC/G,MAAM,CAAC,WAAW,CAAC,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,CAAC,WAAY,CAAC,eAAe,CAAC,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;YACtC,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;SAC/B,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/dreamspace_pair/index.d.ts

@@ -0,0 +1,99 @@
+/**
+ * v2.19.27 — MNEME DREAMSPACE · PAIR (stage 3 of 6)
+ *
+ *   "for every pair (A, B): score = mutual_info(output_A, expected_
+ *    input_B). top pairs → ผ่านขั้น 4"
+ *                                          — user audit, 2026-05-17
+ *
+ *   Diagnosis: v2.19.26 EVOLUTION.selectMatingPairs uses FREQUENCY
+ *   (how often A→B fires together). PAIR adds QUALITY — measures
+ *   how well A's output matches what B EXPECTS as input. High
+ *   mutual_info → A and B are genuinely complementary; safe to splice.
+ *
+ *   We approximate mutual information without LLM: compare key-name
+ *   overlap (Jaccard over object property names) AND value-type
+ *   compatibility. Both signals together approximate "would A's output
+ *   be a plausible input to B?".
+ *
+ *   Composes onto:
+ *     - v2.19.26 EVOLUTION (replaces co-occurrence ranking with quality)
+ *     - v2.19.27 PROBE (probe outputs feed PAIR's mutual_info)
+ *     - v2.19.9 WRAPPER_GENESPLICING (high-mutual-info pairs → chimera)
+ *     - v2.19.25 SLEEP TRAINING (PAIR fitness blends with jaccard reward)
+ *
+ * Honest scope:
+ *   - Mutual info APPROXIMATION via shape-matching, not full Shannon
+ *     information. Faster, deterministic, sufficient for "are these
+ *     two tools complementary?" decision.
+ *   - HMAC-signed PairReport so federation can ship verified pairs.
+ */
+declare const PROTOCOL_VERSION: 1;
+export interface ToolOutputSample {
+    toolName: string;
+    /** Object output (we focus on object-shape compatibility). */
+    result: Record<string, unknown>;
+}
+export interface ToolInputSchema {
+    toolName: string;
+    /** Required + optional property names. */
+    requiredProps: string[];
+    optionalProps: string[];
+}
+export interface PairScore {
+    toolA: string;
+    toolB: string;
+    /** Object key overlap A.outputs vs B.requiredProps (Jaccard 0..1). */
+    keyOverlapScore: number;
+    /** Required-coverage: fraction of B's required props that A produces. */
+    requiredCoverage: number;
+    /** Optional-coverage: fraction of B's optional props A also produces. */
+    optionalCoverage: number;
+    /** Final mutual_info approximation (weighted blend). */
+    mutualInfoScore: number;
+}
+export interface PairReport {
+    v: typeof PROTOCOL_VERSION;
+    pairs: PairScore[];
+    totalCandidatePairs: number;
+    qualifyingPairs: number;
+    minScore: number;
+    builtAt: number;
+    sig: string;
+}
+/**
+ * Score a single (A, B) pair: how complementary is A's output to B's
+ * expected input?
+ *
+ *   keyOverlapScore       = jaccard(unionOutputKeys(A), requiredProps(B) ∪ optionalProps(B))
+ *   requiredCoverage      = |outputKeys(A) ∩ requiredProps(B)| / |requiredProps(B)|
+ *   optionalCoverage      = |outputKeys(A) ∩ optionalProps(B)| / |optionalProps(B)|
+ *   mutualInfoScore       = 0.5 * requiredCoverage + 0.3 * optionalCoverage + 0.2 * keyOverlapScore
+ *
+ * Required-coverage dominates because B will THROW if a required prop
+ * is missing; optional is nice-to-have; raw key overlap captures broader
+ * signal compatibility.
+ */
+export declare function scorePair(input: {
+    toolA: string;
+    outputsA: ToolOutputSample[];
+    schemaB: ToolInputSchema;
+}): PairScore;
+/**
+ * Score ALL ordered (A, B) pairs across the supplied tools; filter
+ * above minScore; sort by mutualInfoScore desc. Self-pairs excluded.
+ *
+ * Returns top pairs ready to feed into v2.19.26 GESTATION as
+ * `pattern_co_occurrence` signals with quality (not just frequency).
+ */
+export declare function rankAllPairs(input: {
+    toolOutputs: ToolOutputSample[][];
+    toolSchemas: ToolInputSchema[];
+    minScore?: number;
+    topN?: number;
+    builtAt?: number;
+    secret?: string;
+}): PairReport;
+export declare function verifyPairReport(r: PairReport, secret?: string): boolean;
+export declare function formatPairLine(p: PairScore): string;
+export {};
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/dreamspace_pair/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAIH,QAAA,MAAM,gBAAgB,EAAG,CAAU,CAAC;AAGpC,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,8DAA8D;IAC9D,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACjC;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,0CAA0C;IAC1C,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,sEAAsE;IACtE,eAAe,EAAE,MAAM,CAAC;IACxB,yEAAyE;IACzE,gBAAgB,EAAE,MAAM,CAAC;IACzB,yEAAyE;IACzE,gBAAgB,EAAE,MAAM,CAAC;IACzB,wDAAwD;IACxD,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,CAAC,EAAE,OAAO,gBAAgB,CAAC;IAC3B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,GAAG,EAAE,MAAM,CAAC;CACb;AA0CD;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,gBAAgB,EAAE,CAAC;IAC7B,OAAO,EAAE,eAAe,CAAC;CAC1B,GAAG,SAAS,CAkBZ;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE;IAClC,WAAW,EAAE,gBAAgB,EAAE,EAAE,CAAC;IAClC,WAAW,EAAE,eAAe,EAAE,CAAC;IAC/B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,GAAG,UAAU,CAgCb;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAGxE;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAGnD"}

package/dist/dreamspace_pair/index.js

@@ -0,0 +1,161 @@
+/**
+ * v2.19.27 — MNEME DREAMSPACE · PAIR (stage 3 of 6)
+ *
+ *   "for every pair (A, B): score = mutual_info(output_A, expected_
+ *    input_B). top pairs → ผ่านขั้น 4"
+ *                                          — user audit, 2026-05-17
+ *
+ *   Diagnosis: v2.19.26 EVOLUTION.selectMatingPairs uses FREQUENCY
+ *   (how often A→B fires together). PAIR adds QUALITY — measures
+ *   how well A's output matches what B EXPECTS as input. High
+ *   mutual_info → A and B are genuinely complementary; safe to splice.
+ *
+ *   We approximate mutual information without LLM: compare key-name
+ *   overlap (Jaccard over object property names) AND value-type
+ *   compatibility. Both signals together approximate "would A's output
+ *   be a plausible input to B?".
+ *
+ *   Composes onto:
+ *     - v2.19.26 EVOLUTION (replaces co-occurrence ranking with quality)
+ *     - v2.19.27 PROBE (probe outputs feed PAIR's mutual_info)
+ *     - v2.19.9 WRAPPER_GENESPLICING (high-mutual-info pairs → chimera)
+ *     - v2.19.25 SLEEP TRAINING (PAIR fitness blends with jaccard reward)
+ *
+ * Honest scope:
+ *   - Mutual info APPROXIMATION via shape-matching, not full Shannon
+ *     information. Faster, deterministic, sufficient for "are these
+ *     two tools complementary?" decision.
+ *   - HMAC-signed PairReport so federation can ship verified pairs.
+ */
+import { createHmac, timingSafeEqual } from "node:crypto";
+const PROTOCOL_VERSION = 1;
+const DEFAULT_MIN_SCORE = 0.3;
+function canon(v) {
+    if (v === null || typeof v !== "object")
+        return JSON.stringify(v);
+    if (Array.isArray(v))
+        return "[" + v.map(canon).join(",") + "]";
+    const keys = Object.keys(v).sort();
+    return "{" + keys.map((k) => JSON.stringify(k) + ":" + canon(v[k])).join(",") + "}";
+}
+function defaultSecret() {
+    return process.env["MNEME_DREAMSPACE_PAIR_SECRET"] || `mneme-dreamspace-pair-v${PROTOCOL_VERSION}`;
+}
+function hmacHex(body, secret) {
+    return createHmac("sha256", secret).update(canon(body)).digest("hex");
+}
+function safeEqHex(a, b) {
+    try {
+        return timingSafeEqual(Buffer.from(a, "hex"), Buffer.from(b, "hex"));
+    }
+    catch {
+        return false;
+    }
+}
+/** Jaccard over two string sets, case-insensitive. */
+function jaccardKeys(a, b) {
+    const sa = new Set(a.map((x) => x.toLowerCase()));
+    const sb = new Set(b.map((x) => x.toLowerCase()));
+    if (sa.size === 0 && sb.size === 0)
+        return 1.0;
+    if (sa.size === 0 || sb.size === 0)
+        return 0.0;
+    let inter = 0;
+    for (const x of sa)
+        if (sb.has(x))
+            inter++;
+    return inter / (sa.size + sb.size - inter);
+}
+/** Union of all output keys observed across the tool's samples. */
+function unionOutputKeys(samples) {
+    const keys = new Set();
+    for (const s of samples) {
+        for (const k of Object.keys(s.result))
+            keys.add(k.toLowerCase());
+    }
+    return Array.from(keys).sort();
+}
+/**
+ * Score a single (A, B) pair: how complementary is A's output to B's
+ * expected input?
+ *
+ *   keyOverlapScore       = jaccard(unionOutputKeys(A), requiredProps(B) ∪ optionalProps(B))
+ *   requiredCoverage      = |outputKeys(A) ∩ requiredProps(B)| / |requiredProps(B)|
+ *   optionalCoverage      = |outputKeys(A) ∩ optionalProps(B)| / |optionalProps(B)|
+ *   mutualInfoScore       = 0.5 * requiredCoverage + 0.3 * optionalCoverage + 0.2 * keyOverlapScore
+ *
+ * Required-coverage dominates because B will THROW if a required prop
+ * is missing; optional is nice-to-have; raw key overlap captures broader
+ * signal compatibility.
+ */
+export function scorePair(input) {
+    const outputKeysA = unionOutputKeys(input.outputsA);
+    const setA = new Set(outputKeysA);
+    const reqB = input.schemaB.requiredProps.map((p) => p.toLowerCase());
+    const optB = input.schemaB.optionalProps.map((p) => p.toLowerCase());
+    const allB = [...reqB, ...optB];
+    const keyOverlap = jaccardKeys(outputKeysA, allB);
+    const reqCov = reqB.length === 0 ? 1.0 : reqB.filter((k) => setA.has(k)).length / reqB.length;
+    const optCov = optB.length === 0 ? 1.0 : optB.filter((k) => setA.has(k)).length / optB.length;
+    const mi = 0.5 * reqCov + 0.3 * optCov + 0.2 * keyOverlap;
+    return {
+        toolA: input.toolA,
+        toolB: input.schemaB.toolName,
+        keyOverlapScore: keyOverlap,
+        requiredCoverage: reqCov,
+        optionalCoverage: optCov,
+        mutualInfoScore: mi,
+    };
+}
+/**
+ * Score ALL ordered (A, B) pairs across the supplied tools; filter
+ * above minScore; sort by mutualInfoScore desc. Self-pairs excluded.
+ *
+ * Returns top pairs ready to feed into v2.19.26 GESTATION as
+ * `pattern_co_occurrence` signals with quality (not just frequency).
+ */
+export function rankAllPairs(input) {
+    const minScore = input.minScore ?? DEFAULT_MIN_SCORE;
+    const topN = input.topN ?? 25;
+    const samplesByTool = new Map();
+    for (const arr of input.toolOutputs) {
+        if (arr.length === 0)
+            continue;
+        const name = arr[0].toolName;
+        const prev = samplesByTool.get(name) ?? [];
+        samplesByTool.set(name, prev.concat(arr));
+    }
+    const scoredPairs = [];
+    let totalCandidatePairs = 0;
+    for (const [aName, aSamples] of samplesByTool) {
+        for (const schemaB of input.toolSchemas) {
+            if (aName === schemaB.toolName)
+                continue;
+            totalCandidatePairs++;
+            const s = scorePair({ toolA: aName, outputsA: aSamples, schemaB });
+            if (s.mutualInfoScore >= minScore)
+                scoredPairs.push(s);
+        }
+    }
+    scoredPairs.sort((a, b) => b.mutualInfoScore - a.mutualInfoScore || a.toolA.localeCompare(b.toolA) || a.toolB.localeCompare(b.toolB));
+    const top = scoredPairs.slice(0, topN);
+    const body = {
+        v: PROTOCOL_VERSION,
+        pairs: top,
+        totalCandidatePairs,
+        qualifyingPairs: scoredPairs.length,
+        minScore,
+        builtAt: input.builtAt ?? Date.now(),
+    };
+    const sig = hmacHex(body, input.secret ?? defaultSecret());
+    return { ...body, sig };
+}
+export function verifyPairReport(r, secret) {
+    const { sig, ...body } = r;
+    return safeEqHex(hmacHex(body, secret ?? defaultSecret()), sig);
+}
+export function formatPairLine(p) {
+    const mi = (p.mutualInfoScore * 100).toFixed(0);
+    return `💞 PAIR ${p.toolA} → ${p.toolB} · MI=${mi}% · req=${(p.requiredCoverage * 100).toFixed(0)}% · opt=${(p.optionalCoverage * 100).toFixed(0)}%`;
+}
+//# sourceMappingURL=index.js.map

package/dist/dreamspace_pair/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/dreamspace_pair/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE1D,MAAM,gBAAgB,GAAG,CAAU,CAAC;AACpC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAsC9B,SAAS,KAAK,CAAC,CAAU;IACvB,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAClE,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IAChE,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAA4B,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9D,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,CAAE,CAA6B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;AACnH,CAAC;AAED,SAAS,aAAa;IACpB,OAAO,OAAO,CAAC,GAAG,CAAC,8BAA8B,CAAC,IAAI,0BAA0B,gBAAgB,EAAE,CAAC;AACrG,CAAC;AAED,SAAS,OAAO,CAAC,IAAa,EAAE,MAAc;IAC5C,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS;IACrC,IAAI,CAAC;QAAC,OAAO,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAAC,CAAC;IAC7E,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC;AACzB,CAAC;AAED,sDAAsD;AACtD,SAAS,WAAW,CAAC,CAAW,EAAE,CAAW;IAC3C,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAClD,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/C,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,KAAK,EAAE,CAAC;IAC3C,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AAC7C,CAAC;AAED,mEAAmE;AACnE,SAAS,eAAe,CAAC,OAA2B;IAClD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AACjC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAC,KAIzB;IACC,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IACrE,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IACrE,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;IAChC,MAAM,UAAU,GAAG,WAAW,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC9F,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC9F,MAAM,EAAE,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,MAAM,GAAG,GAAG,GAAG,UAAU,CAAC;IAC1D,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ;QAC7B,eAAe,EAAE,UAAU;QAC3B,gBAAgB,EAAE,MAAM;QACxB,gBAAgB,EAAE,MAAM;QACxB,eAAe,EAAE,EAAE;KACpB,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,KAO5B;IACC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,iBAAiB,CAAC;IACrD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;IAC9B,MAAM,aAAa,GAAG,IAAI,GAAG,EAA8B,CAAC;IAC5D,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC/B,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC;QAC9B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC3C,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,MAAM,WAAW,GAAgB,EAAE,CAAC;IACpC,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9C,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,WAAW,EAAE,CAAC;YACxC,IAAI,KAAK,KAAK,OAAO,CAAC,QAAQ;gBAAE,SAAS;YACzC,mBAAmB,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;YACnE,IAAI,CAAC,CAAC,eAAe,IAAI,QAAQ;gBAAE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IACD,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACtI,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACvC,MAAM,IAAI,GAA4B;QACpC,CAAC,EAAE,gBAAgB;QACnB,KAAK,EAAE,GAAG;QACV,mBAAmB;QACnB,eAAe,EAAE,WAAW,CAAC,MAAM;QACnC,QAAQ;QACR,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,EAAE;KACrC,CAAC;IACF,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,IAAI,aAAa,EAAE,CAAC,CAAC;IAC3D,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,CAAa,EAAE,MAAe;IAC7D,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;IAC3B,OAAO,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,IAAI,aAAa,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;AAClE,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,CAAY;IACzC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,eAAe,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAChD,OAAO,WAAW,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,KAAK,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AACvJ,CAAC"}

package/dist/dreamspace_probe/dreamspace_probe.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=dreamspace_probe.test.d.ts.map

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

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

package/dist/dreamspace_probe/dreamspace_probe.test.js

@@ -0,0 +1,179 @@
+import { describe, it, expect } from "vitest";
+import { latencyScore, outputShapeEntropy, errorRate, utilityScore, aggregateFitness, finaliseProbe, runProbeBattery, verifyProbeReport, formatProbeLine, } from "./index.js";
+const SECRET = "probe-test-secret-997744";
+function run(opts = {}) {
+    return {
+        inputLabel: "x",
+        inputSource: "synthetic",
+        latencyMs: 10,
+        ok: true,
+        result: { ok: true },
+        ...opts,
+    };
+}
+describe("v2.19.27 PROBE · latencyScore", () => {
+    it("1.0 when within budget (100ms default)", () => {
+        expect(latencyScore(50)).toBe(1.0);
+        expect(latencyScore(100)).toBe(1.0);
+    });
+    it("exponential decay past budget (half at +200ms)", () => {
+        expect(latencyScore(300)).toBeCloseTo(0.5, 5);
+        expect(latencyScore(500)).toBeCloseTo(0.25, 5);
+    });
+    it("custom budget + half-life respected", () => {
+        expect(latencyScore(50, 30, 20)).toBeCloseTo(Math.pow(0.5, (50 - 30) / 20), 5);
+    });
+});
+describe("v2.19.27 PROBE · outputShapeEntropy", () => {
+    it("empty results -> 0", () => {
+        expect(outputShapeEntropy([])).toBe(0);
+    });
+    it("identical shapes -> 0 entropy (flat output)", () => {
+        expect(outputShapeEntropy([{ a: 1 }, { a: 2 }, { a: 3 }])).toBe(0);
+    });
+    it("diverse shapes -> high entropy", () => {
+        const ent = outputShapeEntropy([
+            { a: 1 }, { b: 1 }, [1, 2, 3], "string", 42, null,
+        ]);
+        expect(ent).toBeGreaterThan(0.5);
+    });
+    it("array length buckets distinguish small/med/large", () => {
+        const e = outputShapeEntropy([[], [1, 2], new Array(20).fill(0), new Array(200).fill(0)]);
+        expect(e).toBeGreaterThan(0.5);
+    });
+});
+describe("v2.19.27 PROBE · errorRate", () => {
+    it("zero runs -> 0", () => {
+        expect(errorRate([])).toBe(0);
+    });
+    it("all errors -> 1.0", () => {
+        expect(errorRate([run({ ok: false }), run({ ok: false })])).toBe(1.0);
+    });
+    it("half errors -> 0.5", () => {
+        expect(errorRate([run({ ok: true }), run({ ok: false })])).toBe(0.5);
+    });
+});
+describe("v2.19.27 PROBE · utilityScore", () => {
+    it("all useful results -> 1.0", () => {
+        expect(utilityScore([run({ result: { x: 1 } }), run({ result: "hello" })])).toBe(1.0);
+    });
+    it("empty / null / undefined treated as useless", () => {
+        expect(utilityScore([
+            run({ result: null }), run({ result: undefined }),
+            run({ result: "" }), run({ result: [] }), run({ result: {} }),
+        ])).toBe(0);
+    });
+    it("errored runs don't count as useful", () => {
+        expect(utilityScore([run({ ok: false }), run({ ok: true, result: { x: 1 } })])).toBe(0.5);
+    });
+});
+describe("v2.19.27 PROBE · aggregateFitness (geometric mean of 4 scores)", () => {
+    it("all perfect -> 1.0", () => {
+        expect(aggregateFitness({ latencyScore: 1, outputEntropy: 1, errorRate: 0, utilityScore: 1 })).toBeCloseTo(1, 5);
+    });
+    it("any zero (or near-zero) drags geometric mean toward floor", () => {
+        const f = aggregateFitness({ latencyScore: 1, outputEntropy: 1, errorRate: 1, utilityScore: 1 });
+        expect(f).toBeLessThan(0.1);
+    });
+    it("balanced mid -> ~0.5", () => {
+        const f = aggregateFitness({ latencyScore: 0.5, outputEntropy: 0.5, errorRate: 0.5, utilityScore: 0.5 });
+        expect(f).toBeCloseTo(0.5, 1);
+    });
+});
+describe("v2.19.27 PROBE · finaliseProbe (pure aggregator)", () => {
+    it("produces HMAC-signed report with all 4 metrics + fitness", () => {
+        const r = finaliseProbe({
+            toolName: "mneme.x",
+            runs: [run({ latencyMs: 50, result: { a: 1 } }), run({ latencyMs: 70, result: { b: 2 } })],
+            probedAt: 1_000_000,
+            secret: SECRET,
+        });
+        expect(r.metrics.latencyScore).toBe(1.0);
+        expect(r.metrics.errorRate).toBe(0);
+        expect(r.metrics.utilityScore).toBe(1.0);
+        expect(r.metrics.outputEntropy).toBeGreaterThan(0);
+        expect(verifyProbeReport(r, SECRET)).toBe(true);
+    });
+    it("counts synthetic + real inputs separately", () => {
+        const r = finaliseProbe({
+            toolName: "mneme.x",
+            runs: [
+                run({ inputSource: "synthetic" }), run({ inputSource: "synthetic" }),
+                run({ inputSource: "real" }),
+            ],
+            probedAt: 0,
+            secret: SECRET,
+        });
+        expect(r.syntheticInputs).toBe(2);
+        expect(r.realInputs).toBe(1);
+        expect(r.totalInputs).toBe(3);
+    });
+    it("verify rejects tampered fitness", () => {
+        const r = finaliseProbe({ toolName: "x", runs: [run()], probedAt: 0, secret: SECRET });
+        expect(verifyProbeReport({ ...r, metrics: { ...r.metrics, fitnessScore: 0.99 } }, SECRET)).toBe(false);
+    });
+    it("MEASURED 100% determinism: same input -> same sig (30 trials)", () => {
+        const input = {
+            toolName: "mneme.x",
+            runs: [run({ latencyMs: 50 }), run({ latencyMs: 70 })],
+            probedAt: 1_000_000,
+            secret: SECRET,
+        };
+        const firstSig = finaliseProbe(input).sig;
+        let allEqual = true;
+        for (let i = 0; i < 30; i++) {
+            if (finaliseProbe(input).sig !== firstSig) {
+                allEqual = false;
+                break;
+            }
+        }
+        expect(allEqual).toBe(true);
+    });
+});
+describe("v2.19.27 PROBE · runProbeBattery (real invoke)", () => {
+    it("invokes each input + measures latency + catches errors", async () => {
+        const inputs = [
+            { label: "axiom:1", source: "synthetic", args: { x: 1 } },
+            { label: "axiom:2", source: "synthetic", args: { x: 2 } },
+            { label: "real:1", source: "real", args: { x: 3 } },
+        ];
+        const invoke = async (_t, args) => ({ doubled: args["x"] * 2 });
+        const r = await runProbeBattery({ toolName: "mneme.double", inputs, invoke, secret: SECRET });
+        expect(r.runs.length).toBe(3);
+        expect(r.runs.every((x) => x.ok)).toBe(true);
+        expect(r.syntheticInputs).toBe(2);
+        expect(r.realInputs).toBe(1);
+        expect(r.metrics.errorRate).toBe(0);
+        expect(r.metrics.utilityScore).toBe(1);
+    });
+    it("captures errors with messages without crashing the battery", async () => {
+        const inputs = [{ label: "x", source: "synthetic", args: {} }];
+        const invoke = async () => { throw new Error("kaboom"); };
+        const r = await runProbeBattery({ toolName: "mneme.broken", inputs, invoke, secret: SECRET });
+        expect(r.runs[0].ok).toBe(false);
+        expect(r.runs[0].errorMessage).toBe("kaboom");
+        expect(r.metrics.errorRate).toBe(1);
+    });
+    it("slow tool incurs latency penalty", async () => {
+        const inputs = [{ label: "x", source: "synthetic", args: {} }];
+        const invoke = async () => {
+            await new Promise((res) => setTimeout(res, 250));
+            return "done";
+        };
+        const r = await runProbeBattery({ toolName: "mneme.slow", inputs, invoke, secret: SECRET });
+        expect(r.metrics.latencyScore).toBeLessThan(1);
+    });
+});
+describe("v2.19.27 PROBE · formatter", () => {
+    it("formatProbeLine includes all 4 metric percentages", () => {
+        const r = finaliseProbe({ toolName: "mneme.x", runs: [run()], probedAt: 0, secret: SECRET });
+        const line = formatProbeLine(r);
+        expect(line).toContain("PROBE mneme.x");
+        expect(line).toContain("fitness=");
+        expect(line).toContain("lat=");
+        expect(line).toContain("ent=");
+        expect(line).toContain("err=");
+        expect(line).toContain("util=");
+    });
+});
+//# sourceMappingURL=dreamspace_probe.test.js.map