agentic-flow 2.0.7 → 3.0.0-alpha.2

package/dist/packages/agentdb/src/utils/LegacyAttentionAdapter.d.ts

@@ -0,0 +1,93 @@
+/**
+ * LegacyAttentionAdapter - Compatibility layer for deprecated services/AttentionService
+ *
+ * This module re-exports the legacy config types and provides a backward-compatible
+ * AttentionService class that delegates to the production controllers/AttentionService.
+ *
+ * Created as part of ADR-056: consolidation of services/AttentionService into controllers.
+ *
+ * @module LegacyAttentionAdapter
+ */
+type Database = any;
+export interface HyperbolicAttentionConfig {
+    enabled: boolean;
+    curvature?: number;
+    dimension?: number;
+    temperature?: number;
+}
+export interface FlashAttentionConfig {
+    enabled: boolean;
+    blockSize?: number;
+    useSIMD?: boolean;
+    maxSeqLen?: number;
+}
+export interface GraphRoPEConfig {
+    enabled: boolean;
+    maxHops?: number;
+    rotaryDim?: number;
+    baseFreq?: number;
+}
+export interface MoEAttentionConfig {
+    enabled: boolean;
+    numExperts?: number;
+    topK?: number;
+    expertDomains?: string[];
+}
+export interface HyperbolicAttentionResult {
+    attended: Float32Array;
+    weights: Float32Array;
+    distances: number[];
+    metrics: {
+        computeTimeMs: number;
+        memoryUsedMB: number;
+    };
+}
+export interface FlashAttentionResult {
+    output: Float32Array;
+    scores?: Float32Array;
+    metrics: {
+        computeTimeMs: number;
+        peakMemoryMB: number;
+        blocksProcessed: number;
+    };
+}
+export interface GraphRoPEResult {
+    queries: Float32Array;
+    keys: Float32Array;
+    hopEncodings: Float32Array;
+    metrics: {
+        computeTimeMs: number;
+    };
+}
+/**
+ * Backward-compatible AttentionService that delegates to the production
+ * controllers/AttentionService while maintaining the legacy constructor
+ * and method signatures used by ExplainableRecall, NightlyLearner, and
+ * CausalMemoryGraph.
+ */
+export declare class AttentionService {
+    private delegate;
+    private hyperbolicConfig;
+    private flashConfig;
+    private graphRoPEConfig;
+    constructor(_db: Database, configs?: {
+        hyperbolic?: Partial<HyperbolicAttentionConfig>;
+        flash?: Partial<FlashAttentionConfig>;
+        graphRoPE?: Partial<GraphRoPEConfig>;
+        moe?: Partial<MoEAttentionConfig>;
+    });
+    hyperbolicAttention(queries: Float32Array, keys: Float32Array, values: Float32Array, hierarchyLevels: number[]): Promise<HyperbolicAttentionResult>;
+    flashAttention(queries: Float32Array, keys: Float32Array, values: Float32Array): Promise<FlashAttentionResult>;
+    graphRoPE(queries: Float32Array, keys: Float32Array, hopDistances: number[][]): Promise<GraphRoPEResult>;
+    private fallbackHyperbolicAttention;
+    private fallbackFlashAttention;
+    private fallbackGraphRoPE;
+    private softmax;
+    getConfig(): {
+        hyperbolic: HyperbolicAttentionConfig;
+        flash: FlashAttentionConfig;
+        graphRoPE: GraphRoPEConfig;
+    };
+}
+export {};
+//# sourceMappingURL=LegacyAttentionAdapter.d.ts.map

package/dist/packages/agentdb/src/utils/LegacyAttentionAdapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LegacyAttentionAdapter.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/utils/LegacyAttentionAdapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAMH,KAAK,QAAQ,GAAG,GAAG,CAAC;AAMpB,MAAM,WAAW,yBAAyB;IACxC,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;CAC1B;AAGD,MAAM,WAAW,yBAAyB;IACxC,QAAQ,EAAE,YAAY,CAAC;IACvB,OAAO,EAAE,YAAY,CAAC;IACtB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE;QACP,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;KACtB,CAAC;CACH;AAED,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE,YAAY,CAAC;IACrB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,OAAO,EAAE;QACP,aAAa,EAAE,MAAM,CAAC;QACtB,YAAY,EAAE,MAAM,CAAC;QACrB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;CACH;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,YAAY,CAAC;IACtB,IAAI,EAAE,YAAY,CAAC;IACnB,YAAY,EAAE,YAAY,CAAC;IAC3B,OAAO,EAAE;QACP,aAAa,EAAE,MAAM,CAAC;KACvB,CAAC;CACH;AAMD;;;;;GAKG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAA8B;IAC9C,OAAO,CAAC,gBAAgB,CAA4B;IACpD,OAAO,CAAC,WAAW,CAAuB;IAC1C,OAAO,CAAC,eAAe,CAAkB;gBAGvC,GAAG,EAAE,QAAQ,EACb,OAAO,CAAC,EAAE;QACR,UAAU,CAAC,EAAE,OAAO,CAAC,yBAAyB,CAAC,CAAC;QAChD,KAAK,CAAC,EAAE,OAAO,CAAC,oBAAoB,CAAC,CAAC;QACtC,SAAS,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,CAAC;QACrC,GAAG,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;KACnC;IAoCG,mBAAmB,CACvB,OAAO,EAAE,YAAY,EACrB,IAAI,EAAE,YAAY,EAClB,MAAM,EAAE,YAAY,EACpB,eAAe,EAAE,MAAM,EAAE,GACxB,OAAO,CAAC,yBAAyB,CAAC;IA+B/B,cAAc,CAClB,OAAO,EAAE,YAAY,EACrB,IAAI,EAAE,YAAY,EAClB,MAAM,EAAE,YAAY,GACnB,OAAO,CAAC,oBAAoB,CAAC;IAwB1B,SAAS,CACb,OAAO,EAAE,YAAY,EACrB,IAAI,EAAE,YAAY,EAClB,YAAY,EAAE,MAAM,EAAE,EAAE,GACvB,OAAO,CAAC,eAAe,CAAC;IAU3B,OAAO,CAAC,2BAA2B;IAkDnC,OAAO,CAAC,sBAAsB;IA2D9B,OAAO,CAAC,iBAAiB;IAqCzB,OAAO,CAAC,OAAO;IAuBf,SAAS;;;;;CAOV"}

package/dist/packages/agentdb/src/utils/LegacyAttentionAdapter.js

@@ -0,0 +1,241 @@
+/**
+ * LegacyAttentionAdapter - Compatibility layer for deprecated services/AttentionService
+ *
+ * This module re-exports the legacy config types and provides a backward-compatible
+ * AttentionService class that delegates to the production controllers/AttentionService.
+ *
+ * Created as part of ADR-056: consolidation of services/AttentionService into controllers.
+ *
+ * @module LegacyAttentionAdapter
+ */
+import { AttentionService as ControllersAttentionService } from '../controllers/AttentionService.js';
+// ========================================================================
+// Legacy AttentionService Adapter
+// ========================================================================
+/**
+ * Backward-compatible AttentionService that delegates to the production
+ * controllers/AttentionService while maintaining the legacy constructor
+ * and method signatures used by ExplainableRecall, NightlyLearner, and
+ * CausalMemoryGraph.
+ */
+export class AttentionService {
+    delegate;
+    hyperbolicConfig;
+    flashConfig;
+    graphRoPEConfig;
+    constructor(_db, configs) {
+        this.hyperbolicConfig = {
+            enabled: false,
+            curvature: 1.0,
+            dimension: 384,
+            temperature: 1.0,
+            ...configs?.hyperbolic,
+        };
+        this.flashConfig = {
+            enabled: false,
+            blockSize: 256,
+            useSIMD: true,
+            maxSeqLen: 4096,
+            ...configs?.flash,
+        };
+        this.graphRoPEConfig = {
+            enabled: false,
+            maxHops: 10,
+            rotaryDim: 64,
+            baseFreq: 10000,
+            ...configs?.graphRoPE,
+        };
+        const dim = this.hyperbolicConfig.dimension ?? 384;
+        this.delegate = new ControllersAttentionService({
+            numHeads: 1,
+            headDim: dim,
+            embedDim: dim,
+            useFlash: this.flashConfig.enabled,
+            useHyperbolic: this.hyperbolicConfig.enabled,
+        });
+    }
+    async hyperbolicAttention(queries, keys, values, hierarchyLevels) {
+        const startTime = Date.now();
+        const dim = this.hyperbolicConfig.dimension ?? 384;
+        const numKeys = keys.length / dim;
+        try {
+            const result = await this.delegate.hyperbolicAttention(queries, keys, values, this.hyperbolicConfig.curvature ?? 1.0);
+            const weights = result.weights ?? new Float32Array(numKeys);
+            const distances = hierarchyLevels.slice(0, numKeys);
+            return {
+                attended: result.output,
+                weights,
+                distances,
+                metrics: {
+                    computeTimeMs: result.executionTimeMs ?? (Date.now() - startTime),
+                    memoryUsedMB: (result.output.byteLength + weights.byteLength) / (1024 * 1024),
+                },
+            };
+        }
+        catch {
+            // Fallback: simple hierarchical attention
+            return this.fallbackHyperbolicAttention(queries, keys, values, hierarchyLevels, startTime);
+        }
+    }
+    async flashAttention(queries, keys, values) {
+        const startTime = Date.now();
+        try {
+            const result = await this.delegate.flashAttention(queries, keys, values);
+            return {
+                output: result.output,
+                metrics: {
+                    computeTimeMs: result.executionTimeMs ?? (Date.now() - startTime),
+                    peakMemoryMB: result.output.byteLength / (1024 * 1024),
+                    blocksProcessed: 1,
+                },
+            };
+        }
+        catch {
+            // Fallback: chunked attention
+            return this.fallbackFlashAttention(queries, keys, values, startTime);
+        }
+    }
+    async graphRoPE(queries, keys, hopDistances) {
+        const startTime = Date.now();
+        // GraphRoPE is not in the controllers version; use fallback
+        return this.fallbackGraphRoPE(queries, keys, hopDistances, startTime);
+    }
+    // ========================================================================
+    // Fallback implementations (preserved from deprecated services version)
+    // ========================================================================
+    fallbackHyperbolicAttention(queries, keys, values, hierarchyLevels, startTime) {
+        const dim = this.hyperbolicConfig.dimension;
+        const numQueries = queries.length / dim;
+        const numKeys = keys.length / dim;
+        const scores = new Float32Array(numQueries * numKeys);
+        const distances = [];
+        for (let i = 0; i < numQueries; i++) {
+            for (let j = 0; j < numKeys; j++) {
+                let score = 0;
+                for (let d = 0; d < dim; d++) {
+                    score += queries[i * dim + d] * keys[j * dim + d];
+                }
+                const hierarchyScale = Math.exp(-hierarchyLevels[j] * 0.5);
+                score *= hierarchyScale;
+                scores[i * numKeys + j] = score;
+                distances.push(hierarchyLevels[j]);
+            }
+        }
+        const weights = this.softmax(scores, numQueries, numKeys);
+        const attended = new Float32Array(numQueries * dim);
+        for (let i = 0; i < numQueries; i++) {
+            for (let j = 0; j < numKeys; j++) {
+                const weight = weights[i * numKeys + j];
+                for (let d = 0; d < dim; d++) {
+                    attended[i * dim + d] += weight * values[j * dim + d];
+                }
+            }
+        }
+        return {
+            attended,
+            weights,
+            distances,
+            metrics: {
+                computeTimeMs: Date.now() - startTime,
+                memoryUsedMB: (attended.byteLength + weights.byteLength) / (1024 * 1024),
+            },
+        };
+    }
+    fallbackFlashAttention(queries, keys, values, startTime) {
+        const dim = 384;
+        const numQueries = queries.length / dim;
+        const numKeys = keys.length / dim;
+        const blockSize = this.flashConfig.blockSize;
+        const output = new Float32Array(numQueries * dim);
+        let blocksProcessed = 0;
+        let peakMemory = 0;
+        for (let qStart = 0; qStart < numQueries; qStart += blockSize) {
+            const qEnd = Math.min(qStart + blockSize, numQueries);
+            for (let kStart = 0; kStart < numKeys; kStart += blockSize) {
+                const kEnd = Math.min(kStart + blockSize, numKeys);
+                const blockScores = new Float32Array((qEnd - qStart) * (kEnd - kStart));
+                for (let i = qStart; i < qEnd; i++) {
+                    for (let j = kStart; j < kEnd; j++) {
+                        let score = 0;
+                        for (let d = 0; d < dim; d++) {
+                            score += queries[i * dim + d] * keys[j * dim + d];
+                        }
+                        blockScores[(i - qStart) * (kEnd - kStart) + (j - kStart)] = score;
+                    }
+                }
+                const blockWeights = this.softmax(blockScores, qEnd - qStart, kEnd - kStart);
+                for (let i = qStart; i < qEnd; i++) {
+                    for (let j = kStart; j < kEnd; j++) {
+                        const weight = blockWeights[(i - qStart) * (kEnd - kStart) + (j - kStart)];
+                        for (let d = 0; d < dim; d++) {
+                            output[i * dim + d] += weight * values[j * dim + d];
+                        }
+                    }
+                }
+                peakMemory = Math.max(peakMemory, blockScores.byteLength + blockWeights.byteLength);
+                blocksProcessed++;
+            }
+        }
+        return {
+            output,
+            metrics: {
+                computeTimeMs: Date.now() - startTime,
+                peakMemoryMB: peakMemory / (1024 * 1024),
+                blocksProcessed,
+            },
+        };
+    }
+    fallbackGraphRoPE(queries, keys, hopDistances, startTime) {
+        const dim = 384;
+        const numQueries = queries.length / dim;
+        const numKeys = keys.length / dim;
+        const encodedQueries = new Float32Array(queries);
+        const encodedKeys = new Float32Array(keys);
+        const hopEncodings = new Float32Array(numQueries * numKeys);
+        for (let i = 0; i < numQueries; i++) {
+            for (let j = 0; j < numKeys; j++) {
+                const distance = hopDistances[i]?.[j] || 0;
+                const scale = 1.0 / (1.0 + distance);
+                hopEncodings[i * numKeys + j] = scale;
+                for (let d = 0; d < dim; d++) {
+                    encodedQueries[i * dim + d] *= Math.sqrt(scale);
+                    encodedKeys[j * dim + d] *= Math.sqrt(scale);
+                }
+            }
+        }
+        return {
+            queries: encodedQueries,
+            keys: encodedKeys,
+            hopEncodings,
+            metrics: {
+                computeTimeMs: Date.now() - startTime,
+            },
+        };
+    }
+    softmax(scores, rows, cols) {
+        const result = new Float32Array(scores.length);
+        for (let i = 0; i < rows; i++) {
+            let max = -Infinity;
+            for (let j = 0; j < cols; j++) {
+                max = Math.max(max, scores[i * cols + j]);
+            }
+            let sum = 0;
+            for (let j = 0; j < cols; j++) {
+                result[i * cols + j] = Math.exp(scores[i * cols + j] - max);
+                sum += result[i * cols + j];
+            }
+            for (let j = 0; j < cols; j++) {
+                result[i * cols + j] /= sum;
+            }
+        }
+        return result;
+    }
+    getConfig() {
+        return {
+            hyperbolic: this.hyperbolicConfig,
+            flash: this.flashConfig,
+            graphRoPE: this.graphRoPEConfig,
+        };
+    }
+}
+//# sourceMappingURL=LegacyAttentionAdapter.js.map

package/dist/packages/agentdb/src/utils/LegacyAttentionAdapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LegacyAttentionAdapter.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/utils/LegacyAttentionAdapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,gBAAgB,IAAI,2BAA2B,EAAE,MAAM,oCAAoC,CAAC;AAoErG,2EAA2E;AAC3E,kCAAkC;AAClC,2EAA2E;AAE3E;;;;;GAKG;AACH,MAAM,OAAO,gBAAgB;IACnB,QAAQ,CAA8B;IACtC,gBAAgB,CAA4B;IAC5C,WAAW,CAAuB;IAClC,eAAe,CAAkB;IAEzC,YACE,GAAa,EACb,OAKC;QAED,IAAI,CAAC,gBAAgB,GAAG;YACtB,OAAO,EAAE,KAAK;YACd,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,GAAG;YACd,WAAW,EAAE,GAAG;YAChB,GAAG,OAAO,EAAE,UAAU;SACvB,CAAC;QAEF,IAAI,CAAC,WAAW,GAAG;YACjB,OAAO,EAAE,KAAK;YACd,SAAS,EAAE,GAAG;YACd,OAAO,EAAE,IAAI;YACb,SAAS,EAAE,IAAI;YACf,GAAG,OAAO,EAAE,KAAK;SAClB,CAAC;QAEF,IAAI,CAAC,eAAe,GAAG;YACrB,OAAO,EAAE,KAAK;YACd,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,EAAE;YACb,QAAQ,EAAE,KAAK;YACf,GAAG,OAAO,EAAE,SAAS;SACtB,CAAC;QAEF,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,IAAI,GAAG,CAAC;QACnD,IAAI,CAAC,QAAQ,GAAG,IAAI,2BAA2B,CAAC;YAC9C,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,GAAG;YACZ,QAAQ,EAAE,GAAG;YACb,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO;YAClC,aAAa,EAAE,IAAI,CAAC,gBAAgB,CAAC,OAAO;SAC7C,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,mBAAmB,CACvB,OAAqB,EACrB,IAAkB,EAClB,MAAoB,EACpB,eAAyB;QAEzB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,IAAI,GAAG,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAElC,IAAI,CAAC;YACH,MAAM,MAAM,GAAoB,MAAM,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CACrE,OAAO,EACP,IAAI,EACJ,MAAM,EACN,IAAI,CAAC,gBAAgB,CAAC,SAAS,IAAI,GAAG,CACvC,CAAC;YAEF,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;YAC5D,MAAM,SAAS,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAEpD,OAAO;gBACL,QAAQ,EAAE,MAAM,CAAC,MAAM;gBACvB,OAAO;gBACP,SAAS;gBACT,OAAO,EAAE;oBACP,aAAa,EAAE,MAAM,CAAC,eAAe,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;oBACjE,YAAY,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;iBAC9E;aACF,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,0CAA0C;YAC1C,OAAO,IAAI,CAAC,2BAA2B,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;QAC7F,CAAC;IACH,CAAC;IAED,KAAK,CAAC,cAAc,CAClB,OAAqB,EACrB,IAAkB,EAClB,MAAoB;QAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,IAAI,CAAC;YACH,MAAM,MAAM,GAAoB,MAAM,IAAI,CAAC,QAAQ,CAAC,cAAc,CAChE,OAAO,EACP,IAAI,EACJ,MAAM,CACP,CAAC;YAEF,OAAO;gBACL,MAAM,EAAE,MAAM,CAAC,MAAM;gBACrB,OAAO,EAAE;oBACP,aAAa,EAAE,MAAM,CAAC,eAAe,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;oBACjE,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;oBACtD,eAAe,EAAE,CAAC;iBACnB;aACF,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,8BAA8B;YAC9B,OAAO,IAAI,CAAC,sBAAsB,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IAED,KAAK,CAAC,SAAS,CACb,OAAqB,EACrB,IAAkB,EAClB,YAAwB;QAExB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,4DAA4D;QAC5D,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IACxE,CAAC;IAED,2EAA2E;IAC3E,wEAAwE;IACxE,2EAA2E;IAEnE,2BAA2B,CACjC,OAAqB,EACrB,IAAkB,EAClB,MAAoB,EACpB,eAAyB,EACzB,SAAiB;QAEjB,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAU,CAAC;QAC7C,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAElC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC;QACtD,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,IAAI,KAAK,GAAG,CAAC,CAAC;gBACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,KAAK,IAAI,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;gBACpD,CAAC;gBACD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBAC3D,KAAK,IAAI,cAAc,CAAC;gBACxB,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;gBAChC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;QAE1D,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,QAAQ,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,QAAQ;YACR,OAAO;YACP,SAAS;YACT,OAAO,EAAE;gBACP,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;gBACrC,YAAY,EAAE,CAAC,QAAQ,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;aACzE;SACF,CAAC;IACJ,CAAC;IAEO,sBAAsB,CAC5B,OAAqB,EACrB,IAAkB,EAClB,MAAoB,EACpB,SAAiB;QAEjB,MAAM,GAAG,GAAG,GAAG,CAAC;QAChB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,SAAU,CAAC;QAE9C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAClD,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE,MAAM,IAAI,SAAS,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,UAAU,CAAC,CAAC;YAEtD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,EAAE,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,OAAO,CAAC,CAAC;gBAEnD,MAAM,WAAW,GAAG,IAAI,YAAY,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;gBAExE,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;wBACnC,IAAI,KAAK,GAAG,CAAC,CAAC;wBACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC7B,KAAK,IAAI,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;wBACpD,CAAC;wBACD,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC;oBACrE,CAAC;gBACH,CAAC;gBAED,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC;gBAE7E,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;wBACnC,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBAC3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC7B,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;wBACtD,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,WAAW,CAAC,UAAU,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;gBACpF,eAAe,EAAE,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM;YACN,OAAO,EAAE;gBACP,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;gBACrC,YAAY,EAAE,UAAU,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;gBACxC,eAAe;aAChB;SACF,CAAC;IACJ,CAAC;IAEO,iBAAiB,CACvB,OAAqB,EACrB,IAAkB,EAClB,YAAwB,EACxB,SAAiB;QAEjB,MAAM,GAAG,GAAG,GAAG,CAAC;QAChB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAElC,MAAM,cAAc,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC;QAE5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC;gBACrC,YAAY,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;gBAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,cAAc,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAChD,WAAW,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC/C,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,OAAO,EAAE,cAAc;YACvB,IAAI,EAAE,WAAW;YACjB,YAAY;YACZ,OAAO,EAAE;gBACP,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACtC;SACF,CAAC;IACJ,CAAC;IAEO,OAAO,CAAC,MAAoB,EAAE,IAAY,EAAE,IAAY;QAC9D,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YAED,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBAC5D,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YAC9B,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS;QACP,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,gBAAgB;YACjC,KAAK,EAAE,IAAI,CAAC,WAAW;YACvB,SAAS,EAAE,IAAI,CAAC,eAAe;SAChC,CAAC;IACJ,CAAC;CACF","sourcesContent":["/**\n * LegacyAttentionAdapter - Compatibility layer for deprecated services/AttentionService\n *\n * This module re-exports the legacy config types and provides a backward-compatible\n * AttentionService class that delegates to the production controllers/AttentionService.\n *\n * Created as part of ADR-056: consolidation of services/AttentionService into controllers.\n *\n * @module LegacyAttentionAdapter\n */\n\nimport { AttentionService as ControllersAttentionService } from '../controllers/AttentionService.js';\nimport type { AttentionResult } from '../controllers/AttentionService.js';\n\n// Database type placeholder (matches legacy pattern)\ntype Database = any;\n\n// ========================================================================\n// Legacy Config Types (previously in services/AttentionService.ts)\n// ========================================================================\n\nexport interface HyperbolicAttentionConfig {\n  enabled: boolean;\n  curvature?: number;\n  dimension?: number;\n  temperature?: number;\n}\n\nexport interface FlashAttentionConfig {\n  enabled: boolean;\n  blockSize?: number;\n  useSIMD?: boolean;\n  maxSeqLen?: number;\n}\n\nexport interface GraphRoPEConfig {\n  enabled: boolean;\n  maxHops?: number;\n  rotaryDim?: number;\n  baseFreq?: number;\n}\n\nexport interface MoEAttentionConfig {\n  enabled: boolean;\n  numExperts?: number;\n  topK?: number;\n  expertDomains?: string[];\n}\n\n// Legacy result types\nexport interface HyperbolicAttentionResult {\n  attended: Float32Array;\n  weights: Float32Array;\n  distances: number[];\n  metrics: {\n    computeTimeMs: number;\n    memoryUsedMB: number;\n  };\n}\n\nexport interface FlashAttentionResult {\n  output: Float32Array;\n  scores?: Float32Array;\n  metrics: {\n    computeTimeMs: number;\n    peakMemoryMB: number;\n    blocksProcessed: number;\n  };\n}\n\nexport interface GraphRoPEResult {\n  queries: Float32Array;\n  keys: Float32Array;\n  hopEncodings: Float32Array;\n  metrics: {\n    computeTimeMs: number;\n  };\n}\n\n// ========================================================================\n// Legacy AttentionService Adapter\n// ========================================================================\n\n/**\n * Backward-compatible AttentionService that delegates to the production\n * controllers/AttentionService while maintaining the legacy constructor\n * and method signatures used by ExplainableRecall, NightlyLearner, and\n * CausalMemoryGraph.\n */\nexport class AttentionService {\n  private delegate: ControllersAttentionService;\n  private hyperbolicConfig: HyperbolicAttentionConfig;\n  private flashConfig: FlashAttentionConfig;\n  private graphRoPEConfig: GraphRoPEConfig;\n\n  constructor(\n    _db: Database,\n    configs?: {\n      hyperbolic?: Partial<HyperbolicAttentionConfig>;\n      flash?: Partial<FlashAttentionConfig>;\n      graphRoPE?: Partial<GraphRoPEConfig>;\n      moe?: Partial<MoEAttentionConfig>;\n    }\n  ) {\n    this.hyperbolicConfig = {\n      enabled: false,\n      curvature: 1.0,\n      dimension: 384,\n      temperature: 1.0,\n      ...configs?.hyperbolic,\n    };\n\n    this.flashConfig = {\n      enabled: false,\n      blockSize: 256,\n      useSIMD: true,\n      maxSeqLen: 4096,\n      ...configs?.flash,\n    };\n\n    this.graphRoPEConfig = {\n      enabled: false,\n      maxHops: 10,\n      rotaryDim: 64,\n      baseFreq: 10000,\n      ...configs?.graphRoPE,\n    };\n\n    const dim = this.hyperbolicConfig.dimension ?? 384;\n    this.delegate = new ControllersAttentionService({\n      numHeads: 1,\n      headDim: dim,\n      embedDim: dim,\n      useFlash: this.flashConfig.enabled,\n      useHyperbolic: this.hyperbolicConfig.enabled,\n    });\n  }\n\n  async hyperbolicAttention(\n    queries: Float32Array,\n    keys: Float32Array,\n    values: Float32Array,\n    hierarchyLevels: number[]\n  ): Promise<HyperbolicAttentionResult> {\n    const startTime = Date.now();\n    const dim = this.hyperbolicConfig.dimension ?? 384;\n    const numKeys = keys.length / dim;\n\n    try {\n      const result: AttentionResult = await this.delegate.hyperbolicAttention(\n        queries,\n        keys,\n        values,\n        this.hyperbolicConfig.curvature ?? 1.0\n      );\n\n      const weights = result.weights ?? new Float32Array(numKeys);\n      const distances = hierarchyLevels.slice(0, numKeys);\n\n      return {\n        attended: result.output,\n        weights,\n        distances,\n        metrics: {\n          computeTimeMs: result.executionTimeMs ?? (Date.now() - startTime),\n          memoryUsedMB: (result.output.byteLength + weights.byteLength) / (1024 * 1024),\n        },\n      };\n    } catch {\n      // Fallback: simple hierarchical attention\n      return this.fallbackHyperbolicAttention(queries, keys, values, hierarchyLevels, startTime);\n    }\n  }\n\n  async flashAttention(\n    queries: Float32Array,\n    keys: Float32Array,\n    values: Float32Array\n  ): Promise<FlashAttentionResult> {\n    const startTime = Date.now();\n\n    try {\n      const result: AttentionResult = await this.delegate.flashAttention(\n        queries,\n        keys,\n        values\n      );\n\n      return {\n        output: result.output,\n        metrics: {\n          computeTimeMs: result.executionTimeMs ?? (Date.now() - startTime),\n          peakMemoryMB: result.output.byteLength / (1024 * 1024),\n          blocksProcessed: 1,\n        },\n      };\n    } catch {\n      // Fallback: chunked attention\n      return this.fallbackFlashAttention(queries, keys, values, startTime);\n    }\n  }\n\n  async graphRoPE(\n    queries: Float32Array,\n    keys: Float32Array,\n    hopDistances: number[][]\n  ): Promise<GraphRoPEResult> {\n    const startTime = Date.now();\n    // GraphRoPE is not in the controllers version; use fallback\n    return this.fallbackGraphRoPE(queries, keys, hopDistances, startTime);\n  }\n\n  // ========================================================================\n  // Fallback implementations (preserved from deprecated services version)\n  // ========================================================================\n\n  private fallbackHyperbolicAttention(\n    queries: Float32Array,\n    keys: Float32Array,\n    values: Float32Array,\n    hierarchyLevels: number[],\n    startTime: number\n  ): HyperbolicAttentionResult {\n    const dim = this.hyperbolicConfig.dimension!;\n    const numQueries = queries.length / dim;\n    const numKeys = keys.length / dim;\n\n    const scores = new Float32Array(numQueries * numKeys);\n    const distances: number[] = [];\n\n    for (let i = 0; i < numQueries; i++) {\n      for (let j = 0; j < numKeys; j++) {\n        let score = 0;\n        for (let d = 0; d < dim; d++) {\n          score += queries[i * dim + d] * keys[j * dim + d];\n        }\n        const hierarchyScale = Math.exp(-hierarchyLevels[j] * 0.5);\n        score *= hierarchyScale;\n        scores[i * numKeys + j] = score;\n        distances.push(hierarchyLevels[j]);\n      }\n    }\n\n    const weights = this.softmax(scores, numQueries, numKeys);\n\n    const attended = new Float32Array(numQueries * dim);\n    for (let i = 0; i < numQueries; i++) {\n      for (let j = 0; j < numKeys; j++) {\n        const weight = weights[i * numKeys + j];\n        for (let d = 0; d < dim; d++) {\n          attended[i * dim + d] += weight * values[j * dim + d];\n        }\n      }\n    }\n\n    return {\n      attended,\n      weights,\n      distances,\n      metrics: {\n        computeTimeMs: Date.now() - startTime,\n        memoryUsedMB: (attended.byteLength + weights.byteLength) / (1024 * 1024),\n      },\n    };\n  }\n\n  private fallbackFlashAttention(\n    queries: Float32Array,\n    keys: Float32Array,\n    values: Float32Array,\n    startTime: number\n  ): FlashAttentionResult {\n    const dim = 384;\n    const numQueries = queries.length / dim;\n    const numKeys = keys.length / dim;\n    const blockSize = this.flashConfig.blockSize!;\n\n    const output = new Float32Array(numQueries * dim);\n    let blocksProcessed = 0;\n    let peakMemory = 0;\n\n    for (let qStart = 0; qStart < numQueries; qStart += blockSize) {\n      const qEnd = Math.min(qStart + blockSize, numQueries);\n\n      for (let kStart = 0; kStart < numKeys; kStart += blockSize) {\n        const kEnd = Math.min(kStart + blockSize, numKeys);\n\n        const blockScores = new Float32Array((qEnd - qStart) * (kEnd - kStart));\n\n        for (let i = qStart; i < qEnd; i++) {\n          for (let j = kStart; j < kEnd; j++) {\n            let score = 0;\n            for (let d = 0; d < dim; d++) {\n              score += queries[i * dim + d] * keys[j * dim + d];\n            }\n            blockScores[(i - qStart) * (kEnd - kStart) + (j - kStart)] = score;\n          }\n        }\n\n        const blockWeights = this.softmax(blockScores, qEnd - qStart, kEnd - kStart);\n\n        for (let i = qStart; i < qEnd; i++) {\n          for (let j = kStart; j < kEnd; j++) {\n            const weight = blockWeights[(i - qStart) * (kEnd - kStart) + (j - kStart)];\n            for (let d = 0; d < dim; d++) {\n              output[i * dim + d] += weight * values[j * dim + d];\n            }\n          }\n        }\n\n        peakMemory = Math.max(peakMemory, blockScores.byteLength + blockWeights.byteLength);\n        blocksProcessed++;\n      }\n    }\n\n    return {\n      output,\n      metrics: {\n        computeTimeMs: Date.now() - startTime,\n        peakMemoryMB: peakMemory / (1024 * 1024),\n        blocksProcessed,\n      },\n    };\n  }\n\n  private fallbackGraphRoPE(\n    queries: Float32Array,\n    keys: Float32Array,\n    hopDistances: number[][],\n    startTime: number\n  ): GraphRoPEResult {\n    const dim = 384;\n    const numQueries = queries.length / dim;\n    const numKeys = keys.length / dim;\n\n    const encodedQueries = new Float32Array(queries);\n    const encodedKeys = new Float32Array(keys);\n    const hopEncodings = new Float32Array(numQueries * numKeys);\n\n    for (let i = 0; i < numQueries; i++) {\n      for (let j = 0; j < numKeys; j++) {\n        const distance = hopDistances[i]?.[j] || 0;\n        const scale = 1.0 / (1.0 + distance);\n        hopEncodings[i * numKeys + j] = scale;\n\n        for (let d = 0; d < dim; d++) {\n          encodedQueries[i * dim + d] *= Math.sqrt(scale);\n          encodedKeys[j * dim + d] *= Math.sqrt(scale);\n        }\n      }\n    }\n\n    return {\n      queries: encodedQueries,\n      keys: encodedKeys,\n      hopEncodings,\n      metrics: {\n        computeTimeMs: Date.now() - startTime,\n      },\n    };\n  }\n\n  private softmax(scores: Float32Array, rows: number, cols: number): Float32Array {\n    const result = new Float32Array(scores.length);\n\n    for (let i = 0; i < rows; i++) {\n      let max = -Infinity;\n      for (let j = 0; j < cols; j++) {\n        max = Math.max(max, scores[i * cols + j]);\n      }\n\n      let sum = 0;\n      for (let j = 0; j < cols; j++) {\n        result[i * cols + j] = Math.exp(scores[i * cols + j] - max);\n        sum += result[i * cols + j];\n      }\n\n      for (let j = 0; j < cols; j++) {\n        result[i * cols + j] /= sum;\n      }\n    }\n\n    return result;\n  }\n\n  getConfig() {\n    return {\n      hyperbolic: this.hyperbolicConfig,\n      flash: this.flashConfig,\n      graphRoPE: this.graphRoPEConfig,\n    };\n  }\n}\n"]}

package/dist/packages/agentdb/src/utils/NodeIdMapper.d.ts

@@ -0,0 +1,38 @@
+/**
+ * NodeIdMapper - Maps numeric episode IDs to full graph node IDs
+ *
+ * Solves the issue where ReflexionMemory.storeEpisode() returns numeric IDs
+ * but GraphDatabaseAdapter edges need full string node IDs (e.g., "episode-123456")
+ */
+export declare class NodeIdMapper {
+    private static instance;
+    private numericToNode;
+    private nodeToNumeric;
+    private constructor();
+    static getInstance(): NodeIdMapper;
+    /**
+     * Register a mapping between numeric ID and full node ID
+     */
+    register(numericId: number, nodeId: string): void;
+    /**
+     * Get full node ID from numeric ID
+     */
+    getNodeId(numericId: number): string | undefined;
+    /**
+     * Get numeric ID from full node ID
+     */
+    getNumericId(nodeId: string): number | undefined;
+    /**
+     * Clear all mappings (useful for testing)
+     */
+    clear(): void;
+    /**
+     * Get statistics about mappings
+     */
+    getStats(): {
+        totalMappings: number;
+        numericIds: number;
+        nodeIds: number;
+    };
+}
+//# sourceMappingURL=NodeIdMapper.d.ts.map

package/dist/packages/agentdb/src/utils/NodeIdMapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"NodeIdMapper.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/utils/NodeIdMapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,qBAAa,YAAY;IACvB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAA6B;IACpD,OAAO,CAAC,aAAa,CAA6B;IAClD,OAAO,CAAC,aAAa,CAA6B;IAElD,OAAO;IAIP,MAAM,CAAC,WAAW,IAAI,YAAY;IAOlC;;OAEG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAKjD;;OAEG;IACH,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIhD;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIhD;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,QAAQ,IAAI;QAAE,aAAa,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;CAO3E"}

package/dist/packages/agentdb/src/utils/NodeIdMapper.js

@@ -0,0 +1,57 @@
+/**
+ * NodeIdMapper - Maps numeric episode IDs to full graph node IDs
+ *
+ * Solves the issue where ReflexionMemory.storeEpisode() returns numeric IDs
+ * but GraphDatabaseAdapter edges need full string node IDs (e.g., "episode-123456")
+ */
+export class NodeIdMapper {
+    static instance = null;
+    numericToNode = new Map();
+    nodeToNumeric = new Map();
+    constructor() {
+        // Private constructor for singleton pattern
+    }
+    static getInstance() {
+        if (!NodeIdMapper.instance) {
+            NodeIdMapper.instance = new NodeIdMapper();
+        }
+        return NodeIdMapper.instance;
+    }
+    /**
+     * Register a mapping between numeric ID and full node ID
+     */
+    register(numericId, nodeId) {
+        this.numericToNode.set(numericId, nodeId);
+        this.nodeToNumeric.set(nodeId, numericId);
+    }
+    /**
+     * Get full node ID from numeric ID
+     */
+    getNodeId(numericId) {
+        return this.numericToNode.get(numericId);
+    }
+    /**
+     * Get numeric ID from full node ID
+     */
+    getNumericId(nodeId) {
+        return this.nodeToNumeric.get(nodeId);
+    }
+    /**
+     * Clear all mappings (useful for testing)
+     */
+    clear() {
+        this.numericToNode.clear();
+        this.nodeToNumeric.clear();
+    }
+    /**
+     * Get statistics about mappings
+     */
+    getStats() {
+        return {
+            totalMappings: this.numericToNode.size,
+            numericIds: this.numericToNode.size,
+            nodeIds: this.nodeToNumeric.size
+        };
+    }
+}
+//# sourceMappingURL=NodeIdMapper.js.map

package/dist/packages/agentdb/src/utils/NodeIdMapper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NodeIdMapper.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/utils/NodeIdMapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,OAAO,YAAY;IACf,MAAM,CAAC,QAAQ,GAAwB,IAAI,CAAC;IAC5C,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAElD;QACE,4CAA4C;IAC9C,CAAC;IAED,MAAM,CAAC,WAAW;QAChB,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;YAC3B,YAAY,CAAC,QAAQ,GAAG,IAAI,YAAY,EAAE,CAAC;QAC7C,CAAC;QACD,OAAO,YAAY,CAAC,QAAQ,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,SAAiB,EAAE,MAAc;QACxC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,SAAiB;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI;YACtC,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI;YACnC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI;SACjC,CAAC;IACJ,CAAC","sourcesContent":["/**\n * NodeIdMapper - Maps numeric episode IDs to full graph node IDs\n *\n * Solves the issue where ReflexionMemory.storeEpisode() returns numeric IDs\n * but GraphDatabaseAdapter edges need full string node IDs (e.g., \"episode-123456\")\n */\n\nexport class NodeIdMapper {\n  private static instance: NodeIdMapper | null = null;\n  private numericToNode = new Map<number, string>();\n  private nodeToNumeric = new Map<string, number>();\n\n  private constructor() {\n    // Private constructor for singleton pattern\n  }\n\n  static getInstance(): NodeIdMapper {\n    if (!NodeIdMapper.instance) {\n      NodeIdMapper.instance = new NodeIdMapper();\n    }\n    return NodeIdMapper.instance;\n  }\n\n  /**\n   * Register a mapping between numeric ID and full node ID\n   */\n  register(numericId: number, nodeId: string): void {\n    this.numericToNode.set(numericId, nodeId);\n    this.nodeToNumeric.set(nodeId, numericId);\n  }\n\n  /**\n   * Get full node ID from numeric ID\n   */\n  getNodeId(numericId: number): string | undefined {\n    return this.numericToNode.get(numericId);\n  }\n\n  /**\n   * Get numeric ID from full node ID\n   */\n  getNumericId(nodeId: string): number | undefined {\n    return this.nodeToNumeric.get(nodeId);\n  }\n\n  /**\n   * Clear all mappings (useful for testing)\n   */\n  clear(): void {\n    this.numericToNode.clear();\n    this.nodeToNumeric.clear();\n  }\n\n  /**\n   * Get statistics about mappings\n   */\n  getStats(): { totalMappings: number; numericIds: number; nodeIds: number } {\n    return {\n      totalMappings: this.numericToNode.size,\n      numericIds: this.numericToNode.size,\n      nodeIds: this.nodeToNumeric.size\n    };\n  }\n}\n"]}

package/dist/packages/agentdb/src/utils/vector-math.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Shared Vector Math Utilities
+ *
+ * Eliminates 8+ duplicate cosineSimilarity implementations across controllers.
+ * Uses 4x loop unrolling from WASMVectorSearch for best JS performance.
+ * Future: WASM SIMD acceleration via P2.2.
+ */
+/**
+ * Cosine similarity with 4x loop unrolling for optimal JS performance.
+ * Handles both number[] and Float32Array inputs.
+ */
+export declare function cosineSimilarity(a: ArrayLike<number>, b: ArrayLike<number>): number;
+/**
+ * Batch cosine similarity: compute similarity of query against multiple vectors.
+ */
+export declare function batchCosineSimilarity(query: ArrayLike<number>, corpus: ArrayLike<number>[]): number[];
+/**
+ * Convert distance metric to similarity score (0-1).
+ */
+export declare function distanceToSimilarity(distance: number, metric?: 'cosine' | 'l2' | 'ip'): number;
+/**
+ * Serialize embedding to Buffer for storage.
+ */
+export declare function serializeEmbedding(embedding: Float32Array): Buffer;
+/**
+ * Deserialize embedding from Buffer.
+ */
+export declare function deserializeEmbedding(buffer: Buffer): Float32Array;
+//# sourceMappingURL=vector-math.d.ts.map

package/dist/packages/agentdb/src/utils/vector-math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-math.d.ts","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/utils/vector-math.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAsBnF;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,EAAE,CAErG;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAE,QAAQ,GAAG,IAAI,GAAG,IAAe,GAAG,MAAM,CAOxG;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,SAAS,EAAE,YAAY,GAAG,MAAM,CAElE;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,CAKjE"}

package/dist/packages/agentdb/src/utils/vector-math.js

@@ -0,0 +1,66 @@
+/**
+ * Shared Vector Math Utilities
+ *
+ * Eliminates 8+ duplicate cosineSimilarity implementations across controllers.
+ * Uses 4x loop unrolling from WASMVectorSearch for best JS performance.
+ * Future: WASM SIMD acceleration via P2.2.
+ */
+/**
+ * Cosine similarity with 4x loop unrolling for optimal JS performance.
+ * Handles both number[] and Float32Array inputs.
+ */
+export function cosineSimilarity(a, b) {
+    const len = Math.min(a.length, b.length);
+    if (len === 0)
+        return 0;
+    let dot = 0, magA = 0, magB = 0;
+    // 4x loop unrolling
+    const unrolled = len - (len % 4);
+    for (let i = 0; i < unrolled; i += 4) {
+        dot += a[i] * b[i] + a[i + 1] * b[i + 1] + a[i + 2] * b[i + 2] + a[i + 3] * b[i + 3];
+        magA += a[i] * a[i] + a[i + 1] * a[i + 1] + a[i + 2] * a[i + 2] + a[i + 3] * a[i + 3];
+        magB += b[i] * b[i] + b[i + 1] * b[i + 1] + b[i + 2] * b[i + 2] + b[i + 3] * b[i + 3];
+    }
+    // Handle remainder
+    for (let i = unrolled; i < len; i++) {
+        dot += a[i] * b[i];
+        magA += a[i] * a[i];
+        magB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(magA) * Math.sqrt(magB);
+    return denom === 0 ? 0 : dot / denom;
+}
+/**
+ * Batch cosine similarity: compute similarity of query against multiple vectors.
+ */
+export function batchCosineSimilarity(query, corpus) {
+    return corpus.map(vec => cosineSimilarity(query, vec));
+}
+/**
+ * Convert distance metric to similarity score (0-1).
+ */
+export function distanceToSimilarity(distance, metric = 'cosine') {
+    switch (metric) {
+        case 'cosine': return 1 - distance;
+        case 'l2': return 1 / (1 + distance);
+        case 'ip': return distance; // inner product is already a similarity
+        default: return 1 - distance;
+    }
+}
+/**
+ * Serialize embedding to Buffer for storage.
+ */
+export function serializeEmbedding(embedding) {
+    return Buffer.from(embedding.buffer, embedding.byteOffset, embedding.byteLength);
+}
+/**
+ * Deserialize embedding from Buffer.
+ */
+export function deserializeEmbedding(buffer) {
+    const ab = new ArrayBuffer(buffer.length);
+    const view = new Uint8Array(ab);
+    for (let i = 0; i < buffer.length; i++)
+        view[i] = buffer[i];
+    return new Float32Array(ab);
+}
+//# sourceMappingURL=vector-math.js.map

package/dist/packages/agentdb/src/utils/vector-math.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-math.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/utils/vector-math.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAoB,EAAE,CAAoB;IACzE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAExB,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;IAEhC,oBAAoB;IACpB,MAAM,QAAQ,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,GAAG,IAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IACD,mBAAmB;IACnB,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,GAAG,IAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAwB,EAAE,MAA2B;IACzF,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAAgB,EAAE,SAAiC,QAAQ;IAC9F,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,QAAQ,CAAC,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC;QACnC,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,CAAC,OAAO,QAAQ,CAAC,CAAC,wCAAwC;QACpE,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC;IAC/B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,SAAuB;IACxD,OAAO,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,UAAU,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC;AACnF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAc;IACjD,MAAM,EAAE,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC5D,OAAO,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;AAC9B,CAAC","sourcesContent":["/**\n * Shared Vector Math Utilities\n *\n * Eliminates 8+ duplicate cosineSimilarity implementations across controllers.\n * Uses 4x loop unrolling from WASMVectorSearch for best JS performance.\n * Future: WASM SIMD acceleration via P2.2.\n */\n\n/**\n * Cosine similarity with 4x loop unrolling for optimal JS performance.\n * Handles both number[] and Float32Array inputs.\n */\nexport function cosineSimilarity(a: ArrayLike<number>, b: ArrayLike<number>): number {\n  const len = Math.min(a.length, b.length);\n  if (len === 0) return 0;\n\n  let dot = 0, magA = 0, magB = 0;\n\n  // 4x loop unrolling\n  const unrolled = len - (len % 4);\n  for (let i = 0; i < unrolled; i += 4) {\n    dot  += a[i] * b[i] + a[i+1] * b[i+1] + a[i+2] * b[i+2] + a[i+3] * b[i+3];\n    magA += a[i] * a[i] + a[i+1] * a[i+1] + a[i+2] * a[i+2] + a[i+3] * a[i+3];\n    magB += b[i] * b[i] + b[i+1] * b[i+1] + b[i+2] * b[i+2] + b[i+3] * b[i+3];\n  }\n  // Handle remainder\n  for (let i = unrolled; i < len; i++) {\n    dot  += a[i] * b[i];\n    magA += a[i] * a[i];\n    magB += b[i] * b[i];\n  }\n\n  const denom = Math.sqrt(magA) * Math.sqrt(magB);\n  return denom === 0 ? 0 : dot / denom;\n}\n\n/**\n * Batch cosine similarity: compute similarity of query against multiple vectors.\n */\nexport function batchCosineSimilarity(query: ArrayLike<number>, corpus: ArrayLike<number>[]): number[] {\n  return corpus.map(vec => cosineSimilarity(query, vec));\n}\n\n/**\n * Convert distance metric to similarity score (0-1).\n */\nexport function distanceToSimilarity(distance: number, metric: 'cosine' | 'l2' | 'ip' = 'cosine'): number {\n  switch (metric) {\n    case 'cosine': return 1 - distance;\n    case 'l2': return 1 / (1 + distance);\n    case 'ip': return distance; // inner product is already a similarity\n    default: return 1 - distance;\n  }\n}\n\n/**\n * Serialize embedding to Buffer for storage.\n */\nexport function serializeEmbedding(embedding: Float32Array): Buffer {\n  return Buffer.from(embedding.buffer, embedding.byteOffset, embedding.byteLength);\n}\n\n/**\n * Deserialize embedding from Buffer.\n */\nexport function deserializeEmbedding(buffer: Buffer): Float32Array {\n  const ab = new ArrayBuffer(buffer.length);\n  const view = new Uint8Array(ab);\n  for (let i = 0; i < buffer.length; i++) view[i] = buffer[i];\n  return new Float32Array(ab);\n}\n"]}