@salimassili/ai-costguard 1.1.3

package/dist/aecl/index.js

@@ -0,0 +1,111 @@
+"use strict";
+/**
+ * AECL - AI Execution Control Layer
+ * Production-grade execution interception
+ *
+ * CORE MODULES:
+ * - ExecutionInterceptor: <5ms decision engine
+ * - RiskEngine: 0-1 risk scoring
+ * - PolicyEngine: simple rule evaluation
+ * - ExecutionMemory: hashed trace storage
+ * - ROITelemetry: cost savings tracking
+ *
+ * USAGE:
+ * ```typescript
+ * import { aecl } from 'ai-execution-control/aecl';
+ *
+ * const result = aecl.intercept({
+ *   id: 'req-1',
+ *   provider: 'openai',
+ *   operation: 'chat.completions.create',
+ *   estimatedTokens: 2000,
+ *   estimatedCost: 0.06,
+ *   context: {
+ *     sessionId: 'sess-1',
+ *     agentId: 'agent-1',
+ *     stepNumber: 5,
+ *     previousCalls: 4,
+ *     totalTokens: 8000,
+ *     totalCost: 0.24,
+ *     startTime: Date.now(),
+ *   },
+ *   inputHash: 'hash-of-prompt',
+ * });
+ *
+ * if (result.decision === 'block') {
+ *   console.log('Blocked:', result.reason);
+ *   console.log('Saved: $', result.estimatedSavings);
+ * }
+ * ```
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.aecl = exports.AECL = exports.roiTelemetry = exports.ROITelemetry = exports.executionMemory = exports.ExecutionMemory = exports.policyEngine = exports.PolicyEngine = exports.riskEngine = exports.RiskEngine = exports.interceptor = exports.ExecutionInterceptor = void 0;
+var ExecutionInterceptor_1 = require("./ExecutionInterceptor");
+Object.defineProperty(exports, "ExecutionInterceptor", { enumerable: true, get: function () { return ExecutionInterceptor_1.ExecutionInterceptor; } });
+Object.defineProperty(exports, "interceptor", { enumerable: true, get: function () { return ExecutionInterceptor_1.interceptor; } });
+var RiskEngine_1 = require("./RiskEngine");
+Object.defineProperty(exports, "RiskEngine", { enumerable: true, get: function () { return RiskEngine_1.RiskEngine; } });
+Object.defineProperty(exports, "riskEngine", { enumerable: true, get: function () { return RiskEngine_1.riskEngine; } });
+var PolicyEngine_1 = require("./PolicyEngine");
+Object.defineProperty(exports, "PolicyEngine", { enumerable: true, get: function () { return PolicyEngine_1.PolicyEngine; } });
+Object.defineProperty(exports, "policyEngine", { enumerable: true, get: function () { return PolicyEngine_1.policyEngine; } });
+var ExecutionMemory_1 = require("./ExecutionMemory");
+Object.defineProperty(exports, "ExecutionMemory", { enumerable: true, get: function () { return ExecutionMemory_1.ExecutionMemory; } });
+Object.defineProperty(exports, "executionMemory", { enumerable: true, get: function () { return ExecutionMemory_1.executionMemory; } });
+var ROITelemetry_1 = require("./ROITelemetry");
+Object.defineProperty(exports, "ROITelemetry", { enumerable: true, get: function () { return ROITelemetry_1.ROITelemetry; } });
+Object.defineProperty(exports, "roiTelemetry", { enumerable: true, get: function () { return ROITelemetry_1.roiTelemetry; } });
+// Unified API
+const ExecutionInterceptor_2 = require("./ExecutionInterceptor");
+const RiskEngine_2 = require("./RiskEngine");
+const PolicyEngine_2 = require("./PolicyEngine");
+const ExecutionMemory_2 = require("./ExecutionMemory");
+const ROITelemetry_2 = require("./ROITelemetry");
+/**
+ * Unified AECL interface
+ */
+class AECL {
+    constructor(config = {}) {
+        this.interceptor = new ExecutionInterceptor_2.ExecutionInterceptor({
+            failOpen: config.failOpen ?? true,
+            maxLatencyMs: config.maxLatencyMs ?? 5,
+            defaultPolicy: {
+                maxCostPerSession: config.maxCostPerSession ?? 10,
+                maxStepsPerSession: config.maxStepsPerSession ?? 50,
+                maxCostPerRequest: config.maxCostPerRequest ?? 5,
+            },
+        });
+        this.riskEngine = new RiskEngine_2.RiskEngine();
+        this.policyEngine = new PolicyEngine_2.PolicyEngine();
+        this.memory = new ExecutionMemory_2.ExecutionMemory();
+        this.telemetry = new ROITelemetry_2.ROITelemetry();
+        // Initialize method bindings AFTER all dependencies are set
+        this.intercept = this.interceptor.intercept.bind(this.interceptor);
+        this.assessRisk = this.riskEngine.assess.bind(this.riskEngine);
+        this.evaluatePolicy = this.policyEngine.evaluate.bind(this.policyEngine);
+        this.checkDuplicate = this.memory.checkDeduplication.bind(this.memory);
+        this.logDecision = this.telemetry.log.bind(this.telemetry);
+        this.getROI = this.telemetry.get7DayReport.bind(this.telemetry);
+        this.getDashboard = this.telemetry.getDashboardSummary.bind(this.telemetry);
+        this.exportCSV = this.telemetry.exportCSV.bind(this.telemetry);
+    }
+    /**
+     * Record execution trace
+     */
+    recordExecution(sessionId, trace) {
+        this.memory.record({
+            sessionId,
+            stepNumber: trace.stepNumber,
+            operation: trace.operation,
+            inputHash: trace.inputHash,
+            cost: trace.cost,
+            tokens: trace.tokens,
+            timestamp: trace.timestamp,
+            durationMs: trace.durationMs,
+        });
+    }
+}
+exports.AECL = AECL;
+// Default instance
+exports.aecl = new AECL();
+//# sourceMappingURL=index.js.map

package/dist/aecl/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/aecl/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;;;AAEH,+DAA2E;AAAlE,4HAAA,oBAAoB,OAAA;AAAE,mHAAA,WAAW,OAAA;AAC1C,2CAAsD;AAA7C,wGAAA,UAAU,OAAA;AAAE,wGAAA,UAAU,OAAA;AAC/B,+CAA4D;AAAnD,4GAAA,YAAY,OAAA;AAAE,4GAAA,YAAY,OAAA;AACnC,qDAAqE;AAA5D,kHAAA,eAAe,OAAA;AAAE,kHAAA,eAAe,OAAA;AACzC,+CAA4D;AAAnD,4GAAA,YAAY,OAAA;AAAE,4GAAA,YAAY,OAAA;AAEnC,cAAc;AACd,iEAA8D;AAC9D,6CAA0C;AAC1C,iDAA8C;AAC9C,uDAAoD;AACpD,iDAA8C;AAU9C;;GAEG;AACH,MAAa,IAAI;IAiBf,YAAY,SAAqB,EAAE;QACjC,IAAI,CAAC,WAAW,GAAG,IAAI,2CAAoB,CAAC;YAC1C,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,IAAI;YACjC,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,CAAC;YACtC,aAAa,EAAE;gBACb,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,EAAE;gBACjD,kBAAkB,EAAE,MAAM,CAAC,kBAAkB,IAAI,EAAE;gBACnD,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,CAAC;aACjD;SACF,CAAC,CAAC;QAEH,IAAI,CAAC,UAAU,GAAG,IAAI,uBAAU,EAAE,CAAC;QACnC,IAAI,CAAC,YAAY,GAAG,IAAI,2BAAY,EAAE,CAAC;QACvC,IAAI,CAAC,MAAM,GAAG,IAAI,iCAAe,EAAE,CAAC;QACpC,IAAI,CAAC,SAAS,GAAG,IAAI,2BAAY,EAAE,CAAC;QAEpC,4DAA4D;QAC5D,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACnE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/D,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5E,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjE,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,SAAiB,EAAE,KAAU;QAC3C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YACjB,SAAS;YACT,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B,CAAC,CAAC;IACL,CAAC;CACF;AA3DD,oBA2DC;AAED,mBAAmB;AACN,QAAA,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC"}

package/dist/aerl/ExecutionGraph.d.ts

@@ -0,0 +1,123 @@
+/**
+ * AERL - Execution Graph Tracker
+ *
+ * Tracks multi-step agent workflows as a directed graph:
+ * - Nodes = actions (LLM calls, tool executions)
+ * - Edges = dependencies between actions
+ *
+ * DETECTS:
+ * - Loops (A -> B -> A)
+ * - Retry storms (rapid repeated calls)
+ * - Redundant branches (identical subtrees)
+ * - Stuck states (no progress for N steps)
+ *
+ * REQUIREMENTS:
+ * - Real-time updates
+ * - In-memory (no external DB in hot path)
+ * - Automatic cleanup
+ * - <1ms update latency
+ */
+export type NodeType = 'llm' | 'tool' | 'decision' | 'retry';
+export type NodeStatus = 'pending' | 'running' | 'success' | 'failure' | 'skipped';
+export interface ExecutionNode {
+    id: string;
+    type: NodeType;
+    status: NodeStatus;
+    operation: string;
+    inputHash: string;
+    outputHash?: string;
+    cost: number;
+    tokens: number;
+    durationMs: number;
+    timestamp: number;
+    metadata?: Record<string, unknown>;
+}
+export interface ExecutionEdge {
+    from: string;
+    to: string;
+    type: 'dependency' | 'retry' | 'fallback';
+}
+export interface ExecutionGraph {
+    workflowId: string;
+    sessionId: string;
+    nodes: Map<string, ExecutionNode>;
+    edges: ExecutionEdge[];
+    startTime: number;
+    lastUpdate: number;
+}
+export interface GraphAnalysis {
+    hasLoop: boolean;
+    loopPath?: string[];
+    retryStorm: boolean;
+    retryCount: number;
+    redundantBranches: string[][];
+    stuckSteps: number;
+    depth: number;
+    width: number;
+}
+export declare class ExecutionGraphTracker {
+    private graphs;
+    private maxGraphs;
+    private ttlMs;
+    constructor(config?: {
+        maxGraphs?: number;
+        ttlMinutes?: number;
+    });
+    /**
+     * Create or get graph for workflow
+     */
+    initGraph(workflowId: string, sessionId: string): ExecutionGraph;
+    /**
+     * Add node to graph (real-time)
+     */
+    addNode(workflowId: string, node: ExecutionNode, dependencies?: string[]): void;
+    /**
+     * Update node status
+     */
+    updateNode(workflowId: string, nodeId: string, status: NodeStatus, outputHash?: string): void;
+    /**
+     * Add retry edge
+     */
+    addRetry(workflowId: string, fromNodeId: string, toNodeId: string): void;
+    /**
+     * Analyze graph for problems
+     */
+    analyze(workflowId: string): GraphAnalysis;
+    /**
+     * Detect loops using DFS
+     */
+    private detectLoop;
+    /**
+     * Detect retry storm (many retries in short time)
+     */
+    private detectRetryStorm;
+    private countRetries;
+    /**
+     * Find redundant branches (subtrees with same input hash)
+     */
+    private findRedundantBranches;
+    /**
+     * Detect stuck state (many steps without success)
+     */
+    private detectStuckState;
+    /**
+     * Calculate graph depth (longest path)
+     */
+    private calculateDepth;
+    /**
+     * Calculate graph width (max parallel nodes)
+     */
+    private calculateWidth;
+    /**
+     * Get graph for inspection
+     */
+    getGraph(workflowId: string): ExecutionGraph | undefined;
+    /**
+     * Clear graph
+     */
+    clearGraph(workflowId: string): void;
+    private cleanup;
+    private evictOldest;
+}
+export declare const graphTracker: ExecutionGraphTracker;
+//# sourceMappingURL=ExecutionGraph.d.ts.map

package/dist/aerl/ExecutionGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExecutionGraph.d.ts","sourceRoot":"","sources":["../../src/aerl/ExecutionGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,MAAM,MAAM,QAAQ,GAAG,KAAK,GAAG,MAAM,GAAG,UAAU,GAAG,OAAO,CAAC;AAC7D,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;AAEnF,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,CAAC;IACf,MAAM,EAAE,UAAU,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,YAAY,GAAG,OAAO,GAAG,UAAU,CAAC;CAC3C;AAED,MAAM,WAAW,cAAc;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAClC,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,EAAE,EAAE,CAAC;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,qBAAqB;IAChC,OAAO,CAAC,MAAM,CAA8B;IAC5C,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,KAAK,CAAS;gBAEV,MAAM,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE;IAQhE;;OAEG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,cAAc;IAsBhE;;OAEG;IACH,OAAO,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,YAAY,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI;IAoB/E;;OAEG;IACH,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI;IAY7F;;OAEG;IACH,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAaxE;;OAEG;IACH,OAAO,CAAC,UAAU,EAAE,MAAM,GAAG,aAAa;IAyB1C;;OAEG;IACH,OAAO,CAAC,UAAU;IA+BlB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAkBxB,OAAO,CAAC,YAAY;IAIpB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAqB7B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAQxB;;OAEG;IACH,OAAO,CAAC,cAAc;IA0BtB;;OAEG;IACH,OAAO,CAAC,cAAc;IAkBtB;;OAEG;IACH,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAIxD;;OAEG;IACH,UAAU,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI;IAIpC,OAAO,CAAC,OAAO;IAef,OAAO,CAAC,WAAW;CAapB;AAED,eAAO,MAAM,YAAY,uBAA8B,CAAC"}

package/dist/aerl/ExecutionGraph.js

@@ -0,0 +1,289 @@
+"use strict";
+/**
+ * AERL - Execution Graph Tracker
+ *
+ * Tracks multi-step agent workflows as a directed graph:
+ * - Nodes = actions (LLM calls, tool executions)
+ * - Edges = dependencies between actions
+ *
+ * DETECTS:
+ * - Loops (A -> B -> A)
+ * - Retry storms (rapid repeated calls)
+ * - Redundant branches (identical subtrees)
+ * - Stuck states (no progress for N steps)
+ *
+ * REQUIREMENTS:
+ * - Real-time updates
+ * - In-memory (no external DB in hot path)
+ * - Automatic cleanup
+ * - <1ms update latency
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.graphTracker = exports.ExecutionGraphTracker = void 0;
+class ExecutionGraphTracker {
+    constructor(config) {
+        this.graphs = new Map();
+        this.maxGraphs = config?.maxGraphs || 5000;
+        this.ttlMs = (config?.ttlMinutes || 60) * 60 * 1000;
+        setInterval(() => this.cleanup(), 60000);
+    }
+    /**
+     * Create or get graph for workflow
+     */
+    initGraph(workflowId, sessionId) {
+        const existing = this.graphs.get(workflowId);
+        if (existing)
+            return existing;
+        // Evict if at capacity
+        if (this.graphs.size >= this.maxGraphs) {
+            this.evictOldest();
+        }
+        const graph = {
+            workflowId,
+            sessionId,
+            nodes: new Map(),
+            edges: [],
+            startTime: Date.now(),
+            lastUpdate: Date.now(),
+        };
+        this.graphs.set(workflowId, graph);
+        return graph;
+    }
+    /**
+     * Add node to graph (real-time)
+     */
+    addNode(workflowId, node, dependencies) {
+        const graph = this.graphs.get(workflowId);
+        if (!graph)
+            return;
+        graph.nodes.set(node.id, node);
+        // Add dependency edges
+        if (dependencies) {
+            for (const dep of dependencies) {
+                graph.edges.push({
+                    from: dep,
+                    to: node.id,
+                    type: 'dependency',
+                });
+            }
+        }
+        graph.lastUpdate = Date.now();
+    }
+    /**
+     * Update node status
+     */
+    updateNode(workflowId, nodeId, status, outputHash) {
+        const graph = this.graphs.get(workflowId);
+        if (!graph)
+            return;
+        const node = graph.nodes.get(nodeId);
+        if (node) {
+            node.status = status;
+            if (outputHash)
+                node.outputHash = outputHash;
+            graph.lastUpdate = Date.now();
+        }
+    }
+    /**
+     * Add retry edge
+     */
+    addRetry(workflowId, fromNodeId, toNodeId) {
+        const graph = this.graphs.get(workflowId);
+        if (!graph)
+            return;
+        graph.edges.push({
+            from: fromNodeId,
+            to: toNodeId,
+            type: 'retry',
+        });
+        graph.lastUpdate = Date.now();
+    }
+    /**
+     * Analyze graph for problems
+     */
+    analyze(workflowId) {
+        const graph = this.graphs.get(workflowId);
+        if (!graph) {
+            return {
+                hasLoop: false,
+                retryStorm: false,
+                retryCount: 0,
+                redundantBranches: [],
+                stuckSteps: 0,
+                depth: 0,
+                width: 0,
+            };
+        }
+        return {
+            hasLoop: this.detectLoop(graph),
+            retryStorm: this.detectRetryStorm(graph),
+            retryCount: this.countRetries(graph),
+            redundantBranches: this.findRedundantBranches(graph),
+            stuckSteps: this.detectStuckState(graph),
+            depth: this.calculateDepth(graph),
+            width: this.calculateWidth(graph),
+        };
+    }
+    /**
+     * Detect loops using DFS
+     */
+    detectLoop(graph) {
+        const visited = new Set();
+        const recursionStack = new Set();
+        const dfs = (nodeId) => {
+            visited.add(nodeId);
+            recursionStack.add(nodeId);
+            // Find outgoing edges
+            const outgoing = graph.edges.filter(e => e.from === nodeId);
+            for (const edge of outgoing) {
+                if (!visited.has(edge.to)) {
+                    if (dfs(edge.to))
+                        return true;
+                }
+                else if (recursionStack.has(edge.to)) {
+                    return true; // Back edge found = loop
+                }
+            }
+            recursionStack.delete(nodeId);
+            return false;
+        };
+        for (const nodeId of graph.nodes.keys()) {
+            if (!visited.has(nodeId)) {
+                if (dfs(nodeId))
+                    return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Detect retry storm (many retries in short time)
+     */
+    detectRetryStorm(graph) {
+        const retryEdges = graph.edges.filter(e => e.type === 'retry');
+        if (retryEdges.length < 5)
+            return false;
+        // Group by target node
+        const retryTargets = new Map();
+        for (const edge of retryEdges) {
+            retryTargets.set(edge.to, (retryTargets.get(edge.to) || 0) + 1);
+        }
+        // Check if any target has >3 retries
+        for (const count of retryTargets.values()) {
+            if (count > 3)
+                return true;
+        }
+        return false;
+    }
+    countRetries(graph) {
+        return graph.edges.filter(e => e.type === 'retry').length;
+    }
+    /**
+     * Find redundant branches (subtrees with same input hash)
+     */
+    findRedundantBranches(graph) {
+        const branches = [];
+        const inputHashes = new Map();
+        // Group nodes by input hash
+        for (const [nodeId, node] of graph.nodes) {
+            const existing = inputHashes.get(node.inputHash) || [];
+            existing.push(nodeId);
+            inputHashes.set(node.inputHash, existing);
+        }
+        // Find hashes with multiple nodes
+        for (const [hash, nodeIds] of inputHashes) {
+            if (nodeIds.length > 1) {
+                branches.push(nodeIds);
+            }
+        }
+        return branches;
+    }
+    /**
+     * Detect stuck state (many steps without success)
+     */
+    detectStuckState(graph) {
+        const nodes = Array.from(graph.nodes.values());
+        const recent = nodes.slice(-10); // Last 10 nodes
+        const successes = recent.filter(n => n.status === 'success').length;
+        return recent.length - successes;
+    }
+    /**
+     * Calculate graph depth (longest path)
+     */
+    calculateDepth(graph) {
+        const depths = new Map();
+        const getDepth = (nodeId) => {
+            if (depths.has(nodeId))
+                return depths.get(nodeId);
+            const incoming = graph.edges.filter(e => e.to === nodeId && e.type === 'dependency');
+            if (incoming.length === 0) {
+                depths.set(nodeId, 1);
+                return 1;
+            }
+            const maxParentDepth = Math.max(...incoming.map(e => getDepth(e.from)));
+            const depth = maxParentDepth + 1;
+            depths.set(nodeId, depth);
+            return depth;
+        };
+        let maxDepth = 0;
+        for (const nodeId of graph.nodes.keys()) {
+            maxDepth = Math.max(maxDepth, getDepth(nodeId));
+        }
+        return maxDepth;
+    }
+    /**
+     * Calculate graph width (max parallel nodes)
+     */
+    calculateWidth(graph) {
+        // Simple: count nodes at each depth level
+        const depthCounts = new Map();
+        // Calculate depth for each node
+        const depths = new Map();
+        for (const nodeId of graph.nodes.keys()) {
+            const incoming = graph.edges.filter(e => e.to === nodeId && e.type === 'dependency');
+            const depth = incoming.length > 0
+                ? Math.max(...incoming.map(e => depths.get(e.from) || 0)) + 1
+                : 1;
+            depths.set(nodeId, depth);
+            depthCounts.set(depth, (depthCounts.get(depth) || 0) + 1);
+        }
+        return Math.max(...depthCounts.values(), 0);
+    }
+    /**
+     * Get graph for inspection
+     */
+    getGraph(workflowId) {
+        return this.graphs.get(workflowId);
+    }
+    /**
+     * Clear graph
+     */
+    clearGraph(workflowId) {
+        this.graphs.delete(workflowId);
+    }
+    cleanup() {
+        const now = Date.now();
+        const expired = [];
+        for (const [workflowId, graph] of this.graphs) {
+            if (now - graph.lastUpdate > this.ttlMs) {
+                expired.push(workflowId);
+            }
+        }
+        for (const workflowId of expired) {
+            this.graphs.delete(workflowId);
+        }
+    }
+    evictOldest() {
+        let oldest = null;
+        for (const [workflowId, graph] of this.graphs) {
+            if (!oldest || graph.lastUpdate < oldest.time) {
+                oldest = { id: workflowId, time: graph.lastUpdate };
+            }
+        }
+        if (oldest) {
+            this.graphs.delete(oldest.id);
+        }
+    }
+}
+exports.ExecutionGraphTracker = ExecutionGraphTracker;
+exports.graphTracker = new ExecutionGraphTracker();
+//# sourceMappingURL=ExecutionGraph.js.map

package/dist/aerl/ExecutionGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExecutionGraph.js","sourceRoot":"","sources":["../../src/aerl/ExecutionGraph.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;;AA+CH,MAAa,qBAAqB;IAKhC,YAAY,MAAoD;QAC9D,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,MAAM,EAAE,SAAS,IAAI,IAAI,CAAC;QAC3C,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM,EAAE,UAAU,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAEpD,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,UAAkB,EAAE,SAAiB;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC7C,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAE9B,uBAAuB;QACvB,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;QAED,MAAM,KAAK,GAAmB;YAC5B,UAAU;YACV,SAAS;YACT,KAAK,EAAE,IAAI,GAAG,EAAE;YAChB,KAAK,EAAE,EAAE;YACT,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE;SACvB,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,UAAkB,EAAE,IAAmB,EAAE,YAAuB;QACtE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE/B,uBAAuB;QACvB,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;gBAC/B,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,GAAG;oBACT,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAAkB,EAAE,MAAc,EAAE,MAAkB,EAAE,UAAmB;QACpF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;YACrB,IAAI,UAAU;gBAAE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7C,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,UAAkB,EAAE,UAAkB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,UAAU;YAChB,EAAE,EAAE,QAAQ;YACZ,IAAI,EAAE,OAAO;SACd,CAAC,CAAC;QAEH,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,UAAkB;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,UAAU,EAAE,KAAK;gBACjB,UAAU,EAAE,CAAC;gBACb,iBAAiB,EAAE,EAAE;gBACrB,UAAU,EAAE,CAAC;gBACb,KAAK,EAAE,CAAC;gBACR,KAAK,EAAE,CAAC;aACT,CAAC;QACJ,CAAC;QAED,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;YAC/B,UAAU,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;YACxC,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YACpC,iBAAiB,EAAE,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC;YACpD,UAAU,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;YACxC,KAAK,EAAE,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;YACjC,KAAK,EAAE,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;SAClC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAqB;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,MAAM,GAAG,GAAG,CAAC,MAAc,EAAW,EAAE;YACtC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAE3B,sBAAsB;YACtB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;YAC5D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBAAE,OAAO,IAAI,CAAC;gBAChC,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACvC,OAAO,IAAI,CAAC,CAAC,yBAAyB;gBACxC,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,IAAI,GAAG,CAAC,MAAM,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAqB;QAC5C,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;QAC/D,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAExC,uBAAuB;QACvB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC;QAED,qCAAqC;QACrC,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC7B,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,YAAY,CAAC,KAAqB;QACxC,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;IAC5D,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,KAAqB;QACjD,MAAM,QAAQ,GAAe,EAAE,CAAC;QAChC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;QAEhD,4BAA4B;QAC5B,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACzC,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtB,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC5C,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,WAAW,EAAE,CAAC;YAC1C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAqB;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB;QAEjD,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QACpE,OAAO,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC;IACnC,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAqB;QAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAU,EAAE;YAC1C,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAEnD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YACrF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACtB,OAAO,CAAC,CAAC;YACX,CAAC;YAED,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxE,MAAM,KAAK,GAAG,cAAc,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC1B,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAqB;QAC1C,0CAA0C;QAC1C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE9C,gCAAgC;QAChC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YACrF,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAC/B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7D,CAAC,CAAC,CAAC,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC1B,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,UAAkB;QACzB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAAkB;QAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;IAEO,OAAO;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9C,IAAI,GAAG,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACxC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAEO,WAAW;QACjB,IAAI,MAAM,GAAwC,IAAI,CAAC;QAEvD,KAAK,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9C,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC9C,MAAM,GAAG,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;YACtD,CAAC;QACH,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;CACF;AAlTD,sDAkTC;AAEY,QAAA,YAAY,GAAG,IAAI,qBAAqB,EAAE,CAAC"}

package/dist/aerl/ExecutionInterceptor.d.ts

@@ -0,0 +1,94 @@
+/**
+ * AERL - AI Execution Reliability Layer
+ * Execution Interceptor Module
+ *
+ * PURPOSE:
+ * - Synchronous pre-call decision engine
+ * - Allow / block / modify decisions
+ * - Deterministic + cached
+ * - <5ms p95 latency
+ *
+ * DESIGN:
+ * - In-process only
+ * - No external I/O in hot path
+ * - LRU cache for sub-millisecond repeat decisions
+ * - Fail-open with logging
+ */
+export type DecisionAction = 'allow' | 'block' | 'modify';
+export interface ExecutionContext {
+    sessionId: string;
+    agentId: string;
+    workflowId: string;
+    stepNumber: number;
+    previousSteps: number;
+    totalCost: number;
+    totalTokens: number;
+    successCount: number;
+    failureCount: number;
+    startTime: number;
+    goal?: string;
+}
+export interface ExecutionRequest {
+    id: string;
+    provider: 'openai' | 'anthropic' | 'langchain' | 'custom';
+    operation: string;
+    toolName?: string;
+    model?: string;
+    estimatedTokens: number;
+    estimatedCost: number;
+    context: ExecutionContext;
+    inputHash: string;
+    dependencies?: string[];
+}
+export interface DecisionResult {
+    action: DecisionAction;
+    reason: string;
+    reliabilityScore: number;
+    confidence: number;
+    latencyMs: number;
+    suggestedModification?: {
+        alternativeTool?: string;
+        retryStrategy?: 'immediate' | 'backoff' | 'circuit_break';
+        parameterAdjustments?: Record<string, number>;
+    };
+    estimatedSavings?: number;
+    cacheHit: boolean;
+}
+export interface InterceptorConfig {
+    failOpen: boolean;
+    maxLatencyMs: number;
+    cacheSize: number;
+    defaultPolicy: {
+        maxCostPerWorkflow: number;
+        maxStepsPerWorkflow: number;
+        maxCostPerStep: number;
+        minReliabilityScore: number;
+    };
+}
+export declare class ExecutionInterceptor {
+    private config;
+    private cache;
+    private metrics;
+    constructor(config?: Partial<InterceptorConfig>);
+    /**
+     * Main interception - MUST complete in <5ms p95
+     */
+    intercept(request: ExecutionRequest): DecisionResult;
+    private evaluatePolicy;
+    private calculateReliabilityScore;
+    private generateCacheKey;
+    private recordLatency;
+    getMetrics(): {
+        cacheHitRate: number;
+        blockRate: number;
+        p95LatencyMs: number;
+        totalRequests: number;
+        cacheHits: number;
+        blockedRequests: number;
+        modifiedRequests: number;
+        latencySamples: number[];
+    };
+    reset(): void;
+}
+export declare const interceptor: ExecutionInterceptor;
+//# sourceMappingURL=ExecutionInterceptor.d.ts.map

package/dist/aerl/ExecutionInterceptor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ExecutionInterceptor.d.ts","sourceRoot":"","sources":["../../src/aerl/ExecutionInterceptor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAKH,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG,OAAO,GAAG,QAAQ,CAAC;AAE1D,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,QAAQ,GAAG,WAAW,GAAG,WAAW,GAAG,QAAQ,CAAC;IAC1D,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,gBAAgB,CAAC;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,cAAc,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB,EAAE,MAAM,CAAC;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,qBAAqB,CAAC,EAAE;QACtB,eAAe,CAAC,EAAE,MAAM,CAAC;QACzB,aAAa,CAAC,EAAE,WAAW,GAAG,SAAS,GAAG,eAAe,CAAC;QAC1D,oBAAoB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAC/C,CAAC;IACF,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,QAAQ,EAAE,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,OAAO,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE;QACb,kBAAkB,EAAE,MAAM,CAAC;QAC3B,mBAAmB,EAAE,MAAM,CAAC;QAC5B,cAAc,EAAE,MAAM,CAAC;QACvB,mBAAmB,EAAE,MAAM,CAAC;KAC7B,CAAC;CACH;AAsCD,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,KAAK,CAAmC;IAChD,OAAO,CAAC,OAAO,CAMb;gBAEU,MAAM,GAAE,OAAO,CAAC,iBAAiB,CAAM;IAwBnD;;OAEG;IACH,SAAS,CAAC,OAAO,EAAE,gBAAgB,GAAG,cAAc;IA2DpD,OAAO,CAAC,cAAc;IAsEtB,OAAO,CAAC,yBAAyB;IA4BjC,OAAO,CAAC,gBAAgB;IAKxB,OAAO,CAAC,aAAa;IASrB,UAAU;;;;uBA7MO,MAAM;mBACV,MAAM;yBACA,MAAM;0BACL,MAAM;wBACR,MAAM,EAAE;;IAmN1B,KAAK,IAAI,IAAI;CAUd;AAED,eAAO,MAAM,WAAW,sBAA6B,CAAC"}