@amalgm/shell 0.1.125 → 0.1.127

package/dist/registry-graph.js

@@ -2,111 +2,325 @@
  * The registry graph as this machine holds it.
  *
  * The authority stores the graph as a small head naming each root's immutable
- * pages, so this machine holds the same shape: the head, and the records of
- * every root that head names, grouped exactly as the head pages them. A
- * publication rebuilds only the roots it walked — every other root carries its
- * page list forward untouched, never re-serialized, re-hashed, or re-journaled.
+ * pages, and this machine holds exactly that: the head, plus the records of
+ * only the roots the current operation acts on. Nothing ever materializes the
+ * whole account — an Add reads its boundary root and the core root, a Register
+ * reads the roots it rebuilds, and every other root stays as page identities.
+ *
+ * Two page laws make root-scoped reading exact and cheap:
+ * - A root's pages are one contiguous uuid-sorted slice, so any single uuid
+ *   is found (or proven absent) by binary-searching pages — log(pages) page
+ *   reads, each proven against its declared identity and dropped after use.
+ * - Set-membership questions sweep pages one at a time, so their transient
+ *   memory is O(page), never O(graph).
  *
  * A resource whose authority snapshot is still records-shaped (a login's
  * initial publication, before any head has committed) is held with a null
- * head. Its first head commit must page every root at once, which is exactly
- * what the authority demands of a commit over a records base.
+ * head and every record in memory — such graphs are one machine's first
+ * publication and small by construction. Its first head commit must page
+ * every root at once, which is exactly what the authority demands of a
+ * commit over a records base.
  */
-import { assembleRootRecords, graphHeadChecksum, graphHeadFromRootPages, graphHeadReplacement, pagesForRoot, parseGraphHead, parseSnapshot, recordsByRoot, snapshotFromRecords, stableJson, ENTITY_CLOUD_SCHEMA_VERSION, GRAPH_HEAD_KIND, } from "@amalgm/live";
+import { graphHeadChecksum, graphHeadFromRootPages, graphHeadReplacement, pagesForRoot, parseGraphHead, parseGraphPage, parseSnapshot, proveRootPagination, recordsByRoot, snapshotFromRecords, stableJson, ENTITY_CLOUD_SCHEMA_VERSION, GRAPH_HEAD_KIND, } from "@amalgm/live";
+/** How many pages a root materialization fetches ahead of its in-order
+ * proof. Bounds transient page bytes at PAGE_PREFETCH page budgets. */
+const PAGE_PREFETCH = 4;
+function rawUuid(row) {
+    return String(row?.uuid ?? "");
+}
 export class RegistryGraph {
     /** The committed head, or null while the authority still holds a
      * records-shaped snapshot. */
     head;
-    rootRecords;
-    flat = null;
-    rootIndex = null;
-    constructor(head, rootRecords) {
+    roots;
+    readPage;
+    sha256Hex;
+    constructor(head, roots, readPage, sha256Hex) {
         this.head = head;
-        this.rootRecords = rootRecords;
+        this.roots = roots;
+        this.readPage = readPage;
+        this.sha256Hex = sha256Hex;
+    }
+    /** Hold a records-shaped snapshot fully materialized: it is a first
+     * publication's own graph and carries no page identities to defer to. */
+    static fromRecords(records, sha256Hex) {
+        const roots = new Map();
+        for (const [rootId, group] of recordsByRoot(records)) {
+            roots.set(rootId, {
+                pages: [],
+                records: group,
+                rootRecord: group.find((record) => record.uuid === rootId) ?? null,
+                loading: null,
+            });
+        }
+        const reader = () => {
+            throw new Error("a records-shaped graph has no pages to read");
+        };
+        return new RegistryGraph(null, roots, reader, sha256Hex);
     }
-    /** Hold a records-shaped snapshot as the same per-root groups a head would
-     * name, so every reader above this class is shape-blind. */
-    static fromRecords(records) {
-        return new RegistryGraph(null, recordsByRoot(records));
+    /** Hold a committed head lazily: every root starts as page identities and
+     * materializes only when an operation reads it. */
+    static fromHead(head, readPage, sha256Hex) {
+        const roots = new Map();
+        for (const root of head.roots) {
+            roots.set(root.rootId, {
+                pages: root.pages,
+                records: null,
+                rootRecord: null,
+                loading: null,
+            });
+        }
+        return new RegistryGraph(head, roots, readPage, sha256Hex);
     }
     rootIds() {
-        return [...this.rootRecords.keys()];
+        return [...this.roots.keys()];
     }
-    recordsFor(rootId) {
-        return this.rootRecords.get(rootId.toLowerCase()) ?? [];
+    /** The records of one root as this machine has already materialized them,
+     * or null when that root is still page identities. */
+    loadedRecords(rootId) {
+        return this.roots.get(rootId.toLowerCase())?.records ?? null;
     }
-    /** Every record of every root, uuid-sorted. Only whole-graph readers pay
-     * for this — a publication never calls it. */
-    records() {
-        this.flat ??= snapshotFromRecords([...this.rootRecords.values()].flat()).records;
-        return this.flat;
+    /** Materialize one root: every page proven and parsed in order with a
+     * bounded prefetch, bytes dropped as they are consumed, then the root's
+     * complete subtree and canonical-pagination proof. An absent root answers
+     * empty rather than faulting — reading a root that is not there is how
+     * callers learn it is not there. */
+    async recordsFor(rootId) {
+        const state = this.roots.get(rootId.toLowerCase());
+        if (!state)
+            return [];
+        if (state.records)
+            return state.records;
+        state.loading ??= (async () => {
+            const assembled = [];
+            await this.scanPages(state.pages, (rows) => {
+                assembled.push(...rows);
+            });
+            const records = proveRootPagination(rootId.toLowerCase(), assembled, state.pages, this.sha256Hex);
+            state.records = records;
+            state.rootRecord = records.find((record) => record.uuid === rootId.toLowerCase()) ?? null;
+            return records;
+        })();
+        try {
+            return await state.loading;
+        }
+        catch (error) {
+            state.loading = null;
+            throw error;
+        }
     }
-    /** The whole graph in the records shape the cold install and workspace
-     * selection paths read. Normalization already happened per root, so this
-     * only names the shape. */
-    snapshot() {
-        return {
-            schemaVersion: ENTITY_CLOUD_SCHEMA_VERSION,
-            kind: "amalgm-entity-registry",
-            records: this.records(),
-        };
+    /** One root's own record — the discovery unit. Found by binary search over
+     * the root's uuid-sorted pages without materializing the root; each probed
+     * page is proven against its identity and dropped. */
+    async rootRecord(rootId) {
+        const normalized = rootId.toLowerCase();
+        const state = this.roots.get(normalized);
+        if (!state)
+            throw new Error(`cloud graph has no root ${normalized}`);
+        if (state.rootRecord)
+            return state.rootRecord;
+        if (state.records) {
+            throw new Error(`cloud graph root ${normalized} does not hold its own record`);
+        }
+        const found = await this.findInPages(state.pages, normalized);
+        if (!found)
+            throw new Error(`cloud graph root ${normalized} does not hold its own record`);
+        state.rootRecord = found;
+        return found;
+    }
+    /** Every root's own record, for discovery over the whole account — which
+     * root is the core, which roots are workspaces — at log(pages) page reads
+     * per root instead of materializing anything. */
+    async rootRecords() {
+        return Promise.all([...this.roots.keys()].map((rootId) => this.rootRecord(rootId)));
     }
-    /** Which root a record descends from, or null when the graph does not hold
-     * it. The index is built once, and only for callers that need it. */
-    rootOf(uuid) {
-        if (!this.rootIndex) {
-            const index = new Map();
-            for (const [rootId, records] of this.rootRecords) {
-                for (const record of records)
-                    index.set(record.uuid, rootId);
+    /** Which root holds this uuid, or null when the graph does not. A uuid that
+     * names a root is answered directly; anything else binary-searches each
+     * root's pages, materialized roots answered from memory. */
+    async locate(uuid) {
+        const normalized = uuid.toLowerCase();
+        if (this.roots.has(normalized))
+            return normalized;
+        const lazy = [];
+        for (const [rootId, state] of this.roots) {
+            if (state.records) {
+                if (state.records.some((record) => record.uuid === normalized))
+                    return rootId;
+            }
+            else {
+                lazy.push([rootId, state]);
             }
-            this.rootIndex = index;
         }
-        return this.rootIndex.get(uuid) ?? null;
+        for (const [rootId, state] of lazy) {
+            if (await this.findInPages(state.pages, normalized))
+                return rootId;
+        }
+        return null;
+    }
+    /** Which root holds each of these uuids. Materialized roots answer from
+     * memory; the rest are swept page-at-a-time with transient parses, so one
+     * miss-heavy question — a publication merge asking about thousands of
+     * fresh uuids — costs one bounded pass, not one probe per uuid. */
+    async membership(uuids) {
+        const found = new Map();
+        const lazy = [];
+        for (const [rootId, state] of this.roots) {
+            if (uuids.has(rootId))
+                found.set(rootId, rootId);
+            if (state.records) {
+                for (const record of state.records) {
+                    if (uuids.has(record.uuid))
+                        found.set(record.uuid, rootId);
+                }
+            }
+            else {
+                lazy.push([rootId, state]);
+            }
+        }
+        for (const [rootId, state] of lazy) {
+            if (found.size === uuids.size)
+                break;
+            await this.scanPages(state.pages, (rows) => {
+                for (const row of rows) {
+                    const uuid = rawUuid(row);
+                    if (uuids.has(uuid))
+                        found.set(uuid, rootId);
+                }
+                return found.size === uuids.size;
+            });
+        }
+        return found;
     }
     /** The checksum the authority holds for this graph right now. */
-    checksum(sha256Hex) {
-        return this.head === null
-            ? sha256Hex(stableJson(snapshotFromRecords(this.records())))
-            : graphHeadChecksum(this.head, sha256Hex);
+    checksum() {
+        if (this.head !== null)
+            return graphHeadChecksum(this.head, this.sha256Hex);
+        return this.sha256Hex(stableJson(this.recordsShapedSnapshot()));
+    }
+    /** The records shape of a headless graph — a first publication's own small
+     * snapshot. A committed head never flattens: readers are root-scoped. */
+    recordsShapedSnapshot() {
+        if (this.head !== null) {
+            throw new Error("a committed graph head is never flattened to records");
+        }
+        const records = [];
+        for (const state of this.roots.values())
+            records.push(...(state.records ?? []));
+        return {
+            schemaVersion: ENTITY_CLOUD_SCHEMA_VERSION,
+            kind: "amalgm-entity-registry",
+            records: snapshotFromRecords(records).records,
+        };
     }
     /** Publish a new graph in which `rebuilt` roots carry the given records and
-     * every other root carries its committed pages forward. A root mapped to an
+     * every other root carries its committed pages — and any records this
+     * machine already materialized for them — forward. A root mapped to an
      * empty record list is dropped from the graph. */
-    rebuild(rebuilt, sha256Hex) {
+    rebuild(rebuilt) {
         const replaced = new Map([...rebuilt].map(([rootId, records]) => [rootId.toLowerCase(), records]));
         if (this.head === null) {
             // The authority's base carries no page identities, so it can prove
             // nothing about a root this commit leaves alone. Paging every root is
             // the only lawful first head.
-            for (const rootId of this.rootRecords.keys()) {
+            for (const rootId of this.roots.keys()) {
                 if (!replaced.has(rootId)) {
                     throw new Error(`the first graph head must page every root, and ${rootId} is missing`);
                 }
             }
         }
-        const carried = (this.head?.roots ?? []).filter((root) => !replaced.has(root.rootId));
+        const nextRoots = new Map();
+        for (const [rootId, state] of this.roots) {
+            if (replaced.has(rootId))
+                continue;
+            nextRoots.set(rootId, {
+                pages: state.pages,
+                records: state.records,
+                rootRecord: state.rootRecord,
+                loading: null,
+            });
+        }
         const pages = [];
-        const paged = [];
-        const nextRecords = new Map(this.rootRecords);
         for (const [rootId, records] of replaced) {
-            if (records.length === 0) {
-                nextRecords.delete(rootId);
+            if (records.length === 0)
                 continue;
-            }
-            const rootPages = pagesForRoot(rootId, records, sha256Hex);
+            const rootPages = pagesForRoot(rootId, records, this.sha256Hex);
             pages.push(...rootPages);
-            paged.push({ rootId, pages: rootPages.map((page) => page.ref) });
-            nextRecords.set(rootId, rootPages.flatMap((page) => page.records));
+            const paged = rootPages.flatMap((page) => page.records);
+            nextRoots.set(rootId, {
+                pages: rootPages.map((page) => page.ref),
+                records: paged,
+                rootRecord: paged.find((record) => record.uuid === rootId) ?? null,
+                loading: null,
+            });
         }
-        const head = graphHeadFromRootPages([...carried, ...paged]);
+        const head = graphHeadFromRootPages([...nextRoots].map(([rootId, state]) => ({ rootId, pages: state.pages })));
         return {
-            graph: new RegistryGraph(head, nextRecords),
+            graph: new RegistryGraph(head, nextRoots, this.readPage, this.sha256Hex),
             operation: graphHeadReplacement(head, [...replaced.keys()]),
             pages,
-            checksum: graphHeadChecksum(head, sha256Hex),
+            checksum: graphHeadChecksum(head, this.sha256Hex),
         };
     }
+    /** Prove, parse, and visit pages in order, fetching a bounded window ahead
+     * so the network pipeline stays full while transient memory stays at a few
+     * page budgets. The visitor may answer true to stop the scan early. */
+    async scanPages(refs, visit) {
+        const pending = [];
+        let ahead = 0;
+        try {
+            for (let index = 0; index < refs.length; index += 1) {
+                while (ahead < refs.length && pending.length < PAGE_PREFETCH) {
+                    pending.push(this.readPage(refs[ahead]));
+                    ahead += 1;
+                }
+                const ref = refs[index];
+                const rows = parseGraphPage(ref, await pending.shift(), this.sha256Hex);
+                if (visit(rows, ref) === true)
+                    return;
+            }
+        }
+        finally {
+            // A stop or a fault must strand no in-flight read unobserved.
+            await Promise.allSettled(pending);
+        }
+    }
+    /** Binary-search one root's uuid-sorted pages for a single uuid. Each
+     * probed page is proven and dropped; the hit is normalized through the
+     * canonical record law before anyone reads it. */
+    async findInPages(refs, uuid) {
+        let low = 0;
+        let high = refs.length - 1;
+        while (low <= high) {
+            const middle = (low + high) >> 1;
+            const ref = refs[middle];
+            const rows = parseGraphPage(ref, await this.readPage(ref), this.sha256Hex);
+            if (rows.length === 0)
+                return null;
+            if (uuid < rawUuid(rows[0])) {
+                high = middle - 1;
+                continue;
+            }
+            if (uuid > rawUuid(rows[rows.length - 1])) {
+                low = middle + 1;
+                continue;
+            }
+            let start = 0;
+            let end = rows.length - 1;
+            while (start <= end) {
+                const probe = (start + end) >> 1;
+                const found = rawUuid(rows[probe]);
+                if (found === uuid) {
+                    return snapshotFromRecords([rows[probe]]).records[0] ?? null;
+                }
+                if (uuid < found)
+                    end = probe - 1;
+                else
+                    start = probe + 1;
+            }
+            return null;
+        }
+        return null;
+    }
 }
 /** Every page identity the head names — the set a publication may skip
  * uploading because the authority already holds it under this exact graph. */
@@ -118,25 +332,14 @@ export function graphPageIdentities(head) {
     }
     return identities;
 }
-/** Materialize the authority's stored snapshot bytes into this machine's
- * graph. A head is materialized by reading the pages it names; a records-shaped
- * snapshot is grouped in place. */
-export async function registryGraphFromSnapshot(bytes, readPages, sha256Hex) {
+/** Hold the authority's stored snapshot bytes as this machine's graph. A head
+ * is held lazily — no page is read here — and a records-shaped snapshot is
+ * grouped in place. */
+export function registryGraphFromSnapshot(bytes, readPage, sha256Hex) {
     if (!snapshotIsGraphHead(bytes)) {
-        return RegistryGraph.fromRecords(parseSnapshot(bytes).records);
-    }
-    const head = parseGraphHead(bytes);
-    const read = await readPages(head.roots.flatMap((root) => root.pages));
-    const rootRecords = new Map();
-    for (const root of head.roots) {
-        rootRecords.set(root.rootId, assembleRootRecords(root.rootId, root.pages, root.pages.map((page) => {
-            const found = read.get(page.sha256);
-            if (!found)
-                throw new Error(`cloud graph page ${page.sha256} was not read`);
-            return found;
-        }), sha256Hex));
-    }
-    return new RegistryGraph(head, rootRecords);
+        return RegistryGraph.fromRecords(parseSnapshot(bytes).records, sha256Hex);
+    }
+    return RegistryGraph.fromHead(parseGraphHead(bytes), readPage, sha256Hex);
 }
 /** Which shape the authority's snapshot bytes carry. Both shapes declare their
  * kind ahead of their payload, and no record carries a `kind` of its own, so

package/dist/registry-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"registry-graph.js","sourceRoot":"","sources":["../src/registry-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EACL,mBAAmB,EACnB,iBAAiB,EACjB,sBAAsB,EACtB,oBAAoB,EACpB,YAAY,EACZ,cAAc,EACd,aAAa,EACb,aAAa,EACb,mBAAmB,EACnB,UAAU,EACV,2BAA2B,EAC3B,eAAe,GAQhB,MAAM,cAAc,CAAC;AAYtB,MAAM,OAAO,aAAa;IACxB;kCAC8B;IACrB,IAAI,CAAwB;IAEpB,WAAW,CAAoD;IAExE,IAAI,GAAwC,IAAI,CAAC;IAEjD,SAAS,GAAuC,IAAI,CAAC;IAE7D,YACE,IAA2B,EAC3B,WAA8D;QAE9D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED;gEAC4D;IAC5D,MAAM,CAAC,WAAW,CAAC,OAAqC;QACtD,OAAO,IAAI,aAAa,CAAC,IAAI,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,UAAU,CAAC,MAAc;QACvB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAC1D,CAAC;IAED;kDAC8C;IAC9C,OAAO;QACL,IAAI,CAAC,IAAI,KAAK,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC;QACjF,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;+BAE2B;IAC3B,QAAQ;QACN,OAAO;YACL,aAAa,EAAE,2BAA2B;YAC1C,IAAI,EAAE,wBAAwB;YAC9B,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE;SACxB,CAAC;IACJ,CAAC;IAED;yEACqE;IACrE,MAAM,CAAC,IAAY;QACjB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;YACxC,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjD,KAAK,MAAM,MAAM,IAAI,OAAO;oBAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC/D,CAAC;YACD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IAC1C,CAAC;IAED,iEAAiE;IACjE,QAAQ,CAAC,SAAoB;QAC3B,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI;YACvB,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC5D,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC9C,CAAC;IAED;;sDAEkD;IAClD,OAAO,CACL,OAA0D,EAC1D,SAAoB;QAEpB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,CAC9D,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,OAAO,CAAU,CAAC,CAAC,CAAC;QAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACvB,mEAAmE;YACnE,sEAAsE;YACtE,8BAA8B;YAC9B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC1B,MAAM,IAAI,KAAK,CAAC,kDAAkD,MAAM,aAAa,CAAC,CAAC;gBACzF,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACtF,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAyD,EAAE,CAAC;QACvE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC3B,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;YAC3D,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACrE,CAAC;QACD,MAAM,IAAI,GAAG,sBAAsB,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAC5D,OAAO;YACL,KAAK,EAAE,IAAI,aAAa,CAAC,IAAI,EAAE,WAAW,CAAC;YAC3C,SAAS,EAAE,oBAAoB,CAAC,IAAI,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,KAAK;YACL,QAAQ,EAAE,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC;SAC7C,CAAC;IACJ,CAAC;CACF;AAED;8EAC8E;AAC9E,MAAM,UAAU,mBAAmB,CAAC,IAA2B;IAC7D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;mCAEmC;AACnC,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,KAAiB,EACjB,SAAsF,EACtF,SAAoB;IAEpB,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,aAAa,CAAC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC;IACjE,CAAC;IACD,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACvE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwC,CAAC;IACpE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAC9C,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,KAAK;gBAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC;YAC5E,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,EACF,SAAS,CACV,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,aAAa,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;AAC9C,CAAC;AAED;;;oEAGoE;AACpE,SAAS,mBAAmB,CAAC,KAAiB;IAC5C,MAAM,QAAQ,GAAG,kBAAkB;SAChC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IACrF,IAAI,CAAC,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC3E,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,eAAe,CAAC;AACzC,CAAC;AAED;;oBAEoB;AACpB,MAAM,0BAA0B,GAAG,GAAG,CAAC"}
+{"version":3,"file":"registry-graph.js","sourceRoot":"","sources":["../src/registry-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EACL,iBAAiB,EACjB,sBAAsB,EACtB,oBAAoB,EACpB,YAAY,EACZ,cAAc,EACd,cAAc,EACd,aAAa,EACb,mBAAmB,EACnB,aAAa,EACb,mBAAmB,EACnB,UAAU,EACV,2BAA2B,EAC3B,eAAe,GAQhB,MAAM,cAAc,CAAC;AAMtB;uEACuE;AACvE,MAAM,aAAa,GAAG,CAAC,CAAC;AAmBxB,SAAS,OAAO,CAAC,GAAY;IAC3B,OAAO,MAAM,CAAE,GAAiC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;AAChE,CAAC;AAED,MAAM,OAAO,aAAa;IACxB;kCAC8B;IACrB,IAAI,CAAwB;IAEpB,KAAK,CAAyB;IAE9B,QAAQ,CAAkB;IAE1B,SAAS,CAAY;IAEtC,YACE,IAA2B,EAC3B,KAA6B,EAC7B,QAAyB,EACzB,SAAoB;QAEpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED;6EACyE;IACzE,MAAM,CAAC,WAAW,CAChB,OAAqC,EACrC,SAAoB;QAEpB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC3C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;YACrD,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE;gBAChB,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,KAAK;gBACd,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI;gBAClE,OAAO,EAAE,IAAI;aACd,CAAC,CAAC;QACL,CAAC;QACD,MAAM,MAAM,GAAoB,GAAG,EAAE;YACnC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC,CAAC;QACF,OAAO,IAAI,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAC3D,CAAC;IAED;uDACmD;IACnD,MAAM,CAAC,QAAQ,CACb,IAAoB,EACpB,QAAyB,EACzB,SAAoB;QAEpB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE;gBACrB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,IAAI;gBAChB,OAAO,EAAE,IAAI;aACd,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAChC,CAAC;IAED;0DACsD;IACtD,aAAa,CAAC,MAAc;QAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,OAAO,IAAI,IAAI,CAAC;IAC/D,CAAC;IAED;;;;wCAIoC;IACpC,KAAK,CAAC,UAAU,CAAC,MAAc;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC,OAAO,CAAC;QACxC,KAAK,CAAC,OAAO,KAAK,CAAC,KAAK,IAAI,EAAE;YAC5B,MAAM,SAAS,GAAc,EAAE,CAAC;YAChC,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;gBACzC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YAC1B,CAAC,CAAC,CAAC;YACH,MAAM,OAAO,GAAG,mBAAmB,CACjC,MAAM,CAAC,WAAW,EAAE,EACpB,SAAS,EACT,KAAK,CAAC,KAAK,EACX,IAAI,CAAC,SAAS,CACf,CAAC;YACF,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;YACxB,KAAK,CAAC,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,IAAI,CAAC;YAC1F,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC,EAAE,CAAC;QACL,IAAI,CAAC;YACH,OAAO,MAAM,KAAK,CAAC,OAAO,CAAC;QAC7B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;YACrB,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;0DAEsD;IACtD,KAAK,CAAC,UAAU,CAAC,MAAc;QAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,UAAU,EAAE,CAAC,CAAC;QACrE,IAAI,KAAK,CAAC,UAAU;YAAE,OAAO,KAAK,CAAC,UAAU,CAAC;QAC9C,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,oBAAoB,UAAU,+BAA+B,CAAC,CAAC;QACjF,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,UAAU,+BAA+B,CAAC,CAAC;QAC3F,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;qDAEiD;IACjD,KAAK,CAAC,WAAW;QACf,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACtF,CAAC;IAED;;gEAE4D;IAC5D,KAAK,CAAC,MAAM,CAAC,IAAY;QACvB,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,OAAO,UAAU,CAAC;QAClD,MAAM,IAAI,GAA0B,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC;oBAAE,OAAO,MAAM,CAAC;YAChF,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;YACnC,IAAI,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,UAAU,CAAC;gBAAE,OAAO,MAAM,CAAC;QACrE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;uEAGmE;IACnE,KAAK,CAAC,UAAU,CAAC,KAA0B;QACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,MAAM,IAAI,GAA0B,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACjD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;oBACnC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;wBAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC7D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;gBAAE,MAAM;YACrC,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE;gBACzC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;oBAC1B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC/C,CAAC;gBACD,OAAO,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC;YACnC,CAAC,CAAC,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iEAAiE;IACjE,QAAQ;QACN,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC;IAED;6EACyE;IACzE,qBAAqB;QACnB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC1E,CAAC;QACD,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC;QAChF,OAAO;YACL,aAAa,EAAE,2BAA2B;YAC1C,IAAI,EAAE,wBAAwB;YAC9B,OAAO,EAAE,mBAAmB,CAAC,OAAO,CAAC,CAAC,OAAO;SAC9C,CAAC;IACJ,CAAC;IAED;;;sDAGkD;IAClD,OAAO,CACL,OAA0D;QAE1D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,CAC9D,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,OAAO,CAAU,CAAC,CAAC,CAAC;QAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACvB,mEAAmE;YACnE,sEAAsE;YACtE,8BAA8B;YAC9B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC1B,MAAM,IAAI,KAAK,CAAC,kDAAkD,MAAM,aAAa,CAAC,CAAC;gBACzF,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC/C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YACnC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE;gBACpB,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU,EAAE,KAAK,CAAC,UAAU;gBAC5B,OAAO,EAAE,IAAI;aACd,CAAC,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YACnC,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAChE,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxD,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE;gBACpB,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;gBACxC,OAAO,EAAE,KAAK;gBACd,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI;gBAClE,OAAO,EAAE,IAAI;aACd,CAAC,CAAC;QACL,CAAC;QACD,MAAM,IAAI,GAAG,sBAAsB,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,CACzE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO;YACL,KAAK,EAAE,IAAI,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC;YACxE,SAAS,EAAE,oBAAoB,CAAC,IAAI,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,KAAK;YACL,QAAQ,EAAE,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;SAClD,CAAC;IACJ,CAAC;IAED;;2EAEuE;IAC/D,KAAK,CAAC,SAAS,CACrB,IAA6B,EAC7B,KAAsE;QAEtE,MAAM,OAAO,GAA0B,EAAE,CAAC;QAC1C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC;YACH,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;gBACpD,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,aAAa,EAAE,CAAC;oBAC7D,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;oBAC1C,KAAK,IAAI,CAAC,CAAC;gBACb,CAAC;gBACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,EAAE,MAAM,OAAO,CAAC,KAAK,EAAG,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzE,IAAI,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,IAAI;oBAAE,OAAO;YACxC,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,8DAA8D;YAC9D,MAAM,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED;;sDAEkD;IAC1C,KAAK,CAAC,WAAW,CACvB,IAA6B,EAC7B,IAAY;QAEZ,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,EAAE,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAC3E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACnC,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5B,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1C,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;gBACjB,SAAS;YACX,CAAC;YACD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1B,OAAO,KAAK,IAAI,GAAG,EAAE,CAAC;gBACpB,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;gBACjC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACnC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,OAAO,mBAAmB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;gBAC/D,CAAC;gBACD,IAAI,IAAI,GAAG,KAAK;oBAAE,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;;oBAC7B,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YACzB,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;8EAC8E;AAC9E,MAAM,UAAU,mBAAmB,CAAC,IAA2B;IAC7D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7D,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;uBAEuB;AACvB,MAAM,UAAU,yBAAyB,CACvC,KAAiB,EACjB,QAAyB,EACzB,SAAoB;IAEpB,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,aAAa,CAAC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,aAAa,CAAC,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;AAC5E,CAAC;AAED;;;oEAGoE;AACpE,SAAS,mBAAmB,CAAC,KAAiB;IAC5C,MAAM,QAAQ,GAAG,kBAAkB;SAChC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IACrF,IAAI,CAAC,QAAQ;QAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC3E,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,eAAe,CAAC;AACzC,CAAC;AAED;;oBAEoB;AACpB,MAAM,0BAA0B,GAAG,GAAG,CAAC"}

package/dist/registry-page-cache.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Verified local cache for immutable registry graph pages.
+ *
+ * Cache bytes are disposable evidence. A page is readable or writable only
+ * when its size and content hash match the identity committed in the graph
+ * head; corrupt evidence is ignored and can never poison later retries.
+ */
+import { type GraphPageRef, type Sha256Hex } from "@amalgm/live";
+/** Return only byte-exact cached evidence. Missing, torn, or corrupt bytes
+ * are all a cache miss and therefore recover through the immutable source. */
+export declare function readVerifiedRegistryPage(file: string, ref: GraphPageRef, sha256Hex: Sha256Hex): Buffer | null;
+/** Verify before the atomic write. A corrupt authority response must never
+ * replace good cache evidence or become a permanent same-size cache poison. */
+export declare function writeVerifiedRegistryPage(file: string, ref: GraphPageRef, bytes: Uint8Array, sha256Hex: Sha256Hex): void;

package/dist/registry-page-cache.js

@@ -0,0 +1,32 @@
+/**
+ * Verified local cache for immutable registry graph pages.
+ *
+ * Cache bytes are disposable evidence. A page is readable or writable only
+ * when its size and content hash match the identity committed in the graph
+ * head; corrupt evidence is ignored and can never poison later retries.
+ */
+import { readFileSync } from "node:fs";
+import { atomicWrite } from "./filesystem.js";
+function pageMatches(ref, bytes, sha256Hex) {
+    return bytes.byteLength === ref.bytes && sha256Hex(bytes) === ref.sha256;
+}
+/** Return only byte-exact cached evidence. Missing, torn, or corrupt bytes
+ * are all a cache miss and therefore recover through the immutable source. */
+export function readVerifiedRegistryPage(file, ref, sha256Hex) {
+    try {
+        const bytes = readFileSync(file);
+        return pageMatches(ref, bytes, sha256Hex) ? bytes : null;
+    }
+    catch {
+        return null;
+    }
+}
+/** Verify before the atomic write. A corrupt authority response must never
+ * replace good cache evidence or become a permanent same-size cache poison. */
+export function writeVerifiedRegistryPage(file, ref, bytes, sha256Hex) {
+    if (!pageMatches(ref, bytes, sha256Hex)) {
+        throw new Error(`cloud graph page ${ref.sha256} does not match its bytes`);
+    }
+    atomicWrite(file, bytes);
+}
+//# sourceMappingURL=registry-page-cache.js.map

package/dist/registry-page-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry-page-cache.js","sourceRoot":"","sources":["../src/registry-page-cache.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAIvC,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE9C,SAAS,WAAW,CAClB,GAAiB,EACjB,KAAiB,EACjB,SAAoB;IAEpB,OAAO,KAAK,CAAC,UAAU,KAAK,GAAG,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC;AAC3E,CAAC;AAED;8EAC8E;AAC9E,MAAM,UAAU,wBAAwB,CACtC,IAAY,EACZ,GAAiB,EACjB,SAAoB;IAEpB,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACjC,OAAO,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;+EAC+E;AAC/E,MAAM,UAAU,yBAAyB,CACvC,IAAY,EACZ,GAAiB,EACjB,KAAiB,EACjB,SAAoB;IAEpB,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,CAAC,MAAM,2BAA2B,CAAC,CAAC;IAC7E,CAAC;IACD,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC3B,CAAC"}

package/dist/user-ground-host.d.ts

@@ -116,6 +116,9 @@ export declare class UserGroundHost {
     private watchDirty;
     private cloudState;
     private converged;
+    /** Cumulative graph-page reads, reported as diffs on the stages that
+     * materialize roots so the ledger shows what each operation actually read. */
+    private readonly graphPageReads;
     private syncing;
     private recordRail;
     private recordStore;
@@ -182,14 +185,32 @@ export declare class UserGroundHost {
     private userRoot;
     private cacheDir;
     private cloudPort;
-    /** The authority's stored snapshot as this machine's graph. A head names
-     * immutable pages, so every page this machine already cached is a local read
-     * and an unchanged root never crosses the network twice. */
+    /** The authority's stored snapshot as this machine's graph. A head is held
+     * lazily — no page is read until an operation asks for a root — and every
+     * page this machine already cached is a local read, so an unchanged root
+     * never crosses the network twice. */
     private materializeRegistry;
-    /** Read graph pages by identity: cached pages come off local disk, the rest
-     * are fetched straight from content storage and cached on the way in. Every
-     * page is re-proven against its declared identity before it is kept. */
-    private readGraphPages;
+    /** The records a lookup hands to Live: every root's own record — the
+     * discovery set that proves root uniqueness — plus the full records of
+     * exactly the roots the operation acts on. A records-shaped snapshot is a
+     * first publication's own small graph and travels whole, keeping its
+     * records-shape checksum law intact. */
+    private selectScope;
+    /** The account's core root: the one active top-level workspace named by the
+     * account email. Registered-boundary references live only there. */
+    private coreRootId;
+    /** Fold the committed delivery tail over a root-scoped base without losing
+     * a subtree the tail moved across roots. A container the folded boundary
+     * contains only through delivered results may still file unchanged
+     * descendants under the root that used to hold it, so that root's records
+     * join the base and the fold reruns until no probe widens it. Leaf results
+     * travel whole and never probe. */
+    private foldScopedPrefix;
+    /** Read one graph page by identity: cached pages come off local disk, the
+     * rest are fetched straight from content storage and cached on the way in.
+     * The graph proves every page against its declared identity as it parses,
+     * so this reader only guards the cache against torn copies. */
+    private readGraphPage;
     private localPort;
     /** Send's small-cargo fast path: the record's sealed artifact rides the
      * submit frame itself, so one round trip carries record, manifest, and