@ninebix/nmt-system 1.0.0

package/dist/src/sync/vector-clock.js

@@ -0,0 +1,266 @@
+/**
+ * Vector Clock - Logical clock for distributed systems
+ *
+ * Provides causal ordering for events across multiple nodes.
+ * Used for conflict detection and resolution in state synchronization.
+ *
+ * @module sync/vector-clock
+ */
+/**
+ * VectorClock - Lamport-style vector clock implementation
+ *
+ * Vector clocks track causality in distributed systems:
+ * - If clock A happened-before clock B, compare returns 'before'
+ * - If clock B happened-before clock A, compare returns 'after'
+ * - If neither happened-before the other, they are 'concurrent'
+ *
+ * @example
+ * ```typescript
+ * const clockA = new VectorClock('node-a');
+ * clockA.increment('node-a');
+ * clockA.increment('node-a');
+ *
+ * const clockB = new VectorClock('node-b');
+ * clockB.increment('node-b');
+ *
+ * // Clocks are concurrent (no causal relationship)
+ * console.log(clockA.compare(clockB)); // 'concurrent'
+ *
+ * // Merge creates a clock that dominates both
+ * const merged = clockA.merge(clockB);
+ * console.log(merged.compare(clockA)); // 'after'
+ * ```
+ */
+export class VectorClock {
+    clock;
+    nodeId;
+    constructor(nodeId, initial) {
+        this.nodeId = nodeId ?? null;
+        this.clock = new Map();
+        if (initial) {
+            for (const [key, value] of Object.entries(initial)) {
+                this.clock.set(key, value);
+            }
+        }
+    }
+    /**
+     * Increment the clock for a specific node
+     * Returns a new VectorClock (immutable operation)
+     */
+    increment(nodeId) {
+        const id = nodeId ?? this.nodeId;
+        if (!id) {
+            throw new Error('Node ID required for increment');
+        }
+        const newClock = new VectorClock(this.nodeId ?? undefined, this.toJSON());
+        newClock.clock.set(id, (newClock.clock.get(id) ?? 0) + 1);
+        return newClock;
+    }
+    /**
+     * Increment in place (mutable operation)
+     */
+    tick(nodeId) {
+        const id = nodeId ?? this.nodeId;
+        if (!id) {
+            throw new Error('Node ID required for tick');
+        }
+        this.clock.set(id, (this.clock.get(id) ?? 0) + 1);
+    }
+    /**
+     * Get the timestamp for a specific node
+     */
+    get(nodeId) {
+        return this.clock.get(nodeId) ?? 0;
+    }
+    /**
+     * Set the timestamp for a specific node
+     * @throws {Error} If value is negative or not an integer
+     */
+    set(nodeId, value) {
+        if (value < 0) {
+            throw new Error('Vector clock values must be non-negative');
+        }
+        if (!Number.isInteger(value)) {
+            throw new Error('Vector clock values must be integers');
+        }
+        this.clock.set(nodeId, value);
+    }
+    /**
+     * Merge with another vector clock
+     * Returns a new clock with max values from both (immutable)
+     */
+    merge(other) {
+        const newClock = new VectorClock(this.nodeId ?? undefined);
+        // Add all keys from this clock
+        for (const [nodeId, timestamp] of this.clock) {
+            newClock.clock.set(nodeId, timestamp);
+        }
+        // Merge with other clock (take max)
+        for (const [nodeId, timestamp] of other.clock) {
+            const current = newClock.clock.get(nodeId) ?? 0;
+            newClock.clock.set(nodeId, Math.max(current, timestamp));
+        }
+        return newClock;
+    }
+    /**
+     * Merge in place (mutable operation)
+     */
+    update(other) {
+        for (const [nodeId, timestamp] of other.clock) {
+            const current = this.clock.get(nodeId) ?? 0;
+            this.clock.set(nodeId, Math.max(current, timestamp));
+        }
+    }
+    /**
+     * Compare this clock with another
+     *
+     * @returns
+     * - 'before': this happened before other
+     * - 'after': this happened after other
+     * - 'concurrent': neither happened before the other
+     * - 'equal': clocks are identical
+     */
+    compare(other) {
+        let thisGreater = false;
+        let otherGreater = false;
+        // Get all unique node IDs
+        const allNodes = new Set([
+            ...this.clock.keys(),
+            ...other.clock.keys(),
+        ]);
+        for (const nodeId of allNodes) {
+            const thisValue = this.clock.get(nodeId) ?? 0;
+            const otherValue = other.clock.get(nodeId) ?? 0;
+            if (thisValue > otherValue) {
+                thisGreater = true;
+            }
+            else if (otherValue > thisValue) {
+                otherGreater = true;
+            }
+            // Early exit if already concurrent
+            if (thisGreater && otherGreater) {
+                return 'concurrent';
+            }
+        }
+        if (thisGreater && !otherGreater) {
+            return 'after';
+        }
+        else if (otherGreater && !thisGreater) {
+            return 'before';
+        }
+        else {
+            return 'equal';
+        }
+    }
+    /**
+     * Check if this clock happened before or concurrent with other
+     */
+    happenedBefore(other) {
+        return this.compare(other) === 'before';
+    }
+    /**
+     * Check if this clock happened after or concurrent with other
+     */
+    happenedAfter(other) {
+        return this.compare(other) === 'after';
+    }
+    /**
+     * Check if two events are concurrent (no causal relationship)
+     */
+    isConcurrentWith(other) {
+        return this.compare(other) === 'concurrent';
+    }
+    /**
+     * Check if this clock dominates (is >= in all dimensions)
+     */
+    dominates(other) {
+        const comparison = this.compare(other);
+        return comparison === 'after' || comparison === 'equal';
+    }
+    /**
+     * Get all node IDs in this clock
+     */
+    getNodes() {
+        return Array.from(this.clock.keys());
+    }
+    /**
+     * Get the total sum of all timestamps (for debugging)
+     */
+    sum() {
+        let total = 0;
+        for (const value of this.clock.values()) {
+            total += value;
+        }
+        return total;
+    }
+    /**
+     * Get the size (number of nodes)
+     */
+    size() {
+        return this.clock.size;
+    }
+    /**
+     * Check if clock is empty (all zeros or no entries)
+     */
+    isEmpty() {
+        if (this.clock.size === 0)
+            return true;
+        for (const value of this.clock.values()) {
+            if (value > 0)
+                return false;
+        }
+        return true;
+    }
+    /**
+     * Create a copy of this clock
+     */
+    clone() {
+        return new VectorClock(this.nodeId ?? undefined, this.toJSON());
+    }
+    /**
+     * Serialize to JSON-friendly format
+     */
+    toJSON() {
+        const result = {};
+        for (const [key, value] of this.clock) {
+            result[key] = value;
+        }
+        return result;
+    }
+    /**
+     * Create from serialized format
+     */
+    static fromJSON(data, nodeId) {
+        return new VectorClock(nodeId, data);
+    }
+    /**
+     * Create an empty clock for a node
+     */
+    static create(nodeId) {
+        return new VectorClock(nodeId);
+    }
+    /**
+     * String representation for debugging
+     */
+    toString() {
+        const parts = [];
+        const sortedKeys = Array.from(this.clock.keys()).sort();
+        for (const key of sortedKeys) {
+            parts.push(`${key}:${this.clock.get(key)}`);
+        }
+        return `VectorClock{${parts.join(', ')}}`;
+    }
+    /**
+     * Check equality with another clock
+     */
+    equals(other) {
+        return this.compare(other) === 'equal';
+    }
+}
+/**
+ * Create a new VectorClock instance
+ */
+export function createVectorClock(nodeId) {
+    return new VectorClock(nodeId);
+}
+//# sourceMappingURL=vector-clock.js.map

package/dist/src/sync/vector-clock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-clock.js","sourceRoot":"","sources":["../../../src/sync/vector-clock.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAYH;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,OAAO,WAAW;IACd,KAAK,CAAsB;IAC3B,MAAM,CAAgB;IAE9B,YAAY,MAAe,EAAE,OAAyB;QACpD,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QAEvB,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBACnD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,MAAe;QACvB,MAAM,EAAE,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1E,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,MAAe;QAClB,MAAM,EAAE,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,MAAc;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,MAAc,EAAE,KAAa;QAC/B,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAkB;QACtB,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC;QAE3D,+BAA+B;QAC/B,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7C,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACxC,CAAC;QAED,oCAAoC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9C,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAChD,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAkB;QACvB,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,OAAO,CAAC,KAAkB;QACxB,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,YAAY,GAAG,KAAK,CAAC;QAEzB,0BAA0B;QAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC;YACvB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;YACpB,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE;SACtB,CAAC,CAAC;QAEH,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9C,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAEhD,IAAI,SAAS,GAAG,UAAU,EAAE,CAAC;gBAC3B,WAAW,GAAG,IAAI,CAAC;YACrB,CAAC;iBAAM,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;gBAClC,YAAY,GAAG,IAAI,CAAC;YACtB,CAAC;YAED,mCAAmC;YACnC,IAAI,WAAW,IAAI,YAAY,EAAE,CAAC;gBAChC,OAAO,YAAY,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,WAAW,IAAI,CAAC,YAAY,EAAE,CAAC;YACjC,OAAO,OAAO,CAAC;QACjB,CAAC;aAAM,IAAI,YAAY,IAAI,CAAC,WAAW,EAAE,CAAC;YACxC,OAAO,QAAQ,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,OAAO,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,KAAkB;QAC/B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,KAAkB;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,OAAO,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,KAAkB;QACjC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,KAAkB;QAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvC,OAAO,UAAU,KAAK,OAAO,IAAI,UAAU,KAAK,OAAO,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,GAAG;QACD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACH,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACH,MAAM;QACJ,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAqB,EAAE,MAAe;QACpD,OAAO,IAAI,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,MAAc;QAC1B,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACxD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,eAAe,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAkB;QACvB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,OAAO,CAAC;IACzC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAe;IAC/C,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;AACjC,CAAC"}

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

@@ -0,0 +1,224 @@
+/**
+ * NMT (Neuron Merkle Tree) TypeScript Type Definitions
+ * @module nmt-types
+ * @version 1.0.0
+ */
+/** UUID v4 string format */
+export type UUID = string;
+/** SHA3-256 hash string (64 hex characters) */
+export type SHA3Hash = string;
+/** ISO 8601 timestamp string */
+export type ISO8601 = string;
+/** 384-dimensional embedding vector */
+export type Embedding384 = Float32Array;
+/** Merkle root hash */
+export type MerkleRoot = SHA3Hash;
+/** Types of synaptic connections between neurons */
+export type SynapseType = 'SEMANTIC' | 'TEMPORAL' | 'CAUSAL' | 'ASSOCIATIVE' | 'HIERARCHICAL' | 'DUPLICATE';
+/**
+ * Neuron Type - Fact vs Transient classification
+ * 설계 문서: NMT_Updated.md 4.1절
+ */
+export type NeuronType = 'fact' | 'transient';
+/** Status of async operations */
+export type JobStatus = 'PENDING' | 'RUNNING' | 'COMPLETED' | 'FAILED' | 'CANCELLED';
+/** Graph traversal strategies */
+export type TraversalStrategy = 'BFS' | 'DFS' | 'WEIGHTED' | 'RANDOM_WALK';
+/** Component health status */
+export type ComponentStatus = 'HEALTHY' | 'DEGRADED' | 'UNAVAILABLE';
+/** A data chunk */
+export interface Chunk {
+    index: number;
+    offset: number;
+    data: Buffer;
+    hash: SHA3Hash;
+    fingerprint?: number;
+}
+/** Options for chunking operations */
+export interface ChunkOptions {
+    chunkSize?: number;
+    overlap?: number;
+    useCDC?: boolean;
+    minChunkSize?: number;
+    maxChunkSize?: number;
+}
+/** Metadata attached to a neuron */
+export interface NeuronMetadata {
+    createdAt: string;
+    updatedAt: string;
+    accessCount: number;
+    lastAccessed: string;
+    sourceType: string;
+    tags: string[];
+    neuronType?: NeuronType;
+    ttl?: number;
+    expiresAt?: number;
+    importance?: number;
+    verifiedAt?: string;
+}
+/** Core neuron data structure */
+export interface NeuronNode {
+    id: UUID;
+    embedding: Embedding384;
+    chunkHashes: SHA3Hash[];
+    merkleRoot: MerkleRoot;
+    metadata: NeuronMetadata;
+    outgoingSynapses: UUID[];
+    incomingSynapses: UUID[];
+}
+/** Metadata for a synaptic connection */
+export interface SynapseMetadata {
+    createdAt: string;
+    updatedAt: string;
+    activationCount: number;
+    lastActivated: string;
+    bidirectional: boolean;
+}
+/** Synaptic connection between neurons */
+export interface Synapse {
+    id: UUID;
+    sourceId: UUID;
+    targetId: UUID;
+    weight: number;
+    type: SynapseType;
+    metadata: SynapseMetadata;
+}
+/** Merkle tree structure */
+export interface MerkleTree {
+    root: MerkleRoot;
+    levels: SHA3Hash[][];
+    leafCount: number;
+    originalLeaves: SHA3Hash[];
+}
+/** Merkle inclusion proof */
+export interface MerkleProof {
+    leaf: SHA3Hash;
+    leafIndex: number;
+    siblings: SHA3Hash[];
+    directions: boolean[];
+    root: MerkleRoot;
+}
+/** HNSW index parameters */
+export interface HNSWParams {
+    M: number;
+    efConstruction: number;
+    efSearch: number;
+    mL: number;
+}
+/** HNSW node structure */
+export interface HNSWNode {
+    id: UUID;
+    embedding: Embedding384;
+    layer: number;
+    connections: Map<number, Set<UUID>>;
+}
+/** HNSW layer structure */
+export interface HNSWLayer {
+    level: number;
+    nodes: Set<UUID>;
+}
+/** Full HNSW index structure (serialized format) */
+export interface HNSWIndexData {
+    params: HNSWParams;
+    layers: HNSWLayer[];
+    entryPoint: UUID | null;
+    nodes: HNSWNode[];
+}
+/** @deprecated Use HNSWIndexData instead */
+export type HNSWIndexType = HNSWIndexData;
+/** Search result from HNSW */
+export interface SearchResult {
+    id: UUID;
+    score: number;
+    distance: number;
+}
+/** Neuron path through the graph */
+export interface NeuronPath {
+    neurons: NeuronNode[];
+    synapses: Synapse[];
+    totalWeight: number;
+}
+/**
+ * ChunkStore interface - both LevelDB and Redis implementations satisfy this
+ */
+export interface IChunkStore {
+    init(): Promise<void>;
+    close(): Promise<void>;
+    put(chunk: Chunk): Promise<SHA3Hash>;
+    putMany(chunks: Chunk[]): Promise<SHA3Hash[]>;
+    get(chunkHash: SHA3Hash): Promise<Chunk | null>;
+    getMany(hashes: SHA3Hash[]): Promise<(Chunk | null)[]>;
+    has(chunkHash: SHA3Hash): Promise<boolean>;
+    delete(chunkHash: SHA3Hash): Promise<boolean>;
+    getAllHashes(): Promise<SHA3Hash[]>;
+    getStats(): Promise<{
+        totalChunks: number;
+        totalSize: number;
+        avgChunkSize: number;
+    }>;
+    verifyIntegrity(): Promise<{
+        valid: number;
+        corrupted: SHA3Hash[];
+        missing: SHA3Hash[];
+    }>;
+    gc(): Promise<number>;
+}
+/**
+ * NeuronStore interface - both LevelDB and Redis implementations satisfy this
+ */
+export interface INeuronStore {
+    init(): Promise<void>;
+    close(): Promise<void>;
+    createNeuron(input: {
+        embedding: Embedding384;
+        chunkHashes: string[];
+        merkleRoot: string;
+        sourceType?: string;
+        tags?: string[];
+    }): Promise<NeuronNode>;
+    putNeuron(neuron: NeuronNode): Promise<void>;
+    getNeuron(id: UUID): Promise<NeuronNode | null>;
+    getNeuronByMerkleRoot(merkleRoot: string): Promise<NeuronNode | null>;
+    updateNeuron(id: UUID, updates: Partial<NeuronNode>): Promise<NeuronNode | null>;
+    deleteNeuron(id: UUID): Promise<boolean>;
+    recordAccess(id: UUID): Promise<void>;
+    getAllNeuronIds(): Promise<UUID[]>;
+    getNeuronCount(): Promise<number>;
+    createSynapse(sourceId: UUID, targetId: UUID, type: SynapseType, weight?: number, bidirectional?: boolean): Promise<Synapse | null>;
+    putSynapse(synapse: Synapse): Promise<void>;
+    getSynapse(id: UUID): Promise<Synapse | null>;
+    getOutgoingSynapses(neuronId: UUID): Promise<Synapse[]>;
+    getIncomingSynapses(neuronId: UUID): Promise<Synapse[]>;
+    updateSynapseWeight(id: UUID, weight: number): Promise<Synapse | null>;
+    recordSynapseActivation(id: UUID): Promise<void>;
+    deleteSynapse(id: UUID): Promise<boolean>;
+    getSynapseCount(): Promise<number>;
+    findSimilar(embedding: Embedding384, k: number): Promise<NeuronNode[]>;
+}
+/**
+ * IndexStore interface - for HNSW index persistence
+ */
+export interface IIndexStore {
+    init(): Promise<void>;
+    close(): Promise<void>;
+    save(name: string, index: any): Promise<void>;
+    load(name: string): Promise<any | null>;
+    delete(name: string): Promise<boolean>;
+    list(): Promise<string[]>;
+}
+export declare const DEFAULT_CONFIG: {
+    readonly HNSW: {
+        readonly M: 16;
+        readonly efConstruction: 200;
+        readonly efSearch: 50;
+    };
+    readonly CHUNKING: {
+        readonly defaultChunkSize: 4096;
+        readonly minChunkSize: 256;
+        readonly maxChunkSize: 65536;
+    };
+    readonly EMBEDDING: {
+        readonly dimensions: 384;
+    };
+};
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,4BAA4B;AAC5B,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC;AAE1B,+CAA+C;AAC/C,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAE9B,gCAAgC;AAChC,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B,uCAAuC;AACvC,MAAM,MAAM,YAAY,GAAG,YAAY,CAAC;AAExC,uBAAuB;AACvB,MAAM,MAAM,UAAU,GAAG,QAAQ,CAAC;AAMlC,oDAAoD;AACpD,MAAM,MAAM,WAAW,GACnB,UAAU,GACV,UAAU,GACV,QAAQ,GACR,aAAa,GACb,cAAc,GACd,WAAW,CAAC;AAEhB;;;GAGG;AACH,MAAM,MAAM,UAAU,GAClB,MAAM,GACN,WAAW,CAAC;AAEhB,iCAAiC;AACjC,MAAM,MAAM,SAAS,GACjB,SAAS,GACT,SAAS,GACT,WAAW,GACX,QAAQ,GACR,WAAW,CAAC;AAEhB,iCAAiC;AACjC,MAAM,MAAM,iBAAiB,GACzB,KAAK,GACL,KAAK,GACL,UAAU,GACV,aAAa,CAAC;AAElB,8BAA8B;AAC9B,MAAM,MAAM,eAAe,GACvB,SAAS,GACT,UAAU,GACV,aAAa,CAAC;AAMlB,mBAAmB;AACnB,MAAM,WAAW,KAAK;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,sCAAsC;AACtC,MAAM,WAAW,YAAY;IAC3B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAMD,oCAAoC;AACpC,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,EAAE,CAAC;IAEf,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,iCAAiC;AACjC,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,IAAI,CAAC;IACT,SAAS,EAAE,YAAY,CAAC;IACxB,WAAW,EAAE,QAAQ,EAAE,CAAC;IACxB,UAAU,EAAE,UAAU,CAAC;IACvB,QAAQ,EAAE,cAAc,CAAC;IACzB,gBAAgB,EAAE,IAAI,EAAE,CAAC;IACzB,gBAAgB,EAAE,IAAI,EAAE,CAAC;CAC1B;AAMD,yCAAyC;AACzC,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,0CAA0C;AAC1C,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,IAAI,CAAC;IACT,QAAQ,EAAE,IAAI,CAAC;IACf,QAAQ,EAAE,IAAI,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,WAAW,CAAC;IAClB,QAAQ,EAAE,eAAe,CAAC;CAC3B;AAMD,4BAA4B;AAC5B,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,UAAU,CAAC;IACjB,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,QAAQ,EAAE,CAAC;CAC5B;AAED,6BAA6B;AAC7B,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB,UAAU,EAAE,OAAO,EAAE,CAAC;IACtB,IAAI,EAAE,UAAU,CAAC;CAClB;AAMD,4BAA4B;AAC5B,MAAM,WAAW,UAAU;IACzB,CAAC,EAAE,MAAM,CAAC;IACV,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,0BAA0B;AAC1B,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,IAAI,CAAC;IACT,SAAS,EAAE,YAAY,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;CACrC;AAED,2BAA2B;AAC3B,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;CAClB;AAED,oDAAoD;AACpD,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,UAAU,CAAC;IACnB,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,UAAU,EAAE,IAAI,GAAG,IAAI,CAAC;IACxB,KAAK,EAAE,QAAQ,EAAE,CAAC;CACnB;AAED,4CAA4C;AAC5C,MAAM,MAAM,aAAa,GAAG,aAAa,CAAC;AAE1C,8BAA8B;AAC9B,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,IAAI,CAAC;IACT,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;CAClB;AAMD,oCAAoC;AACpC,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;CACrB;AAUD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACtB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IACrC,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC9C,GAAG,CAAC,SAAS,EAAE,QAAQ,GAAG,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;IAChD,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IACvD,GAAG,CAAC,SAAS,EAAE,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,CAAC,SAAS,EAAE,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9C,YAAY,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;IACpC,QAAQ,IAAI,OAAO,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACtF,eAAe,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;QAAC,OAAO,EAAE,QAAQ,EAAE,CAAA;KAAE,CAAC,CAAC;IAC1F,EAAE,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACtB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,YAAY,CAAC,KAAK,EAAE;QAClB,SAAS,EAAE,YAAY,CAAC;QACxB,WAAW,EAAE,MAAM,EAAE,CAAC;QACtB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;KACjB,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACxB,SAAS,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC7C,SAAS,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAChD,qBAAqB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACtE,YAAY,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACjF,YAAY,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IACzC,YAAY,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,eAAe,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACnC,cAAc,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAClC,aAAa,CACX,QAAQ,EAAE,IAAI,EACd,QAAQ,EAAE,IAAI,EACd,IAAI,EAAE,WAAW,EACjB,MAAM,CAAC,EAAE,MAAM,EACf,aAAa,CAAC,EAAE,OAAO,GACtB,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC;IAC3B,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5C,UAAU,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC;IAC9C,mBAAmB,CAAC,QAAQ,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;IACxD,mBAAmB,CAAC,QAAQ,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;IACxD,mBAAmB,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC;IACvE,uBAAuB,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACjD,aAAa,CAAC,EAAE,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC1C,eAAe,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IACnC,WAAW,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;CACxE;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACtB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;IACxC,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IACvC,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CAC3B;AAMD,eAAO,MAAM,cAAc;;;;;;;;;;;;;;CAcjB,CAAC"}

package/dist/src/types/index.js

@@ -0,0 +1,24 @@
+/**
+ * NMT (Neuron Merkle Tree) TypeScript Type Definitions
+ * @module nmt-types
+ * @version 1.0.0
+ */
+// ============================================================================
+// Default Configuration
+// ============================================================================
+export const DEFAULT_CONFIG = {
+    HNSW: {
+        M: 16,
+        efConstruction: 200,
+        efSearch: 50
+    },
+    CHUNKING: {
+        defaultChunkSize: 4096,
+        minChunkSize: 256,
+        maxChunkSize: 65536
+    },
+    EMBEDDING: {
+        dimensions: 384
+    }
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAoSH,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,IAAI,EAAE;QACJ,CAAC,EAAE,EAAE;QACL,cAAc,EAAE,GAAG;QACnB,QAAQ,EAAE,EAAE;KACb;IACD,QAAQ,EAAE;QACR,gBAAgB,EAAE,IAAI;QACtB,YAAY,EAAE,GAAG;QACjB,YAAY,EAAE,KAAK;KACpB;IACD,SAAS,EAAE;QACT,UAAU,EAAE,GAAG;KAChB;CACO,CAAC"}

package/dist/src/utils/hash.d.ts

@@ -0,0 +1,39 @@
+/**
+ * SHA3-256 Hashing Utilities
+ * @module utils/hash
+ */
+import type { SHA3Hash } from '../types/index.js';
+/**
+ * Compute SHA3-256 hash of data
+ * @param data - Buffer or string to hash
+ * @returns 64-character hex hash string
+ */
+export declare function hash(data: Buffer | string): SHA3Hash;
+/**
+ * Compute SHA3-256 hash of combined data
+ * Used for Merkle tree pair hashing
+ * @param a - First hash
+ * @param b - Second hash
+ * @returns Combined hash (sorted to ensure consistency)
+ */
+export declare function hashPair(a: SHA3Hash, b: SHA3Hash): SHA3Hash;
+/**
+ * Verify a hash matches the data
+ * @param data - Original data
+ * @param expectedHash - Expected hash value
+ * @returns true if hash matches
+ */
+export declare function verifyHash(data: Buffer | string, expectedHash: SHA3Hash): boolean;
+/**
+ * Compute hash of JSON object
+ * @param obj - Object to hash
+ * @returns SHA3-256 hash of JSON string
+ */
+export declare function hashObject(obj: unknown): SHA3Hash;
+/**
+ * Check if a string is a valid SHA3-256 hash
+ * @param str - String to check
+ * @returns true if valid 64-character hex string
+ */
+export declare function isValidHash(str: string): boolean;
+//# sourceMappingURL=hash.d.ts.map

package/dist/src/utils/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../../../src/utils/hash.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAElD;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAKpD;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAI3D;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,QAAQ,GAAG,OAAO,CAEjF;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAGjD;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEhD"}

package/dist/src/utils/hash.js

@@ -0,0 +1,56 @@
+/**
+ * SHA3-256 Hashing Utilities
+ * @module utils/hash
+ */
+import sha3 from 'js-sha3';
+const { sha3_256 } = sha3;
+/**
+ * Compute SHA3-256 hash of data
+ * @param data - Buffer or string to hash
+ * @returns 64-character hex hash string
+ */
+export function hash(data) {
+    if (Buffer.isBuffer(data)) {
+        return sha3_256(data);
+    }
+    return sha3_256(data);
+}
+/**
+ * Compute SHA3-256 hash of combined data
+ * Used for Merkle tree pair hashing
+ * @param a - First hash
+ * @param b - Second hash
+ * @returns Combined hash (sorted to ensure consistency)
+ */
+export function hashPair(a, b) {
+    // Sort to ensure deterministic ordering
+    const [left, right] = a < b ? [a, b] : [b, a];
+    return sha3_256(left + right);
+}
+/**
+ * Verify a hash matches the data
+ * @param data - Original data
+ * @param expectedHash - Expected hash value
+ * @returns true if hash matches
+ */
+export function verifyHash(data, expectedHash) {
+    return hash(data) === expectedHash;
+}
+/**
+ * Compute hash of JSON object
+ * @param obj - Object to hash
+ * @returns SHA3-256 hash of JSON string
+ */
+export function hashObject(obj) {
+    const json = JSON.stringify(obj, Object.keys(obj).sort());
+    return hash(json);
+}
+/**
+ * Check if a string is a valid SHA3-256 hash
+ * @param str - String to check
+ * @returns true if valid 64-character hex string
+ */
+export function isValidHash(str) {
+    return /^[a-f0-9]{64}$/i.test(str);
+}
+//# sourceMappingURL=hash.js.map

package/dist/src/utils/hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../../src/utils/hash.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,IAAI,MAAM,SAAS,CAAC;AAC3B,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;AAG1B;;;;GAIG;AACH,MAAM,UAAU,IAAI,CAAC,IAAqB;IACxC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,CAAW,EAAE,CAAW;IAC/C,wCAAwC;IACxC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9C,OAAO,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AAChC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAqB,EAAE,YAAsB;IACtE,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,YAAY,CAAC;AACrC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAY;IACrC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,GAAa,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACpE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW;IACrC,OAAO,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,CAAC"}

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

@@ -0,0 +1,26 @@
+/**
+ * Utility Functions Export
+ * @module utils
+ */
+export * from './hash.js';
+export * from './uuid.js';
+export * from './similarity.js';
+export * from './logger.js';
+export * from './metrics.js';
+/**
+ * Get current ISO8601 timestamp
+ */
+export declare function now(): string;
+/**
+ * Sleep for specified milliseconds
+ */
+export declare function sleep(ms: number): Promise<void>;
+/**
+ * Retry a function with exponential backoff
+ */
+export declare function retry<T>(fn: () => Promise<T>, maxRetries?: number, baseDelayMs?: number): Promise<T>;
+/**
+ * Chunk an array into smaller arrays
+ */
+export declare function chunkArray<T>(array: T[], size: number): T[][];
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAE7B;;GAEG;AACH,wBAAgB,GAAG,IAAI,MAAM,CAE5B;AAED;;GAEG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAE/C;AAED;;GAEG;AACH,wBAAsB,KAAK,CAAC,CAAC,EAC3B,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACpB,UAAU,GAAE,MAAU,EACtB,WAAW,GAAE,MAAY,GACxB,OAAO,CAAC,CAAC,CAAC,CAeZ;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,CAM7D"}