mindoodb 0.0.2 → 0.0.3

package/dist/core/appendonlystores/bloom.js

@@ -0,0 +1,228 @@
+"use strict";
+/**
+ * Bloom filter for compact set-membership summaries of store entry IDs.
+ *
+ * During network sync, a local store needs to determine which of its entry IDs
+ * are missing from a remote store.  Naively this requires sending every local ID
+ * to the remote for an exact `hasEntries` check — an O(n) network round-trip
+ * that dominates sync latency for large stores.
+ *
+ * A bloom filter provides a probabilistic shortcut: the remote store serializes
+ * its full ID set into a compact bitset ({@link StoreIdBloomSummary}) and sends
+ * it to the local side in a single response.  The local side then tests each of
+ * its own IDs against the bloom filter:
+ *
+ *   - **Definite negative** — the ID is certainly absent on the remote; no
+ *     round-trip needed, the entry can be pushed immediately.
+ *   - **Probable positive** — the ID *might* exist on the remote (subject to a
+ *     configurable false-positive rate, default 1 %).  Only these IDs require a
+ *     follow-up `hasEntries` call to confirm.
+ *
+ * This is used by {@link BasicOnDiskContentAddressedStore.getIdBloomSummary} and
+ * consumed by the sync loop in `BaseMindooDB` to partition IDs into
+ * "definitely missing" and "maybe existing" buckets before making any network
+ * calls.
+ *
+ * ### Implementation details
+ *
+ * - Uses **enhanced double hashing** (FNV-1a + DJB2) to derive `k` bit
+ *   positions from a single ID string, avoiding the need for `k` independent
+ *   hash functions.
+ * - Bit-array size and hash count are computed from the classic bloom filter
+ *   formulas to satisfy the requested false-positive rate.
+ * - The filter is versioned (`"bloom-v1"`) so future changes to hashing or
+ *   encoding remain backward-compatible.
+ *
+ * @module bloom
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createIdBloomSummary = createIdBloomSummary;
+exports.bloomMightContainId = bloomMightContainId;
+/** Cross-platform Uint8Array -> base64 string. */
+function uint8ArrayToBase64(bytes) {
+    let binary = "";
+    for (let i = 0; i < bytes.length; i++) {
+        binary += String.fromCharCode(bytes[i]);
+    }
+    return btoa(binary);
+}
+/** Cross-platform base64 string -> Uint8Array. */
+function base64ToUint8Array(base64) {
+    const binary = atob(base64);
+    const bytes = new Uint8Array(binary.length);
+    for (let i = 0; i < binary.length; i++) {
+        bytes[i] = binary.charCodeAt(i);
+    }
+    return bytes;
+}
+/** Default probability of a false positive (1 %). */
+const DEFAULT_FALSE_POSITIVE_RATE = 0.01;
+/** Salt mixed into every hash to namespace this bloom filter version. */
+const DEFAULT_SALT = "mindoodb-bloom-v1";
+/**
+ * FNV-1a 32-bit hash.
+ *
+ * Used as the first of two independent hash bases for enhanced double hashing.
+ * FNV-1a is fast, has good avalanche properties, and is simple to implement
+ * without external dependencies.
+ */
+function fnv1a32(input) {
+    let hash = 0x811c9dc5;
+    for (let i = 0; i < input.length; i++) {
+        hash ^= input.charCodeAt(i);
+        hash = Math.imul(hash, 0x01000193);
+    }
+    return hash >>> 0;
+}
+/**
+ * DJB2 32-bit hash (Daniel J. Bernstein).
+ *
+ * Used as the second hash base.  Chosen for its simplicity and because it is
+ * sufficiently independent from FNV-1a to give good bit dispersion when
+ * combined via enhanced double hashing: h(i) = h1 + i * h2.
+ */
+function djb2_32(input) {
+    let hash = 5381;
+    for (let i = 0; i < input.length; i++) {
+        hash = ((hash << 5) + hash + input.charCodeAt(i)) >>> 0;
+    }
+    return hash >>> 0;
+}
+/**
+ * Compute the optimal bit-array size and number of hash functions for a bloom
+ * filter given the expected item count and desired false-positive rate.
+ *
+ * Uses the standard formulas:
+ *   m = -(n * ln(p)) / (ln2)^2   (bit count)
+ *   k = (m / n) * ln2             (hash count)
+ *
+ * A minimum of 64 bits and 1 hash is enforced so the filter remains valid
+ * even for very small or empty sets.
+ *
+ * @param itemCount          Expected number of distinct IDs.
+ * @param falsePositiveRate  Target false-positive probability (0 < p < 1).
+ * @returns Optimal `bitCount` and `hashCount`.
+ */
+function computeBloomShape(itemCount, falsePositiveRate) {
+    if (itemCount <= 0) {
+        return { bitCount: 64, hashCount: 2 };
+    }
+    const ln2 = Math.log(2);
+    const bitCount = Math.max(64, Math.ceil((-itemCount * Math.log(falsePositiveRate)) / (ln2 * ln2)));
+    const hashCount = Math.max(1, Math.round((bitCount / itemCount) * ln2));
+    return { bitCount, hashCount };
+}
+/** Set a single bit in a byte-packed bitset. */
+function setBit(bitset, bitIndex) {
+    const byteIndex = Math.floor(bitIndex / 8);
+    const bitOffset = bitIndex % 8;
+    bitset[byteIndex] |= 1 << bitOffset;
+}
+/** Test whether a single bit is set in a byte-packed bitset. */
+function getBit(bitset, bitIndex) {
+    const byteIndex = Math.floor(bitIndex / 8);
+    const bitOffset = bitIndex % 8;
+    return (bitset[byteIndex] & (1 << bitOffset)) !== 0;
+}
+/**
+ * Derive `hashCount` bit-positions for an ID using enhanced double hashing.
+ *
+ * Enhanced double hashing computes k positions as:
+ *   index_i = (h1 + i * h2) mod bitCount
+ *
+ * where h1 = FNV-1a(salt + id) and h2 = DJB2(id + salt).  The salt is
+ * prepended/appended in opposite order to reduce correlation between the two
+ * hash values.
+ *
+ * @param id        The entry ID to hash.
+ * @param bitCount  Total bits in the bloom filter.
+ * @param hashCount Number of bit positions to produce.
+ * @param salt      Version-specific salt string.
+ * @returns Array of `hashCount` bit-positions in [0, bitCount).
+ */
+function bloomIndexes(id, bitCount, hashCount, salt) {
+    const h1 = fnv1a32(`${salt}:${id}`);
+    const h2 = djb2_32(`${id}:${salt}`) || 1;
+    const indexes = [];
+    for (let i = 0; i < hashCount; i++) {
+        indexes.push((h1 + i * h2) % bitCount);
+    }
+    return indexes;
+}
+/**
+ * Build a bloom filter summary from a list of entry IDs.
+ *
+ * The resulting {@link StoreIdBloomSummary} is a compact, serializable
+ * representation that can be transferred over the network (e.g. in sync
+ * protocol responses) and later queried with {@link bloomMightContainId}.
+ *
+ * Typical usage in the on-disk store:
+ * ```ts
+ * const ids = await store.getAllIds();
+ * const summary = createIdBloomSummary(ids);
+ * // send summary to the syncing peer
+ * ```
+ *
+ * @param ids               Array of entry ID strings to include in the filter.
+ * @param falsePositiveRate Target false-positive probability (default 1 %).
+ * @returns A serializable bloom filter summary (base64-encoded bitset).
+ */
+function createIdBloomSummary(ids, falsePositiveRate = DEFAULT_FALSE_POSITIVE_RATE) {
+    const { bitCount, hashCount } = computeBloomShape(ids.length, falsePositiveRate);
+    const bitset = new Uint8Array(Math.ceil(bitCount / 8));
+    for (const id of ids) {
+        const indexes = bloomIndexes(id, bitCount, hashCount, DEFAULT_SALT);
+        for (const idx of indexes) {
+            setBit(bitset, idx);
+        }
+    }
+    return {
+        version: "bloom-v1",
+        totalIds: ids.length,
+        bitCount,
+        hashCount,
+        salt: DEFAULT_SALT,
+        bitsetBase64: uint8ArrayToBase64(bitset),
+    };
+}
+/**
+ * Test whether an entry ID *might* be present in a bloom filter summary.
+ *
+ * - Returns `false` only when the ID is **definitely absent** — at least one
+ *   of its bit-positions is unset, so the ID was never inserted.
+ * - Returns `true` when the ID **might be present** — all bit-positions are
+ *   set, but this could be a false positive (probability ≤ the configured
+ *   false-positive rate).
+ *
+ * If the summary version is unrecognized, conservatively returns `true` to
+ * avoid incorrectly skipping entries during sync.
+ *
+ * Used in the sync loop to partition local IDs:
+ * ```ts
+ * for (const id of localIds) {
+ *   if (bloomMightContainId(remoteBloom, id)) {
+ *     maybeExisting.push(id);   // needs exact hasEntries() check
+ *   } else {
+ *     definitelyMissing.push(id); // can push without round-trip
+ *   }
+ * }
+ * ```
+ *
+ * @param summary  The bloom filter summary obtained from the remote store.
+ * @param id       The entry ID to test.
+ * @returns `true` if the ID might be in the set; `false` if it is definitely not.
+ */
+function bloomMightContainId(summary, id) {
+    if (summary.version !== "bloom-v1") {
+        return true;
+    }
+    const bitset = base64ToUint8Array(summary.bitsetBase64);
+    const indexes = bloomIndexes(id, summary.bitCount, summary.hashCount, summary.salt);
+    for (const idx of indexes) {
+        if (!getBit(bitset, idx)) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=bloom.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bloom.js","sourceRoot":"","sources":["../../../src/core/appendonlystores/bloom.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;;AAmJH,oDAmBC;AA6BD,kDAYC;AA3MD,kDAAkD;AAClD,SAAS,kBAAkB,CAAC,KAAiB;IAC3C,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;AACtB,CAAC;AAED,kDAAkD;AAClD,SAAS,kBAAkB,CAAC,MAAc;IACxC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qDAAqD;AACrD,MAAM,2BAA2B,GAAG,IAAI,CAAC;AAEzC,yEAAyE;AACzE,MAAM,YAAY,GAAG,mBAAmB,CAAC;AAEzC;;;;;;GAMG;AACH,SAAS,OAAO,CAAC,KAAa;IAC5B,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,OAAO,CAAC,KAAa;IAC5B,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,iBAAiB,CAAC,SAAiB,EAAE,iBAAyB;IACrE,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CACvB,EAAE,EACF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CACpE,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACxE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACjC,CAAC;AAED,gDAAgD;AAChD,SAAS,MAAM,CAAC,MAAkB,EAAE,QAAgB;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;IAC/B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;AACtC,CAAC;AAED,gEAAgE;AAChE,SAAS,MAAM,CAAC,MAAkB,EAAE,QAAgB;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;IAC/B,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,YAAY,CAAC,EAAU,EAAE,QAAgB,EAAE,SAAiB,EAAE,IAAY;IACjF,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,oBAAoB,CAAC,GAAa,EAAE,oBAA4B,2BAA2B;IACzG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IACjF,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,YAAY,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QACpE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,EAAE,UAAU;QACnB,QAAQ,EAAE,GAAG,CAAC,MAAM;QACpB,QAAQ;QACR,SAAS;QACT,IAAI,EAAE,YAAY;QAClB,YAAY,EAAE,kBAAkB,CAAC,MAAM,CAAC;KACzC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,SAAgB,mBAAmB,CAAC,OAA4B,EAAE,EAAU;IAC1E,IAAI,OAAO,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IACpF,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

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

@@ -1,5 +1,5 @@
-import type { StoreEntry, StoreEntryMetadata, StoreEntryType } from "../../types";
-import type { NetworkEncryptedEntry, AuthResult } from "./types";
+import type { StoreEntry, StoreEntryMetadata, StoreEntryType, StoreScanCursor, StoreScanFilters, StoreScanResult, StoreIdBloomSummary, StoreCompactionStatus } from "../../types";
+import type { NetworkEncryptedEntry, AuthResult, NetworkSyncCapabilities } from "./types";
 /**
  * Abstract interface for network communication in MindooDB sync.
  *
@@ -45,6 +45,11 @@ export interface NetworkTransport {
      * @throws NetworkError with type USER_REVOKED if user has been revoked
      */
     authenticate(challenge: string, signature: Uint8Array): Promise<AuthResult>;
+    /**
+     * Get advertised sync capabilities from the remote endpoint.
+     * Optional for backward compatibility.
+     */
+    getCapabilities?(token: string): Promise<NetworkSyncCapabilities>;
     /**
      * Find entries that the remote has which we don't have locally.
      *
@@ -85,6 +90,21 @@ export interface NetworkTransport {
      * @throws NetworkError with type USER_REVOKED if user has been revoked since token was issued
      */
     findEntries(token: string, type: StoreEntryType, creationDateFrom: number | null, creationDateUntil: number | null): Promise<StoreEntryMetadata[]>;
+    /**
+     * Cursor-based metadata scan from remote store.
+     *
+     * Optional transport capability. Implementations that do not support this
+     * can omit it; callers should fall back to findNewEntries/getAllIds paths.
+     */
+    scanEntriesSince?(token: string, cursor: StoreScanCursor | null, limit?: number, filters?: StoreScanFilters): Promise<StoreScanResult>;
+    /**
+     * Optional probabilistic ID summary for sync optimization.
+     */
+    getIdBloomSummary?(token: string): Promise<StoreIdBloomSummary>;
+    /**
+     * Optional compaction observability for remote store monitoring.
+     */
+    getCompactionStatus?(token: string): Promise<StoreCompactionStatus>;
     /**
      * Get entries from the remote store.
      *

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

@@ -1 +1 @@
-{"version":3,"file":"NetworkTransport.d.ts","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/NetworkTransport.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClF,OAAO,KAAK,EAAE,qBAAqB,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAEjE;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;;;;;;;;OAUG;IACH,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAEpD;;;;;;;;;;;;OAYG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAE5E;;;;;;;;;;;OAWG;IACH,cAAc,CACZ,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EAAE,GAChB,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;;;;;;;OAWG;IACH,oBAAoB,CAClB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;;;;;;;;OAYG;IACH,WAAW,CACT,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,cAAc,EACpB,gBAAgB,EAAE,MAAM,GAAG,IAAI,EAC/B,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;;;;;;;;OAYG;IACH,UAAU,CACR,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EAAE,GACZ,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAEpC;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEhE;;;;;;;;;;;OAWG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE5D;;;;;;;;;;OAUG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE5C;;;;;;;;;;;;;;;OAeG;IACH,mBAAmB,CACjB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAChC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;OAEG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf"}
+{"version":3,"file":"NetworkTransport.d.ts","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/NetworkTransport.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,UAAU,EACV,kBAAkB,EAClB,cAAc,EACd,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,mBAAmB,EACnB,qBAAqB,EACtB,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,qBAAqB,EAAE,UAAU,EAAE,uBAAuB,EAAE,MAAM,SAAS,CAAC;AAE1F;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;;;;;;;;OAUG;IACH,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAEpD;;;;;;;;;;;;OAYG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IAE5E;;;OAGG;IACH,eAAe,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,uBAAuB,CAAC,CAAC;IAElE;;;;;;;;;;;OAWG;IACH,cAAc,CACZ,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EAAE,GAChB,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;;;;;;;OAWG;IACH,oBAAoB,CAClB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;;;;;;;;OAYG;IACH,WAAW,CACT,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,cAAc,EACpB,gBAAgB,EAAE,MAAM,GAAG,IAAI,EAC/B,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;OAKG;IACH,gBAAgB,CAAC,CACf,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,eAAe,GAAG,IAAI,EAC9B,KAAK,CAAC,EAAE,MAAM,EACd,OAAO,CAAC,EAAE,gBAAgB,GACzB,OAAO,CAAC,eAAe,CAAC,CAAC;IAE5B;;OAEG;IACH,iBAAiB,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAEhE;;OAEG;IACH,mBAAmB,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC;IAEpE;;;;;;;;;;;;OAYG;IACH,UAAU,CACR,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EAAE,GACZ,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAEpC;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEhE;;;;;;;;;;;OAWG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE5D;;;;;;;;;;OAUG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE5C;;;;;;;;;;;;;;;OAeG;IACH,mBAAmB,CACjB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAChC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;OAEG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf"}

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

@@ -106,6 +106,16 @@ export interface AuthResult {
      */
     error?: string;
 }
+/**
+ * Advertised sync capabilities for transport-level feature negotiation.
+ * Used by clients to choose fast paths while preserving compatibility.
+ */
+export interface NetworkSyncCapabilities {
+    protocolVersion: string;
+    supportsCursorScan: boolean;
+    supportsIdBloomSummary: boolean;
+    supportsCompactionStatus: boolean;
+}
 /**
  * Network transport error types for error handling.
  */

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

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAEtD;;;;;;;;;GASG;AACH,MAAM,WAAW,qBAAsB,SAAQ,kBAAkB;IAC/D;;;;;;;;;;OAUG;IACH,mBAAmB,EAAE,UAAU,CAAC;CACjC;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,gBAAgB,EAAE,MAAM,CAAC;IAEzB;;;OAGG;IACH,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IAEZ;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IAEZ;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IAEZ;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,IAAI,EAAE,OAAO,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB;;OAEG;IACH,OAAO,EAAE,OAAO,CAAC;IAEjB;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,oBAAY,gBAAgB;IAC1B,kCAAkC;IAClC,aAAa,kBAAkB;IAC/B,4BAA4B;IAC5B,YAAY,iBAAiB;IAC7B,oCAAoC;IACpC,iBAAiB,sBAAsB;IACvC,wCAAwC;IACxC,iBAAiB,sBAAsB;IACvC,kCAAkC;IAClC,aAAa,kBAAkB;IAC/B,wBAAwB;IACxB,YAAY,iBAAiB;IAC7B,kCAAkC;IAClC,cAAc,mBAAmB;CAClC;AAED;;GAEG;AACH,qBAAa,YAAa,SAAQ,KAAK;aAEnB,IAAI,EAAE,gBAAgB;gBAAtB,IAAI,EAAE,gBAAgB,EACtC,OAAO,EAAE,MAAM;CAKlB"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAEtD;;;;;;;;;GASG;AACH,MAAM,WAAW,qBAAsB,SAAQ,kBAAkB;IAC/D;;;;;;;;;;OAUG;IACH,mBAAmB,EAAE,UAAU,CAAC;CACjC;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,gBAAgB,EAAE,MAAM,CAAC;IAEzB;;;OAGG;IACH,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IAEZ;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IAEZ;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IAEZ;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,IAAI,EAAE,OAAO,CAAC;CACf;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB;;OAEG;IACH,OAAO,EAAE,OAAO,CAAC;IAEjB;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;GAGG;AACH,MAAM,WAAW,uBAAuB;IACtC,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,OAAO,CAAC;IAC5B,sBAAsB,EAAE,OAAO,CAAC;IAChC,wBAAwB,EAAE,OAAO,CAAC;CACnC;AAED;;GAEG;AACH,oBAAY,gBAAgB;IAC1B,kCAAkC;IAClC,aAAa,kBAAkB;IAC/B,4BAA4B;IAC5B,YAAY,iBAAiB;IAC7B,oCAAoC;IACpC,iBAAiB,sBAAsB;IACvC,wCAAwC;IACxC,iBAAiB,sBAAsB;IACvC,kCAAkC;IAClC,aAAa,kBAAkB;IAC/B,wBAAwB;IACxB,YAAY,iBAAiB;IAC7B,kCAAkC;IAClC,cAAc,mBAAmB;CAClC;AAED;;GAEG;AACH,qBAAa,YAAa,SAAQ,KAAK;aAEnB,IAAI,EAAE,gBAAgB;gBAAtB,IAAI,EAAE,gBAAgB,EACtC,OAAO,EAAE,MAAM;CAKlB"}

package/dist/core/appendonlystores/network/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/types.ts"],"names":[],"mappings":";;;AA6HA;;GAEG;AACH,IAAY,gBAeX;AAfD,WAAY,gBAAgB;IAC1B,kCAAkC;IAClC,mDAA+B,CAAA;IAC/B,4BAA4B;IAC5B,iDAA6B,CAAA;IAC7B,oCAAoC;IACpC,2DAAuC,CAAA;IACvC,wCAAwC;IACxC,2DAAuC,CAAA;IACvC,kCAAkC;IAClC,mDAA+B,CAAA;IAC/B,wBAAwB;IACxB,iDAA6B,CAAA;IAC7B,kCAAkC;IAClC,qDAAiC,CAAA;AACnC,CAAC,EAfW,gBAAgB,gCAAhB,gBAAgB,QAe3B;AAED;;GAEG;AACH,MAAa,YAAa,SAAQ,KAAK;IACrC,YACkB,IAAsB,EACtC,OAAe;QAEf,KAAK,CAAC,OAAO,CAAC,CAAC;QAHC,SAAI,GAAJ,IAAI,CAAkB;QAItC,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;IAC7B,CAAC;CACF;AARD,oCAQC"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/types.ts"],"names":[],"mappings":";;;AAwIA;;GAEG;AACH,IAAY,gBAeX;AAfD,WAAY,gBAAgB;IAC1B,kCAAkC;IAClC,mDAA+B,CAAA;IAC/B,4BAA4B;IAC5B,iDAA6B,CAAA;IAC7B,oCAAoC;IACpC,2DAAuC,CAAA;IACvC,wCAAwC;IACxC,2DAAuC,CAAA;IACvC,kCAAkC;IAClC,mDAA+B,CAAA;IAC/B,wBAAwB;IACxB,iDAA6B,CAAA;IAC7B,kCAAkC;IAClC,qDAAiC,CAAA;AACnC,CAAC,EAfW,gBAAgB,gCAAhB,gBAAgB,QAe3B;AAED;;GAEG;AACH,MAAa,YAAa,SAAQ,KAAK;IACrC,YACkB,IAAsB,EACtC,OAAe;QAEf,KAAK,CAAC,OAAO,CAAC,CAAC;QAHC,SAAI,GAAJ,IAAI,CAAkB;QAItC,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;IAC7B,CAAC;CACF;AARD,oCAQC"}

package/dist/core/appendonlystores/types.d.ts

@@ -10,8 +10,100 @@ import type { StoreEntry, StoreEntryMetadata, StoreEntryType } from "../types";
  * - syncMode: "eager" | "lazy" - Synchronization strategy
  */
 export interface OpenStoreOptions {
+    /**
+     * If true, local persisted data is cleared during store initialization.
+     * Useful for deterministic test setups that need a clean slate.
+     */
+    clearLocalDataOnStartup?: boolean;
+    /**
+     * Optional base path for persistent store implementations.
+     * In-memory and remote stores can ignore this option.
+     */
+    basePath?: string;
+    /**
+     * Controls whether store-level indexing is enabled.
+     * Implementations may fall back to scan-based behavior when false.
+     */
+    indexingEnabled?: boolean;
+    /**
+     * Minimum number of metadata segment files before compaction runs.
+     * Applies to append-only on-disk stores. Use 0 or negative to disable.
+     */
+    metadataSegmentCompactionMinFiles?: number;
+    /**
+     * Maximum total bytes of metadata segment files before compaction runs.
+     * Applies to append-only on-disk stores. Use 0 or negative to disable.
+     */
+    metadataSegmentCompactionMaxBytes?: number;
     [key: string]: unknown;
 }
+/**
+ * Represents index build state for stores that support indexing.
+ */
+export interface StoreIndexBuildStatus {
+    phase: "idle" | "building" | "ready";
+    indexingEnabled: boolean;
+    progress01: number;
+}
+/**
+ * Optional compaction status for stores using appendable index segments.
+ */
+export interface StoreCompactionStatus {
+    enabled: boolean;
+    compactionMinFiles: number;
+    compactionMaxBytes: number;
+    totalCompactions: number;
+    totalCompactedFiles: number;
+    totalCompactedBytes: number;
+    totalCompactionDurationMs: number;
+    lastCompactionAt: number | null;
+    lastCompactedFiles: number;
+    lastCompactedBytes: number;
+    lastCompactionDurationMs: number;
+}
+/**
+ * Options for waiting on index readiness.
+ */
+export interface AwaitIndexReadyOptions {
+    timeoutMs?: number;
+}
+/**
+ * Cursor used by cursor-based store scans.
+ * Entries are ordered by (createdAt, id) ascending.
+ */
+export interface StoreScanCursor {
+    createdAt: number;
+    id: string;
+}
+/**
+ * Optional filters for cursor-based metadata scans.
+ */
+export interface StoreScanFilters {
+    docId?: string;
+    entryTypes?: StoreEntryType[];
+    creationDateFrom?: number | null;
+    creationDateUntil?: number | null;
+}
+/**
+ * Result payload for cursor-based metadata scans.
+ */
+export interface StoreScanResult {
+    entries: StoreEntryMetadata[];
+    nextCursor: StoreScanCursor | null;
+    hasMore: boolean;
+}
+/**
+ * Bloom filter summary over entry IDs for sync optimization.
+ * Can be exchanged between stores/transports to reduce hasEntries checks.
+ */
+export interface StoreIdBloomSummary {
+    version: "bloom-v1";
+    totalIds: number;
+    bitCount: number;
+    hashCount: number;
+    salt: string;
+    bitsetBase64: string;
+}
 /**
  * Result of creating stores for a database.
  * Contains the document store and an optional separate attachment store.
@@ -135,6 +227,19 @@ export interface ContentAddressedStore {
      * @return A list of all entry IDs in the store
      */
     getAllIds(): Promise<string[]>;
+    /**
+     * Cursor-based metadata scan.
+     * Preferred for large stores to avoid known-id set exchange.
+     *
+     * Ordering is deterministic: (createdAt ASC, id ASC).
+     * Returned entries are strictly after `cursor`.
+     */
+    scanEntriesSince?(cursor: StoreScanCursor | null, limit?: number, filters?: StoreScanFilters): Promise<StoreScanResult>;
+    /**
+     * Optional probabilistic summary over entry IDs for sync optimization.
+     * Callers must still perform exact reconciliation for correctness.
+     */
+    getIdBloomSummary?(): Promise<StoreIdBloomSummary>;
     /**
      * Resolve the dependency chain starting from an entry ID.
      * Returns IDs in dependency order, traversing backward through dependencyIds.
@@ -166,5 +271,23 @@ export interface ContentAddressedStore {
      * @throws Error if the store implementation does not support purging
      */
     purgeDocHistory(docId: string): Promise<void>;
+    /**
+     * Optional lifecycle hook for stores that persist local data.
+     * Implementations should delete all local store data and reset in-memory state.
+     */
+    clearAllLocalData?(): Promise<void>;
+    /**
+     * Optional readiness API for stores with background index creation.
+     * Stores without indexing should resolve immediately with ready status.
+     */
+    awaitIndexReady?(options?: AwaitIndexReadyOptions): Promise<StoreIndexBuildStatus>;
+    /**
+     * Optional status API for index build progress.
+     */
+    getIndexBuildStatus?(): StoreIndexBuildStatus;
+    /**
+     * Optional status API for metadata-segment compaction observability.
+     */
+    getCompactionStatus?(): Promise<StoreCompactionStatus>;
 }
 //# sourceMappingURL=types.d.ts.map

package/dist/core/appendonlystores/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/core/appendonlystores/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAE/E;;;;;;;;;GASG;AACH,MAAM,WAAW,gBAAgB;IAC/B,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;OAGG;IACH,QAAQ,EAAE,qBAAqB,CAAC;IAEhC;;;;;;;OAOG;IACH,eAAe,CAAC,EAAE,qBAAqB,CAAC;CACzC;AAED;;;;GAIG;AACH,MAAM,WAAW,4BAA4B;IAC3C;;;;;;;OAOG;IACH,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,iBAAiB,CAAC;CAC1E;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,WAAW,qBAAqB;IACpC;;;;OAIG;IACH,KAAK,IAAI,MAAM,CAAC;IAEhB;;;;;;;OAOG;IACH,UAAU,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEjD;;;;;;OAMG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAEjD;;;;;OAKG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE7C;;;;;;OAMG;IACH,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAElE;;;;;;OAMG;IACH,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEvF;;;;;;;;;;;OAWG;IACH,WAAW,CACT,IAAI,EAAE,cAAc,EACpB,gBAAgB,EAAE,MAAM,GAAG,IAAI,EAC/B,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;OAKG;IACH,SAAS,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE/B;;;;;;;;;;;;;;;OAeG;IACH,mBAAmB,CACjB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAChC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAErB;;;;;;;;;;;;OAYG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC/C"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/core/appendonlystores/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,UAAU,CAAC;AAE/E;;;;;;;;;GASG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;OAGG;IACH,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAElC;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,eAAe,CAAC,EAAE,OAAO,CAAC;IAE1B;;;OAGG;IACH,iCAAiC,CAAC,EAAE,MAAM,CAAC;IAE3C;;;OAGG;IACH,iCAAiC,CAAC,EAAE,MAAM,CAAC;IAE3C,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,OAAO,CAAC;IACrC,eAAe,EAAE,OAAO,CAAC;IACzB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,OAAO,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,yBAAyB,EAAE,MAAM,CAAC;IAClC,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,wBAAwB,EAAE,MAAM,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,UAAU,CAAC,EAAE,cAAc,EAAE,CAAC;IAC9B,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,iBAAiB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAC9B,UAAU,EAAE,eAAe,GAAG,IAAI,CAAC;IACnC,OAAO,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,UAAU,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC;;;OAGG;IACH,QAAQ,EAAE,qBAAqB,CAAC;IAEhC;;;;;;;OAOG;IACH,eAAe,CAAC,EAAE,qBAAqB,CAAC;CACzC;AAED;;;;GAIG;AACH,MAAM,WAAW,4BAA4B;IAC3C;;;;;;;OAOG;IACH,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,iBAAiB,CAAC;CAC1E;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,WAAW,qBAAqB;IACpC;;;;OAIG;IACH,KAAK,IAAI,MAAM,CAAC;IAEhB;;;;;;;OAOG;IACH,UAAU,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEjD;;;;;;OAMG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC;IAEjD;;;;;OAKG;IACH,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE7C;;;;;;OAMG;IACH,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAElE;;;;;;OAMG;IACH,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEvF;;;;;;;;;;;OAWG;IACH,WAAW,CACT,IAAI,EAAE,cAAc,EACpB,gBAAgB,EAAE,MAAM,GAAG,IAAI,EAC/B,iBAAiB,EAAE,MAAM,GAAG,IAAI,GAC/B,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;OAKG;IACH,SAAS,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE/B;;;;;;OAMG;IACH,gBAAgB,CAAC,CACf,MAAM,EAAE,eAAe,GAAG,IAAI,EAC9B,KAAK,CAAC,EAAE,MAAM,EACd,OAAO,CAAC,EAAE,gBAAgB,GACzB,OAAO,CAAC,eAAe,CAAC,CAAC;IAE5B;;;OAGG;IACH,iBAAiB,CAAC,IAAI,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAEnD;;;;;;;;;;;;;;;OAeG;IACH,mBAAmB,CACjB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAChC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAErB;;;;;;;;;;;;OAYG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE9C;;;OAGG;IACH,iBAAiB,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAEpC;;;OAGG;IACH,eAAe,CAAC,CAAC,OAAO,CAAC,EAAE,sBAAsB,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC;IAEnF;;OAEG;IACH,mBAAmB,CAAC,IAAI,qBAAqB,CAAC;IAE9C;;OAEG;IACH,mBAAmB,CAAC,IAAI,OAAO,CAAC,qBAAqB,CAAC,CAAC;CACxD"}

package/dist/core/automerge-adapter.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Platform-specific Automerge adapter for MindooDB
+ *
+ * - React Native: Uses react-native-automerge-generated (native Rust via UniFFI)
+ * - Browser/Node.js: Uses @automerge/automerge (WASM)
+ *
+ * Both implementations now provide the same WASM-compatible API.
+ */
+import * as AutomergeWasm from "@automerge/automerge";
+type AutomergeAPI = typeof AutomergeWasm;
+declare let Automerge: AutomergeAPI;
+declare let isNative: boolean;
+export { Automerge, isNative };
+export default Automerge;
+//# sourceMappingURL=automerge-adapter.d.ts.map

package/dist/core/automerge-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"automerge-adapter.d.ts","sourceRoot":"","sources":["../../src/core/automerge-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,aAAa,MAAM,sBAAsB,CAAC;AAGtD,KAAK,YAAY,GAAG,OAAO,aAAa,CAAC;AAGzC,QAAA,IAAI,SAAS,EAAE,YAAY,CAAC;AAC5B,QAAA,IAAI,QAAQ,SAAQ,CAAC;AAyBrB,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;AAC/B,eAAe,SAAS,CAAC"}

package/dist/core/automerge-adapter.js

@@ -0,0 +1,73 @@
+"use strict";
+/**
+ * Platform-specific Automerge adapter for MindooDB
+ *
+ * - React Native: Uses react-native-automerge-generated (native Rust via UniFFI)
+ * - Browser/Node.js: Uses @automerge/automerge (WASM)
+ *
+ * Both implementations now provide the same WASM-compatible API.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isNative = exports.Automerge = void 0;
+const AutomergeWasm = __importStar(require("@automerge/automerge"));
+// Runtime detection of available Automerge implementation
+let Automerge;
+let isNative = false;
+exports.isNative = isNative;
+try {
+    // Try to load native Automerge (React Native only)
+    // @ts-ignore - Module may not exist on Node.js/Browser
+    const nativeModule = require('react-native-automerge-generated');
+    if (nativeModule?.Automerge) {
+        // Use the WASM-compatible API from react-native-automerge-generated
+        exports.Automerge = Automerge = nativeModule.Automerge;
+        exports.isNative = isNative = true;
+        console.log('[MindooDB] ✓ Using native Rust Automerge (react-native-automerge-generated)');
+    }
+    else {
+        // Module loaded but Automerge API not available
+        exports.Automerge = Automerge = AutomergeWasm;
+        console.log('[MindooDB] ⚠ Native module loaded but Automerge API unavailable, using WASM');
+    }
+}
+catch (error) {
+    // Native module not available (Browser/Node.js)
+    exports.Automerge = Automerge = AutomergeWasm;
+    exports.isNative = isNative = false;
+    console.log('[MindooDB] ℹ Using WASM Automerge (Browser/Node.js mode)');
+}
+exports.default = Automerge;
+//# sourceMappingURL=automerge-adapter.js.map

package/dist/core/automerge-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"automerge-adapter.js","sourceRoot":"","sources":["../../src/core/automerge-adapter.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,oEAAsD;AAKtD,0DAA0D;AAC1D,IAAI,SAAuB,CAAC;AAC5B,IAAI,QAAQ,GAAG,KAAK,CAAC;AAyBD,4BAAQ;AAvB5B,IAAI,CAAC;IACH,mDAAmD;IACnD,uDAAuD;IACvD,MAAM,YAAY,GAAG,OAAO,CAAC,kCAAkC,CAAC,CAAC;IAEjE,IAAI,YAAY,EAAE,SAAS,EAAE,CAAC;QAC5B,oEAAoE;QACpE,oBAAA,SAAS,GAAG,YAAY,CAAC,SAAyB,CAAC;QACnD,mBAAA,QAAQ,GAAG,IAAI,CAAC;QAChB,OAAO,CAAC,GAAG,CAAC,6EAA6E,CAAC,CAAC;IAC7F,CAAC;SAAM,CAAC;QACN,gDAAgD;QAChD,oBAAA,SAAS,GAAG,aAAa,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,6EAA6E,CAAC,CAAC;IAC7F,CAAC;AACH,CAAC;AAAC,OAAO,KAAK,EAAE,CAAC;IACf,gDAAgD;IAChD,oBAAA,SAAS,GAAG,aAAa,CAAC;IAC1B,mBAAA,QAAQ,GAAG,KAAK,CAAC;IACjB,OAAO,CAAC,GAAG,CAAC,0DAA0D,CAAC,CAAC;AAC1E,CAAC;AAID,kBAAe,SAAS,CAAC"}

package/dist/core/crypto/pbkdf2Iterations.d.ts

@@ -0,0 +1,12 @@
+export declare const DEFAULT_PBKDF2_ITERATIONS = 310000;
+export declare const MIN_PBKDF2_ITERATIONS = 60000;
+/**
+ * Resolve PBKDF2 iterations from runtime overrides with safe bounds.
+ *
+ * Override order:
+ * 1) globalThis.__MINDOODB_PBKDF2_ITERATIONS (useful for RN/Expo runtime config)
+ * 2) process.env.MINDOODB_PBKDF2_ITERATIONS
+ * 3) defaultIterations
+ */
+export declare function resolvePbkdf2Iterations(defaultIterations?: number): number;
+//# sourceMappingURL=pbkdf2Iterations.d.ts.map

package/dist/core/crypto/pbkdf2Iterations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pbkdf2Iterations.d.ts","sourceRoot":"","sources":["../../../src/core/crypto/pbkdf2Iterations.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,yBAAyB,SAAS,CAAC;AAChD,eAAO,MAAM,qBAAqB,QAAQ,CAAC;AAE3C;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,iBAAiB,GAAE,MAAkC,GAAG,MAAM,CAgBrG"}

package/dist/core/crypto/pbkdf2Iterations.js

@@ -0,0 +1,55 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MIN_PBKDF2_ITERATIONS = exports.DEFAULT_PBKDF2_ITERATIONS = void 0;
+exports.resolvePbkdf2Iterations = resolvePbkdf2Iterations;
+exports.DEFAULT_PBKDF2_ITERATIONS = 310000;
+exports.MIN_PBKDF2_ITERATIONS = 60000;
+/**
+ * Resolve PBKDF2 iterations from runtime overrides with safe bounds.
+ *
+ * Override order:
+ * 1) globalThis.__MINDOODB_PBKDF2_ITERATIONS (useful for RN/Expo runtime config)
+ * 2) process.env.MINDOODB_PBKDF2_ITERATIONS
+ * 3) defaultIterations
+ */
+function resolvePbkdf2Iterations(defaultIterations = exports.DEFAULT_PBKDF2_ITERATIONS) {
+    const override = readOverride();
+    if (override === undefined) {
+        return defaultIterations;
+    }
+    const parsed = Number(override);
+    if (!Number.isFinite(parsed)) {
+        return defaultIterations;
+    }
+    const intValue = Math.floor(parsed);
+    if (intValue < exports.MIN_PBKDF2_ITERATIONS) {
+        return exports.MIN_PBKDF2_ITERATIONS;
+    }
+    return intValue;
+}
+function readOverride() {
+    try {
+        if (typeof globalThis !== "undefined") {
+            const g = globalThis;
+            if (g.__MINDOODB_PBKDF2_ITERATIONS !== undefined) {
+                return g.__MINDOODB_PBKDF2_ITERATIONS;
+            }
+        }
+    }
+    catch {
+        // no-op
+    }
+    try {
+        if (typeof process !== "undefined" && process.env) {
+            const fromEnv = process.env.MINDOODB_PBKDF2_ITERATIONS;
+            if (fromEnv !== undefined) {
+                return fromEnv;
+            }
+        }
+    }
+    catch {
+        // no-op
+    }
+    return undefined;
+}
+//# sourceMappingURL=pbkdf2Iterations.js.map

package/dist/core/crypto/pbkdf2Iterations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pbkdf2Iterations.js","sourceRoot":"","sources":["../../../src/core/crypto/pbkdf2Iterations.ts"],"names":[],"mappings":";;;AAWA,0DAgBC;AA3BY,QAAA,yBAAyB,GAAG,MAAM,CAAC;AACnC,QAAA,qBAAqB,GAAG,KAAK,CAAC;AAE3C;;;;;;;GAOG;AACH,SAAgB,uBAAuB,CAAC,oBAA4B,iCAAyB;IAC3F,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;IAChC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAED,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACpC,IAAI,QAAQ,GAAG,6BAAqB,EAAE,CAAC;QACrC,OAAO,6BAAqB,CAAC;IAC/B,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,YAAY;IACnB,IAAI,CAAC;QACH,IAAI,OAAO,UAAU,KAAK,WAAW,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,UAA4E,CAAC;YACvF,IAAI,CAAC,CAAC,4BAA4B,KAAK,SAAS,EAAE,CAAC;gBACjD,OAAO,CAAC,CAAC,4BAA4B,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,QAAQ;IACV,CAAC;IAED,IAAI,CAAC;QACH,IAAI,OAAO,OAAO,KAAK,WAAW,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC;YAClD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC;YACvD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,QAAQ;IACV,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}