@oobe-protocol-labs/synapse-client-sdk 1.2.1 → 2.0.0

package/dist/cjs/ai/intents/planner.js

@@ -0,0 +1,270 @@
+"use strict";
+/**
+ * @module ai/intents/planner
+ * @description Cross-Protocol Intent Planner — DAG-based execution planning.
+ *
+ * Converts a validated {@link Intent} into an {@link IntentPlan} by:
+ * 1. Building a directed acyclic graph (DAG) from step dependencies
+ * 2. Detecting cycles
+ * 3. Computing topological sort (execution order)
+ * 4. Identifying parallelizable steps
+ * 5. Estimating costs and latencies
+ *
+ * @example
+ * ```ts
+ * import { IntentPlanner } from '@oobe-protocol-labs/synapse-client-sdk/ai';
+ *
+ * const planner = new IntentPlanner();
+ * const plan = planner.plan(parsedIntent);
+ *
+ * console.log(`${plan.totalLevels} execution levels`);
+ * console.log(`Estimated cost: ${plan.estimatedTotalCost}`);
+ *
+ * // View execution order
+ * for (const step of plan.steps) {
+ *   console.log(`[Level ${step.executionOrder}] ${step.id}: ${step.protocol}.${step.method}`);
+ * }
+ * ```
+ *
+ * @since 1.3.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IntentPlanner = void 0;
+const types_1 = require("./types");
+/* ═══════════════════════════════════════════════════════════════
+ *  Cost estimation defaults
+ * ═══════════════════════════════════════════════════════════════ */
+/**
+ * @description Default estimated costs per protocol (in lamports/micro-units).
+ * Used when no custom cost estimator is provided.
+ * @since 1.3.0
+ */
+const DEFAULT_COST_ESTIMATES = {
+    jupiter: 1000n,
+    raydium: 1000n,
+    metaplex: 2000n,
+    native: 500n,
+    marinade: 1500n,
+    jito: 3000n,
+};
+/**
+ * @description Default estimated latencies per protocol (ms).
+ * @since 1.3.0
+ */
+const DEFAULT_LATENCY_ESTIMATES = {
+    jupiter: 2000,
+    raydium: 1500,
+    metaplex: 3000,
+    native: 500,
+    marinade: 2000,
+    jito: 1000,
+};
+/* ═══════════════════════════════════════════════════════════════
+ *  IntentPlanner
+ * ═══════════════════════════════════════════════════════════════ */
+/**
+ * @description Converts validated intents into optimized execution plans.
+ *
+ * The planner performs:
+ * 1. **DAG construction** — edges from each dependency to the dependent step
+ * 2. **Cycle detection** — DFS-based, throws {@link CyclicDependencyError}
+ * 3. **Topological sort** — Kahn's algorithm for deterministic ordering
+ * 4. **Level assignment** — steps at the same level can run in parallel
+ * 5. **Cost estimation** — per-step and total cost/latency estimates
+ *
+ * @since 1.3.0
+ */
+class IntentPlanner {
+    costEstimates;
+    latencyEstimates;
+    maxDepth;
+    /**
+     * @param {PlannerConfig} [config] - Planner configuration
+     */
+    constructor(config) {
+        this.costEstimates = { ...DEFAULT_COST_ESTIMATES, ...config?.costEstimates };
+        this.latencyEstimates = { ...DEFAULT_LATENCY_ESTIMATES, ...config?.latencyEstimates };
+        this.maxDepth = config?.maxDepth ?? 10;
+    }
+    /**
+     * @description Create an execution plan from a validated intent.
+     *
+     * @param {Intent} intent - Validated intent (from {@link IntentParser.parse})
+     * @returns {IntentPlan} Execution plan with topologically sorted steps
+     * @throws {CyclicDependencyError} If the dependency graph contains a cycle
+     * @throws {IntentError} If the DAG exceeds maximum depth
+     *
+     * @example
+     * ```ts
+     * const plan = planner.plan(intent);
+     * if (plan.isValid) {
+     *   for (const step of plan.steps) {
+     *     console.log(`[${step.executionOrder}] ${step.id} (${step.protocol})`);
+     *   }
+     * }
+     * ```
+     *
+     * @since 1.3.0
+     */
+    plan(intent) {
+        const errors = [];
+        const stepMap = new Map();
+        for (const step of intent.steps) {
+            stepMap.set(step.id, step);
+        }
+        // Build adjacency list (deps → step)
+        const adjList = new Map();
+        const inDegree = new Map();
+        for (const step of intent.steps) {
+            if (!adjList.has(step.id))
+                adjList.set(step.id, new Set());
+            if (!inDegree.has(step.id))
+                inDegree.set(step.id, 0);
+            for (const dep of step.dependsOn ?? []) {
+                if (!adjList.has(dep))
+                    adjList.set(dep, new Set());
+                adjList.get(dep).add(step.id);
+                inDegree.set(step.id, (inDegree.get(step.id) ?? 0) + 1);
+            }
+        }
+        // Cycle detection (DFS)
+        this.detectCycles(intent.steps, adjList);
+        // Topological sort (Kahn's algorithm) with level assignment
+        const queue = [];
+        const levels = new Map();
+        for (const [id, degree] of inDegree) {
+            if (degree === 0) {
+                queue.push(id);
+                levels.set(id, 0);
+            }
+        }
+        const sorted = [];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            sorted.push(current);
+            const currentLevel = levels.get(current) ?? 0;
+            for (const neighbor of adjList.get(current) ?? []) {
+                const newDegree = (inDegree.get(neighbor) ?? 1) - 1;
+                inDegree.set(neighbor, newDegree);
+                // Level = max dependency level + 1
+                const neighborLevel = Math.max(levels.get(neighbor) ?? 0, currentLevel + 1);
+                levels.set(neighbor, neighborLevel);
+                if (newDegree === 0) {
+                    queue.push(neighbor);
+                }
+            }
+        }
+        // Check for unprocessed nodes (cycle should have been caught already)
+        if (sorted.length !== intent.steps.length) {
+            errors.push('Not all steps were processed — possible unresolved dependency');
+        }
+        // Check depth
+        const maxLevel = Math.max(...levels.values(), 0);
+        if (maxLevel > this.maxDepth) {
+            errors.push(`DAG depth ${maxLevel} exceeds maximum ${this.maxDepth}`);
+        }
+        // Build planned steps
+        const plannedSteps = [];
+        let totalCost = 0n;
+        let totalLatency = 0;
+        // Group by level for parallel latency estimation
+        const levelLatencies = {};
+        for (const stepId of sorted) {
+            const step = stepMap.get(stepId);
+            const level = levels.get(stepId) ?? 0;
+            const estimatedCost = this.costEstimates[step.protocol] ?? 1000n;
+            const estimatedLatency = this.latencyEstimates[step.protocol] ?? 2000;
+            // Count steps at same level
+            const sameLevel = sorted.filter(id => levels.get(id) === level);
+            plannedSteps.push({
+                ...step,
+                executionOrder: level,
+                resolvedDeps: step.dependsOn ?? [],
+                parallelizable: sameLevel.length > 1,
+                estimatedCost,
+                estimatedLatencyMs: estimatedLatency,
+            });
+            totalCost += estimatedCost;
+            // For latency, take the max per level (parallel steps)
+            levelLatencies[level] = Math.max(levelLatencies[level] ?? 0, estimatedLatency);
+        }
+        totalLatency = Object.values(levelLatencies).reduce((sum, v) => sum + v, 0);
+        return {
+            intentId: intent.id ?? 'unknown',
+            steps: plannedSteps,
+            totalLevels: maxLevel + 1,
+            estimatedTotalCost: totalCost,
+            estimatedTotalLatencyMs: totalLatency,
+            isValid: errors.length === 0,
+            errors,
+            createdAt: Date.now(),
+        };
+    }
+    /**
+     * @description Optimize a plan by reordering parallelizable steps
+     * to minimize total latency.
+     *
+     * @param {IntentPlan} plan - Plan to optimize
+     * @returns {IntentPlan} Optimized plan (new object, original unchanged)
+     *
+     * @since 1.3.0
+     */
+    optimize(plan) {
+        // Group steps by execution level
+        const levels = new Map();
+        for (const step of plan.steps) {
+            if (!levels.has(step.executionOrder))
+                levels.set(step.executionOrder, []);
+            levels.get(step.executionOrder).push(step);
+        }
+        // Within each level, sort by estimated latency descending
+        // (start slowest first for better parallelization)
+        const optimizedSteps = [];
+        for (const [, stepsAtLevel] of [...levels.entries()].sort((a, b) => a[0] - b[0])) {
+            stepsAtLevel.sort((a, b) => (b.estimatedLatencyMs ?? 0) - (a.estimatedLatencyMs ?? 0));
+            optimizedSteps.push(...stepsAtLevel);
+        }
+        return {
+            ...plan,
+            steps: optimizedSteps,
+        };
+    }
+    /* ── Cycle detection ── */
+    detectCycles(steps, adjList) {
+        const WHITE = 0, GRAY = 1, BLACK = 2;
+        const colors = new Map();
+        const parent = new Map();
+        for (const step of steps) {
+            colors.set(step.id, WHITE);
+            parent.set(step.id, null);
+        }
+        const dfs = (node) => {
+            colors.set(node, GRAY);
+            for (const neighbor of adjList.get(node) ?? []) {
+                if (colors.get(neighbor) === GRAY) {
+                    // Back edge — cycle found
+                    const cycle = [neighbor, node];
+                    let curr = node;
+                    while (curr && curr !== neighbor) {
+                        curr = parent.get(curr);
+                        if (curr)
+                            cycle.push(curr);
+                    }
+                    throw new types_1.CyclicDependencyError(cycle.reverse());
+                }
+                if (colors.get(neighbor) === WHITE) {
+                    parent.set(neighbor, node);
+                    dfs(neighbor);
+                }
+            }
+            colors.set(node, BLACK);
+        };
+        for (const step of steps) {
+            if (colors.get(step.id) === WHITE) {
+                dfs(step.id);
+            }
+        }
+    }
+}
+exports.IntentPlanner = IntentPlanner;
+//# sourceMappingURL=planner.js.map

package/dist/cjs/ai/intents/planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner.js","sourceRoot":"","sources":["../../../../src/ai/intents/planner.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;;;AAGH,mCAA6D;AAE7D;;qEAEqE;AAErE;;;;GAIG;AACH,MAAM,sBAAsB,GAA2B;IACrD,OAAO,EAAG,KAAK;IACf,OAAO,EAAG,KAAK;IACf,QAAQ,EAAE,KAAK;IACf,MAAM,EAAI,IAAI;IACd,QAAQ,EAAE,KAAK;IACf,IAAI,EAAM,KAAK;CAChB,CAAC;AAEF;;;GAGG;AACH,MAAM,yBAAyB,GAA2B;IACxD,OAAO,EAAG,IAAI;IACd,OAAO,EAAG,IAAI;IACd,QAAQ,EAAE,IAAI;IACd,MAAM,EAAI,GAAG;IACb,QAAQ,EAAE,IAAI;IACd,IAAI,EAAM,IAAI;CACf,CAAC;AAmBF;;qEAEqE;AAErE;;;;;;;;;;;GAWG;AACH,MAAa,aAAa;IACP,aAAa,CAAyB;IACtC,gBAAgB,CAAyB;IACzC,QAAQ,CAAS;IAElC;;OAEG;IACH,YAAY,MAAsB;QAChC,IAAI,CAAC,aAAa,GAAG,EAAE,GAAG,sBAAsB,EAAE,GAAG,MAAM,EAAE,aAAa,EAAE,CAAC;QAC7E,IAAI,CAAC,gBAAgB,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,MAAM,EAAE,gBAAgB,EAAE,CAAC;QACtF,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC;IACzC,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,IAAI,CAAC,MAAc;QACjB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,qCAAqC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC3D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAErD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACnD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAEzC,4DAA4D;QAC5D,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACf,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAErB,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAE9C,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;gBAClC,mCAAmC;gBACnC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;gBAC5E,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;gBAEpC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;QAC/E,CAAC;QAED,cAAc;QACd,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QACjD,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,aAAa,QAAQ,oBAAoB,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QACxE,CAAC;QAED,sBAAsB;QACtB,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,iDAAiD;QACjD,MAAM,cAAc,GAA2B,EAAE,CAAC;QAElD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAClC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YACjE,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC;YAEtE,4BAA4B;YAC5B,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC;YAEhE,YAAY,CAAC,IAAI,CAAC;gBAChB,GAAG,IAAI;gBACP,cAAc,EAAE,KAAK;gBACrB,YAAY,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;gBAClC,cAAc,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC;gBACpC,aAAa;gBACb,kBAAkB,EAAE,gBAAgB;aACrC,CAAC,CAAC;YAEH,SAAS,IAAI,aAAa,CAAC;YAC3B,uDAAuD;YACvD,cAAc,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACjF,CAAC;QAED,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAE5E,OAAO;YACL,QAAQ,EAAE,MAAM,CAAC,EAAE,IAAI,SAAS;YAChC,KAAK,EAAE,YAAY;YACnB,WAAW,EAAE,QAAQ,GAAG,CAAC;YACzB,kBAAkB,EAAE,SAAS;YAC7B,uBAAuB,EAAE,YAAY;YACrC,OAAO,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;YAC5B,MAAM;YACN,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,QAAQ,CAAC,IAAgB;QACvB,iCAAiC;QACjC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;YAC1E,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC;QAED,0DAA0D;QAC1D,mDAAmD;QACnD,MAAM,cAAc,GAAkB,EAAE,CAAC;QACzC,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjF,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,CAAC,CAAC;YACvF,cAAc,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QACvC,CAAC;QAED,OAAO;YACL,GAAG,IAAI;YACP,KAAK,EAAE,cAAc;SACtB,CAAC;IACJ,CAAC;IAED,2BAA2B;IAEnB,YAAY,CAAC,KAAmB,EAAE,OAAiC;QACzE,MAAM,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE;YACjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAEvB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC/C,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;oBAClC,0BAA0B;oBAC1B,MAAM,KAAK,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;oBAC/B,IAAI,IAAI,GAA8B,IAAI,CAAC;oBAC3C,OAAO,IAAI,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;wBACjC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBACxB,IAAI,IAAI;4BAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC7B,CAAC;oBACD,MAAM,IAAI,6BAAqB,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;gBACnD,CAAC;gBACD,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE,CAAC;oBACnC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;oBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC;gBAClC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA1ND,sCA0NC"}

package/dist/cjs/ai/intents/types.d.ts

@@ -0,0 +1,281 @@
+/**
+ * @module ai/intents/types
+ * @description Cross-Protocol Intent Resolver — Core type definitions.
+ *
+ * An "intent" is a high-level description of a multi-step DeFi operation
+ * that spans multiple protocols (Jupiter, Raydium, Metaplex, native SOL).
+ *
+ * The resolver parses intents into execution plans, resolves cross-step
+ * data dependencies (e.g. "use the output of step 1 as input to step 2"),
+ * and executes them with simulation, attestation, and optional Jito bundling.
+ *
+ * @since 1.3.0
+ */
+import type { ResponseAttestation } from '../gateway/types';
+/**
+ * @description Supported protocol identifiers for intent steps.
+ * @since 1.3.0
+ */
+export type IntentProtocol = 'jupiter' | 'raydium' | 'metaplex' | 'native' | 'marinade' | 'jito' | string;
+/**
+ * @description A reference to a previous step's output field.
+ *
+ * Format: `"$<stepId>.<field>.<subfield>..."` where:
+ * - `$step1.amount` → the `amount` field from step1's output
+ * - `$step1.data.outputAmount` → nested field access
+ *
+ * @since 1.3.0
+ */
+export type StepReference = `$${string}`;
+/**
+ * @description A single step in a multi-protocol intent.
+ * @since 1.3.0
+ */
+export interface IntentStep {
+    /** Unique step identifier (referenced by other steps via `$stepId`). */
+    id: string;
+    /** Target protocol. */
+    protocol: IntentProtocol;
+    /** Method name within the protocol (e.g. `"smartSwap"`, `"getPoolInfo"`). */
+    method: string;
+    /**
+     * Input parameters. Values can be literal or {@link StepReference}s
+     * that resolve at runtime from previous step outputs.
+     */
+    params: Record<string, unknown | StepReference>;
+    /**
+     * Explicit dependencies (step IDs that must complete before this step).
+     * Auto-inferred from `$ref` params if omitted.
+     */
+    dependsOn?: string[];
+    /** Human-readable description of what this step does. */
+    description?: string;
+    /**
+     * If `true`, failure of this step is non-fatal — the plan continues.
+     * @default false
+     */
+    optional?: boolean;
+    /**
+     * Max acceptable latency in ms. If exceeded, the step is marked as slow.
+     * @default 30000
+     */
+    timeoutMs?: number;
+}
+/**
+ * @description A complete multi-protocol intent.
+ * @since 1.3.0
+ */
+export interface Intent {
+    /** Unique intent identifier (auto-generated if omitted). */
+    id?: string;
+    /** Human-readable description. */
+    description?: string;
+    /** Ordered list of steps. */
+    steps: IntentStep[];
+    /** Global intent options. */
+    options?: IntentOptions;
+}
+/**
+ * @description Options controlling intent execution behavior.
+ * @since 1.3.0
+ */
+export interface IntentOptions {
+    /**
+     * If `true`, all steps are simulated before execution (dry-run).
+     * @default false
+     */
+    simulate?: boolean;
+    /**
+     * If `true`, failure of any step rolls back completed steps where possible.
+     * @default false
+     */
+    atomic?: boolean;
+    /**
+     * If `true`, generate Proof-of-Computation attestation for each step.
+     * @default true
+     */
+    attest?: boolean;
+    /**
+     * Maximum total budget (smallest token unit). Execution halts if exceeded.
+     * @default Infinity
+     */
+    maxBudget?: bigint;
+    /**
+     * Session ID to charge against (if using gateway metering).
+     */
+    sessionId?: string;
+    /**
+     * If `true`, bundle all on-chain transactions via Jito for MEV protection.
+     * @default false
+     */
+    jitoBundling?: boolean;
+    /**
+     * Custom metadata attached to the intent result.
+     */
+    metadata?: Record<string, unknown>;
+}
+/**
+ * @description A step enriched with execution plan metadata.
+ * @since 1.3.0
+ */
+export interface PlannedStep extends IntentStep {
+    /** Execution order (0-based). Steps with the same order can run in parallel. */
+    executionOrder: number;
+    /** Resolved dependencies (step IDs). */
+    resolvedDeps: string[];
+    /** Whether this step can run in parallel with others at the same order. */
+    parallelizable: boolean;
+    /** Estimated cost in smallest token unit. */
+    estimatedCost?: bigint;
+    /** Estimated latency in ms. */
+    estimatedLatencyMs?: number;
+}
+/**
+ * @description A fully resolved execution plan.
+ * @since 1.3.0
+ */
+export interface IntentPlan {
+    /** Original intent ID. */
+    intentId: string;
+    /** Planned steps in topological order. */
+    steps: PlannedStep[];
+    /** Total number of execution levels (sequential phases). */
+    totalLevels: number;
+    /** Estimated total cost. */
+    estimatedTotalCost: bigint;
+    /** Estimated total latency (sequential sum). */
+    estimatedTotalLatencyMs: number;
+    /** Whether the plan is valid (all deps resolved, no cycles). */
+    isValid: boolean;
+    /** Validation errors (if any). */
+    errors: string[];
+    /** Plan creation timestamp. */
+    createdAt: number;
+}
+/**
+ * @description Possible status values for a step execution.
+ * @since 1.3.0
+ */
+export type StepStatus = 'pending' | 'running' | 'completed' | 'failed' | 'skipped' | 'simulated';
+/**
+ * @description Result of executing a single step.
+ * @since 1.3.0
+ */
+export interface StepResult {
+    /** Step ID. */
+    stepId: string;
+    /** Execution status. */
+    status: StepStatus;
+    /** Output data (parsed from tool response). */
+    output: unknown;
+    /** Raw string output from the tool. */
+    rawOutput?: string;
+    /** Attestation (if generated). */
+    attestation?: ResponseAttestation;
+    /** Execution latency (ms). */
+    latencyMs: number;
+    /** Cost charged for this step. */
+    cost: bigint;
+    /** Error message (if failed). */
+    error?: string;
+    /** Timestamp of execution. */
+    executedAt: number;
+}
+/**
+ * @description Possible status values for the overall intent execution.
+ * @since 1.3.0
+ */
+export type IntentResultStatus = 'completed' | 'partial' | 'failed' | 'simulated';
+/**
+ * @description Final result of an intent execution.
+ * @since 1.3.0
+ */
+export interface IntentResult {
+    /** Intent ID. */
+    intentId: string;
+    /** Overall status. */
+    status: IntentResultStatus;
+    /** Per-step results. */
+    steps: StepResult[];
+    /** Total cost across all steps. */
+    totalCost: bigint;
+    /** Total execution time (ms). */
+    totalLatencyMs: number;
+    /** Number of successful steps. */
+    successCount: number;
+    /** Number of failed steps. */
+    failureCount: number;
+    /** Execution start timestamp. */
+    startedAt: number;
+    /** Execution end timestamp. */
+    completedAt: number;
+    /** Custom metadata from intent options. */
+    metadata?: Record<string, unknown>;
+}
+/**
+ * @description Configuration for the Intent Resolver system.
+ * @since 1.3.0
+ */
+export interface IntentConfig {
+    /**
+     * Map of protocol name → toolkit tools (the `toolMap` from a `ProtocolToolkit`).
+     * The executor uses these to invoke the actual protocol methods.
+     */
+    protocolTools: Record<string, Record<string, {
+        invoke: (input: Record<string, unknown>) => Promise<string>;
+    }>>;
+    /**
+     * Default timeout per step (ms).
+     * @default 30000
+     */
+    defaultTimeoutMs?: number;
+    /**
+     * Maximum steps allowed in a single intent.
+     * @default 20
+     */
+    maxSteps?: number;
+    /**
+     * Event listener called on each step completion.
+     */
+    onStepComplete?: (result: StepResult) => void | Promise<void>;
+    /**
+     * Event listener called on step failure.
+     */
+    onStepError?: (stepId: string, error: Error) => void | Promise<void>;
+}
+/**
+ * @description Error class for intent-related failures.
+ * @since 1.3.0
+ */
+export declare class IntentError extends Error {
+    readonly code: string;
+    readonly stepId?: string | undefined;
+    /**
+     * @param {string} message - Human-readable error message
+     * @param {string} [code='INTENT_ERROR'] - Machine-readable error code
+     * @param {string} [stepId] - Step ID where the error occurred
+     */
+    constructor(message: string, code?: string, stepId?: string | undefined);
+}
+/**
+ * @description Error thrown when a circular dependency is detected in the intent DAG.
+ * @since 1.3.0
+ */
+export declare class CyclicDependencyError extends IntentError {
+    constructor(cycle: string[]);
+}
+/**
+ * @description Error thrown when a step reference cannot be resolved.
+ * @since 1.3.0
+ */
+export declare class UnresolvedReferenceError extends IntentError {
+    constructor(ref: string, stepId: string);
+}
+/**
+ * @description Error thrown when the intent budget is exceeded.
+ * @since 1.3.0
+ */
+export declare class BudgetExceededError extends IntentError {
+    constructor(spent: bigint, max: bigint);
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/cjs/ai/intents/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/ai/intents/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AAM5D;;;GAGG;AACH,MAAM,MAAM,cAAc,GACtB,SAAS,GACT,SAAS,GACT,UAAU,GACV,QAAQ,GACR,UAAU,GACV,MAAM,GACN,MAAM,CAAC;AAEX;;;;;;;;GAQG;AACH,MAAM,MAAM,aAAa,GAAG,IAAI,MAAM,EAAE,CAAC;AAMzC;;;GAGG;AACH,MAAM,WAAW,UAAU;IACzB,wEAAwE;IACxE,EAAE,EAAE,MAAM,CAAC;IACX,uBAAuB;IACvB,QAAQ,EAAE,cAAc,CAAC;IACzB,6EAA6E;IAC7E,MAAM,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,aAAa,CAAC,CAAC;IAChD;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,yDAAyD;IACzD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,MAAM;IACrB,4DAA4D;IAC5D,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,kCAAkC;IAClC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,6BAA6B;IAC7B,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,6BAA6B;IAC7B,OAAO,CAAC,EAAE,aAAa,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB;;;OAGG;IACH,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;OAEG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;OAGG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAMD;;;GAGG;AACH,MAAM,WAAW,WAAY,SAAQ,UAAU;IAC7C,gFAAgF;IAChF,cAAc,EAAE,MAAM,CAAC;IACvB,wCAAwC;IACxC,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,2EAA2E;IAC3E,cAAc,EAAE,OAAO,CAAC;IACxB,6CAA6C;IAC7C,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,+BAA+B;IAC/B,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,UAAU;IACzB,0BAA0B;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,0CAA0C;IAC1C,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,4DAA4D;IAC5D,WAAW,EAAE,MAAM,CAAC;IACpB,4BAA4B;IAC5B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gDAAgD;IAChD,uBAAuB,EAAE,MAAM,CAAC;IAChC,gEAAgE;IAChE,OAAO,EAAE,OAAO,CAAC;IACjB,kCAAkC;IAClC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,+BAA+B;IAC/B,SAAS,EAAE,MAAM,CAAC;CACnB;AAMD;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,SAAS,GAAG,WAAW,CAAC;AAElG;;;GAGG;AACH,MAAM,WAAW,UAAU;IACzB,eAAe;IACf,MAAM,EAAE,MAAM,CAAC;IACf,wBAAwB;IACxB,MAAM,EAAE,UAAU,CAAC;IACnB,+CAA+C;IAC/C,MAAM,EAAE,OAAO,CAAC;IAChB,uCAAuC;IACvC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,kCAAkC;IAClC,WAAW,CAAC,EAAE,mBAAmB,CAAC;IAClC,8BAA8B;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,kCAAkC;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,iCAAiC;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,MAAM,kBAAkB,GAAG,WAAW,GAAG,SAAS,GAAG,QAAQ,GAAG,WAAW,CAAC;AAElF;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,iBAAiB;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,sBAAsB;IACtB,MAAM,EAAE,kBAAkB,CAAC;IAC3B,wBAAwB;IACxB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,mCAAmC;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB,iCAAiC;IACjC,cAAc,EAAE,MAAM,CAAC;IACvB,kCAAkC;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,8BAA8B;IAC9B,YAAY,EAAE,MAAM,CAAC;IACrB,iCAAiC;IACjC,SAAS,EAAE,MAAM,CAAC;IAClB,+BAA+B;IAC/B,WAAW,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAMD;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,CAAA;KAAE,CAAC,CAAC,CAAC;IAC/G;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;OAEG;IACH,cAAc,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9D;;OAEG;IACH,WAAW,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACtE;AAMD;;;GAGG;AACH,qBAAa,WAAY,SAAQ,KAAK;aAQlB,IAAI,EAAE,MAAM;aACZ,MAAM,CAAC,EAAE,MAAM;IARjC;;;;OAIG;gBAED,OAAO,EAAE,MAAM,EACC,IAAI,GAAE,MAAuB,EAC7B,MAAM,CAAC,EAAE,MAAM,YAAA;CAKlC;AAED;;;GAGG;AACH,qBAAa,qBAAsB,SAAQ,WAAW;gBACxC,KAAK,EAAE,MAAM,EAAE;CAG5B;AAED;;;GAGG;AACH,qBAAa,wBAAyB,SAAQ,WAAW;gBAC3C,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAGxC;AAED;;;GAGG;AACH,qBAAa,mBAAoB,SAAQ,WAAW;gBACtC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM;CAGvC"}

package/dist/cjs/ai/intents/types.js

@@ -0,0 +1,70 @@
+"use strict";
+/**
+ * @module ai/intents/types
+ * @description Cross-Protocol Intent Resolver — Core type definitions.
+ *
+ * An "intent" is a high-level description of a multi-step DeFi operation
+ * that spans multiple protocols (Jupiter, Raydium, Metaplex, native SOL).
+ *
+ * The resolver parses intents into execution plans, resolves cross-step
+ * data dependencies (e.g. "use the output of step 1 as input to step 2"),
+ * and executes them with simulation, attestation, and optional Jito bundling.
+ *
+ * @since 1.3.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BudgetExceededError = exports.UnresolvedReferenceError = exports.CyclicDependencyError = exports.IntentError = void 0;
+/* ═══════════════════════════════════════════════════════════════
+ *  Errors
+ * ═══════════════════════════════════════════════════════════════ */
+/**
+ * @description Error class for intent-related failures.
+ * @since 1.3.0
+ */
+class IntentError extends Error {
+    code;
+    stepId;
+    /**
+     * @param {string} message - Human-readable error message
+     * @param {string} [code='INTENT_ERROR'] - Machine-readable error code
+     * @param {string} [stepId] - Step ID where the error occurred
+     */
+    constructor(message, code = 'INTENT_ERROR', stepId) {
+        super(message);
+        this.code = code;
+        this.stepId = stepId;
+        this.name = 'IntentError';
+    }
+}
+exports.IntentError = IntentError;
+/**
+ * @description Error thrown when a circular dependency is detected in the intent DAG.
+ * @since 1.3.0
+ */
+class CyclicDependencyError extends IntentError {
+    constructor(cycle) {
+        super(`Cyclic dependency detected: ${cycle.join(' → ')}`, 'CYCLIC_DEPENDENCY');
+    }
+}
+exports.CyclicDependencyError = CyclicDependencyError;
+/**
+ * @description Error thrown when a step reference cannot be resolved.
+ * @since 1.3.0
+ */
+class UnresolvedReferenceError extends IntentError {
+    constructor(ref, stepId) {
+        super(`Cannot resolve reference '${ref}' in step '${stepId}'`, 'UNRESOLVED_REFERENCE', stepId);
+    }
+}
+exports.UnresolvedReferenceError = UnresolvedReferenceError;
+/**
+ * @description Error thrown when the intent budget is exceeded.
+ * @since 1.3.0
+ */
+class BudgetExceededError extends IntentError {
+    constructor(spent, max) {
+        super(`Budget exceeded: spent ${spent}, max ${max}`, 'BUDGET_EXCEEDED');
+    }
+}
+exports.BudgetExceededError = BudgetExceededError;
+//# sourceMappingURL=types.js.map

package/dist/cjs/ai/intents/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/ai/intents/types.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;AAgRH;;qEAEqE;AAErE;;;GAGG;AACH,MAAa,WAAY,SAAQ,KAAK;IAQlB;IACA;IARlB;;;;OAIG;IACH,YACE,OAAe,EACC,OAAe,cAAc,EAC7B,MAAe;QAE/B,KAAK,CAAC,OAAO,CAAC,CAAC;QAHC,SAAI,GAAJ,IAAI,CAAyB;QAC7B,WAAM,GAAN,MAAM,CAAS;QAG/B,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;IAC5B,CAAC;CACF;AAdD,kCAcC;AAED;;;GAGG;AACH,MAAa,qBAAsB,SAAQ,WAAW;IACpD,YAAY,KAAe;QACzB,KAAK,CAAC,+BAA+B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,mBAAmB,CAAC,CAAC;IACjF,CAAC;CACF;AAJD,sDAIC;AAED;;;GAGG;AACH,MAAa,wBAAyB,SAAQ,WAAW;IACvD,YAAY,GAAW,EAAE,MAAc;QACrC,KAAK,CAAC,6BAA6B,GAAG,cAAc,MAAM,GAAG,EAAE,sBAAsB,EAAE,MAAM,CAAC,CAAC;IACjG,CAAC;CACF;AAJD,4DAIC;AAED;;;GAGG;AACH,MAAa,mBAAoB,SAAQ,WAAW;IAClD,YAAY,KAAa,EAAE,GAAW;QACpC,KAAK,CAAC,0BAA0B,KAAK,SAAS,GAAG,EAAE,EAAE,iBAAiB,CAAC,CAAC;IAC1E,CAAC;CACF;AAJD,kDAIC"}