@elizaos/agent 2.0.0-alpha.98 → 2.0.0-beta.2

package/packages/agent/src/api/knowledge-service-loader.d.ts

@@ -1,51 +0,0 @@
-import type { AgentRuntime, Memory, UUID } from "@elizaos/core";
-export interface KnowledgeServiceLike {
-    addKnowledge(options: {
-        agentId?: UUID;
-        worldId: UUID;
-        roomId: UUID;
-        entityId: UUID;
-        clientDocumentId: UUID;
-        contentType: string;
-        originalFilename: string;
-        content: string;
-        metadata?: Record<string, unknown>;
-    }): Promise<{
-        clientDocumentId: string;
-        storedDocumentMemoryId: UUID;
-        fragmentCount: number;
-    }>;
-    getKnowledge(message: Memory, scope?: {
-        roomId?: UUID;
-        worldId?: UUID;
-        entityId?: UUID;
-    }): Promise<Array<{
-        id: UUID;
-        content: {
-            text?: string;
-        };
-        similarity?: number;
-        metadata?: Record<string, unknown>;
-    }>>;
-    getMemories(params: {
-        tableName: string;
-        roomId?: UUID;
-        count?: number;
-        offset?: number;
-        end?: number;
-    }): Promise<Memory[]>;
-    countMemories(params: {
-        tableName: string;
-        roomId?: UUID;
-        unique?: boolean;
-    }): Promise<number>;
-    deleteMemory(memoryId: UUID): Promise<void>;
-}
-export type KnowledgeLoadFailReason = "timeout" | "runtime_unavailable" | "not_registered";
-export interface KnowledgeServiceResult {
-    service: KnowledgeServiceLike | null;
-    reason?: KnowledgeLoadFailReason;
-}
-export declare function getKnowledgeTimeoutMs(): number;
-export declare function getKnowledgeService(runtime: AgentRuntime | null): Promise<KnowledgeServiceResult>;
-//# sourceMappingURL=knowledge-service-loader.d.ts.map

package/packages/agent/src/api/knowledge-service-loader.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"knowledge-service-loader.d.ts","sourceRoot":"","sources":["../../../../../src/api/knowledge-service-loader.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,EAAW,IAAI,EAAE,MAAM,eAAe,CAAC;AAEzE,MAAM,WAAW,oBAAoB;IACnC,YAAY,CAAC,OAAO,EAAE;QACpB,OAAO,CAAC,EAAE,IAAI,CAAC;QACf,OAAO,EAAE,IAAI,CAAC;QACd,MAAM,EAAE,IAAI,CAAC;QACb,QAAQ,EAAE,IAAI,CAAC;QACf,gBAAgB,EAAE,IAAI,CAAC;QACvB,WAAW,EAAE,MAAM,CAAC;QACpB,gBAAgB,EAAE,MAAM,CAAC;QACzB,OAAO,EAAE,MAAM,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACpC,GAAG,OAAO,CAAC;QACV,gBAAgB,EAAE,MAAM,CAAC;QACzB,sBAAsB,EAAE,IAAI,CAAC;QAC7B,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC,CAAC;IACH,YAAY,CACV,OAAO,EAAE,MAAM,EACf,KAAK,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,IAAI,CAAC;QAAC,OAAO,CAAC,EAAE,IAAI,CAAC;QAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;KAAE,GACzD,OAAO,CACR,KAAK,CAAC;QACJ,EAAE,EAAE,IAAI,CAAC;QACT,OAAO,EAAE;YAAE,IAAI,CAAC,EAAE,MAAM,CAAA;SAAE,CAAC;QAC3B,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACpC,CAAC,CACH,CAAC;IACF,WAAW,CAAC,MAAM,EAAE;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,MAAM,CAAC,EAAE,IAAI,CAAC;QACd,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,GAAG,CAAC,EAAE,MAAM,CAAC;KACd,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACtB,aAAa,CAAC,MAAM,EAAE;QACpB,SAAS,EAAE,MAAM,CAAC;QAClB,MAAM,CAAC,EAAE,IAAI,CAAC;QACd,MAAM,CAAC,EAAE,OAAO,CAAC;KAClB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IACpB,YAAY,CAAC,QAAQ,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC7C;AAED,MAAM,MAAM,uBAAuB,GAC/B,SAAS,GACT,qBAAqB,GACrB,gBAAgB,CAAC;AAErB,MAAM,WAAW,sBAAsB;IACrC,OAAO,EAAE,oBAAoB,GAAG,IAAI,CAAC;IACrC,MAAM,CAAC,EAAE,uBAAuB,CAAC;CAClC;AAKD,wBAAgB,qBAAqB,IAAI,MAAM,CAM9C;AAED,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,YAAY,GAAG,IAAI,GAC3B,OAAO,CAAC,sBAAsB,CAAC,CAwBjC"}

package/packages/agent/src/api/merkle-tree.d.ts

@@ -1,90 +0,0 @@
-/**
- * Merkle tree service for whitelist proof generation.
- *
- * Builds a Merkle tree from verified addresses in whitelist.json and
- * generates proofs that can be submitted to the smart contract's
- * `mintWhitelist(name, endpoint, capHash, proof[])` function.
- *
- * This is the missing bridge between:
- *   whitelist.json  →  Merkle tree  →  on-chain mintWhitelist()
- *
- * The contract stores a `merkleRoot()` and verifies each mint against
- * a proof derived from the caller's address.
- *
- * Standard: leaves = keccak256(abi.encodePacked(address))
- *           sorted pairs to ensure deterministic tree construction.
- *
- * @see drop-service.ts  — mintWithWhitelist() consumer
- * @see twitter-verify.ts — one source of whitelist addresses
- * @see nft-verify.ts     — another source of whitelist addresses
- */
-export interface MerkleProofResult {
-    /** The proof array (bytes32[]) to submit to mintWhitelist(). */
-    proof: string[];
-    /** The leaf hash for this address. */
-    leaf: string;
-    /** The root of the current tree. */
-    root: string;
-    /** Whether this address is in the tree. */
-    isWhitelisted: boolean;
-}
-export interface MerkleTreeInfo {
-    /** The root hash of the current tree. */
-    root: string;
-    /** Total number of addresses in the tree. */
-    addressCount: number;
-    /** All leaf hashes (sorted). */
-    leaves: string[];
-}
-/**
- * Hash an address into a Merkle leaf.
- *
- * Uses `keccak256(abi.encodePacked(address))` — the standard Solidity
- * pattern for OpenZeppelin MerkleProof verification.
- */
-export declare function hashLeaf(address: string): string;
-/**
- * Build a Merkle tree from an array of leaf hashes.
- *
- * Returns the tree as a 2D array where:
- *   tree[0] = leaves (sorted)
- *   tree[1] = first level of internal nodes
- *   ...
- *   tree[tree.length - 1] = [root]
- *
- * Leaves are sorted before building to ensure determinism.
- */
-export declare function buildTree(leaves: string[]): string[][];
-/**
- * Get the proof (sibling path) for a leaf in the tree.
- */
-export declare function getProof(tree: string[][], leaf: string): string[];
-/**
- * Get the root of the tree.
- */
-export declare function getRoot(tree: string[][]): string;
-/**
- * Verify a proof against a root.
- *
- * Recomputes the root from the leaf + proof path and checks
- * if it matches the expected root.
- */
-export declare function verifyProof(leaf: string, proof: string[], expectedRoot: string): boolean;
-/**
- * Build a Merkle tree from the current whitelist.
- *
- * Reads all verified addresses from whitelist.json, hashes them into
- * leaves, and builds the tree.
- */
-export declare function buildWhitelistTree(): {
-    tree: string[][];
-    info: MerkleTreeInfo;
-};
-/**
- * Generate a Merkle proof for a specific address.
- *
- * Returns the proof, leaf, root, and whether the address is whitelisted.
- * The proof can be passed directly to `mintWhitelist()` on the contract.
- */
-export declare function generateProof(walletAddress: string): MerkleProofResult;
-//# sourceMappingURL=merkle-tree.d.ts.map

package/packages/agent/src/api/merkle-tree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"merkle-tree.d.ts","sourceRoot":"","sources":["../../../../../src/api/merkle-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAQH,MAAM,WAAW,iBAAiB;IAChC,gEAAgE;IAChE,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,sCAAsC;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,2CAA2C;IAC3C,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,cAAc;IAC7B,yCAAyC;IACzC,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,YAAY,EAAE,MAAM,CAAC;IACrB,gCAAgC;IAChC,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAID;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAKhD;AAoBD;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CA4BtD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAmBjE;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,CAEhD;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EAAE,EACf,YAAY,EAAE,MAAM,GACnB,OAAO,CAMT;AAID;;;;;GAKG;AACH,wBAAgB,kBAAkB,IAAI;IACpC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;IACjB,IAAI,EAAE,cAAc,CAAC;CACtB,CAmBA;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,aAAa,EAAE,MAAM,GAAG,iBAAiB,CA8BtE"}

package/packages/agent/src/api/merkle-tree.js

@@ -1,174 +0,0 @@
-/**
- * Merkle tree service for whitelist proof generation.
- *
- * Builds a Merkle tree from verified addresses in whitelist.json and
- * generates proofs that can be submitted to the smart contract's
- * `mintWhitelist(name, endpoint, capHash, proof[])` function.
- *
- * This is the missing bridge between:
- *   whitelist.json  →  Merkle tree  →  on-chain mintWhitelist()
- *
- * The contract stores a `merkleRoot()` and verifies each mint against
- * a proof derived from the caller's address.
- *
- * Standard: leaves = keccak256(abi.encodePacked(address))
- *           sorted pairs to ensure deterministic tree construction.
- *
- * @see drop-service.ts  — mintWithWhitelist() consumer
- * @see twitter-verify.ts — one source of whitelist addresses
- * @see nft-verify.ts     — another source of whitelist addresses
- */
-import { logger } from "@elizaos/core";
-import { ethers } from "ethers";
-import { getVerifiedAddresses } from "./twitter-verify";
-// ── Leaf hashing ─────────────────────────────────────────────────────────
-/**
- * Hash an address into a Merkle leaf.
- *
- * Uses `keccak256(abi.encodePacked(address))` — the standard Solidity
- * pattern for OpenZeppelin MerkleProof verification.
- */
-export function hashLeaf(address) {
-    return ethers.solidityPackedKeccak256(["address"], [ethers.getAddress(address)]);
-}
-// ── Merkle tree construction ─────────────────────────────────────────────
-/**
- * Sort a pair of hashes for deterministic tree construction.
- * This ensures the tree is the same regardless of insertion order.
- */
-function sortPair(a, b) {
-    return a.toLowerCase() < b.toLowerCase() ? [a, b] : [b, a];
-}
-/**
- * Hash two nodes together (internal node).
- */
-function hashPair(a, b) {
-    const [left, right] = sortPair(a, b);
-    return ethers.solidityPackedKeccak256(["bytes32", "bytes32"], [left, right]);
-}
-/**
- * Build a Merkle tree from an array of leaf hashes.
- *
- * Returns the tree as a 2D array where:
- *   tree[0] = leaves (sorted)
- *   tree[1] = first level of internal nodes
- *   ...
- *   tree[tree.length - 1] = [root]
- *
- * Leaves are sorted before building to ensure determinism.
- */
-export function buildTree(leaves) {
-    if (leaves.length === 0) {
-        return [[`0x${"0".repeat(64)}`]]; // empty tree → zero root
-    }
-    // Sort leaves for deterministic construction
-    const sorted = [...leaves].sort((a, b) => a.toLowerCase().localeCompare(b.toLowerCase()));
-    const tree = [sorted];
-    let currentLevel = sorted;
-    while (currentLevel.length > 1) {
-        const nextLevel = [];
-        for (let i = 0; i < currentLevel.length; i += 2) {
-            if (i + 1 < currentLevel.length) {
-                nextLevel.push(hashPair(currentLevel[i], currentLevel[i + 1]));
-            }
-            else {
-                // Odd node: promote to next level (no sibling)
-                nextLevel.push(currentLevel[i]);
-            }
-        }
-        tree.push(nextLevel);
-        currentLevel = nextLevel;
-    }
-    return tree;
-}
-/**
- * Get the proof (sibling path) for a leaf in the tree.
- */
-export function getProof(tree, leaf) {
-    const proof = [];
-    let index = tree[0].indexOf(leaf);
-    if (index === -1)
-        return []; // leaf not in tree
-    for (let level = 0; level < tree.length - 1; level++) {
-        const currentLevel = tree[level];
-        const isRightNode = index % 2 === 1;
-        const siblingIndex = isRightNode ? index - 1 : index + 1;
-        if (siblingIndex < currentLevel.length) {
-            proof.push(currentLevel[siblingIndex]);
-        }
-        index = Math.floor(index / 2);
-    }
-    return proof;
-}
-/**
- * Get the root of the tree.
- */
-export function getRoot(tree) {
-    return tree[tree.length - 1][0];
-}
-/**
- * Verify a proof against a root.
- *
- * Recomputes the root from the leaf + proof path and checks
- * if it matches the expected root.
- */
-export function verifyProof(leaf, proof, expectedRoot) {
-    let computed = leaf;
-    for (const sibling of proof) {
-        computed = hashPair(computed, sibling);
-    }
-    return computed.toLowerCase() === expectedRoot.toLowerCase();
-}
-// ── High-level API ───────────────────────────────────────────────────────
-/**
- * Build a Merkle tree from the current whitelist.
- *
- * Reads all verified addresses from whitelist.json, hashes them into
- * leaves, and builds the tree.
- */
-export function buildWhitelistTree() {
-    const addresses = getVerifiedAddresses();
-    const leaves = addresses.map((addr) => hashLeaf(addr));
-    const tree = buildTree(leaves);
-    const root = getRoot(tree);
-    logger.info(`[merkle] Built whitelist tree with ${addresses.length} addresses (root: ${root.slice(0, 10)}...)`);
-    return {
-        tree,
-        info: {
-            root,
-            addressCount: addresses.length,
-            leaves: tree[0],
-        },
-    };
-}
-/**
- * Generate a Merkle proof for a specific address.
- *
- * Returns the proof, leaf, root, and whether the address is whitelisted.
- * The proof can be passed directly to `mintWhitelist()` on the contract.
- */
-export function generateProof(walletAddress) {
-    const { tree, info } = buildWhitelistTree();
-    let leaf;
-    try {
-        leaf = hashLeaf(walletAddress);
-    }
-    catch {
-        return {
-            proof: [],
-            leaf: `0x${"0".repeat(64)}`,
-            root: info.root,
-            isWhitelisted: false,
-        };
-    }
-    const proof = getProof(tree, leaf);
-    const isWhitelisted = proof.length > 0 || (info.addressCount === 1 && tree[0][0] === leaf);
-    if (isWhitelisted) {
-        const valid = verifyProof(leaf, proof, info.root);
-        if (!valid) {
-            logger.warn(`[merkle] Proof verification failed for ${walletAddress} — tree may be corrupted`);
-            return { proof: [], leaf, root: info.root, isWhitelisted: false };
-        }
-    }
-    return { proof, leaf, root: info.root, isWhitelisted };
-}

package/packages/agent/src/api/og-tracker.d.ts

@@ -1,28 +0,0 @@
-/**
- * OG tracking code system.
- *
- * Silently writes a unique identifier to ~/.eliza/.og on first run.
- * The code is a random UUID. A set of 100 "winning" codes can be
- * generated deterministically from a secret seed (in ElizaMaker scripts).
- * This file is planted now; whitelist eligibility is revealed in a future update.
- */
-/**
- * Write a random tracking UUID to ~/.eliza/.og if it does not already exist.
- * Called once during startup. Silent on failure.
- */
-export declare function initializeOGCode(): void;
-/**
- * Read the stored OG code, or null if it doesn't exist.
- */
-export declare function readOGCode(): string | null;
-/**
- * Generate the set of valid OG codes from a seed.
- * Used in ElizaMaker scripts -- not called in the Eliza app.
- */
-export declare function generateValidCodes(seed: string, count: number): string[];
-/**
- * Check if a given code is in the valid set.
- * Requires the seed to regenerate the valid codes.
- */
-export declare function isValidOGCode(code: string, seed: string, count?: number): boolean;
-//# sourceMappingURL=og-tracker.d.ts.map

package/packages/agent/src/api/og-tracker.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"og-tracker.d.ts","sourceRoot":"","sources":["../../../../../src/api/og-tracker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AASH;;;GAGG;AACH,wBAAgB,gBAAgB,IAAI,IAAI,CAWvC;AAED;;GAEG;AACH,wBAAgB,UAAU,IAAI,MAAM,GAAG,IAAI,CAI1C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAYxE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,KAAK,GAAE,MAAY,GAClB,OAAO,CAGT"}

package/packages/agent/src/api/og-tracker.js

@@ -1,60 +0,0 @@
-/**
- * OG tracking code system.
- *
- * Silently writes a unique identifier to ~/.eliza/.og on first run.
- * The code is a random UUID. A set of 100 "winning" codes can be
- * generated deterministically from a secret seed (in ElizaMaker scripts).
- * This file is planted now; whitelist eligibility is revealed in a future update.
- */
-import crypto from "node:crypto";
-import fs from "node:fs";
-import path from "node:path";
-import { resolveStateDir } from "../config/paths";
-const OG_FILENAME = ".og";
-/**
- * Write a random tracking UUID to ~/.eliza/.og if it does not already exist.
- * Called once during startup. Silent on failure.
- */
-export function initializeOGCode() {
-    const dir = resolveStateDir();
-    const filePath = path.join(dir, OG_FILENAME);
-    if (fs.existsSync(filePath))
-        return;
-    const code = crypto.randomUUID();
-    if (!fs.existsSync(dir)) {
-        fs.mkdirSync(dir, { recursive: true, mode: 0o700 });
-    }
-    fs.writeFileSync(filePath, code, { encoding: "utf-8", mode: 0o600 });
-}
-/**
- * Read the stored OG code, or null if it doesn't exist.
- */
-export function readOGCode() {
-    const filePath = path.join(resolveStateDir(), OG_FILENAME);
-    if (!fs.existsSync(filePath))
-        return null;
-    return fs.readFileSync(filePath, "utf-8").trim();
-}
-/**
- * Generate the set of valid OG codes from a seed.
- * Used in ElizaMaker scripts -- not called in the Eliza app.
- */
-export function generateValidCodes(seed, count) {
-    const codes = [];
-    for (let i = 0; i < count; i++) {
-        const hash = crypto
-            .createHash("sha256")
-            .update(`${seed}:og:${i}`)
-            .digest("hex");
-        codes.push(`${hash.slice(0, 8)}-${hash.slice(8, 12)}-${hash.slice(12, 16)}-${hash.slice(16, 20)}-${hash.slice(20, 32)}`);
-    }
-    return codes;
-}
-/**
- * Check if a given code is in the valid set.
- * Requires the seed to regenerate the valid codes.
- */
-export function isValidOGCode(code, seed, count = 100) {
-    const validCodes = generateValidCodes(seed, count);
-    return validCodes.includes(code);
-}

package/packages/agent/src/api/route-helpers.d.ts

@@ -1,16 +0,0 @@
-import type http from "node:http";
-import type { ReadJsonBodyOptions } from "./http-helpers";
-export interface RouteRequestMeta {
-    req: http.IncomingMessage;
-    res: http.ServerResponse;
-    method: string;
-    pathname: string;
-}
-export interface RouteHelpers {
-    json: (res: http.ServerResponse, data: object, status?: number) => void;
-    error: (res: http.ServerResponse, message: string, status?: number) => void;
-    readJsonBody: <T extends object>(req: http.IncomingMessage, res: http.ServerResponse, options?: ReadJsonBodyOptions) => Promise<T | null>;
-}
-export interface RouteRequestContext extends RouteRequestMeta, RouteHelpers {
-}
-//# sourceMappingURL=route-helpers.d.ts.map

package/packages/agent/src/api/route-helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"route-helpers.d.ts","sourceRoot":"","sources":["../../../../../src/api/route-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAE1D,MAAM,WAAW,gBAAgB;IAC/B,GAAG,EAAE,IAAI,CAAC,eAAe,CAAC;IAC1B,GAAG,EAAE,IAAI,CAAC,cAAc,CAAC;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IACxE,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC5E,YAAY,EAAE,CAAC,CAAC,SAAS,MAAM,EAC7B,GAAG,EAAE,IAAI,CAAC,eAAe,EACzB,GAAG,EAAE,IAAI,CAAC,cAAc,EACxB,OAAO,CAAC,EAAE,mBAAmB,KAC1B,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;CACxB;AAED,MAAM,WAAW,mBAAoB,SAAQ,gBAAgB,EAAE,YAAY;CAAG"}

package/packages/agent/src/api/route-helpers.js

@@ -1 +0,0 @@
-export {};

package/packages/agent/src/api/sandbox-routes.d.ts

@@ -1,12 +0,0 @@
-/** Sandbox capability API routes: status, exec, browser, screen, audio, computer use. */
-import type { IncomingMessage, ServerResponse } from "node:http";
-import type { RemoteSigningService } from "../services/remote-signing-service";
-import type { SandboxManager } from "../services/sandbox-manager";
-interface SandboxRouteState {
-    sandboxManager: SandboxManager | null;
-    signingService?: RemoteSigningService | null;
-}
-/** Returns `true` if handled, `false` to fall through. */
-export declare function handleSandboxRoute(req: IncomingMessage, res: ServerResponse, pathname: string, method: string, state: SandboxRouteState): Promise<boolean>;
-export {};
-//# sourceMappingURL=sandbox-routes.d.ts.map

package/packages/agent/src/api/sandbox-routes.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sandbox-routes.d.ts","sourceRoot":"","sources":["../../../../../src/api/sandbox-routes.ts"],"names":[],"mappings":"AAAA,yFAAyF;AAIzF,OAAO,KAAK,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAGjE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAQlE,UAAU,iBAAiB;IACzB,cAAc,EAAE,cAAc,GAAG,IAAI,CAAC;IACtC,cAAc,CAAC,EAAE,oBAAoB,GAAG,IAAI,CAAC;CAC9C;AAWD,0DAA0D;AAC1D,wBAAsB,kBAAkB,CACtC,GAAG,EAAE,eAAe,EACpB,GAAG,EAAE,cAAc,EACnB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,iBAAiB,GACvB,OAAO,CAAC,OAAO,CAAC,CAsdlB"}