@motebit/protocol 0.7.0 → 0.8.0

package/dist/__tests__/traversal.test.js

@@ -0,0 +1,331 @@
+import { describe, it, expect } from "vitest";
+import { WeightedDigraph } from "../index.js";
+import { TrustSemiring, CostSemiring, BooleanSemiring, productSemiring } from "../index.js";
+import { optimalPaths, optimalPath, transitiveClosure, optimalPathTrace } from "../index.js";
+describe("optimalPaths — TrustSemiring (max, ×)", () => {
+    it("finds most trusted chain through linear path", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.8);
+        g.setEdge("C", "D", 0.7);
+        const paths = optimalPaths(g, "A");
+        expect(paths.get("A")).toBe(1); // self = identity
+        expect(paths.get("B")).toBeCloseTo(0.9); // direct
+        expect(paths.get("C")).toBeCloseTo(0.72); // 0.9 × 0.8
+        expect(paths.get("D")).toBeCloseTo(0.504); // 0.9 × 0.8 × 0.7
+    });
+    it("picks best parallel path", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        // Direct: 0.5
+        g.setEdge("A", "C", 0.5);
+        // Via B: 0.9 × 0.8 = 0.72
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.8);
+        const paths = optimalPaths(g, "A");
+        expect(paths.get("C")).toBeCloseTo(0.72); // via B wins
+    });
+    it("zero trust blocks the chain", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.0); // blocked
+        g.setEdge("C", "D", 0.8);
+        const paths = optimalPaths(g, "A");
+        expect(paths.get("C")).toBe(0); // annihilated
+        expect(paths.get("D")).toBe(0); // can't reach through zero
+    });
+});
+describe("optimalPaths — CostSemiring (min, +)", () => {
+    it("finds cheapest path", () => {
+        const g = new WeightedDigraph(CostSemiring);
+        // Direct: $10
+        g.setEdge("A", "C", 10);
+        // Via B: $3 + $4 = $7
+        g.setEdge("A", "B", 3);
+        g.setEdge("B", "C", 4);
+        const paths = optimalPaths(g, "A");
+        expect(paths.get("C")).toBe(7); // via B is cheaper
+    });
+    it("unreachable nodes stay at infinity", () => {
+        const g = new WeightedDigraph(CostSemiring);
+        g.setEdge("A", "B", 5);
+        g.addNode("C"); // isolated
+        const paths = optimalPaths(g, "A");
+        expect(paths.get("C")).toBe(Infinity);
+    });
+});
+describe("optimalPaths — BooleanSemiring (∨, ∧)", () => {
+    it("determines reachability", () => {
+        const g = new WeightedDigraph(BooleanSemiring);
+        g.setEdge("A", "B", true);
+        g.setEdge("B", "C", true);
+        g.addNode("D"); // isolated
+        const paths = optimalPaths(g, "A");
+        expect(paths.get("B")).toBe(true);
+        expect(paths.get("C")).toBe(true);
+        expect(paths.get("D")).toBe(false);
+    });
+});
+describe("optimalPaths — Product(Trust × Cost)", () => {
+    it("computes multi-objective optimal simultaneously", () => {
+        const ps = productSemiring(TrustSemiring, CostSemiring);
+        const g = new WeightedDigraph(ps);
+        // Edge A→B: trust 0.9, cost $3
+        g.setEdge("A", "B", [0.9, 3]);
+        // Edge B→C: trust 0.8, cost $4
+        g.setEdge("B", "C", [0.8, 4]);
+        const paths = optimalPaths(g, "A");
+        const toC = paths.get("C");
+        expect(toC[0]).toBeCloseTo(0.72); // trust: 0.9 × 0.8
+        expect(toC[1]).toBe(7); // cost: 3 + 4
+    });
+});
+describe("optimalPath — convenience", () => {
+    it("returns single value between two nodes", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.8);
+        expect(optimalPath(g, "A", "C")).toBeCloseTo(0.72);
+    });
+    it("returns zero for unreachable target", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.addNode("C");
+        expect(optimalPath(g, "A", "C")).toBe(0);
+    });
+});
+describe("optimalPathTrace", () => {
+    it("returns path and value", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.8);
+        g.setEdge("A", "C", 0.5); // direct but worse
+        const result = optimalPathTrace(g, "A", "C");
+        expect(result).not.toBeNull();
+        expect(result.value).toBeCloseTo(0.72);
+        expect(result.path).toEqual(["A", "B", "C"]);
+    });
+    it("returns null for unreachable", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.addNode("C");
+        expect(optimalPathTrace(g, "A", "C")).toBeNull();
+    });
+});
+describe("transitiveClosure — TrustSemiring", () => {
+    it("computes all-pairs trust", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.8);
+        g.setEdge("A", "C", 0.5);
+        const closure = transitiveClosure(g);
+        // A→A: identity = 1
+        expect(closure.get("A").get("A")).toBe(1);
+        // A→B: direct 0.9
+        expect(closure.get("A").get("B")).toBeCloseTo(0.9);
+        // A→C: max(direct 0.5, via B 0.72) = 0.72
+        expect(closure.get("A").get("C")).toBeCloseTo(0.72);
+        // B→A: no path = 0
+        expect(closure.get("B").get("A")).toBe(0);
+        // B→C: direct 0.8
+        expect(closure.get("B").get("C")).toBeCloseTo(0.8);
+    });
+    it("handles cycles gracefully", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "A", 0.8);
+        const closure = transitiveClosure(g);
+        // A→A through cycle: max(1, 0.9 × 0.8 × ... ) = 1 (identity wins)
+        expect(closure.get("A").get("A")).toBe(1);
+        expect(closure.get("A").get("B")).toBeCloseTo(0.9);
+    });
+});
+describe("transitiveClosure — CostSemiring", () => {
+    it("computes all-pairs cheapest routes", () => {
+        const g = new WeightedDigraph(CostSemiring);
+        g.setEdge("A", "B", 3);
+        g.setEdge("B", "C", 4);
+        g.setEdge("A", "C", 10);
+        const closure = transitiveClosure(g);
+        // A→C: min(direct 10, via B 7) = 7
+        expect(closure.get("A").get("C")).toBe(7);
+    });
+});
+describe("early termination", () => {
+    it("converges quickly on already-optimal graphs", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        // Tree structure: no relaxation beyond first pass
+        g.setEdge("root", "a", 0.9);
+        g.setEdge("root", "b", 0.8);
+        g.setEdge("a", "c", 0.7);
+        g.setEdge("b", "d", 0.6);
+        const paths = optimalPaths(g, "root");
+        expect(paths.get("c")).toBeCloseTo(0.63); // 0.9 × 0.7
+        expect(paths.get("d")).toBeCloseTo(0.48); // 0.8 × 0.6
+    });
+});
+describe("optimalPath — missing target node", () => {
+    it("returns zero for a target not in the graph at all", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        // "Z" is not a node in the graph — hits the ?? graph.sr.zero fallback
+        expect(optimalPath(g, "A", "Z")).toBe(0);
+    });
+});
+describe("optimalPathTrace — edge cases", () => {
+    it("returns identity for source === target (self-loop)", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.addNode("A");
+        const result = optimalPathTrace(g, "A", "A");
+        expect(result).not.toBeNull();
+        expect(result.value).toBe(1); // semiring one
+        expect(result.path).toEqual(["A"]);
+    });
+    it("returns null when target value is zero (line 177-178 branch)", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.addNode("C"); // isolated — dist stays at zero
+        const result = optimalPathTrace(g, "A", "C");
+        expect(result).toBeNull();
+    });
+    it("returns null when path reconstruction does not start at source (line 190 branch)", () => {
+        // This tests the path[0] !== source guard.
+        // In a disconnected graph where pred never gets set for the target,
+        // the path reconstruction will produce just [target] with no predecessor.
+        const g = new WeightedDigraph(CostSemiring);
+        g.addNode("A");
+        g.addNode("B");
+        // B has dist = Infinity (CostSemiring.zero), A has dist = 0 (CostSemiring.one)
+        // For CostSemiring, zero is Infinity — so the value === sr.zero check on line 178
+        // will catch this. Let's test a scenario that exercises line 190 differently.
+        const result = optimalPathTrace(g, "A", "B");
+        expect(result).toBeNull();
+    });
+});
+describe("WeightedDigraph — query methods", () => {
+    it("nodes() returns all added nodes", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.addNode("A");
+        g.addNode("B");
+        g.addNode("C");
+        const nodes = g.nodes();
+        expect(nodes.size).toBe(3);
+        expect(nodes.has("A")).toBe(true);
+        expect(nodes.has("B")).toBe(true);
+        expect(nodes.has("C")).toBe(true);
+    });
+    it("nodeCount() returns correct count", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        expect(g.nodeCount()).toBe(0);
+        g.addNode("A");
+        expect(g.nodeCount()).toBe(1);
+        g.addNode("B");
+        expect(g.nodeCount()).toBe(2);
+    });
+    it("neighbors() returns outgoing edges", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("A", "C", 0.7);
+        const neighbors = g.neighbors("A");
+        expect(neighbors.size).toBe(2);
+        expect(neighbors.get("B")).toBe(0.9);
+        expect(neighbors.get("C")).toBe(0.7);
+    });
+    it("neighbors() returns empty map for unknown node", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        const neighbors = g.neighbors("nonexistent");
+        expect(neighbors.size).toBe(0);
+    });
+    it("edges() returns all edges in the graph", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.8);
+        g.setEdge("A", "C", 0.5);
+        const edges = g.edges();
+        expect(edges.length).toBe(3);
+        expect(edges).toEqual(expect.arrayContaining([
+            { from: "A", to: "B", weight: 0.9 },
+            { from: "B", to: "C", weight: 0.8 },
+            { from: "A", to: "C", weight: 0.5 },
+        ]));
+    });
+    it("edgeCount() returns total number of edges", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        expect(g.edgeCount()).toBe(0);
+        g.setEdge("A", "B", 0.9);
+        expect(g.edgeCount()).toBe(1);
+        g.setEdge("B", "C", 0.8);
+        expect(g.edgeCount()).toBe(2);
+        g.setEdge("A", "C", 0.5);
+        expect(g.edgeCount()).toBe(3);
+    });
+    it("addEdge merges parallel edges via semiring add", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        // First edge: trust 0.5
+        g.addEdge("A", "B", 0.5);
+        expect(g.getEdge("A", "B")).toBe(0.5);
+        // Second addEdge: trust 0.8 — should ⊕-combine via max(0.5, 0.8) = 0.8
+        g.addEdge("A", "B", 0.8);
+        expect(g.getEdge("A", "B")).toBe(0.8);
+    });
+    it("addEdge with CostSemiring merges via min", () => {
+        const g = new WeightedDigraph(CostSemiring);
+        g.addEdge("A", "B", 10);
+        expect(g.getEdge("A", "B")).toBe(10);
+        // Second addEdge: cost 5 — should ⊕-combine via min(10, 5) = 5
+        g.addEdge("A", "B", 5);
+        expect(g.getEdge("A", "B")).toBe(5);
+    });
+    it("removeEdge removes an edge", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        expect(g.hasEdge("A", "B")).toBe(true);
+        g.removeEdge("A", "B");
+        expect(g.hasEdge("A", "B")).toBe(false);
+    });
+    it("removeEdge is safe for non-existent edge", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        // Should not throw
+        g.removeEdge("A", "B");
+    });
+    it("removeNode removes node and all its edges", () => {
+        const g = new WeightedDigraph(TrustSemiring);
+        g.setEdge("A", "B", 0.9);
+        g.setEdge("B", "C", 0.8);
+        g.setEdge("C", "B", 0.7);
+        g.removeNode("B");
+        expect(g.hasNode("B")).toBe(false);
+        expect(g.hasEdge("A", "B")).toBe(false);
+        expect(g.hasEdge("B", "C")).toBe(false);
+        expect(g.hasEdge("C", "B")).toBe(false);
+        expect(g.hasNode("A")).toBe(true);
+        expect(g.hasNode("C")).toBe(true);
+    });
+});
+// ── Compound semiring convergence (exercises sr.eq) ─────────────────
+describe("optimalPaths with compound semiring (product)", () => {
+    it("converges correctly using value equality", () => {
+        const TC = productSemiring(TrustSemiring, CostSemiring);
+        const g = new WeightedDigraph(TC);
+        g.setEdge("A", "B", [0.9, 5]);
+        g.setEdge("B", "C", [0.8, 3]);
+        g.setEdge("A", "C", [0.5, 2]);
+        const paths = optimalPaths(g, "A");
+        const toC = paths.get("C");
+        // Trust: max(0.9*0.8, 0.5) = max(0.72, 0.5) = 0.72
+        expect(toC[0]).toBeCloseTo(0.72);
+        // Cost: min(5+3, 2) = 2
+        expect(toC[1]).toBe(2);
+    });
+    it("optimalPathTrace works with compound semiring", () => {
+        const TC = productSemiring(TrustSemiring, CostSemiring);
+        const g = new WeightedDigraph(TC);
+        g.setEdge("A", "B", [0.9, 5]);
+        g.setEdge("B", "C", [0.8, 3]);
+        const trace = optimalPathTrace(g, "A", "C");
+        expect(trace).not.toBeNull();
+        expect(trace.path).toEqual(["A", "B", "C"]);
+        expect(trace.value[0]).toBeCloseTo(0.72);
+        expect(trace.value[1]).toBe(8);
+    });
+});
+//# sourceMappingURL=traversal.test.js.map

package/dist/__tests__/traversal.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.test.js","sourceRoot":"","sources":["../../src/__tests__/traversal.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC5F,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE7F,QAAQ,CAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB;QAClD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;QAClD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY;QACtD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,kBAAkB;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,cAAc;QACd,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,0BAA0B;QAC1B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,UAAU;QACpC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;QAC9C,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,2BAA2B;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC;QAC5C,cAAc;QACd,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACxB,sBAAsB;QACtB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB;IACrD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC;QAC5C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW;QAE3B,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,eAAe,CAAC,CAAC;QAC/C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW;QAE3B,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,EAAE,GAAG,eAAe,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QACxD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,CAAC;QAElC,+BAA+B;QAC/B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QACvC,+BAA+B;QAC/B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QAEvC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,mBAAmB;QACrD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEf,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,mBAAmB;QAE7C,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,MAAO,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEf,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAErC,oBAAoB;QACpB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,kBAAkB;QAClB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACpD,0CAA0C;QAC1C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrD,mBAAmB;QACnB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,kBAAkB;QAClB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACrC,kEAAkE;QAClE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC;QAC5C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QAExB,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACrC,mCAAmC;QACnC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,kDAAkD;QAClD,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACtC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY;QACtD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY;IACxD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,sEAAsE;QACtE,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEf,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,MAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe;QAC9C,MAAM,CAAC,MAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,gCAAgC;QAEhD,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC1F,2CAA2C;QAC3C,oEAAoE;QACpE,0EAA0E;QAC1E,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC;QAC5C,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEf,+EAA+E;QAC/E,kFAAkF;QAClF,8EAA8E;QAC9E,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEf,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QAC7C,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CACnB,MAAM,CAAC,eAAe,CAAC;YACrB,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;YACnC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;YACnC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;SACpC,CAAC,CACH,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,wBAAwB;QACxB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEtC,uEAAuE;QACvE,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC;QAC5C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACxB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAErC,+DAA+D;QAC/D,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEvC,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,mBAAmB;QACnB,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;QAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAEzB,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAClB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,uEAAuE;AAEvE,QAAQ,CAAC,+CAA+C,EAAE,GAAG,EAAE;IAC7D,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,EAAE,GAAG,eAAe,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QACxD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QACvC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QACvC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QAEvC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC5B,mDAAmD;QACnD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACjC,wBAAwB;QACxB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,GAAG,eAAe,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QACxD,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QACvC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QAEvC,MAAM,KAAK,GAAG,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,MAAM,CAAC,KAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,KAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/__tests__/trust-algebra.test.d.ts

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

package/dist/__tests__/trust-algebra.test.d.ts.map

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

package/dist/__tests__/trust-algebra.test.js

@@ -0,0 +1,105 @@
+/**
+ * Trust algebra tests — MIT protocol functions only.
+ * BSL functions (composeDelegationTrust, evaluateTrustTransition) are tested in @motebit/semiring.
+ */
+import { describe, it, expect } from "vitest";
+import { AgentTrustLevel, TRUST_LEVEL_SCORES, trustLevelToScore, TRUST_ZERO, TRUST_ONE, trustAdd, trustMultiply, composeTrustChain, joinParallelRoutes, DEFAULT_TRUST_THRESHOLDS, } from "../index.js";
+describe("Trust Semiring Algebra", () => {
+    // ── Semiring laws ──
+    describe("semiring laws", () => {
+        const values = [0, 0.1, 0.3, 0.6, 0.9, 1];
+        it("⊕ is associative: max(a, max(b, c)) = max(max(a, b), c)", () => {
+            for (const a of values)
+                for (const b of values)
+                    for (const c of values)
+                        expect(trustAdd(a, trustAdd(b, c))).toBe(trustAdd(trustAdd(a, b), c));
+        });
+        it("⊗ is associative: (a × b) × c = a × (b × c)", () => {
+            for (const a of values)
+                for (const b of values)
+                    for (const c of values)
+                        expect(trustMultiply(trustMultiply(a, b), c)).toBeCloseTo(trustMultiply(a, trustMultiply(b, c)));
+        });
+        it("⊕ is commutative: max(a, b) = max(b, a)", () => {
+            for (const a of values)
+                for (const b of values)
+                    expect(trustAdd(a, b)).toBe(trustAdd(b, a));
+        });
+        it("⊗ distributes over ⊕: a × max(b, c) = max(a × b, a × c)", () => {
+            for (const a of values)
+                for (const b of values)
+                    for (const c of values)
+                        expect(trustMultiply(a, trustAdd(b, c))).toBeCloseTo(trustAdd(trustMultiply(a, b), trustMultiply(a, c)));
+        });
+    });
+    // ── Identity elements ──
+    describe("identity elements", () => {
+        it("1 ⊗ x = x (multiplicative identity)", () => {
+            expect(trustMultiply(TRUST_ONE, 0.6)).toBe(0.6);
+            expect(trustMultiply(0.6, TRUST_ONE)).toBe(0.6);
+        });
+        it("0 ⊕ x = x (additive identity)", () => {
+            expect(trustAdd(TRUST_ZERO, 0.6)).toBe(0.6);
+            expect(trustAdd(0.6, TRUST_ZERO)).toBe(0.6);
+        });
+    });
+    // ── Annihilator ──
+    describe("annihilator", () => {
+        it("0 ⊗ x = 0 (Blocked agent kills the chain)", () => {
+            expect(trustMultiply(TRUST_ZERO, 0.9)).toBe(0);
+            expect(trustMultiply(0.9, TRUST_ZERO)).toBe(0);
+        });
+    });
+    // ── trustLevelToScore ──
+    describe("trustLevelToScore", () => {
+        it("maps all 5 levels correctly", () => {
+            expect(trustLevelToScore(AgentTrustLevel.Unknown)).toBe(0.1);
+            expect(trustLevelToScore(AgentTrustLevel.FirstContact)).toBe(0.3);
+            expect(trustLevelToScore(AgentTrustLevel.Verified)).toBe(0.6);
+            expect(trustLevelToScore(AgentTrustLevel.Trusted)).toBe(0.9);
+            expect(trustLevelToScore(AgentTrustLevel.Blocked)).toBe(0.0);
+        });
+        it("returns 0.1 for unknown strings", () => {
+            expect(trustLevelToScore("nonexistent")).toBe(0.1);
+        });
+        it("TRUST_LEVEL_SCORES has all 5 entries", () => {
+            expect(Object.keys(TRUST_LEVEL_SCORES)).toHaveLength(5);
+        });
+    });
+    // ── composeTrustChain ──
+    describe("composeTrustChain", () => {
+        it("[0.9, 0.6] → 0.54", () => {
+            expect(composeTrustChain([0.9, 0.6])).toBeCloseTo(0.54);
+        });
+        it("empty → 1.0 (multiplicative identity)", () => {
+            expect(composeTrustChain([])).toBe(1.0);
+        });
+        it("single element returns itself", () => {
+            expect(composeTrustChain([0.3])).toBeCloseTo(0.3);
+        });
+        it("chain with 0 → 0 (Blocked kills chain)", () => {
+            expect(composeTrustChain([0.9, 0.0, 0.6])).toBe(0);
+        });
+    });
+    // ── joinParallelRoutes ──
+    describe("joinParallelRoutes", () => {
+        it("[0.3, 0.6, 0.1] → 0.6", () => {
+            expect(joinParallelRoutes([0.3, 0.6, 0.1])).toBe(0.6);
+        });
+        it("empty → 0.0 (additive identity)", () => {
+            expect(joinParallelRoutes([])).toBe(0.0);
+        });
+        it("single element returns itself", () => {
+            expect(joinParallelRoutes([0.3])).toBe(0.3);
+        });
+    });
+    // ── DEFAULT_TRUST_THRESHOLDS ──
+    describe("DEFAULT_TRUST_THRESHOLDS", () => {
+        it("exists and has expected shape", () => {
+            expect(DEFAULT_TRUST_THRESHOLDS).toBeDefined();
+            expect(typeof DEFAULT_TRUST_THRESHOLDS.promoteToVerified_minTasks).toBe("number");
+            expect(typeof DEFAULT_TRUST_THRESHOLDS.promoteToTrusted_minRate).toBe("number");
+        });
+    });
+});
+//# sourceMappingURL=trust-algebra.test.js.map

package/dist/__tests__/trust-algebra.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trust-algebra.test.js","sourceRoot":"","sources":["../../src/__tests__/trust-algebra.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EACL,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,UAAU,EACV,SAAS,EACT,QAAQ,EACR,aAAa,EACb,iBAAiB,EACjB,kBAAkB,EAClB,wBAAwB,GACzB,MAAM,aAAa,CAAC;AAErB,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,sBAAsB;IAEtB,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAE1C,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YACjE,KAAK,MAAM,CAAC,IAAI,MAAM;gBACpB,KAAK,MAAM,CAAC,IAAI,MAAM;oBACpB,KAAK,MAAM,CAAC,IAAI,MAAM;wBACpB,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACrD,KAAK,MAAM,CAAC,IAAI,MAAM;gBACpB,KAAK,MAAM,CAAC,IAAI,MAAM;oBACpB,KAAK,MAAM,CAAC,IAAI,MAAM;wBACpB,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CACvD,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CACtC,CAAC;QACV,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YACjD,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,KAAK,MAAM,CAAC,IAAI,MAAM;oBAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YACjE,KAAK,MAAM,CAAC,IAAI,MAAM;gBACpB,KAAK,MAAM,CAAC,IAAI,MAAM;oBACpB,KAAK,MAAM,CAAC,IAAI,MAAM;wBACpB,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAClD,QAAQ,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CACnD,CAAC;QACV,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,0BAA0B;IAE1B,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC7C,MAAM,CAAC,aAAa,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChD,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5C,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,oBAAoB;IAEpB,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACnD,MAAM,CAAC,aAAa,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,0BAA0B;IAE1B,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACrC,MAAM,CAAC,iBAAiB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7D,MAAM,CAAC,iBAAiB,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClE,MAAM,CAAC,iBAAiB,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9D,MAAM,CAAC,iBAAiB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7D,MAAM,CAAC,iBAAiB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC9C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,0BAA0B;IAE1B,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC3B,MAAM,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC/C,MAAM,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,MAAM,CAAC,iBAAiB,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,2BAA2B;IAE3B,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAC/B,MAAM,CAAC,kBAAkB,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,iCAAiC;IAEjC,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACxC,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,wBAAwB,CAAC,CAAC,WAAW,EAAE,CAAC;YAC/C,MAAM,CAAC,OAAO,wBAAwB,CAAC,0BAA0B,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,CAAC,OAAO,wBAAwB,CAAC,wBAAwB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/credential-anchor.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Credential anchor types — motebit/credential-anchor@1.0.
+ *
+ * MIT: these types define the interoperable format for credential anchoring.
+ * Any implementation can produce and verify anchor proofs using these types.
+ */
+/** A batch of credential hashes anchored as a Merkle tree. */
+export interface CredentialAnchorBatch {
+    /** UUID v4 batch identifier. */
+    batch_id: string;
+    /** MotebitId of the relay that created this batch. */
+    relay_id: string;
+    /** Hex-encoded SHA-256 Merkle root. */
+    merkle_root: string;
+    /** Number of credentials in this batch. */
+    leaf_count: number;
+    /** Millisecond timestamp of the earliest credential in the batch. */
+    first_issued_at: number;
+    /** Millisecond timestamp of the latest credential in the batch. */
+    last_issued_at: number;
+    /** Hex-encoded Ed25519 signature over the canonical batch payload. */
+    signature: string;
+    /** Onchain anchor metadata, or null if signed but not yet submitted. */
+    anchor: CredentialChainAnchor | null;
+}
+/** Onchain anchor reference — chain-agnostic. */
+export interface CredentialChainAnchor {
+    /** Chain identifier (e.g., "solana"). */
+    chain: string;
+    /** CAIP-2 network identifier (e.g., "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"). */
+    network: string;
+    /** Transaction hash on the target chain. */
+    tx_hash: string;
+    /** Millisecond timestamp when the anchor was confirmed. */
+    anchored_at: number;
+}
+/** Self-verifiable Merkle inclusion proof for a credential in an anchored batch. */
+export interface CredentialAnchorProof {
+    /** Credential identifier. */
+    credential_id: string;
+    /** Hex-encoded SHA-256 hash of the full credential (including proof). */
+    credential_hash: string;
+    /** Batch containing this credential. */
+    batch_id: string;
+    /** Hex-encoded Merkle root of the batch. */
+    merkle_root: string;
+    /** Number of credentials in this batch (needed for signature verification). */
+    leaf_count: number;
+    /** Millisecond timestamp of the earliest credential in the batch. */
+    first_issued_at: number;
+    /** Millisecond timestamp of the latest credential in the batch. */
+    last_issued_at: number;
+    /** Position of this credential's leaf in the sorted array. */
+    leaf_index: number;
+    /** Hex-encoded sibling hashes for Merkle path verification. */
+    siblings: string[];
+    /** Layer sizes for odd-leaf promotion detection. */
+    layer_sizes: number[];
+    /** MotebitId of the relay that created the batch. */
+    relay_id: string;
+    /** Hex-encoded Ed25519 public key of the relay (for signature verification). */
+    relay_public_key: string;
+    /** Hex-encoded Ed25519 signature over the canonical batch payload. */
+    batch_signature: string;
+    /** Onchain anchor metadata, or null if not yet submitted. */
+    anchor: CredentialChainAnchor | null;
+}
+/**
+ * Chain-agnostic interface for submitting Merkle roots onchain.
+ *
+ * The relay defines what it needs (publish a root). Implementations
+ * satisfy it for specific chains (Solana Memo, EVM calldata, etc.).
+ */
+export interface ChainAnchorSubmitter {
+    /** Chain identifier (e.g., "solana", "eip155"). */
+    readonly chain: string;
+    /** CAIP-2 network identifier. */
+    readonly network: string;
+    /** Submit a Merkle root onchain. Returns the transaction hash. */
+    submitMerkleRoot(root: string, relayId: string, leafCount: number): Promise<{
+        txHash: string;
+    }>;
+    /** Whether the submitter is currently available (chain reachable, funded). */
+    isAvailable(): Promise<boolean>;
+}
+//# sourceMappingURL=credential-anchor.d.ts.map

package/dist/credential-anchor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"credential-anchor.d.ts","sourceRoot":"","sources":["../src/credential-anchor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,8DAA8D;AAC9D,MAAM,WAAW,qBAAqB;IACpC,gCAAgC;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,sDAAsD;IACtD,QAAQ,EAAE,MAAM,CAAC;IACjB,uCAAuC;IACvC,WAAW,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,UAAU,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,eAAe,EAAE,MAAM,CAAC;IACxB,mEAAmE;IACnE,cAAc,EAAE,MAAM,CAAC;IACvB,sEAAsE;IACtE,SAAS,EAAE,MAAM,CAAC;IAClB,wEAAwE;IACxE,MAAM,EAAE,qBAAqB,GAAG,IAAI,CAAC;CACtC;AAED,iDAAiD;AACjD,MAAM,WAAW,qBAAqB;IACpC,yCAAyC;IACzC,KAAK,EAAE,MAAM,CAAC;IACd,mFAAmF;IACnF,OAAO,EAAE,MAAM,CAAC;IAChB,4CAA4C;IAC5C,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,WAAW,EAAE,MAAM,CAAC;CACrB;AAID,oFAAoF;AACpF,MAAM,WAAW,qBAAqB;IACpC,6BAA6B;IAC7B,aAAa,EAAE,MAAM,CAAC;IACtB,yEAAyE;IACzE,eAAe,EAAE,MAAM,CAAC;IACxB,wCAAwC;IACxC,QAAQ,EAAE,MAAM,CAAC;IACjB,4CAA4C;IAC5C,WAAW,EAAE,MAAM,CAAC;IACpB,+EAA+E;IAC/E,UAAU,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,eAAe,EAAE,MAAM,CAAC;IACxB,mEAAmE;IACnE,cAAc,EAAE,MAAM,CAAC;IACvB,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;IACnB,+DAA+D;IAC/D,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,oDAAoD;IACpD,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,qDAAqD;IACrD,QAAQ,EAAE,MAAM,CAAC;IACjB,gFAAgF;IAChF,gBAAgB,EAAE,MAAM,CAAC;IACzB,sEAAsE;IACtE,eAAe,EAAE,MAAM,CAAC;IACxB,6DAA6D;IAC7D,MAAM,EAAE,qBAAqB,GAAG,IAAI,CAAC;CACtC;AAID;;;;;GAKG;AACH,MAAM,WAAW,oBAAoB;IACnC,mDAAmD;IACnD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,iCAAiC;IACjC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,kEAAkE;IAClE,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAChG,8EAA8E;IAC9E,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;CACjC"}

package/dist/credential-anchor.js

@@ -0,0 +1,8 @@
+/**
+ * Credential anchor types — motebit/credential-anchor@1.0.
+ *
+ * MIT: these types define the interoperable format for credential anchoring.
+ * Any implementation can produce and verify anchor proofs using these types.
+ */
+export {};
+//# sourceMappingURL=credential-anchor.js.map

package/dist/credential-anchor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"credential-anchor.js","sourceRoot":"","sources":["../src/credential-anchor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/graph.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Weighted directed graph parameterized by a semiring.
+ *
+ * The graph represents the agent network. Nodes are motebits.
+ * Edges carry semiring-valued weights (trust, cost, latency, or products thereof).
+ *
+ * Key insight: the same graph structure supports different queries by
+ * swapping the semiring used in traversal. The graph stores raw edge data;
+ * the semiring determines how to compose and compare paths.
+ */
+import type { Semiring } from "./semiring.js";
+export interface Edge<T> {
+    readonly from: string;
+    readonly to: string;
+    readonly weight: T;
+}
+/**
+ * Immutable-ish weighted digraph. Nodes are string IDs (motebit_id).
+ * Edges are stored adjacency-list style for efficient traversal.
+ */
+export declare class WeightedDigraph<T> {
+    private readonly semiring;
+    private readonly _adj;
+    private readonly _nodes;
+    constructor(semiring: Semiring<T>);
+    /** The semiring this graph operates over. */
+    get sr(): Semiring<T>;
+    addNode(id: string): void;
+    /**
+     * Set an edge weight. If the edge already exists, the new weight
+     * is ⊕-combined with the existing weight (parallel edges merge).
+     */
+    addEdge(from: string, to: string, weight: T): void;
+    /** Set an edge weight, replacing any existing weight. */
+    setEdge(from: string, to: string, weight: T): void;
+    removeEdge(from: string, to: string): void;
+    removeNode(id: string): void;
+    hasNode(id: string): boolean;
+    hasEdge(from: string, to: string): boolean;
+    /** Get edge weight, or semiring zero if no edge exists. */
+    getEdge(from: string, to: string): T;
+    nodes(): ReadonlySet<string>;
+    nodeCount(): number;
+    /** Outgoing edges from a node. */
+    neighbors(id: string): ReadonlyMap<string, T>;
+    /** All edges in the graph. */
+    edges(): Edge<T>[];
+    edgeCount(): number;
+}
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAE9C,MAAM,WAAW,IAAI,CAAC,CAAC;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;CACpB;AAED;;;GAGG;AACH,qBAAa,eAAe,CAAC,CAAC;IAIhB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAHrC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAqC;IAC1D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqB;gBAEf,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IAElD,6CAA6C;IAC7C,IAAI,EAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,CAEpB;IAED,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAKzB;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI;IAQlD,yDAAyD;IACzD,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI;IAMlD,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI;IAI1C,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAQ5B,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAI1C,2DAA2D;IAC3D,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,CAAC;IAIpC,KAAK,IAAI,WAAW,CAAC,MAAM,CAAC;IAI5B,SAAS,IAAI,MAAM;IAInB,kCAAkC;IAClC,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;IAI7C,8BAA8B;IAC9B,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE;IAUlB,SAAS,IAAI,MAAM;CAKpB"}