@lodestar/state-transition 1.23.0-dev.d69d809e7a → 1.23.0-dev.e6c1c5b3e3

package/lib/epoch/processPendingBalanceDeposits.js

@@ -1,68 +0,0 @@
-import { FAR_FUTURE_EPOCH } from "@lodestar/params";
-import { increaseBalance } from "../util/balance.js";
-import { getActivationExitChurnLimit } from "../util/validator.js";
-/**
- * Starting from Electra:
- * Process pending balance deposits from state subject to churn limit and depsoitBalanceToConsume.
- * For each eligible `deposit`, call `increaseBalance()`.
- * Remove the processed deposits from `state.pendingBalanceDeposits`.
- * Update `state.depositBalanceToConsume` for the next epoch
- *
- * TODO Electra: Update ssz library to support batch push to `pendingBalanceDeposits`
- */
-export function processPendingBalanceDeposits(state, cache) {
-    const nextEpoch = state.epochCtx.epoch + 1;
-    const availableForProcessing = state.depositBalanceToConsume + BigInt(getActivationExitChurnLimit(state.epochCtx));
-    let processedAmount = 0n;
-    let nextDepositIndex = 0;
-    const depositsToPostpone = [];
-    const validators = state.validators;
-    const cachedBalances = cache.balances;
-    for (const deposit of state.pendingBalanceDeposits.getAllReadonly()) {
-        const { amount, index: depositIndex } = deposit;
-        const validator = validators.getReadonly(depositIndex);
-        // Validator is exiting, postpone the deposit until after withdrawable epoch
-        if (validator.exitEpoch < FAR_FUTURE_EPOCH) {
-            if (nextEpoch <= validator.withdrawableEpoch) {
-                depositsToPostpone.push(deposit);
-            }
-            else {
-                // Deposited balance will never become active. Increase balance but do not consume churn
-                increaseBalance(state, depositIndex, Number(amount));
-                if (cachedBalances) {
-                    cachedBalances[depositIndex] += Number(amount);
-                }
-            }
-        }
-        else {
-            // Validator is not exiting, attempt to process deposit
-            if (processedAmount + amount > availableForProcessing) {
-                // Deposit does not fit in the churn, no more deposit processing in this epoch.
-                break;
-            }
-            else {
-                // Deposit fits in the churn, process it. Increase balance and consume churn.
-                increaseBalance(state, depositIndex, Number(amount));
-                if (cachedBalances) {
-                    cachedBalances[depositIndex] += Number(amount);
-                }
-                processedAmount = processedAmount + amount;
-            }
-        }
-        // Regardless of how the deposit was handled, we move on in the queue.
-        nextDepositIndex++;
-    }
-    const remainingPendingBalanceDeposits = state.pendingBalanceDeposits.sliceFrom(nextDepositIndex);
-    state.pendingBalanceDeposits = remainingPendingBalanceDeposits;
-    if (remainingPendingBalanceDeposits.length === 0) {
-        state.depositBalanceToConsume = 0n;
-    }
-    else {
-        state.depositBalanceToConsume = availableForProcessing - processedAmount;
-    }
-    // TODO Electra: add a function in ListCompositeTreeView to support batch push operation
-    for (const deposit of depositsToPostpone) {
-        state.pendingBalanceDeposits.push(deposit);
-    }
-}
-//# sourceMappingURL=processPendingBalanceDeposits.js.map

package/lib/epoch/processPendingBalanceDeposits.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"processPendingBalanceDeposits.js","sourceRoot":"","sources":["../../src/epoch/processPendingBalanceDeposits.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,gBAAgB,EAAC,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAC,eAAe,EAAC,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAC,2BAA2B,EAAC,MAAM,sBAAsB,CAAC;AAEjE;;;;;;;;GAQG;AACH,MAAM,UAAU,6BAA6B,CAAC,KAA+B,EAAE,KAA2B;IACxG,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;IAC3C,MAAM,sBAAsB,GAAG,KAAK,CAAC,uBAAuB,GAAG,MAAM,CAAC,2BAA2B,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnH,IAAI,eAAe,GAAG,EAAE,CAAC;IACzB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,MAAM,kBAAkB,GAAG,EAAE,CAAC;IAC9B,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;IACpC,MAAM,cAAc,GAAG,KAAK,CAAC,QAAQ,CAAC;IAEtC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,sBAAsB,CAAC,cAAc,EAAE,EAAE,CAAC;QACpE,MAAM,EAAC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAC,GAAG,OAAO,CAAC;QAC9C,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QAEvD,4EAA4E;QAC5E,IAAI,SAAS,CAAC,SAAS,GAAG,gBAAgB,EAAE,CAAC;YAC3C,IAAI,SAAS,IAAI,SAAS,CAAC,iBAAiB,EAAE,CAAC;gBAC7C,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,wFAAwF;gBACxF,eAAe,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBACrD,IAAI,cAAc,EAAE,CAAC;oBACnB,cAAc,CAAC,YAAY,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,uDAAuD;YACvD,IAAI,eAAe,GAAG,MAAM,GAAG,sBAAsB,EAAE,CAAC;gBACtD,+EAA+E;gBAC/E,MAAM;YACR,CAAC;iBAAM,CAAC;gBACN,6EAA6E;gBAC7E,eAAe,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;gBACrD,IAAI,cAAc,EAAE,CAAC;oBACnB,cAAc,CAAC,YAAY,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC;gBACjD,CAAC;gBACD,eAAe,GAAG,eAAe,GAAG,MAAM,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,sEAAsE;QACtE,gBAAgB,EAAE,CAAC;IACrB,CAAC;IAED,MAAM,+BAA+B,GAAG,KAAK,CAAC,sBAAsB,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC;IACjG,KAAK,CAAC,sBAAsB,GAAG,+BAA+B,CAAC;IAE/D,IAAI,+BAA+B,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjD,KAAK,CAAC,uBAAuB,GAAG,EAAE,CAAC;IACrC,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,uBAAuB,GAAG,sBAAsB,GAAG,eAAe,CAAC;IAC3E,CAAC;IAED,wFAAwF;IACxF,KAAK,MAAM,OAAO,IAAI,kBAAkB,EAAE,CAAC;QACzC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC;AACH,CAAC"}

package/lib/util/shuffle.d.ts

@@ -1,9 +0,0 @@
-import { Bytes32 } from "@lodestar/types";
-type Shuffleable = {
-    readonly length: number;
-    [index: number]: number;
-};
-export declare function shuffleList(input: Shuffleable, seed: Bytes32): void;
-export declare function unshuffleList(input: Shuffleable, seed: Bytes32): void;
-export {};
-//# sourceMappingURL=shuffle.d.ts.map

package/lib/util/shuffle.js

@@ -1,197 +0,0 @@
-import { digest } from "@chainsafe/as-sha256";
-import { SHUFFLE_ROUND_COUNT } from "@lodestar/params";
-import { assert, bytesToBigInt } from "@lodestar/utils";
-// ShuffleList shuffles a list, using the given seed for randomness. Mutates the input list.
-export function shuffleList(input, seed) {
-    innerShuffleList(input, seed, true);
-}
-// UnshuffleList undoes a list shuffling using the seed of the shuffling. Mutates the input list.
-export function unshuffleList(input, seed) {
-    innerShuffleList(input, seed, false);
-}
-const _SHUFFLE_H_SEED_SIZE = 32;
-const _SHUFFLE_H_ROUND_SIZE = 1;
-const _SHUFFLE_H_POSITION_WINDOW_SIZE = 4;
-const _SHUFFLE_H_PIVOT_VIEW_SIZE = _SHUFFLE_H_SEED_SIZE + _SHUFFLE_H_ROUND_SIZE;
-const _SHUFFLE_H_TOTAL_SIZE = _SHUFFLE_H_SEED_SIZE + _SHUFFLE_H_ROUND_SIZE + _SHUFFLE_H_POSITION_WINDOW_SIZE;
-/*
-
-def shuffle(list_size, seed):
-    indices = list(range(list_size))
-    for round in range(90):
-        hash_bytes = b''.join([
-            hash(seed + round.to_bytes(1, 'little') + (i).to_bytes(4, 'little'))
-            for i in range((list_size + 255) // 256)
-        ])
-        pivot = int.from_bytes(hash(seed + round.to_bytes(1, 'little')), 'little') % list_size
-
-        powers_of_two = [1, 2, 4, 8, 16, 32, 64, 128]
-
-        for i, index in enumerate(indices):
-            flip = (pivot - index) % list_size
-            hash_pos = index if index > flip else flip
-            byte = hash_bytes[hash_pos // 8]
-            if byte & powers_of_two[hash_pos % 8]:
-                indices[i] = flip
-    return indices
-
-Heavily-optimized version of the set-shuffling algorithm proposed by Vitalik to shuffle all items in a list together.
-
-Original here:
-    https://github.com/ethereum/consensus-specs/pull/576
-
-Main differences, implemented by @protolambda:
-    - User can supply input slice to shuffle, simple provide [0,1,2,3,4, ...] to get a list of cleanly shuffled indices.
-    - Input slice is shuffled (hence no return value), no new array is allocated
-    - Allocations as minimal as possible: only a very minimal buffer for hashing
-      (this should be allocated on the stack, compiler will find it with escape analysis).
-        This is not bigger than what's used for shuffling a single index!
-        As opposed to larger allocations (size O(n) instead of O(1)) made in the original.
-    - Replaced pseudocode/python workarounds with bit-logic.
-    - User can provide their own hash-function (as long as it outputs a 32 len byte slice)
-
-This Typescript version is an adaption of the Python version, in turn an adaption of the original Go version.
-Python: https://github.com/protolambda/eth2fastspec/blob/14e04e9db77ef7c8b7788ffdaa7e142d7318dd7e/eth2fastspec.py#L63
-Go: https://github.com/protolambda/eth2-shuffle
-All three implemented by @protolambda, but meant for public use, like the original spec version.
-*/
-function setPositionUint32(value, buf) {
-    // Little endian, optimized version
-    buf[_SHUFFLE_H_PIVOT_VIEW_SIZE] = (value >> 0) & 0xff;
-    buf[_SHUFFLE_H_PIVOT_VIEW_SIZE + 1] = (value >> 8) & 0xff;
-    buf[_SHUFFLE_H_PIVOT_VIEW_SIZE + 2] = (value >> 16) & 0xff;
-    buf[_SHUFFLE_H_PIVOT_VIEW_SIZE + 3] = (value >> 24) & 0xff;
-}
-// Shuffles or unshuffles, depending on the `dir` (true for shuffling, false for unshuffling
-function innerShuffleList(input, seed, dir) {
-    if (input.length <= 1) {
-        // nothing to (un)shuffle
-        return;
-    }
-    if (SHUFFLE_ROUND_COUNT == 0) {
-        // no shuffling
-        return;
-    }
-    // uint32 is sufficient, and necessary in JS,
-    // as we do a lot of bit math on it, which cannot be done as fast on more bits.
-    const listSize = input.length >>> 0;
-    // check if list size fits in uint32
-    assert.equal(listSize, input.length, "input length does not fit uint32");
-    // check that the seed is 32 bytes
-    assert.lte(seed.length, _SHUFFLE_H_SEED_SIZE, `seed length is not lte ${_SHUFFLE_H_SEED_SIZE} bytes`);
-    const buf = Buffer.alloc(_SHUFFLE_H_TOTAL_SIZE);
-    let r = 0;
-    if (!dir) {
-        // Start at last round.
-        // Iterating through the rounds in reverse, un-swaps everything, effectively un-shuffling the list.
-        r = SHUFFLE_ROUND_COUNT - 1;
-    }
-    // Seed is always the first 32 bytes of the hash input, we never have to change this part of the buffer.
-    buf.set(seed, 0);
-    // initial values here are not used: overwritten first within the inner for loop.
-    let source = seed; // just setting it to a Bytes32
-    let byteV = 0;
-    // eslint-disable-next-line no-constant-condition
-    while (true) {
-        // spec: pivot = bytes_to_int(hash(seed + int_to_bytes1(round))[0:8]) % list_size
-        // This is the "int_to_bytes1(round)", appended to the seed.
-        buf[_SHUFFLE_H_SEED_SIZE] = r;
-        // Seed is already in place, now just hash the correct part of the buffer, and take a uint64 from it,
-        //  and modulo it to get a pivot within range.
-        const h = digest(buf.subarray(0, _SHUFFLE_H_PIVOT_VIEW_SIZE));
-        const pivot = Number(bytesToBigInt(h.subarray(0, 8)) % BigInt(listSize)) >>> 0;
-        // Split up the for-loop in two:
-        //  1. Handle the part from 0 (incl) to pivot (incl). This is mirrored around (pivot / 2)
-        //  2. Handle the part from pivot (excl) to N (excl). This is mirrored around ((pivot / 2) + (size/2))
-        // The pivot defines a split in the array, with each of the splits mirroring their data within the split.
-        // Print out some example even/odd sized index lists, with some even/odd pivots,
-        //  and you can deduce how the mirroring works exactly.
-        // Note that the mirror is strict enough to not consider swapping the index @mirror with itself.
-        let mirror = (pivot + 1) >> 1;
-        // Since we are iterating through the "positions" in order, we can just repeat the hash every 256th position.
-        // No need to pre-compute every possible hash for efficiency like in the example code.
-        // We only need it consecutively (we are going through each in reverse order however, but same thing)
-        //
-        // spec: source = hash(seed + int_to_bytes1(round) + int_to_bytes4(position // 256))
-        // - seed is still in 0:32 (excl., 32 bytes)
-        // - round number is still in 32
-        // - mix in the position for randomness, except the last byte of it,
-        //   which will be used later to select a bit from the resulting hash.
-        // We start from the pivot position, and work back to the mirror position (of the part left to the pivot).
-        // This makes us process each pear exactly once (instead of unnecessarily twice, like in the spec)
-        setPositionUint32(pivot >> 8, buf); // already using first pivot byte below.
-        source = digest(buf);
-        byteV = source[(pivot & 0xff) >> 3];
-        for (let i = 0, j; i < mirror; i++) {
-            j = pivot - i;
-            // -- step() fn start
-            // The pair is i,j. With j being the bigger of the two, hence the "position" identifier of the pair.
-            // Every 256th bit (aligned to j).
-            if ((j & 0xff) == 0xff) {
-                // just overwrite the last part of the buffer, reuse the start (seed, round)
-                setPositionUint32(j >> 8, buf);
-                source = digest(buf);
-            }
-            // Same trick with byte retrieval. Only every 8th.
-            if ((j & 0x7) == 0x7) {
-                byteV = source[(j & 0xff) >> 3];
-            }
-            const bitV = (byteV >> (j & 0x7)) & 0x1;
-            if (bitV == 1) {
-                // swap the pair items
-                const tmp = input[j];
-                input[j] = input[i];
-                input[i] = tmp;
-            }
-            // -- step() fn end
-        }
-        // Now repeat, but for the part after the pivot.
-        mirror = (pivot + listSize + 1) >> 1;
-        const end = listSize - 1;
-        // Again, seed and round input is in place, just update the position.
-        // We start at the end, and work back to the mirror point.
-        // This makes us process each pear exactly once (instead of unnecessarily twice, like in the spec)
-        setPositionUint32(end >> 8, buf);
-        source = digest(buf);
-        byteV = source[(end & 0xff) >> 3];
-        for (let i = pivot + 1, j; i < mirror; i++) {
-            j = end - i + pivot + 1;
-            // -- step() fn start
-            // The pair is i,j. With j being the bigger of the two, hence the "position" identifier of the pair.
-            // Every 256th bit (aligned to j).
-            if ((j & 0xff) == 0xff) {
-                // just overwrite the last part of the buffer, reuse the start (seed, round)
-                setPositionUint32(j >> 8, buf);
-                source = digest(buf);
-            }
-            // Same trick with byte retrieval. Only every 8th.
-            if ((j & 0x7) == 0x7) {
-                byteV = source[(j & 0xff) >> 3];
-            }
-            const bitV = (byteV >> (j & 0x7)) & 0x1;
-            if (bitV == 1) {
-                // swap the pair items
-                const tmp = input[j];
-                input[j] = input[i];
-                input[i] = tmp;
-            }
-            // -- step() fn end
-        }
-        // go forwards?
-        if (dir) {
-            // -> shuffle
-            r += 1;
-            if (r == SHUFFLE_ROUND_COUNT) {
-                break;
-            }
-        }
-        else {
-            if (r == 0) {
-                break;
-            }
-            // -> un-shuffle
-            r -= 1;
-        }
-    }
-}
-//# sourceMappingURL=shuffle.js.map

package/lib/util/shuffle.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"shuffle.js","sourceRoot":"","sources":["../../src/util/shuffle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,sBAAsB,CAAC;AAC5C,OAAO,EAAC,mBAAmB,EAAC,MAAM,kBAAkB,CAAC;AAErD,OAAO,EAAC,MAAM,EAAE,aAAa,EAAC,MAAM,iBAAiB,CAAC;AAQtD,4FAA4F;AAC5F,MAAM,UAAU,WAAW,CAAC,KAAkB,EAAE,IAAa;IAC3D,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,iGAAiG;AACjG,MAAM,UAAU,aAAa,CAAC,KAAkB,EAAE,IAAa;IAC7D,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAChC,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAChC,MAAM,+BAA+B,GAAG,CAAC,CAAC;AAC1C,MAAM,0BAA0B,GAAG,oBAAoB,GAAG,qBAAqB,CAAC;AAChF,MAAM,qBAAqB,GAAG,oBAAoB,GAAG,qBAAqB,GAAG,+BAA+B,CAAC;AAE7G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAwCE;AAEF,SAAS,iBAAiB,CAAC,KAAa,EAAE,GAAW;IACnD,mCAAmC;IACnC,GAAG,CAAC,0BAA0B,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;IACtD,GAAG,CAAC,0BAA0B,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;IAC1D,GAAG,CAAC,0BAA0B,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;IAC3D,GAAG,CAAC,0BAA0B,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7D,CAAC;AAED,4FAA4F;AAC5F,SAAS,gBAAgB,CAAC,KAAkB,EAAE,IAAa,EAAE,GAAY;IACvE,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,yBAAyB;QACzB,OAAO;IACT,CAAC;IACD,IAAI,mBAAmB,IAAI,CAAC,EAAE,CAAC;QAC7B,eAAe;QACf,OAAO;IACT,CAAC;IACD,6CAA6C;IAC7C,+EAA+E;IAC/E,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACpC,oCAAoC;IACpC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,kCAAkC,CAAC,CAAC;IACzE,kCAAkC;IAClC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,oBAAoB,EAAE,0BAA0B,oBAAoB,QAAQ,CAAC,CAAC;IAEtG,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAChD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,EAAE,CAAC;QACT,uBAAuB;QACvB,mGAAmG;QACnG,CAAC,GAAG,mBAAmB,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,wGAAwG;IACxG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEjB,iFAAiF;IACjF,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,+BAA+B;IAClD,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,iDAAiD;IACjD,OAAO,IAAI,EAAE,CAAC;QACZ,iFAAiF;QACjF,4DAA4D;QAC5D,GAAG,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAC9B,qGAAqG;QACrG,8CAA8C;QAC9C,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC,CAAC;QAC9D,MAAM,KAAK,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC;QAE/E,gCAAgC;QAChC,yFAAyF;QACzF,sGAAsG;QACtG,yGAAyG;QACzG,gFAAgF;QAChF,uDAAuD;QACvD,gGAAgG;QAChG,IAAI,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9B,6GAA6G;QAC7G,sFAAsF;QACtF,qGAAqG;QACrG,EAAE;QACF,oFAAoF;QACpF,4CAA4C;QAC5C,gCAAgC;QAChC,oEAAoE;QACpE,sEAAsE;QACtE,0GAA0G;QAC1G,kGAAkG;QAClG,iBAAiB,CAAC,KAAK,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,wCAAwC;QAC5E,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,KAAK,GAAG,MAAM,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACd,qBAAqB;YACrB,oGAAoG;YACpG,kCAAkC;YAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;gBACvB,4EAA4E;gBAC5E,iBAAiB,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC/B,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YAED,kDAAkD;YAClD,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC;gBACrB,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAClC,CAAC;YAED,MAAM,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;YAExC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;gBACd,sBAAsB;gBACtB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACrB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpB,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,CAAC;YACD,mBAAmB;QACrB,CAAC;QAED,gDAAgD;QAChD,MAAM,GAAG,CAAC,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,QAAQ,GAAG,CAAC,CAAC;QACzB,qEAAqE;QACrE,0DAA0D;QAC1D,kGAAkG;QAClG,iBAAiB,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACjC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,KAAK,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACxB,qBAAqB;YACrB,oGAAoG;YACpG,kCAAkC;YAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;gBACvB,4EAA4E;gBAC5E,iBAAiB,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC/B,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YAED,kDAAkD;YAClD,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC;gBACrB,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAClC,CAAC;YAED,MAAM,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;YAExC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;gBACd,sBAAsB;gBACtB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACrB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpB,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjB,CAAC;YACD,mBAAmB;QACrB,CAAC;QAED,eAAe;QACf,IAAI,GAAG,EAAE,CAAC;YACR,aAAa;YACb,CAAC,IAAI,CAAC,CAAC;YACP,IAAI,CAAC,IAAI,mBAAmB,EAAE,CAAC;gBAC7B,MAAM;YACR,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,MAAM;YACR,CAAC;YACD,gBAAgB;YAChB,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;IACH,CAAC;AACH,CAAC"}