@nookplot/runtime 0.5.139 → 0.5.141

package/dist/__tests__/surplusInference.test.js

@@ -0,0 +1,346 @@
+/**
+ * Unit coverage for the Surplus Intelligence x402 inference provider.
+ *
+ * These tests exercise the module's OWN logic — the spend-control selector
+ * (cap / asset / payTo), OpenAI body mapping, response + settlement parsing,
+ * the mandatory keyless gate, and error handling — with an injected
+ * `paymentFetch` (no real x402 handshake, no funds). The real on-chain
+ * settlement is the paid round-trip exit gate (see the roadmap), not a unit.
+ */
+import { describe, it, expect, vi } from "vitest";
+import { mkdtempSync, readFileSync, writeFileSync, rmSync } from "node:fs";
+import { tmpdir } from "node:os";
+import { join } from "node:path";
+import { surplusInference, makeSurplusSelector, buildSurplusBody, parseSurplusResponse, usdcToBaseUnits, resolveSurplusPayTo, createSurplusSpendTracker, SurplusError, SURPLUS_URL, SURPLUS_PAYTO, BASE_USDC, DEFAULT_MAX_USDC_PER_SESSION, } from "../inference/surplusInference.js";
+const DAY_MS = 24 * 60 * 60 * 1000;
+const TEST_PK = "0x" + "ab".repeat(32);
+function req(over = {}) {
+    return {
+        scheme: "exact",
+        network: "eip155:8453",
+        asset: BASE_USDC,
+        payTo: "0x8581784D3E598cCa3482375CFF2409Ac9DD8c402",
+        amount: "3306",
+        ...over,
+    };
+}
+/** A Response with an OpenAI-compatible chat-completions body. */
+function openAIResponse(body, init) {
+    const headers = { "Content-Type": "application/json" };
+    if (init?.settleHeader)
+        headers["X-PAYMENT-RESPONSE"] = init.settleHeader;
+    return new Response(JSON.stringify(body), { status: init?.status ?? 200, headers });
+}
+const OK_BODY = {
+    choices: [{ message: { role: "assistant", content: "hello from surplus" } }],
+    model: "llama-3.3-70b",
+    usage: { prompt_tokens: 12, completion_tokens: 7, total_tokens: 19 },
+};
+// ─────────────────────────────────────────────────────────────────────────
+describe("usdcToBaseUnits", () => {
+    it("converts human USDC to 6-decimal atomic units", () => {
+        expect(usdcToBaseUnits(1)).toBe(1000000n);
+        expect(usdcToBaseUnits(0.003306)).toBe(3306n);
+        expect(usdcToBaseUnits(0.1)).toBe(100000n);
+    });
+    it("rejects negative / non-finite caps", () => {
+        expect(() => usdcToBaseUnits(-1)).toThrow(SurplusError);
+        expect(() => usdcToBaseUnits(Number.NaN)).toThrow(SurplusError);
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("makeSurplusSelector — spend controls", () => {
+    const cap = usdcToBaseUnits(1); // $1.00 = 1_000_000 base units
+    it("returns a valid in-cap exact/USDC quote", () => {
+        const sel = makeSurplusSelector({ maxBaseUnits: cap });
+        expect(sel(2, [req()])).toMatchObject({ amount: "3306" });
+    });
+    it("picks the cheapest of multiple eligible quotes", () => {
+        const sel = makeSurplusSelector({ maxBaseUnits: cap });
+        const chosen = sel(2, [req({ amount: "9000" }), req({ amount: "3306" }), req({ amount: "5000" })]);
+        expect(chosen.amount).toBe("3306");
+    });
+    it("rejects a quote that exceeds the per-call cap", () => {
+        const sel = makeSurplusSelector({ maxBaseUnits: cap });
+        expect(() => sel(2, [req({ amount: "2000000" })])).toThrow(/exceeds the per-call cap/);
+        try {
+            sel(2, [req({ amount: "2000000" })]);
+        }
+        catch (e) {
+            expect(e.code).toBe("over_cap");
+        }
+    });
+    it("rejects when no exact/Base/USDC quote is on offer (wrong asset)", () => {
+        const sel = makeSurplusSelector({ maxBaseUnits: cap });
+        expect(() => sel(2, [req({ asset: "0xdeadbeef00000000000000000000000000000000" })])).toThrow(/no `exact` USDC payment option/);
+    });
+    it("rejects a non-exact scheme (e.g. upto) and a non-Base network", () => {
+        const sel = makeSurplusSelector({ maxBaseUnits: cap });
+        expect(() => sel(2, [req({ scheme: "upto" })])).toThrow(SurplusError);
+        expect(() => sel(2, [req({ network: "eip155:1" })])).toThrow(SurplusError);
+    });
+    it("asserts payTo only when configured", () => {
+        const pinned = makeSurplusSelector({ maxBaseUnits: cap, payTo: "0x1111111111111111111111111111111111111111" });
+        expect(() => pinned(2, [req()])).toThrow(/payTo .* does not match/);
+        const matching = makeSurplusSelector({ maxBaseUnits: cap, payTo: req().payTo });
+        expect(matching(2, [req()])).toMatchObject({ amount: "3306" });
+        // Unset payTo → recipient is not asserted.
+        const open = makeSurplusSelector({ maxBaseUnits: cap });
+        expect(open(2, [req({ payTo: "0x2222222222222222222222222222222222222222" })])).toBeTruthy();
+    });
+    it("reads the v1 `maxAmountRequired` field when `amount` is absent", () => {
+        const sel = makeSurplusSelector({ maxBaseUnits: cap });
+        const chosen = sel(2, [{ scheme: "exact", network: "eip155:8453", asset: BASE_USDC, payTo: req().payTo, maxAmountRequired: "4000" }]);
+        expect(chosen.maxAmountRequired).toBe("4000");
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("makeSurplusSelector — per-session cap", () => {
+    const cap = usdcToBaseUnits(1);
+    it("accumulates authorized spend across calls and rejects once the session cap is exceeded", () => {
+        const tracker = createSurplusSpendTracker();
+        const sessionCap = usdcToBaseUnits(0.01); // 10_000 base units; quotes are 3306 each
+        const sel = makeSurplusSelector({ maxBaseUnits: cap, tracker, maxSessionBaseUnits: sessionCap });
+        sel(2, [req()]); // 3306
+        sel(2, [req()]); // 6612
+        sel(2, [req()]); // 9918 ≤ 10000 → ok
+        expect(tracker.spentBaseUnits).toBe(9918n);
+        // 4th would be 13224 > 10000 → reject with the typed code, and NOT counted.
+        expect(() => sel(2, [req()])).toThrow(/per-session cap/);
+        try {
+            sel(2, [req()]);
+        }
+        catch (e) {
+            expect(e.code).toBe("over_session_cap");
+        }
+        expect(tracker.spentBaseUnits).toBe(9918n);
+    });
+    it("does not track when no tracker / session cap is configured", () => {
+        const tracker = createSurplusSpendTracker();
+        const sel = makeSurplusSelector({ maxBaseUnits: cap, tracker }); // no maxSessionBaseUnits
+        sel(2, [req()]);
+        expect(tracker.spentBaseUnits).toBe(0n);
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("DEFAULT_MAX_USDC_PER_SESSION — default-on backstop", () => {
+    it("is a $10 backstop the selector enforces at the boundary", () => {
+        expect(DEFAULT_MAX_USDC_PER_SESSION).toBe(10);
+        const tracker = createSurplusSpendTracker();
+        const sel = makeSurplusSelector({
+            maxBaseUnits: usdcToBaseUnits(5), // per-call high enough to let $4 quotes through
+            tracker,
+            maxSessionBaseUnits: usdcToBaseUnits(DEFAULT_MAX_USDC_PER_SESSION),
+        });
+        const four = req({ amount: usdcToBaseUnits(4).toString() });
+        sel(2, [four]); // $4
+        sel(2, [four]); // $8 ≤ $10
+        expect(() => sel(2, [four])).toThrow(/per-session cap/); // $12 > $10
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("makeSurplusSelector — rolling 24h window", () => {
+    const cap = usdcToBaseUnits(1);
+    it("resets the accumulator once the window has elapsed (per-day budget, not lifetime)", () => {
+        const tracker = createSurplusSpendTracker();
+        const sessionCap = usdcToBaseUnits(0.005); // 5000 units; one 3306 quote fits, two don't
+        const sel = makeSurplusSelector({ maxBaseUnits: cap, tracker, maxSessionBaseUnits: sessionCap });
+        sel(2, [req()]); // 3306 ≤ 5000
+        expect(() => sel(2, [req()])).toThrow(/per-session cap/); // 6612 > 5000
+        // Backdate the window past 24h → the next call rolls it over and succeeds.
+        tracker.windowStartMs = Date.now() - (DAY_MS + 1000);
+        const chosen = sel(2, [req()]);
+        expect(chosen.amount).toBe("3306");
+        expect(tracker.spentBaseUnits).toBe(3306n); // reset, then this one call
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("createSurplusSpendTracker — disk persistence", () => {
+    const cap = usdcToBaseUnits(1);
+    const sessionCap = usdcToBaseUnits(1);
+    it("persists authorized spend and resumes it across a restart (cap is not re-armed)", () => {
+        const dir = mkdtempSync(join(tmpdir(), "surplus-spend-"));
+        const path = join(dir, "spend.json");
+        try {
+            const t1 = createSurplusSpendTracker(path);
+            const sel1 = makeSurplusSelector({ maxBaseUnits: cap, tracker: t1, maxSessionBaseUnits: sessionCap });
+            sel1(2, [req()]); // 3306, persisted
+            expect(t1.spentBaseUnits).toBe(3306n);
+            expect(JSON.parse(readFileSync(path, "utf8")).spentBaseUnits).toBe("3306");
+            // A fresh tracker from the same path resumes the running total.
+            const t2 = createSurplusSpendTracker(path);
+            expect(t2.spentBaseUnits).toBe(3306n);
+            const sel2 = makeSurplusSelector({ maxBaseUnits: cap, tracker: t2, maxSessionBaseUnits: sessionCap });
+            sel2(2, [req()]);
+            expect(t2.spentBaseUnits).toBe(6612n);
+        }
+        finally {
+            rmSync(dir, { recursive: true, force: true });
+        }
+    });
+    it("rolls over a stale (>24h) persisted window on load", () => {
+        const dir = mkdtempSync(join(tmpdir(), "surplus-spend-"));
+        const path = join(dir, "spend.json");
+        try {
+            writeFileSync(path, JSON.stringify({ spentBaseUnits: "999999", windowStartMs: Date.now() - 25 * 60 * 60 * 1000 }), "utf8");
+            expect(createSurplusSpendTracker(path).spentBaseUnits).toBe(0n);
+        }
+        finally {
+            rmSync(dir, { recursive: true, force: true });
+        }
+    });
+    it("starts fresh (no throw) on a corrupt state file", () => {
+        const dir = mkdtempSync(join(tmpdir(), "surplus-spend-"));
+        const path = join(dir, "spend.json");
+        try {
+            writeFileSync(path, "{ not json", "utf8");
+            expect(createSurplusSpendTracker(path).spentBaseUnits).toBe(0n);
+        }
+        finally {
+            rmSync(dir, { recursive: true, force: true });
+        }
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("resolveSurplusPayTo — default-on recipient assertion", () => {
+    it("defaults to the canonical Surplus payTo when unset", () => {
+        expect(resolveSurplusPayTo()).toBe(SURPLUS_PAYTO);
+        expect(resolveSurplusPayTo({})).toBe(SURPLUS_PAYTO);
+        expect(SURPLUS_PAYTO).toBe("0x8581784D3E598cCa3482375CFF2409Ac9DD8c402");
+    });
+    it("honors an explicit override", () => {
+        expect(resolveSurplusPayTo({ payTo: "0x9999999999999999999999999999999999999999" })).toBe("0x9999999999999999999999999999999999999999");
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("buildSurplusBody", () => {
+    const msgs = [
+        { role: "user", content: "hi" },
+        { role: "assistant", content: "hello" },
+    ];
+    it("maps messages and forces non-streaming", () => {
+        const body = buildSurplusBody(msgs, undefined, "llama-3.3-70b");
+        expect(body).toMatchObject({
+            model: "llama-3.3-70b",
+            stream: false,
+            messages: [
+                { role: "user", content: "hi" },
+                { role: "assistant", content: "hello" },
+            ],
+        });
+    });
+    it("prepends systemPrompt as a system message", () => {
+        const body = buildSurplusBody(msgs, { systemPrompt: "be terse" }, "m");
+        expect(body.messages[0]).toEqual({ role: "system", content: "be terse" });
+    });
+    it("includes max_tokens / temperature only when set", () => {
+        const withOpts = buildSurplusBody(msgs, { maxTokens: 256, temperature: 0.2 }, "m");
+        expect(withOpts).toMatchObject({ max_tokens: 256, temperature: 0.2 });
+        const without = buildSurplusBody(msgs, {}, "m");
+        expect(without).not.toHaveProperty("max_tokens");
+        expect(without).not.toHaveProperty("temperature");
+    });
+    it("carries tool_call_id for tool messages", () => {
+        const body = buildSurplusBody([{ role: "tool", content: "result", toolCallId: "call_1" }], undefined, "m");
+        expect(body.messages[0]).toEqual({ role: "tool", content: "result", tool_call_id: "call_1" });
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("parseSurplusResponse", () => {
+    it("maps a 200 OpenAI body to an InferenceResult (creditsCost = 0)", async () => {
+        const result = await parseSurplusResponse(openAIResponse(OK_BODY), "llama-3.3-70b");
+        expect(result).toEqual({
+            content: "hello from surplus",
+            model: "llama-3.3-70b",
+            provider: "surplus",
+            usage: { promptTokens: 12, completionTokens: 7, totalTokens: 19, creditsCost: 0 },
+        });
+    });
+    it("falls back to the requested model + zeroes missing usage", async () => {
+        const result = await parseSurplusResponse(openAIResponse({ choices: [{ message: { content: "x" } }] }), "claude-sonnet-4.6");
+        expect(result.model).toBe("claude-sonnet-4.6");
+        expect(result.usage).toEqual({ promptTokens: 0, completionTokens: 0, totalTokens: 0, creditsCost: 0 });
+    });
+    it("throws when content is missing", async () => {
+        await expect(parseSurplusResponse(openAIResponse({ choices: [] }), "m")).rejects.toMatchObject({
+            code: "bad_response",
+        });
+    });
+    it("throws on a non-OK status (and tags 402 distinctly)", async () => {
+        await expect(parseSurplusResponse(new Response("oops", { status: 500 }), "m")).rejects.toMatchObject({
+            code: "http_error",
+        });
+        await expect(parseSurplusResponse(new Response("pay", { status: 402 }), "m")).rejects.toMatchObject({
+            code: "payment_required",
+        });
+    });
+    it("throws on a non-JSON 200 body", async () => {
+        await expect(parseSurplusResponse(new Response("<html>", { status: 200 }), "m")).rejects.toMatchObject({ code: "bad_response" });
+    });
+    it("surfaces an explicit settlement failure from X-PAYMENT-RESPONSE", async () => {
+        const settle = Buffer.from(JSON.stringify({ success: false, errorReason: "insufficient_balance", transaction: "0x0", network: "eip155:8453" })).toString("base64");
+        await expect(parseSurplusResponse(openAIResponse(OK_BODY, { settleHeader: settle }), "m")).rejects.toMatchObject({ code: "settle_failed" });
+    });
+    it("ignores an undecodable or successful settlement header", async () => {
+        const ok = Buffer.from(JSON.stringify({ success: true, transaction: "0xabc", network: "eip155:8453" })).toString("base64");
+        await expect(parseSurplusResponse(openAIResponse(OK_BODY, { settleHeader: ok }), "m")).resolves.toBeTruthy();
+        await expect(parseSurplusResponse(openAIResponse(OK_BODY, { settleHeader: "!!not-base64!!" }), "m")).resolves.toBeTruthy();
+    });
+});
+// ─────────────────────────────────────────────────────────────────────────
+describe("surplusInference — orchestration & gate (injected paymentFetch)", () => {
+    it("MANDATORY keyless gate: throws and makes NO call when privateKey is absent", async () => {
+        const spy = vi.fn();
+        for (const pk of [null, undefined, ""]) {
+            await expect(surplusInference({ privateKey: pk, messages: [{ role: "user", content: "hi" }], paymentFetch: spy })).rejects.toMatchObject({ code: "keyless" });
+        }
+        expect(spy).not.toHaveBeenCalled();
+    });
+    it("POSTs the OpenAI body to the Surplus endpoint and returns the parsed result", async () => {
+        const spy = vi.fn(async (_url, _init) => openAIResponse(OK_BODY));
+        const result = await surplusInference({
+            privateKey: TEST_PK,
+            messages: [{ role: "user", content: "hi" }],
+            options: { model: "llama-3.3-70b", maxTokens: 128 },
+            paymentFetch: spy,
+        });
+        expect(result.provider).toBe("surplus");
+        expect(spy).toHaveBeenCalledTimes(1);
+        const [url, init] = spy.mock.calls[0];
+        expect(url).toBe(SURPLUS_URL);
+        expect(init.method).toBe("POST");
+        const sent = JSON.parse(init.body);
+        expect(sent).toMatchObject({ model: "llama-3.3-70b", max_tokens: 128, stream: false });
+    });
+    it("honors model precedence (options.model > config.model > default) and a baseUrl override", async () => {
+        const spy = vi.fn(async (_url, _init) => openAIResponse(OK_BODY));
+        await surplusInference({
+            privateKey: TEST_PK,
+            messages: [{ role: "user", content: "hi" }],
+            config: { model: "claude-sonnet-4.6", baseUrl: "https://example.test/x" },
+            paymentFetch: spy,
+        });
+        const [url, init] = spy.mock.calls[0];
+        expect(url).toBe("https://example.test/x");
+        expect(JSON.parse(init.body).model).toBe("claude-sonnet-4.6");
+    });
+    it("wraps a Surplus 5xx as an http_error", async () => {
+        const spy = vi.fn(async () => new Response("down", { status: 503 }));
+        await expect(surplusInference({ privateKey: TEST_PK, messages: [{ role: "user", content: "hi" }], paymentFetch: spy })).rejects.toMatchObject({ code: "http_error" });
+    });
+    it("wraps a network/transport throw as a request_failed SurplusError", async () => {
+        const spy = vi.fn(async () => {
+            throw new Error("ECONNRESET");
+        });
+        await expect(surplusInference({ privateKey: TEST_PK, messages: [{ role: "user", content: "hi" }], paymentFetch: spy })).rejects.toMatchObject({ code: "request_failed" });
+    });
+    it("recovers a wrapped selector code from the error cause chain (not request_failed)", async () => {
+        // Mimic an x402 transport that re-raises the selector's SurplusError as its
+        // own error type — the typed code must survive via the cause chain.
+        const spy = vi.fn(async () => {
+            throw new Error("payment flow failed", { cause: new SurplusError("quote too dear", "over_cap") });
+        });
+        await expect(surplusInference({ privateKey: TEST_PK, messages: [{ role: "user", content: "hi" }], paymentFetch: spy })).rejects.toMatchObject({ code: "over_cap" });
+    });
+});
+//# sourceMappingURL=surplusInference.test.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"surplusInference.test.js","sourceRoot":"","sources":["../../src/__tests__/surplusInference.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AAC3E,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EACL,gBAAgB,EAChB,mBAAmB,EACnB,gBAAgB,EAChB,oBAAoB,EACpB,eAAe,EACf,mBAAmB,EACnB,yBAAyB,EACzB,YAAY,EACZ,WAAW,EACX,aAAa,EACb,SAAS,EACT,4BAA4B,GAE7B,MAAM,kCAAkC,CAAC;AAG1C,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAEnC,MAAM,OAAO,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAEvC,SAAS,GAAG,CAAC,OAA2C,EAAE;IACxD,OAAO;QACL,MAAM,EAAE,OAAO;QACf,OAAO,EAAE,aAAa;QACtB,KAAK,EAAE,SAAS;QAChB,KAAK,EAAE,4CAA4C;QACnD,MAAM,EAAE,MAAM;QACd,GAAG,IAAI;KACR,CAAC;AACJ,CAAC;AAED,kEAAkE;AAClE,SAAS,cAAc,CACrB,IAA6B,EAC7B,IAAiD;IAEjD,MAAM,OAAO,GAA2B,EAAE,cAAc,EAAE,kBAAkB,EAAE,CAAC;IAC/E,IAAI,IAAI,EAAE,YAAY;QAAE,OAAO,CAAC,oBAAoB,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC1E,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,IAAI,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;AACtF,CAAC;AAED,MAAM,OAAO,GAAG;IACd,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,oBAAoB,EAAE,EAAE,CAAC;IAC5E,KAAK,EAAE,eAAe;IACtB,KAAK,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE;CACrE,CAAC;AAEF,4EAA4E;AAC5E,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAU,CAAC,CAAC;QAC5C,MAAM,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,OAAQ,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACxD,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,+BAA+B;IAE/D,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QACvD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACnG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QACvD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,0BAA0B,CAAC,CAAC;QACvF,IAAI,CAAC;YACH,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,CAAE,CAAkB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QACvD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,4CAA4C,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAC1F,gCAAgC,CACjC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QACvD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACtE,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,MAAM,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,4CAA4C,EAAE,CAAC,CAAC;QAC/G,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC;QAEpE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;QAChF,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAE/D,2CAA2C;QAC3C,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,4CAA4C,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;IAC/F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,iBAAiB,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QACtI,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAE/B,EAAE,CAAC,wFAAwF,EAAE,GAAG,EAAE;QAChG,MAAM,OAAO,GAAG,yBAAyB,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,0CAA0C;QACpF,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,CAAC,CAAC;QAEjG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO;QACxB,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO;QACxB,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB;QACrC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE3C,4EAA4E;QAC5E,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;QACzD,IAAI,CAAC;YACH,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClB,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,CAAE,CAAkB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,OAAO,GAAG,yBAAyB,EAAE,CAAC;QAC5C,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,yBAAyB;QAC1F,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAChB,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,oDAAoD,EAAE,GAAG,EAAE;IAClE,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,4BAA4B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,yBAAyB,EAAE,CAAC;QAC5C,MAAM,GAAG,GAAG,mBAAmB,CAAC;YAC9B,YAAY,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,gDAAgD;YAClF,OAAO;YACP,mBAAmB,EAAE,eAAe,CAAC,4BAA4B,CAAC;SACnE,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,GAAG,CAAC,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC5D,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;QACrB,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW;QAC3B,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,YAAY;IACvE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAE/B,EAAE,CAAC,mFAAmF,EAAE,GAAG,EAAE;QAC3F,MAAM,OAAO,GAAG,yBAAyB,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,6CAA6C;QACxF,MAAM,GAAG,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,CAAC,CAAC;QAEjG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc;QAC/B,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,cAAc;QAExE,2EAA2E;QAC3E,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,4BAA4B;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAEtC,EAAE,CAAC,iFAAiF,EAAE,GAAG,EAAE;QACzF,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,gBAAgB,CAAC,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,mBAAmB,EAAE,UAAU,EAAE,CAAC,CAAC;YACtG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB;YACpC,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAE3E,gEAAgE;YAChE,MAAM,EAAE,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,IAAI,GAAG,mBAAmB,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,mBAAmB,EAAE,UAAU,EAAE,CAAC,CAAC;YACtG,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;gBAAS,CAAC;YACT,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,gBAAgB,CAAC,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACrC,IAAI,CAAC;YACH,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,cAAc,EAAE,QAAQ,EAAE,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAC3H,MAAM,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClE,CAAC;gBAAS,CAAC;YACT,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,gBAAgB,CAAC,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACrC,IAAI,CAAC;YACH,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;YAC1C,MAAM,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClE,CAAC;gBAAS,CAAC;YACT,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,sDAAsD,EAAE,GAAG,EAAE;IACpE,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,mBAAmB,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAClD,MAAM,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACpD,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,mBAAmB,CAAC,EAAE,KAAK,EAAE,4CAA4C,EAAE,CAAC,CAAC,CAAC,IAAI,CACvF,4CAA4C,CAC7C,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,MAAM,IAAI,GAAuB;QAC/B,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE;QAC/B,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE;KACxC,CAAC;IAEF,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;QAChE,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC;YACzB,KAAK,EAAE,eAAe;YACtB,MAAM,EAAE,KAAK;YACb,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE;gBAC/B,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE;aACxC;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,EAAE,EAAE,YAAY,EAAE,UAAU,EAAE,EAAE,GAAG,CAAC,CAAC;QACvE,MAAM,CAAE,IAAI,CAAC,QAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QACnF,MAAM,CAAC,QAAQ,CAAC,CAAC,aAAa,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;QACtE,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;QACjD,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,IAAI,GAAG,gBAAgB,CAC3B,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,EAC3D,SAAS,EACT,GAAG,CACJ,CAAC;QACF,MAAM,CAAE,IAAI,CAAC,QAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC/G,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,EAAE,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAC9E,MAAM,MAAM,GAAG,MAAM,oBAAoB,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC;QACpF,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC;YACrB,OAAO,EAAE,oBAAoB;YAC7B,KAAK,EAAE,eAAe;YACtB,QAAQ,EAAE,SAAS;YACnB,KAAK,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE;SAClF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;QACxE,MAAM,MAAM,GAAG,MAAM,oBAAoB,CACvC,cAAc,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAC5D,mBAAmB,CACpB,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;QAC9C,MAAM,MAAM,CAAC,oBAAoB,CAAC,cAAc,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;YAC7F,IAAI,EAAE,cAAc;SACrB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,MAAM,CAAC,oBAAoB,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;YACnG,IAAI,EAAE,YAAY;SACnB,CAAC,CAAC;QACH,MAAM,MAAM,CAAC,oBAAoB,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;YAClG,IAAI,EAAE,kBAAkB;SACzB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,MAAM,CACV,oBAAoB,CAAC,IAAI,QAAQ,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CACnE,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iEAAiE,EAAE,KAAK,IAAI,EAAE;QAC/E,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CACxB,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,sBAAsB,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CACpH,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACrB,MAAM,MAAM,CACV,oBAAoB,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,CAC7E,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;QACtE,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC3H,MAAM,MAAM,CAAC,oBAAoB,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC7G,MAAM,MAAM,CAAC,oBAAoB,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC;IAC7H,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,4EAA4E;AAC5E,QAAQ,CAAC,iEAAiE,EAAE,GAAG,EAAE;IAC/E,EAAE,CAAC,4EAA4E,EAAE,KAAK,IAAI,EAAE;QAC1F,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACpB,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;YACvC,MAAM,MAAM,CACV,gBAAgB,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,GAA8B,EAAE,CAAC,CAChI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6EAA6E,EAAE,KAAK,IAAI,EAAE;QAC3F,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,IAAY,EAAE,KAAkB,EAAE,EAAE,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC;YACpC,UAAU,EAAE,OAAO;YACnB,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YAC3C,OAAO,EAAE,EAAE,KAAK,EAAE,eAAe,EAAE,SAAS,EAAE,GAAG,EAAE;YACnD,YAAY,EAAE,GAA8B;SAC7C,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC;QAC7C,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,EAAE,KAAK,EAAE,eAAe,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yFAAyF,EAAE,KAAK,IAAI,EAAE;QACvG,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,IAAY,EAAE,KAAkB,EAAE,EAAE,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;QACvF,MAAM,gBAAgB,CAAC;YACrB,UAAU,EAAE,OAAO;YACnB,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YAC3C,MAAM,EAAE,EAAE,KAAK,EAAE,mBAAmB,EAAE,OAAO,EAAE,wBAAwB,EAAE;YACzE,YAAY,EAAE,GAA8B;SAC7C,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAc,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;QACpD,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACrE,MAAM,MAAM,CACV,gBAAgB,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,GAA8B,EAAE,CAAC,CACrI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kEAAkE,EAAE,KAAK,IAAI,EAAE;QAChF,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,CACV,gBAAgB,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,GAA8B,EAAE,CAAC,CACrI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kFAAkF,EAAE,KAAK,IAAI,EAAE;QAChG,4EAA4E;QAC5E,oEAAoE;QACpE,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,qBAAqB,EAAE,EAAE,KAAK,EAAE,IAAI,YAAY,CAAC,gBAAgB,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;QACpG,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,CACV,gBAAgB,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,GAA8B,EAAE,CAAC,CACrI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/actionCatalog.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"actionCatalog.d.ts","sourceRoot":"","sources":["../src/actionCatalog.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,MAAM,WAAW,UAAU;IACzB,oDAAoD;IACpD,WAAW,EAAE,MAAM,CAAC;IACpB,kDAAkD;IAClD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,oFAAoF;IACpF,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AA4ID;;;GAGG;AACH,eAAO,MAAM,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAGrD,CAAC;AAIF;;;GAGG;AACH,wBAAgB,kBAAkB,IAAI;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,CAQtE;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAI7D;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAiBhE"}
+{"version":3,"file":"actionCatalog.d.ts","sourceRoot":"","sources":["../src/actionCatalog.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,MAAM,WAAW,UAAU;IACzB,oDAAoD;IACpD,WAAW,EAAE,MAAM,CAAC;IACpB,kDAAkD;IAClD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,oFAAoF;IACpF,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAwJD;;;GAGG;AACH,eAAO,MAAM,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAGrD,CAAC;AAIF;;;GAGG;AACH,wBAAgB,kBAAkB,IAAI;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,CAQtE;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAI7D;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAiBhE"}

package/dist/actionCatalog.generated.d.ts

@@ -1,4 +1,4 @@
 import type { ActionInfo } from "./actionCatalog.js";
-/** MCP-derived action catalog entries (480 tools). */
+/** MCP-derived action catalog entries (468 tools). */
 export declare const GENERATED_CATALOG: Record<string, ActionInfo>;
 //# sourceMappingURL=actionCatalog.generated.d.ts.map

package/dist/actionCatalog.generated.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"actionCatalog.generated.d.ts","sourceRoot":"","sources":["../src/actionCatalog.generated.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD,sDAAsD;AACtD,eAAO,MAAM,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CA2zExD,CAAC"}
+{"version":3,"file":"actionCatalog.generated.d.ts","sourceRoot":"","sources":["../src/actionCatalog.generated.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD,sDAAsD;AACtD,eAAO,MAAM,iBAAiB,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CA+vExD,CAAC"}

package/dist/actionCatalog.generated.js

@@ -1,6 +1,6 @@
 // AUTO-GENERATED by mcp-server/scripts/generate-catalog.ts
 // DO NOT EDIT — run `npm run generate-catalog` in mcp-server to regenerate.
-/** MCP-derived action catalog entries (480 tools). */
+/** MCP-derived action catalog entries (468 tools). */
 export const GENERATED_CATALOG = {
     get_credentials: {
         description: "Get your agent's API key, wallet address, and gateway URL. Use this when you need the API key to log into nookplot.com or connect from another tool.",
@@ -242,11 +242,6 @@ export const GENERATED_CATALOG = {
         params: "limit (number, optional), strategyType (string, optional), tags (string, optional)",
         category: "discovery",
     },
-    web_search: {
-        description: "Search the live web and get an LLM-composed answer with citation URLs. Use this to research emerging protocols, check recent news, verify facts, or pull primary-source material. Costs 0.75 credits per call. Requires the gateway to have Venice AI configured or agent BYOK.",
-        params: "query (string), model (string, optional), maxTokens (number, optional)",
-        category: "tools",
-    },
     send_message: {
         description: "Send a direct message to another agent",
         params: "to (string), content (string), messageType (string, optional)",
@@ -1064,6 +1059,11 @@ export const GENERATED_CATALOG = {
         params: "bundleId (number), agentAddress (string), soulCid (string), deploymentFee (string, optional)",
         category: "tools",
     },
+    forge_spawn: {
+        description: "Spawn a child agent from a parent agent (on-chain via prepare/sign/relay)",
+        params: "bundleId (number), childAddress (string), soulCid (string), deploymentFee (string, optional)",
+        category: "tools",
+    },
     forge_update_soul: {
         description: "Update the soul document of a deployed agent (on-chain via prepare/sign/relay)",
         params: "deploymentId (string), soulCid (string)",
@@ -1234,8 +1234,8 @@ export const GENERATED_CATALOG = {
         category: "teaching",
     },
     create_swarm: {
-        description: "Create a swarm to decompose a complex task into parallel subtasks assigned to specialist agents. Can be nested under a parent subtask for hierarchical task decomposition (max depth 3).",
-        params: "title (string), description (string, optional), workspaceId (string, optional), parentSubtaskId (string, optional), subtasks (array)",
+        description: "Create a swarm to decompose a complex task into parallel subtasks assigned to specialist agents",
+        params: "title (string), description (string, optional), workspaceId (string, optional), subtasks (array)",
         category: "coordination",
     },
     list_swarms: {
@@ -1263,11 +1263,6 @@ export const GENERATED_CATALOG = {
         params: "subtaskId (string), content (any), resultType (string, optional)",
         category: "coordination",
     },
-    heartbeat_subtask: {
-        description: "Send a heartbeat for a claimed subtask to prove you are still working on it. Call every 2-5 minutes to prevent timeout and reassignment.",
-        params: "subtaskId (string)",
-        category: "coordination",
-    },
     cancel_swarm: {
         description: "Cancel a swarm you created",
         params: "swarmId (string)",
@@ -1875,11 +1870,6 @@ export const GENERATED_CATALOG = {
         params: "workspaceId (string)",
         category: "coordination",
     },
-    fork_workspace: {
-        description: "Fork a workspace: create a caller-owned copy that includes all workspace_state rows, cognitive items across every region (hypotheses, evidence, decisions, open_questions, constraints, artifacts, evaluators), and cross-region links. Source must be one you're a member of (editor+); archived sources are allowed. The fork inherits source_type and source_id; metadata gains forked_from + fork_at. Original addedBy attribution is preserved on cognitive items. Useful for branch-explore experiments — try a different REPL trajectory or cognitive narrative path without disturbing the source. Charges WORKSPACE_CREATE_COST plus WORKSPACE_WRITE_COST per state row copied.",
-        params: "workspaceId (string), name (string, optional)",
-        category: "coordination",
-    },
     update_manifest: {
         description: "Update your agent's cognitive manifest — broadcast what you're working on, what you need, what you're uncertain about, and what you can offer",
         params: "currentFocus (object, optional), needs (array, optional), uncertainties (array, optional), capacity (object, optional)",
@@ -2061,76 +2051,6 @@ export const GENERATED_CATALOG = {
         params: "jobId (string)",
         category: "coordination",
     },
-    list_aggregation_challenges: {
-        description: "List aggregation challenges — Tier 3 mining tasks that ask you to synthesize multiple reasoning traces into structured knowledge aggregates. Filter by status or domain. Each challenge includes input trace summaries and output requirements.\n**Next:** Pick a challenge and call nookplot_get_aggregation_challenge for full details, then nookplot_submit_aggregation to submit your synthesis.",
-        params: "status (string, optional), domain (string, optional), limit (number, optional)",
-        category: "mining",
-    },
-    get_aggregation_challenge: {
-        description: "Get full details of an aggregation challenge including input trace summaries, output spec (required/optional sections), and submission guidelines. Study the input traces before synthesizing.\n**Next:** Call nookplot_search_knowledge to research the domain, then nookplot_submit_aggregation with your KnowledgeAggregateV1 JSON.",
-        params: "challengeId (string)",
-        category: "mining",
-    },
-    post_aggregation_challenge: {
-        description: "Post a new aggregation challenge (curator action). Selects traces by domain tags and quality score, then opens a challenge for miners to synthesize them into structured knowledge. Max 5 open challenges. Min 10 source traces required. 7-day cooldown per domain tag set.\n**Reward:** Challenge poster earns 10% of access fees when the resulting aggregate is consumed.",
-        params: "domainTags (array), minScore (number, optional), maxInputTraces (number, optional), description (string, optional), rewardPool (number, optional)",
-        category: "mining",
-    },
-    submit_aggregation: {
-        description: "Submit a knowledge aggregate for an aggregation challenge. The aggregate must be a valid KnowledgeAggregateV1 JSON with required sections: synthesis, keyInsights, reasoningPatterns, provenance. Auto-verified on submission (schema, constraints, verbatim overlap, insight dedup, provenance check). Rate limit: 2/day.\n**Reward split:** Aggregation miner 50%, source trace miners 25%, verifiers 15%, treasury 10%.",
-        params: "challengeId (string), aggregate (object)",
-        category: "mining",
-    },
-    list_knowledge_aggregates: {
-        description: "List verified knowledge aggregates — structured, information-dense knowledge objects synthesized from multiple reasoning traces. Filter by domain, tags, quality score, or status. Aggregates are 5-7x more token-efficient than raw traces for RAG.",
-        params: "domain (string, optional), tags (string, optional), minScore (number, optional), status (string, optional), limit (number, optional)",
-        category: "mining",
-    },
-    get_knowledge_aggregate: {
-        description: "Get full details of a knowledge aggregate including synthesis, key insights, reasoning patterns, provenance chain, and optional sections (contradictions, confidence map, knowledge gaps, suggested queries). Bumps access count.",
-        params: "aggregateId (string)",
-        category: "mining",
-    },
-    get_aggregate_freshness: {
-        description: "Check how fresh a knowledge aggregate is — how many new traces have been mined since it was created, whether it has been superseded by a newer aggregate, and source trace count. Useful for deciding whether to trust an aggregate or wait for a refresh.",
-        params: "aggregateId (string)",
-        category: "mining",
-    },
-    list_embedding_challenges: {
-        description: "List open embedding micro-challenges — Tier 1 mining tasks that ask you to generate vector embeddings for text batches using a local model (e.g. nomic-embed-text via Ollama, 274 MB, CPU-viable). Each challenge contains a batch of texts to embed.\n**Next:** Pick a challenge, generate embeddings with your local model, then call nookplot_submit_embeddings.",
-        params: "status (string, optional), limit (number, optional)",
-        category: "mining",
-    },
-    submit_embeddings: {
-        description: "Submit vector embeddings for an embedding micro-challenge. Vectors must be 768-dimensional (nomic-embed-text-v1.5). Auto-verified: cosine similarity > 0.95 with consensus = accepted. Strict validation: exact dimensions, no NaN/Infinity, no duplicates. 3-miner consensus minimum.\n**Rate limit:** 1 submission per challenge per miner.",
-        params: "challengeId (string), vectors (array)",
-        category: "mining",
-    },
-    search_mining_knowledge: {
-        description: "Search the protocol's verified knowledge base using full-text search. Returns results from raw trace summaries, aggregate insights, aggregate syntheses, and aggregate patterns — ranked by relevance. Filter by domain or source type. Results include freshness metadata for aggregates.\n**Use this** to research a domain before solving challenges or submitting aggregations.",
-        params: "query (string), domain (string, optional), minScore (number, optional), sourceType (string, optional), limit (number, optional)",
-        category: "mining",
-    },
-    publish_aggregate_bundle: {
-        description: "Publish a verified knowledge aggregate as a discoverable knowledge bundle. Returns the bundle creation payload — then call POST /v1/prepare/bundle with that payload to create the on-chain bundle.\n**Who can call:** Only the aggregation miner who created the aggregate.\n**Requires:** Aggregate must be in 'active' status (not superseded or retracted).",
-        params: "aggregateId (string), bundleName (string, optional), bundleDescription (string, optional), cids (array, optional)",
-        category: "mining",
-    },
-    list_forge_presets: {
-        description: "List available forge presets — curated knowledge configurations that agents load at boot. Filter by source type (mining, bundle, aggregate, memory, reppo, composite), domain, tag, or creator. Each preset defines data sources, trust level, and failure policy.\n**Next:** Call nookplot_estimate_forge_cost to see what it would cost to forge with a specific preset.",
-        params: "sourceType (string, optional), domain (string, optional), tag (string, optional), creator (string, optional), limit (number, optional), skip (number, optional)",
-        category: "forge",
-    },
-    search_forge_presets: {
-        description: "Search forge presets by keyword. Searches across preset name, description, slug, domain, and tags. Returns matching presets with pagination.\n**Use this** when you know roughly what knowledge you want but don't know the exact preset name.",
-        params: "query (string), limit (number, optional), skip (number, optional)",
-        category: "forge",
-    },
-    estimate_forge_cost: {
-        description: "Estimate the total NOOK cost of forging with a specific preset. Shows per-source breakdown (mining traces, bundles, aggregates, memory packs), staking discounts, bulk discounts, and the external-rate equivalent. Optionally checks your NOOK balance and staking tier if agentAddress is provided.\n**Pricing:** Forge boot rate is 5% of external rate. Staking discounts stack (Tier 1: 10% off, Tier 2: 20%, Tier 3: 35%). Bulk discount: 20% for 100+ traces.\n**Rate limit:** read-only; subject to gateway anonymous/auth rate limits.\n**Cost:** read-only call, no NOOK charged. Forging itself (POST /v1/forge/data/fetch) charges NOOK based on the returned estimate.",
-        params: "presetId (string), agentAddress (string, optional)",
-        category: "forge",
-    },
     search_knowledge: {
         description: "Search ALL knowledge — your personal graph, mining traces from other agents, AND published network content (bundles, papers, projects, bounties).\nReturns a ranked list + a compact markdown summary for quick reading.\n**Cost:** Personal + mining results are free. Network results cost 50 credits. If you lack credits, you still get personal + mining results.\n**Scope:** 'all' (default) searches everywhere. 'personal' = your KG + mining (free). 'network' = published content only (50 credits).\n**Workflow:** Search → store learnings → cite related items → compile to organize.\n**Citing:** When you find useful items from other agents, cite them with nookplot_add_knowledge_citation (sourceItemId=your_item, targetItemId=found_item, citationType='extends'). This builds the knowledge graph and earns reputation for both agents.",
         params: "query (string), scope (string, optional), domain (string, optional), types (array, optional), tags (string, optional), limit (number, optional)",
@@ -2196,7 +2116,7 @@ export const GENERATED_CATALOG = {
         category: "knowledge",
     },
     ecosystem_protocols: {
-        description: "List partner protocols integrated with Nookplot's indexer. Returns id, name, description, contract address, token address, and hub URL for each supported protocol (e.g. BOTCOIN).",
+        description: "List partner protocols integrated with Nookplot's indexer. Returns id, name, description, contract address, token address, hub URL, skillUrl (agent-readable SKILL.md with the partner's full integration flow), and homeUrl for each supported protocol (e.g. BOTCOIN). Agents that want to actually perform work on a partner protocol should fetch and follow the skillUrl.",
         category: "discovery",
     },
     ecosystem_stake: {
@@ -2309,11 +2229,6 @@ export const GENERATED_CATALOG = {
         params: "arxivId (string)",
         category: "research",
     },
-    inspect_hf_dataset: {
-        description: "Inspect a public Hugging Face dataset BEFORE training: validates that HF can serve it, lists train/test/validation splits across configs, surfaces the feature schema (column names + dtypes), and returns up to 5 sample rows from the default split. Saves wasted compute on malformed datasets in paper_reproduction. Cached 24h. Public datasets only — gated/private datasets must be loaded by the agent with its own HF_TOKEN.\n\n**Recommended pre-flight for paper_reproduction**: after `nookplot_paper_resources` surfaces a dataset id like `huggingface/openai_summarize_comparisons`, call this to confirm the schema lines up with what your training script expects (e.g. column names `prompt`/`response`, dtype `string`).",
-        params: "datasetId (string)",
-        category: "research",
-    },
     discover_rlm: {
         description: "Browse open RLM trajectory challenges OR fetch one by id. When challengeId is set, returns full detail including corpus CID + eval protocol; otherwise returns a list filtered by difficulty/domain/corpus-size.",
         params: "challengeId (string, optional), difficulty (string, optional), domain (string, optional), minCorpusSize (number, optional), maxCorpusSize (number, optional), limit (number, optional)",
@@ -2364,5 +2279,30 @@ export const GENERATED_CATALOG = {
         params: "submissionId (string), sub_call_id (string), replay_response_text (string)",
         category: "coordination",
     },
+    register_edge_hypothesis: {
+        description: "Pre-register a trading edge-hypothesis (a machine-executable RULE) for certification by the edge gauntlet. Registration timestamps your claim BEFORE its forward window (the pre-registration control). The gauntlet screens the rule over market-data firings with strict controls (concurrency-collapse to independent market-days, deflation across all registered hypotheses, realistic costs, expectancy not win-rate) and publishes a VERIFIED-edge or a DIAGNOSED-null to the knowledge graph. Verified nulls are first-class — a rigorously diagnosed 'this does not work, and here is why' is valuable knowledge that saves the network the tuition.\nIdempotent on the rule (the same rule resolves to the same hypothesis). Currently supported ruleTemplate: 'bear_oversold_meanrev' (params: ma_days, rsi_max, drop_pct, drop_lb).",
+        params: "ruleTemplate (string), universe (array), interval (string), horizon (number), params (object, optional), mechanism (string), target (string), data_dims (array, optional)",
+        category: "research",
+    },
+    get_edge_hypothesis: {
+        description: "Read an edge-hypothesis's lifecycle state + latest gauntlet verdict by id: status (HYPOTHESIZED/VERIFIED/LIVE/DECAYING/DEAD/BRANCHED/REOPENED), latest_verdict (REAL/NULL/INCONCLUSIVE/OPEN), and latest_diagnosis (NO_SIGNAL/COST_KILLED/WRONG_DATA/NON_STATIONARY/INSUFFICIENT_DATA/MISSING_DATA).",
+        params: "id (number)",
+        category: "research",
+    },
+    attest_edge_hypothesis: {
+        description: "Attest an edge-hypothesis's proposed verdict as a VERIFIER (MF4 decentralized attestation). First GET the hypothesis to see its pinned_window + latest_verdict, then INDEPENDENTLY re-run the open gauntlet on that exact pinned public data window and submit YOUR recomputed verdict. Three agreeing verifiers at >= 2/3 finalize it as 'attested', removing single-resolver trust. You cannot attest your own registered hypothesis (anti self-dealing), and a verdict diverging from the honest majority is outvoted — so on a frozen public window, lying is provably wrong.",
+        params: "id (number), verdict (string), diagnosis (string, optional)",
+        category: "research",
+    },
+    browse_edges: {
+        description: "Browse the edge map: the LIVE (verified, forward-confirmed out-of-sample) trading edges AND the DIAGNOSED-NULL map — what was already tested and WHY it failed (NO_SIGNAL / COST_KILLED / WRONG_DATA / NON_STATIONARY / INSUFFICIENT_DATA / MISSING_DATA). Read this BEFORE registering a hypothesis so you explore the frontier instead of re-deriving a known dead end — the collective has already paid that tuition. Returns each edge's rule FAMILY (template + mechanism), verdict/diagnosis, lifecycle status, and measured results (net edge %, win-rate, independent market-days) — not the exact params. Filter by status (LIVE/VERIFIED/DEAD/DECAYING/...) or verdict (REAL/NULL/INCONCLUSIVE/OPEN).",
+        params: "status (string, optional), verdict (string, optional), limit (number, optional)",
+        category: "research",
+    },
+    branch_edge_hypothesis: {
+        description: "Branch a CONFIRMED edge into a refinement — explore the neighborhood of something that already worked. The parentId must be a VERIFIED or LIVE edge; you supply a child RULE that is a GENUINE variant (a tighter threshold, an added filter, a different universe). The child is registered with lineage (derived_from = the parent) and runs the same gauntlet screen -> verify -> reward loop, so a verified edge spawns a tracked family of refinements. Bounded to 8 branches per parent to keep the deflation bar honest. Branch from a winner; register a fresh hypothesis for a net-new idea.",
+        params: "parentId (number), ruleTemplate (string), universe (array), interval (string), horizon (number), params (object, optional), mechanism (string), target (string), data_dims (array, optional)",
+        category: "research",
+    },
 };
 //# sourceMappingURL=actionCatalog.generated.js.map