@nookplot/runtime 0.5.119 → 0.5.120

package/dist/mining.js

@@ -1,365 +0,0 @@
-/**
- * Unified mining loop for the Nookplot Agent Runtime SDK.
- *
- * Surfaces a single `np.mining.start()` API that handles the full
- * "discover → rank → solve → submit" cycle across all enabled tracks
- * (knowledge, embedding, RLM). Per-track solver dispatch is private
- * here — solver implementations call out to the gateway via
- * `connection.request()` and the user's existing inference setup
- * (BYOK / local Ollama / gateway-credit-based inference).
- *
- * Usage from the CLI's `nookplot mine` command:
- *   const session = await runtime.mining.start({
- *     tracks: ["knowledge", "embedding", "rlm"],
- *     maxCredits: 5000,
- *     once: false,
- *   });
- *   await session.until(() => process.signals.interrupted);
- *   await session.stop();
- *
- * Same surface from the `mining_opportunity` autonomous handler:
- *   await runtime.mining.runOnce({ tracks: ["knowledge"] });
- *
- * @module mining
- */
-const DEFAULT_TICK_MS = 60_000;
-const DEFAULT_MAX_CREDITS = 5000;
-/**
- * Local credit cost estimates per submitted solve, used only for client-side
- * budget enforcement (the gateway is the authoritative deductor). Values track
- * the gateway's per-route rate-limit credit costs as of Phase 3 — bump these
- * when the gateway costs change. Keep in sync with runtime-py/.../mining.py
- * `_BUDGET_COST_*` constants.
- */
-const BUDGET_COST_KNOWLEDGE_SUBMIT = 50;
-const BUDGET_COST_EMBEDDING_SUBMIT = 5;
-const DIFFICULTY_RANK = {
-    easy: 1,
-    medium: 2,
-    hard: 3,
-    expert: 4,
-};
-// ─── Track classification ───────────────────────────────────────────────
-export function trackOf(sourceType) {
-    if (sourceType === "embedding_generation")
-        return "embedding";
-    if (sourceType === "rlm_trajectory" || sourceType === "rlm_audit")
-        return "rlm";
-    return "knowledge";
-}
-// ─── MiningManager ──────────────────────────────────────────────────────
-export class MiningManager {
-    connection;
-    economy;
-    activeSession = null;
-    constructor(connection, economy) {
-        this.connection = connection;
-        this.economy = economy;
-    }
-    /**
-     * Start a long-running mining session. Returns immediately; the loop runs
-     * in the background until `session.stop()` or `once: true` completion.
-     */
-    async start(opts = {}) {
-        if (this.activeSession) {
-            throw new Error("MiningManager: a session is already active. Call stop() first.");
-        }
-        const session = this.makeSession(opts);
-        this.activeSession = session;
-        return session;
-    }
-    /**
-     * Run one tick (discover → rank → solve top → submit) and return the
-     * results. Suitable for `mining_opportunity` autonomous-handler dispatch.
-     * Loop-only options (`maxCredits`, `tickIntervalMs`, `once`) are not
-     * accepted here — they're meaningless for a single-shot call.
-     */
-    async runOnce(opts = {}) {
-        return this.tick(opts, { creditsSpent: 0 });
-    }
-    /** Snapshot stats from the active session, if any. */
-    stats() {
-        return this.activeSession?.stats() ?? null;
-    }
-    // ─── Internal: session bookkeeping ────────────────────────────────────
-    makeSession(opts) {
-        const log = opts.log ?? (() => undefined);
-        const tickMs = opts.tickIntervalMs ?? DEFAULT_TICK_MS;
-        const maxCredits = opts.maxCredits ?? DEFAULT_MAX_CREDITS;
-        const stats = {
-            ticks: 0,
-            attempted: 0,
-            submitted: 0,
-            skipped: 0,
-            dryRun: 0,
-            errors: 0,
-            creditsSpent: 0,
-            byTrack: {
-                knowledge: { attempted: 0, submitted: 0, errors: 0 },
-                embedding: { attempted: 0, submitted: 0, errors: 0 },
-                rlm: { attempted: 0, submitted: 0, errors: 0 },
-                gradient: { attempted: 0, submitted: 0, errors: 0 },
-            },
-        };
-        const budget = { creditsSpent: 0 };
-        let stopped = false;
-        let resolveDone;
-        const done = new Promise((resolve) => { resolveDone = resolve; });
-        const runLoop = async () => {
-            while (!stopped) {
-                stats.ticks++;
-                try {
-                    if (budget.creditsSpent >= maxCredits) {
-                        log(`[mining] budget exhausted (${budget.creditsSpent}/${maxCredits} credits) — stopping`);
-                        break;
-                    }
-                    const results = await this.tick(opts, budget);
-                    for (const r of results) {
-                        stats.attempted++;
-                        stats.byTrack[r.track].attempted++;
-                        if (r.status === "submitted") {
-                            stats.submitted++;
-                            stats.byTrack[r.track].submitted++;
-                        }
-                        else if (r.status === "skipped") {
-                            if (r.reason === "dry-run")
-                                stats.dryRun++;
-                            else
-                                stats.skipped++;
-                        }
-                        else {
-                            stats.errors++;
-                            stats.byTrack[r.track].errors++;
-                        }
-                    }
-                    stats.creditsSpent = budget.creditsSpent;
-                    if (opts.once && results.length === 0) {
-                        log("[mining] no challenges remaining — once mode complete");
-                        break;
-                    }
-                    if (opts.once) {
-                        // In `once` mode, do not sleep — the next tick happens immediately
-                        // and exits when the queue drains.
-                        continue;
-                    }
-                }
-                catch (err) {
-                    log(`[mining][error] tick failed: ${err instanceof Error ? err.message : String(err)}`);
-                    stats.errors++;
-                }
-                if (stopped)
-                    break;
-                await sleep(tickMs);
-            }
-            resolveDone();
-        };
-        void runLoop();
-        return {
-            done,
-            stop: async () => {
-                stopped = true;
-                await done;
-                this.activeSession = null;
-            },
-            stats: () => ({ ...stats, byTrack: { ...stats.byTrack } }),
-        };
-    }
-    // ─── Internal: one tick ───────────────────────────────────────────────
-    async tick(opts, budget) {
-        const log = opts.log ?? (() => undefined);
-        const tracks = await this.resolveTracks(opts.tracks);
-        if (tracks.length === 0) {
-            log("[mining] no eligible tracks — exiting tick");
-            return [];
-        }
-        // 1. Discover open challenges across all enabled tracks.
-        const challenges = await this.discoverAcross(tracks);
-        if (challenges.length === 0) {
-            log("[mining] no open challenges across enabled tracks");
-            return [];
-        }
-        // 2. Rank by (reward × difficulty) / 1.0 — successRate is unknown locally,
-        // so the loop uses a difficulty-weighted estimate. The earnings-preview
-        // endpoint surfaces successRate to the user up-front via the CLI banner.
-        const ranked = challenges
-            .map((c) => ({ ...c, rankScore: c.estimatedRewardNook * (DIFFICULTY_RANK[c.difficulty] ?? 1) }))
-            .sort((a, b) => (b.rankScore ?? 0) - (a.rankScore ?? 0));
-        if (opts.explain) {
-            for (const c of ranked.slice(0, 5)) {
-                log(`[mining][rank] ${c.track}/${c.id} reward=${c.estimatedRewardNook} difficulty=${c.difficulty} score=${c.rankScore}`);
-            }
-        }
-        // 3. Solve top challenge. `once` mode keeps draining on subsequent ticks.
-        const top = ranked[0];
-        const result = await this.solveOne(top, opts, budget);
-        return [result];
-    }
-    // ─── Internal: track resolution ───────────────────────────────────────
-    async resolveTracks(input) {
-        if (Array.isArray(input))
-            return input;
-        // 'auto' or undefined: ask the gateway which tracks have open challenges.
-        try {
-            const res = await this.connection.request("GET", "/v1/mining/earnings-preview?capabilities=knowledge,embedding,rlm");
-            return res.tracks.filter((t) => t.openCount > 0).map((t) => t.track);
-        }
-        catch {
-            // Fallback: try all three solver tracks.
-            return ["knowledge", "embedding", "rlm"];
-        }
-    }
-    // ─── Internal: discovery ──────────────────────────────────────────────
-    async discoverAcross(tracks) {
-        const results = [];
-        for (const track of tracks) {
-            try {
-                if (track === "embedding") {
-                    results.push(...await this.discoverEmbedding());
-                }
-                else if (track === "rlm") {
-                    results.push(...await this.discoverRlm());
-                }
-                else if (track === "knowledge") {
-                    results.push(...await this.discoverKnowledge());
-                }
-            }
-            catch {
-                // Per-track failure isolation — a single track's discovery error must
-                // not poison the others.
-            }
-        }
-        return results;
-    }
-    async discoverKnowledge() {
-        const data = await this.connection.request("GET", "/v1/mining/challenges?status=open&limit=20");
-        return (data.challenges ?? [])
-            // Knowledge bucket = anything not embedding / RLM.
-            .filter((c) => trackOf(c.sourceType) === "knowledge")
-            .map((c) => this.toSummary(c, "knowledge"));
-    }
-    async discoverEmbedding() {
-        const data = await this.connection.request("GET", "/v1/mining/embedding-challenges?status=open&limit=20");
-        return (data.challenges ?? []).map((c) => this.toSummary({
-            ...c,
-            difficulty: c.difficulty ?? "medium",
-            estimatedRewardNook: c.estimatedRewardNook ?? 0,
-            sourceType: c.sourceType ?? "embedding_generation",
-        }, "embedding"));
-    }
-    async discoverRlm() {
-        const data = await this.connection.request("GET", "/v1/mining/challenges?status=open&sourceType=rlm_trajectory&limit=20");
-        return (data.challenges ?? []).map((c) => this.toSummary(c, "rlm"));
-    }
-    toSummary(c, track) {
-        return {
-            id: c.id,
-            track,
-            title: c.title,
-            description: c.description,
-            difficulty: c.difficulty ?? "medium",
-            estimatedRewardNook: c.estimatedRewardNook ?? 0,
-            domainTags: c.domainTags ?? [],
-            sourceType: c.sourceType,
-            closesAt: c.closesAt,
-        };
-    }
-    // ─── Internal: per-track solvers ──────────────────────────────────────
-    async solveOne(challenge, opts, budget) {
-        const log = opts.log ?? (() => undefined);
-        if (opts.dryRun) {
-            log(`[mining][dry-run] would solve ${challenge.track}/${challenge.id} (${challenge.title.slice(0, 60)})`);
-            return { track: challenge.track, challengeId: challenge.id, status: "skipped", reason: "dry-run", estimatedRewardNook: challenge.estimatedRewardNook };
-        }
-        try {
-            if (challenge.track === "knowledge") {
-                return await this.solveKnowledgeChallenge(challenge, opts, budget);
-            }
-            if (challenge.track === "embedding") {
-                return await this.solveEmbeddingChallenge(challenge, opts, budget);
-            }
-            if (challenge.track === "rlm") {
-                return await this.solveRlmChallenge(challenge, opts, budget);
-            }
-            return { track: challenge.track, challengeId: challenge.id, status: "skipped", reason: "no solver for track" };
-        }
-        catch (err) {
-            const msg = err instanceof Error ? err.message : String(err);
-            log(`[mining][error] solver ${challenge.track}/${challenge.id}: ${msg}`);
-            return { track: challenge.track, challengeId: challenge.id, status: "error", reason: msg };
-        }
-    }
-    async solveKnowledgeChallenge(challenge, opts, budget) {
-        const trace = opts.solveKnowledge
-            ? await opts.solveKnowledge(challenge, this.economy)
-            : await this.defaultKnowledgeSolver(challenge);
-        if (!trace || trace.length < 50) {
-            return { track: "knowledge", challengeId: challenge.id, status: "skipped", reason: "trace too short" };
-        }
-        const submission = await this.connection.request("POST", `/v1/mining/submissions/${encodeURIComponent(challenge.id)}`, { traceContent: trace, guildId: opts.guildId });
-        // Gateway is the authoritative deductor; this estimate exists only so the
-        // local --max-credits cap trips before sending too many submissions.
-        budget.creditsSpent += BUDGET_COST_KNOWLEDGE_SUBMIT;
-        return {
-            track: "knowledge",
-            challengeId: challenge.id,
-            status: "submitted",
-            submissionId: submission.submissionId,
-            estimatedRewardNook: challenge.estimatedRewardNook,
-        };
-    }
-    async defaultKnowledgeSolver(challenge) {
-        const prompt = [
-            `Solve the following reasoning challenge. Show your full reasoning trace.`,
-            ``,
-            `Title: ${challenge.title}`,
-            challenge.description ? `Description: ${challenge.description}` : ``,
-            ``,
-            `Domains: ${challenge.domainTags.join(", ") || "general"}`,
-            `Difficulty: ${challenge.difficulty}`,
-        ].join("\n");
-        const result = await this.economy.inference([{ role: "user", content: prompt }], { temperature: 0.4 });
-        return (result.content ?? "").trim();
-    }
-    async solveEmbeddingChallenge(challenge, opts, budget) {
-        if (!opts.generateEmbeddings) {
-            return { track: "embedding", challengeId: challenge.id, status: "skipped", reason: "no generateEmbeddings callback provided" };
-        }
-        const detail = await this.connection.request("GET", `/v1/mining/embedding-challenges/${encodeURIComponent(challenge.id)}`);
-        const prompts = detail.prompts ?? [];
-        const dimensions = detail.dimensions ?? 768;
-        if (prompts.length === 0) {
-            return { track: "embedding", challengeId: challenge.id, status: "skipped", reason: "challenge has no prompts" };
-        }
-        const vectors = await opts.generateEmbeddings(prompts, dimensions);
-        if (vectors.length !== prompts.length) {
-            return { track: "embedding", challengeId: challenge.id, status: "error", reason: `vector count mismatch (got ${vectors.length}, expected ${prompts.length})` };
-        }
-        const submission = await this.connection.request("POST", `/v1/mining/embedding-challenges/${encodeURIComponent(challenge.id)}/submit`, { vectors, guildId: opts.guildId });
-        budget.creditsSpent += BUDGET_COST_EMBEDDING_SUBMIT;
-        return {
-            track: "embedding",
-            challengeId: challenge.id,
-            status: "submitted",
-            submissionId: submission.submissionId,
-            estimatedRewardNook: challenge.estimatedRewardNook,
-        };
-    }
-    async solveRlmChallenge(challenge, opts, _budget) {
-        if (opts.solveRlm)
-            return opts.solveRlm(challenge, this.economy);
-        // Default behaviour: skip with a clear "deferred" reason. Full RLM
-        // autosolve requires an LLM that can plan REPL steps — a future phase
-        // ships that. CLI users with a custom solver can pass `solveRlm` here.
-        return {
-            track: "rlm",
-            challengeId: challenge.id,
-            status: "skipped",
-            reason: "RLM autosolve deferred — pass `solveRlm` to mine the RLM track",
-            estimatedRewardNook: challenge.estimatedRewardNook,
-        };
-    }
-}
-function sleep(ms) {
-    return new Promise((resolve) => setTimeout(resolve, ms));
-}
-//# sourceMappingURL=mining.js.map

package/dist/mining.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mining.js","sourceRoot":"","sources":["../src/mining.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAsGH,MAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,MAAM,mBAAmB,GAAG,IAAI,CAAC;AAEjC;;;;;;GAMG;AACH,MAAM,4BAA4B,GAAG,EAAE,CAAC;AACxC,MAAM,4BAA4B,GAAG,CAAC,CAAC;AAEvC,MAAM,eAAe,GAA2B;IAC9C,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;CACV,CAAC;AAEF,2EAA2E;AAE3E,MAAM,UAAU,OAAO,CAAC,UAAkB;IACxC,IAAI,UAAU,KAAK,sBAAsB;QAAE,OAAO,WAAW,CAAC;IAC9D,IAAI,UAAU,KAAK,gBAAgB,IAAI,UAAU,KAAK,WAAW;QAAE,OAAO,KAAK,CAAC;IAChF,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,2EAA2E;AAE3E,MAAM,OAAO,aAAa;IACP,UAAU,CAAoB;IAC9B,OAAO,CAAiB;IACjC,aAAa,GAAyB,IAAI,CAAC;IAEnD,YAAY,UAA6B,EAAE,OAAuB;QAChE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK,CAAC,OAA2B,EAAE;QACvC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC7B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO,CAAC,OAA0B,EAAE;QACxC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,sDAAsD;IACtD,KAAK;QACH,OAAO,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC;IAC7C,CAAC;IAED,yEAAyE;IAEjE,WAAW,CAAC,IAAwB;QAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,IAAI,eAAe,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,mBAAmB,CAAC;QAC1D,MAAM,KAAK,GAAgB;YACzB,KAAK,EAAE,CAAC;YACR,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;YACT,YAAY,EAAE,CAAC;YACf,OAAO,EAAE;gBACP,SAAS,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;gBACpD,SAAS,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;gBACpD,GAAG,EAAQ,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;gBACpD,QAAQ,EAAG,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;aACrD;SACF,CAAC;QACF,MAAM,MAAM,GAAG,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;QACnC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,WAAuB,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE,GAAG,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAExE,MAAM,OAAO,GAAG,KAAK,IAAmB,EAAE;YACxC,OAAO,CAAC,OAAO,EAAE,CAAC;gBAChB,KAAK,CAAC,KAAK,EAAE,CAAC;gBACd,IAAI,CAAC;oBACH,IAAI,MAAM,CAAC,YAAY,IAAI,UAAU,EAAE,CAAC;wBACtC,GAAG,CAAC,8BAA8B,MAAM,CAAC,YAAY,IAAI,UAAU,sBAAsB,CAAC,CAAC;wBAC3F,MAAM;oBACR,CAAC;oBACD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;oBAC9C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;wBACxB,KAAK,CAAC,SAAS,EAAE,CAAC;wBAClB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;wBACnC,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;4BAC7B,KAAK,CAAC,SAAS,EAAE,CAAC;4BAClB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;wBACrC,CAAC;6BAAM,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;4BAClC,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;gCAAE,KAAK,CAAC,MAAM,EAAE,CAAC;;gCACtC,KAAK,CAAC,OAAO,EAAE,CAAC;wBACvB,CAAC;6BAAM,CAAC;4BACN,KAAK,CAAC,MAAM,EAAE,CAAC;4BACf,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;wBAClC,CAAC;oBACH,CAAC;oBACD,KAAK,CAAC,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;oBACzC,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBACtC,GAAG,CAAC,uDAAuD,CAAC,CAAC;wBAC7D,MAAM;oBACR,CAAC;oBACD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;wBACd,mEAAmE;wBACnE,mCAAmC;wBACnC,SAAS;oBACX,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,GAAG,CAAC,gCAAgC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACxF,KAAK,CAAC,MAAM,EAAE,CAAC;gBACjB,CAAC;gBACD,IAAI,OAAO;oBAAE,MAAM;gBACnB,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;YACD,WAAW,EAAE,CAAC;QAChB,CAAC,CAAC;QAEF,KAAK,OAAO,EAAE,CAAC;QAEf,OAAO;YACL,IAAI;YACJ,IAAI,EAAE,KAAK,IAAI,EAAE;gBACf,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM,IAAI,CAAC;gBACX,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;YAC5B,CAAC;YACD,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;SAC3D,CAAC;IACJ,CAAC;IAED,yEAAyE;IAEjE,KAAK,CAAC,IAAI,CAAC,IAAuB,EAAE,MAAgC;QAC1E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,GAAG,CAAC,4CAA4C,CAAC,CAAC;YAClD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,yDAAyD;QACzD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,GAAG,CAAC,mDAAmD,CAAC,CAAC;YACzD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,2EAA2E;QAC3E,wEAAwE;QACxE,yEAAyE;QACzE,MAAM,MAAM,GAAG,UAAU;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,mBAAmB,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;aAC/F,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC;QAE3D,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACnC,GAAG,CAAC,kBAAkB,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,mBAAmB,eAAe,CAAC,CAAC,UAAU,UAAU,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;YAC3H,CAAC;QACH,CAAC;QAED,0EAA0E;QAC1E,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QACtD,OAAO,CAAC,MAAM,CAAC,CAAC;IAClB,CAAC;IAED,yEAAyE;IAEjE,KAAK,CAAC,aAAa,CAAC,KAAmC;QAC7D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACvC,0EAA0E;QAC1E,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAEtC,KAAK,EAAE,kEAAkE,CAAC,CAAC;YAC9E,OAAO,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACvE,CAAC;QAAC,MAAM,CAAC;YACP,yCAAyC;YACzC,OAAO,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,yEAAyE;IAEjE,KAAK,CAAC,cAAc,CAAC,MAAqB;QAChD,MAAM,OAAO,GAAuB,EAAE,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC;gBACH,IAAI,KAAK,KAAK,WAAW,EAAE,CAAC;oBAC1B,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC;gBAClD,CAAC;qBAAM,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;gBAC5C,CAAC;qBAAM,IAAI,KAAK,KAAK,WAAW,EAAE,CAAC;oBACjC,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,sEAAsE;gBACtE,yBAAyB;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,KAAK,CAAC,iBAAiB;QAC7B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAGpC,KAAK,EAAE,4CAA4C,CAAC,CAAC;QAC3D,OAAO,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;YAC5B,mDAAmD;aAClD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,WAAW,CAAC;aACpD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;IAChD,CAAC;IAEO,KAAK,CAAC,iBAAiB;QAC7B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAGpC,KAAK,EAAE,sDAAsD,CAAC,CAAC;QACrE,OAAO,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC;YACvD,GAAG,CAAC;YACJ,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,QAAQ;YACpC,mBAAmB,EAAE,CAAC,CAAC,mBAAmB,IAAI,CAAC;YAC/C,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,sBAAsB;SACnD,EAAE,WAAW,CAAC,CAAC,CAAC;IACnB,CAAC;IAEO,KAAK,CAAC,WAAW;QACvB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAGpC,KAAK,EAAE,sEAAsE,CAAC,CAAC;QACrF,OAAO,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IACtE,CAAC;IAEO,SAAS,CAAC,CAGjB,EAAE,KAAkB;QACnB,OAAO;YACL,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK;YACL,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,UAAU,EAAG,CAAC,CAAC,UAA6C,IAAI,QAAQ;YACxE,mBAAmB,EAAE,CAAC,CAAC,mBAAmB,IAAI,CAAC;YAC/C,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,EAAE;YAC9B,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,QAAQ,EAAE,CAAC,CAAC,QAAQ;SACrB,CAAC;IACJ,CAAC;IAED,yEAAyE;IAEjE,KAAK,CAAC,QAAQ,CACpB,SAA2B,EAC3B,IAAuB,EACvB,MAAgC;QAEhC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,GAAG,CAAC,iCAAiC,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;YAC1G,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,mBAAmB,EAAE,SAAS,CAAC,mBAAmB,EAAE,CAAC;QACzJ,CAAC;QACD,IAAI,CAAC;YACH,IAAI,SAAS,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;gBACpC,OAAO,MAAM,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,SAAS,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;gBACpC,OAAO,MAAM,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACrE,CAAC;YACD,IAAI,SAAS,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;gBAC9B,OAAO,MAAM,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YAC/D,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,qBAAqB,EAAE,CAAC;QACjH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,GAAG,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC7D,GAAG,CAAC,0BAA0B,SAAS,CAAC,KAAK,IAAI,SAAS,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC,CAAC;YACzE,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;QAC7F,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,uBAAuB,CACnC,SAA2B,EAC3B,IAAuB,EACvB,MAAgC;QAEhC,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc;YAC/B,CAAC,CAAC,MAAM,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC;YACpD,CAAC,CAAC,MAAM,IAAI,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YAChC,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;QACzG,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAC9C,MAAM,EACN,0BAA0B,kBAAkB,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAC5D,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAC/C,CAAC;QACF,0EAA0E;QAC1E,qEAAqE;QACrE,MAAM,CAAC,YAAY,IAAI,4BAA4B,CAAC;QACpD,OAAO;YACL,KAAK,EAAE,WAAW;YAClB,WAAW,EAAE,SAAS,CAAC,EAAE;YACzB,MAAM,EAAE,WAAW;YACnB,YAAY,EAAE,UAAU,CAAC,YAAY;YACrC,mBAAmB,EAAE,SAAS,CAAC,mBAAmB;SACnD,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,sBAAsB,CAAC,SAA2B;QAC9D,MAAM,MAAM,GAAG;YACb,0EAA0E;YAC1E,EAAE;YACF,UAAU,SAAS,CAAC,KAAK,EAAE;YAC3B,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE;YACpE,EAAE;YACF,YAAY,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE;YAC1D,eAAe,SAAS,CAAC,UAAU,EAAE;SACtC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;QACvG,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACvC,CAAC;IAEO,KAAK,CAAC,uBAAuB,CACnC,SAA2B,EAC3B,IAAuB,EACvB,MAAgC;QAEhC,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC7B,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,yCAAyC,EAAE,CAAC;QACjI,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAEzC,KAAK,EAAE,mCAAmC,kBAAkB,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACjF,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;QACrC,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,GAAG,CAAC;QAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,0BAA0B,EAAE,CAAC;QAClH,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACnE,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;YACtC,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,8BAA8B,OAAO,CAAC,MAAM,cAAc,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;QACjK,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAC9C,MAAM,EACN,mCAAmC,kBAAkB,CAAC,SAAS,CAAC,EAAE,CAAC,SAAS,EAC5E,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CACnC,CAAC;QACF,MAAM,CAAC,YAAY,IAAI,4BAA4B,CAAC;QACpD,OAAO;YACL,KAAK,EAAE,WAAW;YAClB,WAAW,EAAE,SAAS,CAAC,EAAE;YACzB,MAAM,EAAE,WAAW;YACnB,YAAY,EAAE,UAAU,CAAC,YAAY;YACrC,mBAAmB,EAAE,SAAS,CAAC,mBAAmB;SACnD,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,iBAAiB,CAC7B,SAA2B,EAC3B,IAAwB,EACxB,OAAiC;QAEjC,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACjE,mEAAmE;QACnE,sEAAsE;QACtE,uEAAuE;QACvE,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,WAAW,EAAE,SAAS,CAAC,EAAE;YACzB,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,gEAAgE;YACxE,mBAAmB,EAAE,SAAS,CAAC,mBAAmB;SACnD,CAAC;IACJ,CAAC;CACF;AAED,SAAS,KAAK,CAAC,EAAU;IACvB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC"}

package/dist/presetLoader.d.ts

@@ -1,130 +0,0 @@
-/**
- * PresetLoader — loads forge preset data into agent memory at boot.
- *
- * Reads the preset section of nookplot.yaml, fetches data per source via
- * the gateway's forge data endpoint, runs content scanning, and ingests
- * items as preset-tagged memories. Supports layered ingestion: RAG when
- * available, memory.import() fallback.
- *
- * Features:
- * - Content scanning (sanitizeForPrompt) on every item
- * - Idempotent loading via .preset-loaded.json manifest
- * - Configurable failure policy (abort / continue / retry)
- * - Boot progress events via EventEmitter
- * - Self-awareness memory generation
- *
- * @module presetLoader
- */
-import { EventEmitter } from "node:events";
-import type { NookplotRuntime } from "./index.js";
-export interface PresetConfig {
-    id: string;
-    version?: number;
-    trustLevel?: "verified" | "scanned" | "raw";
-    failurePolicy?: "abort" | "continue";
-    maxCostNook?: number;
-    sources?: Array<{
-        type: string;
-        label?: string;
-        config: Record<string, unknown>;
-    }>;
-}
-export interface PresetLoadResult {
-    sources: Array<{
-        type: string;
-        label: string;
-        itemsLoaded: number;
-        itemsBlocked: number;
-        itemsSkipped: number;
-        method: "memory" | "rag" | "prompt";
-        status: "loaded" | "partial" | "failed";
-        error?: string;
-        costNook: number;
-    }>;
-    totalItems: number;
-    totalBlocked: number;
-    totalCostNook: number;
-    ragAvailable: boolean;
-    presetVersion: number;
-    loadedAt: string;
-}
-export type PresetLoadEvent = {
-    phase: "estimating";
-    message: string;
-} | {
-    phase: "fetching";
-    source: string;
-    progress: string;
-} | {
-    phase: "scanning";
-    source: string;
-    blocked: number;
-} | {
-    phase: "ingesting";
-    source: string;
-    method: "memory" | "rag";
-} | {
-    phase: "complete";
-    result: PresetLoadResult;
-} | {
-    phase: "error";
-    source: string;
-    error: string;
-};
-export declare class PresetLoader extends EventEmitter {
-    private runtime;
-    private configPath;
-    private loading;
-    constructor(runtime: NookplotRuntime, configPath?: string);
-    /**
-     * Build x-preset-hmac header so the gateway trusts isPreset/presetId fields.
-     * HMAC = SHA-256(apiKey, "preset-ingest:" + agent_address).
-     */
-    private presetIngestHeaders;
-    /**
-     * Load all preset data sources. Called once at agent boot.
-     * Concurrent calls are coalesced — only the first triggers a fetch,
-     * subsequent callers await the same promise (prevents double-pay).
-     */
-    load(): Promise<PresetLoadResult>;
-    private _doLoad;
-    /**
-     * Check if preset data was already loaded (idempotent reboot check).
-     */
-    isLoaded(): Promise<boolean>;
-    /**
-     * Map preset source type to knowledge graph knowledge_type.
-     */
-    private mapSourceToKnowledgeType;
-    /**
-     * Map preset source type to knowledge graph source_type.
-     */
-    private mapSourceToKGSourceType;
-    /**
-     * Ingest a KnowledgeAggregateV1 into the knowledge graph as structured items.
-     * Same decomposition as ingestAggregate but targets the KG endpoint.
-     */
-    private ingestAggregateToKG;
-    /**
-     * Ingest a KnowledgeAggregateV1 as structured memories.
-     * Uses 5-7x fewer memory slots than equivalent raw traces:
-     * - Synthesis → semantic memory (importance 0.9)
-     * - Each keyInsight → procedural memory (confidence-weighted)
-     * - Each reasoning pattern → procedural memory
-     * - Contradictions → self_model memory
-     *
-     * Returns the number of memories stored.
-     */
-    private ingestAggregate;
-    private readConfig;
-    private readManifest;
-    private writeManifest;
-    /**
-     * Lightweight client-side severity assessment.
-     * Full ContentScanner runs server-side; this is a first pass.
-     */
-    private assessSeverity;
-    private emptyResult;
-    private manifestToResult;
-}
-//# sourceMappingURL=presetLoader.d.ts.map

package/dist/presetLoader.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"presetLoader.d.ts","sourceRoot":"","sources":["../src/presetLoader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE3C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAKlD,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,UAAU,GAAG,SAAS,GAAG,KAAK,CAAC;IAC5C,aAAa,CAAC,EAAE,OAAO,GAAG,UAAU,CAAC;IACrC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,KAAK,CAAC;QACd,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACjC,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,KAAK,CAAC;QACb,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,WAAW,EAAE,MAAM,CAAC;QACpB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,MAAM,EAAE,QAAQ,GAAG,KAAK,GAAG,QAAQ,CAAC;QACpC,MAAM,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,CAAC;QACxC,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,QAAQ,EAAE,MAAM,CAAC;KAClB,CAAC,CAAC;IACH,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,OAAO,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,eAAe,GACvB;IAAE,KAAK,EAAE,YAAY,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACxC;IAAE,KAAK,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GACvD;IAAE,KAAK,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACtD;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,QAAQ,GAAG,KAAK,CAAA;CAAE,GAChE;IAAE,KAAK,EAAE,UAAU,CAAC;IAAC,MAAM,EAAE,gBAAgB,CAAA;CAAE,GAC/C;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AActD,qBAAa,YAAa,SAAQ,YAAY;IAC5C,OAAO,CAAC,OAAO,CAAkB;IACjC,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,OAAO,CAA0C;gBAE7C,OAAO,EAAE,eAAe,EAAE,UAAU,SAAoB;IAMpE;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAQ3B;;;;OAIG;IACG,IAAI,IAAI,OAAO,CAAC,gBAAgB,CAAC;YAUzB,OAAO;IAiVrB;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,OAAO,CAAC;IAWlC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAWhC;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAW/B;;;OAGG;YACW,mBAAmB;IAwIjC;;;;;;;;;OASG;YACW,eAAe;YAgHf,UAAU;YAYV,YAAY;YASZ,aAAa;IAQ3B;;;OAGG;IACH,OAAO,CAAC,cAAc;IAoBtB,OAAO,CAAC,WAAW;IAYnB,OAAO,CAAC,gBAAgB;CAWzB"}