agentic-qe 2.7.3 → 2.8.0

package/dist/edge/p2p/crdt/VectorClock.js

@@ -0,0 +1,499 @@
+"use strict";
+/**
+ * Vector Clock Implementation for Distributed Systems
+ *
+ * Provides causality tracking across distributed replicas using vector clocks.
+ * Enables detection of concurrent operations and proper merge ordering.
+ *
+ * @module edge/p2p/crdt/VectorClock
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.VectorClock = void 0;
+const types_1 = require("./types");
+// ============================================
+// Vector Clock Class
+// ============================================
+/**
+ * Vector clock for tracking causality in distributed systems.
+ *
+ * A vector clock is a map from replica IDs to logical timestamps.
+ * It enables detection of happens-before relationships and concurrent events.
+ *
+ * @example
+ * ```typescript
+ * const clock = new VectorClock('replica-1');
+ * clock.increment();
+ * clock.increment();
+ *
+ * const otherClock = VectorClock.fromSerialized(remoteClock);
+ * const comparison = clock.compare(otherClock);
+ *
+ * if (comparison === VectorClockComparison.Concurrent) {
+ *   // Handle concurrent modifications
+ * }
+ *
+ * clock.merge(otherClock);
+ * ```
+ */
+class VectorClock {
+    /**
+     * Create a new vector clock
+     *
+     * @param replicaId - Local replica identifier
+     * @param initial - Optional initial entries
+     */
+    constructor(replicaId, initial) {
+        this.localReplicaId = replicaId;
+        this.entries = initial ? new Map(initial) : new Map();
+        this.lastModified = Date.now();
+        // Initialize local replica entry if not present
+        if (!this.entries.has(replicaId)) {
+            this.entries.set(replicaId, 0);
+        }
+    }
+    // ============================================
+    // Core Operations
+    // ============================================
+    /**
+     * Increment the clock for the local replica
+     *
+     * @returns The new timestamp for this replica
+     */
+    increment() {
+        const current = this.entries.get(this.localReplicaId) ?? 0;
+        const next = current + 1;
+        this.entries.set(this.localReplicaId, next);
+        this.lastModified = Date.now();
+        return next;
+    }
+    /**
+     * Increment and return the updated clock (for chaining)
+     *
+     * @returns This clock instance
+     */
+    tick() {
+        this.increment();
+        return this;
+    }
+    /**
+     * Get the timestamp for a specific replica
+     *
+     * @param replicaId - Replica to query
+     * @returns Timestamp or 0 if replica unknown
+     */
+    get(replicaId) {
+        return this.entries.get(replicaId) ?? 0;
+    }
+    /**
+     * Get the local replica's timestamp
+     *
+     * @returns Local timestamp
+     */
+    getLocal() {
+        return this.get(this.localReplicaId);
+    }
+    /**
+     * Set the timestamp for a replica
+     *
+     * @param replicaId - Replica to update
+     * @param timestamp - New timestamp
+     */
+    set(replicaId, timestamp) {
+        if (timestamp < 0) {
+            throw new types_1.CRDTError('Timestamp must be non-negative', types_1.CRDTErrorCode.ClockError);
+        }
+        this.entries.set(replicaId, timestamp);
+        this.lastModified = Date.now();
+    }
+    /**
+     * Get all replica IDs in the clock
+     *
+     * @returns Array of replica IDs
+     */
+    replicas() {
+        return Array.from(this.entries.keys());
+    }
+    /**
+     * Get the number of replicas tracked
+     *
+     * @returns Number of entries
+     */
+    size() {
+        return this.entries.size;
+    }
+    // ============================================
+    // Comparison Operations
+    // ============================================
+    /**
+     * Compare this clock with another clock
+     *
+     * Returns:
+     * - Equal: Clocks are identical
+     * - Before: This clock happened before other
+     * - After: This clock happened after other
+     * - Concurrent: Clocks are incomparable (concurrent events)
+     *
+     * @param other - Clock to compare with
+     * @returns Comparison result
+     */
+    compare(other) {
+        const allReplicas = new Set([
+            ...this.entries.keys(),
+            ...other.entries.keys(),
+        ]);
+        let lessThan = false;
+        let greaterThan = false;
+        for (const replica of allReplicas) {
+            const thisTime = this.get(replica);
+            const otherTime = other.get(replica);
+            if (thisTime < otherTime) {
+                lessThan = true;
+            }
+            else if (thisTime > otherTime) {
+                greaterThan = true;
+            }
+            // Early exit if already concurrent
+            if (lessThan && greaterThan) {
+                return types_1.VectorClockComparison.Concurrent;
+            }
+        }
+        if (!lessThan && !greaterThan) {
+            return types_1.VectorClockComparison.Equal;
+        }
+        else if (lessThan && !greaterThan) {
+            return types_1.VectorClockComparison.Before;
+        }
+        else if (!lessThan && greaterThan) {
+            return types_1.VectorClockComparison.After;
+        }
+        else {
+            return types_1.VectorClockComparison.Concurrent;
+        }
+    }
+    /**
+     * Check if this clock happened before another
+     *
+     * @param other - Clock to compare with
+     * @returns True if this happened before other
+     */
+    happenedBefore(other) {
+        return this.compare(other) === types_1.VectorClockComparison.Before;
+    }
+    /**
+     * Check if this clock happened after another
+     *
+     * @param other - Clock to compare with
+     * @returns True if this happened after other
+     */
+    happenedAfter(other) {
+        return this.compare(other) === types_1.VectorClockComparison.After;
+    }
+    /**
+     * Check if this clock is concurrent with another
+     *
+     * @param other - Clock to compare with
+     * @returns True if clocks are concurrent
+     */
+    isConcurrent(other) {
+        return this.compare(other) === types_1.VectorClockComparison.Concurrent;
+    }
+    /**
+     * Check if clocks are equal
+     *
+     * @param other - Clock to compare with
+     * @returns True if clocks are equal
+     */
+    equals(other) {
+        return this.compare(other) === types_1.VectorClockComparison.Equal;
+    }
+    /**
+     * Check if this clock descends from another (happened after or equal)
+     *
+     * @param other - Clock to compare with
+     * @returns True if this descends from other
+     */
+    descendsFrom(other) {
+        const comparison = this.compare(other);
+        return (comparison === types_1.VectorClockComparison.After ||
+            comparison === types_1.VectorClockComparison.Equal);
+    }
+    // ============================================
+    // Merge Operations
+    // ============================================
+    /**
+     * Merge with another clock (element-wise maximum)
+     *
+     * The merge takes the maximum timestamp for each replica,
+     * ensuring the merged clock dominates both input clocks.
+     *
+     * @param other - Clock to merge with
+     * @returns This clock (mutated)
+     */
+    merge(other) {
+        const allReplicas = new Set([
+            ...this.entries.keys(),
+            ...other.entries.keys(),
+        ]);
+        for (const replica of allReplicas) {
+            const thisTime = this.get(replica);
+            const otherTime = other.get(replica);
+            this.entries.set(replica, Math.max(thisTime, otherTime));
+        }
+        this.lastModified = Date.now();
+        this.compact();
+        return this;
+    }
+    /**
+     * Create a merged clock without modifying this clock
+     *
+     * @param other - Clock to merge with
+     * @returns New merged clock
+     */
+    merged(other) {
+        return this.clone().merge(other);
+    }
+    /**
+     * Update this clock to receive a message from another replica
+     *
+     * This performs the standard vector clock receive operation:
+     * 1. Merge with the message's clock
+     * 2. Increment local replica's timestamp
+     *
+     * @param messageClock - Clock from received message
+     * @returns This clock (mutated)
+     */
+    receive(messageClock) {
+        this.merge(messageClock);
+        this.increment();
+        return this;
+    }
+    // ============================================
+    // Compaction
+    // ============================================
+    /**
+     * Compact the clock by removing zero entries for non-local replicas
+     *
+     * @returns Number of entries removed
+     */
+    compact() {
+        if (this.entries.size <= types_1.MAX_VECTOR_CLOCK_SIZE) {
+            return 0;
+        }
+        let removed = 0;
+        // Sort entries by timestamp (ascending) and remove lowest
+        const sortedEntries = Array.from(this.entries.entries())
+            .filter(([id]) => id !== this.localReplicaId)
+            .sort((a, b) => a[1] - b[1]);
+        const toRemove = this.entries.size - types_1.MAX_VECTOR_CLOCK_SIZE;
+        for (let i = 0; i < toRemove && i < sortedEntries.length; i++) {
+            const [id, timestamp] = sortedEntries[i];
+            // Only remove if timestamp is 0 or very old
+            if (timestamp === 0) {
+                this.entries.delete(id);
+                removed++;
+            }
+        }
+        return removed;
+    }
+    // ============================================
+    // Serialization
+    // ============================================
+    /**
+     * Convert to serializable format
+     *
+     * @returns Serialized vector clock
+     */
+    serialize() {
+        const entries = {};
+        for (const [id, timestamp] of this.entries) {
+            entries[id] = timestamp;
+        }
+        return {
+            entries,
+            lastModified: this.lastModified,
+        };
+    }
+    /**
+     * Create a vector clock from serialized data
+     *
+     * @param serialized - Serialized clock data
+     * @param replicaId - Local replica ID
+     * @returns New vector clock
+     */
+    static fromSerialized(serialized, replicaId) {
+        const entries = new Map();
+        for (const [id, timestamp] of Object.entries(serialized.entries)) {
+            entries.set(id, timestamp);
+        }
+        const clock = new VectorClock(replicaId, entries);
+        clock.lastModified = serialized.lastModified;
+        return clock;
+    }
+    /**
+     * Convert to JSON string
+     *
+     * @returns JSON representation
+     */
+    toJSON() {
+        return JSON.stringify(this.serialize());
+    }
+    /**
+     * Parse from JSON string
+     *
+     * @param json - JSON string
+     * @param replicaId - Local replica ID
+     * @returns Parsed vector clock
+     */
+    static fromJSON(json, replicaId) {
+        try {
+            const parsed = JSON.parse(json);
+            return VectorClock.fromSerialized(parsed, replicaId);
+        }
+        catch (error) {
+            throw new types_1.CRDTError(`Failed to parse vector clock: ${error instanceof Error ? error.message : String(error)}`, types_1.CRDTErrorCode.DeserializationError);
+        }
+    }
+    // ============================================
+    // Utility Methods
+    // ============================================
+    /**
+     * Create a deep copy of this clock
+     *
+     * @returns Cloned vector clock
+     */
+    clone() {
+        const cloned = new VectorClock(this.localReplicaId, new Map(this.entries));
+        cloned.lastModified = this.lastModified;
+        return cloned;
+    }
+    /**
+     * Reset the clock to initial state
+     */
+    reset() {
+        this.entries.clear();
+        this.entries.set(this.localReplicaId, 0);
+        this.lastModified = Date.now();
+    }
+    /**
+     * Get the state of the clock
+     *
+     * @returns Internal state
+     */
+    getState() {
+        return {
+            entries: new Map(this.entries),
+            lastModified: this.lastModified,
+        };
+    }
+    /**
+     * Get the local replica ID
+     *
+     * @returns Replica ID
+     */
+    getReplicaId() {
+        return this.localReplicaId;
+    }
+    /**
+     * Get the last modification timestamp
+     *
+     * @returns Wall timestamp
+     */
+    getLastModified() {
+        return this.lastModified;
+    }
+    /**
+     * Create a string representation for debugging
+     *
+     * @returns Debug string
+     */
+    toString() {
+        const pairs = Array.from(this.entries.entries())
+            .sort((a, b) => a[0].localeCompare(b[0]))
+            .map(([id, ts]) => `${id}:${ts}`)
+            .join(', ');
+        return `VectorClock{${pairs}}`;
+    }
+    // ============================================
+    // Static Factory Methods
+    // ============================================
+    /**
+     * Create an empty vector clock
+     *
+     * @param replicaId - Local replica ID
+     * @returns New empty clock
+     */
+    static empty(replicaId) {
+        return new VectorClock(replicaId);
+    }
+    /**
+     * Create a vector clock with initial timestamp
+     *
+     * @param replicaId - Local replica ID
+     * @param initialTimestamp - Initial timestamp for local replica
+     * @returns New clock with initial timestamp
+     */
+    static withTimestamp(replicaId, initialTimestamp) {
+        const clock = new VectorClock(replicaId);
+        clock.set(replicaId, initialTimestamp);
+        return clock;
+    }
+    /**
+     * Create a vector clock from a plain object
+     *
+     * @param replicaId - Local replica ID
+     * @param entries - Object mapping replica IDs to timestamps
+     * @returns New clock from entries
+     */
+    static fromEntries(replicaId, entries) {
+        const map = new Map();
+        for (const [id, ts] of Object.entries(entries)) {
+            map.set(id, ts);
+        }
+        return new VectorClock(replicaId, map);
+    }
+    /**
+     * Compute the maximum (join) of multiple clocks
+     *
+     * @param replicaId - Local replica ID for result
+     * @param clocks - Clocks to join
+     * @returns Joined clock
+     */
+    static max(replicaId, ...clocks) {
+        if (clocks.length === 0) {
+            return VectorClock.empty(replicaId);
+        }
+        const result = clocks[0].clone();
+        for (let i = 1; i < clocks.length; i++) {
+            result.merge(clocks[i]);
+        }
+        return result;
+    }
+    /**
+     * Check if a serialized clock is valid
+     *
+     * @param serialized - Serialized clock to validate
+     * @returns True if valid
+     */
+    static isValid(serialized) {
+        if (typeof serialized !== 'object' || serialized === null) {
+            return false;
+        }
+        const obj = serialized;
+        if (typeof obj.entries !== 'object' || obj.entries === null) {
+            return false;
+        }
+        if (typeof obj.lastModified !== 'number') {
+            return false;
+        }
+        const entries = obj.entries;
+        for (const value of Object.values(entries)) {
+            if (typeof value !== 'number' || value < 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+exports.VectorClock = VectorClock;
+//# sourceMappingURL=VectorClock.js.map

package/dist/edge/p2p/crdt/VectorClock.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"VectorClock.js","sourceRoot":"","sources":["../../../../src/edge/p2p/crdt/VectorClock.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;;AAEH,mCAUiB;AAEjB,+CAA+C;AAC/C,qBAAqB;AACrB,+CAA+C;AAE/C;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,WAAW;IAUtB;;;;;OAKG;IACH,YAAY,SAAoB,EAAE,OAA0C;QAC1E,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;QACtD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE/B,gDAAgD;QAChD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,kBAAkB;IAClB,+CAA+C;IAE/C;;;;OAIG;IACH,SAAS;QACP,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,IAAI;QACF,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,SAAoB;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACvC,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,SAAoB,EAAE,SAA2B;QACnD,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,iBAAS,CACjB,gCAAgC,EAChC,qBAAa,CAAC,UAAU,CACzB,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACvC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,+CAA+C;IAC/C,wBAAwB;IACxB,+CAA+C;IAE/C;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,KAAkB;QACxB,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;YAC1B,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;YACtB,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE;SACxB,CAAC,CAAC;QAEH,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErC,IAAI,QAAQ,GAAG,SAAS,EAAE,CAAC;gBACzB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;iBAAM,IAAI,QAAQ,GAAG,SAAS,EAAE,CAAC;gBAChC,WAAW,GAAG,IAAI,CAAC;YACrB,CAAC;YAED,mCAAmC;YACnC,IAAI,QAAQ,IAAI,WAAW,EAAE,CAAC;gBAC5B,OAAO,6BAAqB,CAAC,UAAU,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,IAAI,CAAC,WAAW,EAAE,CAAC;YAC9B,OAAO,6BAAqB,CAAC,KAAK,CAAC;QACrC,CAAC;aAAM,IAAI,QAAQ,IAAI,CAAC,WAAW,EAAE,CAAC;YACpC,OAAO,6BAAqB,CAAC,MAAM,CAAC;QACtC,CAAC;aAAM,IAAI,CAAC,QAAQ,IAAI,WAAW,EAAE,CAAC;YACpC,OAAO,6BAAqB,CAAC,KAAK,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,OAAO,6BAAqB,CAAC,UAAU,CAAC;QAC1C,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,KAAkB;QAC/B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,6BAAqB,CAAC,MAAM,CAAC;IAC9D,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,KAAkB;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,6BAAqB,CAAC,KAAK,CAAC;IAC7D,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,KAAkB;QAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,6BAAqB,CAAC,UAAU,CAAC;IAClE,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,KAAkB;QACvB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,6BAAqB,CAAC,KAAK,CAAC;IAC7D,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,KAAkB;QAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvC,OAAO,CACL,UAAU,KAAK,6BAAqB,CAAC,KAAK;YAC1C,UAAU,KAAK,6BAAqB,CAAC,KAAK,CAC3C,CAAC;IACJ,CAAC;IAED,+CAA+C;IAC/C,mBAAmB;IACnB,+CAA+C;IAE/C;;;;;;;;OAQG;IACH,KAAK,CAAC,KAAkB;QACtB,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;YAC1B,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;YACtB,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE;SACxB,CAAC,CAAC;QAEH,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,KAAkB;QACvB,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;OASG;IACH,OAAO,CAAC,YAAyB;QAC/B,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,+CAA+C;IAC/C,aAAa;IACb,+CAA+C;IAE/C;;;;OAIG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,6BAAqB,EAAE,CAAC;YAC/C,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,0DAA0D;QAC1D,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;aACrD,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,cAAc,CAAC;aAC5C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,6BAAqB,CAAC;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9D,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YACzC,4CAA4C;YAC5C,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACxB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,+CAA+C;IAC/C,gBAAgB;IAChB,+CAA+C;IAE/C;;;;OAIG;IACH,SAAS;QACP,MAAM,OAAO,GAAwC,EAAE,CAAC;QACxD,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC3C,OAAO,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;QAC1B,CAAC;QACD,OAAO;YACL,OAAO;YACP,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,cAAc,CACnB,UAAiC,EACjC,SAAoB;QAEpB,MAAM,OAAO,GAAG,IAAI,GAAG,EAA+B,CAAC;QACvD,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACjE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAC7B,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAClD,KAAK,CAAC,YAAY,GAAG,UAAU,CAAC,YAAY,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,MAAM;QACJ,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAY,EAAE,SAAoB;QAChD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAA0B,CAAC;YACzD,OAAO,WAAW,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACvD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,iBAAS,CACjB,iCAAiC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EACzF,qBAAa,CAAC,oBAAoB,CACnC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,kBAAkB;IAClB,+CAA+C;IAE/C;;;;OAIG;IACH,KAAK;QACH,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACxC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO;YACL,OAAO,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;YAC9B,YAAY,EAAE,IAAI,CAAC,YAAY;SAChC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;aAC7C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACxC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;aAChC,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,OAAO,eAAe,KAAK,GAAG,CAAC;IACjC,CAAC;IAED,+CAA+C;IAC/C,yBAAyB;IACzB,+CAA+C;IAE/C;;;;;OAKG;IACH,MAAM,CAAC,KAAK,CAAC,SAAoB;QAC/B,OAAO,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,aAAa,CAClB,SAAoB,EACpB,gBAAkC;QAElC,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;QACzC,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC;QACvC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,WAAW,CAChB,SAAoB,EACpB,OAA4C;QAE5C,MAAM,GAAG,GAAG,IAAI,GAAG,EAA+B,CAAC;QACnD,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/C,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,GAAG,CAAC,SAAoB,EAAE,GAAG,MAAqB;QACvD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,OAAO,CAAC,UAAmB;QAChC,IAAI,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,GAAG,GAAG,UAAqC,CAAC;QAClD,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,YAAY,KAAK,QAAQ,EAAE,CAAC;YACzC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,OAAO,GAAG,GAAG,CAAC,OAAkC,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC3C,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAvhBD,kCAuhBC"}

package/dist/edge/p2p/crdt/index.d.ts

@@ -0,0 +1,87 @@
+/**
+ * CRDT Module for P2P Conflict Resolution
+ *
+ * Conflict-free Replicated Data Types (CRDTs) for automatic conflict
+ * resolution in distributed pattern storage. Enables eventual consistency
+ * without coordination between peers.
+ *
+ * CRDTs Included:
+ * - GCounter: Grow-only counter (increment only)
+ * - LWWRegister: Last-Writer-Wins register (timestamp-based)
+ * - ORSet: Observed-Remove set (add-wins semantics)
+ * - PatternCRDT: Composite CRDT for SharedPattern objects
+ *
+ * @module edge/p2p/crdt
+ * @version 1.0.0
+ *
+ * @example
+ * ```typescript
+ * import {
+ *   CRDTStore,
+ *   GCounter,
+ *   LWWRegister,
+ *   ORSet,
+ *   PatternCRDT,
+ *   VectorClock,
+ * } from '@ruvector/edge/p2p/crdt';
+ *
+ * // Create a store
+ * const store = new CRDTStore({
+ *   replicaId: 'agent-1',
+ *   autoGC: true,
+ * });
+ *
+ * // Create CRDTs
+ * const counter = store.createGCounter('page-views');
+ * counter.increment();
+ *
+ * const tags = store.createORSet<string>('tags');
+ * tags.add('typescript');
+ * tags.add('testing');
+ *
+ * const pattern = store.createPattern({
+ *   id: 'pattern-1',
+ *   content: 'test code...',
+ *   type: 'unit-test',
+ *   category: 'test',
+ *   domain: 'api',
+ * });
+ *
+ * // Merge remote state
+ * store.applyState(remoteState);
+ *
+ * // Generate deltas for sync
+ * const deltas = store.generateDeltas(lastSyncClock);
+ * ```
+ */
+export * from './types';
+export { VectorClock } from './VectorClock';
+export { GCounter } from './GCounter';
+export { LWWRegister } from './LWWRegister';
+export { ORSet } from './ORSet';
+export { PatternCRDT, type PatternInput, type PatternData, type ModificationEntry } from './PatternCRDT';
+export { CRDTStore } from './CRDTStore';
+/**
+ * CRDT module version
+ */
+export declare const CRDT_VERSION = "1.0.0";
+/**
+ * CRDT module capabilities
+ */
+export declare const CRDT_CAPABILITIES: {
+    gCounter: boolean;
+    pnCounter: boolean;
+    lwwRegister: boolean;
+    mvRegister: boolean;
+    orSet: boolean;
+    twoPhaseSet: boolean;
+    lwwMap: boolean;
+    orMap: boolean;
+    patternCRDT: boolean;
+    vectorClocks: boolean;
+    deltaSync: boolean;
+    tombstoneGC: boolean;
+    conflictTracking: boolean;
+    eventEmission: boolean;
+};
+//# sourceMappingURL=index.d.ts.map

package/dist/edge/p2p/crdt/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/edge/p2p/crdt/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuDG;AAGH,cAAc,SAAS,CAAC;AAGxB,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAG5C,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,WAAW,EAAE,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAGzG,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC;;GAEG;AACH,eAAO,MAAM,YAAY,UAAU,CAAC;AAEpC;;GAEG;AACH,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;CA0B7B,CAAC"}