@mikeargento/bitgraph-mcp 0.2.0 → 0.4.0

package/dist/scan.js

@@ -0,0 +1,158 @@
+// Copyright (c) 2024-2026 Mike Argento. Licensed under the MIT License. See LICENSE.
+/**
+ * @mikeargento/bitgraph-mcp: the scan.
+ *
+ * One pass over each file yields its SHA-256 (the member's origin) and a
+ * hasher left open after the placement's prefix and the file's last byte, so
+ * the member's fused digest can be finished later, for whatever slot the set
+ * is made under, without reading the file again. A placement is prefix,
+ * original, suffix (its frame): trailer/1 has no prefix and container/2's is
+ * the original's tar header, which depends on the size alone; the suffix
+ * carries the commitment and is hashed at BitGraph time. Node's SHA-256 is
+ * the platform's own, and a Hash can be copied mid-stream, which is the whole
+ * trick: the copy takes the suffix, so no file is read twice or held in
+ * memory, and the original is never touched.
+ */
+import { createHash } from "node:crypto";
+import { createReadStream } from "node:fs";
+import { readdir, stat } from "node:fs/promises";
+import { basename, join } from "node:path";
+import { placementForBytes } from "@mikeargento/bitgraph";
+import { getPlacement } from "@mikeargento/bitgraph-verify";
+/** Bytes the placement decision reads: every magic number sits in the first 16. */
+const SNIFF = 64;
+/** Hash one file in a single pass. Throws, before any network call, when the path is not a regular file. */
+export async function scanFile(path) {
+    const info = await stat(path);
+    if (!info.isFile())
+        throw new Error(`Not a regular file: ${path}`);
+    const size = info.size;
+    const origin = createHash("sha256");
+    // Held in one object: the closures below assign to it.
+    const run = { fused: null, placement: null };
+    let head = null;
+    let bytes = 0;
+    const start = (p) => {
+        run.placement = p;
+        // A second hasher runs over prefix and bytes when the prefix is not
+        // empty; with an empty prefix the origin hasher's own state is the fused state.
+        const prefix = getPlacement(p)?.scanPrefix?.(size) ?? null;
+        if (prefix !== null && prefix.length > 0)
+            run.fused = createHash("sha256").update(prefix);
+    };
+    const feed = (chunk) => {
+        origin.update(chunk);
+        if (run.fused !== null)
+            run.fused.update(chunk);
+    };
+    for await (const raw of createReadStream(path)) {
+        const chunk = raw;
+        if (run.placement === null) {
+            head = head === null ? chunk : Buffer.concat([head, chunk]);
+            if (head.length >= SNIFF) {
+                start(placementForBytes(new Uint8Array(head.subarray(0, SNIFF))));
+                feed(head);
+                head = null;
+            }
+        }
+        else {
+            feed(chunk);
+        }
+        bytes += chunk.length;
+    }
+    if (run.placement === null) {
+        // A short file: decide from what there is, then hash it.
+        start(placementForBytes(new Uint8Array(head ?? Buffer.alloc(0))));
+        if (head !== null)
+            feed(head);
+    }
+    const placement = run.placement;
+    const state = bytes !== size ? null : (run.fused ?? origin);
+    // When the origin hasher is the state its digest is taken from a copy, so it stays open.
+    const digest = state === origin ? origin.copy().digest() : origin.digest();
+    return {
+        path,
+        name: basename(path),
+        size,
+        digestB64: digest.toString("base64"),
+        originDigest: Uint8Array.from(digest),
+        placement,
+        state,
+    };
+}
+/**
+ * A member's fused digest for a slot: the open hasher, copied, finished with
+ * the placement's suffix for that slot's commitment. The hash of prefix,
+ * original, suffix is exactly the hash of the placement's own build, which
+ * a test pins.
+ */
+export function fusedDigestFor(file, commitment) {
+    if (file.state === null)
+        throw new Error(`${file.path}: the file changed while it was read`);
+    const placement = getPlacement(file.placement);
+    if (placement?.frame === undefined)
+        throw new Error(`placement ${file.placement} has no frame`);
+    const { suffix } = placement.frame({ originalSize: file.size, originDigest: file.originDigest, commitment });
+    return Uint8Array.from(file.state.copy().update(suffix).digest());
+}
+/**
+ * Paths to files: a regular file is itself; a directory is every regular
+ * file under it, recursively, with hidden entries (names starting with a
+ * dot) and symbolic links left out. The same file twice is one file. A path
+ * that is missing or neither kind, or more than `limit` files in all, throws
+ * before any network call; the message names every path that failed.
+ */
+export async function expandPaths(paths, limit) {
+    const files = [];
+    const seen = new Set();
+    const failures = [];
+    let directories = 0;
+    const push = (p) => {
+        if (seen.has(p))
+            return;
+        seen.add(p);
+        files.push(p);
+        if (files.length > limit)
+            throw new Error(`more than ${limit} files; BitGraph fewer at a time`);
+    };
+    const walk = async (dir) => {
+        const entries = (await readdir(dir, { withFileTypes: true }))
+            .filter((e) => !e.name.startsWith("."))
+            .sort((a, b) => (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));
+        for (const e of entries) {
+            const full = join(dir, e.name);
+            if (e.isSymbolicLink())
+                continue;
+            if (e.isDirectory())
+                await walk(full);
+            else if (e.isFile())
+                push(full);
+        }
+    };
+    for (const p of paths) {
+        try {
+            const info = await stat(p);
+            if (info.isDirectory()) {
+                directories += 1;
+                await walk(p);
+            }
+            else if (info.isFile()) {
+                push(p);
+            }
+            else {
+                throw new Error("not a regular file or a directory");
+            }
+        }
+        catch (err) {
+            const message = err instanceof Error ? err.message : String(err);
+            if (message.startsWith("more than "))
+                throw err;
+            failures.push(`${p}: ${message}`);
+        }
+    }
+    if (failures.length > 0) {
+        throw new Error(`Could not read ${failures.length} path(s); nothing was BitGraphed.\n${failures.join("\n")}\nUse absolute paths to existing regular files or directories.`);
+    }
+    return { files, directories };
+}
+//# sourceMappingURL=scan.js.map

package/dist/scan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scan.js","sourceRoot":"","sources":["../src/scan.ts"],"names":[],"mappings":"AAAA,qFAAqF;AAErF;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,UAAU,EAAa,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAqB5D,mFAAmF;AACnF,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB,4GAA4G;AAC5G,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,IAAY;IACzC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,EAAE,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IACpC,uDAAuD;IACvD,MAAM,GAAG,GAA4D,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IACtG,IAAI,IAAI,GAAkB,IAAI,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,CAAC,CAAgB,EAAE,EAAE;QACjC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC;QAClB,oEAAoE;QACpE,gFAAgF;QAChF,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAC3D,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5F,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,EAAE;QAC7B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI;YAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC;IACF,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,GAAa,CAAC;QAC5B,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC3B,IAAI,GAAG,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5D,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;gBACzB,KAAK,CAAC,iBAAiB,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClE,IAAI,CAAC,IAAI,CAAC,CAAC;gBACX,IAAI,GAAG,IAAI,CAAC;YACd,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,CAAC;QACd,CAAC;QACD,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;IACxB,CAAC;IACD,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;QAC3B,yDAAyD;QACzD,KAAK,CAAC,iBAAiB,CAAC,IAAI,UAAU,CAAC,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAI,IAAI,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,CAAC,SAA0B,CAAC;IACjD,MAAM,KAAK,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC;IAC5D,yFAAyF;IACzF,MAAM,MAAM,GAAG,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;IAC3E,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;QACpB,IAAI;QACJ,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACpC,YAAY,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC;QACrC,SAAS;QACT,KAAK;KACN,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,IAAiB,EAAE,UAAsB;IACtE,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,sCAAsC,CAAC,CAAC;IAC7F,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,IAAI,SAAS,EAAE,KAAK,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,SAAS,eAAe,CAAC,CAAC;IAChG,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC;IAC7G,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;AACpE,CAAC;AASD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,KAAwB,EAAE,KAAa;IACvE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE;QACzB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,aAAa,KAAK,kCAAkC,CAAC,CAAC;IAClG,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,EAAE,GAAW,EAAiB,EAAE;QAChD,MAAM,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;aAC1D,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;aACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,CAAC,cAAc,EAAE;gBAAE,SAAS;YACjC,IAAI,CAAC,CAAC,WAAW,EAAE;gBAAE,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;iBACjC,IAAI,CAAC,CAAC,MAAM,EAAE;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,WAAW,IAAI,CAAC,CAAC;gBACjB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,CAAC;gBAAE,MAAM,GAAG,CAAC;YAChD,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,kBAAkB,QAAQ,CAAC,MAAM,sCAAsC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;IAC9K,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;AAChC,CAAC"}

package/dist/server.d.ts

@@ -1,28 +1,59 @@
 /**
  * @mikeargento/bitgraph-mcp: tool definitions.
  *
- * Three gestures, the same three the website has: take a BitGraph of a file,
- * check whether bytes are on record, fetch a proof. Taking a BitGraph builds a
- * fused artifact from the file in memory, on this machine, and commits its
- * digest under a slot allocated for it; only SHA-256 digests and slot records
- * ever leave the machine. File contents are never uploaded.
+ * Three gestures, the same three the website has: make a BitGraph, check
+ * whether bytes are on record, fetch a proof. Making a BitGraph is one
+ * gesture for any number of files: everything in a call becomes a member of
+ * ONE set under ONE slot, the way a drop on the site does. Each file is read
+ * once, on this machine, for its digest and a hasher state; the new fused
+ * bytes are never written and never held, their digest is finished from that
+ * state once the slot exists; and the set's committed artifact is hashed
+ * and committed under the same slot. Only digests, that artifact and slot
+ * records leave the machine. File contents are never uploaded and files are
+ * never modified.
  */
 import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { type FuseSetProgress } from "@mikeargento/bitgraph";
 import { type ApiConfig } from "./api.js";
+import { type ScannedFile } from "./scan.js";
 import type { BitGraphProof } from "./types.js";
-export declare const SERVER_VERSION = "0.2.0";
-/** What taking a BitGraph of one file yields. */
-export interface FusedSummary {
+export declare const SERVER_VERSION = "0.4.0";
+/** Files one call may BitGraph after directories expand: one set. The site's own ceiling for a set/2. */
+export declare const MAX_MEMBERS = 100000;
+/** Rows the structured result lists in full; every fused row shares the set's position. */
+export declare const ROW_CAP = 500;
+/** Members' evidence per set-index request: the site's own chunk. */
+export declare const SET_INDEX_CHUNK = 2500;
+/** What one set yields, in the shape the tool reports; tests inject a stand-in. */
+export interface SetSummary {
+    set: "set/1" | "set/2";
     proof: BitGraphProof;
-    frame: unknown;
-    placement: string;
+    /** Standard base64: the committed artifact's digest. */
     artifactDigestB64: string;
-    originDigestB64: string;
+    count: number;
+    manifestEchoed: boolean;
+    recovered: boolean;
+    /** In the order the files were given. */
+    members: Array<{
+        index: number;
+        /** The row's ordinal in the committed artifact. */
+        manifestIndex: number;
+        placement: string;
+        originDigestB64: string;
+        artifactDigestB64: string;
+        /** set/2 only: the member's evidence, for the site's index. */
+        memberProof?: unknown;
+    }>;
 }
-export type FuseFileFn = (bytes: Uint8Array, name: string, config: ApiConfig) => Promise<FusedSummary>;
+export type FuseSetFn = (files: readonly ScannedFile[], config: ApiConfig, opts: {
+    set: "set/1" | "set/2";
+    onProgress?: (p: FuseSetProgress) => void;
+}) => Promise<SetSummary>;
 export interface ServerDeps {
-    /** The fuse pipeline; tests inject a stand-in. Default: the core package's fuse() against the configured site. */
-    fuseFile?: FuseFileFn;
+    /** The set pipeline; tests inject a stand-in. Default: the core package's fuseSet() against the configured site. */
+    fuseSet?: FuseSetFn;
 }
+/** How many members' evidence is waiting to be indexed (tests read it). */
+export declare function pendingIndexCount(): number;
 export declare function buildServer(deps?: ServerDeps): McpServer;
 //# sourceMappingURL=server.d.ts.map

package/dist/server.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAIpE,OAAO,EAML,KAAK,SAAS,EACf,MAAM,UAAU,CAAC;AAkBlB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,eAAO,MAAM,cAAc,UAAU,CAAC;AAOtC,iDAAiD;AACjD,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,aAAa,CAAC;IACrB,KAAK,EAAE,OAAO,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;CACzB;AACD,MAAM,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC;AACvG,MAAM,WAAW,UAAU;IACzB,kHAAkH;IAClH,QAAQ,CAAC,EAAE,UAAU,CAAC;CACvB;AAkGD,wBAAgB,WAAW,CAAC,IAAI,GAAE,UAAe,GAAG,SAAS,CAsU5D"}
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAKpE,OAAO,EAA2D,KAAK,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACtH,OAAO,EAOL,KAAK,SAAS,EACf,MAAM,UAAU,CAAC;AAmBlB,OAAO,EAAyC,KAAK,WAAW,EAAE,MAAM,WAAW,CAAC;AACpF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,eAAO,MAAM,cAAc,UAAU,CAAC;AAKtC,yGAAyG;AACzG,eAAO,MAAM,WAAW,SAAU,CAAC;AAKnC,2FAA2F;AAC3F,eAAO,MAAM,OAAO,MAAM,CAAC;AAC3B,qEAAqE;AACrE,eAAO,MAAM,eAAe,OAAO,CAAC;AAEpC,mFAAmF;AACnF,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,OAAO,GAAG,OAAO,CAAC;IACvB,KAAK,EAAE,aAAa,CAAC;IACrB,wDAAwD;IACxD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,EAAE,OAAO,CAAC;IACxB,SAAS,EAAE,OAAO,CAAC;IACnB,yCAAyC;IACzC,OAAO,EAAE,KAAK,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,mDAAmD;QACnD,aAAa,EAAE,MAAM,CAAC;QACtB,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;QACxB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,+DAA+D;QAC/D,WAAW,CAAC,EAAE,OAAO,CAAC;KACvB,CAAC,CAAC;CACJ;AACD,MAAM,MAAM,SAAS,GAAG,CACtB,KAAK,EAAE,SAAS,WAAW,EAAE,EAC7B,MAAM,EAAE,SAAS,EACjB,IAAI,EAAE;IAAE,GAAG,EAAE,OAAO,GAAG,OAAO,CAAC;IAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,eAAe,KAAK,IAAI,CAAA;CAAE,KACxE,OAAO,CAAC,UAAU,CAAC,CAAC;AACzB,MAAM,WAAW,UAAU;IACzB,oHAAoH;IACpH,OAAO,CAAC,EAAE,SAAS,CAAC;CACrB;AAkJD,2EAA2E;AAC3E,wBAAgB,iBAAiB,IAAI,MAAM,CAE1C;AAmCD,wBAAgB,WAAW,CAAC,IAAI,GAAE,UAAe,GAAG,SAAS,CAya5D"}