mindoodb 0.0.3 → 0.0.5

package/dist/core/appendonlystores/MaterializationPlanner.js

@@ -0,0 +1,326 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.topologicalByDependencies = topologicalByDependencies;
+exports.computeDocumentMaterializationPlan = computeDocumentMaterializationPlan;
+exports.computeBatchMaterializationPlan = computeBatchMaterializationPlan;
+/**
+ * Shared, metadata-only planner for causal document materialization.
+ *
+ * Why this exists:
+ * - local and remote stores need the same causal replay behavior
+ * - planner must work without decrypting payloads
+ * - replay order must be deterministic across runs
+ *
+ * Core invariant:
+ * - `entryIdsToApply` contains exactly the replay entries needed to reconstruct
+ *   latest state that are not already covered by the selected snapshot.
+ */
+const DOC_REPLAY_TYPES = new Set(["doc_create", "doc_change", "doc_delete"]);
+/**
+ * Returns true for entry types that can influence Automerge latest state replay.
+ */
+function isReplayEntry(meta) {
+    return DOC_REPLAY_TYPES.has(meta.entryType);
+}
+/**
+ * Computes latest-state heads and all replay entries causally reachable from them.
+ *
+ * `latestReachable` intentionally excludes unrelated historical branches that are
+ * not ancestors of current heads, so coverage/replay decisions only operate on
+ * data needed for latest state materialization.
+ */
+function buildLatestStateReachability(replayEntries) {
+    const byId = new Map();
+    const referenced = new Set();
+    for (const entry of replayEntries) {
+        byId.set(entry.id, entry);
+    }
+    for (const entry of replayEntries) {
+        for (const depId of entry.dependencyIds) {
+            if (byId.has(depId)) {
+                referenced.add(depId);
+            }
+        }
+    }
+    // Heads are entries that are not referenced as dependencies by any other replay entry.
+    const latestHeads = replayEntries
+        .filter((e) => !referenced.has(e.id))
+        .map((e) => e.id);
+    const latestReachable = new Set();
+    const stack = [...latestHeads];
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (latestReachable.has(id)) {
+            continue;
+        }
+        latestReachable.add(id);
+        const entry = byId.get(id);
+        if (!entry) {
+            continue;
+        }
+        for (const depId of entry.dependencyIds) {
+            if (byId.has(depId) && !latestReachable.has(depId)) {
+                stack.push(depId);
+            }
+        }
+    }
+    return { latestHeads, latestReachable };
+}
+/**
+ * Computes replay entries covered by the given snapshot.
+ *
+ * Coverage roots are chosen in this order:
+ * 1) explicit `snapshotHeadEntryIds` (preferred; most accurate)
+ * 2) snapshot `dependencyIds` (compatibility fallback)
+ */
+function coveredBySnapshot(snapshot, replayById) {
+    if (!snapshot) {
+        return new Set();
+    }
+    const roots = snapshot.snapshotHeadEntryIds && snapshot.snapshotHeadEntryIds.length > 0
+        ? snapshot.snapshotHeadEntryIds
+        : snapshot.dependencyIds;
+    const covered = new Set();
+    const stack = [...roots];
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (covered.has(id)) {
+            continue;
+        }
+        const entry = replayById.get(id);
+        if (!entry) {
+            continue;
+        }
+        covered.add(id);
+        for (const depId of entry.dependencyIds) {
+            if (!covered.has(depId)) {
+                stack.push(depId);
+            }
+        }
+    }
+    return covered;
+}
+/**
+ * Produces a stable, dependency-first ordering of replay entries using
+ * Kahn's algorithm for topological sorting.
+ *
+ * The caller passes a set of entry IDs that need to be replayed (the
+ * "uncovered" set from {@link computeDocumentMaterializationPlan}) and the
+ * full metadata map so the function can inspect each entry's
+ * `dependencyIds`.  The result is an array where every entry appears
+ * *after* all of its causal predecessors, which is the order
+ * `Automerge.applyChanges` requires to apply changes correctly.
+ *
+ * **Why Kahn's algorithm?**  It processes nodes in BFS order starting from
+ * roots (entries with no in-set dependencies), decrementing the in-degree
+ * of each dependent as its predecessors are emitted.  This naturally
+ * produces a valid topological order for any DAG.
+ *
+ * **Determinism:** When multiple entries become ready at the same time
+ * (in-degree drops to zero simultaneously), the queue is sorted
+ * lexicographically before the next dequeue.  This guarantees the same
+ * output regardless of `Set` or `Map` iteration order, which can vary
+ * across JavaScript engines and process runs.
+ *
+ * **Cycle safety:** In a well-formed Automerge DAG, cycles are impossible.
+ * However, if corrupted metadata somehow introduces a cycle, the algorithm
+ * detects it (ordered.length < ids.size) and falls back to a simple
+ * lexicographic sort so the caller still receives a complete list rather
+ * than a partial one.
+ *
+ * @param ids        The entry IDs to sort (typically the uncovered set).
+ * @param replayById Lookup map from entry ID to its metadata, used to
+ *                   read `dependencyIds` for graph edges.
+ * @returns Entry IDs in dependency-first order suitable for sequential
+ *          application to an Automerge document.
+ */
+function topologicalByDependencies(ids, replayById) {
+    // ── Build the in-degree and reverse-adjacency structures ──────────
+    // `indegree`   — for each id, how many of its dependencies are also in `ids`
+    // `dependents` — for each id, which other ids in the set depend on it
+    const indegree = new Map();
+    const dependents = new Map();
+    for (const id of ids) {
+        indegree.set(id, 0);
+        dependents.set(id, []);
+    }
+    for (const id of ids) {
+        const entry = replayById.get(id);
+        if (!entry) {
+            continue;
+        }
+        for (const depId of entry.dependencyIds) {
+            if (!ids.has(depId)) {
+                // Dependency is outside the uncovered set (already covered by
+                // the snapshot or not part of the latest-state DAG) — skip it.
+                continue;
+            }
+            indegree.set(id, (indegree.get(id) || 0) + 1);
+            dependents.get(depId).push(id);
+        }
+    }
+    // ── Kahn's BFS ────────────────────────────────────────────────────
+    // Seed the queue with root entries (in-degree 0 within the set).
+    const queue = Array.from(ids).filter((id) => (indegree.get(id) || 0) === 0);
+    queue.sort();
+    const ordered = [];
+    while (queue.length > 0) {
+        const id = queue.shift();
+        ordered.push(id);
+        for (const dep of dependents.get(id) || []) {
+            const next = (indegree.get(dep) || 0) - 1;
+            indegree.set(dep, next);
+            if (next === 0) {
+                queue.push(dep);
+            }
+        }
+        // Re-sort after adding newly ready entries to maintain determinism.
+        queue.sort();
+    }
+    // ── Cycle fallback ────────────────────────────────────────────────
+    if (ordered.length !== ids.size) {
+        return Array.from(ids).sort();
+    }
+    return ordered;
+}
+/**
+ * Computes a causal materialization plan for one document.
+ *
+ * Given all store entries for a document, this function answers two questions:
+ *
+ * 1. **Which snapshot should we load first?**
+ *    The planner evaluates every `doc_snapshot` entry and selects the one whose
+ *    causal coverage overlaps the most with the entries needed for the latest
+ *    document state.  A snapshot that covers 90% of the DAG means only 10%
+ *    of entries need to be replayed — a large win for documents with long
+ *    histories.  When two snapshots cover the same number of latest-state
+ *    entries, the newer one (by `createdAt`) wins as a deterministic
+ *    tie-breaker.  Correctness never depends on timestamps.
+ *
+ * 2. **Which change entries must be replayed on top of that snapshot?**
+ *    Every entry in the latest-state DAG that is *not* causally covered by
+ *    the selected snapshot is collected and sorted in dependency-first
+ *    (topological) order.  This is the minimal set of Automerge changes
+ *    the caller must decrypt and apply to reach the current document state.
+ *
+ * Snapshot selection strategy:
+ * - Choose the snapshot with maximal overlap against `latestReachable`.
+ * - Break equal-coverage ties by newer `createdAt` (optimization only).
+ * - If no snapshots exist, all replay entries are returned (full rebuild).
+ *
+ * Attachment entries (`attachment_chunk`) are never included — the planner
+ * operates exclusively on `doc_create`, `doc_change`, and `doc_delete`
+ * entries (the types tracked by `DOC_REPLAY_TYPES`).
+ *
+ * @param docId            The document to plan for.
+ * @param allEntriesForDoc Every entry metadata record for this document,
+ *                         including snapshots and attachments (attachments
+ *                         are filtered out internally).
+ * @param options          Pass `{ includeDiagnostics: true }` to populate the
+ *                         `diagnostics` field with head IDs and coverage counts.
+ * @returns A plan containing the snapshot to load (if any) and the ordered
+ *          list of entry IDs to apply afterwards.
+ */
+function computeDocumentMaterializationPlan(docId, allEntriesForDoc, options) {
+    // ── Step 1: Partition entries ──────────────────────────────────────
+    // Replay entries are the doc-lifecycle entries (create/change/delete) that
+    // form the Automerge DAG.  Snapshots are evaluated separately as candidate
+    // starting points.
+    const replayEntries = allEntriesForDoc.filter(isReplayEntry);
+    const replayById = new Map(replayEntries.map((e) => [e.id, e]));
+    const snapshots = allEntriesForDoc.filter((e) => e.entryType === "doc_snapshot");
+    // ── Step 2: Handle empty replay set ─────────────────────────────────
+    // After a dense sync the local store may contain only a snapshot with no
+    // individual change entries.  In that case select the newest snapshot so
+    // the caller can still load the document state.
+    if (replayEntries.length === 0) {
+        if (snapshots.length > 0) {
+            const best = snapshots.reduce((a, b) => (b.createdAt > a.createdAt ? b : a));
+            return {
+                docId,
+                snapshotEntryId: best.id,
+                entryIdsToApply: [],
+                diagnostics: options?.includeDiagnostics
+                    ? { headEntryIds: [], coveredLatestEntryCount: 0, uncoveredLatestEntryCount: 0 }
+                    : undefined,
+            };
+        }
+        return {
+            docId,
+            snapshotEntryId: null,
+            entryIdsToApply: [],
+            diagnostics: options?.includeDiagnostics
+                ? { headEntryIds: [], coveredLatestEntryCount: 0, uncoveredLatestEntryCount: 0 }
+                : undefined,
+        };
+    }
+    // ── Step 3: Build latest-state reachability ───────────────────────
+    // Identify the DAG heads (entries with no dependents) and walk backward
+    // to collect every entry causally needed for the current document state.
+    const { latestHeads, latestReachable } = buildLatestStateReachability(replayEntries);
+    // ── Step 4: Score each snapshot by how many latest-state entries it covers
+    let bestSnapshot = null;
+    let bestCoveredCount = -1;
+    for (const snapshot of snapshots) {
+        const covered = coveredBySnapshot(snapshot, replayById);
+        let coveredLatest = 0;
+        for (const id of latestReachable) {
+            if (covered.has(id)) {
+                coveredLatest++;
+            }
+        }
+        if (coveredLatest > bestCoveredCount ||
+            (coveredLatest === bestCoveredCount && bestSnapshot && snapshot.createdAt > bestSnapshot.createdAt)) {
+            bestSnapshot = snapshot;
+            bestCoveredCount = coveredLatest;
+        }
+        if (!bestSnapshot) {
+            bestSnapshot = snapshot;
+            bestCoveredCount = coveredLatest;
+        }
+    }
+    // ── Step 5: Compute the uncovered set ─────────────────────────────
+    // These are the entries that the selected snapshot does NOT already include.
+    // If no snapshot was selected, the entire latestReachable set is uncovered.
+    const covered = coveredBySnapshot(bestSnapshot, replayById);
+    const uncovered = new Set();
+    for (const id of latestReachable) {
+        if (!covered.has(id)) {
+            uncovered.add(id);
+        }
+    }
+    // ── Step 6: Sort uncovered entries in dependency-first order ──────
+    // This guarantees that Automerge.applyChanges sees each change only after
+    // all of its causal predecessors have already been applied.
+    const entryIdsToApply = topologicalByDependencies(uncovered, replayById);
+    return {
+        docId,
+        snapshotEntryId: bestSnapshot ? bestSnapshot.id : null,
+        entryIdsToApply,
+        diagnostics: options?.includeDiagnostics
+            ? {
+                headEntryIds: latestHeads,
+                coveredLatestEntryCount: bestCoveredCount < 0 ? 0 : bestCoveredCount,
+                uncoveredLatestEntryCount: uncovered.size,
+            }
+            : undefined,
+    };
+}
+/**
+ * Computes plans for many documents in one metadata pass.
+ *
+ * Batch planning is important for networked stores to reduce request/response
+ * chattiness during startup and dense sync operations.
+ */
+function computeBatchMaterializationPlan(allEntries, docIds, options) {
+    const byDoc = new Map();
+    for (const entry of allEntries) {
+        if (!byDoc.has(entry.docId)) {
+            byDoc.set(entry.docId, []);
+        }
+        byDoc.get(entry.docId).push(entry);
+    }
+    const plans = docIds.map((docId) => computeDocumentMaterializationPlan(docId, byDoc.get(docId) || [], options));
+    return { plans };
+}
+//# sourceMappingURL=MaterializationPlanner.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MaterializationPlanner.js","sourceRoot":"","sources":["../../../src/core/appendonlystores/MaterializationPlanner.ts"],"names":[],"mappings":";;AAwJA,8DAsDC;AAwCD,gFAkGC;AAQD,0EAkBC;AA3WD;;;;;;;;;;;GAWG;AACH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,CAAC,YAAY,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC;AAE7E;;GAEG;AACH,SAAS,aAAa,CAAC,IAAwB;IAC7C,OAAO,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,4BAA4B,CACnC,aAAmC;IAEnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAA8B,CAAC;IACnD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,uFAAuF;IACvF,MAAM,WAAW,GAAG,aAAa;SAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEpB,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,SAAS;QACX,CAAC;QACD,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CACxB,QAAmC,EACnC,UAA2C;IAE3C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,GAAG,EAAU,CAAC;IAC3B,CAAC;IAED,MAAM,KAAK,GAAG,QAAQ,CAAC,oBAAoB,IAAI,QAAQ,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC;QACrF,CAAC,CAAC,QAAQ,CAAC,oBAAoB;QAC/B,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC;IAE3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IACzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,SAAgB,yBAAyB,CACvC,GAAgB,EAChB,UAA2C;IAE3C,qEAAqE;IACrE,6EAA6E;IAC7E,sEAAsE;IACtE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACpB,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,8DAA8D;gBAC9D,+DAA+D;gBAC/D,SAAS;YACX,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,UAAU,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,iEAAiE;IACjE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5E,KAAK,CAAC,IAAI,EAAE,CAAC;IACb,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1C,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACxB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,oEAAoE;QACpE,KAAK,CAAC,IAAI,EAAE,CAAC;IACf,CAAC;IAED,qEAAqE;IACrE,IAAI,OAAO,CAAC,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;QAChC,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAChC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,SAAgB,kCAAkC,CAChD,KAAa,EACb,gBAAsC,EACtC,OAAoC;IAGpC,sEAAsE;IACtE,2EAA2E;IAC3E,2EAA2E;IAC3E,mBAAmB;IACnB,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,IAAI,GAAG,CAA6B,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,MAAM,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,cAAc,CAAC,CAAC;IAEjF,uEAAuE;IACvE,yEAAyE;IACzE,yEAAyE;IACzE,gDAAgD;IAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7E,OAAO;gBACL,KAAK;gBACL,eAAe,EAAE,IAAI,CAAC,EAAE;gBACxB,eAAe,EAAE,EAAE;gBACnB,WAAW,EAAE,OAAO,EAAE,kBAAkB;oBACtC,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,uBAAuB,EAAE,CAAC,EAAE,yBAAyB,EAAE,CAAC,EAAE;oBAChF,CAAC,CAAC,SAAS;aACd,CAAC;QACJ,CAAC;QACD,OAAO;YACL,KAAK;YACL,eAAe,EAAE,IAAI;YACrB,eAAe,EAAE,EAAE;YACnB,WAAW,EAAE,OAAO,EAAE,kBAAkB;gBACtC,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,uBAAuB,EAAE,CAAC,EAAE,yBAAyB,EAAE,CAAC,EAAE;gBAChF,CAAC,CAAC,SAAS;SACd,CAAC;IACJ,CAAC;IAED,qEAAqE;IACrE,wEAAwE;IACxE,yEAAyE;IACzE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG,4BAA4B,CAAC,aAAa,CAAC,CAAC;IAErF,4EAA4E;IAC5E,IAAI,YAAY,GAA8B,IAAI,CAAC;IACnD,IAAI,gBAAgB,GAAG,CAAC,CAAC,CAAC;IAE1B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,iBAAiB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACxD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;YACjC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpB,aAAa,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IACE,aAAa,GAAG,gBAAgB;YAChC,CAAC,aAAa,KAAK,gBAAgB,IAAI,YAAY,IAAI,QAAQ,CAAC,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,EACnG,CAAC;YACD,YAAY,GAAG,QAAQ,CAAC;YACxB,gBAAgB,GAAG,aAAa,CAAC;QACnC,CAAC;QACD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,YAAY,GAAG,QAAQ,CAAC;YACxB,gBAAgB,GAAG,aAAa,CAAC;QACnC,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,6EAA6E;IAC7E,4EAA4E;IAC5E,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,0EAA0E;IAC1E,4DAA4D;IAC5D,MAAM,eAAe,GAAG,yBAAyB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAEzE,OAAO;QACL,KAAK;QACL,eAAe,EAAE,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI;QACtD,eAAe;QACf,WAAW,EAAE,OAAO,EAAE,kBAAkB;YACtC,CAAC,CAAC;gBACE,YAAY,EAAE,WAAW;gBACzB,uBAAuB,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB;gBACpE,yBAAyB,EAAE,SAAS,CAAC,IAAI;aAC1C;YACH,CAAC,CAAC,SAAS;KACd,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAgB,+BAA+B,CAC7C,UAAgC,EAChC,MAAgB,EAChB,OAAoC;IAEpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgC,CAAC;IACtD,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACjC,kCAAkC,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,OAAO,CAAC,CAC3E,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,CAAC;AACnB,CAAC"}

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

@@ -1,4 +1,5 @@
 import type { StoreEntry, StoreEntryMetadata, StoreEntryType, StoreScanCursor, StoreScanFilters, StoreScanResult, StoreIdBloomSummary, StoreCompactionStatus } from "../../types";
+import type { AttachmentReadPlan, AttachmentReadPlanOptions, DocumentMaterializationBatchPlan, DocumentMaterializationPlan, MaterializationPlanOptions } from "../types";
 import type { NetworkEncryptedEntry, AuthResult, NetworkSyncCapabilities } from "./types";
 /**
  * Abstract interface for network communication in MindooDB sync.
@@ -19,6 +20,12 @@ import type { NetworkEncryptedEntry, AuthResult, NetworkSyncCapabilities } from
  * - Entry payloads are RSA-encrypted with recipient's public key
  */
 export interface NetworkTransport {
+    /**
+     * Optional stable identifier for this transport (e.g. the server URL).
+     * Used for local cache scoping so the same DB opened against different
+     * servers produces different cache entries.
+     */
+    getIdentity?(): string;
     /**
      * Request a challenge string for authentication.
      *
@@ -105,6 +112,21 @@ export interface NetworkTransport {
      * Optional compaction observability for remote store monitoring.
      */
     getCompactionStatus?(token: string): Promise<StoreCompactionStatus>;
+    /**
+     * Compute a causal materialization plan for one document on the remote store.
+     */
+    planDocumentMaterialization?(token: string, docId: string, options?: MaterializationPlanOptions): Promise<DocumentMaterializationPlan>;
+    /**
+     * Compute causal materialization plans for multiple documents on the remote store.
+     */
+    planDocumentMaterializationBatch?(token: string, docIds: string[], options?: MaterializationPlanOptions): Promise<DocumentMaterializationBatchPlan>;
+    /**
+     * Compute an attachment read plan on the remote store.
+     *
+     * This allows the remote side to walk its local attachment metadata and
+     * return a backend-agnostic chunk plan to the client with a single request.
+     */
+    planAttachmentReadByWalkingMetadata?(token: string, lastChunkId: string, attachmentSize: number, options: AttachmentReadPlanOptions): Promise<AttachmentReadPlan>;
     /**
      * Get entries from the remote store.
      *
@@ -119,6 +141,17 @@ export interface NetworkTransport {
      * @throws NetworkError with type USER_REVOKED if user has been revoked since token was issued
      */
     getEntries(token: string, ids: string[]): Promise<NetworkEncryptedEntry[]>;
+    /**
+     * Get metadata for a single entry from the remote store.
+     *
+     * Useful for metadata-first dependency planning where the payload is not
+     * needed yet.
+     *
+     * @param token JWT access token from authenticate()
+     * @param id The entry ID to retrieve metadata for
+     * @returns The entry metadata, or null if the entry does not exist
+     */
+    getEntryMetadata(token: string, id: string): Promise<StoreEntryMetadata | null>;
     /**
      * Push entries to 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,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"}
+{"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,EACV,kBAAkB,EAClB,yBAAyB,EACzB,gCAAgC,EAChC,2BAA2B,EAC3B,0BAA0B,EAC3B,MAAM,UAAU,CAAC;AAClB,OAAO,KAAK,EAAE,qBAAqB,EAAE,UAAU,EAAE,uBAAuB,EAAE,MAAM,SAAS,CAAC;AAE1F;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;;OAIG;IACH,WAAW,CAAC,IAAI,MAAM,CAAC;IAEvB;;;;;;;;;;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;;OAEG;IACH,2BAA2B,CAAC,CAC1B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,0BAA0B,GACnC,OAAO,CAAC,2BAA2B,CAAC,CAAC;IAExC;;OAEG;IACH,gCAAgC,CAAC,CAC/B,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EAAE,EAChB,OAAO,CAAC,EAAE,0BAA0B,GACnC,OAAO,CAAC,gCAAgC,CAAC,CAAC;IAE7C;;;;;OAKG;IACH,mCAAmC,CAAC,CAClC,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,yBAAyB,GACjC,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAE/B;;;;;;;;;;;;OAYG;IACH,UAAU,CACR,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EAAE,GACZ,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAEpC;;;;;;;;;OASG;IACH,gBAAgB,CACd,KAAK,EAAE,MAAM,EACb,EAAE,EAAE,MAAM,GACT,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC,CAAC;IAEtC;;;;;;;;;;;;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

@@ -111,10 +111,43 @@ export interface AuthResult {
  * Used by clients to choose fast paths while preserving compatibility.
  */
 export interface NetworkSyncCapabilities {
+    /**
+     * Version of the advertised sync protocol shape.
+     * Useful for coarse compatibility checks and rollout diagnostics.
+     */
     protocolVersion: string;
+    /**
+     * Remote store supports cursor-based metadata scans via `scanEntriesSince()`.
+     * Clients can avoid full known-id exchanges when reconciling large stores.
+     */
     supportsCursorScan: boolean;
+    /**
+     * Remote store supports Bloom-filter summaries via `getIdBloomSummary()`.
+     * Clients can use probabilistic prefiltering before exact reconciliation.
+     */
     supportsIdBloomSummary: boolean;
+    /**
+     * Remote store exposes compaction/index observability via `getCompactionStatus()`.
+     * This is informational and used for monitoring/debugging rather than correctness.
+     */
     supportsCompactionStatus: boolean;
+    /**
+     * Remote store can compute a materialization plan for one document.
+     * Clients can ask the server which snapshot and change entries are needed
+     * instead of scanning and planning locally.
+     */
+    supportsMaterializationPlanning: boolean;
+    /**
+     * Remote store can compute materialization plans for multiple documents in one call.
+     * Clients can reduce round trips when opening or refreshing many documents.
+     */
+    supportsBatchMaterializationPlanning: boolean;
+    /**
+     * Remote store can compute attachment read plans from chunk metadata.
+     * Clients can delegate attachment range planning to the server instead of
+     * walking attachment chunk metadata over the network.
+     */
+    supportsAttachmentReadPlanning: boolean;
 }
 /**
  * Network transport error types for error handling.
@@ -130,6 +163,8 @@ export declare enum NetworkErrorType {
     CHALLENGE_EXPIRED = "CHALLENGE_EXPIRED",
     /** Network communication error */
     NETWORK_ERROR = "NETWORK_ERROR",
+    /** Request payload exceeded the remote server limit */
+    PAYLOAD_TOO_LARGE = "PAYLOAD_TOO_LARGE",
     /** Server-side error */
     SERVER_ERROR = "SERVER_ERROR",
     /** User not found in directory */

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;;;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"}
+{"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;;;OAGG;IACH,eAAe,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,kBAAkB,EAAE,OAAO,CAAC;IAC5B;;;OAGG;IACH,sBAAsB,EAAE,OAAO,CAAC;IAChC;;;OAGG;IACH,wBAAwB,EAAE,OAAO,CAAC;IAClC;;;;OAIG;IACH,+BAA+B,EAAE,OAAO,CAAC;IACzC;;;OAGG;IACH,oCAAoC,EAAE,OAAO,CAAC;IAC9C;;;;OAIG;IACH,8BAA8B,EAAE,OAAO,CAAC;CACzC;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,uDAAuD;IACvD,iBAAiB,sBAAsB;IACvC,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

@@ -16,6 +16,8 @@ var NetworkErrorType;
     NetworkErrorType["CHALLENGE_EXPIRED"] = "CHALLENGE_EXPIRED";
     /** Network communication error */
     NetworkErrorType["NETWORK_ERROR"] = "NETWORK_ERROR";
+    /** Request payload exceeded the remote server limit */
+    NetworkErrorType["PAYLOAD_TOO_LARGE"] = "PAYLOAD_TOO_LARGE";
     /** Server-side error */
     NetworkErrorType["SERVER_ERROR"] = "SERVER_ERROR";
     /** User not found in directory */

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":";;;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"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/core/appendonlystores/network/types.ts"],"names":[],"mappings":";;;AAyKA;;GAEG;AACH,IAAY,gBAiBX;AAjBD,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,uDAAuD;IACvD,2DAAuC,CAAA;IACvC,wBAAwB;IACxB,iDAA6B,CAAA;IAC7B,kCAAkC;IAClC,qDAAiC,CAAA;AACnC,CAAC,EAjBW,gBAAgB,gCAAhB,gBAAgB,QAiB3B;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"}