@ninebix/nmt-system 1.0.0

package/dist/src/core/hnsw-index.js

@@ -0,0 +1,466 @@
+/**
+ * HNSW Index - Hierarchical Navigable Small World Graph
+ * @module core/hnsw-index
+ */
+import { cosineSimilarity } from '../utils/similarity.js';
+/**
+ * Default HNSW parameters
+ */
+const DEFAULT_HNSW_PARAMS = {
+    M: 16,
+    efConstruction: 200,
+    efSearch: 50,
+    mL: 1 / Math.log(16)
+};
+/**
+ * HNSW Index implementation for approximate nearest neighbor search
+ */
+export class HNSWIndex {
+    params;
+    layers;
+    nodes;
+    entryPoint;
+    maxLayer;
+    constructor(params = {}) {
+        this.params = {
+            M: params.M ?? DEFAULT_HNSW_PARAMS.M,
+            efConstruction: params.efConstruction ?? DEFAULT_HNSW_PARAMS.efConstruction,
+            efSearch: params.efSearch ?? DEFAULT_HNSW_PARAMS.efSearch,
+            mL: params.mL ?? 1 / Math.log(params.M ?? DEFAULT_HNSW_PARAMS.M)
+        };
+        this.layers = new Map();
+        this.nodes = new Map();
+        this.entryPoint = null;
+        this.maxLayer = -1;
+    }
+    /**
+     * Get the number of nodes in the index
+     */
+    get size() {
+        return this.nodes.size;
+    }
+    /**
+     * Insert a new node into the index
+     * @param id - Node identifier
+     * @param embedding - 384-dimensional embedding vector
+     */
+    insert(id, embedding) {
+        // Check if node already exists
+        if (this.nodes.has(id)) {
+            throw new Error(`Node ${id} already exists in index`);
+        }
+        // Assign layer using exponential distribution
+        const nodeLayer = this.assignLayer();
+        // Create new node
+        const node = {
+            id,
+            embedding,
+            layer: nodeLayer,
+            connections: new Map()
+        };
+        // Initialize connections for each layer
+        for (let l = 0; l <= nodeLayer; l++) {
+            node.connections.set(l, new Set());
+        }
+        this.nodes.set(id, node);
+        // Handle first node insertion
+        if (this.entryPoint === null) {
+            this.entryPoint = id;
+            this.maxLayer = nodeLayer;
+            this.ensureLayer(nodeLayer);
+            this.getLayer(nodeLayer).nodes.add(id);
+            return;
+        }
+        // Start from entry point and navigate down to layer 0
+        let currentNode = this.entryPoint;
+        const entryNode = this.nodes.get(currentNode);
+        // Greedy search from top layer to nodeLayer + 1
+        for (let l = this.maxLayer; l > nodeLayer; l--) {
+            currentNode = this.greedySearch(currentNode, embedding, l);
+        }
+        // Insert and connect at each layer from nodeLayer down to 0
+        for (let l = Math.min(nodeLayer, this.maxLayer); l >= 0; l--) {
+            // Search for ef nearest neighbors at this layer
+            const candidates = this.searchLayer(currentNode, embedding, this.params.efConstruction, l);
+            // Select M best neighbors
+            const neighbors = this.selectNeighbors(candidates, this.params.M);
+            // Connect to neighbors (bidirectional)
+            this.ensureLayer(l);
+            const layer = this.getLayer(l);
+            layer.nodes.add(id);
+            for (const neighbor of neighbors) {
+                // Add connection from new node to neighbor
+                node.connections.get(l).add(neighbor.id);
+                // Add connection from neighbor to new node
+                const neighborNode = this.nodes.get(neighbor.id);
+                if (!neighborNode.connections.has(l)) {
+                    neighborNode.connections.set(l, new Set());
+                }
+                neighborNode.connections.get(l).add(id);
+                // Prune neighbor connections if necessary
+                const maxConnections = l === 0 ? this.params.M * 2 : this.params.M;
+                if (neighborNode.connections.get(l).size > maxConnections) {
+                    this.pruneConnections(neighbor.id, l, maxConnections);
+                }
+            }
+            // Use closest neighbor as entry point for next layer
+            if (candidates.length > 0) {
+                currentNode = candidates[0].id;
+            }
+        }
+        // Update entry point if new node has higher layer
+        if (nodeLayer > this.maxLayer) {
+            this.entryPoint = id;
+            this.maxLayer = nodeLayer;
+        }
+    }
+    /**
+     * Search for k nearest neighbors
+     * @param query - Query embedding
+     * @param k - Number of neighbors to return
+     * @param ef - Search expansion factor (default from params)
+     * @returns Array of search results sorted by similarity
+     */
+    search(query, k, ef) {
+        if (this.entryPoint === null) {
+            return [];
+        }
+        const efSearch = ef ?? this.params.efSearch;
+        // Navigate from top layer to layer 1
+        let currentNode = this.entryPoint;
+        for (let l = this.maxLayer; l > 0; l--) {
+            currentNode = this.greedySearch(currentNode, query, l);
+        }
+        // Search layer 0 with ef expansion
+        const candidates = this.searchLayer(currentNode, query, Math.max(efSearch, k), 0);
+        // Return top k results
+        return candidates.slice(0, k);
+    }
+    /**
+     * Delete a node from the index
+     * @param id - Node identifier to delete
+     */
+    delete(id) {
+        const node = this.nodes.get(id);
+        if (!node) {
+            return false;
+        }
+        // Remove connections from all neighbors
+        for (const [layer, connections] of node.connections) {
+            for (const neighborId of connections) {
+                const neighbor = this.nodes.get(neighborId);
+                if (neighbor && neighbor.connections.has(layer)) {
+                    neighbor.connections.get(layer).delete(id);
+                }
+            }
+            // Remove from layer
+            const layerData = this.layers.get(layer);
+            if (layerData) {
+                layerData.nodes.delete(id);
+            }
+        }
+        // Remove node
+        this.nodes.delete(id);
+        // Update entry point if necessary
+        if (this.entryPoint === id) {
+            this.updateEntryPoint();
+        }
+        return true;
+    }
+    /**
+     * Check if a node exists in the index
+     * @param id - Node identifier
+     */
+    has(id) {
+        return this.nodes.has(id);
+    }
+    /**
+     * Get node by ID
+     * @param id - Node identifier
+     */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /**
+     * Get all node IDs
+     */
+    getAllIds() {
+        return Array.from(this.nodes.keys());
+    }
+    /**
+     * Serialize the index to a JSON-friendly format
+     */
+    serialize() {
+        const layers = [];
+        for (let l = 0; l <= this.maxLayer; l++) {
+            const layer = this.layers.get(l);
+            if (layer) {
+                layers.push({
+                    level: l,
+                    nodes: layer.nodes
+                });
+            }
+        }
+        const serializedNodes = [];
+        for (const node of this.nodes.values()) {
+            const connections = new Map();
+            for (const [layer, conns] of node.connections) {
+                connections.set(layer, new Set(conns));
+            }
+            serializedNodes.push({
+                id: node.id,
+                embedding: node.embedding,
+                layer: node.layer,
+                connections
+            });
+        }
+        return {
+            params: this.params,
+            layers,
+            entryPoint: this.entryPoint,
+            nodes: serializedNodes
+        };
+    }
+    /**
+     * Deserialize index from JSON format
+     */
+    static deserialize(data) {
+        const index = new HNSWIndex(data.params);
+        // Restore nodes
+        for (const nodeData of data.nodes) {
+            const connections = new Map();
+            if (nodeData.connections instanceof Map) {
+                for (const [layer, conns] of nodeData.connections) {
+                    connections.set(layer, new Set(conns));
+                }
+            }
+            else {
+                // Handle serialized format (object with arrays)
+                const connObj = nodeData.connections;
+                for (const [layer, conns] of Object.entries(connObj)) {
+                    connections.set(parseInt(layer), new Set(conns));
+                }
+            }
+            const node = {
+                id: nodeData.id,
+                embedding: nodeData.embedding instanceof Float32Array
+                    ? nodeData.embedding
+                    : new Float32Array(nodeData.embedding),
+                layer: nodeData.layer,
+                connections
+            };
+            index.nodes.set(node.id, node);
+        }
+        // Restore layers
+        for (const layerData of data.layers) {
+            index.layers.set(layerData.level, {
+                level: layerData.level,
+                nodes: new Set(layerData.nodes)
+            });
+        }
+        // Restore entry point and max layer
+        index.entryPoint = data.entryPoint;
+        index.maxLayer = data.layers.length > 0
+            ? Math.max(...data.layers.map((l) => l.level))
+            : -1;
+        return index;
+    }
+    /**
+     * Assign layer for new node using exponential distribution
+     */
+    assignLayer() {
+        const r = Math.random();
+        const layer = Math.floor(-Math.log(r) * this.params.mL);
+        return layer;
+    }
+    /**
+     * Greedy search to find closest node at a given layer
+     */
+    greedySearch(entryId, query, layer) {
+        let currentId = entryId;
+        let currentNode = this.nodes.get(currentId);
+        let currentSim = this.similarity(query, currentNode.embedding);
+        let improved = true;
+        while (improved) {
+            improved = false;
+            const connections = currentNode.connections.get(layer);
+            if (!connections)
+                break;
+            for (const neighborId of connections) {
+                const neighbor = this.nodes.get(neighborId);
+                if (!neighbor)
+                    continue;
+                const sim = this.similarity(query, neighbor.embedding);
+                if (sim > currentSim) {
+                    currentId = neighborId;
+                    currentNode = neighbor;
+                    currentSim = sim;
+                    improved = true;
+                }
+            }
+        }
+        return currentId;
+    }
+    /**
+     * Search a layer for candidates using beam search
+     */
+    searchLayer(entryId, query, ef, layer) {
+        const visited = new Set();
+        const candidates = [];
+        const results = [];
+        // Initialize with entry point
+        const entryNode = this.nodes.get(entryId);
+        const entrySim = this.similarity(query, entryNode.embedding);
+        candidates.push({ id: entryId, score: entrySim, distance: 1 - entrySim });
+        results.push({ id: entryId, score: entrySim, distance: 1 - entrySim });
+        visited.add(entryId);
+        while (candidates.length > 0) {
+            // Get candidate with highest similarity
+            candidates.sort((a, b) => b.score - a.score);
+            const current = candidates.shift();
+            // Check if worst result is better than current candidate
+            results.sort((a, b) => b.score - a.score);
+            if (results.length >= ef && current.score < results[results.length - 1].score) {
+                break;
+            }
+            // Explore neighbors
+            const currentNode = this.nodes.get(current.id);
+            if (!currentNode)
+                continue;
+            const connections = currentNode.connections.get(layer);
+            if (!connections)
+                continue;
+            for (const neighborId of connections) {
+                if (visited.has(neighborId))
+                    continue;
+                visited.add(neighborId);
+                const neighbor = this.nodes.get(neighborId);
+                if (!neighbor)
+                    continue;
+                const sim = this.similarity(query, neighbor.embedding);
+                const result = { id: neighborId, score: sim, distance: 1 - sim };
+                // Add to candidates if better than worst result or results not full
+                if (results.length < ef || sim > results[results.length - 1].score) {
+                    candidates.push(result);
+                    results.push(result);
+                    // Keep only ef best results
+                    if (results.length > ef) {
+                        results.sort((a, b) => b.score - a.score);
+                        results.pop();
+                    }
+                }
+            }
+        }
+        // Return sorted results
+        results.sort((a, b) => b.score - a.score);
+        return results;
+    }
+    /**
+     * Select best neighbors from candidates
+     */
+    selectNeighbors(candidates, M) {
+        // Simple selection: take top M by similarity
+        return candidates.slice(0, M);
+    }
+    /**
+     * Prune connections to maintain max connections limit
+     */
+    pruneConnections(nodeId, layer, maxConnections) {
+        const node = this.nodes.get(nodeId);
+        if (!node)
+            return;
+        const connections = node.connections.get(layer);
+        if (!connections || connections.size <= maxConnections)
+            return;
+        // Score all connections by similarity
+        const scored = [];
+        for (const connId of connections) {
+            const connNode = this.nodes.get(connId);
+            if (connNode) {
+                scored.push({
+                    id: connId,
+                    sim: this.similarity(node.embedding, connNode.embedding)
+                });
+            }
+        }
+        // Sort by similarity and keep top maxConnections
+        scored.sort((a, b) => b.sim - a.sim);
+        const keepIds = new Set(scored.slice(0, maxConnections).map(s => s.id));
+        // Update connections
+        node.connections.set(layer, keepIds);
+    }
+    /**
+     * Update entry point after deletion
+     */
+    updateEntryPoint() {
+        // Find node with highest layer
+        let maxLayer = -1;
+        let newEntry = null;
+        for (const node of this.nodes.values()) {
+            if (node.layer > maxLayer) {
+                maxLayer = node.layer;
+                newEntry = node.id;
+            }
+        }
+        this.entryPoint = newEntry;
+        this.maxLayer = maxLayer;
+    }
+    /**
+     * Ensure layer exists
+     */
+    ensureLayer(level) {
+        if (!this.layers.has(level)) {
+            this.layers.set(level, { level, nodes: new Set() });
+        }
+    }
+    /**
+     * Get layer data
+     */
+    getLayer(level) {
+        return this.layers.get(level);
+    }
+    /**
+     * Compute similarity between two embeddings
+     */
+    similarity(a, b) {
+        return cosineSimilarity(a, b);
+    }
+    /**
+     * Get index statistics
+     */
+    getStats() {
+        const layerDistribution = new Map();
+        const connectionCounts = new Map();
+        for (const node of this.nodes.values()) {
+            // Count nodes per layer
+            const count = layerDistribution.get(node.layer) ?? 0;
+            layerDistribution.set(node.layer, count + 1);
+            // Track connections per layer
+            for (const [layer, connections] of node.connections) {
+                if (!connectionCounts.has(layer)) {
+                    connectionCounts.set(layer, []);
+                }
+                connectionCounts.get(layer).push(connections.size);
+            }
+        }
+        // Calculate average connections
+        const avgConnectionsPerLayer = new Map();
+        for (const [layer, counts] of connectionCounts) {
+            const avg = counts.reduce((a, b) => a + b, 0) / counts.length;
+            avgConnectionsPerLayer.set(layer, Math.round(avg * 100) / 100);
+        }
+        return {
+            totalNodes: this.nodes.size,
+            layerDistribution,
+            avgConnectionsPerLayer,
+            maxLayer: this.maxLayer
+        };
+    }
+}
+/**
+ * Create an HNSWIndex instance with default parameters
+ */
+export function createHNSWIndex(params) {
+    return new HNSWIndex(params);
+}
+//# sourceMappingURL=hnsw-index.js.map

package/dist/src/core/hnsw-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-index.js","sourceRoot":"","sources":["../../../src/core/hnsw-index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAYH,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAG1D;;GAEG;AACH,MAAM,mBAAmB,GAAe;IACtC,CAAC,EAAE,EAAE;IACL,cAAc,EAAE,GAAG;IACnB,QAAQ,EAAE,EAAE;IACZ,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;CACrB,CAAC;AAEF;;GAEG;AACH,MAAM,OAAO,SAAS;IACZ,MAAM,CAAa;IACnB,MAAM,CAAyB;IAC/B,KAAK,CAAsB;IAC3B,UAAU,CAAc;IACxB,QAAQ,CAAS;IAEzB,YAAY,SAA8B,EAAE;QAC1C,IAAI,CAAC,MAAM,GAAG;YACZ,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,mBAAmB,CAAC,CAAC;YACpC,cAAc,EAAE,MAAM,CAAC,cAAc,IAAI,mBAAmB,CAAC,cAAc;YAC3E,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,mBAAmB,CAAC,QAAQ;YACzD,EAAE,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC;SACjE,CAAC;QAEF,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,EAAQ,EAAE,SAAuB;QACtC,+BAA+B;QAC/B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,0BAA0B,CAAC,CAAC;QACxD,CAAC;QAED,8CAA8C;QAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAErC,kBAAkB;QAClB,MAAM,IAAI,GAAa;YACrB,EAAE;YACF,SAAS;YACT,KAAK,EAAE,SAAS;YAChB,WAAW,EAAE,IAAI,GAAG,EAAE;SACvB,CAAC;QAEF,wCAAwC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEzB,8BAA8B;QAC9B,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACvC,OAAO;QACT,CAAC;QAED,sDAAsD;QACtD,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;QAE/C,gDAAgD;QAChD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;QAED,4DAA4D;QAC5D,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,gDAAgD;YAChD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YAE3F,0BAA0B;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAElE,uCAAuC;YACvC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEpB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,2CAA2C;gBAC3C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAE1C,2CAA2C;gBAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAE,CAAC;gBAClD,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAC7C,CAAC;gBACD,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAEzC,0CAA0C;gBAC1C,MAAM,cAAc,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;gBACnE,IAAI,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,GAAG,cAAc,EAAE,CAAC;oBAC3D,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;gBACxD,CAAC;YACH,CAAC;YAED,qDAAqD;YACrD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjC,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,KAAmB,EAAE,CAAS,EAAE,EAAW;QAChD,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,QAAQ,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;QAE5C,qCAAqC;QACrC,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,mCAAmC;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAElF,uBAAuB;QACvB,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,EAAQ;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,KAAK,CAAC;QACf,CAAC;QAED,wCAAwC;QACxC,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACpD,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAChD,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;YAED,oBAAoB;YACpB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,SAAS,EAAE,CAAC;gBACd,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,cAAc;QACd,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,kCAAkC;QAClC,IAAI,IAAI,CAAC,UAAU,KAAK,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC1B,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,EAAQ;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,EAAQ;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,SAAS;QACP,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,CAAC,IAAI,CAAC;oBACV,KAAK,EAAE,CAAC;oBACR,KAAK,EAAE,KAAK,CAAC,KAAK;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,eAAe,GAAe,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAC;YACjD,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC9C,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,eAAe,CAAC,IAAI,CAAC;gBACnB,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,WAAW;aACZ,CAAC,CAAC;QACL,CAAC;QAED,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM;YACN,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,KAAK,EAAE,eAAe;SACvB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,IAAmB;QACpC,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEzC,gBAAgB;QAChB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAClC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAC;YACjD,IAAI,QAAQ,CAAC,WAAW,YAAY,GAAG,EAAE,CAAC;gBACxC,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;oBAClD,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,gDAAgD;gBAChD,MAAM,OAAO,GAAG,QAAQ,CAAC,WAAkD,CAAC;gBAC5E,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;YAED,MAAM,IAAI,GAAa;gBACrB,EAAE,EAAE,QAAQ,CAAC,EAAE;gBACf,SAAS,EAAE,QAAQ,CAAC,SAAS,YAAY,YAAY;oBACnD,CAAC,CAAC,QAAQ,CAAC,SAAS;oBACpB,CAAC,CAAC,IAAI,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC;gBACxC,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,WAAW;aACZ,CAAC;YACF,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;QAED,iBAAiB;QACjB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,EAAE;gBAChC,KAAK,EAAE,SAAS,CAAC,KAAK;gBACtB,KAAK,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC;aAChC,CAAC,CAAC;QACL,CAAC;QAED,oCAAoC;QACpC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACnC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YACrC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAoB,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEP,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,WAAW;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,OAAa,EAAE,KAAmB,EAAE,KAAa;QACpE,IAAI,SAAS,GAAG,OAAO,CAAC;QACxB,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;QAC7C,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;QAE/D,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,OAAO,QAAQ,EAAE,CAAC;YAChB,QAAQ,GAAG,KAAK,CAAC;YACjB,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,CAAC,WAAW;gBAAE,MAAM;YAExB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACvD,IAAI,GAAG,GAAG,UAAU,EAAE,CAAC;oBACrB,SAAS,GAAG,UAAU,CAAC;oBACvB,WAAW,GAAG,QAAQ,CAAC;oBACvB,UAAU,GAAG,GAAG,CAAC;oBACjB,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,WAAW,CACjB,OAAa,EACb,KAAmB,EACnB,EAAU,EACV,KAAa;QAEb,MAAM,OAAO,GAAG,IAAI,GAAG,EAAQ,CAAC;QAChC,MAAM,UAAU,GAAmB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAmB,EAAE,CAAC;QAEnC,8BAA8B;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;QAE7D,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,CAAC;QAC1E,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,CAAC;QACvE,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAErB,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,wCAAwC;YACxC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC7C,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;YAEpC,yDAAyD;YACzD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC1C,IAAI,OAAO,CAAC,MAAM,IAAI,EAAE,IAAI,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC9E,MAAM;YACR,CAAC;YAED,oBAAoB;YACpB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBACtC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAExB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;gBACvD,MAAM,MAAM,GAAiB,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC;gBAE/E,oEAAoE;gBACpE,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,IAAI,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;oBACnE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACxB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAErB,4BAA4B;oBAC5B,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;wBACxB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;wBAC1C,OAAO,CAAC,GAAG,EAAE,CAAC;oBAChB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,UAA0B,EAAE,CAAS;QAC3D,6CAA6C;QAC7C,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAAY,EAAE,KAAa,EAAE,cAAsB;QAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,IAAI,cAAc;YAAE,OAAO;QAE/D,sCAAsC;QACtC,MAAM,MAAM,GAAqC,EAAE,CAAC;QACpD,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxC,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,CAAC,IAAI,CAAC;oBACV,EAAE,EAAE,MAAM;oBACV,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC;iBACzD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAExE,qBAAqB;QACrB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,+BAA+B;QAC/B,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAgB,IAAI,CAAC;QAEjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;gBAC1B,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;gBACtB,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,KAAa;QAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,KAAa;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;IACjC,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,CAAe,EAAE,CAAe;QACjD,OAAO,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACpD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAoB,CAAC;QAErD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,wBAAwB;YACxB,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACrD,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAE7C,8BAA8B;YAC9B,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACpD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACjC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBAClC,CAAC;gBACD,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzD,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,gBAAgB,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;YAC9D,sBAAsB,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QACjE,CAAC;QAED,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YAC3B,iBAAiB;YACjB,sBAAsB;YACtB,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAA4B;IAC1D,OAAO,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC"}

package/dist/src/core/index.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Core Module Export
+ * @module core
+ *
+ * NMT Core Engines including:
+ * - Original: ChunkEngine, MerkleEngine, HNSWIndex, NeuronGraphManager
+ * - Probabilistic Ontology Extensions:
+ *   - BidirectionalInferenceEngine (양방향 추론)
+ *   - DynamicEmbeddingManager (동적 차원 확장)
+ *   - AttractorModel (미래 끌개)
+ *   - ProbabilisticNeuronManager (확률적 뉴런)
+ */
+export * from './chunk-engine.js';
+export * from './merkle-engine.js';
+export * from './hnsw-index.js';
+export * from './neuron-graph.js';
+export * from './bidirectional-inference.js';
+export * from './dynamic-embedding.js';
+export * from './attractor-model.js';
+export * from './probabilistic-neuron.js';
+export * from './probabilistic-orchestrator.js';
+export * from './evolution-scheduler.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/core/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAGlC,cAAc,8BAA8B,CAAC;AAC7C,cAAc,wBAAwB,CAAC;AACvC,cAAc,sBAAsB,CAAC;AACrC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iCAAiC,CAAC;AAChD,cAAc,0BAA0B,CAAC"}

package/dist/src/core/index.js

@@ -0,0 +1,25 @@
+/**
+ * Core Module Export
+ * @module core
+ *
+ * NMT Core Engines including:
+ * - Original: ChunkEngine, MerkleEngine, HNSWIndex, NeuronGraphManager
+ * - Probabilistic Ontology Extensions:
+ *   - BidirectionalInferenceEngine (양방향 추론)
+ *   - DynamicEmbeddingManager (동적 차원 확장)
+ *   - AttractorModel (미래 끌개)
+ *   - ProbabilisticNeuronManager (확률적 뉴런)
+ */
+// Original Core
+export * from './chunk-engine.js';
+export * from './merkle-engine.js';
+export * from './hnsw-index.js';
+export * from './neuron-graph.js';
+// Probabilistic Ontology Extensions (확률적 존재론)
+export * from './bidirectional-inference.js';
+export * from './dynamic-embedding.js';
+export * from './attractor-model.js';
+export * from './probabilistic-neuron.js';
+export * from './probabilistic-orchestrator.js';
+export * from './evolution-scheduler.js';
+//# sourceMappingURL=index.js.map

package/dist/src/core/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,gBAAgB;AAChB,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAElC,8CAA8C;AAC9C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,wBAAwB,CAAC;AACvC,cAAc,sBAAsB,CAAC;AACrC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,iCAAiC,CAAC;AAChD,cAAc,0BAA0B,CAAC"}