@mikeargento/bitgraph 1.10.1 → 1.11.0

package/dist/recovery-write.d.ts

@@ -0,0 +1,58 @@
+import { type FetchLike, type RecoveryTreeInput } from "./recovery.js";
+export interface RecoveryWriteInput extends RecoveryTreeInput {
+    /** A file name per leaf, tree order. Advisory, sealed with each entry. */
+    names?: ReadonlyArray<string | null | undefined>;
+}
+/**
+ * What a writer keeps between runs: one progress byte per member
+ * (RECOVERY_SIDE_BITS) and the salts chosen for entries whose deterministic
+ * key was held, base64 by recoverySaltKey. The same shape the browser's
+ * queue saves for its jobs.
+ */
+export interface RecoveryWriteState {
+    progress: Uint8Array;
+    salts: Record<string, string>;
+}
+export interface RecoveryWriteOptions {
+    /** Default https://bitgraph.ing. */
+    baseUrl?: string;
+    fetch?: FetchLike;
+    /** Rounds of retry for conflicts, errors and transient failures. Default 3. */
+    retries?: number;
+    /** Milliseconds before the first retry; doubles each round. Default 500. */
+    backoffMs?: number;
+    /** Milliseconds one request may take. Default 60,000. */
+    timeoutMs?: number;
+    /** Milliseconds the whole call may take; what is not written by then is reported pending. Default: no budget. */
+    budgetMs?: number;
+    /** An earlier run's state to resume from. */
+    state?: RecoveryWriteState;
+    /** Hears the state whenever it is worth keeping: a salt before its write, progress after every batch. */
+    onState?: (state: RecoveryWriteState) => void | Promise<void>;
+    /** False: a held deterministic key leaves the side blocked instead of trying its salted name. Default true. */
+    saltedFallback?: boolean;
+}
+export interface RecoveryWriteResult {
+    /** Entries this tree needs: two per placed member, one per as-is member. */
+    entries: number;
+    /** Kept when this call ended: created now, or already stored as this member, in this run or one before it. */
+    kept: number;
+    /** Created in this call. */
+    written: number;
+    /** Already stored, and opened to hold this same member, in this call. */
+    alreadyThere: number;
+    /** Of `kept`, those under a salted name: their deterministic key was held by another member's entry. */
+    salted: number;
+    /** Both names held by other entries (see SPEC section 13, squatting). */
+    blocked: number;
+    /** Not written: the site refused writes, the attempts or the budget ran out. */
+    pending: number;
+    /** Why entries are pending, in words, when any are. */
+    reason: string | null;
+    /** The state to resume from when `pending` is not zero. */
+    state: RecoveryWriteState;
+    /** Every entry is kept or blocked: nothing left to write. */
+    done: boolean;
+}
+export declare function writeRecoveryEntries(input: RecoveryWriteInput, opts?: RecoveryWriteOptions): Promise<RecoveryWriteResult>;
+//# sourceMappingURL=recovery-write.d.ts.map

package/dist/recovery-write.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recovery-write.d.ts","sourceRoot":"","sources":["../src/recovery-write.ts"],"names":[],"mappings":"AAkCA,OAAO,EAaL,KAAK,SAAS,EACd,KAAK,iBAAiB,EAEvB,MAAM,eAAe,CAAC;AAEvB,MAAM,WAAW,kBAAmB,SAAQ,iBAAiB;IAC3D,0EAA0E;IAC1E,KAAK,CAAC,EAAE,aAAa,CAAC,MAAM,GAAG,IAAI,GAAG,SAAS,CAAC,CAAC;CAClD;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,EAAE,UAAU,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/B;AAED,MAAM,WAAW,oBAAoB;IACnC,oCAAoC;IACpC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,SAAS,CAAC;IAClB,+EAA+E;IAC/E,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,4EAA4E;IAC5E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,yDAAyD;IACzD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iHAAiH;IACjH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,6CAA6C;IAC7C,KAAK,CAAC,EAAE,kBAAkB,CAAC;IAC3B,yGAAyG;IACzG,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,kBAAkB,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9D,+GAA+G;IAC/G,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED,MAAM,WAAW,mBAAmB;IAClC,4EAA4E;IAC5E,OAAO,EAAE,MAAM,CAAC;IAChB,8GAA8G;IAC9G,IAAI,EAAE,MAAM,CAAC;IACb,4BAA4B;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,yEAAyE;IACzE,YAAY,EAAE,MAAM,CAAC;IACrB,wGAAwG;IACxG,MAAM,EAAE,MAAM,CAAC;IACf,yEAAyE;IACzE,OAAO,EAAE,MAAM,CAAC;IAChB,gFAAgF;IAChF,OAAO,EAAE,MAAM,CAAC;IAChB,uDAAuD;IACvD,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,2DAA2D;IAC3D,KAAK,EAAE,kBAAkB,CAAC;IAC1B,6DAA6D;IAC7D,IAAI,EAAE,OAAO,CAAC;CACf;AAsBD,wBAAsB,oBAAoB,CAAC,KAAK,EAAE,kBAAkB,EAAE,IAAI,GAAE,oBAAyB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CA0MnI"}

package/dist/recovery-write.js

@@ -0,0 +1,265 @@
+// Copyright (c) 2024-2026 Argento Computing Inc. Licensed under the MIT License. See LICENSE.
+/**
+ * Writing a tree's recovery entries from outside the browser (2026-10-03).
+ *
+ * The drop box keeps its trees recoverable through a persistent queue
+ * (website/src/lib/recovery-queue.ts). The CLI, SDK and MCP make trees too,
+ * and a file they made should be found again the same way when someone drops
+ * it on bitgraph.ing. This posts the same sealed entries (recovery.ts, the
+ * Node twin of the site's module) to POST /api/recovery, after the proof is
+ * already in hand: it never stands between anyone and a proof.
+ *
+ * Every write is create-only. "created" counts as kept; "exists" counts
+ * only after the stored envelope is opened and holds this same member.
+ * A key that holds ANOTHER member's entry (SPEC section 13, squatting) is
+ * not the end of it: the same entry is written again under its salted name,
+ * with a fresh 32-byte salt sealed inside, and only a salted name that is
+ * held too leaves the side blocked. "conflict" and "error" are retried. A
+ * site that does not take recovery writes yet (503, or no route at all)
+ * leaves the entries pending, and the caller says so: the tree is exactly as
+ * made, it is just not recoverable from the file until its entries are
+ * written.
+ *
+ * STATE, FOR A WRITER THAT RESUMES. Progress is one byte per member
+ * (recovery.ts, RECOVERY_SIDE_BITS) plus the salts chosen so far, the same
+ * shape the browser's queue saves. A caller passes the state of an earlier
+ * run to pick up where it stopped, and `onState` hears every change worth
+ * keeping: a salt the moment it is chosen (BEFORE its write, so a retry lands
+ * on the same name) and progress after every batch. Entries are sealed a
+ * batch at a time, never all at once: a 100,000-file tree is 200,000
+ * envelopes, and they need not all be in memory together.
+ */
+import { base64ToBytes, bytesToBase64 } from "@mikeargento/bitgraph-verify";
+import { MAX_BATCH_ENTRIES, RECOVERY_SIDE_BITS, existingEntryHoldsMember, findOwnRecoveryEntry, newRecoverySalt, recoverySaltKey, recoverySaltsFor, recoverySideResolved, recoverySideState, recoverySidesOf, recoveryTreeFrom, sealRecoveryMember, } from "./recovery.js";
+const sleep = (ms) => new Promise((r) => setTimeout(r, ms));
+function hostOf(base) {
+    try {
+        return new URL(base).host;
+    }
+    catch {
+        return base;
+    }
+}
+/** Base64 salts by recoverySaltKey, with the progress, as a fresh copy for a caller to keep. */
+const snapshot = (progress, salts) => ({ progress: progress.slice(), salts: { ...salts } });
+export async function writeRecoveryEntries(input, opts = {}) {
+    const tree = recoveryTreeFrom(input);
+    const f = opts.fetch ?? ((url, init) => fetch(url, init));
+    const base = opts.baseUrl ?? "https://bitgraph.ing";
+    const retries = opts.retries ?? 3;
+    const timeoutMs = opts.timeoutMs ?? 60_000;
+    const deadline = opts.budgetMs !== undefined ? Date.now() + opts.budgetMs : Infinity;
+    let waitMs = opts.backoffMs ?? 500;
+    const names = input.names;
+    const progress = new Uint8Array(tree.count);
+    if (opts.state?.progress !== undefined)
+        progress.set(opts.state.progress.subarray(0, tree.count));
+    const salts = { ...(opts.state?.salts ?? {}) };
+    let written = 0;
+    let alreadyThere = 0;
+    let reason = null;
+    // The site takes no writes, or the budget ran out: no more requests this call.
+    let stopped = false;
+    const keep = async () => {
+        if (opts.onState !== undefined)
+            await opts.onState(snapshot(progress, salts));
+    };
+    /** The pending sides of the members from `cursor.at` on, sealed, up to MAX_BATCH_ENTRIES entries. */
+    async function nextBatch(cursor) {
+        const out = [];
+        while (cursor.at < tree.count) {
+            const i = cursor.at;
+            const sides = recoverySidesOf(tree, i).filter((s) => !recoverySideResolved(progress[i], s));
+            if (sides.length > 0) {
+                if (out.length + sides.length > MAX_BATCH_ENTRIES)
+                    break;
+                const { writes } = await sealRecoveryMember(tree, i, names?.[i] ?? null, sides, recoverySaltsFor(salts, i));
+                for (const w of writes)
+                    out.push({ index: i, w });
+            }
+            cursor.at++;
+        }
+        return out;
+    }
+    /** What one operation may still take: its own limit, or what is left of the budget, whichever is less. Zero or less: the budget is spent. */
+    const remaining = () => Math.min(timeoutMs, deadline - Date.now());
+    /** POST one batch. The answers by key, or null when the request failed as a whole (the reason says how). */
+    async function post(batch) {
+        const allowed = remaining();
+        if (allowed <= 0) {
+            reason = "the time budget ran out";
+            stopped = true;
+            return null;
+        }
+        let res;
+        try {
+            res = await f(`${base}/api/recovery`, {
+                method: "POST",
+                headers: { "content-type": "application/json" },
+                body: JSON.stringify({ entries: batch.map((p) => ({ key: p.w.objectKey, envelope: bytesToBase64(p.w.envelope) })) }),
+                signal: AbortSignal.timeout(allowed),
+            });
+        }
+        catch (e) {
+            reason = `the site could not be reached (${e.message})`;
+            return null;
+        }
+        if (res.status === 503 || res.status === 404 || res.status === 405 || res.status === 501) {
+            // Writes off on the site (503), or a site without the route at all:
+            // nothing will land this run. Stop asking.
+            stopped = true;
+            reason = `${hostOf(base)} is not taking recovery writes yet; the tree is made, but these files cannot be found from the file alone until their entries are written`;
+            return null;
+        }
+        if (!res.ok) {
+            reason = `POST /api/recovery answered ${res.status}`;
+            return null;
+        }
+        let body;
+        try {
+            body = await res.json();
+        }
+        catch {
+            reason = "the site's answer was not JSON";
+            return null;
+        }
+        const answers = new Map();
+        const list = body.results;
+        if (Array.isArray(list)) {
+            for (const r of list) {
+                if (typeof r.key === "string" && typeof r.status === "string")
+                    answers.set(r.key, { status: r.status, ...(typeof r.envelope === "string" ? { envelope: r.envelope } : {}) });
+            }
+        }
+        return answers;
+    }
+    /**
+     * Apply one request's answers. A deterministic key held by another member
+     * gets a salt, kept first, and its salted write goes out at once; a salted
+     * name that is held too is blocked, so this recurses at most once.
+     */
+    async function apply(batch, answers) {
+        const fallbacks = [];
+        for (const p of batch) {
+            const a = answers.get(p.w.objectKey);
+            const bits = RECOVERY_SIDE_BITS[p.w.side];
+            if (a?.status === "created") {
+                progress[p.index] |= bits.kept;
+                written++;
+            }
+            else if (a?.status === "exists" && a.envelope !== undefined) {
+                const stored = base64ToBytes(a.envelope);
+                if (stored !== null && (await existingEntryHoldsMember(p.w.digest, p.w.objectKey, stored, p.w.plaintext))) {
+                    progress[p.index] |= bits.kept;
+                    alreadyThere++;
+                }
+                else if (p.w.salted || opts.saltedFallback === false) {
+                    progress[p.index] |= bits.blocked;
+                }
+                else {
+                    fallbacks.push(p);
+                }
+            }
+            // "conflict", "error", or no answer: pending for the next round.
+        }
+        if (fallbacks.length === 0 || stopped)
+            return;
+        // Another member holds these keys. Before a fresh salt, the address is
+        // read: an entry of this member may already sit there under a salted name
+        // from an earlier run whose salt was not kept. Found, it counts and its
+        // salt is kept now; an address that cannot be read leaves the side
+        // pending (nothing is guessed, no second copy is written).
+        const fresh = [];
+        for (const p of fallbacks) {
+            const allowed = remaining();
+            if (allowed <= 0) {
+                reason = "the time budget ran out";
+                stopped = true;
+                return;
+            }
+            let own;
+            try {
+                own = await findOwnRecoveryEntry(p.w.digest, p.w.plaintext, f, { baseUrl: base, timeoutMs: allowed });
+            }
+            catch (e) {
+                reason = `the address could not be read before a salted write (${e.message})`;
+                continue;
+            }
+            if (own !== null) {
+                progress[p.index] |= RECOVERY_SIDE_BITS[p.w.side].kept;
+                alreadyThere++;
+                if (own.salt !== null)
+                    salts[recoverySaltKey(p.index, p.w.side)] = bytesToBase64(own.salt);
+                continue;
+            }
+            fresh.push(p);
+        }
+        if (fresh.length === 0)
+            return;
+        for (const p of fresh)
+            salts[recoverySaltKey(p.index, p.w.side)] ??= bytesToBase64(newRecoverySalt());
+        await keep();
+        const resealed = [];
+        for (const p of fresh) {
+            const { writes } = await sealRecoveryMember(tree, p.index, names?.[p.index] ?? null, [p.w.side], recoverySaltsFor(salts, p.index));
+            for (const w of writes)
+                resealed.push({ index: p.index, w });
+        }
+        const again = await post(resealed);
+        if (again !== null)
+            await apply(resealed, again);
+    }
+    for (let round = 0; round <= retries && !stopped; round++) {
+        if (round > 0) {
+            if (Date.now() + waitMs > deadline) {
+                reason = "the time budget ran out";
+                break;
+            }
+            await sleep(waitMs);
+            waitMs *= 2;
+        }
+        const cursor = { at: 0 };
+        let sentAny = false;
+        while (!stopped) {
+            if (Date.now() > deadline) {
+                reason = "the time budget ran out";
+                stopped = true;
+                break;
+            }
+            const batch = await nextBatch(cursor);
+            if (batch.length === 0)
+                break;
+            sentAny = true;
+            const answers = await post(batch);
+            if (answers !== null)
+                await apply(batch, answers);
+            await keep();
+        }
+        if (!sentAny)
+            break;
+    }
+    let entries = 0;
+    let kept = 0;
+    let salted = 0;
+    let blocked = 0;
+    let pending = 0;
+    for (let i = 0; i < tree.count; i++) {
+        for (const side of recoverySidesOf(tree, i)) {
+            entries++;
+            const state = recoverySideState(progress[i], side);
+            if (state === "kept") {
+                kept++;
+                if (salts[recoverySaltKey(i, side)] !== undefined)
+                    salted++;
+            }
+            else if (state === "blocked")
+                blocked++;
+            else
+                pending++;
+        }
+    }
+    if (pending > 0 && reason === null)
+        reason = "some entries were not written after every retry";
+    return { entries, kept, written, alreadyThere, salted, blocked, pending, reason: pending > 0 ? reason : null, state: snapshot(progress, salts), done: pending === 0 };
+}
+//# sourceMappingURL=recovery-write.js.map

package/dist/recovery-write.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recovery-write.js","sourceRoot":"","sources":["../src/recovery-write.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAE9F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAC5E,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,wBAAwB,EACxB,oBAAoB,EACpB,eAAe,EACf,eAAe,EACf,gBAAgB,EAChB,oBAAoB,EACpB,iBAAiB,EACjB,eAAe,EACf,gBAAgB,EAChB,kBAAkB,GAInB,MAAM,eAAe,CAAC;AAoEvB,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAEpE,SAAS,MAAM,CAAC,IAAY;IAC1B,IAAI,CAAC;QACH,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,gGAAgG;AAChG,MAAM,QAAQ,GAAG,CAAC,QAAoB,EAAE,KAA6B,EAAsB,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,CAAC,CAAC;AAEpJ,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,KAAyB,EAAE,OAA6B,EAAE;IACnG,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,CAAC,GAAc,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;IACrE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,IAAI,sBAAsB,CAAC;IACpD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC;IAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IACrF,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC;IACnC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAE1B,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,IAAI,IAAI,CAAC,KAAK,EAAE,QAAQ,KAAK,SAAS;QAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAClG,MAAM,KAAK,GAA2B,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;IACvE,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,MAAM,GAAkB,IAAI,CAAC;IACjC,+EAA+E;IAC/E,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,MAAM,IAAI,GAAG,KAAK,IAAmB,EAAE;QACrC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAAE,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;IAChF,CAAC,CAAC;IAEF,qGAAqG;IACrG,KAAK,UAAU,SAAS,CAAC,MAAsB;QAC7C,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,OAAO,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC;YACpB,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7F,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,IAAI,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,iBAAiB;oBAAE,MAAM;gBACzD,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,KAAK,EAAE,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5G,KAAK,MAAM,CAAC,IAAI,MAAM;oBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpD,CAAC;YACD,MAAM,CAAC,EAAE,EAAE,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,6IAA6I;IAC7I,MAAM,SAAS,GAAG,GAAW,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IAE3E,4GAA4G;IAC5G,KAAK,UAAU,IAAI,CAAC,KAAgB;QAClC,MAAM,OAAO,GAAG,SAAS,EAAE,CAAC;QAC5B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;YACjB,MAAM,GAAG,yBAAyB,CAAC;YACnC,OAAO,GAAG,IAAI,CAAC;YACf,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,GAAa,CAAC;QAClB,IAAI,CAAC;YACH,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,eAAe,EAAE;gBACpC,MAAM,EAAE,MAAM;gBACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;gBAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpH,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC;aACrC,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,GAAG,kCAAmC,CAAW,CAAC,OAAO,GAAG,CAAC;YACnE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;YACzF,oEAAoE;YACpE,2CAA2C;YAC3C,OAAO,GAAG,IAAI,CAAC;YACf,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,2IAA2I,CAAC;YACpK,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YACZ,MAAM,GAAG,+BAA+B,GAAG,CAAC,MAAM,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAa,CAAC;QAClB,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,gCAAgC,CAAC;YAC1C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,IAAI,GAAI,IAA8B,CAAC,OAAO,CAAC;QACrD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,KAAK,MAAM,CAAC,IAAI,IAAsE,EAAE,CAAC;gBACvF,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/K,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,KAAK,UAAU,KAAK,CAAC,KAAgB,EAAE,OAA4B;QACjE,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,CAAC,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC5B,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAE,IAAI,IAAI,CAAC,IAAI,CAAC;gBAChC,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,IAAI,CAAC,EAAE,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC9D,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACzC,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,wBAAwB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;oBAC1G,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAE,IAAI,IAAI,CAAC,IAAI,CAAC;oBAChC,YAAY,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,cAAc,KAAK,KAAK,EAAE,CAAC;oBACvD,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAE,IAAI,IAAI,CAAC,OAAO,CAAC;gBACrC,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;YACD,iEAAiE;QACnE,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO;YAAE,OAAO;QAC9C,uEAAuE;QACvE,0EAA0E;QAC1E,wEAAwE;QACxE,mEAAmE;QACnE,2DAA2D;QAC3D,MAAM,KAAK,GAAc,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,SAAS,EAAE,CAAC;YAC5B,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;gBACjB,MAAM,GAAG,yBAAyB,CAAC;gBACnC,OAAO,GAAG,IAAI,CAAC;gBACf,OAAO;YACT,CAAC;YACD,IAAI,GAAqD,CAAC;YAC1D,IAAI,CAAC;gBACH,GAAG,GAAG,MAAM,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;YACxG,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,MAAM,GAAG,wDAAyD,CAAW,CAAC,OAAO,GAAG,CAAC;gBACzF,SAAS;YACX,CAAC;YACD,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAE,IAAI,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;gBACxD,YAAY,EAAE,CAAC;gBACf,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI;oBAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC3F,SAAS;YACX,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC/B,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,aAAa,CAAC,eAAe,EAAE,CAAC,CAAC;QACtG,MAAM,IAAI,EAAE,CAAC;QACb,MAAM,QAAQ,GAAc,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACnI,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,IAAI;YAAE,MAAM,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnD,CAAC;IAED,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,OAAO,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,GAAG,QAAQ,EAAE,CAAC;gBACnC,MAAM,GAAG,yBAAyB,CAAC;gBACnC,MAAM;YACR,CAAC;YACD,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,IAAI,CAAC,CAAC;QACd,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACzB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,OAAO,CAAC,OAAO,EAAE,CAAC;YAChB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,CAAC;gBAC1B,MAAM,GAAG,yBAAyB,CAAC;gBACnC,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAC9B,OAAO,GAAG,IAAI,CAAC;YACf,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,OAAO,KAAK,IAAI;gBAAE,MAAM,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAClD,MAAM,IAAI,EAAE,CAAC;QACf,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,MAAM;IACtB,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YAC5C,OAAO,EAAE,CAAC;YACV,MAAM,KAAK,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,CAAC;YACpD,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;gBACrB,IAAI,EAAE,CAAC;gBACP,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,SAAS;oBAAE,MAAM,EAAE,CAAC;YAC9D,CAAC;iBAAM,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,EAAE,CAAC;;gBACrC,OAAO,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,IAAI,MAAM,KAAK,IAAI;QAAE,MAAM,GAAG,iDAAiD,CAAC;IAC/F,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,OAAO,KAAK,CAAC,EAAE,CAAC;AACxK,CAAC"}