mindoodb 0.0.1

package/dist/core/appendonlystores/InMemoryContentAddressedStore.js

@@ -0,0 +1,293 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InMemoryContentAddressedStoreFactory = exports.InMemoryContentAddressedStore = void 0;
+/**
+ * A simple in-memory implementation of ContentAddressedStore for testing purposes.
+ *
+ * Uses dual-index storage:
+ * - Metadata indexed by entry id (primary key)
+ * - Encrypted bytes indexed by contentHash (for deduplication)
+ *
+ * This allows multiple entries to share the same encrypted bytes if they have
+ * the same contentHash, enabling storage-level deduplication.
+ */
+class InMemoryContentAddressedStore {
+    constructor(dbId) {
+        /** Metadata indexed by entry id */
+        this.entries = new Map();
+        /** Encrypted bytes indexed by contentHash (deduplicated) */
+        this.contentStore = new Map();
+        /** Index for finding entries by docId (for efficient doc queries) */
+        this.docIndex = new Map(); // docId -> Set<entryId>
+        this.dbId = dbId;
+    }
+    getId() {
+        return this.dbId;
+    }
+    /**
+     * Store one or more entries.
+     * - Metadata is stored by entry id (always unique)
+     * - Encrypted bytes are deduplicated by contentHash (same bytes stored once)
+     *
+     * @param entries The entries to store
+     * @return A promise that resolves when all entries are stored
+     */
+    async putEntries(entries) {
+        for (const entry of entries) {
+            // Check if we already have this entry by id (no-op if exists)
+            if (this.entries.has(entry.id)) {
+                console.log(`[InMemoryContentAddressedStore:${this.dbId}] Entry ${entry.id} already exists, skipping`);
+                continue;
+            }
+            // Separate metadata from encrypted data
+            const { encryptedData, ...metadata } = entry;
+            // Store metadata by id
+            this.entries.set(entry.id, metadata);
+            // Store bytes by contentHash (deduplication happens here)
+            if (!this.contentStore.has(entry.contentHash)) {
+                this.contentStore.set(entry.contentHash, encryptedData);
+                console.log(`[InMemoryContentAddressedStore:${this.dbId}] Stored content for hash ${entry.contentHash.substring(0, 8)}...`);
+            }
+            else {
+                console.log(`[InMemoryContentAddressedStore:${this.dbId}] Content ${entry.contentHash.substring(0, 8)}... already exists (deduplicated)`);
+            }
+            // Update document index
+            if (!this.docIndex.has(entry.docId)) {
+                this.docIndex.set(entry.docId, new Set());
+            }
+            this.docIndex.get(entry.docId).add(entry.id);
+            console.log(`[InMemoryContentAddressedStore:${this.dbId}] Stored entry ${entry.id} for doc ${entry.docId}`);
+        }
+    }
+    /**
+     * Get entries by their IDs.
+     * Returns only entries that exist in this store.
+     *
+     * @param ids The IDs of the entries to fetch
+     * @return A list of entries (may be shorter than input if some don't exist)
+     */
+    async getEntries(ids) {
+        const result = [];
+        for (const id of ids) {
+            const metadata = this.entries.get(id);
+            if (metadata) {
+                const encryptedData = this.contentStore.get(metadata.contentHash);
+                if (encryptedData) {
+                    result.push({ ...metadata, encryptedData });
+                }
+                else {
+                    console.warn(`[InMemoryContentAddressedStore:${this.dbId}] Content ${metadata.contentHash} not found for entry ${id}`);
+                }
+            }
+            else {
+                console.warn(`[InMemoryContentAddressedStore:${this.dbId}] Entry ${id} not found`);
+            }
+        }
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Retrieved ${result.length} entries out of ${ids.length} requested`);
+        return result;
+    }
+    /**
+     * Check which IDs from the provided list exist in this store.
+     *
+     * @param ids The IDs to check
+     * @return A list of IDs that exist in this store
+     */
+    async hasEntries(ids) {
+        const existing = [];
+        for (const id of ids) {
+            if (this.entries.has(id)) {
+                existing.push(id);
+            }
+        }
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Found ${existing.length} existing entries out of ${ids.length} checked`);
+        return existing;
+    }
+    /**
+     * Find entries in the store that are not listed in the given list of IDs.
+     * Used for synchronization to identify which entries we have that the peer doesn't.
+     *
+     * @param knownIds The list of entry IDs we already have
+     * @return A list of entry metadata for entries we have that aren't in knownIds
+     */
+    async findNewEntries(knownIds) {
+        // Create a Set of IDs we already have for fast lookup
+        const knownIdsSet = new Set(knownIds);
+        // Find all entries we have that are not in the provided list
+        const newEntries = [];
+        for (const [id, metadata] of this.entries) {
+            if (!knownIdsSet.has(id)) {
+                newEntries.push(metadata);
+            }
+        }
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Found ${newEntries.length} new entries out of ${this.entries.size} total`);
+        return newEntries;
+    }
+    /**
+     * Find entries in the store for a specific document that are not listed in the given list of IDs.
+     *
+     * @param knownIds The list of entry IDs we already have
+     * @param docId The ID of the document
+     * @return A list of entry metadata for entries we have that aren't in knownIds
+     */
+    async findNewEntriesForDoc(knownIds, docId) {
+        // Create a Set of IDs we already have for fast lookup
+        const knownIdsSet = new Set(knownIds);
+        // Get entry IDs for this specific document
+        const docEntryIds = this.docIndex.get(docId) || new Set();
+        // Find all entries for this doc that are not in the provided list
+        const newEntries = [];
+        for (const id of docEntryIds) {
+            if (!knownIdsSet.has(id)) {
+                const metadata = this.entries.get(id);
+                if (metadata) {
+                    newEntries.push(metadata);
+                }
+            }
+        }
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Found ${newEntries.length} new entries for doc ${docId} out of ${docEntryIds.size} total`);
+        return newEntries;
+    }
+    /**
+     * Get all entry IDs in the store.
+     * Used for synchronization to identify which entries we have.
+     *
+     * @return A list of all entry IDs in the store
+     */
+    async getAllIds() {
+        const ids = Array.from(this.entries.keys());
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Returning ${ids.length} entry IDs`);
+        return ids;
+    }
+    /**
+     * Resolve the dependency chain starting from an entry ID.
+     * Returns IDs in dependency order (oldest first), traversing backward through dependencyIds.
+     *
+     * @param startId The entry ID to start traversal from
+     * @param options Optional traversal options:
+     *   - stopAtEntryType: Stop when encountering an entry of this type (e.g., "doc_snapshot")
+     *   - maxDepth: Maximum number of hops to traverse
+     *   - includeStart: Whether to include startId in the result (default: true)
+     * @return A list of entry IDs in dependency order (oldest first)
+     */
+    async resolveDependencies(startId, options) {
+        const stopAtEntryType = options?.stopAtEntryType;
+        const maxDepth = options?.maxDepth;
+        const includeStart = options?.includeStart !== false; // default: true
+        const result = [];
+        const visited = new Set();
+        const queue = [{ id: startId, depth: 0 }];
+        while (queue.length > 0) {
+            const { id, depth } = queue.shift();
+            // Skip if already visited
+            if (visited.has(id)) {
+                continue;
+            }
+            visited.add(id);
+            // Check max depth
+            if (maxDepth !== undefined && depth > maxDepth) {
+                continue;
+            }
+            // Get the entry metadata
+            const entry = this.entries.get(id);
+            if (!entry) {
+                console.warn(`[InMemoryContentAddressedStore:${this.dbId}] Entry ${id} not found during dependency resolution`);
+                continue;
+            }
+            // Check stop condition
+            if (stopAtEntryType && entry.entryType === stopAtEntryType && id !== startId) {
+                // Include the stop entry but don't traverse its dependencies
+                result.push(id);
+                continue;
+            }
+            // Add to result (unless it's the start ID and includeStart is false)
+            if (id !== startId || includeStart) {
+                result.push(id);
+            }
+            // Queue dependencies for traversal
+            for (const depId of entry.dependencyIds) {
+                if (!visited.has(depId)) {
+                    queue.push({ id: depId, depth: depth + 1 });
+                }
+            }
+        }
+        // Reverse to get oldest first (we traversed from newest to oldest)
+        result.reverse();
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Resolved ${result.length} dependencies for ${startId}`);
+        return result;
+    }
+    /**
+     * Purge all entries for a specific document from the store.
+     * This breaks append-only semantics but is required for GDPR compliance.
+     *
+     * After purging, all entries for the specified document will be removed
+     * from the store. Content bytes that are no longer referenced by any
+     * entry will also be cleaned up.
+     *
+     * @param docId The document ID whose entries should be purged
+     * @return A promise that resolves when the purge is complete
+     */
+    async purgeDocHistory(docId) {
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Purging entry history for document: ${docId}`);
+        // Get all entry IDs for this document
+        const docEntryIds = this.docIndex.get(docId);
+        if (!docEntryIds || docEntryIds.size === 0) {
+            console.log(`[InMemoryContentAddressedStore:${this.dbId}] No entries found for document ${docId}, nothing to purge`);
+            return;
+        }
+        // Collect contentHashes that might become orphaned
+        const contentHashesToCheck = new Set();
+        // Remove each entry
+        for (const id of docEntryIds) {
+            const metadata = this.entries.get(id);
+            if (metadata) {
+                contentHashesToCheck.add(metadata.contentHash);
+                this.entries.delete(id);
+            }
+        }
+        // Remove document from docIndex
+        this.docIndex.delete(docId);
+        // Clean up orphaned content (no remaining entries reference it)
+        for (const contentHash of contentHashesToCheck) {
+            let isReferenced = false;
+            for (const [, meta] of this.entries) {
+                if (meta.contentHash === contentHash) {
+                    isReferenced = true;
+                    break;
+                }
+            }
+            if (!isReferenced) {
+                this.contentStore.delete(contentHash);
+                console.log(`[InMemoryContentAddressedStore:${this.dbId}] Cleaned up orphaned content ${contentHash.substring(0, 8)}...`);
+            }
+        }
+        console.log(`[InMemoryContentAddressedStore:${this.dbId}] Purged ${docEntryIds.size} entries for document ${docId}`);
+    }
+    /**
+     * Get storage statistics for debugging/monitoring.
+     * @returns Object with entry count, content count, and doc count
+     */
+    getStats() {
+        return {
+            entryCount: this.entries.size,
+            contentCount: this.contentStore.size,
+            docCount: this.docIndex.size,
+        };
+    }
+}
+exports.InMemoryContentAddressedStore = InMemoryContentAddressedStore;
+/**
+ * Factory for creating InMemoryContentAddressedStore instances.
+ * Each database gets its own isolated in-memory store.
+ */
+class InMemoryContentAddressedStoreFactory {
+    createStore(dbId, _options) {
+        // For in-memory stores, we use a single store for both documents and attachments
+        // Note: options are ignored for in-memory stores but accepted for interface compatibility
+        return {
+            docStore: new InMemoryContentAddressedStore(dbId),
+            // attachmentStore not provided - will use docStore for attachments
+        };
+    }
+}
+exports.InMemoryContentAddressedStoreFactory = InMemoryContentAddressedStoreFactory;
+//# sourceMappingURL=InMemoryContentAddressedStore.js.map

package/dist/core/appendonlystores/InMemoryContentAddressedStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryContentAddressedStore.js","sourceRoot":"","sources":["../../../src/core/appendonlystores/InMemoryContentAddressedStore.ts"],"names":[],"mappings":";;;AAWA;;;;;;;;;GASG;AACH,MAAa,6BAA6B;IAYxC,YAAY,IAAY;QATxB,mCAAmC;QAC3B,YAAO,GAAoC,IAAI,GAAG,EAAE,CAAC;QAE7D,4DAA4D;QACpD,iBAAY,GAA4B,IAAI,GAAG,EAAE,CAAC;QAE1D,qEAAqE;QAC7D,aAAQ,GAA6B,IAAI,GAAG,EAAE,CAAC,CAAC,wBAAwB;QAG9E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,UAAU,CAAC,OAAqB;QACpC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,8DAA8D;YAC9D,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC/B,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE,2BAA2B,CAAC,CAAC;gBACvG,SAAS;YACX,CAAC;YAED,wCAAwC;YACxC,MAAM,EAAE,aAAa,EAAE,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC;YAE7C,uBAAuB;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YAErC,0DAA0D;YAC1D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC9C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;gBACxD,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,6BAA6B,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YAC9H,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,aAAa,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,mCAAmC,CAAC,CAAC;YAC5I,CAAC;YAED,wBAAwB;YACxB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC5C,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAE9C,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,kBAAkB,KAAK,CAAC,EAAE,YAAY,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9G,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,UAAU,CAAC,GAAa;QAC5B,MAAM,MAAM,GAAiB,EAAE,CAAC;QAEhC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;gBAClE,IAAI,aAAa,EAAE,CAAC;oBAClB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,EAAE,aAAa,EAAE,CAAC,CAAC;gBAC9C,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,IAAI,CAAC,kCAAkC,IAAI,CAAC,IAAI,aAAa,QAAQ,CAAC,WAAW,wBAAwB,EAAE,EAAE,CAAC,CAAC;gBACzH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,kCAAkC,IAAI,CAAC,IAAI,WAAW,EAAE,YAAY,CAAC,CAAC;YACrF,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,eAAe,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,MAAM,YAAY,CAAC,CAAC;QAC9H,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,UAAU,CAAC,GAAa;QAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,WAAW,QAAQ,CAAC,MAAM,4BAA4B,GAAG,CAAC,MAAM,UAAU,CAAC,CAAC;QACnI,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,cAAc,CAAC,QAAkB;QACrC,sDAAsD;QACtD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;QAE9C,6DAA6D;QAC7D,MAAM,UAAU,GAAyB,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC1C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,WAAW,UAAU,CAAC,MAAM,uBAAuB,IAAI,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,CAAC;QACrI,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,oBAAoB,CAAC,QAAkB,EAAE,KAAa;QAC1D,sDAAsD;QACtD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;QAE9C,2CAA2C;QAC3C,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAE1D,kEAAkE;QAClE,MAAM,UAAU,GAAyB,EAAE,CAAC;QAC5C,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,QAAQ,EAAE,CAAC;oBACb,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,WAAW,UAAU,CAAC,MAAM,wBAAwB,KAAK,WAAW,WAAW,CAAC,IAAI,QAAQ,CAAC,CAAC;QACrJ,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,SAAS;QACb,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;QAC5C,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,eAAe,GAAG,CAAC,MAAM,YAAY,CAAC,CAAC;QAC9F,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,mBAAmB,CACvB,OAAe,EACf,OAAiC;QAEjC,MAAM,eAAe,GAAG,OAAO,EAAE,eAAqC,CAAC;QACvE,MAAM,QAAQ,GAAG,OAAO,EAAE,QAA8B,CAAC;QACzD,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,KAAK,KAAK,CAAC,CAAC,gBAAgB;QAEtE,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAErC,0BAA0B;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEhB,kBAAkB;YAClB,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBAC/C,SAAS;YACX,CAAC;YAED,yBAAyB;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC,kCAAkC,IAAI,CAAC,IAAI,WAAW,EAAE,yCAAyC,CAAC,CAAC;gBAChH,SAAS;YACX,CAAC;YAED,uBAAuB;YACvB,IAAI,eAAe,IAAI,KAAK,CAAC,SAAS,KAAK,eAAe,IAAI,EAAE,KAAK,OAAO,EAAE,CAAC;gBAC7E,6DAA6D;gBAC7D,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChB,SAAS;YACX,CAAC;YAED,qEAAqE;YACrE,IAAI,EAAE,KAAK,OAAO,IAAI,YAAY,EAAE,CAAC;gBACnC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,CAAC;YAED,mCAAmC;YACnC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;gBACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,MAAM,CAAC,OAAO,EAAE,CAAC;QAEjB,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,cAAc,MAAM,CAAC,MAAM,qBAAqB,OAAO,EAAE,CAAC,CAAC;QAClH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,eAAe,CAAC,KAAa;QACjC,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,yCAAyC,KAAK,EAAE,CAAC,CAAC;QAEzG,sCAAsC;QACtC,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAE7C,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,mCAAmC,KAAK,oBAAoB,CAAC,CAAC;YACrH,OAAO;QACT,CAAC;QAED,mDAAmD;QACnD,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/C,oBAAoB;QACpB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,QAAQ,EAAE,CAAC;gBACb,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;gBAC/C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAE5B,gEAAgE;QAChE,KAAK,MAAM,WAAW,IAAI,oBAAoB,EAAE,CAAC;YAC/C,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACpC,IAAI,IAAI,CAAC,WAAW,KAAK,WAAW,EAAE,CAAC;oBACrC,YAAY,GAAG,IAAI,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBACtC,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,iCAAiC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5H,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,IAAI,YAAY,WAAW,CAAC,IAAI,yBAAyB,KAAK,EAAE,CAAC,CAAC;IACvH,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;YAC7B,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI;YACpC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;SAC7B,CAAC;IACJ,CAAC;CACF;AAlTD,sEAkTC;AAED;;;GAGG;AACH,MAAa,oCAAoC;IAC/C,WAAW,CAAC,IAAY,EAAE,QAA2B;QACnD,iFAAiF;QACjF,0FAA0F;QAC1F,OAAO;YACL,QAAQ,EAAE,IAAI,6BAA6B,CAAC,IAAI,CAAC;YACjD,mEAAmE;SACpE,CAAC;IACJ,CAAC;CACF;AATD,oFASC"}

package/dist/core/appendonlystores/network/AuthenticationService.d.ts

@@ -0,0 +1,78 @@
+import type { CryptoAdapter } from "../../crypto/CryptoAdapter";
+import type { MindooTenantDirectory } from "../../types";
+import type { AuthResult, NetworkAuthTokenPayload } from "./types";
+/**
+ * Authentication service for network sync operations.
+ *
+ * Handles:
+ * - Challenge generation (UUID v7)
+ * - Signature verification using user's public signing key
+ * - JWT token generation and validation
+ * - User revocation checks
+ *
+ * Security features:
+ * - Single-use challenges prevent replay attacks
+ * - Challenge expiration (5 minutes default)
+ * - Token expiration (1 hour default)
+ * - Revocation checks against tenant directory
+ */
+export declare class AuthenticationService {
+    private cryptoAdapter;
+    private directory;
+    private tenantId;
+    private challenges;
+    private jwtSecret;
+    private challengeExpirationMs;
+    private tokenExpirationMs;
+    constructor(cryptoAdapter: CryptoAdapter, directory: MindooTenantDirectory, tenantId: string, options?: {
+        jwtSecret?: Uint8Array;
+        challengeExpirationMs?: number;
+        tokenExpirationMs?: number;
+    });
+    /**
+     * Generate a challenge for a user to sign.
+     *
+     * @param username The username requesting authentication
+     * @returns The challenge string (UUID v7)
+     * @throws NetworkError if user not found or revoked
+     */
+    generateChallenge(username: string): Promise<string>;
+    /**
+     * Authenticate a user by verifying their signed challenge.
+     *
+     * @param challenge The challenge string
+     * @param signature The Ed25519 signature of the challenge
+     * @returns AuthResult with success status and JWT token
+     */
+    authenticate(challenge: string, signature: Uint8Array): Promise<AuthResult>;
+    /**
+     * Validate a JWT token.
+     *
+     * @param token The JWT token to validate
+     * @returns The token payload if valid, null otherwise
+     */
+    validateToken(token: string): Promise<NetworkAuthTokenPayload | null>;
+    /**
+     * Verify an Ed25519 signature.
+     */
+    private verifySignature;
+    /**
+     * Generate a JWT token.
+     * Uses HMAC-SHA256 for signing.
+     */
+    private generateToken;
+    /**
+     * Verify and decode a JWT token.
+     */
+    private verifyToken;
+    /**
+     * Clean up expired challenges.
+     */
+    private cleanupExpiredChallenges;
+    private base64UrlEncode;
+    private base64UrlDecode;
+    private uint8ArrayToBase64Url;
+    private base64UrlToUint8Array;
+    private base64ToUint8Array;
+}
+//# sourceMappingURL=AuthenticationService.d.ts.map

package/dist/core/appendonlystores/network/AuthenticationService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AuthenticationService.d.ts","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/AuthenticationService.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAChE,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAEV,UAAU,EACV,uBAAuB,EACxB,MAAM,SAAS,CAAC;AAGjB;;;;;;;;;;;;;;GAcG;AACH,qBAAa,qBAAqB;IAChC,OAAO,CAAC,aAAa,CAAgB;IACrC,OAAO,CAAC,SAAS,CAAwB;IACzC,OAAO,CAAC,QAAQ,CAAS;IAGzB,OAAO,CAAC,UAAU,CAAyC;IAG3D,OAAO,CAAC,SAAS,CAAa;IAG9B,OAAO,CAAC,qBAAqB,CAAS;IACtC,OAAO,CAAC,iBAAiB,CAAS;gBAGhC,aAAa,EAAE,aAAa,EAC5B,SAAS,EAAE,qBAAqB,EAChC,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE;QACR,SAAS,CAAC,EAAE,UAAU,CAAC;QACvB,qBAAqB,CAAC,EAAE,MAAM,CAAC;QAC/B,iBAAiB,CAAC,EAAE,MAAM,CAAC;KAC5B;IAcH;;;;;;OAMG;IACG,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAoC1D;;;;;;OAMG;IACG,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;IAwEjF;;;;;OAKG;IACG,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,uBAAuB,GAAG,IAAI,CAAC;IAiC3E;;OAEG;YACW,eAAe;IAwC7B;;;OAGG;YACW,aAAa;IAgC3B;;OAEG;YACW,WAAW;IA6CzB;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAWhC,OAAO,CAAC,eAAe;IAKvB,OAAO,CAAC,eAAe;IAQvB,OAAO,CAAC,qBAAqB;IAS7B,OAAO,CAAC,qBAAqB;IAa7B,OAAO,CAAC,kBAAkB;CAQ3B"}