@keep-network/tbtc-v2 0.1.1-dev.54 → 0.1.1-dev.57

package/artifacts/Redemption.json

@@ -83,28 +83,28 @@
       "type": "event"
     }
   ],
-  "transactionHash": "0x19a7fc07a5df7d936547c3d616c5fdee202e39f8654c3f1578e70ff30e9e9cda",
+  "transactionHash": "0xfc92d4a7ad48cd02bb69d88435ccc81b838e040ddc5120838d77ff225717d7b7",
   "receipt": {
     "to": null,
     "from": "0x70997970C51812dc3A010C7d01b50e0d17dc79C8",
     "contractAddress": "0x7290f72B5C67052DDE8e6E179F7803c493e90d3f",
     "transactionIndex": 0,
-    "gasUsed": "3395169",
+    "gasUsed": "3391962",
     "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x784b4aa2578065b64d00d9a43117474da26442e4eb47d14da2f8296718bd8995",
-    "transactionHash": "0x19a7fc07a5df7d936547c3d616c5fdee202e39f8654c3f1578e70ff30e9e9cda",
+    "blockHash": "0xe7663cd7f4ac6e30d911a8a80734c2ea9b3ac15da5b89ec3a7f140eb8020c4e8",
+    "transactionHash": "0xfc92d4a7ad48cd02bb69d88435ccc81b838e040ddc5120838d77ff225717d7b7",
     "logs": [],
     "blockNumber": 42,
-    "cumulativeGasUsed": "3395169",
+    "cumulativeGasUsed": "3391962",
     "status": 1,
     "byzantium": true
   },
   "args": [],
   "numDeployments": 1,
-  "solcInputHash": "799c7b289d9b6d9cfc600d2fc23c7b64",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.9+commit.e5eed63a\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"bytes20\",\"name\":\"walletPubKeyHash\",\"type\":\"bytes20\"},{\"indexed\":false,\"internalType\":\"bytes\",\"name\":\"redeemerOutputScript\",\"type\":\"bytes\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"redeemer\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"requestedAmount\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"treasuryFee\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"txMaxFee\",\"type\":\"uint64\"}],\"name\":\"RedemptionRequested\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"bytes20\",\"name\":\"walletPubKeyHash\",\"type\":\"bytes20\"},{\"indexed\":false,\"internalType\":\"bytes\",\"name\":\"redeemerOutputScript\",\"type\":\"bytes\"}],\"name\":\"RedemptionTimedOut\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"bytes20\",\"name\":\"walletPubKeyHash\",\"type\":\"bytes20\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"redemptionTxHash\",\"type\":\"bytes32\"}],\"name\":\"RedemptionsCompleted\",\"type\":\"event\"}],\"devdoc\":{\"details\":\"To initiate a redemption, a user with a Bank balance supplies      a Bitcoin address. Then, the system calculates the redemption fee, and      releases balance to the provided Bitcoin address. Just like in case of      sweeps of revealed deposits, redemption requests are processed in      batches and require SPV proof to be submitted to the Bridge.\",\"kind\":\"dev\",\"methods\":{\"notifyRedemptionTimeout(BridgeState.Storage storage,bytes20,uint32[],bytes)\":{\"details\":\"Requirements:      - The wallet must be in the Live or MovingFunds or Terminated state      - The redemption request identified by `walletPubKeyHash` and        `redeemerOutputScript` must exist      - The expression `keccak256(abi.encode(walletMembersIDs))` must        be exactly the same as the hash stored under `membersIdsHash`        for the given `walletID`. Those IDs are not directly stored        in the contract for gas efficiency purposes but they can be        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`        events of the `WalletRegistry` contract      - The amount of time defined by `redemptionTimeout` must have        passed since the redemption was requested (the request must be        timed-out)\",\"params\":{\"redeemerOutputScript\":\"The redeemer's length-prefixed output        script (P2PKH, P2WPKH, P2SH or P2WSH)\",\"walletMembersIDs\":\"Identifiers of the wallet signing group members\",\"walletPubKeyHash\":\"20-byte public key hash of the wallet\"}},\"requestRedemption(BridgeState.Storage storage,bytes20,BitcoinTx.UTXO,bytes,uint64)\":{\"details\":\"Requirements:      - Wallet behind `walletPubKeyHash` must be live      - `mainUtxo` components must point to the recent main UTXO        of the given wallet, as currently known on the Ethereum chain.      - `redeemerOutputScript` must be a proper Bitcoin script      - `redeemerOutputScript` cannot have wallet PKH as payload      - `amount` must be above or equal the `redemptionDustThreshold`      - Given `walletPubKeyHash` and `redeemerOutputScript` pair can be        used for only one pending request at the same time      - Wallet must have enough Bitcoin balance to proceed the request      - Redeemer must make an allowance in the Bank that the Bridge        contract can spend the given `amount`.\",\"params\":{\"amount\":\"Requested amount in satoshi. This is also the TBTC amount        that is taken from redeemer's balance in the Bank upon request.        Once the request is handled, the actual amount of BTC locked        on the redeemer output script will be always lower than this value        since the treasury and Bitcoin transaction fees must be incurred.        The minimal amount satisfying the request can be computed as:        `amount - (amount / redemptionTreasuryFeeDivisor) - redemptionTxMaxFee`.        Fees values are taken at the moment of request creation.\",\"mainUtxo\":\"Data of the wallet's main UTXO, as currently known on        the Ethereum chain\",\"redeemerOutputScript\":\"The redeemer's length-prefixed output        script (P2PKH, P2WPKH, P2SH or P2WSH) that will be used to lock        redeemed BTC\",\"walletPubKeyHash\":\"The 20-byte wallet public key hash (computed        using Bitcoin HASH160 over the compressed ECDSA public key)\"}},\"submitRedemptionProof(BridgeState.Storage storage,BitcoinTx.Info,BitcoinTx.Proof,BitcoinTx.UTXO,bytes20)\":{\"details\":\"Requirements:      - `redemptionTx` components must match the expected structure. See        `BitcoinTx.Info` docs for reference. Their values must exactly        correspond to appropriate Bitcoin transaction fields to produce        a provable transaction hash.      - The `redemptionTx` should represent a Bitcoin transaction with        exactly 1 input that refers to the wallet's main UTXO. That        transaction should have 1..n outputs handling existing pending        redemption requests or pointing to reported timed out requests.        There can be also 1 optional output representing the        change and pointing back to the 20-byte wallet public key hash.        The change should be always present if the redeemed value sum        is lower than the total wallet's BTC balance.      - `redemptionProof` components must match the expected structure.        See `BitcoinTx.Proof` docs for reference. The `bitcoinHeaders`        field must contain a valid number of block headers, not less        than the `txProofDifficultyFactor` contract constant.      - `mainUtxo` components must point to the recent main UTXO        of the given wallet, as currently known on the Ethereum chain.        Additionally, the recent main UTXO on Ethereum must be set.      - `walletPubKeyHash` must be connected with the main UTXO used        as transaction single input.      Other remarks:      - Putting the change output as the first transaction output can        save some gas because the output processing loop begins each        iteration by checking whether the given output is the change        thus uses some gas for making the comparison. Once the change        is identified, that check is omitted in further iterations.\",\"params\":{\"mainUtxo\":\"Data of the wallet's main UTXO, as currently known on        the Ethereum chain\",\"redemptionProof\":\"Bitcoin redemption proof data\",\"redemptionTx\":\"Bitcoin redemption transaction data\",\"walletPubKeyHash\":\"20-byte public key hash (computed using Bitcoin        HASH160 over the compressed ECDSA public key) of the wallet which        performed the redemption transaction\"}}},\"title\":\"Bridge redemption\",\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{\"notifyRedemptionTimeout(BridgeState.Storage storage,bytes20,uint32[],bytes)\":{\"notice\":\"Notifies that there is a pending redemption request associated         with the given wallet, that has timed out. The redemption         request is identified by the key built as         `keccak256(walletPubKeyHash | redeemerOutputScript)`.         The results of calling this function:         - the pending redemptions value for the wallet will be decreased           by the requested amount (minus treasury fee),         - the tokens taken from the redeemer on redemption request will           be returned to the redeemer,         - the request will be moved from pending redemptions to           timed-out redemptions,         - if the state of the wallet is `Live` or `MovingFunds`, the           wallet operators will be slashed and the notifier will be           rewarded,         - if the state of wallet is `Live`, the wallet will be closed or           marked as `MovingFunds` (depending on the presence or absence           of the wallet's main UTXO) and the wallet will no longer be           marked as the active wallet (if it was marked as such).\"},\"requestRedemption(BridgeState.Storage storage,bytes20,BitcoinTx.UTXO,bytes,uint64)\":{\"notice\":\"Requests redemption of the given amount from the specified         wallet to the redeemer Bitcoin output script.\"},\"submitRedemptionProof(BridgeState.Storage storage,BitcoinTx.Info,BitcoinTx.Proof,BitcoinTx.UTXO,bytes20)\":{\"notice\":\"Used by the wallet to prove the BTC redemption transaction         and to make the necessary bookkeeping. Redemption is only         accepted if it satisfies SPV proof.         The function is performing Bank balance updates by burning         the total redeemed Bitcoin amount from Bridge balance and         transferring the treasury fee sum to the treasury address.         It is possible to prove the given redemption only one time.\"}},\"notice\":\"The library handles the logic for redeeming Bitcoin balances from         the Bridge.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"contracts/bridge/Redemption.sol\":\"Redemption\"},\"evmVersion\":\"london\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[]},\"sources\":{\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title BitcoinSPV */\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {SafeMath} from \\\"./SafeMath.sol\\\";\\n\\nlibrary BTCUtils {\\n    using BytesLib for bytes;\\n    using SafeMath for uint256;\\n\\n    // The target at minimum Difficulty. Also the target of the genesis block\\n    uint256 public constant DIFF1_TARGET = 0xffff0000000000000000000000000000000000000000000000000000;\\n\\n    uint256 public constant RETARGET_PERIOD = 2 * 7 * 24 * 60 * 60;  // 2 weeks in seconds\\n    uint256 public constant RETARGET_PERIOD_BLOCKS = 2016;  // 2 weeks in blocks\\n\\n    uint256 public constant ERR_BAD_ARG = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;\\n\\n    /* ***** */\\n    /* UTILS */\\n    /* ***** */\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _flag    The first byte of a VarInt\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLength(bytes memory _flag) internal pure returns (uint8) {\\n        return determineVarIntDataLengthAt(_flag, 0);\\n    }\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _b       The byte array containing a VarInt\\n    /// @param _at      The position of the VarInt in the array\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLengthAt(bytes memory _b, uint256 _at) internal pure returns (uint8) {\\n        if (uint8(_b[_at]) == 0xff) {\\n            return 8;  // one-byte flag, 8 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfe) {\\n            return 4;  // one-byte flag, 4 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfd) {\\n            return 2;  // one-byte flag, 2 bytes data\\n        }\\n\\n        return 0;  // flag is data\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string starting with a VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarInt(bytes memory _b) internal pure returns (uint256, uint256) {\\n        return parseVarIntAt(_b, 0);\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string containing a VarInt\\n    /// @param _at  The position of the VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarIntAt(bytes memory _b, uint256 _at) internal pure returns (uint256, uint256) {\\n        uint8 _dataLen = determineVarIntDataLengthAt(_b, _at);\\n\\n        if (_dataLen == 0) {\\n            return (0, uint8(_b[_at]));\\n        }\\n        if (_b.length < 1 + _dataLen + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n        uint256 _number;\\n        if (_dataLen == 2) {\\n            _number = reverseUint16(uint16(_b.slice2(1 + _at)));\\n        } else if (_dataLen == 4) {\\n            _number = reverseUint32(uint32(_b.slice4(1 + _at)));\\n        } else if (_dataLen == 8) {\\n            _number = reverseUint64(uint64(_b.slice8(1 + _at)));\\n        }\\n        return (_dataLen, _number);\\n    }\\n\\n    /// @notice          Changes the endianness of a byte array\\n    /// @dev             Returns a new, backwards, bytes\\n    /// @param _b        The bytes to reverse\\n    /// @return          The reversed bytes\\n    function reverseEndianness(bytes memory _b) internal pure returns (bytes memory) {\\n        bytes memory _newValue = new bytes(_b.length);\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _newValue[_b.length - i - 1] = _b[i];\\n        }\\n\\n        return _newValue;\\n    }\\n\\n    /// @notice          Changes the endianness of a uint256\\n    /// @dev             https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint256(uint256 _b) internal pure returns (uint256 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = ((v >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |\\n            ((v & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);\\n        // swap 8-byte long pairs\\n        v = ((v >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |\\n            ((v & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);\\n        // swap 16-byte long pairs\\n        v = (v >> 128) | (v << 128);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint64\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint64(uint64 _b) internal pure returns (uint64 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = (v >> 32) | (v << 32);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint32\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint32(uint32 _b) internal pure returns (uint32 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF) |\\n            ((v & 0x00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = (v >> 16) | (v << 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint24\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint24(uint24 _b) internal pure returns (uint24 v) {\\n        v =  (_b << 16) | (_b & 0x00FF00) | (_b >> 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint16\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint16(uint16 _b) internal pure returns (uint16 v) {\\n        v =  (_b << 8) | (_b >> 8);\\n    }\\n\\n\\n    /// @notice          Converts big-endian bytes to a uint\\n    /// @dev             Traverses the byte array and sums the bytes\\n    /// @param _b        The big-endian bytes-encoded integer\\n    /// @return          The integer representation\\n    function bytesToUint(bytes memory _b) internal pure returns (uint256) {\\n        uint256 _number;\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _number = _number + uint8(_b[i]) * (2 ** (8 * (_b.length - (i + 1))));\\n        }\\n\\n        return _number;\\n    }\\n\\n    /// @notice          Get the last _num bytes from a byte array\\n    /// @param _b        The byte array to slice\\n    /// @param _num      The number of bytes to extract from the end\\n    /// @return          The last _num bytes of _b\\n    function lastBytes(bytes memory _b, uint256 _num) internal pure returns (bytes memory) {\\n        uint256 _start = _b.length.sub(_num);\\n\\n        return _b.slice(_start, _num);\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (rmd160(sha2()))\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash160(bytes memory _b) internal pure returns (bytes memory) {\\n        return abi.encodePacked(ripemd160(abi.encodePacked(sha256(_b))));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (sha2 + ripemd160)\\n    /// @dev             sha2 precompile at address(2), ripemd160 at address(3)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash160View(bytes memory _b) internal view returns (bytes20 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 3, 0x00, 32, 0x00, 32))\\n            // read from position 12 = 0c\\n            res := mload(0x0c)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash256(bytes memory _b) internal pure returns (bytes32) {\\n        return sha256(abi.encodePacked(sha256(_b)));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash256View(bytes memory _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 on a pair of bytes32\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _a        The first bytes32 of the pre-image\\n    /// @param _b        The second bytes32 of the pre-image\\n    /// @return res      The digest\\n    function hash256Pair(bytes32 _a, bytes32 _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            mstore(0x00, _a)\\n            mstore(0x20, _b)\\n            pop(staticcall(gas(), 2, 0x00, 64, 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /* ************ */\\n    /* Legacy Input */\\n    /* ************ */\\n\\n    /// @notice          Extracts the nth input from the vin (0-indexed)\\n    /// @dev             Iterates over the vin. If you need to extract several, write a custom function\\n    /// @param _vin      The vin as a tightly-packed byte array\\n    /// @param _index    The 0-indexed location of the input to extract\\n    /// @return          The input as a byte array\\n    function extractInputAtIndex(bytes memory _vin, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nIns, \\\"Vin read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineInputLengthAt(_vin, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n            _offset = _offset + _len;\\n        }\\n\\n        _len = determineInputLengthAt(_vin, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _vin.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Determines whether an input is legacy\\n    /// @dev             False if no scriptSig, otherwise True\\n    /// @param _input    The input\\n    /// @return          True for legacy, False for witness\\n    function isLegacyInput(bytes memory _input) internal pure returns (bool) {\\n        return _input[36] != hex\\\"00\\\";\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The LEGACY input\\n    /// @return          The length of the script sig\\n    function extractScriptSigLen(bytes memory _input) internal pure returns (uint256, uint256) {\\n        return extractScriptSigLenAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    ///                  starting at the specified position\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The byte array containing the LEGACY input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the script sig\\n    function extractScriptSigLenAt(bytes memory _input, uint256 _at) internal pure returns (uint256, uint256) {\\n        if (_input.length < 37 + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = parseVarIntAt(_input, _at + 36);\\n\\n        return (_varIntDataLen, _scriptSigLen);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The input\\n    /// @return          The length of the input in bytes\\n    function determineInputLength(bytes memory _input) internal pure returns (uint256) {\\n        return determineInputLengthAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig,\\n    ///                  starting at the specified position\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the input in bytes\\n    function determineInputLengthAt(bytes memory _input, uint256 _at) internal pure returns (uint256) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLenAt(_input, _at);\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        return 36 + 1 + _varIntDataLen + _scriptSigLen + 4;\\n    }\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLELegacy(bytes memory _input) internal pure returns (bytes4) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice4(36 + 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceLegacy(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLELegacy(_input));\\n        uint32 _beSequence = reverseUint32(_leSeqence);\\n        return _beSequence;\\n    }\\n    /// @notice          Extracts the VarInt-prepended scriptSig from the input in a tx\\n    /// @dev             Will return hex\\\"00\\\" if passed a witness input\\n    /// @param _input    The LEGACY input\\n    /// @return          The length-prepended scriptSig\\n    function extractScriptSig(bytes memory _input) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice(36, 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n\\n    /* ************* */\\n    /* Witness Input */\\n    /* ************* */\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLEWitness(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(37);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input in a tx\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceWitness(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLEWitness(_input));\\n        uint32 _inputeSequence = reverseUint32(_leSeqence);\\n        return _inputeSequence;\\n    }\\n\\n    /// @notice          Extracts the outpoint from the input in a tx\\n    /// @dev             32-byte tx id with 4-byte index\\n    /// @param _input    The input\\n    /// @return          The outpoint (LE bytes of prev tx hash + LE bytes of prev tx index)\\n    function extractOutpoint(bytes memory _input) internal pure returns (bytes memory) {\\n        return _input.slice(0, 36);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    /// @dev             32-byte tx id\\n    /// @param _input    The input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLE(bytes memory _input) internal pure returns (bytes32) {\\n        return _input.slice32(0);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    ///                  starting at the specified position\\n    /// @dev             32-byte tx id\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes32) {\\n        return _input.slice32(_at);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    /// @dev             4-byte tx index\\n    /// @param _input    The input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLE(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(32);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    ///                  starting at the specified position\\n    /// @dev             4-byte tx index\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes4) {\\n        return _input.slice4(32 + _at);\\n    }\\n\\n    /* ****** */\\n    /* Output */\\n    /* ****** */\\n\\n    /// @notice          Determines the length of an output\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLength(bytes memory _output) internal pure returns (uint256) {\\n        return determineOutputLengthAt(_output, 0);\\n    }\\n\\n    /// @notice          Determines the length of an output\\n    ///                  starting at the specified position\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The position of the output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLengthAt(bytes memory _output, uint256 _at) internal pure returns (uint256) {\\n        if (_output.length < 9 + _at) {\\n            return ERR_BAD_ARG;\\n        }\\n        uint256 _varIntDataLen;\\n        uint256 _scriptPubkeyLength;\\n        (_varIntDataLen, _scriptPubkeyLength) = parseVarIntAt(_output, 8 + _at);\\n\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        // 8-byte value, 1-byte for tag itself\\n        return 8 + 1 + _varIntDataLen + _scriptPubkeyLength;\\n    }\\n\\n    /// @notice          Extracts the output at a given index in the TxOuts vector\\n    /// @dev             Iterates over the vout. If you need to extract multiple, write a custom function\\n    /// @param _vout     The _vout to extract from\\n    /// @param _index    The 0-indexed location of the output to extract\\n    /// @return          The specified output\\n    function extractOutputAtIndex(bytes memory _vout, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nOuts, \\\"Vout read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineOutputLengthAt(_vout, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n            _offset += _len;\\n        }\\n\\n        _len = determineOutputLengthAt(_vout, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n        return _vout.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Extracts the value bytes from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value as LE bytes\\n    function extractValueLE(bytes memory _output) internal pure returns (bytes8) {\\n        return _output.slice8(0);\\n    }\\n\\n    /// @notice          Extracts the value from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value\\n    function extractValue(bytes memory _output) internal pure returns (uint64) {\\n        uint64 _leValue = uint64(extractValueLE(_output));\\n        uint64 _beValue = reverseUint64(_leValue);\\n        return _beValue;\\n    }\\n\\n    /// @notice          Extracts the data from an op return output\\n    /// @dev             Returns hex\\\"\\\" if no data or not an op return\\n    /// @param _output   The output\\n    /// @return          Any data contained in the opreturn output, null if not an op return\\n    function extractOpReturnData(bytes memory _output) internal pure returns (bytes memory) {\\n        if (_output[9] != hex\\\"6a\\\") {\\n            return hex\\\"\\\";\\n        }\\n        bytes1 _dataLen = _output[10];\\n        return _output.slice(11, uint256(uint8(_dataLen)));\\n    }\\n\\n    /// @notice          Extracts the hash from the output script\\n    /// @dev             Determines type by the length prefix and validates format\\n    /// @param _output   The output\\n    /// @return          The hash committed to by the pk_script, or null for errors\\n    function extractHash(bytes memory _output) internal pure returns (bytes memory) {\\n        uint8 _scriptLen = uint8(_output[8]);\\n\\n        // don't have to worry about overflow here.\\n        // if _scriptLen + 9 overflows, then output.length would have to be < 9\\n        // for this check to pass. if it's < 9, then we errored when assigning\\n        // _scriptLen\\n        if (_scriptLen + 9 != _output.length) {\\n            return hex\\\"\\\";\\n        }\\n\\n        if (uint8(_output[9]) == 0) {\\n            if (_scriptLen < 2) {\\n                return hex\\\"\\\";\\n            }\\n            uint256 _payloadLen = uint8(_output[10]);\\n            // Check for maliciously formatted witness outputs.\\n            // No need to worry about underflow as long b/c of the `< 2` check\\n            if (_payloadLen != _scriptLen - 2 || (_payloadLen != 0x20 && _payloadLen != 0x14)) {\\n                return hex\\\"\\\";\\n            }\\n            return _output.slice(11, _payloadLen);\\n        } else {\\n            bytes3 _tag = _output.slice3(8);\\n            // p2pkh\\n            if (_tag == hex\\\"1976a9\\\") {\\n                // Check for maliciously formatted p2pkh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[11]) != 0x14 ||\\n                    _output.slice2(_output.length - 2) != hex\\\"88ac\\\") {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(12, 20);\\n            //p2sh\\n            } else if (_tag == hex\\\"17a914\\\") {\\n                // Check for maliciously formatted p2sh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[_output.length - 1]) != 0x87) {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(11, 20);\\n            }\\n        }\\n        return hex\\\"\\\";  /* NB: will trigger on OPRETURN and any non-standard that doesn't overrun */\\n    }\\n\\n    /* ********** */\\n    /* Witness TX */\\n    /* ********** */\\n\\n\\n    /// @notice      Checks that the vin passed up is properly formatted\\n    /// @dev         Consider a vin with a valid vout in its scriptsig\\n    /// @param _vin  Raw bytes length-prefixed input vector\\n    /// @return      True if it represents a validly formatted vin\\n    function validateVin(bytes memory _vin) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n\\n        // Not valid if it says there are too many or no inputs\\n        if (_nIns == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nIns; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vin.length) {\\n                return false;\\n            }\\n\\n            // Grab the next input and determine its length.\\n            uint256 _nextLen = determineInputLengthAt(_vin, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            // Increase the offset by that much\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vin.length;\\n    }\\n\\n    /// @notice      Checks that the vout passed up is properly formatted\\n    /// @dev         Consider a vout with a valid scriptpubkey\\n    /// @param _vout Raw bytes length-prefixed output vector\\n    /// @return      True if it represents a validly formatted vout\\n    function validateVout(bytes memory _vout) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n\\n        // Not valid if it says there are too many or no outputs\\n        if (_nOuts == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nOuts; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vout.length) {\\n                return false;\\n            }\\n\\n            // Grab the next output and determine its length.\\n            // Increase the offset by that much\\n            uint256 _nextLen = determineOutputLengthAt(_vout, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vout.length;\\n    }\\n\\n\\n\\n    /* ************ */\\n    /* Block Header */\\n    /* ************ */\\n\\n    /// @notice          Extracts the transaction merkle root from a block header\\n    /// @dev             Use verifyHash256Merkle to verify proofs with this root\\n    /// @param _header   The header\\n    /// @return          The merkle root (little-endian)\\n    function extractMerkleRootLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(36);\\n    }\\n\\n    /// @notice          Extracts the target from a block header\\n    /// @dev             Target is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _header   The header\\n    /// @return          The target threshold\\n    function extractTarget(bytes memory _header) internal pure returns (uint256) {\\n        uint24 _m = uint24(_header.slice3(72));\\n        uint8 _e = uint8(_header[75]);\\n        uint256 _mantissa = uint256(reverseUint24(_m));\\n        uint _exponent = _e - 3;\\n\\n        return _mantissa * (256 ** _exponent);\\n    }\\n\\n    /// @notice          Calculate difficulty from the difficulty 1 target and current target\\n    /// @dev             Difficulty 1 is 0x1d00ffff on mainnet and testnet\\n    /// @dev             Difficulty 1 is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _target   The current target\\n    /// @return          The block difficulty (bdiff)\\n    function calculateDifficulty(uint256 _target) internal pure returns (uint256) {\\n        // Difficulty 1 calculated from 0x1d00ffff\\n        return DIFF1_TARGET.div(_target);\\n    }\\n\\n    /// @notice          Extracts the previous block's hash from a block header\\n    /// @dev             Block headers do NOT include block number :(\\n    /// @param _header   The header\\n    /// @return          The previous block's hash (little-endian)\\n    function extractPrevBlockLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(4);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (little-endian bytes)\\n    function extractTimestampLE(bytes memory _header) internal pure returns (bytes4) {\\n        return _header.slice4(68);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (uint)\\n    function extractTimestamp(bytes memory _header) internal pure returns (uint32) {\\n        return reverseUint32(uint32(extractTimestampLE(_header)));\\n    }\\n\\n    /// @notice          Extracts the expected difficulty from a block header\\n    /// @dev             Does NOT verify the work\\n    /// @param _header   The header\\n    /// @return          The difficulty as an integer\\n    function extractDifficulty(bytes memory _header) internal pure returns (uint256) {\\n        return calculateDifficulty(extractTarget(_header));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes memory _a, bytes memory _b) internal view returns (bytes32) {\\n        return hash256View(abi.encodePacked(_a, _b));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes32 _a, bytes32 _b) internal view returns (bytes32) {\\n        return hash256Pair(_a, _b);\\n    }\\n\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Inefficient version.\\n    /// @param _proof    The proof. Tightly packed LE sha256 hashes. The last hash is the root\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(bytes memory _proof, uint _index) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_proof.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Special case for coinbase-only blocks\\n        if (_proof.length == 32) {\\n            return true;\\n        }\\n\\n        // Should never occur\\n        if (_proof.length == 64) {\\n            return false;\\n        }\\n\\n        bytes32 _root = _proof.slice32(_proof.length - 32);\\n        bytes32 _current = _proof.slice32(0);\\n        bytes memory _tree = _proof.slice(32, _proof.length - 64);\\n\\n        return verifyHash256Merkle(_current, _tree, _root, _index);\\n    }\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Efficient version.\\n    /// @param _leaf     The leaf of the proof. LE sha256 hash.\\n    /// @param _tree     The intermediate nodes in the proof.\\n    ///                  Tightly packed LE sha256 hashes.\\n    /// @param _root     The root of the proof. LE sha256 hash.\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(\\n        bytes32 _leaf,\\n        bytes memory _tree,\\n        bytes32 _root,\\n        uint _index\\n    ) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_tree.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Should never occur\\n        if (_tree.length == 0) {\\n            return false;\\n        }\\n\\n        uint _idx = _index;\\n        bytes32 _current = _leaf;\\n\\n        // i moves in increments of 32\\n        for (uint i = 0; i < _tree.length; i += 32) {\\n            if (_idx % 2 == 1) {\\n                _current = _hash256MerkleStep(_tree.slice32(i), _current);\\n            } else {\\n                _current = _hash256MerkleStep(_current, _tree.slice32(i));\\n            }\\n            _idx = _idx >> 1;\\n        }\\n        return _current == _root;\\n    }\\n\\n    /*\\n    NB: https://github.com/bitcoin/bitcoin/blob/78dae8caccd82cfbfd76557f1fb7d7557c7b5edb/src/pow.cpp#L49-L72\\n    NB: We get a full-bitlength target from this. For comparison with\\n        header-encoded targets we need to mask it with the header target\\n        e.g. (full & truncated) == truncated\\n    */\\n    /// @notice                 performs the bitcoin difficulty retarget\\n    /// @dev                    implements the Bitcoin algorithm precisely\\n    /// @param _previousTarget  the target of the previous period\\n    /// @param _firstTimestamp  the timestamp of the first block in the difficulty period\\n    /// @param _secondTimestamp the timestamp of the last block in the difficulty period\\n    /// @return                 the new period's target threshold\\n    function retargetAlgorithm(\\n        uint256 _previousTarget,\\n        uint256 _firstTimestamp,\\n        uint256 _secondTimestamp\\n    ) internal pure returns (uint256) {\\n        uint256 _elapsedTime = _secondTimestamp.sub(_firstTimestamp);\\n\\n        // Normalize ratio to factor of 4 if very long or very short\\n        if (_elapsedTime < RETARGET_PERIOD.div(4)) {\\n            _elapsedTime = RETARGET_PERIOD.div(4);\\n        }\\n        if (_elapsedTime > RETARGET_PERIOD.mul(4)) {\\n            _elapsedTime = RETARGET_PERIOD.mul(4);\\n        }\\n\\n        /*\\n          NB: high targets e.g. ffff0020 can cause overflows here\\n              so we divide it by 256**2, then multiply by 256**2 later\\n              we know the target is evenly divisible by 256**2, so this isn't an issue\\n        */\\n\\n        uint256 _adjusted = _previousTarget.div(65536).mul(_elapsedTime);\\n        return _adjusted.div(RETARGET_PERIOD).mul(65536);\\n    }\\n}\\n\",\"keccak256\":\"0x0f6b9a8deec659541f8bf2e5c4ecf4596ffa7502f7a8f4d9e88a681a01ef0dfb\"},\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\n\\nhttps://github.com/GNSPS/solidity-bytes-utils/\\n\\nThis is free and unencumbered software released into the public domain.\\n\\nAnyone is free to copy, modify, publish, use, compile, sell, or\\ndistribute this software, either in source code form or as a compiled\\nbinary, for any purpose, commercial or non-commercial, and by any\\nmeans.\\n\\nIn jurisdictions that recognize copyright laws, the author or authors\\nof this software dedicate any and all copyright interest in the\\nsoftware to the public domain. We make this dedication for the benefit\\nof the public at large and to the detriment of our heirs and\\nsuccessors. We intend this dedication to be an overt act of\\nrelinquishment in perpetuity of all present and future rights to this\\nsoftware under copyright law.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\nOTHER DEALINGS IN THE SOFTWARE.\\n\\nFor more information, please refer to <https://unlicense.org>\\n*/\\n\\n\\n/** @title BytesLib **/\\n/** @author https://github.com/GNSPS **/\\n\\nlibrary BytesLib {\\n    function concat(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bytes memory) {\\n        bytes memory tempBytes;\\n\\n        assembly {\\n            // Get a location of some free memory and store it in tempBytes as\\n            // Solidity does for memory variables.\\n            tempBytes := mload(0x40)\\n\\n            // Store the length of the first bytes array at the beginning of\\n            // the memory for tempBytes.\\n            let length := mload(_preBytes)\\n            mstore(tempBytes, length)\\n\\n            // Maintain a memory counter for the current write location in the\\n            // temp bytes array by adding the 32 bytes for the array length to\\n            // the starting location.\\n            let mc := add(tempBytes, 0x20)\\n            // Stop copying when the memory counter reaches the length of the\\n            // first bytes array.\\n            let end := add(mc, length)\\n\\n            for {\\n                // Initialize a copy counter to the start of the _preBytes data,\\n                // 32 bytes into its memory.\\n                let cc := add(_preBytes, 0x20)\\n            } lt(mc, end) {\\n                // Increase both counters by 32 bytes each iteration.\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                // Write the _preBytes data into the tempBytes memory 32 bytes\\n                // at a time.\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Add the length of _postBytes to the current length of tempBytes\\n            // and store it as the new length in the first 32 bytes of the\\n            // tempBytes memory.\\n            length := mload(_postBytes)\\n            mstore(tempBytes, add(length, mload(tempBytes)))\\n\\n            // Move the memory counter back from a multiple of 0x20 to the\\n            // actual end of the _preBytes data.\\n            mc := end\\n            // Stop copying when the memory counter reaches the new combined\\n            // length of the arrays.\\n            end := add(mc, length)\\n\\n            for {\\n                let cc := add(_postBytes, 0x20)\\n            } lt(mc, end) {\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Update the free-memory pointer by padding our last write location\\n            // to 32 bytes: add 31 bytes to the end of tempBytes to move to the\\n            // next 32 byte block, then round down to the nearest multiple of\\n            // 32. If the sum of the length of the two arrays is zero then add\\n            // one before rounding down to leave a blank 32 bytes (the length block with 0).\\n            mstore(0x40, and(\\n                add(add(end, iszero(add(length, mload(_preBytes)))), 31),\\n                not(31) // Round down to the nearest 32 bytes.\\n            ))\\n        }\\n\\n        return tempBytes;\\n    }\\n\\n    function concatStorage(bytes storage _preBytes, bytes memory _postBytes) internal {\\n        assembly {\\n            // Read the first 32 bytes of _preBytes storage, which is the length\\n            // of the array. (We don't need to use the offset into the slot\\n            // because arrays use the entire slot.)\\n            let fslot := sload(_preBytes.slot)\\n            // Arrays of 31 bytes or less have an even value in their slot,\\n            // while longer arrays have an odd value. The actual length is\\n            // the slot divided by two for odd values, and the lowest order\\n            // byte divided by two for even values.\\n            // If the slot is even, bitwise and the slot with 255 and divide by\\n            // two to get the length. If the slot is odd, bitwise and the slot\\n            // with -1 and divide by two.\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n            let newlength := add(slength, mlength)\\n            // slength can contain both the length and contents of the array\\n            // if length < 32 bytes so let's prepare for that\\n            // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n            switch add(lt(slength, 32), lt(newlength, 32))\\n            case 2 {\\n                // Since the new array still fits in the slot, we just need to\\n                // update the contents of the slot.\\n                // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length\\n                sstore(\\n                    _preBytes.slot,\\n                    // all the modifications to the slot are inside this\\n                    // next block\\n                    add(\\n                        // we can just add to the slot contents because the\\n                        // bytes we want to change are the LSBs\\n                        fslot,\\n                        add(\\n                            mul(\\n                                div(\\n                                    // load the bytes from memory\\n                                    mload(add(_postBytes, 0x20)),\\n                                    // zero all bytes to the right\\n                                    exp(0x100, sub(32, mlength))\\n                        ),\\n                        // and now shift left the number of bytes to\\n                        // leave space for the length in the slot\\n                        exp(0x100, sub(32, newlength))\\n                        ),\\n                        // increase length by the double of the memory\\n                        // bytes length\\n                        mul(mlength, 2)\\n                        )\\n                    )\\n                )\\n            }\\n            case 1 {\\n                // The stored value fits in the slot, but the combined value\\n                // will exceed it.\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // The contents of the _postBytes array start 32 bytes into\\n                // the structure. Our first read should obtain the `submod`\\n                // bytes that can fit into the unused space in the last word\\n                // of the stored array. To get this, we read 32 bytes starting\\n                // from `submod`, so the data we read overlaps with the array\\n                // contents by `submod` bytes. Masking the lowest-order\\n                // `submod` bytes allows us to add that value directly to the\\n                // stored value.\\n\\n                let submod := sub(32, slength)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(\\n                    sc,\\n                    add(\\n                        and(\\n                            fslot,\\n                            0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00\\n                    ),\\n                    and(mload(mc), mask)\\n                    )\\n                )\\n\\n                for {\\n                    mc := add(mc, 0x20)\\n                    sc := add(sc, 1)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n            default {\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                // Start copying to the last used word of the stored array.\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // Copy over the first `submod` bytes of the new data as in\\n                // case 1 above.\\n                let slengthmod := mod(slength, 32)\\n                let mlengthmod := mod(mlength, 32)\\n                let submod := sub(32, slengthmod)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(sc, add(sload(sc), and(mload(mc), mask)))\\n\\n                for {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n        }\\n    }\\n\\n    function slice(bytes memory _bytes, uint _start, uint _length) internal  pure returns (bytes memory res) {\\n        if (_length == 0) {\\n            return hex\\\"\\\";\\n        }\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            // Alloc bytes array with additional 32 bytes afterspace and assign it's size\\n            res := mload(0x40)\\n            mstore(0x40, add(add(res, 64), _length))\\n            mstore(res, _length)\\n\\n            // Compute distance between source and destination pointers\\n            let diff := sub(res, add(_bytes, _start))\\n\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n            } {\\n                mstore(add(src, diff), mload(src))\\n            }\\n        }\\n    }\\n\\n    /// @notice Take a slice of the byte array, overwriting the destination.\\n    /// The length of the slice will equal the length of the destination array.\\n    /// @dev Make sure the destination array has afterspace if required.\\n    /// @param _bytes The source array\\n    /// @param _dest The destination array.\\n    /// @param _start The location to start in the source array.\\n    function sliceInPlace(\\n        bytes memory _bytes,\\n        bytes memory _dest,\\n        uint _start\\n    ) internal pure {\\n        uint _length = _dest.length;\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let res := add(_dest, 32)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n                res := add(res, 32)\\n            } {\\n                mstore(res, mload(src))\\n            }\\n        }\\n    }\\n\\n    // Static slice functions, no bounds checking\\n    /// @notice take a 32-byte slice from the specified position\\n    function slice32(bytes memory _bytes, uint _start) internal pure returns (bytes32 res) {\\n        assembly {\\n            res := mload(add(add(_bytes, 32), _start))\\n        }\\n    }\\n\\n    /// @notice take a 20-byte slice from the specified position\\n    function slice20(bytes memory _bytes, uint _start) internal pure returns (bytes20) {\\n        return bytes20(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 8-byte slice from the specified position\\n    function slice8(bytes memory _bytes, uint _start) internal pure returns (bytes8) {\\n        return bytes8(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 4-byte slice from the specified position\\n    function slice4(bytes memory _bytes, uint _start) internal pure returns (bytes4) {\\n        return bytes4(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 3-byte slice from the specified position\\n    function slice3(bytes memory _bytes, uint _start) internal pure returns (bytes3) {\\n        return bytes3(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 2-byte slice from the specified position\\n    function slice2(bytes memory _bytes, uint _start) internal pure returns (bytes2) {\\n        return bytes2(slice32(_bytes, _start));\\n    }\\n\\n    function toAddress(bytes memory _bytes, uint _start) internal  pure returns (address) {\\n        uint _totalLen = _start + 20;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Address conversion out of bounds.\\\");\\n        address tempAddress;\\n\\n        assembly {\\n            tempAddress := div(mload(add(add(_bytes, 0x20), _start)), 0x1000000000000000000000000)\\n        }\\n\\n        return tempAddress;\\n    }\\n\\n    function toUint(bytes memory _bytes, uint _start) internal  pure returns (uint256) {\\n        uint _totalLen = _start + 32;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Uint conversion out of bounds.\\\");\\n        uint256 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x20), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function equal(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            let length := mload(_preBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(length, mload(_postBytes))\\n            case 1 {\\n                // cb is a circuit breaker in the for loop since there's\\n                //  no said feature for inline assembly loops\\n                // cb = 1 - don't breaker\\n                // cb = 0 - break\\n                let cb := 1\\n\\n                let mc := add(_preBytes, 0x20)\\n                let end := add(mc, length)\\n\\n                for {\\n                    let cc := add(_postBytes, 0x20)\\n                    // the next line is the loop condition:\\n                    // while(uint(mc < end) + cb == 2)\\n                } eq(add(lt(mc, end), cb), 2) {\\n                    mc := add(mc, 0x20)\\n                    cc := add(cc, 0x20)\\n                } {\\n                    // if any of these checks fails then arrays are not equal\\n                    if iszero(eq(mload(mc), mload(cc))) {\\n                        // unsuccess:\\n                        success := 0\\n                        cb := 0\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function equalStorage(bytes storage _preBytes, bytes memory _postBytes) internal view returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            // we know _preBytes_offset is 0\\n            let fslot := sload(_preBytes.slot)\\n            // Decode the length of the stored array like in concatStorage().\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(slength, mlength)\\n            case 1 {\\n                // slength can contain both the length and contents of the array\\n                // if length < 32 bytes so let's prepare for that\\n                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n                if iszero(iszero(slength)) {\\n                    switch lt(slength, 32)\\n                    case 1 {\\n                        // blank the last byte which is the length\\n                        fslot := mul(div(fslot, 0x100), 0x100)\\n\\n                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {\\n                            // unsuccess:\\n                            success := 0\\n                        }\\n                    }\\n                    default {\\n                        // cb is a circuit breaker in the for loop since there's\\n                        //  no said feature for inline assembly loops\\n                        // cb = 1 - don't breaker\\n                        // cb = 0 - break\\n                        let cb := 1\\n\\n                        // get the keccak hash to get the contents of the array\\n                        mstore(0x0, _preBytes.slot)\\n                        let sc := keccak256(0x0, 0x20)\\n\\n                        let mc := add(_postBytes, 0x20)\\n                        let end := add(mc, mlength)\\n\\n                        // the next line is the loop condition:\\n                        // while(uint(mc < end) + cb == 2)\\n                        for {} eq(add(lt(mc, end), cb), 2) {\\n                            sc := add(sc, 1)\\n                            mc := add(mc, 0x20)\\n                        } {\\n                            if iszero(eq(sload(sc), mload(mc))) {\\n                                // unsuccess:\\n                                success := 0\\n                                cb := 0\\n                            }\\n                        }\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function toBytes32(bytes memory _source) pure internal returns (bytes32 result) {\\n        if (_source.length == 0) {\\n            return 0x0;\\n        }\\n\\n        assembly {\\n            result := mload(add(_source, 32))\\n        }\\n    }\\n\\n    function keccak256Slice(bytes memory _bytes, uint _start, uint _length) pure internal returns (bytes32 result) {\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            result := keccak256(add(add(_bytes, 32), _start), _length)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x43e0f3b3b23c861bd031588bf410dfdd02e2af17941a89aa38d70e534e0380d1\"},\"@keep-network/bitcoin-spv-sol/contracts/CheckBitcoinSigs.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title CheckBitcoinSigs */\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {BTCUtils} from \\\"./BTCUtils.sol\\\";\\n\\n\\nlibrary CheckBitcoinSigs {\\n\\n    using BytesLib for bytes;\\n    using BTCUtils for bytes;\\n\\n    /// @notice          Derives an Ethereum Account address from a pubkey\\n    /// @dev             The address is the last 20 bytes of the keccak256 of the address\\n    /// @param _pubkey   The public key X & Y. Unprefixed, as a 64-byte array\\n    /// @return          The account address\\n    function accountFromPubkey(bytes memory _pubkey) internal pure returns (address) {\\n        require(_pubkey.length == 64, \\\"Pubkey must be 64-byte raw, uncompressed key.\\\");\\n\\n        // keccak hash of uncompressed unprefixed pubkey\\n        bytes32 _digest = keccak256(_pubkey);\\n        return address(uint160(uint256(_digest)));\\n    }\\n\\n    /// @notice          Calculates the p2wpkh output script of a pubkey\\n    /// @dev             Compresses keys to 33 bytes as required by Bitcoin\\n    /// @param _pubkey   The public key, compressed or uncompressed\\n    /// @return          The p2wkph output script\\n    function p2wpkhFromPubkey(bytes memory _pubkey) internal view returns (bytes memory) {\\n        bytes memory _compressedPubkey;\\n        uint8 _prefix;\\n\\n        if (_pubkey.length == 64) {\\n            _prefix = uint8(_pubkey[_pubkey.length - 1]) % 2 == 1 ? 3 : 2;\\n            _compressedPubkey = abi.encodePacked(_prefix, _pubkey.slice32(0));\\n        } else if (_pubkey.length == 65) {\\n            _prefix = uint8(_pubkey[_pubkey.length - 1]) % 2 == 1 ? 3 : 2;\\n            _compressedPubkey = abi.encodePacked(_prefix, _pubkey.slice32(1));\\n        } else {\\n            _compressedPubkey = _pubkey;\\n        }\\n\\n        require(_compressedPubkey.length == 33, \\\"Witness PKH requires compressed keys\\\");\\n\\n        bytes20 _pubkeyHash = _compressedPubkey.hash160View();\\n        return abi.encodePacked(hex\\\"0014\\\", _pubkeyHash);\\n    }\\n\\n    /// @notice          checks a signed message's validity under a pubkey\\n    /// @dev             does this using ecrecover because Ethereum has no soul\\n    /// @param _pubkey   the public key to check (64 bytes)\\n    /// @param _digest   the message digest signed\\n    /// @param _v        the signature recovery value\\n    /// @param _r        the signature r value\\n    /// @param _s        the signature s value\\n    /// @return          true if signature is valid, else false\\n    function checkSig(\\n        bytes memory _pubkey,\\n        bytes32 _digest,\\n        uint8 _v,\\n        bytes32 _r,\\n        bytes32 _s\\n    ) internal pure returns (bool) {\\n        require(_pubkey.length == 64, \\\"Requires uncompressed unprefixed pubkey\\\");\\n        address _expected = accountFromPubkey(_pubkey);\\n        address _actual = ecrecover(_digest, _v, _r, _s);\\n        return _actual == _expected;\\n    }\\n\\n    /// @notice                     checks a signed message against a bitcoin p2wpkh output script\\n    /// @dev                        does this my verifying the p2wpkh matches an ethereum account\\n    /// @param _p2wpkhOutputScript  the bitcoin output script\\n    /// @param _pubkey              the uncompressed, unprefixed public key to check\\n    /// @param _digest              the message digest signed\\n    /// @param _v                   the signature recovery value\\n    /// @param _r                   the signature r value\\n    /// @param _s                   the signature s value\\n    /// @return                     true if signature is valid, else false\\n    function checkBitcoinSig(\\n        bytes memory _p2wpkhOutputScript,\\n        bytes memory _pubkey,\\n        bytes32 _digest,\\n        uint8 _v,\\n        bytes32 _r,\\n        bytes32 _s\\n    ) internal view returns (bool) {\\n        require(_pubkey.length == 64, \\\"Requires uncompressed unprefixed pubkey\\\");\\n\\n        bool _isExpectedSigner = keccak256(p2wpkhFromPubkey(_pubkey)) == keccak256(_p2wpkhOutputScript);  // is it the expected signer?\\n        if (!_isExpectedSigner) {return false;}\\n\\n        bool _sigResult = checkSig(_pubkey, _digest, _v, _r, _s);\\n        return _sigResult;\\n    }\\n\\n    /// @notice             checks if a message is the sha256 preimage of a digest\\n    /// @dev                this is NOT the hash256!  this step is necessary for ECDSA security!\\n    /// @param _digest      the digest\\n    /// @param _candidate   the purported preimage\\n    /// @return             true if the preimage matches the digest, else false\\n    function isSha256Preimage(\\n        bytes memory _candidate,\\n        bytes32 _digest\\n    ) internal pure returns (bool) {\\n        return sha256(_candidate) == _digest;\\n    }\\n\\n    /// @notice             checks if a message is the keccak256 preimage of a digest\\n    /// @dev                this step is necessary for ECDSA security!\\n    /// @param _digest      the digest\\n    /// @param _candidate   the purported preimage\\n    /// @return             true if the preimage matches the digest, else false\\n    function isKeccak256Preimage(\\n        bytes memory _candidate,\\n        bytes32 _digest\\n    ) internal pure returns (bool) {\\n        return keccak256(_candidate) == _digest;\\n    }\\n\\n    /// @notice                 calculates the signature hash of a Bitcoin transaction with the provided details\\n    /// @dev                    documented in bip143. many values are hardcoded here\\n    /// @param _outpoint        the bitcoin UTXO id (32-byte txid + 4-byte output index)\\n    /// @param _inputPKH        the input pubkeyhash (hash160(sender_pubkey))\\n    /// @param _inputValue      the value of the input in satoshi\\n    /// @param _outputValue     the value of the output in satoshi\\n    /// @param _outputScript    the length-prefixed output script\\n    /// @return                 the double-sha256 (hash256) signature hash as defined by bip143\\n    function wpkhSpendSighash(\\n        bytes memory _outpoint,  // 36-byte UTXO id\\n        bytes20 _inputPKH,       // 20-byte hash160\\n        bytes8 _inputValue,      // 8-byte LE\\n        bytes8 _outputValue,     // 8-byte LE\\n        bytes memory _outputScript    // lenght-prefixed output script\\n    ) internal view returns (bytes32) {\\n        // Fixes elements to easily make a 1-in 1-out sighash digest\\n        // Does not support timelocks\\n        // bytes memory _scriptCode = abi.encodePacked(\\n        //     hex\\\"1976a914\\\",  // length, dup, hash160, pkh_length\\n        //     _inputPKH,\\n        //     hex\\\"88ac\\\");  // equal, checksig\\n\\n        bytes32 _hashOutputs = abi.encodePacked(\\n            _outputValue,  // 8-byte LE\\n            _outputScript).hash256View();\\n\\n        bytes memory _sighashPreimage = abi.encodePacked(\\n            hex\\\"01000000\\\",  // version\\n            _outpoint.hash256View(),  // hashPrevouts\\n            hex\\\"8cb9012517c817fead650287d61bdd9c68803b6bf9c64133dcab3e65b5a50cb9\\\",  // hashSequence(00000000)\\n            _outpoint,  // outpoint\\n            // p2wpkh script code\\n            hex\\\"1976a914\\\",  // length, dup, hash160, pkh_length\\n            _inputPKH,\\n            hex\\\"88ac\\\",  // equal, checksig\\n            // end script code\\n            _inputValue,  // value of the input in 8-byte LE\\n            hex\\\"00000000\\\",  // input nSequence\\n            _hashOutputs,  // hash of the single output\\n            hex\\\"00000000\\\",  // nLockTime\\n            hex\\\"01000000\\\"  // SIGHASH_ALL\\n        );\\n        return _sighashPreimage.hash256View();\\n    }\\n\\n    /// @notice                 calculates the signature hash of a Bitcoin transaction with the provided details\\n    /// @dev                    documented in bip143. many values are hardcoded here\\n    /// @param _outpoint        the bitcoin UTXO id (32-byte txid + 4-byte output index)\\n    /// @param _inputPKH        the input pubkeyhash (hash160(sender_pubkey))\\n    /// @param _inputValue      the value of the input in satoshi\\n    /// @param _outputValue     the value of the output in satoshi\\n    /// @param _outputPKH       the output pubkeyhash (hash160(recipient_pubkey))\\n    /// @return                 the double-sha256 (hash256) signature hash as defined by bip143\\n    function wpkhToWpkhSighash(\\n        bytes memory _outpoint,  // 36-byte UTXO id\\n        bytes20 _inputPKH,  // 20-byte hash160\\n        bytes8 _inputValue,  // 8-byte LE\\n        bytes8 _outputValue,  // 8-byte LE\\n        bytes20 _outputPKH  // 20-byte hash160\\n    ) internal view returns (bytes32) {\\n        return wpkhSpendSighash(\\n            _outpoint,\\n            _inputPKH,\\n            _inputValue,\\n            _outputValue,\\n            abi.encodePacked(\\n              hex\\\"160014\\\",  // wpkh tag\\n              _outputPKH)\\n            );\\n    }\\n\\n    /// @notice                 Preserved for API compatibility with older version\\n    /// @dev                    documented in bip143. many values are hardcoded here\\n    /// @param _outpoint        the bitcoin UTXO id (32-byte txid + 4-byte output index)\\n    /// @param _inputPKH        the input pubkeyhash (hash160(sender_pubkey))\\n    /// @param _inputValue      the value of the input in satoshi\\n    /// @param _outputValue     the value of the output in satoshi\\n    /// @param _outputPKH       the output pubkeyhash (hash160(recipient_pubkey))\\n    /// @return                 the double-sha256 (hash256) signature hash as defined by bip143\\n    function oneInputOneOutputSighash(\\n        bytes memory _outpoint,  // 36-byte UTXO id\\n        bytes20 _inputPKH,  // 20-byte hash160\\n        bytes8 _inputValue,  // 8-byte LE\\n        bytes8 _outputValue,  // 8-byte LE\\n        bytes20 _outputPKH  // 20-byte hash160\\n    ) internal view returns (bytes32) {\\n        return wpkhToWpkhSighash(_outpoint, _inputPKH, _inputValue, _outputValue, _outputPKH);\\n    }\\n\\n}\\n\",\"keccak256\":\"0xfffbd5486af77058fe9385d63d433da914a043994b1affdfcb87248aa10a234c\"},\"@keep-network/bitcoin-spv-sol/contracts/SafeMath.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\nThe MIT License (MIT)\\n\\nCopyright (c) 2016 Smart Contract Solutions, Inc.\\n\\nPermission is hereby granted, free of charge, to any person obtaining\\na copy of this software and associated documentation files (the\\n\\\"Software\\\"), to deal in the Software without restriction, including\\nwithout limitation the rights to use, copy, modify, merge, publish,\\ndistribute, sublicense, and/or sell copies of the Software, and to\\npermit persons to whom the Software is furnished to do so, subject to\\nthe following conditions:\\n\\nThe above copyright notice and this permission notice shall be included\\nin all copies or substantial portions of the Software.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\\nOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n*/\\n\\n\\n/**\\n * @title SafeMath\\n * @dev Math operations with safety checks that throw on error\\n */\\nlibrary SafeMath {\\n\\n    /**\\n     * @dev Multiplies two numbers, throws on overflow.\\n     */\\n    function mul(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        // Gas optimization: this is cheaper than asserting 'a' not being zero, but the\\n        // benefit is lost if 'b' is also tested.\\n        // See: https://github.com/OpenZeppelin/openzeppelin-solidity/pull/522\\n        if (_a == 0) {\\n            return 0;\\n        }\\n\\n        c = _a * _b;\\n        require(c / _a == _b, \\\"Overflow during multiplication.\\\");\\n        return c;\\n    }\\n\\n    /**\\n     * @dev Integer division of two numbers, truncating the quotient.\\n     */\\n    function div(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        // assert(_b > 0); // Solidity automatically throws when dividing by 0\\n        // uint256 c = _a / _b;\\n        // assert(_a == _b * c + _a % _b); // There is no case in which this doesn't hold\\n        return _a / _b;\\n    }\\n\\n    /**\\n     * @dev Subtracts two numbers, throws on overflow (i.e. if subtrahend is greater than minuend).\\n     */\\n    function sub(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        require(_b <= _a, \\\"Underflow during subtraction.\\\");\\n        return _a - _b;\\n    }\\n\\n    /**\\n     * @dev Adds two numbers, throws on overflow.\\n     */\\n    function add(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        c = _a + _b;\\n        require(c >= _a, \\\"Overflow during addition.\\\");\\n        return c;\\n    }\\n}\\n\",\"keccak256\":\"0x35930d982394c7ffde439b82e5e696c5b21a6f09699d44861dfe409ef64084a3\"},\"@keep-network/bitcoin-spv-sol/contracts/ValidateSPV.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title ValidateSPV*/\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {SafeMath} from \\\"./SafeMath.sol\\\";\\nimport {BTCUtils} from \\\"./BTCUtils.sol\\\";\\n\\n\\nlibrary ValidateSPV {\\n\\n    using BTCUtils for bytes;\\n    using BTCUtils for uint256;\\n    using BytesLib for bytes;\\n    using SafeMath for uint256;\\n\\n    enum InputTypes { NONE, LEGACY, COMPATIBILITY, WITNESS }\\n    enum OutputTypes { NONE, WPKH, WSH, OP_RETURN, PKH, SH, NONSTANDARD }\\n\\n    uint256 constant ERR_BAD_LENGTH = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;\\n    uint256 constant ERR_INVALID_CHAIN = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe;\\n    uint256 constant ERR_LOW_WORK = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffd;\\n\\n    function getErrBadLength() internal pure returns (uint256) {\\n        return ERR_BAD_LENGTH;\\n    }\\n\\n    function getErrInvalidChain() internal pure returns (uint256) {\\n        return ERR_INVALID_CHAIN;\\n    }\\n\\n    function getErrLowWork() internal pure returns (uint256) {\\n        return ERR_LOW_WORK;\\n    }\\n\\n    /// @notice                     Validates a tx inclusion in the block\\n    /// @dev                        `index` is not a reliable indicator of location within a block\\n    /// @param _txid                The txid (LE)\\n    /// @param _merkleRoot          The merkle root (as in the block header)\\n    /// @param _intermediateNodes   The proof's intermediate nodes (digests between leaf and root)\\n    /// @param _index               The leaf's index in the tree (0-indexed)\\n    /// @return                     true if fully valid, false otherwise\\n    function prove(\\n        bytes32 _txid,\\n        bytes32 _merkleRoot,\\n        bytes memory _intermediateNodes,\\n        uint _index\\n    ) internal view returns (bool) {\\n        // Shortcut the empty-block case\\n        if (_txid == _merkleRoot && _index == 0 && _intermediateNodes.length == 0) {\\n            return true;\\n        }\\n\\n        // If the Merkle proof failed, bubble up error\\n        return BTCUtils.verifyHash256Merkle(\\n            _txid,\\n            _intermediateNodes,\\n            _merkleRoot,\\n            _index\\n        );\\n    }\\n\\n    /// @notice             Hashes transaction to get txid\\n    /// @dev                Supports Legacy and Witness\\n    /// @param _version     4-bytes version\\n    /// @param _vin         Raw bytes length-prefixed input vector\\n    /// @param _vout        Raw bytes length-prefixed output vector\\n    /// @param _locktime    4-byte tx locktime\\n    /// @return             32-byte transaction id, little endian\\n    function calculateTxId(\\n        bytes4 _version,\\n        bytes memory _vin,\\n        bytes memory _vout,\\n        bytes4 _locktime\\n    ) internal view returns (bytes32) {\\n        // Get transaction hash double-Sha256(version + nIns + inputs + nOuts + outputs + locktime)\\n        return abi.encodePacked(_version, _vin, _vout, _locktime).hash256View();\\n    }\\n\\n    /// @notice                  Checks validity of header chain\\n    /// @notice                  Compares the hash of each header to the prevHash in the next header\\n    /// @param _headers          Raw byte array of header chain\\n    /// @return _totalDifficulty The total accumulated difficulty of the header chain, or an error code\\n    function validateHeaderChain(bytes memory _headers) internal view returns (uint256 _totalDifficulty) {\\n\\n        // Check header chain length\\n        if (_headers.length % 80 != 0) {return ERR_BAD_LENGTH;}\\n\\n        // Initialize header start index\\n        bytes32 _digest;\\n\\n        _totalDifficulty = 0;\\n\\n        bytes memory _header;\\n\\n        // Allocate _header with extra space after it to fit 3 full words\\n        assembly {\\n            _header := mload(0x40)\\n            mstore(0x40, add(_header, add(32, 96)))\\n            mstore(_header, 80)\\n        }\\n\\n        for (uint256 _start = 0; _start < _headers.length; _start += 80) {\\n\\n            // ith header start index and ith header\\n            _headers.sliceInPlace(_header, _start);\\n\\n            // After the first header, check that headers are in a chain\\n            if (_start != 0) {\\n                if (!validateHeaderPrevHash(_header, _digest)) {return ERR_INVALID_CHAIN;}\\n            }\\n\\n            // ith header target\\n            uint256 _target = _header.extractTarget();\\n\\n            // Require that the header has sufficient work\\n            _digest = _header.hash256View();\\n            if(uint256(_digest).reverseUint256() > _target) {\\n                return ERR_LOW_WORK;\\n            }\\n\\n            // Add ith header difficulty to difficulty sum\\n            _totalDifficulty = _totalDifficulty.add(_target.calculateDifficulty());\\n        }\\n    }\\n\\n    /// @notice             Checks validity of header work\\n    /// @param _digest      Header digest\\n    /// @param _target      The target threshold\\n    /// @return             true if header work is valid, false otherwise\\n    function validateHeaderWork(bytes32 _digest, uint256 _target) internal pure returns (bool) {\\n        if (_digest == bytes32(0)) {return false;}\\n        return (uint256(_digest).reverseUint256() < _target);\\n    }\\n\\n    /// @notice                     Checks validity of header chain\\n    /// @dev                        Compares current header prevHash to previous header's digest\\n    /// @param _header              The raw bytes header\\n    /// @param _prevHeaderDigest    The previous header's digest\\n    /// @return                     true if the connect is valid, false otherwise\\n    function validateHeaderPrevHash(bytes memory _header, bytes32 _prevHeaderDigest) internal pure returns (bool) {\\n\\n        // Extract prevHash of current header\\n        bytes32 _prevHash = _header.extractPrevBlockLE();\\n\\n        // Compare prevHash of current header to previous header's digest\\n        if (_prevHash != _prevHeaderDigest) {return false;}\\n\\n        return true;\\n    }\\n}\\n\",\"keccak256\":\"0x504c3de02695728018b1f54d0b0f3abdae11624305c8985f541f8f79eea5eeb4\"},\"@keep-network/ecdsa/contracts/EcdsaDkgValidator.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//                           Trust math, not hardware.\\n\\n// Initial version copied from Keep Network Random Beacon:\\n// https://github.com/keep-network/keep-core/blob/5138c7628868dbeed3ae2164f76fccc6c1fbb9e8/solidity/random-beacon/contracts/DKGValidator.sol\\n//\\n// With the following differences:\\n// - group public key length,\\n// - group size and related thresholds,\\n// - documentation.\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\\\";\\nimport \\\"@keep-network/random-beacon/contracts/libraries/BytesLib.sol\\\";\\nimport \\\"@keep-network/sortition-pools/contracts/SortitionPool.sol\\\";\\nimport \\\"./libraries/EcdsaDkg.sol\\\";\\n\\n/// @title DKG result validator\\n/// @notice EcdsaDkgValidator allows performing a full validation of DKG result,\\n///         including checking the format of fields in the result, declared\\n///         selected group members, and signatures of operators supporting the\\n///         result. The operator submitting the result should perform the\\n///         validation using a free contract call before submitting the result\\n///         to ensure their result is valid and can not be challenged. All other\\n///         network operators should perform validation of the submitted result\\n///         using a free contract call and challenge the result if the\\n///         validation fails.\\ncontract EcdsaDkgValidator {\\n    using BytesLib for bytes;\\n    using ECDSA for bytes32;\\n\\n    /// @dev Size of a group in DKG.\\n    uint256 public constant groupSize = 100;\\n\\n    /// @dev The minimum number of group members needed to interact according to\\n    ///      the protocol to produce a signature. The adversary can not learn\\n    ///      anything about the key as long as it does not break into\\n    ///      groupThreshold+1 of members.\\n    uint256 public constant groupThreshold = 51;\\n\\n    /// @dev The minimum number of active and properly behaving group members\\n    ///      during the DKG needed to accept the result. This number is higher\\n    ///      than `groupThreshold` to keep a safety margin for members becoming\\n    ///      inactive after DKG so that the group can still produce signature.\\n    uint256 public constant activeThreshold = 90; // 90% of groupSize\\n\\n    /// @dev Size in bytes of a public key produced by group members during the\\n    /// the DKG. The length assumes uncompressed ECDSA public key.\\n    uint256 public constant publicKeyByteSize = 64;\\n\\n    /// @dev Size in bytes of a single signature produced by operator supporting\\n    ///      DKG result.\\n    uint256 public constant signatureByteSize = 65;\\n\\n    SortitionPool public sortitionPool;\\n\\n    constructor(SortitionPool _sortitionPool) {\\n        sortitionPool = _sortitionPool;\\n    }\\n\\n    /// @notice Performs a full validation of DKG result, including checking the\\n    ///         format of fields in the result, declared selected group members,\\n    ///         and signatures of operators supporting the result.\\n    /// @param seed seed used to start the DKG and select group members\\n    /// @param startBlock DKG start block\\n    /// @return isValid true if the result is valid, false otherwise\\n    /// @return errorMsg validation error message; empty for a valid result\\n    function validate(\\n        EcdsaDkg.Result calldata result,\\n        uint256 seed,\\n        uint256 startBlock\\n    ) external view returns (bool isValid, string memory errorMsg) {\\n        (bool hasValidFields, string memory error) = validateFields(result);\\n        if (!hasValidFields) {\\n            return (false, error);\\n        }\\n\\n        if (!validateSignatures(result, startBlock)) {\\n            return (false, \\\"Invalid signatures\\\");\\n        }\\n\\n        if (!validateGroupMembers(result, seed)) {\\n            return (false, \\\"Invalid group members\\\");\\n        }\\n\\n        // At this point all group members and misbehaved members were verified\\n        if (!validateMembersHash(result)) {\\n            return (false, \\\"Invalid members hash\\\");\\n        }\\n\\n        return (true, \\\"\\\");\\n    }\\n\\n    /// @notice Performs a static validation of DKG result fields: lengths,\\n    ///         ranges, and order of arrays.\\n    /// @return isValid true if the result is valid, false otherwise\\n    /// @return errorMsg validation error message; empty for a valid result\\n    function validateFields(EcdsaDkg.Result calldata result)\\n        public\\n        view\\n        returns (bool isValid, string memory errorMsg)\\n    {\\n        if (result.groupPubKey.length != publicKeyByteSize) {\\n            return (false, \\\"Malformed group public key\\\");\\n        }\\n\\n        // The number of misbehaved members can not exceed the threshold.\\n        // Misbehaved member indices needs to be unique, between [1, groupSize],\\n        // and sorted in ascending order.\\n        uint8[] calldata misbehavedMembersIndices = result\\n            .misbehavedMembersIndices;\\n        if (groupSize - misbehavedMembersIndices.length < activeThreshold) {\\n            return (false, \\\"Too many members misbehaving during DKG\\\");\\n        }\\n        if (misbehavedMembersIndices.length > 1) {\\n            if (\\n                misbehavedMembersIndices[0] < 1 ||\\n                misbehavedMembersIndices[misbehavedMembersIndices.length - 1] >\\n                groupSize\\n            ) {\\n                return (false, \\\"Corrupted misbehaved members indices\\\");\\n            }\\n            for (uint256 i = 1; i < misbehavedMembersIndices.length; i++) {\\n                if (\\n                    misbehavedMembersIndices[i - 1] >=\\n                    misbehavedMembersIndices[i]\\n                ) {\\n                    return (false, \\\"Corrupted misbehaved members indices\\\");\\n                }\\n            }\\n        }\\n\\n        // Each signature needs to have a correct length and signatures need to\\n        // be provided.\\n        uint256 signaturesCount = result.signatures.length / signatureByteSize;\\n        if (result.signatures.length == 0) {\\n            return (false, \\\"No signatures provided\\\");\\n        }\\n        if (result.signatures.length % signatureByteSize != 0) {\\n            return (false, \\\"Malformed signatures array\\\");\\n        }\\n\\n        // We expect the same amount of signatures as the number of declared\\n        // group member indices that signed the result.\\n        uint256[] calldata signingMembersIndices = result.signingMembersIndices;\\n        if (signaturesCount != signingMembersIndices.length) {\\n            return (false, \\\"Unexpected signatures count\\\");\\n        }\\n        if (signaturesCount < groupThreshold) {\\n            return (false, \\\"Too few signatures\\\");\\n        }\\n        if (signaturesCount > groupSize) {\\n            return (false, \\\"Too many signatures\\\");\\n        }\\n\\n        // Signing member indices needs to be unique, between [1,groupSize],\\n        // and sorted in ascending order.\\n        if (\\n            signingMembersIndices[0] < 1 ||\\n            signingMembersIndices[signingMembersIndices.length - 1] > groupSize\\n        ) {\\n            return (false, \\\"Corrupted signing member indices\\\");\\n        }\\n        for (uint256 i = 1; i < signingMembersIndices.length; i++) {\\n            if (signingMembersIndices[i - 1] >= signingMembersIndices[i]) {\\n                return (false, \\\"Corrupted signing member indices\\\");\\n            }\\n        }\\n\\n        return (true, \\\"\\\");\\n    }\\n\\n    /// @notice Performs validation of group members as declared in DKG\\n    ///         result against group members selected by the sortition pool.\\n    /// @param seed seed used to start the DKG and select group members\\n    /// @return true if group members matches; false otherwise\\n    function validateGroupMembers(EcdsaDkg.Result calldata result, uint256 seed)\\n        public\\n        view\\n        returns (bool)\\n    {\\n        uint32[] calldata resultMembers = result.members;\\n        uint32[] memory actualGroupMembers = sortitionPool.selectGroup(\\n            groupSize,\\n            bytes32(seed)\\n        );\\n        if (resultMembers.length != actualGroupMembers.length) {\\n            return false;\\n        }\\n        for (uint256 i = 0; i < resultMembers.length; i++) {\\n            if (resultMembers[i] != actualGroupMembers[i]) {\\n                return false;\\n            }\\n        }\\n        return true;\\n    }\\n\\n    /// @notice Performs validation of signatures supplied in DKG result.\\n    ///         Note that this function does not check if addresses which\\n    ///         supplied signatures supporting the result are the ones selected\\n    ///         to the group by sortition pool. This function should be used\\n    ///         together with `validateGroupMembers`.\\n    /// @param startBlock DKG start block\\n    /// @return true if group members matches; false otherwise\\n    function validateSignatures(\\n        EcdsaDkg.Result calldata result,\\n        uint256 startBlock\\n    ) public view returns (bool) {\\n        bytes32 hash = keccak256(\\n            abi.encodePacked(\\n                result.groupPubKey,\\n                result.misbehavedMembersIndices,\\n                startBlock\\n            )\\n        ).toEthSignedMessageHash();\\n\\n        uint256[] calldata signingMembersIndices = result.signingMembersIndices;\\n        uint32[] memory signingMemberIds = new uint32[](\\n            signingMembersIndices.length\\n        );\\n        for (uint256 i = 0; i < signingMembersIndices.length; i++) {\\n            signingMemberIds[i] = result.members[signingMembersIndices[i] - 1];\\n        }\\n\\n        address[] memory signingMemberAddresses = sortitionPool.getIDOperators(\\n            signingMemberIds\\n        );\\n\\n        bytes memory current; // Current signature to be checked.\\n\\n        uint256 signaturesCount = result.signatures.length / signatureByteSize;\\n        for (uint256 i = 0; i < signaturesCount; i++) {\\n            current = result.signatures.slice(\\n                signatureByteSize * i,\\n                signatureByteSize\\n            );\\n            address recoveredAddress = hash.recover(current);\\n\\n            if (signingMemberAddresses[i] != recoveredAddress) {\\n                return false;\\n            }\\n        }\\n\\n        return true;\\n    }\\n\\n    /// @notice Performs validation of hashed group members that actively took\\n    ///         part in DKG.\\n    /// @param result DKG result\\n    /// @return true if calculated result's group members hash matches with the\\n    /// one that is challenged.\\n    function validateMembersHash(EcdsaDkg.Result calldata result)\\n        public\\n        view\\n        returns (bool)\\n    {\\n        if (result.misbehavedMembersIndices.length > 0) {\\n            // members that generated a group signing key\\n            uint32[] memory groupMembers = new uint32[](\\n                result.members.length - result.misbehavedMembersIndices.length\\n            );\\n            uint256 k = 0; // misbehaved members counter\\n            uint256 j = 0; // group members counter\\n            for (uint256 i = 0; i < result.members.length; i++) {\\n                // misbehaved member indices start from 1, so we need to -1 on misbehaved\\n                if (i != result.misbehavedMembersIndices[k] - 1) {\\n                    groupMembers[j] = result.members[i];\\n                    j++;\\n                } else if (k < result.misbehavedMembersIndices.length - 1) {\\n                    k++;\\n                }\\n            }\\n\\n            return keccak256(abi.encode(groupMembers)) == result.membersHash;\\n        }\\n\\n        return keccak256(abi.encode(result.members)) == result.membersHash;\\n    }\\n}\\n\",\"keccak256\":\"0x03f6dca16ca31db65b537860005e0b34fcc7013eca5113ceeb0baae494a7e4a7\",\"license\":\"MIT\"},\"@keep-network/ecdsa/contracts/api/IWalletRegistry.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//                           Trust math, not hardware.\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"../libraries/EcdsaDkg.sol\\\";\\n\\ninterface IWalletRegistry {\\n    /// @notice Requests a new wallet creation.\\n    /// @dev Only the Wallet Owner can call this function.\\n    function requestNewWallet() external;\\n\\n    /// @notice Closes an existing wallet.\\n    /// @param walletID ID of the wallet.\\n    /// @dev Only the Wallet Owner can call this function.\\n    function closeWallet(bytes32 walletID) external;\\n\\n    /// @notice Adds all signing group members of the wallet with the given ID\\n    ///         to the slashing queue of the staking contract. The notifier will\\n    ///         receive reward per each group member from the staking contract\\n    ///         notifiers treasury. The reward is scaled by the\\n    ///         `rewardMultiplier` provided as a parameter.\\n    /// @param amount Amount of tokens to seize from each signing group member\\n    /// @param rewardMultiplier Fraction of the staking contract notifiers\\n    ///        reward the notifier should receive; should be between [0, 100]\\n    /// @param notifier Address of the misbehavior notifier\\n    /// @param walletID ID of the wallet\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @dev Only the Wallet Owner can call this function.\\n    ///      Requirements:\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events.\\n    ///      - `rewardMultiplier` must be between [0, 100].\\n    ///      - This function does revert if staking contract call reverts.\\n    ///        The calling code needs to handle the potential revert.\\n    function seize(\\n        uint96 amount,\\n        uint256 rewardMultiplier,\\n        address notifier,\\n        bytes32 walletID,\\n        uint32[] calldata walletMembersIDs\\n    ) external;\\n\\n    /// @notice Gets public key of a wallet with a given wallet ID.\\n    ///         The public key is returned in an uncompressed format as a 64-byte\\n    ///         concatenation of X and Y coordinates.\\n    /// @param walletID ID of the wallet.\\n    /// @return Uncompressed public key of the wallet.\\n    function getWalletPublicKey(bytes32 walletID)\\n        external\\n        view\\n        returns (bytes memory);\\n\\n    /// @notice Check current wallet creation state.\\n    function getWalletCreationState() external view returns (EcdsaDkg.State);\\n\\n    /// @notice Checks whether the given operator is a member of the given\\n    ///         wallet signing group.\\n    /// @param walletID ID of the wallet\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @param operator Address of the checked operator\\n    /// @param walletMemberIndex Position of the operator in the wallet signing\\n    ///        group members list\\n    /// @return True - if the operator is a member of the given wallet signing\\n    ///         group. False - otherwise.\\n    /// @dev Requirements:\\n    ///      - The `operator` parameter must be an actual sortition pool operator.\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events.\\n    ///      - The `walletMemberIndex` must be in range [1, walletMembersIDs.length]\\n    function isWalletMember(\\n        bytes32 walletID,\\n        uint32[] calldata walletMembersIDs,\\n        address operator,\\n        uint256 walletMemberIndex\\n    ) external view returns (bool);\\n}\\n\",\"keccak256\":\"0x18f1f76f6b59dedf00ab6d79872589e349d28d8e527a754d0e215a57deb67e89\",\"license\":\"MIT\"},\"@keep-network/ecdsa/contracts/libraries/EcdsaDkg.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//\\n\\n// Initial version copied from Keep Network Random Beacon:\\n// https://github.com/keep-network/keep-core/blob/5138c7628868dbeed3ae2164f76fccc6c1fbb9e8/solidity/random-beacon/contracts/libraries/DKG.sol\\n//\\n// With the following differences:\\n// - the group size was set to 100,\\n// - offchainDkgTimeout was removed,\\n// - submission eligibility verification is not performed on-chain,\\n// - submission eligibility delay was replaced with a submission timeout,\\n// - seed timeout notification requires seedTimeout period to pass.\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\\\";\\nimport \\\"@keep-network/sortition-pools/contracts/SortitionPool.sol\\\";\\nimport \\\"@keep-network/random-beacon/contracts/libraries/BytesLib.sol\\\";\\nimport \\\"../EcdsaDkgValidator.sol\\\";\\n\\nlibrary EcdsaDkg {\\n    using BytesLib for bytes;\\n    using ECDSA for bytes32;\\n\\n    struct Parameters {\\n        // Time in blocks during which a seed is expected to be delivered.\\n        // DKG starts only after a seed is delivered. The time the contract\\n        // awaits for a seed is not included in the DKG timeout.\\n        uint256 seedTimeout;\\n        // Time in blocks during which a submitted result can be challenged.\\n        uint256 resultChallengePeriodLength;\\n        // Time in blocks during which a result is expected to be submitted.\\n        uint256 resultSubmissionTimeout;\\n        // Time in blocks during which only the result submitter is allowed to\\n        // approve it. Once this period ends and the submitter have not approved\\n        // the result, anyone can do it.\\n        uint256 submitterPrecedencePeriodLength;\\n    }\\n\\n    struct Data {\\n        // Address of the Sortition Pool contract.\\n        SortitionPool sortitionPool;\\n        // Address of the EcdsaDkgValidator contract.\\n        EcdsaDkgValidator dkgValidator;\\n        // DKG parameters. The parameters should persist between DKG executions.\\n        // They should be updated with dedicated set functions only when DKG is not\\n        // in progress.\\n        Parameters parameters;\\n        // Time in block at which DKG state was locked.\\n        uint256 stateLockBlock;\\n        // Time in blocks at which DKG started.\\n        uint256 startBlock;\\n        // Seed used to start DKG.\\n        uint256 seed;\\n        // Time in blocks that should be added to result submission eligibility\\n        // delay calculation. It is used in case of a challenge to adjust\\n        // DKG timeout calculation.\\n        uint256 resultSubmissionStartBlockOffset;\\n        // Hash of submitted DKG result.\\n        bytes32 submittedResultHash;\\n        // Block number from the moment of the DKG result submission.\\n        uint256 submittedResultBlock;\\n    }\\n\\n    /// @notice DKG result.\\n    struct Result {\\n        // Claimed submitter candidate group member index.\\n        // Must be in range [1, groupSize].\\n        uint256 submitterMemberIndex;\\n        // Generated candidate group public key\\n        bytes groupPubKey;\\n        // Array of misbehaved members indices (disqualified or inactive).\\n        // Indices must be in range [1, groupSize], unique, and sorted in ascending\\n        // order.\\n        uint8[] misbehavedMembersIndices;\\n        // Concatenation of signatures from members supporting the result.\\n        // The message to be signed by each member is keccak256 hash of the\\n        // calculated group public key, misbehaved members indices and DKG\\n        // start block. The calculated hash should be prefixed with prefixed with\\n        // `\\\\x19Ethereum signed message:\\\\n` before signing, so the message to\\n        // sign is:\\n        // `\\\\x19Ethereum signed message:\\\\n${keccak256(\\n        //    groupPubKey, misbehavedMembersIndices, dkgStartBlock\\n        // )}`\\n        bytes signatures;\\n        // Indices of members corresponding to each signature. Indices must be\\n        // be in range [1, groupSize], unique, and sorted in ascending order.\\n        uint256[] signingMembersIndices;\\n        // Identifiers of candidate group members as outputted by the group\\n        // selection protocol.\\n        uint32[] members;\\n        // Keccak256 hash of group members identifiers that actively took part\\n        // in DKG (excluding IA/DQ members).\\n        bytes32 membersHash;\\n    }\\n\\n    /// @notice States for phases of group creation. The states doesn't include\\n    ///         timeouts which should be tracked and notified individually.\\n    enum State {\\n        // Group creation is not in progress. It is a state set after group creation\\n        // completion either by timeout or by a result approval.\\n        IDLE,\\n        // Group creation is awaiting the seed and sortition pool is locked.\\n        AWAITING_SEED,\\n        // DKG protocol execution is in progress. A result is being calculated\\n        // by the clients in this state and the contract awaits a result submission.\\n        // This is a state to which group creation returns in case of a result\\n        // challenge notification.\\n        AWAITING_RESULT,\\n        // DKG result was submitted and awaits an approval or a challenge. If a result\\n        // gets challenge the state returns to `AWAITING_RESULT`. If a result gets\\n        // approval the state changes to `IDLE`.\\n        CHALLENGE\\n    }\\n\\n    /// @dev Size of a group in ECDSA wallet.\\n    uint256 public constant groupSize = 100;\\n\\n    event DkgStarted(uint256 indexed seed);\\n\\n    // To recreate the members that actively took part in dkg, the selected members\\n    // array should be filtered out from misbehavedMembersIndices.\\n    event DkgResultSubmitted(\\n        bytes32 indexed resultHash,\\n        uint256 indexed seed,\\n        Result result\\n    );\\n\\n    event DkgTimedOut();\\n\\n    event DkgResultApproved(\\n        bytes32 indexed resultHash,\\n        address indexed approver\\n    );\\n\\n    event DkgResultChallenged(\\n        bytes32 indexed resultHash,\\n        address indexed challenger,\\n        string reason\\n    );\\n\\n    event DkgStateLocked();\\n\\n    event DkgSeedTimedOut();\\n\\n    /// @notice Initializes SortitionPool and EcdsaDkgValidator addresses.\\n    ///        Can be performed only once.\\n    /// @param _sortitionPool Sortition Pool reference\\n    /// @param _dkgValidator EcdsaDkgValidator reference\\n    function init(\\n        Data storage self,\\n        SortitionPool _sortitionPool,\\n        EcdsaDkgValidator _dkgValidator\\n    ) internal {\\n        require(\\n            address(self.sortitionPool) == address(0),\\n            \\\"Sortition Pool address already set\\\"\\n        );\\n\\n        require(\\n            address(self.dkgValidator) == address(0),\\n            \\\"DKG Validator address already set\\\"\\n        );\\n\\n        self.sortitionPool = _sortitionPool;\\n        self.dkgValidator = _dkgValidator;\\n    }\\n\\n    /// @notice Determines the current state of group creation. It doesn't take\\n    ///         timeouts into consideration. The timeouts should be tracked and\\n    ///         notified separately.\\n    function currentState(Data storage self)\\n        internal\\n        view\\n        returns (State state)\\n    {\\n        state = State.IDLE;\\n\\n        if (self.sortitionPool.isLocked()) {\\n            state = State.AWAITING_SEED;\\n\\n            if (self.startBlock > 0) {\\n                state = State.AWAITING_RESULT;\\n\\n                if (self.submittedResultBlock > 0) {\\n                    state = State.CHALLENGE;\\n                }\\n            }\\n        }\\n    }\\n\\n    /// @notice Locks the sortition pool and starts awaiting for the\\n    ///         group creation seed.\\n    function lockState(Data storage self) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        emit DkgStateLocked();\\n\\n        self.sortitionPool.lock();\\n\\n        self.stateLockBlock = block.number;\\n    }\\n\\n    function start(Data storage self, uint256 seed) internal {\\n        require(\\n            currentState(self) == State.AWAITING_SEED,\\n            \\\"Current state is not AWAITING_SEED\\\"\\n        );\\n\\n        emit DkgStarted(seed);\\n\\n        self.startBlock = block.number;\\n        self.seed = seed;\\n    }\\n\\n    /// @notice Allows to submit a DKG result. The submitted result does not go\\n    ///         through a validation and before it gets accepted, it needs to\\n    ///         wait through the challenge period during which everyone has\\n    ///         a chance to challenge the result as invalid one. Submitter of\\n    ///         the result needs to be in the sortition pool and if the result\\n    ///         gets challenged, the submitter will get slashed.\\n    function submitResult(Data storage self, Result calldata result) internal {\\n        require(\\n            currentState(self) == State.AWAITING_RESULT,\\n            \\\"Current state is not AWAITING_RESULT\\\"\\n        );\\n        require(!hasDkgTimedOut(self), \\\"DKG timeout already passed\\\");\\n\\n        SortitionPool sortitionPool = self.sortitionPool;\\n\\n        // Submitter must be an operator in the sortition pool.\\n        // Declared submitter's member index in the DKG result needs to match\\n        // the address calling this function.\\n        require(\\n            sortitionPool.isOperatorInPool(msg.sender),\\n            \\\"Submitter not in the sortition pool\\\"\\n        );\\n        require(\\n            sortitionPool.getIDOperator(\\n                result.members[result.submitterMemberIndex - 1]\\n            ) == msg.sender,\\n            \\\"Unexpected submitter index\\\"\\n        );\\n\\n        self.submittedResultHash = keccak256(abi.encode(result));\\n        self.submittedResultBlock = block.number;\\n\\n        emit DkgResultSubmitted(self.submittedResultHash, self.seed, result);\\n    }\\n\\n    /// @notice Checks if awaiting seed timed out.\\n    /// @return True if awaiting seed timed out, false otherwise.\\n    function hasSeedTimedOut(Data storage self) internal view returns (bool) {\\n        return\\n            currentState(self) == State.AWAITING_SEED &&\\n            block.number > (self.stateLockBlock + self.parameters.seedTimeout);\\n    }\\n\\n    /// @notice Checks if DKG timed out. The DKG timeout period includes time required\\n    ///         for off-chain protocol execution and time for the result publication.\\n    ///         After this time a result cannot be submitted and DKG can be notified\\n    ///         about the timeout. DKG period is adjusted by result submission\\n    ///         offset that include blocks that were mined while invalid result\\n    ///         has been registered until it got challenged.\\n    /// @return True if DKG timed out, false otherwise.\\n    function hasDkgTimedOut(Data storage self) internal view returns (bool) {\\n        return\\n            currentState(self) == State.AWAITING_RESULT &&\\n            block.number >\\n            (self.startBlock +\\n                self.resultSubmissionStartBlockOffset +\\n                self.parameters.resultSubmissionTimeout);\\n    }\\n\\n    /// @notice Notifies about the seed was not delivered and restores the\\n    ///         initial DKG state (IDLE).\\n    function notifySeedTimeout(Data storage self) internal {\\n        require(hasSeedTimedOut(self), \\\"Awaiting seed has not timed out\\\");\\n\\n        emit DkgSeedTimedOut();\\n\\n        complete(self);\\n    }\\n\\n    /// @notice Notifies about DKG timeout.\\n    function notifyDkgTimeout(Data storage self) internal {\\n        require(hasDkgTimedOut(self), \\\"DKG has not timed out\\\");\\n\\n        emit DkgTimedOut();\\n\\n        complete(self);\\n    }\\n\\n    /// @notice Approves DKG result. Can be called when the challenge period for\\n    ///         the submitted result is finished. Considers the submitted result\\n    ///         as valid. For the first `submitterPrecedencePeriodLength`\\n    ///         blocks after the end of the challenge period can be called only\\n    ///         by the DKG result submitter. After that time, can be called by\\n    ///         anyone.\\n    /// @dev Can be called after a challenge period for the submitted result.\\n    /// @param result Result to approve. Must match the submitted result stored\\n    ///        during `submitResult`.\\n    /// @return misbehavedMembers Identifiers of members who misbehaved during DKG.\\n    function approveResult(Data storage self, Result calldata result)\\n        internal\\n        returns (uint32[] memory misbehavedMembers)\\n    {\\n        require(\\n            currentState(self) == State.CHALLENGE,\\n            \\\"Current state is not CHALLENGE\\\"\\n        );\\n\\n        uint256 challengePeriodEnd = self.submittedResultBlock +\\n            self.parameters.resultChallengePeriodLength;\\n\\n        require(\\n            block.number > challengePeriodEnd,\\n            \\\"Challenge period has not passed yet\\\"\\n        );\\n\\n        require(\\n            keccak256(abi.encode(result)) == self.submittedResultHash,\\n            \\\"Result under approval is different than the submitted one\\\"\\n        );\\n\\n        // Extract submitter member address. Submitter member index is in\\n        // range [1, groupSize] so we need to -1 when fetching identifier from members\\n        // array.\\n        address submitterMember = self.sortitionPool.getIDOperator(\\n            result.members[result.submitterMemberIndex - 1]\\n        );\\n\\n        require(\\n            msg.sender == submitterMember ||\\n                block.number >\\n                challengePeriodEnd +\\n                    self.parameters.submitterPrecedencePeriodLength,\\n            \\\"Only the DKG result submitter can approve the result at this moment\\\"\\n        );\\n\\n        // Extract misbehaved members identifiers. Misbehaved members indices\\n        // are in range [1, groupSize], so we need to -1 when fetching identifiers from\\n        // members array.\\n        misbehavedMembers = new uint32[](\\n            result.misbehavedMembersIndices.length\\n        );\\n        for (uint256 i = 0; i < result.misbehavedMembersIndices.length; i++) {\\n            misbehavedMembers[i] = result.members[\\n                result.misbehavedMembersIndices[i] - 1\\n            ];\\n        }\\n\\n        emit DkgResultApproved(self.submittedResultHash, msg.sender);\\n\\n        return misbehavedMembers;\\n    }\\n\\n    /// @notice Challenges DKG result. If the submitted result is proved to be\\n    ///         invalid it reverts the DKG back to the result submission phase.\\n    /// @dev Can be called during a challenge period for the submitted result.\\n    /// @param result Result to challenge. Must match the submitted result\\n    ///        stored during `submitResult`.\\n    /// @return maliciousResultHash Hash of the malicious result.\\n    /// @return maliciousSubmitter Identifier of the malicious submitter.\\n    function challengeResult(Data storage self, Result calldata result)\\n        internal\\n        returns (bytes32 maliciousResultHash, uint32 maliciousSubmitter)\\n    {\\n        require(\\n            currentState(self) == State.CHALLENGE,\\n            \\\"Current state is not CHALLENGE\\\"\\n        );\\n\\n        require(\\n            block.number <=\\n                self.submittedResultBlock +\\n                    self.parameters.resultChallengePeriodLength,\\n            \\\"Challenge period has already passed\\\"\\n        );\\n\\n        require(\\n            keccak256(abi.encode(result)) == self.submittedResultHash,\\n            \\\"Result under challenge is different than the submitted one\\\"\\n        );\\n\\n        // https://github.com/crytic/slither/issues/982\\n        // slither-disable-next-line unused-return\\n        try\\n            self.dkgValidator.validate(result, self.seed, self.startBlock)\\n        returns (\\n            // slither-disable-next-line uninitialized-local,variable-scope\\n            bool isValid,\\n            // slither-disable-next-line uninitialized-local,variable-scope\\n            string memory errorMsg\\n        ) {\\n            if (isValid) {\\n                revert(\\\"unjustified challenge\\\");\\n            }\\n\\n            emit DkgResultChallenged(\\n                self.submittedResultHash,\\n                msg.sender,\\n                errorMsg\\n            );\\n        } catch {\\n            // if the validation reverted we consider the DKG result as invalid\\n            emit DkgResultChallenged(\\n                self.submittedResultHash,\\n                msg.sender,\\n                \\\"validation reverted\\\"\\n            );\\n        }\\n\\n        // Consider result hash as malicious.\\n        maliciousResultHash = self.submittedResultHash;\\n        maliciousSubmitter = result.members[result.submitterMemberIndex - 1];\\n\\n        // Adjust DKG result submission block start, so submission stage starts\\n        // from the beginning.\\n        self.resultSubmissionStartBlockOffset = block.number - self.startBlock;\\n\\n        submittedResultCleanup(self);\\n\\n        return (maliciousResultHash, maliciousSubmitter);\\n    }\\n\\n    /// @notice Checks if DKG result is valid for the current DKG.\\n    /// @param result DKG result.\\n    /// @return True if the result is valid. If the result is invalid it returns\\n    ///         false and an error message.\\n    function isResultValid(Data storage self, Result calldata result)\\n        internal\\n        view\\n        returns (bool, string memory)\\n    {\\n        require(self.startBlock > 0, \\\"DKG has not been started\\\");\\n\\n        return self.dkgValidator.validate(result, self.seed, self.startBlock);\\n    }\\n\\n    /// @notice Set setSeedTimeout parameter.\\n    function setSeedTimeout(Data storage self, uint256 newSeedTimeout)\\n        internal\\n    {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(newSeedTimeout > 0, \\\"New value should be greater than zero\\\");\\n\\n        self.parameters.seedTimeout = newSeedTimeout;\\n    }\\n\\n    /// @notice Set resultChallengePeriodLength parameter.\\n    function setResultChallengePeriodLength(\\n        Data storage self,\\n        uint256 newResultChallengePeriodLength\\n    ) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(\\n            newResultChallengePeriodLength > 0,\\n            \\\"New value should be greater than zero\\\"\\n        );\\n\\n        self\\n            .parameters\\n            .resultChallengePeriodLength = newResultChallengePeriodLength;\\n    }\\n\\n    /// @notice Set resultSubmissionTimeout parameter.\\n    function setResultSubmissionTimeout(\\n        Data storage self,\\n        uint256 newResultSubmissionTimeout\\n    ) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(\\n            newResultSubmissionTimeout > 0,\\n            \\\"New value should be greater than zero\\\"\\n        );\\n\\n        self.parameters.resultSubmissionTimeout = newResultSubmissionTimeout;\\n    }\\n\\n    /// @notice Set submitterPrecedencePeriodLength parameter.\\n    function setSubmitterPrecedencePeriodLength(\\n        Data storage self,\\n        uint256 newSubmitterPrecedencePeriodLength\\n    ) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(\\n            newSubmitterPrecedencePeriodLength <\\n                self.parameters.resultSubmissionTimeout,\\n            \\\"New value should be less than result submission period length\\\"\\n        );\\n\\n        self\\n            .parameters\\n            .submitterPrecedencePeriodLength = newSubmitterPrecedencePeriodLength;\\n    }\\n\\n    /// @notice Completes DKG by cleaning up state.\\n    /// @dev Should be called after DKG times out or a result is approved.\\n    function complete(Data storage self) internal {\\n        delete self.startBlock;\\n        delete self.seed;\\n        delete self.resultSubmissionStartBlockOffset;\\n        submittedResultCleanup(self);\\n        self.sortitionPool.unlock();\\n    }\\n\\n    /// @notice Cleans up submitted result state either after DKG completion\\n    ///         (as part of `complete` method) or after justified challenge.\\n    function submittedResultCleanup(Data storage self) private {\\n        delete self.submittedResultHash;\\n        delete self.submittedResultBlock;\\n    }\\n}\\n\",\"keccak256\":\"0xb3aada6a96598150d042944e675e93381183b01ad258e774e7c94500062db0f9\",\"license\":\"MIT\"},\"@keep-network/random-beacon/contracts/libraries/BytesLib.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//\\n\\npragma solidity ^0.8.9;\\n\\n/*\\nVersion pulled from keep-core v1:\\nhttps://github.com/keep-network/keep-core/blob/f297202db00c027978ad8e7103a356503de5773c/solidity-v1/contracts/utils/BytesLib.sol\\n\\nTo compile it with solidity 0.8 `_preBytes_slot` was replaced with `_preBytes.slot`.\\n*/\\n\\n/*\\nhttps://github.com/GNSPS/solidity-bytes-utils/\\nThis is free and unencumbered software released into the public domain.\\nAnyone is free to copy, modify, publish, use, compile, sell, or\\ndistribute this software, either in source code form or as a compiled\\nbinary, for any purpose, commercial or non-commercial, and by any\\nmeans.\\nIn jurisdictions that recognize copyright laws, the author or authors\\nof this software dedicate any and all copyright interest in the\\nsoftware to the public domain. We make this dedication for the benefit\\nof the public at large and to the detriment of our heirs and\\nsuccessors. We intend this dedication to be an overt act of\\nrelinquishment in perpetuity of all present and future rights to this\\nsoftware under copyright law.\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\nOTHER DEALINGS IN THE SOFTWARE.\\nFor more information, please refer to <https://unlicense.org>\\n*/\\n\\n/** @title BytesLib **/\\n/** @author https://github.com/GNSPS **/\\n\\nlibrary BytesLib {\\n    function concatStorage(bytes storage _preBytes, bytes memory _postBytes)\\n        internal\\n    {\\n        assembly {\\n            // Read the first 32 bytes of _preBytes storage, which is the length\\n            // of the array. (We don't need to use the offset into the slot\\n            // because arrays use the entire slot.)\\n            let fslot := sload(_preBytes.slot)\\n            // Arrays of 31 bytes or less have an even value in their slot,\\n            // while longer arrays have an odd value. The actual length is\\n            // the slot divided by two for odd values, and the lowest order\\n            // byte divided by two for even values.\\n            // If the slot is even, bitwise and the slot with 255 and divide by\\n            // two to get the length. If the slot is odd, bitwise and the slot\\n            // with -1 and divide by two.\\n            let slength := div(\\n                and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)),\\n                2\\n            )\\n            let mlength := mload(_postBytes)\\n            let newlength := add(slength, mlength)\\n            // slength can contain both the length and contents of the array\\n            // if length < 32 bytes so let's prepare for that\\n            // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n            switch add(lt(slength, 32), lt(newlength, 32))\\n            case 2 {\\n                // Since the new array still fits in the slot, we just need to\\n                // update the contents of the slot.\\n                // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length\\n                sstore(\\n                    _preBytes.slot,\\n                    // all the modifications to the slot are inside this\\n                    // next block\\n                    add(\\n                        // we can just add to the slot contents because the\\n                        // bytes we want to change are the LSBs\\n                        fslot,\\n                        add(\\n                            mul(\\n                                div(\\n                                    // load the bytes from memory\\n                                    mload(add(_postBytes, 0x20)),\\n                                    // zero all bytes to the right\\n                                    exp(0x100, sub(32, mlength))\\n                                ),\\n                                // and now shift left the number of bytes to\\n                                // leave space for the length in the slot\\n                                exp(0x100, sub(32, newlength))\\n                            ),\\n                            // increase length by the double of the memory\\n                            // bytes length\\n                            mul(mlength, 2)\\n                        )\\n                    )\\n                )\\n            }\\n            case 1 {\\n                // The stored value fits in the slot, but the combined value\\n                // will exceed it.\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // The contents of the _postBytes array start 32 bytes into\\n                // the structure. Our first read should obtain the `submod`\\n                // bytes that can fit into the unused space in the last word\\n                // of the stored array. To get this, we read 32 bytes starting\\n                // from `submod`, so the data we read overlaps with the array\\n                // contents by `submod` bytes. Masking the lowest-order\\n                // `submod` bytes allows us to add that value directly to the\\n                // stored value.\\n\\n                let submod := sub(32, slength)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(\\n                    sc,\\n                    add(\\n                        and(\\n                            fslot,\\n                            0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00\\n                        ),\\n                        and(mload(mc), mask)\\n                    )\\n                )\\n\\n                for {\\n                    mc := add(mc, 0x20)\\n                    sc := add(sc, 1)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n            default {\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                // Start copying to the last used word of the stored array.\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // Copy over the first `submod` bytes of the new data as in\\n                // case 1 above.\\n                let slengthmod := mod(slength, 32)\\n                let submod := sub(32, slengthmod)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(sc, add(sload(sc), and(mload(mc), mask)))\\n\\n                for {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n        }\\n    }\\n\\n    function equalStorage(bytes storage _preBytes, bytes memory _postBytes)\\n        internal\\n        view\\n        returns (bool)\\n    {\\n        bool success = true;\\n\\n        assembly {\\n            // we know _preBytes_offset is 0\\n            let fslot := sload(_preBytes.slot)\\n            // Decode the length of the stored array like in concatStorage().\\n            let slength := div(\\n                and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)),\\n                2\\n            )\\n            let mlength := mload(_postBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(slength, mlength)\\n            case 1 {\\n                // slength can contain both the length and contents of the array\\n                // if length < 32 bytes so let's prepare for that\\n                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n                if iszero(iszero(slength)) {\\n                    switch lt(slength, 32)\\n                    case 1 {\\n                        // blank the last byte which is the length\\n                        fslot := mul(div(fslot, 0x100), 0x100)\\n\\n                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {\\n                            // unsuccess:\\n                            success := 0\\n                        }\\n                    }\\n                    default {\\n                        // cb is a circuit breaker in the for loop since there's\\n                        //  no said feature for inline assembly loops\\n                        // cb = 1 - don't breaker\\n                        // cb = 0 - break\\n                        let cb := 1\\n\\n                        // get the keccak hash to get the contents of the array\\n                        mstore(0x0, _preBytes.slot)\\n                        let sc := keccak256(0x0, 0x20)\\n\\n                        let mc := add(_postBytes, 0x20)\\n                        let end := add(mc, mlength)\\n\\n                        // the next line is the loop condition:\\n                        // while(uint(mc < end) + cb == 2)\\n                        for {\\n\\n                        } eq(add(lt(mc, end), cb), 2) {\\n                            sc := add(sc, 1)\\n                            mc := add(mc, 0x20)\\n                        } {\\n                            if iszero(eq(sload(sc), mload(mc))) {\\n                                // unsuccess:\\n                                success := 0\\n                                cb := 0\\n                            }\\n                        }\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function concat(bytes memory _preBytes, bytes memory _postBytes)\\n        internal\\n        pure\\n        returns (bytes memory)\\n    {\\n        bytes memory tempBytes;\\n\\n        assembly {\\n            // Get a location of some free memory and store it in tempBytes as\\n            // Solidity does for memory variables.\\n            tempBytes := mload(0x40)\\n\\n            // Store the length of the first bytes array at the beginning of\\n            // the memory for tempBytes.\\n            let length := mload(_preBytes)\\n            mstore(tempBytes, length)\\n\\n            // Maintain a memory counter for the current write location in the\\n            // temp bytes array by adding the 32 bytes for the array length to\\n            // the starting location.\\n            let mc := add(tempBytes, 0x20)\\n            // Stop copying when the memory counter reaches the length of the\\n            // first bytes array.\\n            let end := add(mc, length)\\n\\n            for {\\n                // Initialize a copy counter to the start of the _preBytes data,\\n                // 32 bytes into its memory.\\n                let cc := add(_preBytes, 0x20)\\n            } lt(mc, end) {\\n                // Increase both counters by 32 bytes each iteration.\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                // Write the _preBytes data into the tempBytes memory 32 bytes\\n                // at a time.\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Add the length of _postBytes to the current length of tempBytes\\n            // and store it as the new length in the first 32 bytes of the\\n            // tempBytes memory.\\n            length := mload(_postBytes)\\n            mstore(tempBytes, add(length, mload(tempBytes)))\\n\\n            // Move the memory counter back from a multiple of 0x20 to the\\n            // actual end of the _preBytes data.\\n            mc := end\\n            // Stop copying when the memory counter reaches the new combined\\n            // length of the arrays.\\n            end := add(mc, length)\\n\\n            for {\\n                let cc := add(_postBytes, 0x20)\\n            } lt(mc, end) {\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Update the free-memory pointer by padding our last write location\\n            // to 32 bytes: add 31 bytes to the end of tempBytes to move to the\\n            // next 32 byte block, then round down to the nearest multiple of\\n            // 32. If the sum of the length of the two arrays is zero then add\\n            // one before rounding down to leave a blank 32 bytes (the length block with 0).\\n            mstore(\\n                0x40,\\n                and(\\n                    add(add(end, iszero(add(length, mload(_preBytes)))), 31),\\n                    not(31) // Round down to the nearest 32 bytes.\\n                )\\n            )\\n        }\\n\\n        return tempBytes;\\n    }\\n\\n    function slice(\\n        bytes memory _bytes,\\n        uint256 _start,\\n        uint256 _length\\n    ) internal pure returns (bytes memory res) {\\n        uint256 _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            // Alloc bytes array with additional 32 bytes afterspace and assign it's size\\n            res := mload(0x40)\\n            mstore(0x40, add(add(res, 64), _length))\\n            mstore(res, _length)\\n\\n            // Compute distance between source and destination pointers\\n            let diff := sub(res, add(_bytes, _start))\\n\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n            } {\\n                mstore(add(src, diff), mload(src))\\n            }\\n        }\\n    }\\n\\n    function toAddress(bytes memory _bytes, uint256 _start)\\n        internal\\n        pure\\n        returns (address)\\n    {\\n        uint256 _totalLen = _start + 20;\\n        require(\\n            _totalLen > _start && _bytes.length >= _totalLen,\\n            \\\"Address conversion out of bounds.\\\"\\n        );\\n        address tempAddress;\\n\\n        assembly {\\n            tempAddress := div(\\n                mload(add(add(_bytes, 0x20), _start)),\\n                0x1000000000000000000000000\\n            )\\n        }\\n\\n        return tempAddress;\\n    }\\n\\n    function toUint8(bytes memory _bytes, uint256 _start)\\n        internal\\n        pure\\n        returns (uint8)\\n    {\\n        require(\\n            _bytes.length >= (_start + 1),\\n            \\\"Uint8 conversion out of bounds.\\\"\\n        );\\n        uint8 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x1), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function toUint(bytes memory _bytes, uint256 _start)\\n        internal\\n        pure\\n        returns (uint256)\\n    {\\n        uint256 _totalLen = _start + 32;\\n        require(\\n            _totalLen > _start && _bytes.length >= _totalLen,\\n            \\\"Uint conversion out of bounds.\\\"\\n        );\\n        uint256 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x20), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function equal(bytes memory _preBytes, bytes memory _postBytes)\\n        internal\\n        pure\\n        returns (bool)\\n    {\\n        bool success = true;\\n\\n        assembly {\\n            let length := mload(_preBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(length, mload(_postBytes))\\n            case 1 {\\n                // cb is a circuit breaker in the for loop since there's\\n                //  no said feature for inline assembly loops\\n                // cb = 1 - don't breaker\\n                // cb = 0 - break\\n                let cb := 1\\n\\n                let mc := add(_preBytes, 0x20)\\n                let end := add(mc, length)\\n\\n                for {\\n                    let cc := add(_postBytes, 0x20)\\n                    // the next line is the loop condition:\\n                    // while(uint(mc < end) + cb == 2)\\n                } eq(add(lt(mc, end), cb), 2) {\\n                    mc := add(mc, 0x20)\\n                    cc := add(cc, 0x20)\\n                } {\\n                    // if any of these checks fails then arrays are not equal\\n                    if iszero(eq(mload(mc), mload(cc))) {\\n                        // unsuccess:\\n                        success := 0\\n                        cb := 0\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function toBytes32(bytes memory _source)\\n        internal\\n        pure\\n        returns (bytes32 result)\\n    {\\n        if (_source.length == 0) {\\n            return 0x0;\\n        }\\n\\n        assembly {\\n            result := mload(add(_source, 32))\\n        }\\n    }\\n\\n    function keccak256Slice(\\n        bytes memory _bytes,\\n        uint256 _start,\\n        uint256 _length\\n    ) internal pure returns (bytes32 result) {\\n        uint256 _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            result := keccak256(add(add(_bytes, 32), _start), _length)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xd778546e5ccb131b9dbf25abc4fa8668168b55bae599ffe40f040e7100aa8a35\",\"license\":\"MIT\"},\"@keep-network/sortition-pools/contracts/Branch.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\n/// @notice The implicit 8-ary trees of the sortition pool\\n/// rely on packing 8 \\\"slots\\\" of 32-bit values into each uint256.\\n/// The Branch library permits efficient calculations on these slots.\\nlibrary Branch {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant SLOT_WIDTH = 256 / SLOT_COUNT;\\n  uint256 private constant LAST_SLOT = SLOT_COUNT - 1;\\n  uint256 private constant SLOT_MAX = (2**SLOT_WIDTH) - 1;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  /// @notice Calculate the right shift required\\n  /// to make the 32 least significant bits of an uint256\\n  /// be the bits of the `position`th slot\\n  /// when treating the uint256 as a uint32[8].\\n  ///\\n  /// @dev Not used for efficiency reasons,\\n  /// but left to illustrate the meaning of a common pattern.\\n  /// I wish solidity had macros, even C macros.\\n  function slotShift(uint256 position) internal pure returns (uint256) {\\n    unchecked {\\n      return position * SLOT_WIDTH;\\n    }\\n  }\\n\\n  /// @notice Return the `position`th slot of the `node`,\\n  /// treating `node` as a uint32[32].\\n  function getSlot(uint256 node, uint256 position)\\n    internal\\n    pure\\n    returns (uint256)\\n  {\\n    unchecked {\\n      uint256 shiftBits = position * SLOT_WIDTH;\\n      // Doing a bitwise AND with `SLOT_MAX`\\n      // clears all but the 32 least significant bits.\\n      // Because of the right shift by `slotShift(position)` bits,\\n      // those 32 bits contain the 32 bits in the `position`th slot of `node`.\\n      return (node >> shiftBits) & SLOT_MAX;\\n    }\\n  }\\n\\n  /// @notice Return `node` with the `position`th slot set to zero.\\n  function clearSlot(uint256 node, uint256 position)\\n    internal\\n    pure\\n    returns (uint256)\\n  {\\n    unchecked {\\n      uint256 shiftBits = position * SLOT_WIDTH;\\n      // Shifting `SLOT_MAX` left by `slotShift(position)` bits\\n      // gives us a number where all bits of the `position`th slot are set,\\n      // and all other bits are unset.\\n      //\\n      // Using a bitwise NOT on this number,\\n      // we get a uint256 where all bits are set\\n      // except for those of the `position`th slot.\\n      //\\n      // Bitwise ANDing the original `node` with this number\\n      // sets the bits of `position`th slot to zero,\\n      // leaving all other bits unchanged.\\n      return node & ~(SLOT_MAX << shiftBits);\\n    }\\n  }\\n\\n  /// @notice Return `node` with the `position`th slot set to `weight`.\\n  ///\\n  /// @param weight The weight of of the node.\\n  /// Safely truncated to a 32-bit number,\\n  /// but this should never be called with an overflowing weight regardless.\\n  function setSlot(\\n    uint256 node,\\n    uint256 position,\\n    uint256 weight\\n  ) internal pure returns (uint256) {\\n    unchecked {\\n      uint256 shiftBits = position * SLOT_WIDTH;\\n      // Clear the `position`th slot like in `clearSlot()`.\\n      uint256 clearedNode = node & ~(SLOT_MAX << shiftBits);\\n      // Bitwise AND `weight` with `SLOT_MAX`\\n      // to clear all but the 32 least significant bits.\\n      //\\n      // Shift this left by `slotShift(position)` bits\\n      // to obtain a uint256 with all bits unset\\n      // except in the `position`th slot\\n      // which contains the 32-bit value of `weight`.\\n      uint256 shiftedWeight = (weight & SLOT_MAX) << shiftBits;\\n      // When we bitwise OR these together,\\n      // all other slots except the `position`th one come from the left argument,\\n      // and the `position`th gets filled with `weight` from the right argument.\\n      return clearedNode | shiftedWeight;\\n    }\\n  }\\n\\n  /// @notice Calculate the summed weight of all slots in the `node`.\\n  function sumWeight(uint256 node) internal pure returns (uint256 sum) {\\n    unchecked {\\n      sum = node & SLOT_MAX;\\n      // Iterate through each slot\\n      // by shifting `node` right in increments of 32 bits,\\n      // and adding the 32 least significant bits to the `sum`.\\n      uint256 newNode = node >> SLOT_WIDTH;\\n      while (newNode > 0) {\\n        sum += (newNode & SLOT_MAX);\\n        newNode = newNode >> SLOT_WIDTH;\\n      }\\n      return sum;\\n    }\\n  }\\n\\n  /// @notice Pick a slot in `node` that corresponds to `index`.\\n  /// Treats the node like an array of virtual stakers,\\n  /// the number of virtual stakers in each slot corresponding to its weight,\\n  /// and picks which slot contains the `index`th virtual staker.\\n  ///\\n  /// @dev Requires that `index` be lower than `sumWeight(node)`.\\n  /// However, this is not enforced for performance reasons.\\n  /// If `index` exceeds the permitted range,\\n  /// `pickWeightedSlot()` returns the rightmost slot\\n  /// and an excessively high `newIndex`.\\n  ///\\n  /// @return slot The slot of `node` containing the `index`th virtual staker.\\n  ///\\n  /// @return newIndex The index of the `index`th virtual staker of `node`\\n  /// within the returned slot.\\n  function pickWeightedSlot(uint256 node, uint256 index)\\n    internal\\n    pure\\n    returns (uint256 slot, uint256 newIndex)\\n  {\\n    unchecked {\\n      newIndex = index;\\n      uint256 newNode = node;\\n      uint256 currentSlotWeight = newNode & SLOT_MAX;\\n      while (newIndex >= currentSlotWeight) {\\n        newIndex -= currentSlotWeight;\\n        slot++;\\n        newNode = newNode >> SLOT_WIDTH;\\n        currentSlotWeight = newNode & SLOT_MAX;\\n      }\\n      return (slot, newIndex);\\n    }\\n  }\\n}\\n\",\"keccak256\":\"0x7ba28c2d49aa038c3a80e3e66a09f035c156abfc1ee3412c8d615c84612bdf29\"},\"@keep-network/sortition-pools/contracts/Leaf.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nlibrary Leaf {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant SLOT_WIDTH = 256 / SLOT_COUNT;\\n  uint256 private constant SLOT_MAX = (2**SLOT_WIDTH) - 1;\\n\\n  uint256 private constant ID_WIDTH = SLOT_WIDTH;\\n  uint256 private constant ID_MAX = SLOT_MAX;\\n\\n  uint256 private constant BLOCKHEIGHT_WIDTH = 96 - ID_WIDTH;\\n  uint256 private constant BLOCKHEIGHT_MAX = (2**BLOCKHEIGHT_WIDTH) - 1;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  function make(\\n    address _operator,\\n    uint256 _creationBlock,\\n    uint256 _id\\n  ) internal pure returns (uint256) {\\n    assert(_creationBlock <= type(uint64).max);\\n    assert(_id <= type(uint32).max);\\n    // Converting a bytesX type into a larger type\\n    // adds zero bytes on the right.\\n    uint256 op = uint256(bytes32(bytes20(_operator)));\\n    // Bitwise AND the id to erase\\n    // all but the 32 least significant bits\\n    uint256 uid = _id & ID_MAX;\\n    // Erase all but the 64 least significant bits,\\n    // then shift left by 32 bits to make room for the id\\n    uint256 cb = (_creationBlock & BLOCKHEIGHT_MAX) << ID_WIDTH;\\n    // Bitwise OR them all together to get\\n    // [address operator || uint64 creationBlock || uint32 id]\\n    return (op | cb | uid);\\n  }\\n\\n  function operator(uint256 leaf) internal pure returns (address) {\\n    // Converting a bytesX type into a smaller type\\n    // truncates it on the right.\\n    return address(bytes20(bytes32(leaf)));\\n  }\\n\\n  /// @notice Return the block number the leaf was created in.\\n  function creationBlock(uint256 leaf) internal pure returns (uint256) {\\n    return ((leaf >> ID_WIDTH) & BLOCKHEIGHT_MAX);\\n  }\\n\\n  function id(uint256 leaf) internal pure returns (uint32) {\\n    // Id is stored in the 32 least significant bits.\\n    // Bitwise AND ensures that we only get the contents of those bits.\\n    return uint32(leaf & ID_MAX);\\n  }\\n}\\n\",\"keccak256\":\"0xaa56ba64d0990b014ce555b8edfd5e2fb3e62b6fade61e0b6d428c6058a33709\"},\"@keep-network/sortition-pools/contracts/Position.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nlibrary Position {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_POINTER_MAX = (2**SLOT_BITS) - 1;\\n  uint256 private constant LEAF_FLAG = 1 << 255;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  // Return the last 3 bits of a position number,\\n  // corresponding to its slot in its parent\\n  function slot(uint256 a) internal pure returns (uint256) {\\n    return a & SLOT_POINTER_MAX;\\n  }\\n\\n  // Return the parent of a position number\\n  function parent(uint256 a) internal pure returns (uint256) {\\n    return a >> SLOT_BITS;\\n  }\\n\\n  // Return the location of the child of a at the given slot\\n  function child(uint256 a, uint256 s) internal pure returns (uint256) {\\n    return (a << SLOT_BITS) | (s & SLOT_POINTER_MAX); // slot(s)\\n  }\\n\\n  // Return the uint p as a flagged position uint:\\n  // the least significant 21 bits contain the position\\n  // and the 22nd bit is set as a flag\\n  // to distinguish the position 0x000000 from an empty field.\\n  function setFlag(uint256 p) internal pure returns (uint256) {\\n    return p | LEAF_FLAG;\\n  }\\n\\n  // Turn a flagged position into an unflagged position\\n  // by removing the flag at the 22nd least significant bit.\\n  //\\n  // We shouldn't _actually_ need this\\n  // as all position-manipulating code should ignore non-position bits anyway\\n  // but it's cheap to call so might as well do it.\\n  function unsetFlag(uint256 p) internal pure returns (uint256) {\\n    return p & (~LEAF_FLAG);\\n  }\\n}\\n\",\"keccak256\":\"0x2068219deb725390f294d2a710ec802b519e6e47eca00024034011d21e5fb8ac\"},\"@keep-network/sortition-pools/contracts/RNG.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nimport \\\"./Leaf.sol\\\";\\n\\nlibrary RNG {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant WEIGHT_WIDTH = 256 / SLOT_COUNT;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  /// @notice Get an index in the range `[0 .. range-1]`\\n  /// and the new state of the RNG,\\n  /// using the provided `state` of the RNG.\\n  ///\\n  /// @param range The upper bound of the index, exclusive.\\n  ///\\n  /// @param state The previous state of the RNG.\\n  /// The initial state needs to be obtained\\n  /// from a trusted randomness oracle (the random beacon),\\n  /// or from a chain of earlier calls to `RNG.getIndex()`\\n  /// on an originally trusted seed.\\n  ///\\n  /// @dev Calculates the number of bits required for the desired range,\\n  /// takes the least significant bits of `state`\\n  /// and checks if the obtained index is within the desired range.\\n  /// The original state is hashed with `keccak256` to get a new state.\\n  /// If the index is outside the range,\\n  /// the function retries until it gets a suitable index.\\n  ///\\n  /// @return index A random integer between `0` and `range - 1`, inclusive.\\n  ///\\n  /// @return newState The new state of the RNG.\\n  /// When `getIndex()` is called one or more times,\\n  /// care must be taken to always use the output `state`\\n  /// of the most recent call as the input `state` of a subsequent call.\\n  /// At the end of a transaction calling `RNG.getIndex()`,\\n  /// the previous stored state must be overwritten with the latest output.\\n  function getIndex(\\n    uint256 range,\\n    bytes32 state,\\n    uint256 bits\\n  ) internal view returns (uint256, bytes32) {\\n    bool found = false;\\n    uint256 index = 0;\\n    bytes32 newState = state;\\n    while (!found) {\\n      index = truncate(bits, uint256(newState));\\n      newState = keccak256(abi.encodePacked(newState, address(this)));\\n      if (index < range) {\\n        found = true;\\n      }\\n    }\\n    return (index, newState);\\n  }\\n\\n  /// @notice Calculate how many bits are required\\n  /// for an index in the range `[0 .. range-1]`.\\n  ///\\n  /// @param range The upper bound of the desired range, exclusive.\\n  ///\\n  /// @return uint The smallest number of bits\\n  /// that can contain the number `range-1`.\\n  function bitsRequired(uint256 range) internal pure returns (uint256) {\\n    unchecked {\\n      if (range == 1) {\\n        return 0;\\n      }\\n\\n      uint256 bits = WEIGHT_WIDTH - 1;\\n\\n      // Left shift by `bits`,\\n      // so we have a 1 in the (bits + 1)th least significant bit\\n      // and 0 in other bits.\\n      // If this number is equal or greater than `range`,\\n      // the range [0, range-1] fits in `bits` bits.\\n      //\\n      // Because we loop from high bits to low bits,\\n      // we find the highest number of bits that doesn't fit the range,\\n      // and return that number + 1.\\n      while (1 << bits >= range) {\\n        bits--;\\n      }\\n\\n      return bits + 1;\\n    }\\n  }\\n\\n  /// @notice Truncate `input` to the `bits` least significant bits.\\n  function truncate(uint256 bits, uint256 input)\\n    internal\\n    pure\\n    returns (uint256)\\n  {\\n    unchecked {\\n      return input & ((1 << bits) - 1);\\n    }\\n  }\\n}\\n\",\"keccak256\":\"0x1b52b2c45669145cbd9fa7337def843e3de69bfde089039a7fcc09f0aa00c81f\"},\"@keep-network/sortition-pools/contracts/Rewards.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\n/// @title Rewards\\n/// @notice Rewards are allocated proportionally to operators\\n/// present in the pool at payout based on their weight in the pool.\\n///\\n/// To facilitate this, we use a global accumulator value\\n/// to track the total rewards one unit of weight would've earned\\n/// since the creation of the pool.\\n///\\n/// Whenever a reward is paid, the accumulator is increased\\n/// by the size of the reward divided by the total weight\\n/// of all eligible operators in the pool.\\n///\\n/// Each operator has an individual accumulator value,\\n/// set to equal the global accumulator when the operator joins the pool.\\n/// This accumulator reflects the amount of rewards\\n/// that have already been accounted for with that operator.\\n///\\n/// Whenever an operator's weight in the pool changes,\\n/// we can update the amount of rewards the operator has earned\\n/// by subtracting the operator's accumulator from the global accumulator.\\n/// This gives us the amount of rewards one unit of weight has earned\\n/// since the last time the operator's rewards have been updated.\\n/// Then we multiply that by the operator's previous (pre-change) weight\\n/// to determine how much rewards in total the operator has earned,\\n/// and add this to the operator's earned rewards.\\n/// Finally, we set the operator's accumulator to the global accumulator value.\\ncontract Rewards {\\n  struct OperatorRewards {\\n    // The state of the global accumulator\\n    // when the operator's rewards were last updated\\n    uint96 accumulated;\\n    // The amount of rewards collected by the operator after the latest update.\\n    // The amount the operator could withdraw may equal `available`\\n    // or it may be greater, if more rewards have been paid in since then.\\n    // To evaulate the most recent amount including rewards potentially paid\\n    // since the last update, use `availableRewards` function.\\n    uint96 available;\\n    // If nonzero, the operator is ineligible for rewards\\n    // and may only re-enable rewards after the specified timestamp.\\n    // XXX: unsigned 32-bit integer unix seconds, will break around 2106\\n    uint32 ineligibleUntil;\\n    // Locally cached weight of the operator,\\n    // used to reduce the cost of setting operators ineligible.\\n    uint32 weight;\\n  }\\n\\n  // The global accumulator of how much rewards\\n  // a hypothetical operator of weight 1 would have earned\\n  // since the creation of the pool.\\n  uint96 internal globalRewardAccumulator;\\n  // If the amount of reward tokens paid in\\n  // does not divide cleanly by pool weight,\\n  // the difference is recorded as rounding dust\\n  // and added to the next reward.\\n  uint96 internal rewardRoundingDust;\\n\\n  // The amount of rewards that would've been earned by ineligible operators\\n  // had they not been ineligible.\\n  uint96 public ineligibleEarnedRewards;\\n\\n  // Ineligibility times are calculated from this offset,\\n  // set at contract creation.\\n  uint256 internal immutable ineligibleOffsetStart;\\n\\n  mapping(uint32 => OperatorRewards) internal operatorRewards;\\n\\n  constructor() {\\n    // solhint-disable-next-line not-rely-on-time\\n    ineligibleOffsetStart = block.timestamp;\\n  }\\n\\n  /// @notice Return whether the operator is eligible for rewards or not.\\n  function isEligibleForRewards(uint32 operator) public view returns (bool) {\\n    return operatorRewards[operator].ineligibleUntil == 0;\\n  }\\n\\n  /// @notice Return the time the operator's reward eligibility can be restored.\\n  function rewardsEligibilityRestorableAt(uint32 operator)\\n    public\\n    view\\n    returns (uint256)\\n  {\\n    uint32 until = operatorRewards[operator].ineligibleUntil;\\n    require(until != 0, \\\"Operator already eligible\\\");\\n    return (uint256(until) + ineligibleOffsetStart);\\n  }\\n\\n  /// @notice Return whether the operator is able\\n  /// to restore their eligibility for rewards right away.\\n  function canRestoreRewardEligibility(uint32 operator)\\n    public\\n    view\\n    returns (bool)\\n  {\\n    // solhint-disable-next-line not-rely-on-time\\n    return rewardsEligibilityRestorableAt(operator) <= block.timestamp;\\n  }\\n\\n  /// @notice Internal function for updating the global state of rewards.\\n  function addRewards(uint96 rewardAmount, uint32 currentPoolWeight) internal {\\n    require(currentPoolWeight >= 0, \\\"No recipients in pool\\\");\\n\\n    uint96 totalAmount = rewardAmount + rewardRoundingDust;\\n    uint96 perWeightReward = totalAmount / currentPoolWeight;\\n    uint96 newRoundingDust = totalAmount % currentPoolWeight;\\n\\n    globalRewardAccumulator += perWeightReward;\\n    rewardRoundingDust = newRoundingDust;\\n  }\\n\\n  /// @notice Internal function for updating the operator's reward state.\\n  function updateOperatorRewards(uint32 operator, uint32 newWeight) internal {\\n    uint96 acc = globalRewardAccumulator;\\n    OperatorRewards memory o = operatorRewards[operator];\\n    uint96 accruedRewards = (acc - o.accumulated) * uint96(o.weight);\\n    if (o.ineligibleUntil == 0) {\\n      // If operator is not ineligible, update their earned rewards\\n      o.available += accruedRewards;\\n    } else {\\n      // If ineligible, put the rewards into the ineligible pot\\n      ineligibleEarnedRewards += accruedRewards;\\n    }\\n    // In any case, update their accumulator and weight\\n    o.accumulated = acc;\\n    o.weight = newWeight;\\n    operatorRewards[operator] = o;\\n  }\\n\\n  /// @notice Set the amount of withdrawable tokens to zero\\n  /// and return the previous withdrawable amount.\\n  /// @dev Does not update the withdrawable amount,\\n  /// but should usually be accompanied by an update.\\n  function withdrawOperatorRewards(uint32 operator)\\n    internal\\n    returns (uint96 withdrawable)\\n  {\\n    OperatorRewards storage o = operatorRewards[operator];\\n    withdrawable = o.available;\\n    o.available = 0;\\n  }\\n\\n  /// @notice Set the amount of ineligible-earned tokens to zero\\n  /// and return the previous amount.\\n  function withdrawIneligibleRewards() internal returns (uint96 withdrawable) {\\n    withdrawable = ineligibleEarnedRewards;\\n    ineligibleEarnedRewards = 0;\\n  }\\n\\n  /// @notice Set the given operators as ineligible for rewards.\\n  /// The operators can restore their eligibility at the given time.\\n  function setIneligible(uint32[] memory operators, uint256 until) internal {\\n    OperatorRewards memory o = OperatorRewards(0, 0, 0, 0);\\n    uint96 globalAcc = globalRewardAccumulator;\\n    uint96 accrued = 0;\\n    // Record ineligibility as seconds after contract creation\\n    uint32 _until = uint32(until - ineligibleOffsetStart);\\n\\n    for (uint256 i = 0; i < operators.length; i++) {\\n      uint32 operator = operators[i];\\n      OperatorRewards storage r = operatorRewards[operator];\\n      o.available = r.available;\\n      o.accumulated = r.accumulated;\\n      o.ineligibleUntil = r.ineligibleUntil;\\n      o.weight = r.weight;\\n\\n      if (o.ineligibleUntil != 0) {\\n        // If operator is already ineligible,\\n        // don't earn rewards or shorten its ineligibility\\n        if (o.ineligibleUntil < _until) {\\n          o.ineligibleUntil = _until;\\n        }\\n      } else {\\n        // The operator becomes ineligible -> earn rewards\\n        o.ineligibleUntil = _until;\\n        accrued = (globalAcc - o.accumulated) * uint96(o.weight);\\n        o.available += accrued;\\n      }\\n      o.accumulated = globalAcc;\\n\\n      r.available = o.available;\\n      r.accumulated = o.accumulated;\\n      r.ineligibleUntil = o.ineligibleUntil;\\n      r.weight = o.weight;\\n    }\\n  }\\n\\n  /// @notice Restore the given operator's eligibility for rewards.\\n  function restoreEligibility(uint32 operator) internal {\\n    // solhint-disable-next-line not-rely-on-time\\n    require(canRestoreRewardEligibility(operator), \\\"Operator still ineligible\\\");\\n    uint96 acc = globalRewardAccumulator;\\n    OperatorRewards memory o = operatorRewards[operator];\\n    uint96 accruedRewards = (acc - o.accumulated) * uint96(o.weight);\\n    ineligibleEarnedRewards += accruedRewards;\\n    o.accumulated = acc;\\n    o.ineligibleUntil = 0;\\n    operatorRewards[operator] = o;\\n  }\\n\\n  /// @notice Returns the amount of rewards currently available for withdrawal\\n  ///         for the given operator.\\n  function availableRewards(uint32 operator) internal view returns (uint96) {\\n    uint96 acc = globalRewardAccumulator;\\n    OperatorRewards memory o = operatorRewards[operator];\\n    if (o.ineligibleUntil == 0) {\\n      // If operator is not ineligible, calculate newly accrued rewards and add\\n      // them to the available ones, calculated during the last update.\\n      uint96 accruedRewards = (acc - o.accumulated) * uint96(o.weight);\\n      return o.available + accruedRewards;\\n    } else {\\n      // If ineligible, return only the rewards calculated during the last\\n      // update.\\n      return o.available;\\n    }\\n  }\\n}\\n\",\"keccak256\":\"0x608d5d04411469682191b8fe26bbc0d925e1f950e24ac45c272b74e3df2e91cf\"},\"@keep-network/sortition-pools/contracts/SortitionPool.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nimport \\\"@thesis/solidity-contracts/contracts/token/IERC20WithPermit.sol\\\";\\nimport \\\"@thesis/solidity-contracts/contracts/token/IReceiveApproval.sol\\\";\\n\\nimport \\\"@openzeppelin/contracts/access/Ownable.sol\\\";\\n\\nimport \\\"./RNG.sol\\\";\\nimport \\\"./SortitionTree.sol\\\";\\nimport \\\"./Rewards.sol\\\";\\n\\n/// @title Sortition Pool\\n/// @notice A logarithmic data structure used to store the pool of eligible\\n/// operators weighted by their stakes. It allows to select a group of operators\\n/// based on the provided pseudo-random seed.\\ncontract SortitionPool is SortitionTree, Rewards, Ownable, IReceiveApproval {\\n  using Branch for uint256;\\n  using Leaf for uint256;\\n  using Position for uint256;\\n\\n  IERC20WithPermit public immutable rewardToken;\\n\\n  uint256 public immutable poolWeightDivisor;\\n\\n  bool public isLocked;\\n\\n  event IneligibleForRewards(uint32[] ids, uint256 until);\\n\\n  event RewardEligibilityRestored(address indexed operator, uint32 indexed id);\\n\\n  /// @notice Reverts if called while pool is locked.\\n  modifier onlyUnlocked() {\\n    require(!isLocked, \\\"Sortition pool locked\\\");\\n    _;\\n  }\\n\\n  /// @notice Reverts if called while pool is unlocked.\\n  modifier onlyLocked() {\\n    require(isLocked, \\\"Sortition pool unlocked\\\");\\n    _;\\n  }\\n\\n  constructor(IERC20WithPermit _rewardToken, uint256 _poolWeightDivisor) {\\n    rewardToken = _rewardToken;\\n    poolWeightDivisor = _poolWeightDivisor;\\n  }\\n\\n  function receiveApproval(\\n    address sender,\\n    uint256 amount,\\n    address token,\\n    bytes calldata\\n  ) external override {\\n    require(token == address(rewardToken), \\\"Unsupported token\\\");\\n    rewardToken.transferFrom(sender, address(this), amount);\\n    Rewards.addRewards(uint96(amount), uint32(root.sumWeight()));\\n  }\\n\\n  /// @notice Withdraws all available rewards for the given operator to the\\n  ///         given beneficiary.\\n  /// @dev Can be called only be the owner. Does not validate if the provided\\n  ///      beneficiary is associated with the provided operator - this needs to\\n  ///      be done by the owner calling this function.\\n  /// @return The amount of rewards withdrawn in this call.\\n  function withdrawRewards(address operator, address beneficiary)\\n    public\\n    onlyOwner\\n    returns (uint96)\\n  {\\n    uint32 id = getOperatorID(operator);\\n    Rewards.updateOperatorRewards(id, uint32(getPoolWeight(operator)));\\n    uint96 earned = Rewards.withdrawOperatorRewards(id);\\n    rewardToken.transfer(beneficiary, uint256(earned));\\n    return earned;\\n  }\\n\\n  /// @notice Withdraws rewards not allocated to operators marked as ineligible\\n  ///         to the given recipient address.\\n  /// @dev Can be called only by the owner.\\n  function withdrawIneligible(address recipient) public onlyOwner {\\n    uint96 earned = Rewards.withdrawIneligibleRewards();\\n    rewardToken.transfer(recipient, uint256(earned));\\n  }\\n\\n  /// @notice Locks the sortition pool. In locked state, members cannot be\\n  ///         inserted and removed from the pool. Members statuses cannot\\n  ///         be updated as well.\\n  /// @dev Can be called only by the contract owner.\\n  function lock() public onlyOwner {\\n    isLocked = true;\\n  }\\n\\n  /// @notice Unlocks the sortition pool. Removes all restrictions set by\\n  ///         the `lock` method.\\n  /// @dev Can be called only by the contract owner.\\n  function unlock() public onlyOwner {\\n    isLocked = false;\\n  }\\n\\n  /// @notice Inserts an operator to the pool. Reverts if the operator is\\n  /// already present.\\n  /// @dev Can be called only by the contract owner.\\n  /// @param operator Address of the inserted operator.\\n  /// @param authorizedStake Inserted operator's authorized stake for the application.\\n  function insertOperator(address operator, uint256 authorizedStake)\\n    public\\n    onlyOwner\\n    onlyUnlocked\\n  {\\n    uint256 weight = getWeight(authorizedStake);\\n    require(weight > 0, \\\"Operator not eligible\\\");\\n\\n    _insertOperator(operator, weight);\\n    uint32 id = getOperatorID(operator);\\n    Rewards.updateOperatorRewards(id, uint32(weight));\\n  }\\n\\n  /// @notice Update the operator's weight if present and eligible,\\n  /// or remove from the pool if present and ineligible.\\n  /// @dev Can be called only by the contract owner.\\n  /// @param operator Address of the updated operator.\\n  /// @param authorizedStake Operator's authorized stake for the application.\\n  function updateOperatorStatus(address operator, uint256 authorizedStake)\\n    public\\n    onlyOwner\\n    onlyUnlocked\\n  {\\n    uint256 weight = getWeight(authorizedStake);\\n\\n    uint32 id = getOperatorID(operator);\\n    Rewards.updateOperatorRewards(id, uint32(weight));\\n\\n    if (weight == 0) {\\n      _removeOperator(operator);\\n    } else {\\n      updateOperator(operator, weight);\\n    }\\n  }\\n\\n  function setRewardIneligibility(uint32[] calldata operators, uint256 until)\\n    public\\n    onlyOwner\\n  {\\n    Rewards.setIneligible(operators, until);\\n    emit IneligibleForRewards(operators, until);\\n  }\\n\\n  function restoreRewardEligibility(address operator) public {\\n    uint32 id = getOperatorID(operator);\\n    Rewards.restoreEligibility(id);\\n    emit RewardEligibilityRestored(operator, id);\\n  }\\n\\n  /// @notice Returns the amount of rewards withdrawable for the given operator.\\n  function getAvailableRewards(address operator) public view returns (uint96) {\\n    uint32 id = getOperatorID(operator);\\n    return availableRewards(id);\\n  }\\n\\n  /// @notice Return whether the operator is present in the pool.\\n  function isOperatorInPool(address operator) public view returns (bool) {\\n    return getFlaggedLeafPosition(operator) != 0;\\n  }\\n\\n  /// @notice Return whether the operator's weight in the pool\\n  /// matches their eligible weight.\\n  function isOperatorUpToDate(address operator, uint256 authorizedStake)\\n    public\\n    view\\n    returns (bool)\\n  {\\n    return getWeight(authorizedStake) == getPoolWeight(operator);\\n  }\\n\\n  /// @notice Return the weight of the operator in the pool,\\n  /// which may or may not be out of date.\\n  function getPoolWeight(address operator) public view returns (uint256) {\\n    uint256 flaggedPosition = getFlaggedLeafPosition(operator);\\n    if (flaggedPosition == 0) {\\n      return 0;\\n    } else {\\n      uint256 leafPosition = flaggedPosition.unsetFlag();\\n      uint256 leafWeight = getLeafWeight(leafPosition);\\n      return leafWeight;\\n    }\\n  }\\n\\n  /// @notice Selects a new group of operators of the provided size based on\\n  /// the provided pseudo-random seed. At least one operator has to be\\n  /// registered in the pool, otherwise the function fails reverting the\\n  /// transaction.\\n  /// @param groupSize Size of the requested group\\n  /// @param seed Pseudo-random number used to select operators to group\\n  /// @return selected Members of the selected group\\n  function selectGroup(uint256 groupSize, bytes32 seed)\\n    public\\n    view\\n    onlyLocked\\n    returns (uint32[] memory)\\n  {\\n    uint256 _root = root;\\n\\n    bytes32 rngState = seed;\\n    uint256 rngRange = _root.sumWeight();\\n    require(rngRange > 0, \\\"Not enough operators in pool\\\");\\n    uint256 currentIndex;\\n\\n    uint256 bits = RNG.bitsRequired(rngRange);\\n\\n    uint32[] memory selected = new uint32[](groupSize);\\n\\n    for (uint256 i = 0; i < groupSize; i++) {\\n      (currentIndex, rngState) = RNG.getIndex(rngRange, rngState, bits);\\n\\n      uint256 leafPosition = pickWeightedLeaf(currentIndex, _root);\\n\\n      uint256 leaf = leaves[leafPosition];\\n      selected[i] = leaf.id();\\n    }\\n    return selected;\\n  }\\n\\n  function getWeight(uint256 authorization) internal view returns (uint256) {\\n    return authorization / poolWeightDivisor;\\n  }\\n}\\n\",\"keccak256\":\"0x93d8bd42838147a475cb4c0086e3175714c9438bc5515fd6065577958d5b2b73\"},\"@keep-network/sortition-pools/contracts/SortitionTree.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nimport \\\"./Branch.sol\\\";\\nimport \\\"./Position.sol\\\";\\nimport \\\"./Leaf.sol\\\";\\n\\ncontract SortitionTree {\\n  using Branch for uint256;\\n  using Position for uint256;\\n  using Leaf for uint256;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  uint256 private constant LEVELS = 7;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant SLOT_WIDTH = 256 / SLOT_COUNT;\\n  uint256 private constant SLOT_MAX = (2**SLOT_WIDTH) - 1;\\n  uint256 private constant POOL_CAPACITY = SLOT_COUNT**LEVELS;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  // implicit tree\\n  // root 8\\n  // level2 64\\n  // level3 512\\n  // level4 4k\\n  // level5 32k\\n  // level6 256k\\n  // level7 2M\\n  uint256 internal root;\\n  mapping(uint256 => mapping(uint256 => uint256)) internal branches;\\n  mapping(uint256 => uint256) internal leaves;\\n\\n  // the flagged (see setFlag() and unsetFlag() in Position.sol) positions\\n  // of all operators present in the pool\\n  mapping(address => uint256) internal flaggedLeafPosition;\\n\\n  // the leaf after the rightmost occupied leaf of each stack\\n  uint256 internal rightmostLeaf;\\n  // the empty leaves in each stack\\n  // between 0 and the rightmost occupied leaf\\n  uint256[] internal emptyLeaves;\\n\\n  // Each operator has an uint32 ID number\\n  // which is allocated when they first join the pool\\n  // and remains unchanged even if they leave and rejoin the pool.\\n  mapping(address => uint32) internal operatorID;\\n  // The idAddress array records the address corresponding to each ID number.\\n  // The ID number 0 is initialized with a zero address and is not used.\\n  address[] internal idAddress;\\n\\n  constructor() {\\n    root = 0;\\n    rightmostLeaf = 0;\\n    idAddress.push();\\n  }\\n\\n  // Return the ID number of the given operator address.\\n  // An ID number of 0 means the operator has not been allocated an ID number yet.\\n  function getOperatorID(address operator) public view returns (uint32) {\\n    return operatorID[operator];\\n  }\\n\\n  // Get the operator address corresponding to the given ID number.\\n  // An empty address means the ID number has not been allocated yet.\\n  function getIDOperator(uint32 id) public view returns (address) {\\n    return idAddress.length > id ? idAddress[id] : address(0);\\n  }\\n\\n  // Gets the operator addresses corresponding to the given ID numbers.\\n  // An empty address means the ID number has not been allocated yet.\\n  // This function works just like getIDOperator except that it allows to fetch\\n  // operator addresses for multiple IDs in one call.\\n  function getIDOperators(uint32[] calldata ids)\\n    public\\n    view\\n    returns (address[] memory)\\n  {\\n    uint256 idCount = idAddress.length;\\n\\n    address[] memory operators = new address[](ids.length);\\n    for (uint256 i = 0; i < ids.length; i++) {\\n      uint32 id = ids[i];\\n      operators[i] = idCount > id ? idAddress[id] : address(0);\\n    }\\n    return operators;\\n  }\\n\\n  // checks if operator is already registered in the pool\\n  function isOperatorRegistered(address operator) public view returns (bool) {\\n    return getFlaggedLeafPosition(operator) != 0;\\n  }\\n\\n  // Sum the number of operators in each trunk\\n  function operatorsInPool() public view returns (uint256) {\\n    // Get the number of leaves that might be occupied;\\n    // if `rightmostLeaf` equals `firstLeaf()` the tree must be empty,\\n    // otherwise the difference between these numbers\\n    // gives the number of leaves that may be occupied.\\n    uint256 nPossiblyUsedLeaves = rightmostLeaf;\\n    // Get the number of empty leaves\\n    // not accounted for by the `rightmostLeaf`\\n    uint256 nEmptyLeaves = emptyLeaves.length;\\n\\n    return (nPossiblyUsedLeaves - nEmptyLeaves);\\n  }\\n\\n  function totalWeight() public view returns (uint256) {\\n    return root.sumWeight();\\n  }\\n\\n  // Give the operator a new ID number\\n  // Does not check if the operator already has an ID number\\n  function allocateOperatorID(address operator) internal returns (uint256) {\\n    uint256 id = idAddress.length;\\n\\n    require(id <= type(uint32).max, \\\"Pool capacity exceeded\\\");\\n\\n    operatorID[operator] = uint32(id);\\n    idAddress.push(operator);\\n    return id;\\n  }\\n\\n  function _insertOperator(address operator, uint256 weight) internal {\\n    require(\\n      !isOperatorRegistered(operator),\\n      \\\"Operator is already registered in the pool\\\"\\n    );\\n\\n    uint256 id = getOperatorID(operator);\\n    if (id == 0) {\\n      id = allocateOperatorID(operator);\\n    }\\n\\n    uint256 position = getEmptyLeafPosition();\\n    // Record the block the operator was inserted in\\n    uint256 theLeaf = Leaf.make(operator, block.number, id);\\n\\n    root = setLeaf(position, theLeaf, weight, root);\\n\\n    // Without position flags,\\n    // the position 0x000000 would be treated as empty\\n    flaggedLeafPosition[operator] = position.setFlag();\\n  }\\n\\n  function _removeOperator(address operator) internal {\\n    uint256 flaggedPosition = getFlaggedLeafPosition(operator);\\n    require(flaggedPosition != 0, \\\"Operator is not registered in the pool\\\");\\n    uint256 unflaggedPosition = flaggedPosition.unsetFlag();\\n    root = removeLeaf(unflaggedPosition, root);\\n    removeLeafPositionRecord(operator);\\n  }\\n\\n  function updateOperator(address operator, uint256 weight) internal {\\n    require(\\n      isOperatorRegistered(operator),\\n      \\\"Operator is not registered in the pool\\\"\\n    );\\n\\n    uint256 flaggedPosition = getFlaggedLeafPosition(operator);\\n    uint256 unflaggedPosition = flaggedPosition.unsetFlag();\\n    root = updateLeaf(unflaggedPosition, weight, root);\\n  }\\n\\n  function removeLeafPositionRecord(address operator) internal {\\n    flaggedLeafPosition[operator] = 0;\\n  }\\n\\n  function removeLeaf(uint256 position, uint256 _root)\\n    internal\\n    returns (uint256)\\n  {\\n    uint256 rightmostSubOne = rightmostLeaf - 1;\\n    bool isRightmost = position == rightmostSubOne;\\n\\n    uint256 newRoot = setLeaf(position, 0, 0, _root);\\n\\n    if (isRightmost) {\\n      rightmostLeaf = rightmostSubOne;\\n    } else {\\n      emptyLeaves.push(position);\\n    }\\n    return newRoot;\\n  }\\n\\n  function updateLeaf(\\n    uint256 position,\\n    uint256 weight,\\n    uint256 _root\\n  ) internal returns (uint256) {\\n    if (getLeafWeight(position) != weight) {\\n      return updateTree(position, weight, _root);\\n    } else {\\n      return _root;\\n    }\\n  }\\n\\n  function setLeaf(\\n    uint256 position,\\n    uint256 theLeaf,\\n    uint256 leafWeight,\\n    uint256 _root\\n  ) internal returns (uint256) {\\n    // set leaf\\n    leaves[position] = theLeaf;\\n\\n    return (updateTree(position, leafWeight, _root));\\n  }\\n\\n  function updateTree(\\n    uint256 position,\\n    uint256 weight,\\n    uint256 _root\\n  ) internal returns (uint256) {\\n    uint256 childSlot;\\n    uint256 treeNode;\\n    uint256 newNode;\\n    uint256 nodeWeight = weight;\\n\\n    uint256 parent = position;\\n    // set levels 7 to 2\\n    for (uint256 level = LEVELS; level >= 2; level--) {\\n      childSlot = parent.slot();\\n      parent = parent.parent();\\n      treeNode = branches[level][parent];\\n      newNode = treeNode.setSlot(childSlot, nodeWeight);\\n      branches[level][parent] = newNode;\\n      nodeWeight = newNode.sumWeight();\\n    }\\n\\n    // set level Root\\n    childSlot = parent.slot();\\n    return _root.setSlot(childSlot, nodeWeight);\\n  }\\n\\n  function getEmptyLeafPosition() internal returns (uint256) {\\n    uint256 rLeaf = rightmostLeaf;\\n    bool spaceOnRight = (rLeaf + 1) < POOL_CAPACITY;\\n    if (spaceOnRight) {\\n      rightmostLeaf = rLeaf + 1;\\n      return rLeaf;\\n    } else {\\n      uint256 emptyLeafCount = emptyLeaves.length;\\n      require(emptyLeafCount > 0, \\\"Pool is full\\\");\\n      uint256 emptyLeaf = emptyLeaves[emptyLeafCount - 1];\\n      emptyLeaves.pop();\\n      return emptyLeaf;\\n    }\\n  }\\n\\n  function getFlaggedLeafPosition(address operator)\\n    internal\\n    view\\n    returns (uint256)\\n  {\\n    return flaggedLeafPosition[operator];\\n  }\\n\\n  function getLeafWeight(uint256 position) internal view returns (uint256) {\\n    uint256 slot = position.slot();\\n    uint256 parent = position.parent();\\n    uint256 node = branches[LEVELS][parent];\\n    return node.getSlot(slot);\\n  }\\n\\n  function pickWeightedLeaf(uint256 index, uint256 _root)\\n    internal\\n    view\\n    returns (uint256 leafPosition)\\n  {\\n    uint256 currentIndex = index;\\n    uint256 currentNode = _root;\\n    uint256 currentPosition = 0;\\n    uint256 currentSlot;\\n\\n    require(index < currentNode.sumWeight(), \\\"Index exceeds weight\\\");\\n\\n    // get root slot\\n    (currentSlot, currentIndex) = currentNode.pickWeightedSlot(currentIndex);\\n\\n    // get slots from levels 2 to 7\\n    for (uint256 level = 2; level <= LEVELS; level++) {\\n      currentPosition = currentPosition.child(currentSlot);\\n      currentNode = branches[level][currentPosition];\\n      (currentSlot, currentIndex) = currentNode.pickWeightedSlot(currentIndex);\\n    }\\n\\n    // get leaf position\\n    leafPosition = currentPosition.child(currentSlot);\\n  }\\n}\\n\",\"keccak256\":\"0x706033e40b631b2bb1d24b230f770c51546c7476605dd1f87475013673c36367\"},\"@openzeppelin/contracts/access/Ownable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"../utils/Context.sol\\\";\\n\\n/**\\n * @dev Contract module which provides a basic access control mechanism, where\\n * there is an account (an owner) that can be granted exclusive access to\\n * specific functions.\\n *\\n * By default, the owner account will be the one that deploys the contract. This\\n * can later be changed with {transferOwnership}.\\n *\\n * This module is used through inheritance. It will make available the modifier\\n * `onlyOwner`, which can be applied to your functions to restrict their use to\\n * the owner.\\n */\\nabstract contract Ownable is Context {\\n    address private _owner;\\n\\n    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\\n\\n    /**\\n     * @dev Initializes the contract setting the deployer as the initial owner.\\n     */\\n    constructor() {\\n        _setOwner(_msgSender());\\n    }\\n\\n    /**\\n     * @dev Returns the address of the current owner.\\n     */\\n    function owner() public view virtual returns (address) {\\n        return _owner;\\n    }\\n\\n    /**\\n     * @dev Throws if called by any account other than the owner.\\n     */\\n    modifier onlyOwner() {\\n        require(owner() == _msgSender(), \\\"Ownable: caller is not the owner\\\");\\n        _;\\n    }\\n\\n    /**\\n     * @dev Leaves the contract without owner. It will not be possible to call\\n     * `onlyOwner` functions anymore. Can only be called by the current owner.\\n     *\\n     * NOTE: Renouncing ownership will leave the contract without an owner,\\n     * thereby removing any functionality that is only available to the owner.\\n     */\\n    function renounceOwnership() public virtual onlyOwner {\\n        _setOwner(address(0));\\n    }\\n\\n    /**\\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\\n     * Can only be called by the current owner.\\n     */\\n    function transferOwnership(address newOwner) public virtual onlyOwner {\\n        require(newOwner != address(0), \\\"Ownable: new owner is the zero address\\\");\\n        _setOwner(newOwner);\\n    }\\n\\n    function _setOwner(address newOwner) private {\\n        address oldOwner = _owner;\\n        _owner = newOwner;\\n        emit OwnershipTransferred(oldOwner, newOwner);\\n    }\\n}\\n\",\"keccak256\":\"0x6bb804a310218875e89d12c053e94a13a4607cdf7cc2052f3e52bd32a0dc50a1\",\"license\":\"MIT\"},\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Interface of the ERC20 standard as defined in the EIP.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Returns the amount of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the amount of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves `amount` tokens from the caller's account to `recipient`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address recipient, uint256 amount) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 amount) external returns (bool);\\n\\n    /**\\n     * @dev Moves `amount` tokens from `sender` to `recipient` using the\\n     * allowance mechanism. `amount` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(\\n        address sender,\\n        address recipient,\\n        uint256 amount\\n    ) external returns (bool);\\n\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n}\\n\",\"keccak256\":\"0x027b891937d20ccf213fdb9c31531574256de774bda99d3a70ecef6e1913ed2a\",\"license\":\"MIT\"},\"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"../IERC20.sol\\\";\\n\\n/**\\n * @dev Interface for the optional metadata functions from the ERC20 standard.\\n *\\n * _Available since v4.1._\\n */\\ninterface IERC20Metadata is IERC20 {\\n    /**\\n     * @dev Returns the name of the token.\\n     */\\n    function name() external view returns (string memory);\\n\\n    /**\\n     * @dev Returns the symbol of the token.\\n     */\\n    function symbol() external view returns (string memory);\\n\\n    /**\\n     * @dev Returns the decimals places of the token.\\n     */\\n    function decimals() external view returns (uint8);\\n}\\n\",\"keccak256\":\"0x83fe24f5c04a56091e50f4a345ff504c8bff658a76d4c43b16878c8f940c53b2\",\"license\":\"MIT\"},\"@openzeppelin/contracts/utils/Context.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/*\\n * @dev Provides information about the current execution context, including the\\n * sender of the transaction and its data. While these are generally available\\n * via msg.sender and msg.data, they should not be accessed in such a direct\\n * manner, since when dealing with meta-transactions the account sending and\\n * paying for execution may not be the actual sender (as far as an application\\n * is concerned).\\n *\\n * This contract is only required for intermediate, library-like contracts.\\n */\\nabstract contract Context {\\n    function _msgSender() internal view virtual returns (address) {\\n        return msg.sender;\\n    }\\n\\n    function _msgData() internal view virtual returns (bytes calldata) {\\n        return msg.data;\\n    }\\n}\\n\",\"keccak256\":\"0x95098bd1d9c8dec4d80d3dedb88a0d949fa0d740ee99f2aa466bc308216ca6d5\",\"license\":\"MIT\"},\"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.\\n *\\n * These functions can be used to verify that a message was signed by the holder\\n * of the private keys of a given address.\\n */\\nlibrary ECDSA {\\n    /**\\n     * @dev Returns the address that signed a hashed message (`hash`) with\\n     * `signature`. This address can then be used for verification purposes.\\n     *\\n     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:\\n     * this function rejects them by requiring the `s` value to be in the lower\\n     * half order, and the `v` value to be either 27 or 28.\\n     *\\n     * IMPORTANT: `hash` _must_ be the result of a hash operation for the\\n     * verification to be secure: it is possible to craft signatures that\\n     * recover to arbitrary addresses for non-hashed data. A safe way to ensure\\n     * this is by receiving a hash of the original message (which may otherwise\\n     * be too long), and then calling {toEthSignedMessageHash} on it.\\n     *\\n     * Documentation for signature generation:\\n     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]\\n     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]\\n     */\\n    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {\\n        // Check the signature length\\n        // - case 65: r,s,v signature (standard)\\n        // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098) _Available since v4.1._\\n        if (signature.length == 65) {\\n            bytes32 r;\\n            bytes32 s;\\n            uint8 v;\\n            // ecrecover takes the signature parameters, and the only way to get them\\n            // currently is to use assembly.\\n            assembly {\\n                r := mload(add(signature, 0x20))\\n                s := mload(add(signature, 0x40))\\n                v := byte(0, mload(add(signature, 0x60)))\\n            }\\n            return recover(hash, v, r, s);\\n        } else if (signature.length == 64) {\\n            bytes32 r;\\n            bytes32 vs;\\n            // ecrecover takes the signature parameters, and the only way to get them\\n            // currently is to use assembly.\\n            assembly {\\n                r := mload(add(signature, 0x20))\\n                vs := mload(add(signature, 0x40))\\n            }\\n            return recover(hash, r, vs);\\n        } else {\\n            revert(\\\"ECDSA: invalid signature length\\\");\\n        }\\n    }\\n\\n    /**\\n     * @dev Overload of {ECDSA-recover} that receives the `r` and `vs` short-signature fields separately.\\n     *\\n     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]\\n     *\\n     * _Available since v4.2._\\n     */\\n    function recover(\\n        bytes32 hash,\\n        bytes32 r,\\n        bytes32 vs\\n    ) internal pure returns (address) {\\n        bytes32 s;\\n        uint8 v;\\n        assembly {\\n            s := and(vs, 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff)\\n            v := add(shr(255, vs), 27)\\n        }\\n        return recover(hash, v, r, s);\\n    }\\n\\n    /**\\n     * @dev Overload of {ECDSA-recover} that receives the `v`, `r` and `s` signature fields separately.\\n     */\\n    function recover(\\n        bytes32 hash,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    ) internal pure returns (address) {\\n        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature\\n        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines\\n        // the valid range for s in (281): 0 < s < secp256k1n \\u00f7 2 + 1, and for v in (282): v \\u2208 {27, 28}. Most\\n        // signatures from current libraries generate a unique signature with an s-value in the lower half order.\\n        //\\n        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value\\n        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or\\n        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept\\n        // these malleable signatures as well.\\n        require(\\n            uint256(s) <= 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0,\\n            \\\"ECDSA: invalid signature 's' value\\\"\\n        );\\n        require(v == 27 || v == 28, \\\"ECDSA: invalid signature 'v' value\\\");\\n\\n        // If the signature is valid (and not malleable), return the signer address\\n        address signer = ecrecover(hash, v, r, s);\\n        require(signer != address(0), \\\"ECDSA: invalid signature\\\");\\n\\n        return signer;\\n    }\\n\\n    /**\\n     * @dev Returns an Ethereum Signed Message, created from a `hash`. This\\n     * produces hash corresponding to the one signed with the\\n     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]\\n     * JSON-RPC method as part of EIP-191.\\n     *\\n     * See {recover}.\\n     */\\n    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32) {\\n        // 32 is the length in bytes of hash,\\n        // enforced by the type signature above\\n        return keccak256(abi.encodePacked(\\\"\\\\x19Ethereum Signed Message:\\\\n32\\\", hash));\\n    }\\n\\n    /**\\n     * @dev Returns an Ethereum Signed Typed Data, created from a\\n     * `domainSeparator` and a `structHash`. This produces hash corresponding\\n     * to the one signed with the\\n     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]\\n     * JSON-RPC method as part of EIP-712.\\n     *\\n     * See {recover}.\\n     */\\n    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32) {\\n        return keccak256(abi.encodePacked(\\\"\\\\x19\\\\x01\\\", domainSeparator, structHash));\\n    }\\n}\\n\",\"keccak256\":\"0x828774372910d18e7337bc31a288d786748af4cd9da80222467e486ed1d569ab\",\"license\":\"MIT\"},\"@openzeppelin/contracts/utils/math/Math.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Standard math utilities missing in the Solidity language.\\n */\\nlibrary Math {\\n    /**\\n     * @dev Returns the largest of two numbers.\\n     */\\n    function max(uint256 a, uint256 b) internal pure returns (uint256) {\\n        return a >= b ? a : b;\\n    }\\n\\n    /**\\n     * @dev Returns the smallest of two numbers.\\n     */\\n    function min(uint256 a, uint256 b) internal pure returns (uint256) {\\n        return a < b ? a : b;\\n    }\\n\\n    /**\\n     * @dev Returns the average of two numbers. The result is rounded towards\\n     * zero.\\n     */\\n    function average(uint256 a, uint256 b) internal pure returns (uint256) {\\n        // (a + b) / 2 can overflow, so we distribute.\\n        return (a / 2) + (b / 2) + (((a % 2) + (b % 2)) / 2);\\n    }\\n\\n    /**\\n     * @dev Returns the ceiling of the division of two numbers.\\n     *\\n     * This differs from standard division with `/` in that it rounds up instead\\n     * of rounding down.\\n     */\\n    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {\\n        // (a + b - 1) / b can overflow on addition, so we distribute.\\n        return a / b + (a % b == 0 ? 0 : 1);\\n    }\\n}\\n\",\"keccak256\":\"0x2cc1535d318fe533ffa4ad30de28f5abed305ff748bc72d0344072ac10007e29\",\"license\":\"MIT\"},\"@thesis/solidity-contracts/contracts/token/IApproveAndCall.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.4;\\n\\n/// @notice An interface that should be implemented by tokens supporting\\n///         `approveAndCall`/`receiveApproval` pattern.\\ninterface IApproveAndCall {\\n    /// @notice Executes `receiveApproval` function on spender as specified in\\n    ///         `IReceiveApproval` interface. Approves spender to withdraw from\\n    ///         the caller multiple times, up to the `amount`. If this\\n    ///         function is called again, it overwrites the current allowance\\n    ///         with `amount`. Reverts if the approval reverted or if\\n    ///         `receiveApproval` call on the spender reverted.\\n    function approveAndCall(\\n        address spender,\\n        uint256 amount,\\n        bytes memory extraData\\n    ) external returns (bool);\\n}\\n\",\"keccak256\":\"0x393d18ef81a57dcc96fff4c340cc2945deaebb37b9796c322cf2bc96872c3df8\",\"license\":\"MIT\"},\"@thesis/solidity-contracts/contracts/token/IERC20WithPermit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.4;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\\\";\\n\\nimport \\\"./IApproveAndCall.sol\\\";\\n\\n/// @title  IERC20WithPermit\\n/// @notice Burnable ERC20 token with EIP2612 permit functionality. User can\\n///         authorize a transfer of their token with a signature conforming\\n///         EIP712 standard instead of an on-chain transaction from their\\n///         address. Anyone can submit this signature on the user's behalf by\\n///         calling the permit function, as specified in EIP2612 standard,\\n///         paying gas fees, and possibly performing other actions in the same\\n///         transaction.\\ninterface IERC20WithPermit is IERC20, IERC20Metadata, IApproveAndCall {\\n    /// @notice EIP2612 approval made with secp256k1 signature.\\n    ///         Users can authorize a transfer of their tokens with a signature\\n    ///         conforming EIP712 standard, rather than an on-chain transaction\\n    ///         from their address. Anyone can submit this signature on the\\n    ///         user's behalf by calling the permit function, paying gas fees,\\n    ///         and possibly performing other actions in the same transaction.\\n    /// @dev    The deadline argument can be set to `type(uint256).max to create\\n    ///         permits that effectively never expire.\\n    function permit(\\n        address owner,\\n        address spender,\\n        uint256 amount,\\n        uint256 deadline,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    ) external;\\n\\n    /// @notice Destroys `amount` tokens from the caller.\\n    function burn(uint256 amount) external;\\n\\n    /// @notice Destroys `amount` of tokens from `account`, deducting the amount\\n    ///         from caller's allowance.\\n    function burnFrom(address account, uint256 amount) external;\\n\\n    /// @notice Returns hash of EIP712 Domain struct with the token name as\\n    ///         a signing domain and token contract as a verifying contract.\\n    ///         Used to construct EIP2612 signature provided to `permit`\\n    ///         function.\\n    /* solhint-disable-next-line func-name-mixedcase */\\n    function DOMAIN_SEPARATOR() external view returns (bytes32);\\n\\n    /// @notice Returns the current nonce for EIP2612 permission for the\\n    ///         provided token owner for a replay protection. Used to construct\\n    ///         EIP2612 signature provided to `permit` function.\\n    function nonce(address owner) external view returns (uint256);\\n\\n    /// @notice Returns EIP2612 Permit message hash. Used to construct EIP2612\\n    ///         signature provided to `permit` function.\\n    /* solhint-disable-next-line func-name-mixedcase */\\n    function PERMIT_TYPEHASH() external pure returns (bytes32);\\n}\\n\",\"keccak256\":\"0xdac9a5086c19a7128b505a7be1ab0ac1aa314f6989cb88d2417e9d7383f89fa9\",\"license\":\"MIT\"},\"@thesis/solidity-contracts/contracts/token/IReceiveApproval.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.4;\\n\\n/// @notice An interface that should be implemented by contracts supporting\\n///         `approveAndCall`/`receiveApproval` pattern.\\ninterface IReceiveApproval {\\n    /// @notice Receives approval to spend tokens. Called as a result of\\n    ///         `approveAndCall` call on the token.\\n    function receiveApproval(\\n        address from,\\n        uint256 amount,\\n        address token,\\n        bytes calldata extraData\\n    ) external;\\n}\\n\",\"keccak256\":\"0x6a30d83ad230548b1e7839737affc8489a035314209de14b89dbef7fb0f66395\",\"license\":\"MIT\"},\"contracts/bank/Bank.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@openzeppelin/contracts/access/Ownable.sol\\\";\\n\\nimport \\\"../vault/IVault.sol\\\";\\n\\n/// @title Bitcoin Bank\\n/// @notice Bank is a central component tracking Bitcoin balances. Balances can\\n///         be transferred between holders and holders can approve their\\n///         balances to be spent by others. Balances in the Bank are updated for\\n///         depositors who deposit their Bitcoin into the Bridge and only the\\n///         Bridge can increase balances.\\n/// @dev Bank is a governable contract and the Governance can upgrade the Bridge\\n///      address.\\ncontract Bank is Ownable {\\n    address public bridge;\\n\\n    /// @notice The balance of a given account in the Bank. Zero by default.\\n    mapping(address => uint256) public balanceOf;\\n\\n    /// @notice The remaining amount of balance a spender will be\\n    ///         allowed to transfer on behalf of an owner using\\n    ///         `transferBalanceFrom`. Zero by default.\\n    mapping(address => mapping(address => uint256)) public allowance;\\n\\n    /// @notice Returns the current nonce for EIP2612 permission for the\\n    ///         provided balance owner for a replay protection. Used to\\n    ///         construct EIP2612 signature provided to `permit` function.\\n    mapping(address => uint256) public nonce;\\n\\n    uint256 public immutable cachedChainId;\\n    bytes32 public immutable cachedDomainSeparator;\\n\\n    /// @notice Returns EIP2612 Permit message hash. Used to construct EIP2612\\n    ///         signature provided to `permit` function.\\n    bytes32 public constant PERMIT_TYPEHASH =\\n        keccak256(\\n            \\\"Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)\\\"\\n        );\\n\\n    event BalanceTransferred(\\n        address indexed from,\\n        address indexed to,\\n        uint256 amount\\n    );\\n\\n    event BalanceApproved(\\n        address indexed owner,\\n        address indexed spender,\\n        uint256 amount\\n    );\\n\\n    event BalanceIncreased(address indexed owner, uint256 amount);\\n\\n    event BalanceDecreased(address indexed owner, uint256 amount);\\n\\n    event BridgeUpdated(address newBridge);\\n\\n    modifier onlyBridge() {\\n        require(msg.sender == address(bridge), \\\"Caller is not the bridge\\\");\\n        _;\\n    }\\n\\n    constructor() {\\n        cachedChainId = block.chainid;\\n        cachedDomainSeparator = buildDomainSeparator();\\n    }\\n\\n    /// @notice Allows the Governance to upgrade the Bridge address.\\n    /// @dev The function does not implement any governance delay and does not\\n    ///      check the status of the Bridge. The Governance implementation needs\\n    ///      to ensure all requirements for the upgrade are satisfied before\\n    ///      executing this function.\\n    function updateBridge(address _bridge) external onlyOwner {\\n        require(_bridge != address(0), \\\"Bridge address must not be 0x0\\\");\\n        bridge = _bridge;\\n        emit BridgeUpdated(_bridge);\\n    }\\n\\n    /// @notice Moves the given `amount` of balance from the caller to\\n    ///         `recipient`.\\n    /// @dev Requirements:\\n    ///       - `recipient` cannot be the zero address,\\n    ///       - the caller must have a balance of at least `amount`.\\n    function transferBalance(address recipient, uint256 amount) external {\\n        _transferBalance(msg.sender, recipient, amount);\\n    }\\n\\n    /// @notice Sets `amount` as the allowance of `spender` over the caller's\\n    ///         balance.\\n    /// @dev If the `amount` is set to `type(uint256).max` then\\n    ///      `transferBalanceFrom` will not reduce an allowance.\\n    ///      Beware that changing an allowance with this function brings the\\n    ///      risk that someone may use both the old and the new allowance by\\n    ///      unfortunate transaction ordering. Please use\\n    ///      `increaseBalanceAllowance` and `decreaseBalanceAllowance` to\\n    ///      eliminate the risk.\\n    function approveBalance(address spender, uint256 amount) external {\\n        _approveBalance(msg.sender, spender, amount);\\n    }\\n\\n    /// @notice Sets `amount` as the allowance of a smart contract `vault` over\\n    ///         the caller's balance and calls the vault via\\n    ///         `receiveBalanceApproval`.\\n    /// @dev If the `amount` is set to `type(uint256).max` then the logic in\\n    ///     `receiveBalanceApproval` or later call to `transferBalanceFrom` by\\n    ///      the vault will not reduce an allowance. Beware that changing an\\n    ///      allowance with this function brings the risk that vault may use\\n    ///      both the old and the new allowance by unfortunate transaction\\n    ///      ordering. Please use `increaseBalanceAllowance` and\\n    ///      `decreaseBalanceAllowance` to eliminate the risk.\\n    function approveBalanceAndCall(address vault, uint256 amount) external {\\n        _approveBalance(msg.sender, vault, amount);\\n        IVault(vault).receiveBalanceApproval(msg.sender, amount);\\n    }\\n\\n    /// @notice Atomically increases the balance allowance granted to `spender`\\n    ///         by the caller by the given `addedValue`.\\n    function increaseBalanceAllowance(address spender, uint256 addedValue)\\n        external\\n    {\\n        _approveBalance(\\n            msg.sender,\\n            spender,\\n            allowance[msg.sender][spender] + addedValue\\n        );\\n    }\\n\\n    /// @notice Atomically decreases the balance allowance granted to `spender`\\n    ///         by the caller by the given `subtractedValue`.\\n    function decreaseBalanceAllowance(address spender, uint256 subtractedValue)\\n        external\\n    {\\n        uint256 currentAllowance = allowance[msg.sender][spender];\\n        require(\\n            currentAllowance >= subtractedValue,\\n            \\\"Can not decrease balance allowance below zero\\\"\\n        );\\n        unchecked {\\n            _approveBalance(\\n                msg.sender,\\n                spender,\\n                currentAllowance - subtractedValue\\n            );\\n        }\\n    }\\n\\n    /// @notice Moves `amount` of balance from `spender` to `recipient` using the\\n    ///         allowance mechanism. `amount` is then deducted from the caller's\\n    ///         allowance unless the allowance was made for `type(uint256).max`.\\n    /// @dev Requirements:\\n    ///      - `recipient` cannot be the zero address,\\n    ///      - `spender` must have a balance of at least `amount`,\\n    ///      - the caller must have allowance for `spender`'s balance of at\\n    ///        least `amount`.\\n    function transferBalanceFrom(\\n        address spender,\\n        address recipient,\\n        uint256 amount\\n    ) external {\\n        uint256 currentAllowance = allowance[spender][msg.sender];\\n        if (currentAllowance != type(uint256).max) {\\n            require(\\n                currentAllowance >= amount,\\n                \\\"Transfer amount exceeds allowance\\\"\\n            );\\n            unchecked {\\n                _approveBalance(spender, msg.sender, currentAllowance - amount);\\n            }\\n        }\\n        _transferBalance(spender, recipient, amount);\\n    }\\n\\n    /// @notice EIP2612 approval made with secp256k1 signature.\\n    ///         Users can authorize a transfer of their balance with a signature\\n    ///         conforming EIP712 standard, rather than an on-chain transaction\\n    ///         from their address. Anyone can submit this signature on the\\n    ///         user's behalf by calling the permit function, paying gas fees,\\n    ///         and possibly performing other actions in the same transaction.\\n    /// @dev The deadline argument can be set to `type(uint256).max to create\\n    ///      permits that effectively never expire.  If the `amount` is set\\n    ///      to `type(uint256).max` then `transferBalanceFrom` will not\\n    ///      reduce an allowance. Beware that changing an allowance with this\\n    ///      function brings the risk that someone may use both the old and the\\n    ///      new allowance by unfortunate transaction ordering. Please use\\n    ///      `increaseBalanceAllowance` and `decreaseBalanceAllowance` to\\n    ///      eliminate the risk.\\n    function permit(\\n        address owner,\\n        address spender,\\n        uint256 amount,\\n        uint256 deadline,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    ) external {\\n        /* solhint-disable-next-line not-rely-on-time */\\n        require(deadline >= block.timestamp, \\\"Permission expired\\\");\\n\\n        // Validate `s` and `v` values for a malleability concern described in EIP2.\\n        // Only signatures with `s` value in the lower half of the secp256k1\\n        // curve's order and `v` value of 27 or 28 are considered valid.\\n        require(\\n            uint256(s) <=\\n                0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0,\\n            \\\"Invalid signature 's' value\\\"\\n        );\\n        require(v == 27 || v == 28, \\\"Invalid signature 'v' value\\\");\\n\\n        bytes32 digest = keccak256(\\n            abi.encodePacked(\\n                \\\"\\\\x19\\\\x01\\\",\\n                DOMAIN_SEPARATOR(),\\n                keccak256(\\n                    abi.encode(\\n                        PERMIT_TYPEHASH,\\n                        owner,\\n                        spender,\\n                        amount,\\n                        nonce[owner]++,\\n                        deadline\\n                    )\\n                )\\n            )\\n        );\\n        address recoveredAddress = ecrecover(digest, v, r, s);\\n        require(\\n            recoveredAddress != address(0) && recoveredAddress == owner,\\n            \\\"Invalid signature\\\"\\n        );\\n        _approveBalance(owner, spender, amount);\\n    }\\n\\n    /// @notice Increases balances of the provided `recipients` by the provided\\n    ///         `amounts`. Can only be called by the Bridge.\\n    /// @dev Requirements:\\n    ///       - length of `recipients` and `amounts` must be the same.\\n    function increaseBalances(\\n        address[] calldata recipients,\\n        uint256[] calldata amounts\\n    ) external onlyBridge {\\n        require(\\n            recipients.length == amounts.length,\\n            \\\"Arrays must have the same length\\\"\\n        );\\n        for (uint256 i = 0; i < recipients.length; i++) {\\n            _increaseBalance(recipients[i], amounts[i]);\\n        }\\n    }\\n\\n    /// @notice Increases balance of the provided `recipient` by the provided\\n    ///         `amount`. Can only be called by the Bridge.\\n    function increaseBalance(address recipient, uint256 amount)\\n        external\\n        onlyBridge\\n    {\\n        _increaseBalance(recipient, amount);\\n    }\\n\\n    /// @notice Increases the given smart contract `vault`'s balance and\\n    ///         notifies the `vault` contract. Called by the Bridge after\\n    ///         the deposits routed by depositors to that `vault` have been\\n    ///         swept by the Bridge. This way, the depositor does not have to\\n    ///         issue a separate  transaction to the `vault` contract.\\n    ///         Can be called only by the Bridge.\\n    /// @dev Requirements:\\n    ///       - `vault` must implement `IVault` interface,\\n    ///       - length of `depositors` and `depositedAmounts` must be the same.\\n    /// @param vault Address of `IVault` recipient contract\\n    /// @param depositors Addresses of depositors whose deposits have been swept\\n    /// @param depositedAmounts Amounts deposited by individual depositors and\\n    ///        swept. The `vault`'s balance in the Bank will be increased by the\\n    ///        sum of all elements in this array.\\n    function increaseBalanceAndCall(\\n        address vault,\\n        address[] calldata depositors,\\n        uint256[] calldata depositedAmounts\\n    ) external onlyBridge {\\n        require(\\n            depositors.length == depositedAmounts.length,\\n            \\\"Arrays must have the same length\\\"\\n        );\\n        uint256 totalAmount = 0;\\n        for (uint256 i = 0; i < depositedAmounts.length; i++) {\\n            totalAmount += depositedAmounts[i];\\n        }\\n        _increaseBalance(vault, totalAmount);\\n        IVault(vault).receiveBalanceIncrease(depositors, depositedAmounts);\\n    }\\n\\n    /// @notice Decreases caller's balance by the provided `amount`. There is no\\n    ///         way to restore the balance so do not call this function unless\\n    ///         you really know what you are doing!\\n    function decreaseBalance(uint256 amount) external {\\n        balanceOf[msg.sender] -= amount;\\n        emit BalanceDecreased(msg.sender, amount);\\n    }\\n\\n    /// @notice Returns hash of EIP712 Domain struct with `TBTC Bank` as\\n    ///         a signing domain and Bank contract as a verifying contract.\\n    ///         Used to construct EIP2612 signature provided to `permit`\\n    ///         function.\\n    /* solhint-disable-next-line func-name-mixedcase */\\n    function DOMAIN_SEPARATOR() public view returns (bytes32) {\\n        // As explained in EIP-2612, if the DOMAIN_SEPARATOR contains the\\n        // chainId and is defined at contract deployment instead of\\n        // reconstructed for every signature, there is a risk of possible replay\\n        // attacks between chains in the event of a future chain split.\\n        // To address this issue, we check the cached chain ID against the\\n        // current one and in case they are different, we build domain separator\\n        // from scratch.\\n        if (block.chainid == cachedChainId) {\\n            return cachedDomainSeparator;\\n        } else {\\n            return buildDomainSeparator();\\n        }\\n    }\\n\\n    function _increaseBalance(address recipient, uint256 amount) internal {\\n        require(\\n            recipient != address(this),\\n            \\\"Can not increase balance for Bank\\\"\\n        );\\n        balanceOf[recipient] += amount;\\n        emit BalanceIncreased(recipient, amount);\\n    }\\n\\n    function _transferBalance(\\n        address spender,\\n        address recipient,\\n        uint256 amount\\n    ) private {\\n        require(\\n            recipient != address(0),\\n            \\\"Can not transfer to the zero address\\\"\\n        );\\n        require(\\n            recipient != address(this),\\n            \\\"Can not transfer to the Bank address\\\"\\n        );\\n\\n        uint256 spenderBalance = balanceOf[spender];\\n        require(spenderBalance >= amount, \\\"Transfer amount exceeds balance\\\");\\n        unchecked {\\n            balanceOf[spender] = spenderBalance - amount;\\n        }\\n        balanceOf[recipient] += amount;\\n        emit BalanceTransferred(spender, recipient, amount);\\n    }\\n\\n    function _approveBalance(\\n        address owner,\\n        address spender,\\n        uint256 amount\\n    ) private {\\n        require(spender != address(0), \\\"Can not approve to the zero address\\\");\\n        allowance[owner][spender] = amount;\\n        emit BalanceApproved(owner, spender, amount);\\n    }\\n\\n    function buildDomainSeparator() private view returns (bytes32) {\\n        return\\n            keccak256(\\n                abi.encode(\\n                    keccak256(\\n                        \\\"EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)\\\"\\n                    ),\\n                    keccak256(bytes(\\\"TBTC Bank\\\")),\\n                    keccak256(bytes(\\\"1\\\")),\\n                    block.chainid,\\n                    address(this)\\n                )\\n            );\\n    }\\n}\\n\",\"keccak256\":\"0x8c19af6dbb1974dcbf6bb623c6d3de6b28493b5f44e5fb1e36f47cdebf500453\",\"license\":\"MIT\"},\"contracts/bridge/BitcoinTx.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {ValidateSPV} from \\\"@keep-network/bitcoin-spv-sol/contracts/ValidateSPV.sol\\\";\\n\\nimport \\\"./BridgeState.sol\\\";\\n\\n/// @title Bitcoin transaction\\n/// @notice Allows to reference Bitcoin raw transaction in Solidity.\\n/// @dev See https://developer.bitcoin.org/reference/transactions.html#raw-transaction-format\\n///\\n///      Raw Bitcoin transaction data:\\n///\\n///      | Bytes  |     Name     |        BTC type        |        Description        |\\n///      |--------|--------------|------------------------|---------------------------|\\n///      | 4      | version      | int32_t (LE)           | TX version number         |\\n///      | varies | tx_in_count  | compactSize uint (LE)  | Number of TX inputs       |\\n///      | varies | tx_in        | txIn[]                 | TX inputs                 |\\n///      | varies | tx_out count | compactSize uint (LE)  | Number of TX outputs      |\\n///      | varies | tx_out       | txOut[]                | TX outputs                |\\n///      | 4      | lock_time    | uint32_t (LE)          | Unix time or block number |\\n///\\n//\\n///      Non-coinbase transaction input (txIn):\\n///\\n///      | Bytes  |       Name       |        BTC type        |                 Description                 |\\n///      |--------|------------------|------------------------|---------------------------------------------|\\n///      | 36     | previous_output  | outpoint               | The previous outpoint being spent           |\\n///      | varies | script bytes     | compactSize uint (LE)  | The number of bytes in the signature script |\\n///      | varies | signature script | char[]                 | The signature script, empty for P2WSH       |\\n///      | 4      | sequence         | uint32_t (LE)          | Sequence number                             |\\n///\\n///\\n///      The reference to transaction being spent (outpoint):\\n///\\n///      | Bytes | Name  |   BTC type    |               Description                |\\n///      |-------|-------|---------------|------------------------------------------|\\n///      |    32 | hash  | char[32]      | Hash of the transaction to spend         |\\n///      |    4  | index | uint32_t (LE) | Index of the specific output from the TX |\\n///\\n///\\n///      Transaction output (txOut):\\n///\\n///      | Bytes  |      Name       |     BTC type          |             Description              |\\n///      |--------|-----------------|-----------------------|--------------------------------------|\\n///      | 8      | value           | int64_t (LE)          | Number of satoshis to spend          |\\n///      | 1+     | pk_script_bytes | compactSize uint (LE) | Number of bytes in the pubkey script |\\n///      | varies | pk_script       | char[]                | Pubkey script                        |\\n///\\n///      compactSize uint format:\\n///\\n///      |                  Value                  | Bytes |                    Format                    |\\n///      |-----------------------------------------|-------|----------------------------------------------|\\n///      | >= 0 && <= 252                          | 1     | uint8_t                                      |\\n///      | >= 253 && <= 0xffff                     | 3     | 0xfd followed by the number as uint16_t (LE) |\\n///      | >= 0x10000 && <= 0xffffffff             | 5     | 0xfe followed by the number as uint32_t (LE) |\\n///      | >= 0x100000000 && <= 0xffffffffffffffff | 9     | 0xff followed by the number as uint64_t (LE) |\\n///\\n///      (*) compactSize uint is often references as VarInt)\\n///\\nlibrary BitcoinTx {\\n    using BTCUtils for bytes;\\n    using BTCUtils for uint256;\\n    using ValidateSPV for bytes;\\n    using ValidateSPV for bytes32;\\n\\n    /// @notice Represents Bitcoin transaction data.\\n    struct Info {\\n        /// @notice Bitcoin transaction version\\n        /// @dev `version` from raw Bitcoin transaction data.\\n        ///      Encoded as 4-bytes signed integer, little endian.\\n        bytes4 version;\\n        /// @notice All Bitcoin transaction inputs, prepended by the number of\\n        ///         transaction inputs.\\n        /// @dev `tx_in_count | tx_in` from raw Bitcoin transaction data.\\n        ///\\n        ///      The number of transaction inputs encoded as compactSize\\n        ///      unsigned integer, little-endian.\\n        ///\\n        ///      Note that some popular block explorers reverse the order of\\n        ///      bytes from `outpoint`'s `hash` and display it as big-endian.\\n        ///      Solidity code of Bridge expects hashes in little-endian, just\\n        ///      like they are represented in a raw Bitcoin transaction.\\n        bytes inputVector;\\n        /// @notice All Bitcoin transaction outputs prepended by the number of\\n        ///         transaction outputs.\\n        /// @dev `tx_out_count | tx_out` from raw Bitcoin transaction data.\\n        ///\\n        ///       The number of transaction outputs encoded as a compactSize\\n        ///       unsigned integer, little-endian.\\n        bytes outputVector;\\n        /// @notice Bitcoin transaction locktime.\\n        ///\\n        /// @dev `lock_time` from raw Bitcoin transaction data.\\n        ///      Encoded as 4-bytes unsigned integer, little endian.\\n        bytes4 locktime;\\n    }\\n\\n    /// @notice Represents data needed to perform a Bitcoin SPV proof.\\n    struct Proof {\\n        /// @notice The merkle proof of transaction inclusion in a block.\\n        bytes merkleProof;\\n        /// @notice Transaction index in the block (0-indexed).\\n        uint256 txIndexInBlock;\\n        /// @notice Single byte-string of 80-byte bitcoin headers,\\n        ///         lowest height first.\\n        bytes bitcoinHeaders;\\n    }\\n\\n    /// @notice Represents info about an unspent transaction output.\\n    struct UTXO {\\n        /// @notice Hash of the transaction the output belongs to.\\n        /// @dev Byte order corresponds to the Bitcoin internal byte order.\\n        bytes32 txHash;\\n        /// @notice Index of the transaction output (0-indexed).\\n        uint32 txOutputIndex;\\n        /// @notice Value of the transaction output.\\n        uint64 txOutputValue;\\n    }\\n\\n    /// @notice Represents Bitcoin signature in the R/S/V format.\\n    struct RSVSignature {\\n        /// @notice Signature r value.\\n        bytes32 r;\\n        /// @notice Signature s value.\\n        bytes32 s;\\n        /// @notice Signature recovery value.\\n        uint8 v;\\n    }\\n\\n    /// @notice Validates the SPV proof of the Bitcoin transaction.\\n    ///         Reverts in case the validation or proof verification fail.\\n    /// @param txInfo Bitcoin transaction data\\n    /// @param proof Bitcoin proof data\\n    /// @return txHash Proven 32-byte transaction hash.\\n    function validateProof(\\n        BridgeState.Storage storage self,\\n        Info calldata txInfo,\\n        Proof calldata proof\\n    ) internal view returns (bytes32 txHash) {\\n        require(\\n            txInfo.inputVector.validateVin(),\\n            \\\"Invalid input vector provided\\\"\\n        );\\n        require(\\n            txInfo.outputVector.validateVout(),\\n            \\\"Invalid output vector provided\\\"\\n        );\\n\\n        txHash = abi\\n            .encodePacked(\\n                txInfo.version,\\n                txInfo.inputVector,\\n                txInfo.outputVector,\\n                txInfo.locktime\\n            )\\n            .hash256View();\\n\\n        require(\\n            txHash.prove(\\n                proof.bitcoinHeaders.extractMerkleRootLE(),\\n                proof.merkleProof,\\n                proof.txIndexInBlock\\n            ),\\n            \\\"Tx merkle proof is not valid for provided header and tx hash\\\"\\n        );\\n\\n        evaluateProofDifficulty(self, proof.bitcoinHeaders);\\n\\n        return txHash;\\n    }\\n\\n    /// @notice Evaluates the given Bitcoin proof difficulty against the actual\\n    ///         Bitcoin chain difficulty provided by the relay oracle.\\n    ///         Reverts in case the evaluation fails.\\n    /// @param bitcoinHeaders Bitcoin headers chain being part of the SPV\\n    ///        proof. Used to extract the observed proof difficulty\\n    function evaluateProofDifficulty(\\n        BridgeState.Storage storage self,\\n        bytes memory bitcoinHeaders\\n    ) internal view {\\n        IRelay relay = self.relay;\\n        uint256 currentEpochDifficulty = relay.getCurrentEpochDifficulty();\\n        uint256 previousEpochDifficulty = relay.getPrevEpochDifficulty();\\n\\n        uint256 requestedDiff = 0;\\n        uint256 firstHeaderDiff = bitcoinHeaders\\n            .extractTarget()\\n            .calculateDifficulty();\\n\\n        if (firstHeaderDiff == currentEpochDifficulty) {\\n            requestedDiff = currentEpochDifficulty;\\n        } else if (firstHeaderDiff == previousEpochDifficulty) {\\n            requestedDiff = previousEpochDifficulty;\\n        } else {\\n            revert(\\\"Not at current or previous difficulty\\\");\\n        }\\n\\n        uint256 observedDiff = bitcoinHeaders.validateHeaderChain();\\n\\n        require(\\n            observedDiff != ValidateSPV.getErrBadLength(),\\n            \\\"Invalid length of the headers chain\\\"\\n        );\\n        require(\\n            observedDiff != ValidateSPV.getErrInvalidChain(),\\n            \\\"Invalid headers chain\\\"\\n        );\\n        require(\\n            observedDiff != ValidateSPV.getErrLowWork(),\\n            \\\"Insufficient work in a header\\\"\\n        );\\n\\n        require(\\n            observedDiff >= requestedDiff * self.txProofDifficultyFactor,\\n            \\\"Insufficient accumulated difficulty in header chain\\\"\\n        );\\n    }\\n}\\n\",\"keccak256\":\"0x94b3d2bd3f077810802906d88aa7be051f475f8f2721245117f8b292e570c3df\",\"license\":\"MIT\"},\"contracts/bridge/BridgeState.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {IWalletRegistry as EcdsaWalletRegistry} from \\\"@keep-network/ecdsa/contracts/api/IWalletRegistry.sol\\\";\\n\\nimport \\\"./IRelay.sol\\\";\\nimport \\\"./Deposit.sol\\\";\\nimport \\\"./Redemption.sol\\\";\\nimport \\\"./Fraud.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\nimport \\\"../bank/Bank.sol\\\";\\n\\nlibrary BridgeState {\\n    // TODO: Make parameters governable\\n    struct Storage {\\n        // Address of the Bank the Bridge belongs to.\\n        Bank bank;\\n        // Bitcoin relay providing the current Bitcoin network difficulty.\\n        IRelay relay;\\n        // ECDSA Wallet Registry contract handle.\\n        EcdsaWalletRegistry ecdsaWalletRegistry;\\n        // The number of confirmations on the Bitcoin chain required to\\n        // successfully evaluate an SPV proof.\\n        uint256 txProofDifficultyFactor;\\n        // Address where the deposit and redemption treasury fees will be sent\\n        // to. Treasury takes part in the operators rewarding process.\\n        address treasury;\\n        // The minimal amount that can be requested to deposit.\\n        // Value of this parameter must take into account the value of\\n        // `depositTreasuryFeeDivisor` and `depositTxMaxFee` parameters in order\\n        // to make requests that can incur the treasury and transaction fee and\\n        // still satisfy the depositor.\\n        uint64 depositDustThreshold;\\n        // Divisor used to compute the treasury fee taken from each deposit and\\n        // transferred to the treasury upon sweep proof submission. That fee is\\n        // computed as follows:\\n        // `treasuryFee = depositedAmount / depositTreasuryFeeDivisor`\\n        // For example, if the treasury fee needs to be 2% of each deposit,\\n        // the `depositTreasuryFeeDivisor` should be set to `50` because\\n        // `1/50 = 0.02 = 2%`.\\n        uint64 depositTreasuryFeeDivisor;\\n        // Maximum amount of BTC transaction fee that can be incurred by each\\n        // swept deposit being part of the given sweep transaction. If the\\n        // maximum BTC transaction fee is exceeded, such transaction is\\n        // considered a fraud.\\n        //\\n        // This is a per-deposit input max fee for the sweep transaction.\\n        uint64 depositTxMaxFee;\\n        // Collection of all revealed deposits indexed by\\n        // `keccak256(fundingTxHash | fundingOutputIndex)`.\\n        // The `fundingTxHash` is `bytes32` (ordered as in Bitcoin internally)\\n        // and `fundingOutputIndex` an `uint32`. This mapping may contain valid\\n        // and invalid deposits and the wallet is responsible for validating\\n        // them before attempting to execute a sweep.\\n        mapping(uint256 => Deposit.DepositRequest) deposits;\\n        // Indicates if the vault with the given address is trusted or not.\\n        // Depositors can route their revealed deposits only to trusted vaults\\n        // and have trusted vaults notified about new deposits as soon as these\\n        // deposits get swept. Vaults not trusted by the Bridge can still be\\n        // used by Bank balance owners on their own responsibility - anyone can\\n        // approve their Bank balance to any address.\\n        mapping(address => bool) isVaultTrusted;\\n        // Maximum amount of the total BTC transaction fee that is acceptable in\\n        // a single moving funds transaction.\\n        //\\n        // This is a TOTAL max fee for the moving funds transaction. Note\\n        // that `depositTxMaxFee` is per single deposit and `redemptionTxMaxFee`\\n        // if per single redemption. `movingFundsTxMaxTotalFee` is a total\\n        // fee for the entire transaction.\\n        uint64 movingFundsTxMaxTotalFee;\\n        // Time after which the moving funds process can be reported as\\n        // timed out. It is counted from the moment when the wallet\\n        // was requested to move their funds and switched to the MovingFunds\\n        // state. Value in seconds.\\n        uint32 movingFundsTimeout;\\n        // The amount of stake slashed from each member of a wallet for a moving\\n        // funds timeout.\\n        uint96 movingFundsTimeoutSlashingAmount;\\n        // The percentage of the notifier reward from the staking contract\\n        // the notifier of a moving funds timeout receives. The value is in the\\n        // range [0, 100].\\n        uint256 movingFundsTimeoutNotifierRewardMultiplier;\\n        // The minimal satoshi amount that makes sense to be transferred during\\n        // the moving funds process. Moving funds wallets having their BTC\\n        // balance below that value can begin closing immediately as\\n        // transferring such a low value may not be possible due to\\n        // BTC network fees.\\n        uint64 movingFundsDustThreshold;\\n        // The minimal amount that can be requested for redemption.\\n        // Value of this parameter must take into account the value of\\n        // `redemptionTreasuryFeeDivisor` and `redemptionTxMaxFee`\\n        // parameters in order to make requests that can incur the\\n        // treasury and transaction fee and still satisfy the redeemer.\\n        uint64 redemptionDustThreshold;\\n        // Divisor used to compute the treasury fee taken from each\\n        // redemption request and transferred to the treasury upon\\n        // successful request finalization. That fee is computed as follows:\\n        // `treasuryFee = requestedAmount / redemptionTreasuryFeeDivisor`\\n        // For example, if the treasury fee needs to be 2% of each\\n        // redemption request, the `redemptionTreasuryFeeDivisor` should\\n        // be set to `50` because `1/50 = 0.02 = 2%`.\\n        uint64 redemptionTreasuryFeeDivisor;\\n        // Maximum amount of BTC transaction fee that can be incurred by\\n        // each redemption request being part of the given redemption\\n        // transaction. If the maximum BTC transaction fee is exceeded, such\\n        // transaction is considered a fraud.\\n        //\\n        // This is a per-redemption output max fee for the redemption\\n        // transaction.\\n        uint64 redemptionTxMaxFee;\\n        // Time after which the redemption request can be reported as\\n        // timed out. It is counted from the moment when the redemption\\n        // request was created via `requestRedemption` call. Reported\\n        // timed out requests are cancelled and locked TBTC is returned\\n        // to the redeemer in full amount.\\n        uint256 redemptionTimeout;\\n        // The amount of stake slashed from each member of a wallet for a\\n        // redemption timeout.\\n        uint96 redemptionTimeoutSlashingAmount;\\n        // The percentage of the notifier reward from the staking contract\\n        // the notifier of a redemption timeout receives. The value is in the\\n        // range [0, 100].\\n        uint256 redemptionTimeoutNotifierRewardMultiplier;\\n        // Collection of all pending redemption requests indexed by\\n        // redemption key built as\\n        // `keccak256(walletPubKeyHash | redeemerOutputScript)`.\\n        // The `walletPubKeyHash` is the 20-byte wallet's public key hash\\n        // (computed using Bitcoin HASH160 over the compressed ECDSA\\n        // public key) and `redeemerOutputScript` is a Bitcoin script\\n        // (P2PKH, P2WPKH, P2SH or P2WSH) that will be used to lock\\n        // redeemed BTC as requested by the redeemer. Requests are added\\n        // to this mapping by the `requestRedemption` method (duplicates\\n        // not allowed) and are removed by one of the following methods:\\n        // - `submitRedemptionProof` in case the request was handled\\n        //    successfully\\n        // - `notifyRedemptionTimeout` in case the request was reported\\n        //    to be timed out\\n        mapping(uint256 => Redemption.RedemptionRequest) pendingRedemptions;\\n        // Collection of all timed out redemptions requests indexed by\\n        // redemption key built as\\n        // `keccak256(walletPubKeyHash | redeemerOutputScript)`. The\\n        // `walletPubKeyHash` is the 20-byte wallet's public key hash\\n        // (computed using Bitcoin HASH160 over the compressed ECDSA\\n        // public key) and `redeemerOutputScript` is the Bitcoin script\\n        // (P2PKH, P2WPKH, P2SH or P2WSH) that is involved in the timed\\n        // out request. Timed out requests are stored in this mapping to\\n        // avoid slashing the wallets multiple times for the same timeout.\\n        // Only one method can add to this mapping:\\n        // - `notifyRedemptionTimeout` which puts the redemption key to this\\n        //    mapping basing on a timed out request stored previously in\\n        //    `pendingRedemptions` mapping.\\n        mapping(uint256 => Redemption.RedemptionRequest) timedOutRedemptions;\\n        // The amount of stake slashed from each member of a wallet for a fraud.\\n        uint96 fraudSlashingAmount;\\n        // The percentage of the notifier reward from the staking contract\\n        // the notifier of a fraud receives. The value is in the range [0, 100].\\n        uint256 fraudNotifierRewardMultiplier;\\n        // The amount of time the wallet has to defeat a fraud challenge.\\n        uint256 fraudChallengeDefeatTimeout;\\n        // The amount of ETH in wei the party challenging the wallet for fraud\\n        // needs to deposit.\\n        uint256 fraudChallengeDepositAmount;\\n        // Collection of all submitted fraud challenges indexed by challenge\\n        // key built as `keccak256(walletPublicKey|sighash)`.\\n        mapping(uint256 => Fraud.FraudChallenge) fraudChallenges;\\n        // Collection of main UTXOs that are honestly spent indexed by\\n        // `keccak256(fundingTxHash | fundingOutputIndex)`. The `fundingTxHash`\\n        // is `bytes32` (ordered as in Bitcoin internally) and\\n        // `fundingOutputIndex` an `uint32`. A main UTXO is considered honestly\\n        // spent if it was used as an input of a transaction that have been\\n        // proven in the Bridge.\\n        mapping(uint256 => bool) spentMainUTXOs;\\n        // Determines how frequently a new wallet creation can be requested.\\n        // Value in seconds.\\n        uint32 walletCreationPeriod;\\n        // The minimum BTC threshold in satoshi that is used to decide about\\n        // wallet creation. Specifically, we allow for the creation of a new\\n        // wallet if the active wallet is old enough and their amount of BTC\\n        // is greater than or equal this threshold.\\n        uint64 walletCreationMinBtcBalance;\\n        // The maximum BTC threshold in satoshi that is used to decide about\\n        // wallet creation. Specifically, we allow for the creation of a new\\n        // wallet if the active wallet's amount of BTC is greater than or equal\\n        // this threshold, regardless of the active wallet's age.\\n        uint64 walletCreationMaxBtcBalance;\\n        // The minimum BTC threshold in satoshi that is used to decide about\\n        // wallet closing. Specifically, we allow for the closure of the given\\n        // wallet if their amount of BTC is lesser than this threshold,\\n        // regardless of the wallet's age.\\n        uint64 walletClosureMinBtcBalance;\\n        // The maximum age of a wallet in seconds, after which the wallet\\n        // moving funds process can be requested.\\n        uint32 walletMaxAge;\\n        // 20-byte wallet public key hash being reference to the currently\\n        // active wallet. Can be unset to the zero value under certain\\n        // circumstances.\\n        bytes20 activeWalletPubKeyHash;\\n        // The current number of wallets in the Live state.\\n        uint32 liveWalletsCount;\\n        // The maximum BTC amount in satoshi than can be transferred to a single\\n        // target wallet during the moving funds process.\\n        uint64 walletMaxBtcTransfer;\\n        // Determines the length of the wallet closing period, i.e. the period\\n        // when the wallet remains in the Closing state and can be subject\\n        // of deposit fraud challenges. This value is in seconds and should be\\n        // greater than the deposit refund time plus some time margin.\\n        uint32 walletClosingPeriod;\\n        // Maps the 20-byte wallet public key hash (computed using Bitcoin\\n        // HASH160 over the compressed ECDSA public key) to the basic wallet\\n        // information like state and pending redemptions value.\\n        mapping(bytes20 => Wallets.Wallet) registeredWallets;\\n    }\\n\\n    event DepositParametersUpdated(\\n        uint64 depositDustThreshold,\\n        uint64 depositTreasuryFeeDivisor,\\n        uint64 depositTxMaxFee\\n    );\\n\\n    event RedemptionParametersUpdated(\\n        uint64 redemptionDustThreshold,\\n        uint64 redemptionTreasuryFeeDivisor,\\n        uint64 redemptionTxMaxFee,\\n        uint256 redemptionTimeout,\\n        uint96 redemptionTimeoutSlashingAmount,\\n        uint256 redemptionTimeoutNotifierRewardMultiplier\\n    );\\n\\n    event MovingFundsParametersUpdated(\\n        uint64 movingFundsTxMaxTotalFee,\\n        uint32 movingFundsTimeout,\\n        uint96 movingFundsTimeoutSlashingAmount,\\n        uint256 movingFundsTimeoutNotifierRewardMultiplier,\\n        uint64 movingFundsDustThreshold\\n    );\\n\\n    event WalletParametersUpdated(\\n        uint32 walletCreationPeriod,\\n        uint64 walletCreationMinBtcBalance,\\n        uint64 walletCreationMaxBtcBalance,\\n        uint64 walletClosureMinBtcBalance,\\n        uint32 walletMaxAge,\\n        uint64 walletMaxBtcTransfer,\\n        uint32 walletClosingPeriod\\n    );\\n\\n    event FraudParametersUpdated(\\n        uint96 fraudSlashingAmount,\\n        uint256 fraudNotifierRewardMultiplier,\\n        uint256 fraudChallengeDefeatTimeout,\\n        uint256 fraudChallengeDepositAmount\\n    );\\n\\n    /// @notice Updates parameters of deposits.\\n    /// @param _depositDustThreshold New value of the deposit dust threshold in\\n    ///        satoshis. It is the minimal amount that can be requested to\\n    ////       deposit. Value of this parameter must take into account the value\\n    ///        of `depositTreasuryFeeDivisor` and `depositTxMaxFee` parameters\\n    ///        in order to make requests that can incur the treasury and\\n    ///        transaction fee and still satisfy the depositor\\n    /// @param _depositTreasuryFeeDivisor New value of the treasury fee divisor.\\n    ///        It is the divisor used to compute the treasury fee taken from\\n    ///        each deposit and transferred to the treasury upon sweep proof\\n    ///        submission. That fee is computed as follows:\\n    ///        `treasuryFee = depositedAmount / depositTreasuryFeeDivisor`\\n    ///        For example, if the treasury fee needs to be 2% of each deposit,\\n    ///        the `depositTreasuryFeeDivisor` should be set to `50`\\n    ///        because `1/50 = 0.02 = 2%`\\n    /// @param _depositTxMaxFee New value of the deposit tx max fee in satoshis.\\n    ///        It is the maximum amount of BTC transaction fee that can\\n    ///        be incurred by each swept deposit being part of the given sweep\\n    ///        transaction. If the maximum BTC transaction fee is exceeded,\\n    ///        such transaction is considered a fraud\\n    /// @dev Requirements:\\n    ///      - Deposit dust threshold must be greater than zero\\n    ///      - Deposit treasury fee divisor must be greater than zero\\n    ///      - Deposit transaction max fee must be greater than zero\\n    function updateDepositParameters(\\n        Storage storage self,\\n        uint64 _depositDustThreshold,\\n        uint64 _depositTreasuryFeeDivisor,\\n        uint64 _depositTxMaxFee\\n    ) internal {\\n        require(\\n            _depositDustThreshold > 0,\\n            \\\"Deposit dust threshold must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _depositTreasuryFeeDivisor > 0,\\n            \\\"Deposit treasury fee divisor must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _depositTxMaxFee > 0,\\n            \\\"Deposit transaction max fee must be greater than zero\\\"\\n        );\\n\\n        self.depositDustThreshold = _depositDustThreshold;\\n        self.depositTreasuryFeeDivisor = _depositTreasuryFeeDivisor;\\n        self.depositTxMaxFee = _depositTxMaxFee;\\n\\n        emit DepositParametersUpdated(\\n            _depositDustThreshold,\\n            _depositTreasuryFeeDivisor,\\n            _depositTxMaxFee\\n        );\\n    }\\n\\n    /// @notice Updates parameters of redemptions.\\n    /// @param _redemptionDustThreshold New value of the redemption dust\\n    ///        threshold in satoshis. It is the minimal amount that can be\\n    ///        requested for redemption. Value of this parameter must take into\\n    ///        account the value of `redemptionTreasuryFeeDivisor` and\\n    ///        `redemptionTxMaxFee` parameters in order to make requests that\\n    ///        can incur the treasury and transaction fee and still satisfy the\\n    ///        redeemer.\\n    /// @param _redemptionTreasuryFeeDivisor New value of the redemption\\n    ///        treasury fee divisor. It is the divisor used to compute the\\n    ///        treasury fee taken from each redemption request and transferred\\n    ///        to the treasury upon successful request finalization. That fee is\\n    ///        computed as follows:\\n    ///        `treasuryFee = requestedAmount / redemptionTreasuryFeeDivisor`\\n    ///        For example, if the treasury fee needs to be 2% of each\\n    ///        redemption request, the `redemptionTreasuryFeeDivisor` should\\n    ///        be set to `50` because `1/50 = 0.02 = 2%`.\\n    /// @param _redemptionTxMaxFee New value of the redemption transaction max\\n    ///        fee in satoshis. It is the maximum amount of BTC transaction fee\\n    ///        that can be incurred by each redemption request being part of the\\n    ///        given redemption transaction. If the maximum BTC transaction fee\\n    ///        is exceeded, such transaction is considered a fraud.\\n    ///        This is a per-redemption output max fee for the redemption\\n    ///        transaction.\\n    /// @param _redemptionTimeout New value of the redemption timeout in seconds.\\n    ///        It is the time after which the redemption request can be reported\\n    ///        as timed out. It is counted from the moment when the redemption\\n    ///        request was created via `requestRedemption` call. Reported  timed\\n    ///        out requests are cancelled and locked TBTC is returned to the\\n    ///        redeemer in full amount.\\n    /// @param _redemptionTimeoutSlashingAmount New value of the redemption\\n    ///        timeout slashing amount in T, it is the amount slashed from each\\n    ///        wallet member for redemption timeout\\n    /// @param _redemptionTimeoutNotifierRewardMultiplier New value of the\\n    ///        redemption timeout notifier reward multiplier as percentage,\\n    ///        it determines the percentage of the notifier reward from the\\n    ///        staking contact the notifier of a redemption timeout receives.\\n    ///        The value must be in the range [0, 100]\\n    /// @dev Requirements:\\n    ///      - Redemption dust threshold must be greater than zero\\n    ///      - Redemption treasury fee divisor must be greater than zero\\n    ///      - Redemption transaction max fee must be greater than zero\\n    ///      - Redemption timeout must be greater than zero\\n    ///      - Redemption timeout notifier reward multiplier must be in the\\n    ///        range [0, 100]\\n    function updateRedemptionParameters(\\n        Storage storage self,\\n        uint64 _redemptionDustThreshold,\\n        uint64 _redemptionTreasuryFeeDivisor,\\n        uint64 _redemptionTxMaxFee,\\n        uint256 _redemptionTimeout,\\n        uint96 _redemptionTimeoutSlashingAmount,\\n        uint256 _redemptionTimeoutNotifierRewardMultiplier\\n    ) internal {\\n        require(\\n            _redemptionDustThreshold > 0,\\n            \\\"Redemption dust threshold must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTreasuryFeeDivisor > 0,\\n            \\\"Redemption treasury fee divisor must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTxMaxFee > 0,\\n            \\\"Redemption transaction max fee must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTimeout > 0,\\n            \\\"Redemption timeout must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTimeoutNotifierRewardMultiplier <= 100,\\n            \\\"Redemption timeout notifier reward multiplier must be in the range [0, 100]\\\"\\n        );\\n\\n        self.redemptionDustThreshold = _redemptionDustThreshold;\\n        self.redemptionTreasuryFeeDivisor = _redemptionTreasuryFeeDivisor;\\n        self.redemptionTxMaxFee = _redemptionTxMaxFee;\\n        self.redemptionTimeout = _redemptionTimeout;\\n        self.redemptionTimeoutSlashingAmount = _redemptionTimeoutSlashingAmount;\\n        self\\n            .redemptionTimeoutNotifierRewardMultiplier = _redemptionTimeoutNotifierRewardMultiplier;\\n\\n        emit RedemptionParametersUpdated(\\n            _redemptionDustThreshold,\\n            _redemptionTreasuryFeeDivisor,\\n            _redemptionTxMaxFee,\\n            _redemptionTimeout,\\n            _redemptionTimeoutSlashingAmount,\\n            _redemptionTimeoutNotifierRewardMultiplier\\n        );\\n    }\\n\\n    /// @notice Updates parameters of moving funds.\\n    /// @param _movingFundsTxMaxTotalFee New value of the moving funds transaction\\n    ///        max total fee in satoshis. It is the maximum amount of the total\\n    ///        BTC transaction fee that is acceptable in a single moving funds\\n    ///        transaction. This is a _total_ max fee for the entire moving\\n    ///        funds transaction.\\n    /// @param _movingFundsTimeout New value of the moving funds timeout in\\n    ///        seconds. It is the time after which the moving funds process can\\n    ///        be reported as timed out. It is counted from the moment when the\\n    ///        wallet was requested to move their funds and switched to the\\n    ///        MovingFunds state.\\n    /// @param _movingFundsTimeoutSlashingAmount New value of the moving funds\\n    ///        timeout slashing amount in T, it is the amount slashed from each\\n    ///        wallet member for moving funds timeout\\n    /// @param _movingFundsTimeoutNotifierRewardMultiplier New value of the\\n    ///        moving funds timeout notifier reward multiplier as percentage,\\n    ///        it determines the percentage of the notifier reward from the\\n    ///        staking contact the notifier of a moving funds timeout receives.\\n    ///        The value must be in the range [0, 100]\\n    /// @param _movingFundsDustThreshold New value of the moving funds dust\\n    ///        threshold. It is the minimal satoshi amount that makes sense to\\n    //         be transferred during the moving funds process. Moving funds\\n    //         wallets having their BTC balance below that value can begin\\n    //         closing immediately as transferring such a low value may not be\\n    //         possible due to BTC network fees.\\n    /// @dev Requirements:\\n    ///      - Moving funds transaction max total fee must be greater than zero\\n    ///      - Moving funds timeout must be greater than zero\\n    ///      - Moving funds timeout notifier reward multiplier must be in the\\n    ///        range [0, 100]\\n    ///      - Moving funds dust threshold must be greater than zero\\n    function updateMovingFundsParameters(\\n        Storage storage self,\\n        uint64 _movingFundsTxMaxTotalFee,\\n        uint32 _movingFundsTimeout,\\n        uint96 _movingFundsTimeoutSlashingAmount,\\n        uint256 _movingFundsTimeoutNotifierRewardMultiplier,\\n        uint64 _movingFundsDustThreshold\\n    ) internal {\\n        require(\\n            _movingFundsTxMaxTotalFee > 0,\\n            \\\"Moving funds transaction max total fee must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _movingFundsTimeout > 0,\\n            \\\"Moving funds timeout must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _movingFundsTimeoutNotifierRewardMultiplier <= 100,\\n            \\\"Moving funds timeout notifier reward multiplier must be in the range [0, 100]\\\"\\n        );\\n\\n        require(\\n            _movingFundsDustThreshold > 0,\\n            \\\"Moving funds dust threshold must be greater than zero\\\"\\n        );\\n\\n        self.movingFundsTxMaxTotalFee = _movingFundsTxMaxTotalFee;\\n        self.movingFundsTimeout = _movingFundsTimeout;\\n        self\\n            .movingFundsTimeoutSlashingAmount = _movingFundsTimeoutSlashingAmount;\\n        self\\n            .movingFundsTimeoutNotifierRewardMultiplier = _movingFundsTimeoutNotifierRewardMultiplier;\\n        self.movingFundsDustThreshold = _movingFundsDustThreshold;\\n\\n        emit MovingFundsParametersUpdated(\\n            _movingFundsTxMaxTotalFee,\\n            _movingFundsTimeout,\\n            _movingFundsTimeoutSlashingAmount,\\n            _movingFundsTimeoutNotifierRewardMultiplier,\\n            _movingFundsDustThreshold\\n        );\\n    }\\n\\n    /// @notice Updates parameters of wallets.\\n    /// @param _walletCreationPeriod New value of the wallet creation period in\\n    ///        seconds, determines how frequently a new wallet creation can be\\n    ///        requested\\n    /// @param _walletCreationMinBtcBalance New value of the wallet minimum BTC\\n    ///        balance in satoshi, used to decide about wallet creation\\n    /// @param _walletCreationMaxBtcBalance New value of the wallet maximum BTC\\n    ///        balance in satoshi, used to decide about wallet creation\\n    /// @param _walletClosureMinBtcBalance New value of the wallet minimum BTC\\n    ///        balance in satoshi, used to decide about wallet closure\\n    /// @param _walletMaxAge New value of the wallet maximum age in seconds,\\n    ///        indicates the maximum age of a wallet in seconds, after which\\n    ///        the wallet moving funds process can be requested\\n    /// @param _walletMaxBtcTransfer New value of the wallet maximum BTC transfer\\n    ///        in satoshi, determines the maximum amount that can be transferred\\n    ///        to a single target wallet during the moving funds process\\n    /// @param _walletClosingPeriod New value of the wallet closing period in\\n    ///        seconds, determines the length of the wallet closing period,\\n    //         i.e. the period when the wallet remains in the Closing state\\n    //         and can be subject of deposit fraud challenges\\n    /// @dev Requirements:\\n    ///      - Wallet minimum BTC balance must be greater than zero\\n    ///      - Wallet maximum BTC balance must be greater than the wallet\\n    ///        minimum BTC balance\\n    ///      - Wallet maximum BTC transfer must be greater than zero\\n    ///      - Wallet closing period must be greater than zero\\n    function updateWalletParameters(\\n        Storage storage self,\\n        uint32 _walletCreationPeriod,\\n        uint64 _walletCreationMinBtcBalance,\\n        uint64 _walletCreationMaxBtcBalance,\\n        uint64 _walletClosureMinBtcBalance,\\n        uint32 _walletMaxAge,\\n        uint64 _walletMaxBtcTransfer,\\n        uint32 _walletClosingPeriod\\n    ) internal {\\n        require(\\n            _walletCreationMaxBtcBalance > _walletCreationMinBtcBalance,\\n            \\\"Wallet creation maximum BTC balance must be greater than the creation minimum BTC balance\\\"\\n        );\\n        require(\\n            _walletClosureMinBtcBalance > 0,\\n            \\\"Wallet closure minimum BTC balance must be greater than zero\\\"\\n        );\\n        require(\\n            _walletMaxBtcTransfer > 0,\\n            \\\"Wallet maximum BTC transfer must be greater than zero\\\"\\n        );\\n        require(\\n            _walletClosingPeriod > 0,\\n            \\\"Wallet closing period must be greater than zero\\\"\\n        );\\n\\n        self.walletCreationPeriod = _walletCreationPeriod;\\n        self.walletCreationMinBtcBalance = _walletCreationMinBtcBalance;\\n        self.walletCreationMaxBtcBalance = _walletCreationMaxBtcBalance;\\n        self.walletClosureMinBtcBalance = _walletClosureMinBtcBalance;\\n        self.walletMaxAge = _walletMaxAge;\\n        self.walletMaxBtcTransfer = _walletMaxBtcTransfer;\\n        self.walletClosingPeriod = _walletClosingPeriod;\\n\\n        emit WalletParametersUpdated(\\n            _walletCreationPeriod,\\n            _walletCreationMinBtcBalance,\\n            _walletCreationMaxBtcBalance,\\n            _walletClosureMinBtcBalance,\\n            _walletMaxAge,\\n            _walletMaxBtcTransfer,\\n            _walletClosingPeriod\\n        );\\n    }\\n\\n    /// @notice Updates parameters related to frauds.\\n    /// @param _fraudSlashingAmount New value of the fraud slashing amount in T,\\n    ///        it is the amount slashed from each wallet member for committing\\n    ///        a fraud\\n    /// @param _fraudNotifierRewardMultiplier New value of the fraud notifier\\n    ///        reward multiplier as percentage, it determines the percentage of\\n    ///        the notifier reward from the staking contact the notifier of\\n    ///        a fraud receives. The value must be in the range [0, 100]\\n    /// @param _fraudChallengeDefeatTimeout New value of the challenge defeat\\n    ///        timeout in seconds, it is the amount of time the wallet has to\\n    ///        defeat a fraud challenge. The value must be greater than zero\\n    /// @param _fraudChallengeDepositAmount New value of the fraud challenge\\n    ///        deposit amount in wei, it is the amount of ETH the party\\n    ///        challenging the wallet for fraud needs to deposit\\n    /// @dev Requirements:\\n    ///      - Fraud notifier reward multiplier must be in the range [0, 100]\\n    ///      - Fraud challenge defeat timeout must be greater than 0\\n    function updateFraudParameters(\\n        Storage storage self,\\n        uint96 _fraudSlashingAmount,\\n        uint256 _fraudNotifierRewardMultiplier,\\n        uint256 _fraudChallengeDefeatTimeout,\\n        uint256 _fraudChallengeDepositAmount\\n    ) internal {\\n        require(\\n            _fraudNotifierRewardMultiplier <= 100,\\n            \\\"Fraud notifier reward multiplier must be in the range [0, 100]\\\"\\n        );\\n\\n        require(\\n            _fraudChallengeDefeatTimeout > 0,\\n            \\\"Fraud challenge defeat timeout must be greater than zero\\\"\\n        );\\n\\n        self.fraudSlashingAmount = _fraudSlashingAmount;\\n        self.fraudNotifierRewardMultiplier = _fraudNotifierRewardMultiplier;\\n        self.fraudChallengeDefeatTimeout = _fraudChallengeDefeatTimeout;\\n        self.fraudChallengeDepositAmount = _fraudChallengeDepositAmount;\\n\\n        emit FraudParametersUpdated(\\n            _fraudSlashingAmount,\\n            _fraudNotifierRewardMultiplier,\\n            _fraudChallengeDefeatTimeout,\\n            _fraudChallengeDepositAmount\\n        );\\n    }\\n}\\n\",\"keccak256\":\"0x821b1146c4afb77f4943cde60b2565d1cbf11dd64889e302f926fdaacffead90\",\"license\":\"MIT\"},\"contracts/bridge/Deposit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\n/// @title Bridge deposit\\n/// @notice The library handles the logic for revealing Bitcoin deposits to\\n///         the Bridge.\\n/// @dev The depositor puts together a P2SH or P2WSH address to deposit the\\n///      funds. This script is unique to each depositor and looks like this:\\n///\\n///      ```\\n///      <depositorAddress> DROP\\n///      <blindingFactor> DROP\\n///      DUP HASH160 <walletPubKeyHash> EQUAL\\n///      IF\\n///        CHECKSIG\\n///      ELSE\\n///        DUP HASH160 <refundPubkeyHash> EQUALVERIFY\\n///        <refundLocktime> CHECKLOCKTIMEVERIFY DROP\\n///        CHECKSIG\\n///      ENDIF\\n///      ```\\n///\\n///      Since each depositor has their own Ethereum address and their own\\n///      secret blinding factor, each depositor\\u2019s script is unique, and the hash\\n///      of each depositor\\u2019s script is unique.\\nlibrary Deposit {\\n    using BTCUtils for bytes;\\n    using BytesLib for bytes;\\n\\n    /// @notice Represents data which must be revealed by the depositor during\\n    ///         deposit reveal.\\n    struct DepositRevealInfo {\\n        // Index of the funding output belonging to the funding transaction.\\n        uint32 fundingOutputIndex;\\n        // Ethereum depositor address.\\n        address depositor;\\n        // The blinding factor as 8 bytes. Byte endianness doesn't matter\\n        // as this factor is not interpreted as uint.\\n        bytes8 blindingFactor;\\n        // The compressed Bitcoin public key (33 bytes and 02 or 03 prefix)\\n        // of the deposit's wallet hashed in the HASH160 Bitcoin opcode style.\\n        bytes20 walletPubKeyHash;\\n        // The compressed Bitcoin public key (33 bytes and 02 or 03 prefix)\\n        // that can be used to make the deposit refund after the refund\\n        // locktime passes. Hashed in the HASH160 Bitcoin opcode style.\\n        bytes20 refundPubKeyHash;\\n        // The refund locktime (4-byte LE). Interpreted according to locktime\\n        // parsing rules described in:\\n        // https://developer.bitcoin.org/devguide/transactions.html#locktime-and-sequence-number\\n        // and used with OP_CHECKLOCKTIMEVERIFY opcode as described in:\\n        // https://github.com/bitcoin/bips/blob/master/bip-0065.mediawiki\\n        bytes4 refundLocktime;\\n        // Address of the Bank vault to which the deposit is routed to.\\n        // Optional, can be 0x0. The vault must be trusted by the Bridge.\\n        address vault;\\n    }\\n\\n    /// @notice Represents tBTC deposit request data.\\n    struct DepositRequest {\\n        // Ethereum depositor address.\\n        address depositor;\\n        // Deposit amount in satoshi.\\n        uint64 amount;\\n        // UNIX timestamp the deposit was revealed at.\\n        uint32 revealedAt;\\n        // Address of the Bank vault the deposit is routed to.\\n        // Optional, can be 0x0.\\n        address vault;\\n        // Treasury TBTC fee in satoshi at the moment of deposit reveal.\\n        uint64 treasuryFee;\\n        // UNIX timestamp the deposit was swept at. Note this is not the\\n        // time when the deposit was swept on the Bitcoin chain but actually\\n        // the time when the sweep proof was delivered to the Ethereum chain.\\n        uint32 sweptAt;\\n    }\\n\\n    event DepositRevealed(\\n        bytes32 fundingTxHash,\\n        uint32 fundingOutputIndex,\\n        address depositor,\\n        uint64 amount,\\n        bytes8 blindingFactor,\\n        bytes20 walletPubKeyHash,\\n        bytes20 refundPubKeyHash,\\n        bytes4 refundLocktime,\\n        address vault\\n    );\\n\\n    /// @notice Used by the depositor to reveal information about their P2(W)SH\\n    ///         Bitcoin deposit to the Bridge on Ethereum chain. The off-chain\\n    ///         wallet listens for revealed deposit events and may decide to\\n    ///         include the revealed deposit in the next executed sweep.\\n    ///         Information about the Bitcoin deposit can be revealed before or\\n    ///         after the Bitcoin transaction with P2(W)SH deposit is mined on\\n    ///         the Bitcoin chain. Worth noting, the gas cost of this function\\n    ///         scales with the number of P2(W)SH transaction inputs and\\n    ///         outputs. The deposit may be routed to one of the trusted vaults.\\n    ///         When a deposit is routed to a vault, vault gets notified when\\n    ///         the deposit gets swept and it may execute the appropriate action.\\n    /// @param fundingTx Bitcoin funding transaction data, see `BitcoinTx.Info`\\n    /// @param reveal Deposit reveal data, see `RevealInfo struct\\n    /// @dev Requirements:\\n    ///      - `reveal.walletPubKeyHash` must identify a `Live` wallet\\n    ///      - `reveal.vault` must be 0x0 or point to a trusted vault\\n    ///      - `reveal.fundingOutputIndex` must point to the actual P2(W)SH\\n    ///        output of the BTC deposit transaction\\n    ///      - `reveal.depositor` must be the Ethereum address used in the\\n    ///        P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.blindingFactor` must be the blinding factor used in the\\n    ///        P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.walletPubKeyHash` must be the wallet pub key hash used in\\n    ///        the P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.refundPubKeyHash` must be the refund pub key hash used in\\n    ///        the P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.refundLocktime` must be the refund locktime used in the\\n    ///        P2(W)SH BTC deposit transaction,\\n    ///      - BTC deposit for the given `fundingTxHash`, `fundingOutputIndex`\\n    ///        can be revealed only one time.\\n    ///\\n    ///      If any of these requirements is not met, the wallet _must_ refuse\\n    ///      to sweep the deposit and the depositor has to wait until the\\n    ///      deposit script unlocks to receive their BTC back.\\n    function revealDeposit(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.Info calldata fundingTx,\\n        DepositRevealInfo calldata reveal\\n    ) external {\\n        require(\\n            self.registeredWallets[reveal.walletPubKeyHash].state ==\\n                Wallets.WalletState.Live,\\n            \\\"Wallet must be in Live state\\\"\\n        );\\n\\n        require(\\n            reveal.vault == address(0) || self.isVaultTrusted[reveal.vault],\\n            \\\"Vault is not trusted\\\"\\n        );\\n\\n        // TODO: Should we enforce a specific locktime at contract level?\\n\\n        bytes memory expectedScript = abi.encodePacked(\\n            hex\\\"14\\\", // Byte length of depositor Ethereum address.\\n            reveal.depositor,\\n            hex\\\"75\\\", // OP_DROP\\n            hex\\\"08\\\", // Byte length of blinding factor value.\\n            reveal.blindingFactor,\\n            hex\\\"75\\\", // OP_DROP\\n            hex\\\"76\\\", // OP_DUP\\n            hex\\\"a9\\\", // OP_HASH160\\n            hex\\\"14\\\", // Byte length of a compressed Bitcoin public key hash.\\n            reveal.walletPubKeyHash,\\n            hex\\\"87\\\", // OP_EQUAL\\n            hex\\\"63\\\", // OP_IF\\n            hex\\\"ac\\\", // OP_CHECKSIG\\n            hex\\\"67\\\", // OP_ELSE\\n            hex\\\"76\\\", // OP_DUP\\n            hex\\\"a9\\\", // OP_HASH160\\n            hex\\\"14\\\", // Byte length of a compressed Bitcoin public key hash.\\n            reveal.refundPubKeyHash,\\n            hex\\\"88\\\", // OP_EQUALVERIFY\\n            hex\\\"04\\\", // Byte length of refund locktime value.\\n            reveal.refundLocktime,\\n            hex\\\"b1\\\", // OP_CHECKLOCKTIMEVERIFY\\n            hex\\\"75\\\", // OP_DROP\\n            hex\\\"ac\\\", // OP_CHECKSIG\\n            hex\\\"68\\\" // OP_ENDIF\\n        );\\n\\n        bytes memory fundingOutput = fundingTx\\n            .outputVector\\n            .extractOutputAtIndex(reveal.fundingOutputIndex);\\n        bytes memory fundingOutputHash = fundingOutput.extractHash();\\n\\n        if (fundingOutputHash.length == 20) {\\n            // A 20-byte output hash is used by P2SH. That hash is constructed\\n            // by applying OP_HASH160 on the locking script. A 20-byte output\\n            // hash is used as well by P2PKH and P2WPKH (OP_HASH160 on the\\n            // public key). However, since we compare the actual output hash\\n            // with an expected locking script hash, this check will succeed only\\n            // for P2SH transaction type with expected script hash value. For\\n            // P2PKH and P2WPKH, it will fail on the output hash comparison with\\n            // the expected locking script hash.\\n            require(\\n                fundingOutputHash.slice20(0) == expectedScript.hash160View(),\\n                \\\"Wrong 20-byte script hash\\\"\\n            );\\n        } else if (fundingOutputHash.length == 32) {\\n            // A 32-byte output hash is used by P2WSH. That hash is constructed\\n            // by applying OP_SHA256 on the locking script.\\n            require(\\n                fundingOutputHash.toBytes32() == sha256(expectedScript),\\n                \\\"Wrong 32-byte script hash\\\"\\n            );\\n        } else {\\n            revert(\\\"Wrong script hash length\\\");\\n        }\\n\\n        // Resulting TX hash is in native Bitcoin little-endian format.\\n        bytes32 fundingTxHash = abi\\n            .encodePacked(\\n                fundingTx.version,\\n                fundingTx.inputVector,\\n                fundingTx.outputVector,\\n                fundingTx.locktime\\n            )\\n            .hash256View();\\n\\n        DepositRequest storage deposit = self.deposits[\\n            uint256(\\n                keccak256(\\n                    abi.encodePacked(fundingTxHash, reveal.fundingOutputIndex)\\n                )\\n            )\\n        ];\\n        require(deposit.revealedAt == 0, \\\"Deposit already revealed\\\");\\n\\n        uint64 fundingOutputAmount = fundingOutput.extractValue();\\n\\n        require(\\n            fundingOutputAmount >= self.depositDustThreshold,\\n            \\\"Deposit amount too small\\\"\\n        );\\n\\n        deposit.amount = fundingOutputAmount;\\n        deposit.depositor = reveal.depositor;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        deposit.revealedAt = uint32(block.timestamp);\\n        deposit.vault = reveal.vault;\\n        deposit.treasuryFee = self.depositTreasuryFeeDivisor > 0\\n            ? fundingOutputAmount / self.depositTreasuryFeeDivisor\\n            : 0;\\n        // slither-disable-next-line reentrancy-events\\n        emit DepositRevealed(\\n            fundingTxHash,\\n            reveal.fundingOutputIndex,\\n            reveal.depositor,\\n            fundingOutputAmount,\\n            reveal.blindingFactor,\\n            reveal.walletPubKeyHash,\\n            reveal.refundPubKeyHash,\\n            reveal.refundLocktime,\\n            reveal.vault\\n        );\\n    }\\n}\\n\",\"keccak256\":\"0x2f3c592eb79ecf1411bb4e98530166efd722d926594e639ba8b09786777237bb\",\"license\":\"MIT\"},\"contracts/bridge/EcdsaLib.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\n\\nlibrary EcdsaLib {\\n    using BytesLib for bytes;\\n\\n    /// @notice Converts public key X and Y coordinates (32-byte each) to a\\n    ///         compressed public key (33-byte). Compressed public key is X\\n    ///         coordinate prefixed with `02` or `03` based on the Y coordinate parity.\\n    ///         It is expected that the uncompressed public key is stripped\\n    ///         (i.e. it is not prefixed with `04`).\\n    /// @param x Wallet's public key's X coordinate.\\n    /// @param y Wallet's public key's Y coordinate.\\n    /// @return Compressed public key (33-byte), prefixed with `02` or `03`.\\n    function compressPublicKey(bytes32 x, bytes32 y)\\n        internal\\n        pure\\n        returns (bytes memory)\\n    {\\n        bytes1 prefix;\\n        if (uint256(y) % 2 == 0) {\\n            prefix = hex\\\"02\\\";\\n        } else {\\n            prefix = hex\\\"03\\\";\\n        }\\n\\n        return bytes.concat(prefix, x);\\n    }\\n}\\n\",\"keccak256\":\"0x0b1b1755b6332c9d6d58a1d156a7151905a656faa7768345eb190b938f48c38d\",\"license\":\"MIT\"},\"contracts/bridge/Fraud.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {CheckBitcoinSigs} from \\\"@keep-network/bitcoin-spv-sol/contracts/CheckBitcoinSigs.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./EcdsaLib.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\n/// @title Bridge fraud\\n/// @notice The library handles the logic for challenging Bridge wallets that\\n///         committed fraud.\\n/// @dev Anyone can submit a fraud challenge indicating that a UTXO being under\\n///      the wallet control was unlocked by the wallet but was not used\\n///      according to the protocol rules. That means the wallet signed\\n///      a transaction input pointing to that UTXO and there is a unique\\n///      sighash and signature pair associated with that input.\\n///\\n///      In order to defeat the challenge, the same wallet public key and\\n///      signature must be provided as were used to calculate the sighash during\\n///      the challenge. The wallet provides the preimage which produces sighash\\n///      used to generate the ECDSA signature that is the subject of the fraud\\n///      claim. The fraud challenge defeat attempt will only succeed if the\\n///      inputs in the preimage are considered honestly spent by the wallet.\\n///      Therefore the transaction spending the UTXO must be proven in the\\n///      Bridge before a challenge defeat is called.\\nlibrary Fraud {\\n    using Wallets for BridgeState.Storage;\\n\\n    using BytesLib for bytes;\\n    using BTCUtils for bytes;\\n    using BTCUtils for uint32;\\n    using EcdsaLib for bytes;\\n\\n    struct FraudChallenge {\\n        // The address of the party challenging the wallet.\\n        address challenger;\\n        // The amount of ETH the challenger deposited.\\n        uint256 depositAmount;\\n        // The timestamp the challenge was submitted at.\\n        uint32 reportedAt;\\n        // The flag indicating whether the challenge has been resolved.\\n        bool resolved;\\n    }\\n\\n    event FraudChallengeSubmitted(\\n        bytes20 walletPubKeyHash,\\n        bytes32 sighash,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    );\\n\\n    event FraudChallengeDefeated(bytes20 walletPubKeyHash, bytes32 sighash);\\n\\n    event FraudChallengeDefeatTimedOut(\\n        bytes20 walletPubKeyHash,\\n        bytes32 sighash\\n    );\\n\\n    /// @notice Submits a fraud challenge indicating that a UTXO being under\\n    ///         wallet control was unlocked by the wallet but was not used\\n    ///         according to the protocol rules. That means the wallet signed\\n    ///         a transaction input pointing to that UTXO and there is a unique\\n    ///         sighash and signature pair associated with that input. This\\n    ///         function uses those parameters to create a fraud accusation that\\n    ///         proves a given transaction input unlocking the given UTXO was\\n    ///         actually signed by the wallet. This function cannot determine\\n    ///         whether the transaction was actually broadcast and the input was\\n    ///         consumed in a fraudulent way so it just opens a challenge period\\n    ///         during which the wallet can defeat the challenge by submitting\\n    ///         proof of a transaction that consumes the given input according\\n    ///         to protocol rules. To prevent spurious allegations, the caller\\n    ///         must deposit ETH that is returned back upon justified fraud\\n    ///         challenge or confiscated otherwise\\n    /// @param walletPublicKey The public key of the wallet in the uncompressed\\n    ///        and unprefixed format (64 bytes)\\n    /// @param sighash The hash that was used to produce the ECDSA signature\\n    ///        that is the subject of the fraud claim. This hash is constructed\\n    ///        by applying double SHA-256 over a serialized subset of the\\n    ///        transaction. The exact subset used as hash preimage depends on\\n    ///        the transaction input the signature is produced for. See BIP-143\\n    ///        for reference\\n    /// @param signature Bitcoin signature in the R/S/V format\\n    /// @dev Requirements:\\n    ///      - Wallet behind `walletPublicKey` must be in Live or MovingFunds\\n    ///        or Closing state\\n    ///      - The challenger must send appropriate amount of ETH used as\\n    ///        fraud challenge deposit\\n    ///      - The signature (represented by r, s and v) must be generated by\\n    ///        the wallet behind `walletPublicKey` during signing of `sighash`\\n    ///      - Wallet can be challenged for the given signature only once\\n    function submitFraudChallenge(\\n        BridgeState.Storage storage self,\\n        bytes calldata walletPublicKey,\\n        bytes32 sighash,\\n        BitcoinTx.RSVSignature calldata signature\\n    ) external {\\n        require(\\n            msg.value >= self.fraudChallengeDepositAmount,\\n            \\\"The amount of ETH deposited is too low\\\"\\n        );\\n\\n        require(\\n            CheckBitcoinSigs.checkSig(\\n                walletPublicKey,\\n                sighash,\\n                signature.v,\\n                signature.r,\\n                signature.s\\n            ),\\n            \\\"Signature verification failure\\\"\\n        );\\n\\n        bytes memory compressedWalletPublicKey = EcdsaLib.compressPublicKey(\\n            walletPublicKey.slice32(0),\\n            walletPublicKey.slice32(32)\\n        );\\n        bytes20 walletPubKeyHash = compressedWalletPublicKey.hash160View();\\n\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        require(\\n            wallet.state == Wallets.WalletState.Live ||\\n                wallet.state == Wallets.WalletState.MovingFunds ||\\n                wallet.state == Wallets.WalletState.Closing,\\n            \\\"Wallet must be in Live or MovingFunds or Closing state\\\"\\n        );\\n\\n        uint256 challengeKey = uint256(\\n            keccak256(abi.encodePacked(walletPublicKey, sighash))\\n        );\\n\\n        FraudChallenge storage challenge = self.fraudChallenges[challengeKey];\\n        require(challenge.reportedAt == 0, \\\"Fraud challenge already exists\\\");\\n\\n        challenge.challenger = msg.sender;\\n        challenge.depositAmount = msg.value;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        challenge.reportedAt = uint32(block.timestamp);\\n        challenge.resolved = false;\\n        // slither-disable-next-line reentrancy-events\\n        emit FraudChallengeSubmitted(\\n            walletPubKeyHash,\\n            sighash,\\n            signature.v,\\n            signature.r,\\n            signature.s\\n        );\\n    }\\n\\n    /// @notice Allows to defeat a pending fraud challenge against a wallet if\\n    ///         the transaction that spends the UTXO follows the protocol rules.\\n    ///         In order to defeat the challenge the same `walletPublicKey` and\\n    ///         signature (represented by `r`, `s` and `v`) must be provided as\\n    ///         were used to calculate the sighash during input signing.\\n    ///         The fraud challenge defeat attempt will only succeed if the\\n    ///         inputs in the preimage are considered honestly spent by the\\n    ///         wallet. Therefore the transaction spending the UTXO must be\\n    ///         proven in the Bridge before a challenge defeat is called.\\n    ///         If successfully defeated, the fraud challenge is marked as\\n    ///         resolved and the amount of ether deposited by the challenger is\\n    ///         sent to the treasury.\\n    /// @param walletPublicKey The public key of the wallet in the uncompressed\\n    ///        and unprefixed format (64 bytes)\\n    /// @param preimage The preimage which produces sighash used to generate the\\n    ///        ECDSA signature that is the subject of the fraud claim. It is a\\n    ///        serialized subset of the transaction. The exact subset used as\\n    ///        the preimage depends on the transaction input the signature is\\n    ///        produced for. See BIP-143 for reference\\n    /// @param witness Flag indicating whether the preimage was produced for a\\n    ///        witness input. True for witness, false for non-witness input.\\n    /// @dev Requirements:\\n    ///      - `walletPublicKey` and `sighash` calculated as `hash256(preimage)`\\n    ///        must identify an open fraud challenge\\n    ///      - the preimage must be a valid preimage of a transaction generated\\n    ///        according to the protocol rules and already proved in the Bridge\\n    ///      - before a defeat attempt is made the transaction that spends the\\n    ///        given UTXO must be proven in the Bridge\\n    function defeatFraudChallenge(\\n        BridgeState.Storage storage self,\\n        bytes calldata walletPublicKey,\\n        bytes calldata preimage,\\n        bool witness\\n    ) external {\\n        bytes32 sighash = preimage.hash256();\\n\\n        uint256 challengeKey = uint256(\\n            keccak256(abi.encodePacked(walletPublicKey, sighash))\\n        );\\n\\n        FraudChallenge storage challenge = self.fraudChallenges[challengeKey];\\n\\n        require(challenge.reportedAt > 0, \\\"Fraud challenge does not exist\\\");\\n        require(\\n            !challenge.resolved,\\n            \\\"Fraud challenge has already been resolved\\\"\\n        );\\n\\n        // Ensure SIGHASH_ALL type was used during signing, which is represented\\n        // by type value `1`.\\n        require(extractSighashType(preimage) == 1, \\\"Wrong sighash type\\\");\\n\\n        uint256 utxoKey = witness\\n            ? extractUtxoKeyFromWitnessPreimage(preimage)\\n            : extractUtxoKeyFromNonWitnessPreimage(preimage);\\n\\n        // Check that the UTXO key identifies a correctly spent UTXO.\\n        require(\\n            self.deposits[utxoKey].sweptAt > 0 || self.spentMainUTXOs[utxoKey],\\n            \\\"Spent UTXO not found among correctly spent UTXOs\\\"\\n        );\\n\\n        // Mark the challenge as resolved as it was successfully defeated\\n        challenge.resolved = true;\\n\\n        // Send the ether deposited by the challenger to the treasury\\n        /* solhint-disable avoid-low-level-calls */\\n        // slither-disable-next-line low-level-calls,unchecked-lowlevel,arbitrary-send\\n        self.treasury.call{gas: 100000, value: challenge.depositAmount}(\\\"\\\");\\n        /* solhint-enable avoid-low-level-calls */\\n\\n        bytes memory compressedWalletPublicKey = EcdsaLib.compressPublicKey(\\n            walletPublicKey.slice32(0),\\n            walletPublicKey.slice32(32)\\n        );\\n        bytes20 walletPubKeyHash = compressedWalletPublicKey.hash160View();\\n        // slither-disable-next-line reentrancy-events\\n        emit FraudChallengeDefeated(walletPubKeyHash, sighash);\\n    }\\n\\n    /// @notice Notifies about defeat timeout for the given fraud challenge.\\n    ///         Can be called only if there was a fraud challenge identified by\\n    ///         the provided `walletPublicKey` and `sighash` and it was not\\n    ///         defeated on time. The amount of time that needs to pass after a\\n    ///         fraud challenge is reported is indicated by the\\n    ///         `challengeDefeatTimeout`. After a successful fraud challenge\\n    ///         defeat timeout notification the fraud challenge is marked as\\n    ///         resolved, the stake of each operator is slashed, the ether\\n    ///         deposited is returned to the challenger and the challenger is\\n    ///         rewarded.\\n    /// @param walletPublicKey The public key of the wallet in the uncompressed\\n    ///        and unprefixed format (64 bytes)\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @param sighash The hash that was used to produce the ECDSA signature\\n    ///        that is the subject of the fraud claim. This hash is constructed\\n    ///        by applying double SHA-256 over a serialized subset of the\\n    ///        transaction. The exact subset used as hash preimage depends on\\n    ///        the transaction input the signature is produced for. See BIP-143\\n    ///        for reference\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the Live or MovingFunds or Closing or\\n    ///        Terminated state\\n    ///      - The `walletPublicKey` and `sighash` must identify an open fraud\\n    ///        challenge\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events of the `WalletRegistry` contract\\n    ///      - The amount of time indicated by `challengeDefeatTimeout` must pass\\n    ///        after the challenge was reported\\n    function notifyFraudChallengeDefeatTimeout(\\n        BridgeState.Storage storage self,\\n        bytes calldata walletPublicKey,\\n        uint32[] calldata walletMembersIDs,\\n        bytes32 sighash\\n    ) external {\\n        uint256 challengeKey = uint256(\\n            keccak256(abi.encodePacked(walletPublicKey, sighash))\\n        );\\n\\n        FraudChallenge storage challenge = self.fraudChallenges[challengeKey];\\n\\n        require(challenge.reportedAt > 0, \\\"Fraud challenge does not exist\\\");\\n\\n        require(\\n            !challenge.resolved,\\n            \\\"Fraud challenge has already been resolved\\\"\\n        );\\n\\n        require(\\n            /* solhint-disable-next-line not-rely-on-time */\\n            block.timestamp >=\\n                challenge.reportedAt + self.fraudChallengeDefeatTimeout,\\n            \\\"Fraud challenge defeat period did not time out yet\\\"\\n        );\\n\\n        challenge.resolved = true;\\n        // Return the ether deposited by the challenger\\n        /* solhint-disable avoid-low-level-calls */\\n        // slither-disable-next-line low-level-calls,unchecked-lowlevel\\n        challenge.challenger.call{gas: 100000, value: challenge.depositAmount}(\\n            \\\"\\\"\\n        );\\n        /* solhint-enable avoid-low-level-calls */\\n\\n        bytes memory compressedWalletPublicKey = EcdsaLib.compressPublicKey(\\n            walletPublicKey.slice32(0),\\n            walletPublicKey.slice32(32)\\n        );\\n        bytes20 walletPubKeyHash = compressedWalletPublicKey.hash160View();\\n\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        Wallets.WalletState walletState = wallet.state;\\n\\n        if (\\n            walletState == Wallets.WalletState.Live ||\\n            walletState == Wallets.WalletState.MovingFunds ||\\n            walletState == Wallets.WalletState.Closing\\n        ) {\\n            self.terminateWallet(walletPubKeyHash);\\n\\n            self.ecdsaWalletRegistry.seize(\\n                self.fraudSlashingAmount,\\n                self.fraudNotifierRewardMultiplier,\\n                challenge.challenger,\\n                wallet.ecdsaWalletID,\\n                walletMembersIDs\\n            );\\n        } else if (walletState == Wallets.WalletState.Terminated) {\\n            // This is a special case when the wallet was already terminated\\n            // due to a previous deliberate protocol violation. In that\\n            // case, this function should be still callable for other fraud\\n            // challenges timeouts in order to let the challenger unlock its\\n            // ETH deposit back. However, the wallet termination logic is\\n            // not called and the challenger is not rewarded.\\n        } else {\\n            revert(\\n                \\\"Wallet must be in Live or MovingFunds or Closing or Terminated state\\\"\\n            );\\n        }\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit FraudChallengeDefeatTimedOut(walletPubKeyHash, sighash);\\n    }\\n\\n    /// @notice Extracts the UTXO keys from the given preimage used during\\n    ///         signing of a witness input.\\n    /// @param preimage The preimage which produces sighash used to generate the\\n    ///        ECDSA signature that is the subject of the fraud claim. It is a\\n    ///        serialized subset of the transaction. The exact subset used as\\n    ///        the preimage depends on the transaction input the signature is\\n    ///        produced for. See BIP-143 for reference\\n    /// @return utxoKey UTXO key that identifies spent input.\\n    function extractUtxoKeyFromWitnessPreimage(bytes calldata preimage)\\n        internal\\n        pure\\n        returns (uint256 utxoKey)\\n    {\\n        // The expected structure of the preimage created during signing of a\\n        // witness input:\\n        // - transaction version (4 bytes)\\n        // - hash of previous outpoints of all inputs (32 bytes)\\n        // - hash of sequences of all inputs (32 bytes)\\n        // - outpoint (hash + index) of the input being signed (36 bytes)\\n        // - the unlocking script of the input (variable length)\\n        // - value of the outpoint (8 bytes)\\n        // - sequence of the input being signed (4 bytes)\\n        // - hash of all outputs (32 bytes)\\n        // - transaction locktime (4 bytes)\\n        // - sighash type (4 bytes)\\n\\n        // See Bitcoin's BIP-143 for reference:\\n        // https://github.com/bitcoin/bips/blob/master/bip-0143.mediawiki.\\n\\n        // The outpoint (hash and index) is located at the constant offset of\\n        // 68 (4 + 32 + 32).\\n        bytes32 outpointTxHash = preimage.extractInputTxIdLeAt(68);\\n        uint32 outpointIndex = BTCUtils.reverseUint32(\\n            uint32(preimage.extractTxIndexLeAt(68))\\n        );\\n\\n        return\\n            uint256(keccak256(abi.encodePacked(outpointTxHash, outpointIndex)));\\n    }\\n\\n    /// @notice Extracts the UTXO key from the given preimage used during\\n    ///         signing of a non-witness input.\\n    /// @param preimage The preimage which produces sighash used to generate the\\n    ///        ECDSA signature that is the subject of the fraud claim. It is a\\n    ///        serialized subset of the transaction. The exact subset used as\\n    ///        the preimage depends on the transaction input the signature is\\n    ///        produced for. See BIP-143 for reference\\n    /// @return utxoKey UTXO key that identifies spent input.\\n    function extractUtxoKeyFromNonWitnessPreimage(bytes calldata preimage)\\n        internal\\n        pure\\n        returns (uint256 utxoKey)\\n    {\\n        // The expected structure of the preimage created during signing of a\\n        // non-witness input:\\n        // - transaction version (4 bytes)\\n        // - number of inputs written as compactSize uint (1 byte, 3 bytes,\\n        //   5 bytes or 9 bytes)\\n        // - for each input\\n        //   - outpoint (hash and index) (36 bytes)\\n        //   - unlocking script for the input being signed (variable length)\\n        //     or `00` for all other inputs (1 byte)\\n        //   - input sequence (4 bytes)\\n        // - number of outputs written as compactSize uint (1 byte, 3 bytes,\\n        //   5 bytes or 9 bytes)\\n        // - outputs (variable length)\\n        // - transaction locktime (4 bytes)\\n        // - sighash type (4 bytes)\\n\\n        // See example for reference:\\n        // https://en.bitcoin.it/wiki/OP_CHECKSIG#Code_samples_and_raw_dumps.\\n\\n        // The input data begins at the constant offset of 4 (the first 4 bytes\\n        // are for the transaction version).\\n        (uint256 inputsCompactSizeUintLength, uint256 inputsCount) = preimage\\n            .parseVarIntAt(4);\\n\\n        // To determine the first input starting index, we must jump 4 bytes\\n        // over the transaction version length and the compactSize uint which\\n        // prepends the input vector. One byte must be added because\\n        // `BtcUtils.parseVarInt` does not include compactSize uint tag in the\\n        // returned length.\\n        //\\n        // For >= 0 && <= 252, `BTCUtils.determineVarIntDataLengthAt`\\n        // returns `0`, so we jump over one byte of compactSize uint.\\n        //\\n        // For >= 253 && <= 0xffff there is `0xfd` tag,\\n        // `BTCUtils.determineVarIntDataLengthAt` returns `2` (no\\n        // tag byte included) so we need to jump over 1+2 bytes of\\n        // compactSize uint.\\n        //\\n        // Please refer `BTCUtils` library and compactSize uint\\n        // docs in `BitcoinTx` library for more details.\\n        uint256 inputStartingIndex = 4 + 1 + inputsCompactSizeUintLength;\\n\\n        for (uint256 i = 0; i < inputsCount; i++) {\\n            uint256 inputLength = preimage.determineInputLengthAt(\\n                inputStartingIndex\\n            );\\n\\n            (, uint256 scriptSigLength) = preimage.extractScriptSigLenAt(\\n                inputStartingIndex\\n            );\\n\\n            if (scriptSigLength > 0) {\\n                // The input this preimage was generated for was found.\\n                // All the other inputs in the preimage are marked with a null\\n                // scriptSig (\\\"00\\\") which has length of 1.\\n                bytes32 outpointTxHash = preimage.extractInputTxIdLeAt(\\n                    inputStartingIndex\\n                );\\n                uint32 outpointIndex = BTCUtils.reverseUint32(\\n                    uint32(preimage.extractTxIndexLeAt(inputStartingIndex))\\n                );\\n\\n                utxoKey = uint256(\\n                    keccak256(abi.encodePacked(outpointTxHash, outpointIndex))\\n                );\\n\\n                break;\\n            }\\n\\n            inputStartingIndex += inputLength;\\n        }\\n\\n        return utxoKey;\\n    }\\n\\n    /// @notice Extracts the sighash type from the given preimage.\\n    /// @param preimage Serialized subset of the transaction. See BIP-143 for\\n    ///        reference\\n    /// @dev Sighash type is stored as the last 4 bytes in the preimage (little\\n    ///      endian).\\n    /// @return sighashType Sighash type as a 32-bit integer.\\n    function extractSighashType(bytes calldata preimage)\\n        internal\\n        pure\\n        returns (uint32 sighashType)\\n    {\\n        bytes4 sighashTypeBytes = preimage.slice4(preimage.length - 4);\\n        uint32 sighashTypeLE = uint32(sighashTypeBytes);\\n        return sighashTypeLE.reverseUint32();\\n    }\\n}\\n\",\"keccak256\":\"0xbb2b4056d6053cf430e6dba9b1d25f257db5bd08388988441bd562894b844de2\",\"license\":\"MIT\"},\"contracts/bridge/IRelay.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\n/// @title Interface for the Bitcoin relay\\n/// @notice Contains only the methods needed by tBTC v2. The Bitcoin relay\\n///         provides the difficulty of the previous and current epoch. One\\n///         difficulty epoch spans 2016 blocks.\\ninterface IRelay {\\n    /// @notice Returns the difficulty of the current epoch.\\n    function getCurrentEpochDifficulty() external view returns (uint256);\\n\\n    /// @notice Returns the difficulty of the previous epoch.\\n    function getPrevEpochDifficulty() external view returns (uint256);\\n}\\n\",\"keccak256\":\"0xc8d3f66aacc2e9f645397e0114f9671099acade21ef5805ae1de297773c9c81a\",\"license\":\"MIT\"},\"contracts/bridge/Redemption.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\nimport \\\"../bank/Bank.sol\\\";\\n\\n/// @notice Aggregates functions common to the redemption transaction proof\\n///         validation and to the moving funds transaction proof validation.\\nlibrary OutboundTx {\\n    using BTCUtils for bytes;\\n\\n    /// @notice Checks whether an outbound Bitcoin transaction performed from\\n    ///         the given wallet has an input vector that contains a single\\n    ///         input referring to the wallet's main UTXO. Marks that main UTXO\\n    ///         as correctly spent if the validation succeeds. Reverts otherwise.\\n    ///         There are two outbound transactions from a wallet possible: a\\n    ///         redemption transaction or a moving funds to another wallet\\n    ///         transaction.\\n    /// @param walletOutboundTxInputVector Bitcoin outbound transaction's input\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVin` function\\n    ///        before it is passed here\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain.\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the outbound transaction.\\n    function processWalletOutboundTxInput(\\n        BridgeState.Storage storage self,\\n        bytes memory walletOutboundTxInputVector,\\n        BitcoinTx.UTXO calldata mainUtxo,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        // Assert that main UTXO for passed wallet exists in storage.\\n        bytes32 mainUtxoHash = self\\n            .registeredWallets[walletPubKeyHash]\\n            .mainUtxoHash;\\n        require(mainUtxoHash != bytes32(0), \\\"No main UTXO for given wallet\\\");\\n\\n        // Assert that passed main UTXO parameter is the same as in storage and\\n        // can be used for further processing.\\n        require(\\n            keccak256(\\n                abi.encodePacked(\\n                    mainUtxo.txHash,\\n                    mainUtxo.txOutputIndex,\\n                    mainUtxo.txOutputValue\\n                )\\n            ) == mainUtxoHash,\\n            \\\"Invalid main UTXO data\\\"\\n        );\\n\\n        // Assert that the single outbound transaction input actually\\n        // refers to the wallet's main UTXO.\\n        (\\n            bytes32 outpointTxHash,\\n            uint32 outpointIndex\\n        ) = parseWalletOutboundTxInput(walletOutboundTxInputVector);\\n        require(\\n            mainUtxo.txHash == outpointTxHash &&\\n                mainUtxo.txOutputIndex == outpointIndex,\\n            \\\"Outbound transaction input must point to the wallet's main UTXO\\\"\\n        );\\n\\n        // Main UTXO used as an input, mark it as spent.\\n        self.spentMainUTXOs[\\n            uint256(\\n                keccak256(\\n                    abi.encodePacked(mainUtxo.txHash, mainUtxo.txOutputIndex)\\n                )\\n            )\\n        ] = true;\\n    }\\n\\n    /// @notice Parses the input vector of an outbound Bitcoin transaction\\n    ///         performed from the given wallet. It extracts the single input\\n    ///         then the transaction hash and output index from its outpoint.\\n    ///         There are two outbound transactions from a wallet possible: a\\n    ///         redemption transaction or a moving funds to another wallet\\n    ///         transaction.\\n    /// @param walletOutboundTxInputVector Bitcoin outbound transaction input\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVin` function\\n    ///        before it is passed here\\n    /// @return outpointTxHash 32-byte hash of the Bitcoin transaction which is\\n    ///         pointed in the input's outpoint.\\n    /// @return outpointIndex 4-byte index of the Bitcoin transaction output\\n    ///         which is pointed in the input's outpoint.\\n    function parseWalletOutboundTxInput(\\n        bytes memory walletOutboundTxInputVector\\n    ) internal pure returns (bytes32 outpointTxHash, uint32 outpointIndex) {\\n        // To determine the total number of Bitcoin transaction inputs,\\n        // we need to parse the compactSize uint (VarInt) the input vector is\\n        // prepended by. That compactSize uint encodes the number of vector\\n        // elements using the format presented in:\\n        // https://developer.bitcoin.org/reference/transactions.html#compactsize-unsigned-integers\\n        // We don't need asserting the compactSize uint is parseable since it\\n        // was already checked during `validateVin` validation.\\n        // See `BitcoinTx.inputVector` docs for more details.\\n        (, uint256 inputsCount) = walletOutboundTxInputVector.parseVarInt();\\n        require(\\n            inputsCount == 1,\\n            \\\"Outbound transaction must have a single input\\\"\\n        );\\n\\n        bytes memory input = walletOutboundTxInputVector.extractInputAtIndex(0);\\n\\n        outpointTxHash = input.extractInputTxIdLE();\\n\\n        outpointIndex = BTCUtils.reverseUint32(\\n            uint32(input.extractTxIndexLE())\\n        );\\n\\n        // There is only one input in the transaction. Input has an outpoint\\n        // field that is a reference to the transaction being spent (see\\n        // `BitcoinTx` docs). The outpoint contains the hash of the transaction\\n        // to spend (`outpointTxHash`) and the index of the specific output\\n        // from that transaction (`outpointIndex`).\\n        return (outpointTxHash, outpointIndex);\\n    }\\n}\\n\\n/// @title Bridge redemption\\n/// @notice The library handles the logic for redeeming Bitcoin balances from\\n///         the Bridge.\\n/// @dev To initiate a redemption, a user with a Bank balance supplies\\n///      a Bitcoin address. Then, the system calculates the redemption fee, and\\n///      releases balance to the provided Bitcoin address. Just like in case of\\n///      sweeps of revealed deposits, redemption requests are processed in\\n///      batches and require SPV proof to be submitted to the Bridge.\\nlibrary Redemption {\\n    using BridgeState for BridgeState.Storage;\\n    using Wallets for BridgeState.Storage;\\n    using BitcoinTx for BridgeState.Storage;\\n\\n    using BTCUtils for bytes;\\n    using BytesLib for bytes;\\n\\n    /// @notice Represents a redemption request.\\n    struct RedemptionRequest {\\n        // ETH address of the redeemer who created the request.\\n        address redeemer;\\n        // Requested TBTC amount in satoshi.\\n        uint64 requestedAmount;\\n        // Treasury TBTC fee in satoshi at the moment of request creation.\\n        uint64 treasuryFee;\\n        // Transaction maximum BTC fee in satoshi at the moment of request\\n        // creation.\\n        uint64 txMaxFee;\\n        // UNIX timestamp the request was created at.\\n        uint32 requestedAt;\\n    }\\n\\n    /// @notice Represents an outcome of the redemption Bitcoin transaction\\n    ///         outputs processing.\\n    struct RedemptionTxOutputsInfo {\\n        // Total TBTC value in satoshi that should be burned by the Bridge.\\n        // It includes the total amount of all BTC redeemed in the transaction\\n        // and the fee paid to BTC miners for the redemption transaction.\\n        uint64 totalBurnableValue;\\n        // Total TBTC value in satoshi that should be transferred to\\n        // the treasury. It is a sum of all treasury fees paid by all\\n        // redeemers included in the redemption transaction.\\n        uint64 totalTreasuryFee;\\n        // Index of the change output. The change output becomes\\n        // the new main wallet's UTXO.\\n        uint32 changeIndex;\\n        // Value in satoshi of the change output.\\n        uint64 changeValue;\\n    }\\n\\n    /// @notice Represents temporary information needed during the processing of\\n    ///         the redemption Bitcoin transaction outputs. This structure is an\\n    ///         internal one and should not be exported outside of the redemption\\n    ///         transaction processing code.\\n    /// @dev Allows to mitigate \\\"stack too deep\\\" errors on EVM.\\n    struct RedemptionTxOutputsProcessingInfo {\\n        // The first output starting index in the transaction.\\n        uint256 outputStartingIndex;\\n        // The number of outputs in the transaction.\\n        uint256 outputsCount;\\n        // P2PKH script for the wallet. Needed to determine the change output.\\n        bytes32 walletP2PKHScriptKeccak;\\n        // P2WPKH script for the wallet. Needed to determine the change output.\\n        bytes32 walletP2WPKHScriptKeccak;\\n    }\\n\\n    event RedemptionRequested(\\n        bytes20 walletPubKeyHash,\\n        bytes redeemerOutputScript,\\n        address redeemer,\\n        uint64 requestedAmount,\\n        uint64 treasuryFee,\\n        uint64 txMaxFee\\n    );\\n\\n    event RedemptionsCompleted(\\n        bytes20 walletPubKeyHash,\\n        bytes32 redemptionTxHash\\n    );\\n\\n    event RedemptionTimedOut(\\n        bytes20 walletPubKeyHash,\\n        bytes redeemerOutputScript\\n    );\\n\\n    /// @notice Requests redemption of the given amount from the specified\\n    ///         wallet to the redeemer Bitcoin output script.\\n    /// @param walletPubKeyHash The 20-byte wallet public key hash (computed\\n    ///        using Bitcoin HASH160 over the compressed ECDSA public key)\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain\\n    /// @param redeemerOutputScript The redeemer's length-prefixed output\\n    ///        script (P2PKH, P2WPKH, P2SH or P2WSH) that will be used to lock\\n    ///        redeemed BTC\\n    /// @param amount Requested amount in satoshi. This is also the TBTC amount\\n    ///        that is taken from redeemer's balance in the Bank upon request.\\n    ///        Once the request is handled, the actual amount of BTC locked\\n    ///        on the redeemer output script will be always lower than this value\\n    ///        since the treasury and Bitcoin transaction fees must be incurred.\\n    ///        The minimal amount satisfying the request can be computed as:\\n    ///        `amount - (amount / redemptionTreasuryFeeDivisor) - redemptionTxMaxFee`.\\n    ///        Fees values are taken at the moment of request creation.\\n    /// @dev Requirements:\\n    ///      - Wallet behind `walletPubKeyHash` must be live\\n    ///      - `mainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///      - `redeemerOutputScript` must be a proper Bitcoin script\\n    ///      - `redeemerOutputScript` cannot have wallet PKH as payload\\n    ///      - `amount` must be above or equal the `redemptionDustThreshold`\\n    ///      - Given `walletPubKeyHash` and `redeemerOutputScript` pair can be\\n    ///        used for only one pending request at the same time\\n    ///      - Wallet must have enough Bitcoin balance to proceed the request\\n    ///      - Redeemer must make an allowance in the Bank that the Bridge\\n    ///        contract can spend the given `amount`.\\n    function requestRedemption(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata mainUtxo,\\n        bytes calldata redeemerOutputScript,\\n        uint64 amount\\n    ) external {\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        require(\\n            wallet.state == Wallets.WalletState.Live,\\n            \\\"Wallet must be in Live state\\\"\\n        );\\n\\n        bytes32 mainUtxoHash = wallet.mainUtxoHash;\\n        require(\\n            mainUtxoHash != bytes32(0),\\n            \\\"No main UTXO for the given wallet\\\"\\n        );\\n        require(\\n            keccak256(\\n                abi.encodePacked(\\n                    mainUtxo.txHash,\\n                    mainUtxo.txOutputIndex,\\n                    mainUtxo.txOutputValue\\n                )\\n            ) == mainUtxoHash,\\n            \\\"Invalid main UTXO data\\\"\\n        );\\n\\n        // TODO: Confirm if `walletPubKeyHash` should be validated by checking\\n        //       if it is the oldest one who can handle the request. This will\\n        //       be suggested by the dApp but may not be respected by users who\\n        //       interact directly with the contract. Do we need to enforce it\\n        //       here? One option is not to enforce it, to save on gas, but if\\n        //       we see this rule is not respected, upgrade Bridge contract to\\n        //       require it.\\n\\n        // Validate if redeemer output script is a correct standard type\\n        // (P2PKH, P2WPKH, P2SH or P2WSH). This is done by building a stub\\n        // output with 0 as value and using `BTCUtils.extractHash` on it. Such\\n        // a function extracts the payload properly only from standard outputs\\n        // so if it succeeds, we have a guarantee the redeemer output script\\n        // is proper. Worth to note `extractHash` ignores the value at all\\n        // so this is why we can use 0 safely. This way of validation is the\\n        // same as in tBTC v1.\\n        bytes memory redeemerOutputScriptPayload = abi\\n            .encodePacked(bytes8(0), redeemerOutputScript)\\n            .extractHash();\\n        require(\\n            redeemerOutputScriptPayload.length > 0,\\n            \\\"Redeemer output script must be a standard type\\\"\\n        );\\n        // Check if the redeemer output script payload does not point to the\\n        // wallet public key hash.\\n        require(\\n            keccak256(abi.encodePacked(walletPubKeyHash)) !=\\n                keccak256(redeemerOutputScriptPayload),\\n            \\\"Redeemer output script must not point to the wallet PKH\\\"\\n        );\\n\\n        require(\\n            amount >= self.redemptionDustThreshold,\\n            \\\"Redemption amount too small\\\"\\n        );\\n\\n        // The redemption key is built on top of the wallet public key hash\\n        // and redeemer output script pair. That means there can be only one\\n        // request asking for redemption from the given wallet to the given\\n        // BTC script at the same time.\\n        uint256 redemptionKey = uint256(\\n            keccak256(abi.encodePacked(walletPubKeyHash, redeemerOutputScript))\\n        );\\n\\n        // Check if given redemption key is not used by a pending redemption.\\n        // There is no need to check for existence in `timedOutRedemptions`\\n        // since the wallet's state is changed to other than Live after\\n        // first time out is reported so making new requests is not possible.\\n        // slither-disable-next-line incorrect-equality\\n        require(\\n            self.pendingRedemptions[redemptionKey].requestedAt == 0,\\n            \\\"There is a pending redemption request from this wallet to the same address\\\"\\n        );\\n\\n        // No need to check whether `amount - treasuryFee - txMaxFee > 0`\\n        // since the `redemptionDustThreshold` should force that condition\\n        // to be always true.\\n        uint64 treasuryFee = self.redemptionTreasuryFeeDivisor > 0\\n            ? amount / self.redemptionTreasuryFeeDivisor\\n            : 0;\\n        uint64 txMaxFee = self.redemptionTxMaxFee;\\n\\n        // The main wallet UTXO's value doesn't include all pending redemptions.\\n        // To determine if the requested redemption can be performed by the\\n        // wallet we need to subtract the total value of all pending redemptions\\n        // from that wallet's main UTXO value. Given that the treasury fee is\\n        // not redeemed from the wallet, we are subtracting it.\\n        wallet.pendingRedemptionsValue += amount - treasuryFee;\\n        require(\\n            mainUtxo.txOutputValue >= wallet.pendingRedemptionsValue,\\n            \\\"Insufficient wallet funds\\\"\\n        );\\n\\n        self.pendingRedemptions[redemptionKey] = RedemptionRequest(\\n            msg.sender,\\n            amount,\\n            treasuryFee,\\n            txMaxFee,\\n            /* solhint-disable-next-line not-rely-on-time */\\n            uint32(block.timestamp)\\n        );\\n\\n        emit RedemptionRequested(\\n            walletPubKeyHash,\\n            redeemerOutputScript,\\n            msg.sender,\\n            amount,\\n            treasuryFee,\\n            txMaxFee\\n        );\\n\\n        self.bank.transferBalanceFrom(msg.sender, address(this), amount);\\n    }\\n\\n    /// @notice Used by the wallet to prove the BTC redemption transaction\\n    ///         and to make the necessary bookkeeping. Redemption is only\\n    ///         accepted if it satisfies SPV proof.\\n    ///\\n    ///         The function is performing Bank balance updates by burning\\n    ///         the total redeemed Bitcoin amount from Bridge balance and\\n    ///         transferring the treasury fee sum to the treasury address.\\n    ///\\n    ///         It is possible to prove the given redemption only one time.\\n    /// @param redemptionTx Bitcoin redemption transaction data\\n    /// @param redemptionProof Bitcoin redemption proof data\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    ///        HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction\\n    /// @dev Requirements:\\n    ///      - `redemptionTx` components must match the expected structure. See\\n    ///        `BitcoinTx.Info` docs for reference. Their values must exactly\\n    ///        correspond to appropriate Bitcoin transaction fields to produce\\n    ///        a provable transaction hash.\\n    ///      - The `redemptionTx` should represent a Bitcoin transaction with\\n    ///        exactly 1 input that refers to the wallet's main UTXO. That\\n    ///        transaction should have 1..n outputs handling existing pending\\n    ///        redemption requests or pointing to reported timed out requests.\\n    ///        There can be also 1 optional output representing the\\n    ///        change and pointing back to the 20-byte wallet public key hash.\\n    ///        The change should be always present if the redeemed value sum\\n    ///        is lower than the total wallet's BTC balance.\\n    ///      - `redemptionProof` components must match the expected structure.\\n    ///        See `BitcoinTx.Proof` docs for reference. The `bitcoinHeaders`\\n    ///        field must contain a valid number of block headers, not less\\n    ///        than the `txProofDifficultyFactor` contract constant.\\n    ///      - `mainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///        Additionally, the recent main UTXO on Ethereum must be set.\\n    ///      - `walletPubKeyHash` must be connected with the main UTXO used\\n    ///        as transaction single input.\\n    ///      Other remarks:\\n    ///      - Putting the change output as the first transaction output can\\n    ///        save some gas because the output processing loop begins each\\n    ///        iteration by checking whether the given output is the change\\n    ///        thus uses some gas for making the comparison. Once the change\\n    ///        is identified, that check is omitted in further iterations.\\n    function submitRedemptionProof(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.Info calldata redemptionTx,\\n        BitcoinTx.Proof calldata redemptionProof,\\n        BitcoinTx.UTXO calldata mainUtxo,\\n        bytes20 walletPubKeyHash\\n    ) external {\\n        // The actual transaction proof is performed here. After that point, we\\n        // can assume the transaction happened on Bitcoin chain and has\\n        // a sufficient number of confirmations as determined by\\n        // `txProofDifficultyFactor` constant.\\n        bytes32 redemptionTxHash = self.validateProof(\\n            redemptionTx,\\n            redemptionProof\\n        );\\n\\n        // Process the redemption transaction input. Specifically, check if it\\n        // refers to the expected wallet's main UTXO.\\n        OutboundTx.processWalletOutboundTxInput(\\n            self,\\n            redemptionTx.inputVector,\\n            mainUtxo,\\n            walletPubKeyHash\\n        );\\n\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        Wallets.WalletState walletState = wallet.state;\\n        require(\\n            walletState == Wallets.WalletState.Live ||\\n                walletState == Wallets.WalletState.MovingFunds,\\n            \\\"Wallet must be in Live or MovingFunds state\\\"\\n        );\\n\\n        // Process redemption transaction outputs to extract some info required\\n        // for further processing.\\n        RedemptionTxOutputsInfo memory outputsInfo = processRedemptionTxOutputs(\\n            self,\\n            redemptionTx.outputVector,\\n            walletPubKeyHash\\n        );\\n\\n        if (outputsInfo.changeValue > 0) {\\n            // If the change value is grater than zero, it means the change\\n            // output exists and can be used as new wallet's main UTXO.\\n            wallet.mainUtxoHash = keccak256(\\n                abi.encodePacked(\\n                    redemptionTxHash,\\n                    outputsInfo.changeIndex,\\n                    outputsInfo.changeValue\\n                )\\n            );\\n        } else {\\n            // If the change value is zero, it means the change output doesn't\\n            // exists and no funds left on the wallet. Delete the main UTXO\\n            // for that wallet to represent that state in a proper way.\\n            delete wallet.mainUtxoHash;\\n        }\\n\\n        wallet.pendingRedemptionsValue -= outputsInfo.totalBurnableValue;\\n\\n        emit RedemptionsCompleted(walletPubKeyHash, redemptionTxHash);\\n\\n        self.bank.decreaseBalance(outputsInfo.totalBurnableValue);\\n        self.bank.transferBalance(self.treasury, outputsInfo.totalTreasuryFee);\\n    }\\n\\n    /// @notice Processes the Bitcoin redemption transaction output vector.\\n    ///         It extracts each output and tries to identify it as a pending\\n    ///         redemption request, reported timed out request, or change.\\n    ///         Reverts if one of the outputs cannot be recognized properly.\\n    ///         This function also marks each request as processed by removing\\n    ///         them from `pendingRedemptions` mapping.\\n    /// @param redemptionTxOutputVector Bitcoin redemption transaction output\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVout` function\\n    ///        before it is passed here\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction.\\n    /// @return info Outcomes of the processing.\\n    function processRedemptionTxOutputs(\\n        BridgeState.Storage storage self,\\n        bytes memory redemptionTxOutputVector,\\n        bytes20 walletPubKeyHash\\n    ) internal returns (RedemptionTxOutputsInfo memory info) {\\n        // Determining the total number of redemption transaction outputs in\\n        // the same way as for number of inputs. See `BitcoinTx.outputVector`\\n        // docs for more details.\\n        (\\n            uint256 outputsCompactSizeUintLength,\\n            uint256 outputsCount\\n        ) = redemptionTxOutputVector.parseVarInt();\\n\\n        // To determine the first output starting index, we must jump over\\n        // the compactSize uint which prepends the output vector. One byte\\n        // must be added because `BtcUtils.parseVarInt` does not include\\n        // compactSize uint tag in the returned length.\\n        //\\n        // For >= 0 && <= 252, `BTCUtils.determineVarIntDataLengthAt`\\n        // returns `0`, so we jump over one byte of compactSize uint.\\n        //\\n        // For >= 253 && <= 0xffff there is `0xfd` tag,\\n        // `BTCUtils.determineVarIntDataLengthAt` returns `2` (no\\n        // tag byte included) so we need to jump over 1+2 bytes of\\n        // compactSize uint.\\n        //\\n        // Please refer `BTCUtils` library and compactSize uint\\n        // docs in `BitcoinTx` library for more details.\\n        uint256 outputStartingIndex = 1 + outputsCompactSizeUintLength;\\n\\n        // Calculate the keccak256 for two possible wallet's P2PKH or P2WPKH\\n        // scripts that can be used to lock the change. This is done upfront to\\n        // save on gas. Both scripts have a strict format defined by Bitcoin.\\n        //\\n        // The P2PKH script has the byte format: <0x1976a914> <20-byte PKH> <0x88ac>.\\n        // According to https://en.bitcoin.it/wiki/Script#Opcodes this translates to:\\n        // - 0x19: Byte length of the entire script\\n        // - 0x76: OP_DUP\\n        // - 0xa9: OP_HASH160\\n        // - 0x14: Byte length of the public key hash\\n        // - 0x88: OP_EQUALVERIFY\\n        // - 0xac: OP_CHECKSIG\\n        // which matches the P2PKH structure as per:\\n        // https://en.bitcoin.it/wiki/Transaction#Pay-to-PubkeyHash\\n        bytes32 walletP2PKHScriptKeccak = keccak256(\\n            abi.encodePacked(hex\\\"1976a914\\\", walletPubKeyHash, hex\\\"88ac\\\")\\n        );\\n        // The P2WPKH script has the byte format: <0x160014> <20-byte PKH>.\\n        // According to https://en.bitcoin.it/wiki/Script#Opcodes this translates to:\\n        // - 0x16: Byte length of the entire script\\n        // - 0x00: OP_0\\n        // - 0x14: Byte length of the public key hash\\n        // which matches the P2WPKH structure as per:\\n        // https://github.com/bitcoin/bips/blob/master/bip-0141.mediawiki#P2WPKH\\n        bytes32 walletP2WPKHScriptKeccak = keccak256(\\n            abi.encodePacked(hex\\\"160014\\\", walletPubKeyHash)\\n        );\\n\\n        return\\n            processRedemptionTxOutputs(\\n                self,\\n                redemptionTxOutputVector,\\n                walletPubKeyHash,\\n                RedemptionTxOutputsProcessingInfo(\\n                    outputStartingIndex,\\n                    outputsCount,\\n                    walletP2PKHScriptKeccak,\\n                    walletP2WPKHScriptKeccak\\n                )\\n            );\\n    }\\n\\n    /// @notice Processes all outputs from the redemption transaction. Tries to\\n    ///         identify output as a change output, pending redemption request\\n    //          or reported redemption. Reverts if one of the outputs cannot be\\n    ///         recognized properly. Marks each request as processed by removing\\n    ///         them from `pendingRedemptions` mapping.\\n    /// @param redemptionTxOutputVector Bitcoin redemption transaction output\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVout` function\\n    ///        before it is passed here\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction.\\n    /// @param processInfo RedemptionTxOutputsProcessingInfo identifying output\\n    ///        starting index, the number of outputs and possible wallet change\\n    ///        P2PKH and P2WPKH scripts.\\n    function processRedemptionTxOutputs(\\n        BridgeState.Storage storage self,\\n        bytes memory redemptionTxOutputVector,\\n        bytes20 walletPubKeyHash,\\n        RedemptionTxOutputsProcessingInfo memory processInfo\\n    ) internal returns (RedemptionTxOutputsInfo memory resultInfo) {\\n        // Helper flag indicating whether there was at least one redemption\\n        // output present (redemption must be either pending or reported as\\n        // timed out).\\n        bool redemptionPresent = false;\\n\\n        // Outputs processing loop.\\n        for (uint256 i = 0; i < processInfo.outputsCount; i++) {\\n            // TODO: Check if we can optimize gas costs by adding\\n            //       `extractValueAt` and `extractHashAt` in `bitcoin-spv-sol`\\n            //       in order to avoid allocating bytes in memory.\\n            uint256 outputLength = redemptionTxOutputVector\\n                .determineOutputLengthAt(processInfo.outputStartingIndex);\\n            bytes memory output = redemptionTxOutputVector.slice(\\n                processInfo.outputStartingIndex,\\n                outputLength\\n            );\\n\\n            // Extract the value from given output.\\n            uint64 outputValue = output.extractValue();\\n            // The output consists of an 8-byte value and a variable length\\n            // script. To extract that script we slice the output starting from\\n            // 9th byte until the end.\\n            bytes memory outputScript = output.slice(8, output.length - 8);\\n\\n            if (\\n                resultInfo.changeValue == 0 &&\\n                (keccak256(outputScript) ==\\n                    processInfo.walletP2PKHScriptKeccak ||\\n                    keccak256(outputScript) ==\\n                    processInfo.walletP2WPKHScriptKeccak) &&\\n                outputValue > 0\\n            ) {\\n                // If we entered here, that means the change output with a\\n                // proper non-zero value was found.\\n                resultInfo.changeIndex = uint32(i);\\n                resultInfo.changeValue = outputValue;\\n            } else {\\n                // If we entered here, that the means the given output is\\n                // supposed to represent a redemption.\\n                (\\n                    uint64 burnableValue,\\n                    uint64 treasuryFee\\n                ) = processNonChangeRedemptionTxOutput(\\n                        self,\\n                        walletPubKeyHash,\\n                        outputScript,\\n                        outputValue\\n                    );\\n                resultInfo.totalBurnableValue += burnableValue;\\n                resultInfo.totalTreasuryFee += treasuryFee;\\n                redemptionPresent = true;\\n            }\\n\\n            // Make the `outputStartingIndex` pointing to the next output by\\n            // increasing it by current output's length.\\n            processInfo.outputStartingIndex += outputLength;\\n        }\\n\\n        // Protect against the cases when there is only a single change output\\n        // referring back to the wallet PKH and just burning main UTXO value\\n        // for transaction fees.\\n        require(\\n            redemptionPresent,\\n            \\\"Redemption transaction must process at least one redemption\\\"\\n        );\\n    }\\n\\n    /// @notice Processes a single redemption transaction output. Tries to\\n    ///         identify output as a pending redemption request or reported\\n    ///         redemption timeout. Output script passed to this function must\\n    ///         not be the change output. Such output needs to be identified\\n    ///         separately before calling this function.\\n    ///         Reverts if output is neither requested pending redemption nor\\n    ///         requested and reported timed-out redemption.\\n    ///         This function also marks each pending request as processed by\\n    ///         removing them from `pendingRedemptions` mapping.\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction.\\n    /// @param outputScript Non-change output script to be processed\\n    /// @param outputValue Value of the output being processed\\n    /// @return burnableValue The value burnable as a result of processing this\\n    ///         single redemption output. This value needs to be summed up with\\n    ///         burnable values of all other outputs to evaluate total burnable\\n    ///         value for the entire redemption transaction. This value is 0\\n    ///         for a timed-out redemption request.\\n    /// @return treasuryFee The treasury fee from this single redemption output.\\n    ///         This value needs to be summed up with treasury fees of all other\\n    ///         outputs to evaluate the total treasury fee for the entire\\n    ///         redemption transaction. This value is 0 for a timed-out\\n    ///         redemption request.\\n    function processNonChangeRedemptionTxOutput(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        bytes memory outputScript,\\n        uint64 outputValue\\n    ) internal returns (uint64 burnableValue, uint64 treasuryFee) {\\n        // This function should be called only if the given output is\\n        // supposed to represent a redemption. Build the redemption key\\n        // to perform that check.\\n        uint256 redemptionKey = uint256(\\n            keccak256(abi.encodePacked(walletPubKeyHash, outputScript))\\n        );\\n\\n        if (self.pendingRedemptions[redemptionKey].requestedAt != 0) {\\n            // If we entered here, that means the output was identified\\n            // as a pending redemption request.\\n            RedemptionRequest storage request = self.pendingRedemptions[\\n                redemptionKey\\n            ];\\n            // Compute the request's redeemable amount as the requested\\n            // amount reduced by the treasury fee. The request's\\n            // minimal amount is then the redeemable amount reduced by\\n            // the maximum transaction fee.\\n            uint64 redeemableAmount = request.requestedAmount -\\n                request.treasuryFee;\\n            // Output value must fit between the request's redeemable\\n            // and minimal amounts to be deemed valid.\\n            require(\\n                redeemableAmount - request.txMaxFee <= outputValue &&\\n                    outputValue <= redeemableAmount,\\n                \\\"Output value is not within the acceptable range of the pending request\\\"\\n            );\\n            // Add the redeemable amount to the total burnable value\\n            // the Bridge will use to decrease its balance in the Bank.\\n            burnableValue = redeemableAmount;\\n            // Add the request's treasury fee to the total treasury fee\\n            // value the Bridge will transfer to the treasury.\\n            treasuryFee = request.treasuryFee;\\n            // Request was properly handled so remove its redemption\\n            // key from the mapping to make it reusable for further\\n            // requests.\\n            delete self.pendingRedemptions[redemptionKey];\\n        } else {\\n            // If we entered here, the output is not a redemption\\n            // request but there is still a chance the given output is\\n            // related to a reported timed out redemption request.\\n            // If so, check if the output value matches the request\\n            // amount to confirm this is an overdue request fulfillment\\n            // then bypass this output and process the subsequent\\n            // ones. That also means the wallet was already punished\\n            // for the inactivity. Otherwise, just revert.\\n            RedemptionRequest storage request = self.timedOutRedemptions[\\n                redemptionKey\\n            ];\\n\\n            require(\\n                request.requestedAt != 0,\\n                \\\"Output is a non-requested redemption\\\"\\n            );\\n\\n            uint64 redeemableAmount = request.requestedAmount -\\n                request.treasuryFee;\\n\\n            require(\\n                redeemableAmount - request.txMaxFee <= outputValue &&\\n                    outputValue <= redeemableAmount,\\n                \\\"Output value is not within the acceptable range of the timed out request\\\"\\n            );\\n        }\\n    }\\n\\n    /// @notice Notifies that there is a pending redemption request associated\\n    ///         with the given wallet, that has timed out. The redemption\\n    ///         request is identified by the key built as\\n    ///         `keccak256(walletPubKeyHash | redeemerOutputScript)`.\\n    ///         The results of calling this function:\\n    ///         - the pending redemptions value for the wallet will be decreased\\n    ///           by the requested amount (minus treasury fee),\\n    ///         - the tokens taken from the redeemer on redemption request will\\n    ///           be returned to the redeemer,\\n    ///         - the request will be moved from pending redemptions to\\n    ///           timed-out redemptions,\\n    ///         - if the state of the wallet is `Live` or `MovingFunds`, the\\n    ///           wallet operators will be slashed and the notifier will be\\n    ///           rewarded,\\n    ///         - if the state of wallet is `Live`, the wallet will be closed or\\n    ///           marked as `MovingFunds` (depending on the presence or absence\\n    ///           of the wallet's main UTXO) and the wallet will no longer be\\n    ///           marked as the active wallet (if it was marked as such).\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @param redeemerOutputScript  The redeemer's length-prefixed output\\n    ///        script (P2PKH, P2WPKH, P2SH or P2WSH)\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the Live or MovingFunds or Terminated state\\n    ///      - The redemption request identified by `walletPubKeyHash` and\\n    ///        `redeemerOutputScript` must exist\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events of the `WalletRegistry` contract\\n    ///      - The amount of time defined by `redemptionTimeout` must have\\n    ///        passed since the redemption was requested (the request must be\\n    ///        timed-out)\\n    function notifyRedemptionTimeout(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        uint32[] calldata walletMembersIDs,\\n        bytes calldata redeemerOutputScript\\n    ) external {\\n        uint256 redemptionKey = uint256(\\n            keccak256(abi.encodePacked(walletPubKeyHash, redeemerOutputScript))\\n        );\\n        Redemption.RedemptionRequest memory request = self.pendingRedemptions[\\n            redemptionKey\\n        ];\\n\\n        require(request.requestedAt > 0, \\\"Redemption request does not exist\\\");\\n        require(\\n            /* solhint-disable-next-line not-rely-on-time */\\n            request.requestedAt + self.redemptionTimeout < block.timestamp,\\n            \\\"Redemption request has not timed out\\\"\\n        );\\n\\n        // Update the wallet's pending redemptions value\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n        wallet.pendingRedemptionsValue -=\\n            request.requestedAmount -\\n            request.treasuryFee;\\n\\n        require(\\n            // TODO: Allow the wallets in `Closing` state when the state is added\\n            wallet.state == Wallets.WalletState.Live ||\\n                wallet.state == Wallets.WalletState.MovingFunds ||\\n                wallet.state == Wallets.WalletState.Terminated,\\n            \\\"The wallet must be in Live, MovingFunds or Terminated state\\\"\\n        );\\n\\n        // It is worth noting that there is no need to check if\\n        // `timedOutRedemption` mapping already contains the given redemption\\n        // key. There is no possibility to re-use a key of a reported timed-out\\n        // redemption because the wallet responsible for causing the timeout is\\n        // moved to a state that prevents it to receive new redemption requests.\\n\\n        // Move the redemption from pending redemptions to timed-out redemptions\\n        self.timedOutRedemptions[redemptionKey] = request;\\n        delete self.pendingRedemptions[redemptionKey];\\n\\n        if (\\n            wallet.state == Wallets.WalletState.Live ||\\n            wallet.state == Wallets.WalletState.MovingFunds\\n        ) {\\n            // Propagate timeout consequences to the wallet\\n            self.notifyWalletTimedOutRedemption(walletPubKeyHash);\\n\\n            // Slash the wallet operators and reward the notifier\\n            self.ecdsaWalletRegistry.seize(\\n                self.redemptionTimeoutSlashingAmount,\\n                self.redemptionTimeoutNotifierRewardMultiplier,\\n                msg.sender,\\n                wallet.ecdsaWalletID,\\n                walletMembersIDs\\n            );\\n        }\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit RedemptionTimedOut(walletPubKeyHash, redeemerOutputScript);\\n\\n        // Return the requested amount of tokens to the redeemer\\n        self.bank.transferBalance(request.redeemer, request.requestedAmount);\\n    }\\n}\\n\",\"keccak256\":\"0x7abf06527135f3e650e106b44d105ba5ca27a9c3dcad12f4f8aa77cc60460720\",\"license\":\"MIT\"},\"contracts/bridge/Wallets.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {EcdsaDkg} from \\\"@keep-network/ecdsa/contracts/libraries/EcdsaDkg.sol\\\";\\nimport {Math} from \\\"@openzeppelin/contracts/utils/math/Math.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./EcdsaLib.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\n\\n/// @title Wallet library\\n/// @notice Library responsible for handling integration between Bridge\\n///         contract and ECDSA wallets.\\nlibrary Wallets {\\n    using BTCUtils for bytes;\\n\\n    /// @notice Represents wallet state:\\n    enum WalletState {\\n        /// @dev The wallet is unknown to the Bridge.\\n        Unknown,\\n        /// @dev The wallet can sweep deposits and accept redemption requests.\\n        Live,\\n        /// @dev The wallet was deemed unhealthy and is expected to move their\\n        ///      outstanding funds to another wallet. The wallet can still\\n        ///      fulfill their pending redemption requests although new\\n        ///      redemption requests and new deposit reveals are not accepted.\\n        MovingFunds,\\n        /// @dev The wallet moved or redeemed all their funds and is in the\\n        ///      closing period where they can be subject of fraud challenges\\n        ///      and must defend against them. This state is needed to protect\\n        ///      against deposit frauds on deposits revealed but not swept.\\n        ///      The closing period must be greater that the deposit refund\\n        ///      time plus some time margin.\\n        Closing,\\n        /// @dev The wallet finalized the closing period successfully and\\n        ///      cannot perform any action in the Bridge.\\n        Closed,\\n        /// @dev The wallet committed a fraud that was reported. The wallet is\\n        ///      blocked and can not perform any actions in the Bridge.\\n        ///      Off-chain coordination with the wallet operators is needed to\\n        ///      recover funds.\\n        Terminated\\n    }\\n\\n    /// @notice Holds information about a wallet.\\n    struct Wallet {\\n        // Identifier of a ECDSA Wallet registered in the ECDSA Wallet Registry.\\n        bytes32 ecdsaWalletID;\\n        // Latest wallet's main UTXO hash computed as\\n        // keccak256(txHash | txOutputIndex | txOutputValue). The `tx` prefix\\n        // refers to the transaction which created that main UTXO. The `txHash`\\n        // is `bytes32` (ordered as in Bitcoin internally), `txOutputIndex`\\n        // an `uint32`, and `txOutputValue` an `uint64` value.\\n        bytes32 mainUtxoHash;\\n        // The total redeemable value of pending redemption requests targeting\\n        // that wallet.\\n        uint64 pendingRedemptionsValue;\\n        // UNIX timestamp the wallet was created at.\\n        uint32 createdAt;\\n        // UNIX timestamp indicating the moment the wallet was requested to\\n        // move their funds.\\n        uint32 movingFundsRequestedAt;\\n        // UNIX timestamp indicating the moment the wallet's closing period\\n        // started.\\n        uint32 closingStartedAt;\\n        // Current state of the wallet.\\n        WalletState state;\\n        // Moving funds target wallet commitment submitted by the wallet. It\\n        // is built by applying the keccak256 hash over the list of 20-byte\\n        // public key hashes of the target wallets.\\n        bytes32 movingFundsTargetWalletsCommitmentHash;\\n    }\\n\\n    event NewWalletRequested();\\n\\n    event NewWalletRegistered(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletMovingFunds(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletClosing(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletClosed(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletTerminated(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    /// @notice Requests creation of a new wallet. This function just\\n    ///         forms a request and the creation process is performed\\n    ///         asynchronously. Outcome of that process should be delivered\\n    ///         using `registerNewWallet` function.\\n    /// @param activeWalletMainUtxo Data of the active wallet's main UTXO, as\\n    ///        currently known on the Ethereum chain.\\n    /// @dev Requirements:\\n    ///      - `activeWalletMainUtxo` components must point to the recent main\\n    ///        UTXO of the given active wallet, as currently known on the\\n    ///        Ethereum chain. If there is no active wallet at the moment, or\\n    ///        the active wallet has no main UTXO, this parameter can be\\n    ///        empty as it is ignored.\\n    ///      - Wallet creation must not be in progress\\n    ///      - If the active wallet is set, one of the following\\n    ///        conditions must be true:\\n    ///        - The active wallet BTC balance is above the minimum threshold\\n    ///          and the active wallet is old enough, i.e. the creation period\\n    ///           was elapsed since its creation time\\n    ///        - The active wallet BTC balance is above the maximum threshold\\n    function requestNewWallet(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.UTXO calldata activeWalletMainUtxo\\n    ) external {\\n        require(\\n            self.ecdsaWalletRegistry.getWalletCreationState() ==\\n                EcdsaDkg.State.IDLE,\\n            \\\"Wallet creation already in progress\\\"\\n        );\\n\\n        bytes20 activeWalletPubKeyHash = self.activeWalletPubKeyHash;\\n\\n        // If the active wallet is set, fetch this wallet's details from\\n        // storage to perform conditions check. The `registerNewWallet`\\n        // function guarantees an active wallet is always one of the\\n        // registered ones.\\n        if (activeWalletPubKeyHash != bytes20(0)) {\\n            uint64 activeWalletBtcBalance = getWalletBtcBalance(\\n                self,\\n                activeWalletPubKeyHash,\\n                activeWalletMainUtxo\\n            );\\n            uint32 activeWalletCreatedAt = self\\n                .registeredWallets[activeWalletPubKeyHash]\\n                .createdAt;\\n            /* solhint-disable-next-line not-rely-on-time */\\n            bool activeWalletOldEnough = block.timestamp >=\\n                activeWalletCreatedAt + self.walletCreationPeriod;\\n\\n            require(\\n                (activeWalletOldEnough &&\\n                    activeWalletBtcBalance >=\\n                    self.walletCreationMinBtcBalance) ||\\n                    activeWalletBtcBalance >= self.walletCreationMaxBtcBalance,\\n                \\\"Wallet creation conditions are not met\\\"\\n            );\\n        }\\n\\n        emit NewWalletRequested();\\n\\n        self.ecdsaWalletRegistry.requestNewWallet();\\n    }\\n\\n    /// @notice Gets BTC balance for given the wallet.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param walletMainUtxo Data of the wallet's main UTXO, as currently\\n    ///        known on the Ethereum chain.\\n    /// @return walletBtcBalance Current BTC balance for the given wallet.\\n    /// @dev Requirements:\\n    ///      - `walletMainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///        If the wallet has no main UTXO, this parameter can be empty as it\\n    ///        is ignored.\\n    function getWalletBtcBalance(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata walletMainUtxo\\n    ) internal view returns (uint64 walletBtcBalance) {\\n        bytes32 walletMainUtxoHash = self\\n            .registeredWallets[walletPubKeyHash]\\n            .mainUtxoHash;\\n\\n        // If the wallet has a main UTXO hash set, cross-check it with the\\n        // provided plain-text parameter and get the transaction output value\\n        // as BTC balance. Otherwise, the BTC balance is just zero.\\n        if (walletMainUtxoHash != bytes32(0)) {\\n            require(\\n                keccak256(\\n                    abi.encodePacked(\\n                        walletMainUtxo.txHash,\\n                        walletMainUtxo.txOutputIndex,\\n                        walletMainUtxo.txOutputValue\\n                    )\\n                ) == walletMainUtxoHash,\\n                \\\"Invalid wallet main UTXO data\\\"\\n            );\\n\\n            walletBtcBalance = walletMainUtxo.txOutputValue;\\n        }\\n\\n        return walletBtcBalance;\\n    }\\n\\n    /// @notice Registers a new wallet. This function should be called\\n    ///         after the wallet creation process initiated using\\n    ///         `requestNewWallet` completes and brings the outcomes.\\n    /// @param ecdsaWalletID Wallet's unique identifier.\\n    /// @param publicKeyX Wallet's public key's X coordinate.\\n    /// @param publicKeyY Wallet's public key's Y coordinate.\\n    /// @dev Requirements:\\n    ///      - The only caller authorized to call this function is `registry`\\n    ///      - Given wallet data must not belong to an already registered wallet\\n    function registerNewWallet(\\n        BridgeState.Storage storage self,\\n        bytes32 ecdsaWalletID,\\n        bytes32 publicKeyX,\\n        bytes32 publicKeyY\\n    ) external {\\n        require(\\n            msg.sender == address(self.ecdsaWalletRegistry),\\n            \\\"Caller is not the ECDSA Wallet Registry\\\"\\n        );\\n\\n        // Compress wallet's public key and calculate Bitcoin's hash160 of it.\\n        bytes20 walletPubKeyHash = bytes20(\\n            EcdsaLib.compressPublicKey(publicKeyX, publicKeyY).hash160View()\\n        );\\n\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        require(\\n            wallet.state == WalletState.Unknown,\\n            \\\"ECDSA wallet has been already registered\\\"\\n        );\\n        wallet.ecdsaWalletID = ecdsaWalletID;\\n        wallet.state = WalletState.Live;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        wallet.createdAt = uint32(block.timestamp);\\n\\n        // Set the freshly created wallet as the new active wallet.\\n        self.activeWalletPubKeyHash = walletPubKeyHash;\\n\\n        self.liveWalletsCount++;\\n\\n        emit NewWalletRegistered(ecdsaWalletID, walletPubKeyHash);\\n    }\\n\\n    /// @notice Handles a notification about a wallet heartbeat failure and\\n    ///         triggers the wallet moving funds process.\\n    /// @param publicKeyX Wallet's public key's X coordinate.\\n    /// @param publicKeyY Wallet's public key's Y coordinate.\\n    /// @dev Requirements:\\n    ///      - The only caller authorized to call this function is `registry`\\n    ///      - Wallet must be in Live state\\n    function notifyWalletHeartbeatFailed(\\n        BridgeState.Storage storage self,\\n        bytes32 publicKeyX,\\n        bytes32 publicKeyY\\n    ) external {\\n        require(\\n            msg.sender == address(self.ecdsaWalletRegistry),\\n            \\\"Caller is not the ECDSA Wallet Registry\\\"\\n        );\\n\\n        // Compress wallet's public key and calculate Bitcoin's hash160 of it.\\n        bytes20 walletPubKeyHash = bytes20(\\n            EcdsaLib.compressPublicKey(publicKeyX, publicKeyY).hash160View()\\n        );\\n\\n        require(\\n            self.registeredWallets[walletPubKeyHash].state == WalletState.Live,\\n            \\\"ECDSA wallet must be in Live state\\\"\\n        );\\n\\n        moveFunds(self, walletPubKeyHash);\\n    }\\n\\n    /// @notice Handles a notification about a wallet redemption timeout.\\n    ///         Triggers the wallet moving funds process only if the wallet is\\n    ///         still in the Live state. That means multiple action timeouts can\\n    ///         be reported for the same wallet but only the first report\\n    ///         requests the wallet to move their funds.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the `Live` or `MovingFunds` state\\n    function notifyWalletTimedOutRedemption(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        WalletState walletState = self\\n            .registeredWallets[walletPubKeyHash]\\n            .state;\\n\\n        require(\\n            walletState == WalletState.Live ||\\n                walletState == WalletState.MovingFunds,\\n            \\\"ECDSA wallet must be in Live or MovingFunds state\\\"\\n        );\\n\\n        if (walletState == WalletState.Live) {\\n            moveFunds(self, walletPubKeyHash);\\n        }\\n    }\\n\\n    /// @notice Notifies that the wallet is either old enough or has too few\\n    ///         satoshis left and qualifies to be closed.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param walletMainUtxo Data of the wallet's main UTXO, as currently\\n    ///        known on the Ethereum chain.\\n    /// @dev Requirements:\\n    ///      - Wallet must not be set as the current active wallet\\n    ///      - Wallet must exceed the wallet maximum age OR the wallet BTC\\n    ///        balance must be lesser than the minimum threshold. If the latter\\n    ///        case is true, the `walletMainUtxo` components must point to the\\n    ///        recent main UTXO of the given wallet, as currently known on the\\n    ///        Ethereum chain. If the wallet has no main UTXO, this parameter\\n    ///        can be empty as it is ignored since the wallet balance is\\n    ///        assumed to be zero.\\n    ///      - Wallet must be in Live state\\n    function notifyCloseableWallet(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata walletMainUtxo\\n    ) external {\\n        require(\\n            self.activeWalletPubKeyHash != walletPubKeyHash,\\n            \\\"Active wallet cannot be considered closeable\\\"\\n        );\\n\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        require(\\n            wallet.state == WalletState.Live,\\n            \\\"ECDSA wallet must be in Live state\\\"\\n        );\\n\\n        /* solhint-disable-next-line not-rely-on-time */\\n        bool walletOldEnough = block.timestamp >=\\n            wallet.createdAt + self.walletMaxAge;\\n\\n        require(\\n            walletOldEnough ||\\n                getWalletBtcBalance(self, walletPubKeyHash, walletMainUtxo) <\\n                self.walletClosureMinBtcBalance,\\n            \\\"Wallet needs to be old enough or have too few satoshis\\\"\\n        );\\n\\n        moveFunds(self, walletPubKeyHash);\\n    }\\n\\n    /// @notice Requests a wallet to move their funds. If the wallet balance\\n    ///         is zero, the wallet closing begins immediately. If the move\\n    ///         funds request refers to the current active wallet, such a wallet\\n    ///         is no longer considered active and the active wallet slot\\n    ///         is unset allowing to trigger a new wallet creation immediately.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the Live state\\n    function moveFunds(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        if (wallet.mainUtxoHash == bytes32(0)) {\\n            // If the wallet has no main UTXO, that means its BTC balance\\n            // is zero and the wallet closing should begin immediately.\\n            beginWalletClosing(self, walletPubKeyHash);\\n        } else {\\n            // Otherwise, initialize the moving funds process.\\n            wallet.state = WalletState.MovingFunds;\\n            /* solhint-disable-next-line not-rely-on-time */\\n            wallet.movingFundsRequestedAt = uint32(block.timestamp);\\n\\n            emit WalletMovingFunds(wallet.ecdsaWalletID, walletPubKeyHash);\\n        }\\n\\n        if (self.activeWalletPubKeyHash == walletPubKeyHash) {\\n            // If the move funds request refers to the current active wallet,\\n            // unset the active wallet and make the wallet creation process\\n            // possible in order to get a new healthy active wallet.\\n            delete self.activeWalletPubKeyHash;\\n        }\\n\\n        self.liveWalletsCount--;\\n    }\\n\\n    /// @notice Begins the closing period of the given wallet.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the\\n    ///        MovingFunds state\\n    function beginWalletClosing(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        // Initialize the closing period.\\n        wallet.state = WalletState.Closing;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        wallet.closingStartedAt = uint32(block.timestamp);\\n\\n        emit WalletClosing(wallet.ecdsaWalletID, walletPubKeyHash);\\n    }\\n\\n    /// @notice Notifies about the end of the closing period for the given wallet.\\n    ///         Closes the wallet ultimately and notifies the ECDSA registry\\n    ///         about this fact.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the Closing state\\n    ///      - The wallet closing period must have elapsed\\n    function notifyWalletClosingPeriodElapsed(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        require(\\n            wallet.state == WalletState.Closing,\\n            \\\"ECDSA wallet must be in Closing state\\\"\\n        );\\n\\n        require(\\n            /* solhint-disable-next-line not-rely-on-time */\\n            block.timestamp >\\n                wallet.closingStartedAt + self.walletClosingPeriod,\\n            \\\"Closing period has not elapsed yet\\\"\\n        );\\n\\n        finalizeWalletClosing(self, walletPubKeyHash);\\n    }\\n\\n    /// @notice Finalizes the closing period of the given wallet and notifies\\n    ///         the ECDSA registry about this fact.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the Closing state\\n    function finalizeWalletClosing(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        wallet.state = WalletState.Closed;\\n\\n        emit WalletClosed(wallet.ecdsaWalletID, walletPubKeyHash);\\n\\n        self.ecdsaWalletRegistry.closeWallet(wallet.ecdsaWalletID);\\n    }\\n\\n    /// @notice Terminates the given wallet and notifies the ECDSA registry\\n    ///         about this fact. If the wallet termination refers to the current\\n    ///         active wallet, such a wallet is no longer considered active and\\n    ///         the active wallet slot is unset allowing to trigger a new wallet\\n    ///         creation immediately.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the\\n    ///        Live or MovingFunds or Closing state.\\n    function terminateWallet(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        if (wallet.state == WalletState.Live) {\\n            self.liveWalletsCount--;\\n        }\\n\\n        wallet.state = WalletState.Terminated;\\n\\n        emit WalletTerminated(wallet.ecdsaWalletID, walletPubKeyHash);\\n\\n        if (self.activeWalletPubKeyHash == walletPubKeyHash) {\\n            // If termination refers to the current active wallet,\\n            // unset the active wallet and make the wallet creation process\\n            // possible in order to get a new healthy active wallet.\\n            delete self.activeWalletPubKeyHash;\\n        }\\n\\n        self.ecdsaWalletRegistry.closeWallet(wallet.ecdsaWalletID);\\n    }\\n\\n    /// @notice Notifies that the wallet completed the moving funds process\\n    ///         successfully. Checks if the funds were moved to the expected\\n    ///         target wallets. Closes the source wallet if everything went\\n    ///         good and reverts otherwise.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param targetWalletsHash 32-byte keccak256 hash over the list of\\n    ///        20-byte public key hashes of the target wallets actually used\\n    ///        within the moving funds transactions.\\n    /// @dev Requirements:\\n    ///      - The caller must make sure the moving funds transaction actually\\n    ///        happened on Bitcoin chain and fits the protocol requirements.\\n    ///      - The source wallet must be in the MovingFunds state\\n    ///      - The target wallets commitment must be submitted by the source\\n    ///        wallet.\\n    ///      - The actual target wallets used in the moving funds transaction\\n    ///        must be exactly the same as the target wallets commitment.\\n    function notifyWalletFundsMoved(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        bytes32 targetWalletsHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        // Check that the wallet is in the MovingFunds state but don't check\\n        // if the moving funds timeout is exceeded. That should give a\\n        // possibility to move funds in case when timeout was hit but was\\n        // not reported yet.\\n        require(\\n            wallet.state == WalletState.MovingFunds,\\n            \\\"ECDSA wallet must be in MovingFunds state\\\"\\n        );\\n\\n        bytes32 targetWalletsCommitmentHash = wallet\\n            .movingFundsTargetWalletsCommitmentHash;\\n\\n        require(\\n            targetWalletsCommitmentHash != bytes32(0),\\n            \\\"Target wallets commitment not submitted yet\\\"\\n        );\\n\\n        // Make sure that the target wallets where funds were moved to are\\n        // exactly the same as the ones the source wallet committed to.\\n        require(\\n            targetWalletsCommitmentHash == targetWalletsHash,\\n            \\\"Target wallets don't correspond to the commitment\\\"\\n        );\\n\\n        // If funds were moved, the wallet has no longer a main UTXO.\\n        delete wallet.mainUtxoHash;\\n\\n        beginWalletClosing(self, walletPubKeyHash);\\n    }\\n}\\n\",\"keccak256\":\"0x61ae7c54cca8f74793c74fa5ff53aaa6266904ea971ba6d3b7d11d3b453c97c4\",\"license\":\"MIT\"},\"contracts/vault/IVault.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\n/// @title Bank Vault interface\\n/// @notice `IVault` is an interface for a smart contract consuming Bank\\n///         balances of other contracts or externally owned accounts (EOA).\\ninterface IVault {\\n    /// @notice Called by the Bank in `approveBalanceAndCall` function after\\n    ///         the balance `owner` approved `amount` of their balance in the\\n    ///         Bank for the vault. This way, the depositor can approve balance\\n    ///         and call the vault to use the approved balance in a single\\n    ///         transaction.\\n    /// @param owner Address of the Bank balance owner who approved their\\n    ///        balance to be used by the vault\\n    /// @param amount The amount of the Bank balance approved by the owner\\n    ///        to be used by the vault\\n    // @dev The implementation must ensure this function can only be called\\n    ///      by the Bank. The Bank does _not_ guarantee that the `amount`\\n    ///      approved by the `owner` currently exists on their balance. That is,\\n    ///      the `owner` could approve more balance than they currently have.\\n    ///      This works the same as `Bank.approve` function. The vault must\\n    ///      ensure the actual balance is checked before performing any action\\n    ///      based on it.\\n    function receiveBalanceApproval(address owner, uint256 amount) external;\\n\\n    /// @notice Called by the Bank in `increaseBalanceAndCall` function after\\n    ///         increasing the balance in the Bank for the vault. It happens in\\n    ///         the same transaction in which deposits were swept by the Bridge.\\n    ///         This allows the depositor to route their deposit revealed to the\\n    ///         Bridge to the particular smart contract (vault) in the same\\n    ///         transaction in which the deposit is revealed. This way, the\\n    ///         depositor does not have to execute additional transaction after\\n    ///         the deposit gets swept by the Bridge to approve and transfer\\n    ///         their balance to the vault.\\n    /// @param depositors Addresses of depositors whose deposits have been swept\\n    /// @param depositedAmounts Amounts deposited by individual depositors and\\n    ///        swept\\n    /// @dev The implementation must ensure this function can only be called\\n    ///      by the Bank. The Bank guarantees that the vault's balance was\\n    ///      increased by the sum of all deposited amounts before this function\\n    ///      is called, in the same transaction.\\n    function receiveBalanceIncrease(\\n        address[] calldata depositors,\\n        uint256[] calldata depositedAmounts\\n    ) external;\\n}\\n\",\"keccak256\":\"0x48d596548f2e6a69e31825f49882998789ea43ff5bcaeb5eea2d9b910577a5e9\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x613caa61003a600b82828239805160001a60731461002d57634e487b7160e01b600052600060045260246000fd5b30600052607381538281f3fe730000000000000000000000000000000000000000301460806040526004361061004b5760003560e01c80637333b36914610050578063a164de6e14610072578063a76558b314610092575b600080fd5b81801561005c57600080fd5b5061007061006b3660046134f8565b6100b2565b005b81801561007e57600080fd5b5061007061008d366004613577565b61086a565b81801561009e57600080fd5b506100706100ad36600461360f565b610c09565b6001600160601b031985166000908152601987016020526040902060016002820154600160a01b900460ff1660058111156100ef576100ef6136ca565b146101415760405162461bcd60e51b815260206004820152601c60248201527f57616c6c6574206d75737420626520696e204c6976652073746174650000000060448201526064015b60405180910390fd5b60018101548061019d5760405162461bcd60e51b815260206004820152602160248201527f4e6f206d61696e205554584f20666f722074686520676976656e2077616c6c656044820152601d60fa1b6064820152608401610138565b8086356101b06040890160208a016136f4565b6101c060608a0160408b0161370f565b6040516020016101fd9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60405160208183030381529060405280519060200120146102605760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b6000610292600060c01b878760405160200161027e9392919061372a565b60405160208183030381529060405261117c565b9050600081511161030b5760405162461bcd60e51b815260206004820152602e60248201527f52656465656d6572206f757470757420736372697074206d757374206265206160448201527f207374616e6461726420747970650000000000000000000000000000000000006064820152608401610138565b80805190602001208860405160200161033491906001600160601b031991909116815260140190565b6040516020818303038152906040528051906020012014156103be5760405162461bcd60e51b815260206004820152603760248201527f52656465656d6572206f757470757420736372697074206d757374206e6f742060448201527f706f696e7420746f207468652077616c6c657420504b480000000000000000006064820152608401610138565b600a89015467ffffffffffffffff680100000000000000009091048116908516101561042c5760405162461bcd60e51b815260206004820152601b60248201527f526564656d7074696f6e20616d6f756e7420746f6f20736d616c6c00000000006044820152606401610138565b60008887876040516020016104439392919061374e565b60408051808303601f1901815291815281516020928301206000818152600e8e01909352912060010154909150600160801b900463ffffffff16156105165760405162461bcd60e51b815260206004820152604a60248201527f546865726520697320612070656e64696e6720726564656d7074696f6e20726560448201527f71756573742066726f6d20746869732077616c6c657420746f2074686520736160648201527f6d65206164647265737300000000000000000000000000000000000000000000608482015260a401610138565b600a8a0154600090600160801b900467ffffffffffffffff1661053a57600061055a565b600a8b015461055a90600160801b900467ffffffffffffffff168761379e565b600a8c01549091507801000000000000000000000000000000000000000000000000900467ffffffffffffffff1661059282886137c5565b6002870180546000906105b090849067ffffffffffffffff166137ee565b82546101009290920a67ffffffffffffffff81810219909316918316021790915560028801541690506105e960608c0160408d0161370f565b67ffffffffffffffff1610156106415760405162461bcd60e51b815260206004820152601960248201527f496e73756666696369656e742077616c6c65742066756e6473000000000000006044820152606401610138565b6040518060a00160405280336001600160a01b031681526020018867ffffffffffffffff1681526020018367ffffffffffffffff1681526020018267ffffffffffffffff1681526020014263ffffffff168152508c600e01600085815260200190815260200160002060008201518160000160006101000a8154816001600160a01b0302191690836001600160a01b0316021790555060208201518160000160146101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060408201518160010160006101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060608201518160010160086101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060808201518160010160106101000a81548163ffffffff021916908363ffffffff1602179055509050507f97a0199072f487232635d50ab75860891afe0b91c976ed2fc76502c4d82d0d958b8a8a338b87876040516107c99796959493929190613843565b60405180910390a18b546040517f7c6db49c00000000000000000000000000000000000000000000000000000000815233600482015230602482015267ffffffffffffffff891660448201526001600160a01b0390911690637c6db49c90606401600060405180830381600087803b15801561084457600080fd5b505af1158015610858573d6000803e3d6000fd5b50505050505050505050505050505050565b6000610877868686611422565b90506108c88661088a60208801886138a7565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508892508791506117129050565b6001600160601b03198216600090815260198701602052604090206002810154600160a01b900460ff166001816005811115610906576109066136ca565b148061092357506002816005811115610921576109216136ca565b145b6109955760405162461bcd60e51b815260206004820152602b60248201527f57616c6c6574206d75737420626520696e204c697665206f72204d6f76696e6760448201527f46756e64732073746174650000000000000000000000000000000000000000006064820152608401610138565b60006109e4896109a860408b018b6138a7565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508a925061196c915050565b606081015190915067ffffffffffffffff1615610a65578381604001518260600151604051602001610a439392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60408051601f1981840301815291905280516020909101206001840155610a6d565b600060018401555b8051600284018054600090610a8d90849067ffffffffffffffff166137c5565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff1602179055507fa45596c10f758d32ec8cca64a0fbfe776052b08fdb3f026e0a87f52118bf8fbe8585604051610af99291906001600160601b0319929092168252602082015260400190565b60405180910390a1885481516040517f392aee4300000000000000000000000000000000000000000000000000000000815267ffffffffffffffff90911660048201526001600160a01b039091169063392aee4390602401600060405180830381600087803b158015610b6b57600080fd5b505af1158015610b7f573d6000803e3d6000fd5b50508a546004808d015460208601516040516356a6d9ef60e01b81526001600160a01b039283169381019390935267ffffffffffffffff16602483015290911692506356a6d9ef91506044015b600060405180830381600087803b158015610be657600080fd5b505af1158015610bfa573d6000803e3d6000fd5b50505050505050505050505050565b6000858383604051602001610c209392919061374e565b60408051808303601f1901815282825280516020918201206000818152600e8c01835283902060a08501845280546001600160a01b0381168652600160a01b900467ffffffffffffffff9081169386019390935260010154808316938501939093526801000000000000000083049091166060840152600160801b90910463ffffffff1660808301819052909250610d045760405162461bcd60e51b815260206004820152602160248201527f526564656d7074696f6e207265717565737420646f6573206e6f7420657869736044820152601d60fa1b6064820152608401610138565b4288600b0154826080015163ffffffff16610d1f91906138ee565b10610d915760405162461bcd60e51b8152602060048201526024808201527f526564656d7074696f6e207265717565737420686173206e6f742074696d656460448201527f206f7574000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001600160601b0319871660009081526019890160209081526040918290209183015190830151610dc291906137c5565b600282018054600090610de090849067ffffffffffffffff166137c5565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060016005811115610e1957610e196136ca565b6002820154600160a01b900460ff166005811115610e3957610e396136ca565b1480610e635750600280820154600160a01b900460ff166005811115610e6157610e616136ca565b145b80610e8d575060056002820154600160a01b900460ff166005811115610e8b57610e8b6136ca565b145b610eff5760405162461bcd60e51b815260206004820152603b60248201527f5468652077616c6c6574206d75737420626520696e204c6976652c204d6f766960448201527f6e6746756e6473206f72205465726d696e6174656420737461746500000000006064820152608401610138565b6000838152600f8a016020908152604080832085518154878501516001600160a01b039092166001600160e01b031991821617600160a01b67ffffffffffffffff93841602178355878401516001938401805460608b015160808c01519386167fffffffffffffffffffffffffffffffff0000000000000000000000000000000090921691909117680100000000000000009190951602939093177fffffffffffffffffffffffff00000000ffffffffffffffffffffffffffffffff16600160801b63ffffffff9092169190910217909155600e8e019093529220805490911681558101805473ffffffffffffffffffffffffffffffffffffffff191690556002820154600160a01b900460ff16600581111561101e5761101e6136ca565b14806110485750600280820154600160a01b900460ff166005811115611046576110466136ca565b145b156110f9576110578989611aa3565b6002890154600c8a0154600d8b015483546040517fd8dc404d0000000000000000000000000000000000000000000000000000000081526001600160a01b039094169363d8dc404d936110c6936bffffffffffffffffffffffff9091169290913391908e908e90600401613906565b600060405180830381600087803b1580156110e057600080fd5b505af11580156110f4573d6000803e3d6000fd5b505050505b7f013dddc8debc4730cd01232fdcea9ae6013689837732356c187fe5edb9a8a8d588868660405161112c93929190613988565b60405180910390a18854825160208401516040516356a6d9ef60e01b81526001600160a01b03928316600482015267ffffffffffffffff90911660248201529116906356a6d9ef90604401610bcc565b6060600082600881518110611193576111936139b1565b0160200151835160f89190911c91506111ad8260096139c7565b60ff16146111cb575050604080516020810190915260008152919050565b826009815181106111de576111de6139b1565b016020015160f81c6112845760028160ff16101561120c575050604080516020810190915260008152919050565b600083600a81518110611221576112216139b1565b016020015160f81c90506112366002836139ec565b60ff1681141580611254575080602014158015611254575080601414155b1561127057505060408051602081019091526000815292915050565b61127c84600b83611b98565b949350505050565b6000611291846008611c62565b90507f1976a900000000000000000000000000000000000000000000000000000000007fffffff00000000000000000000000000000000000000000000000000000000008216141561136e5783600b815181106112f0576112f06139b1565b60209101015160f81c6014141580611345575061131b600285516113149190613a0f565b8590611c62565b7dffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191661222b60f21b14155b1561136157505060408051602081019091526000815292915050565b61127c84600c6014611b98565b7f17a91400000000000000000000000000000000000000000000000000000000007fffffff00000000000000000000000000000000000000000000000000000000008216141561140b5783600185516113c79190613a0f565b815181106113d7576113d76139b1565b60209101015160f81c6087146113fe57505060408051602081019091526000815292915050565b61127c84600b6014611b98565b505050604080516020810190915260008152919050565b600061146e61143460208501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611c7a92505050565b6114ba5760405162461bcd60e51b815260206004820152601d60248201527f496e76616c696420696e70757420766563746f722070726f76696465640000006044820152606401610138565b6115046114ca60408501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611d2a92505050565b6115505760405162461bcd60e51b815260206004820152601e60248201527f496e76616c6964206f757470757420766563746f722070726f766964656400006044820152606401610138565b6115b36115606020850185613a26565b61156d60208601866138a7565b61157a60408801886138a7565b61158a60808a0160608b01613a26565b60405160200161159f96959493929190613a50565b604051602081830303815290604052611dcd565b905061164e6116026115c860408501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611df492505050565b61160c84806138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250869493925050506020860135611e01565b6116c05760405162461bcd60e51b815260206004820152603c60248201527f5478206d65726b6c652070726f6f66206973206e6f742076616c696420666f7260448201527f2070726f76696465642068656164657220616e642074782068617368000000006064820152608401610138565b61170b846116d160408501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611e3d92505050565b9392505050565b6001600160601b0319811660009081526019850160205260409020600101548061177e5760405162461bcd60e51b815260206004820152601d60248201527f4e6f206d61696e205554584f20666f7220676976656e2077616c6c65740000006044820152606401610138565b80833561179160408601602087016136f4565b6117a1606087016040880161370f565b6040516020016117de9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60405160208183030381529060405280519060200120146118415760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b60008061184d866121ac565b909250905084358214801561187c575063ffffffff811661187460408701602088016136f4565b63ffffffff16145b6118ee5760405162461bcd60e51b815260206004820152603f60248201527f4f7574626f756e64207472616e73616374696f6e20696e707574206d7573742060448201527f706f696e7420746f207468652077616c6c65742773206d61696e205554584f006064820152608401610138565b6001601588016000873561190860408a0160208b016136f4565b60405160200161192f92919091825260e01b6001600160e01b031916602082015260240190565b60408051808303601f19018152918152815160209283012083529082019290925201600020805460ff191691151591909117905550505050505050565b6040805160808101825260008082526020820181905291810182905260608101829052908061199a85612287565b909250905060006119ac8360016138ee565b6040517f1976a9140000000000000000000000000000000000000000000000000000000060208201526001600160601b03198716602482015261222b60f21b6038820152909150600090603a0160408051601f198184030181529082905280516020918201207f1600140000000000000000000000000000000000000000000000000000000000918301919091526001600160601b0319881660238301529150600090603701604051602081830303815290604052805190602001209050611a9689898960405180608001604052808881526020018981526020018781526020018681525061229e565b9998505050505050505050565b6001600160601b031981166000908152601983016020526040902060020154600160a01b900460ff166001816005811115611ae057611ae06136ca565b1480611afd57506002816005811115611afb57611afb6136ca565b145b611b6f5760405162461bcd60e51b815260206004820152603160248201527f45434453412077616c6c6574206d75737420626520696e204c697665206f722060448201527f4d6f76696e6746756e64732073746174650000000000000000000000000000006064820152608401610138565b6001816005811115611b8357611b836136ca565b1415611b9357611b93838361249d565b505050565b606081611bb4575060408051602081019091526000815261170b565b6000611bc083856138ee565b90508381118015611bd2575080855110155b611c1e5760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b604051915082604083010160405282825283850182038460208701018481015b80821015611c5757815183830152602082019150611c3e565b505050509392505050565b6000611c718383016020015190565b90505b92915050565b6000806000611c8884612287565b9092509050801580611c9b575060001982145b15611caa575060009392505050565b6000611cb78360016138ee565b905060005b82811015611d1d5785518210611cd85750600095945050505050565b6000611ce487846125e3565b9050600019811415611cfd575060009695505050505050565b611d0781846138ee565b9250508080611d1590613a92565b915050611cbc565b5093519093149392505050565b6000806000611d3884612287565b9092509050801580611d4b575060001982145b15611d5a575060009392505050565b6000611d678360016138ee565b905060005b82811015611d1d5785518210611d885750600095945050505050565b6000611d94878461262e565b9050600019811415611dad575060009695505050505050565b611db781846138ee565b9250508080611dc590613a92565b915050611d6c565b60006020600083516020850160025afa50602060006020600060025afa5050600051919050565b6044810151600090611c74565b60008385148015611e10575081155b8015611e1b57508251155b15611e285750600161127c565b611e3485848685612694565b95945050505050565b6001820154604080517f113764be00000000000000000000000000000000000000000000000000000000815290516001600160a01b0390921691600091839163113764be91600480820192602092909190829003018186803b158015611ea257600080fd5b505afa158015611eb6573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611eda9190613aad565b90506000826001600160a01b0316632b97be246040518163ffffffff1660e01b815260040160206040518083038186803b158015611f1757600080fd5b505afa158015611f2b573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611f4f9190613aad565b9050600080611f65611f608761273c565b6127d1565b905083811415611f7757839150611ff5565b82811415611f8757829150611ff5565b60405162461bcd60e51b815260206004820152602560248201527f4e6f742061742063757272656e74206f722070726576696f757320646966666960448201527f63756c74790000000000000000000000000000000000000000000000000000006064820152608401610138565b6000612000876127f9565b905060001981141561207a5760405162461bcd60e51b815260206004820152602360248201527f496e76616c6964206c656e677468206f6620746865206865616465727320636860448201527f61696e00000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001198114156120cc5760405162461bcd60e51b815260206004820152601560248201527f496e76616c6964206865616465727320636861696e00000000000000000000006044820152606401610138565b60021981141561211e5760405162461bcd60e51b815260206004820152601d60248201527f496e73756666696369656e7420776f726b20696e2061206865616465720000006044820152606401610138565b600388015461212d9084613ac6565b8110156121a25760405162461bcd60e51b815260206004820152603360248201527f496e73756666696369656e7420616363756d756c61746564206469666669637560448201527f6c747920696e2068656164657220636861696e000000000000000000000000006064820152608401610138565b5050505050505050565b60008060006121ba84612287565b915050806001146122335760405162461bcd60e51b815260206004820152602d60248201527f4f7574626f756e64207472616e73616374696f6e206d7573742068617665206160448201527f2073696e676c6520696e707574000000000000000000000000000000000000006064820152608401610138565b600061223f8582612a00565b905061224a81612be6565b935061227e61225882612bf3565b60d881901c63ff00ff001662ff00ff60e89290921c9190911617601081811b91901c1790565b92505050915091565b600080612295836000612c00565b91509150915091565b604080516080810182526000808252602082018190529181018290526060810182905290805b83602001518110156124205783516000906122e090889061262e565b85519091506000906122f490899084611b98565b9050600061230182612d7e565b9050600061231f60088085516123179190613a0f565b859190611b98565b9050866060015167ffffffffffffffff16600014801561235b5750604088015181516020830120148061235b5750606088015181516020830120145b8015612371575060008267ffffffffffffffff16115b156123975763ffffffff8516604088015267ffffffffffffffff821660608801526123f1565b6000806123a68d8c8587612df5565b9150915081896000018181516123bc91906137ee565b67ffffffffffffffff169052506020890180518291906123dd9083906137ee565b67ffffffffffffffff169052506001975050505b838860000181815161240391906138ee565b9052508493506124189250839150613a929050565b9150506122c4565b50806124945760405162461bcd60e51b815260206004820152603b60248201527f526564656d7074696f6e207472616e73616374696f6e206d7573742070726f6360448201527f657373206174206c65617374206f6e6520726564656d7074696f6e00000000006064820152608401610138565b50949350505050565b6001600160601b031981166000908152601983016020526040902060018101546124d0576124cb8383613184565b612563565b60028101805463ffffffff42166c01000000000000000000000000027fffffffffffffffffffffff00ffffffff00000000ffffffffffffffffffffffff909116177402000000000000000000000000000000000000000017905580546040516001600160601b0319841691907fbdc9ce990a067e5fd3a5d8dfc68e27e9f221aaa3fe55265e0b7e93c460b3efe290600090a35b601783015460601b6001600160601b031990811690831614156125a05760178301805473ffffffffffffffffffffffffffffffffffffffff191690555b601783018054600160a01b900463ffffffff169060146125bf83613ae5565b91906101000a81548163ffffffff021916908363ffffffff16021790555050505050565b60008060006125f28585613220565b909250905060001982141561260d5760001992505050611c74565b806126198360256138ee565b61262391906138ee565b611e349060046138ee565b600061263b8260096138ee565b8351101561264c5750600019611c74565b6000806126638561265e8660086138ee565b612c00565b909250905060001982141561267e5760001992505050611c74565b8061268a8360096138ee565b611e3491906138ee565b6000602084516126a49190613b05565b156126b15750600061127c565b83516126bf5750600061127c565b818560005b865181101561272f576126d8600284613b05565b600114156126fd576126f66126f08883016020015190565b83613262565b9150612716565b6127138261270e8984016020015190565b613262565b91505b60019290921c916127286020826138ee565b90506126c4565b5090931495945050505050565b60008061274a836048611c62565b60e81c9050600083604b81518110612764576127646139b1565b016020015160f81c9050600061279883600060108262ffffff16901c8261ff001660108462ffffff16901b17179050919050565b62ffffff16905060006127ac6003846139ec565b60ff1690506127bd81610100613bfd565b6127c79083613ac6565b9695505050505050565b6000611c747bffff00000000000000000000000000000000000000000000000000008361326e565b6000605082516128099190613b05565b156128175750600019919050565b506040805160808101909152605081526000908190815b84518110156129f85761284285838361327a565b801561286257612852828461330f565b6128625750600119949350505050565b600061286d8361273c565b905061287883611dcd565b9350806129bc8560008190506008817eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff16901b600882901c7eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff161790506010817dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff16901b601082901c7dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff161790506020817bffffffff00000000ffffffff00000000ffffffff00000000ffffffff16901b602082901c7bffffffff00000000ffffffff00000000ffffffff00000000ffffffff1617905060408177ffffffffffffffff0000000000000000ffffffffffffffff16901b604082901c77ffffffffffffffff0000000000000000ffffffffffffffff16179050608081901b608082901c179050919050565b11156129cf575060021995945050505050565b6129e26129db826127d1565b8690613338565b94506129f190506050826138ee565b905061282e565b505050919050565b6060600080612a0e85612287565b9092509050600019821415612a8b5760405162461bcd60e51b815260206004820152602260248201527f52656164206f76657272756e20647572696e6720566172496e7420706172736960448201527f6e670000000000000000000000000000000000000000000000000000000000006064820152608401610138565b808410612ada5760405162461bcd60e51b815260206004820152601060248201527f56696e2072656164206f76657272756e000000000000000000000000000000006044820152606401610138565b600080612ae88460016138ee565b905060005b86811015612b7157612aff88836125e3565b9250600019831415612b535760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612b5d83836138ee565b915080612b6981613a92565b915050612aed565b50612b7c87826125e3565b9150600019821415612bd05760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612bdb878284611b98565b979650505050505050565b6020810151600090611c74565b6000611c74826020611c62565b6000806000612c0f8585613396565b905060ff8116612c41576000858581518110612c2d57612c2d6139b1565b016020015190935060f81c9150612d779050565b83612c4d8260016139c7565b60ff16612c5a91906138ee565b85511015612c715760001960009250925050612d77565b60008160ff1660021415612cb657612cab612c97612c908760016138ee565b8890611c62565b62ffff0060e882901c1660f89190911c1790565b61ffff169050612d6d565b8160ff1660041415612ce057612cd3612258612c908760016138ee565b63ffffffff169050612d6d565b8160ff1660081415612d6d57612d60612cfd612c908760016138ee565b60c01c64ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b67ffffffffffffffff1690505b60ff909116925090505b9250929050565b600080612d8a83613422565b60c01c9050600061127c8264ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b60008060008585604051602001612e0d929190613c09565b60408051808303601f1901815291815281516020928301206000818152600e8b01909352912060010154909150600160801b900463ffffffff1615612fca576000818152600e88016020526040812060018101548154919291612e849167ffffffffffffffff90811691600160a01b9004166137c5565b600183015490915067ffffffffffffffff80881691612eb1916801000000000000000090910416836137c5565b67ffffffffffffffff1611158015612edd57508067ffffffffffffffff168667ffffffffffffffff1611155b612f755760405162461bcd60e51b815260206004820152604660248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652070656e64696e67207260648201527f6571756573740000000000000000000000000000000000000000000000000000608482015260a401610138565b6001918201546000848152600e8b016020526040902080546001600160e01b0319168155909201805473ffffffffffffffffffffffffffffffffffffffff19169055935067ffffffffffffffff16915061317a565b6000818152600f8801602052604090206001810154600160801b900463ffffffff1661305d5760405162461bcd60e51b8152602060048201526024808201527f4f75747075742069732061206e6f6e2d72657175657374656420726564656d7060448201527f74696f6e000000000000000000000000000000000000000000000000000000006064820152608401610138565b600181015481546000916130869167ffffffffffffffff91821691600160a01b909104166137c5565b600183015490915067ffffffffffffffff808816916130b3916801000000000000000090910416836137c5565b67ffffffffffffffff16111580156130df57508067ffffffffffffffff168667ffffffffffffffff1611155b6131775760405162461bcd60e51b815260206004820152604860248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652074696d6564206f757460648201527f2072657175657374000000000000000000000000000000000000000000000000608482015260a401610138565b50505b5094509492505050565b6001600160601b03198116600081815260198401602052604080822060028101805463ffffffff4216600160801b027fffffffffffffffffffffff0000000000ffffffffffffffffffffffffffffffff9091161774030000000000000000000000000000000000000000179055805491519093927f68cb496f5e64383745876664ef119840f154a729c03ba866b8aecb5c9f53d51691a3505050565b60008061322e8360256138ee565b84511015613243575060001990506000612d77565b6000806132558661265e8760246138ee565b9097909650945050505050565b6000611c71838361342e565b6000611c718284613c60565b8151600061328882846138ee565b9050828111801561329a575080855110155b6132e65760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b826020860101602085018382015b808310156121a25782518252602092830192909101906132f4565b60008061331b8461345c565b905082811461332e576000915050611c74565b5060019392505050565b600061334482846138ee565b905082811015611c745760405162461bcd60e51b815260206004820152601960248201527f4f766572666c6f7720647572696e67206164646974696f6e2e000000000000006044820152606401610138565b60008282815181106133aa576133aa6139b1565b60209101015160f81c60ff14156133c357506008611c74565b8282815181106133d5576133d56139b1565b60209101015160f81c60fe14156133ee57506004611c74565b828281518110613400576134006139b1565b60209101015160f81c60fd141561341957506002611c74565b50600092915050565b6000611c748282611c62565b60008260005281602052602060006040600060025afa50602060006020600060025afa505060005192915050565b6024810151600090611c74565b80356001600160601b03198116811461348157600080fd5b919050565b60006060828403121561349857600080fd5b50919050565b60008083601f8401126134b057600080fd5b50813567ffffffffffffffff8111156134c857600080fd5b602083019150836020828501011115612d7757600080fd5b803567ffffffffffffffff8116811461348157600080fd5b60008060008060008060e0878903121561351157600080fd5b8635955061352160208801613469565b94506135308860408901613486565b935060a087013567ffffffffffffffff81111561354c57600080fd5b61355889828a0161349e565b909450925061356b905060c088016134e0565b90509295509295509295565b600080600080600060e0868803121561358f57600080fd5b85359450602086013567ffffffffffffffff808211156135ae57600080fd5b908701906080828a0312156135c257600080fd5b909450604087013590808211156135d857600080fd5b506135e588828901613486565b9350506135f58760608801613486565b915061360360c08701613469565b90509295509295909350565b6000806000806000806080878903121561362857600080fd5b8635955061363860208801613469565b9450604087013567ffffffffffffffff8082111561365557600080fd5b818901915089601f83011261366957600080fd5b81358181111561367857600080fd5b8a60208260051b850101111561368d57600080fd5b6020830196508095505060608901359150808211156136ab57600080fd5b506136b889828a0161349e565b979a9699509497509295939492505050565b634e487b7160e01b600052602160045260246000fd5b803563ffffffff8116811461348157600080fd5b60006020828403121561370657600080fd5b611c71826136e0565b60006020828403121561372157600080fd5b611c71826134e0565b6001600160c01b031984168152818360088301376000910160080190815292915050565b6001600160601b031984168152818360148301376000910160140190815292915050565b634e487b7160e01b600052601260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b600067ffffffffffffffff808416806137b9576137b9613772565b92169190910492915050565b600067ffffffffffffffff838116908316818110156137e6576137e6613788565b039392505050565b600067ffffffffffffffff80831681851680830382111561381157613811613788565b01949350505050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b6bffffffffffffffffffffffff198816815260c06020820152600061386c60c08301888a61381a565b6001600160a01b039690961660408301525067ffffffffffffffff9384166060820152918316608083015290911660a0909101529392505050565b6000808335601e198436030181126138be57600080fd5b83018035915067ffffffffffffffff8211156138d957600080fd5b602001915036819003821315612d7757600080fd5b6000821982111561390157613901613788565b500190565b600060a082016bffffffffffffffffffffffff89168352602088818501526001600160a01b038816604085015286606085015260a060808501528185835260c08501905086925060005b868110156139795763ffffffff613966856136e0565b1682529282019290820190600101613950565b509a9950505050505050505050565b6bffffffffffffffffffffffff1984168152604060208201526000611e3460408301848661381a565b634e487b7160e01b600052603260045260246000fd5b600060ff821660ff84168060ff038211156139e4576139e4613788565b019392505050565b600060ff821660ff841680821015613a0657613a06613788565b90039392505050565b600082821015613a2157613a21613788565b500390565b600060208284031215613a3857600080fd5b81356001600160e01b03198116811461170b57600080fd5b60006001600160e01b03198089168352868860048501378683016004810160008152868882375093169390920160048101939093525050600801949350505050565b6000600019821415613aa657613aa6613788565b5060010190565b600060208284031215613abf57600080fd5b5051919050565b6000816000190483118215151615613ae057613ae0613788565b500290565b600063ffffffff821680613afb57613afb613788565b6000190192915050565b600082613b1457613b14613772565b500690565b600181815b80851115613b54578160001904821115613b3a57613b3a613788565b80851615613b4757918102915b93841c9390800290613b1e565b509250929050565b600082613b6b57506001611c74565b81613b7857506000611c74565b8160018114613b8e5760028114613b9857613bb4565b6001915050611c74565b60ff841115613ba957613ba9613788565b50506001821b611c74565b5060208310610133831016604e8410600b8410161715613bd7575081810a611c74565b613be18383613b19565b8060001904821115613bf557613bf5613788565b029392505050565b6000611c718383613b5c565b6bffffffffffffffffffffffff19831681526000825160005b81811015613c3f5760208186018101516014868401015201613c22565b81811115613c51576000601483860101525b50919091016014019392505050565b600082613c6f57613c6f613772565b50049056fea264697066735822122045e46e6276df23e3759cd97107ec469d3cc68a078a31b7cd86f673828fccf14f64736f6c63430008090033",
-  "deployedBytecode": "0x730000000000000000000000000000000000000000301460806040526004361061004b5760003560e01c80637333b36914610050578063a164de6e14610072578063a76558b314610092575b600080fd5b81801561005c57600080fd5b5061007061006b3660046134f8565b6100b2565b005b81801561007e57600080fd5b5061007061008d366004613577565b61086a565b81801561009e57600080fd5b506100706100ad36600461360f565b610c09565b6001600160601b031985166000908152601987016020526040902060016002820154600160a01b900460ff1660058111156100ef576100ef6136ca565b146101415760405162461bcd60e51b815260206004820152601c60248201527f57616c6c6574206d75737420626520696e204c6976652073746174650000000060448201526064015b60405180910390fd5b60018101548061019d5760405162461bcd60e51b815260206004820152602160248201527f4e6f206d61696e205554584f20666f722074686520676976656e2077616c6c656044820152601d60fa1b6064820152608401610138565b8086356101b06040890160208a016136f4565b6101c060608a0160408b0161370f565b6040516020016101fd9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60405160208183030381529060405280519060200120146102605760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b6000610292600060c01b878760405160200161027e9392919061372a565b60405160208183030381529060405261117c565b9050600081511161030b5760405162461bcd60e51b815260206004820152602e60248201527f52656465656d6572206f757470757420736372697074206d757374206265206160448201527f207374616e6461726420747970650000000000000000000000000000000000006064820152608401610138565b80805190602001208860405160200161033491906001600160601b031991909116815260140190565b6040516020818303038152906040528051906020012014156103be5760405162461bcd60e51b815260206004820152603760248201527f52656465656d6572206f757470757420736372697074206d757374206e6f742060448201527f706f696e7420746f207468652077616c6c657420504b480000000000000000006064820152608401610138565b600a89015467ffffffffffffffff680100000000000000009091048116908516101561042c5760405162461bcd60e51b815260206004820152601b60248201527f526564656d7074696f6e20616d6f756e7420746f6f20736d616c6c00000000006044820152606401610138565b60008887876040516020016104439392919061374e565b60408051808303601f1901815291815281516020928301206000818152600e8e01909352912060010154909150600160801b900463ffffffff16156105165760405162461bcd60e51b815260206004820152604a60248201527f546865726520697320612070656e64696e6720726564656d7074696f6e20726560448201527f71756573742066726f6d20746869732077616c6c657420746f2074686520736160648201527f6d65206164647265737300000000000000000000000000000000000000000000608482015260a401610138565b600a8a0154600090600160801b900467ffffffffffffffff1661053a57600061055a565b600a8b015461055a90600160801b900467ffffffffffffffff168761379e565b600a8c01549091507801000000000000000000000000000000000000000000000000900467ffffffffffffffff1661059282886137c5565b6002870180546000906105b090849067ffffffffffffffff166137ee565b82546101009290920a67ffffffffffffffff81810219909316918316021790915560028801541690506105e960608c0160408d0161370f565b67ffffffffffffffff1610156106415760405162461bcd60e51b815260206004820152601960248201527f496e73756666696369656e742077616c6c65742066756e6473000000000000006044820152606401610138565b6040518060a00160405280336001600160a01b031681526020018867ffffffffffffffff1681526020018367ffffffffffffffff1681526020018267ffffffffffffffff1681526020014263ffffffff168152508c600e01600085815260200190815260200160002060008201518160000160006101000a8154816001600160a01b0302191690836001600160a01b0316021790555060208201518160000160146101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060408201518160010160006101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060608201518160010160086101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060808201518160010160106101000a81548163ffffffff021916908363ffffffff1602179055509050507f97a0199072f487232635d50ab75860891afe0b91c976ed2fc76502c4d82d0d958b8a8a338b87876040516107c99796959493929190613843565b60405180910390a18b546040517f7c6db49c00000000000000000000000000000000000000000000000000000000815233600482015230602482015267ffffffffffffffff891660448201526001600160a01b0390911690637c6db49c90606401600060405180830381600087803b15801561084457600080fd5b505af1158015610858573d6000803e3d6000fd5b50505050505050505050505050505050565b6000610877868686611422565b90506108c88661088a60208801886138a7565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508892508791506117129050565b6001600160601b03198216600090815260198701602052604090206002810154600160a01b900460ff166001816005811115610906576109066136ca565b148061092357506002816005811115610921576109216136ca565b145b6109955760405162461bcd60e51b815260206004820152602b60248201527f57616c6c6574206d75737420626520696e204c697665206f72204d6f76696e6760448201527f46756e64732073746174650000000000000000000000000000000000000000006064820152608401610138565b60006109e4896109a860408b018b6138a7565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508a925061196c915050565b606081015190915067ffffffffffffffff1615610a65578381604001518260600151604051602001610a439392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60408051601f1981840301815291905280516020909101206001840155610a6d565b600060018401555b8051600284018054600090610a8d90849067ffffffffffffffff166137c5565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff1602179055507fa45596c10f758d32ec8cca64a0fbfe776052b08fdb3f026e0a87f52118bf8fbe8585604051610af99291906001600160601b0319929092168252602082015260400190565b60405180910390a1885481516040517f392aee4300000000000000000000000000000000000000000000000000000000815267ffffffffffffffff90911660048201526001600160a01b039091169063392aee4390602401600060405180830381600087803b158015610b6b57600080fd5b505af1158015610b7f573d6000803e3d6000fd5b50508a546004808d015460208601516040516356a6d9ef60e01b81526001600160a01b039283169381019390935267ffffffffffffffff16602483015290911692506356a6d9ef91506044015b600060405180830381600087803b158015610be657600080fd5b505af1158015610bfa573d6000803e3d6000fd5b50505050505050505050505050565b6000858383604051602001610c209392919061374e565b60408051808303601f1901815282825280516020918201206000818152600e8c01835283902060a08501845280546001600160a01b0381168652600160a01b900467ffffffffffffffff9081169386019390935260010154808316938501939093526801000000000000000083049091166060840152600160801b90910463ffffffff1660808301819052909250610d045760405162461bcd60e51b815260206004820152602160248201527f526564656d7074696f6e207265717565737420646f6573206e6f7420657869736044820152601d60fa1b6064820152608401610138565b4288600b0154826080015163ffffffff16610d1f91906138ee565b10610d915760405162461bcd60e51b8152602060048201526024808201527f526564656d7074696f6e207265717565737420686173206e6f742074696d656460448201527f206f7574000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001600160601b0319871660009081526019890160209081526040918290209183015190830151610dc291906137c5565b600282018054600090610de090849067ffffffffffffffff166137c5565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060016005811115610e1957610e196136ca565b6002820154600160a01b900460ff166005811115610e3957610e396136ca565b1480610e635750600280820154600160a01b900460ff166005811115610e6157610e616136ca565b145b80610e8d575060056002820154600160a01b900460ff166005811115610e8b57610e8b6136ca565b145b610eff5760405162461bcd60e51b815260206004820152603b60248201527f5468652077616c6c6574206d75737420626520696e204c6976652c204d6f766960448201527f6e6746756e6473206f72205465726d696e6174656420737461746500000000006064820152608401610138565b6000838152600f8a016020908152604080832085518154878501516001600160a01b039092166001600160e01b031991821617600160a01b67ffffffffffffffff93841602178355878401516001938401805460608b015160808c01519386167fffffffffffffffffffffffffffffffff0000000000000000000000000000000090921691909117680100000000000000009190951602939093177fffffffffffffffffffffffff00000000ffffffffffffffffffffffffffffffff16600160801b63ffffffff9092169190910217909155600e8e019093529220805490911681558101805473ffffffffffffffffffffffffffffffffffffffff191690556002820154600160a01b900460ff16600581111561101e5761101e6136ca565b14806110485750600280820154600160a01b900460ff166005811115611046576110466136ca565b145b156110f9576110578989611aa3565b6002890154600c8a0154600d8b015483546040517fd8dc404d0000000000000000000000000000000000000000000000000000000081526001600160a01b039094169363d8dc404d936110c6936bffffffffffffffffffffffff9091169290913391908e908e90600401613906565b600060405180830381600087803b1580156110e057600080fd5b505af11580156110f4573d6000803e3d6000fd5b505050505b7f013dddc8debc4730cd01232fdcea9ae6013689837732356c187fe5edb9a8a8d588868660405161112c93929190613988565b60405180910390a18854825160208401516040516356a6d9ef60e01b81526001600160a01b03928316600482015267ffffffffffffffff90911660248201529116906356a6d9ef90604401610bcc565b6060600082600881518110611193576111936139b1565b0160200151835160f89190911c91506111ad8260096139c7565b60ff16146111cb575050604080516020810190915260008152919050565b826009815181106111de576111de6139b1565b016020015160f81c6112845760028160ff16101561120c575050604080516020810190915260008152919050565b600083600a81518110611221576112216139b1565b016020015160f81c90506112366002836139ec565b60ff1681141580611254575080602014158015611254575080601414155b1561127057505060408051602081019091526000815292915050565b61127c84600b83611b98565b949350505050565b6000611291846008611c62565b90507f1976a900000000000000000000000000000000000000000000000000000000007fffffff00000000000000000000000000000000000000000000000000000000008216141561136e5783600b815181106112f0576112f06139b1565b60209101015160f81c6014141580611345575061131b600285516113149190613a0f565b8590611c62565b7dffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191661222b60f21b14155b1561136157505060408051602081019091526000815292915050565b61127c84600c6014611b98565b7f17a91400000000000000000000000000000000000000000000000000000000007fffffff00000000000000000000000000000000000000000000000000000000008216141561140b5783600185516113c79190613a0f565b815181106113d7576113d76139b1565b60209101015160f81c6087146113fe57505060408051602081019091526000815292915050565b61127c84600b6014611b98565b505050604080516020810190915260008152919050565b600061146e61143460208501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611c7a92505050565b6114ba5760405162461bcd60e51b815260206004820152601d60248201527f496e76616c696420696e70757420766563746f722070726f76696465640000006044820152606401610138565b6115046114ca60408501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611d2a92505050565b6115505760405162461bcd60e51b815260206004820152601e60248201527f496e76616c6964206f757470757420766563746f722070726f766964656400006044820152606401610138565b6115b36115606020850185613a26565b61156d60208601866138a7565b61157a60408801886138a7565b61158a60808a0160608b01613a26565b60405160200161159f96959493929190613a50565b604051602081830303815290604052611dcd565b905061164e6116026115c860408501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611df492505050565b61160c84806138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250869493925050506020860135611e01565b6116c05760405162461bcd60e51b815260206004820152603c60248201527f5478206d65726b6c652070726f6f66206973206e6f742076616c696420666f7260448201527f2070726f76696465642068656164657220616e642074782068617368000000006064820152608401610138565b61170b846116d160408501856138a7565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611e3d92505050565b9392505050565b6001600160601b0319811660009081526019850160205260409020600101548061177e5760405162461bcd60e51b815260206004820152601d60248201527f4e6f206d61696e205554584f20666f7220676976656e2077616c6c65740000006044820152606401610138565b80833561179160408601602087016136f4565b6117a1606087016040880161370f565b6040516020016117de9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60405160208183030381529060405280519060200120146118415760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b60008061184d866121ac565b909250905084358214801561187c575063ffffffff811661187460408701602088016136f4565b63ffffffff16145b6118ee5760405162461bcd60e51b815260206004820152603f60248201527f4f7574626f756e64207472616e73616374696f6e20696e707574206d7573742060448201527f706f696e7420746f207468652077616c6c65742773206d61696e205554584f006064820152608401610138565b6001601588016000873561190860408a0160208b016136f4565b60405160200161192f92919091825260e01b6001600160e01b031916602082015260240190565b60408051808303601f19018152918152815160209283012083529082019290925201600020805460ff191691151591909117905550505050505050565b6040805160808101825260008082526020820181905291810182905260608101829052908061199a85612287565b909250905060006119ac8360016138ee565b6040517f1976a9140000000000000000000000000000000000000000000000000000000060208201526001600160601b03198716602482015261222b60f21b6038820152909150600090603a0160408051601f198184030181529082905280516020918201207f1600140000000000000000000000000000000000000000000000000000000000918301919091526001600160601b0319881660238301529150600090603701604051602081830303815290604052805190602001209050611a9689898960405180608001604052808881526020018981526020018781526020018681525061229e565b9998505050505050505050565b6001600160601b031981166000908152601983016020526040902060020154600160a01b900460ff166001816005811115611ae057611ae06136ca565b1480611afd57506002816005811115611afb57611afb6136ca565b145b611b6f5760405162461bcd60e51b815260206004820152603160248201527f45434453412077616c6c6574206d75737420626520696e204c697665206f722060448201527f4d6f76696e6746756e64732073746174650000000000000000000000000000006064820152608401610138565b6001816005811115611b8357611b836136ca565b1415611b9357611b93838361249d565b505050565b606081611bb4575060408051602081019091526000815261170b565b6000611bc083856138ee565b90508381118015611bd2575080855110155b611c1e5760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b604051915082604083010160405282825283850182038460208701018481015b80821015611c5757815183830152602082019150611c3e565b505050509392505050565b6000611c718383016020015190565b90505b92915050565b6000806000611c8884612287565b9092509050801580611c9b575060001982145b15611caa575060009392505050565b6000611cb78360016138ee565b905060005b82811015611d1d5785518210611cd85750600095945050505050565b6000611ce487846125e3565b9050600019811415611cfd575060009695505050505050565b611d0781846138ee565b9250508080611d1590613a92565b915050611cbc565b5093519093149392505050565b6000806000611d3884612287565b9092509050801580611d4b575060001982145b15611d5a575060009392505050565b6000611d678360016138ee565b905060005b82811015611d1d5785518210611d885750600095945050505050565b6000611d94878461262e565b9050600019811415611dad575060009695505050505050565b611db781846138ee565b9250508080611dc590613a92565b915050611d6c565b60006020600083516020850160025afa50602060006020600060025afa5050600051919050565b6044810151600090611c74565b60008385148015611e10575081155b8015611e1b57508251155b15611e285750600161127c565b611e3485848685612694565b95945050505050565b6001820154604080517f113764be00000000000000000000000000000000000000000000000000000000815290516001600160a01b0390921691600091839163113764be91600480820192602092909190829003018186803b158015611ea257600080fd5b505afa158015611eb6573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611eda9190613aad565b90506000826001600160a01b0316632b97be246040518163ffffffff1660e01b815260040160206040518083038186803b158015611f1757600080fd5b505afa158015611f2b573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611f4f9190613aad565b9050600080611f65611f608761273c565b6127d1565b905083811415611f7757839150611ff5565b82811415611f8757829150611ff5565b60405162461bcd60e51b815260206004820152602560248201527f4e6f742061742063757272656e74206f722070726576696f757320646966666960448201527f63756c74790000000000000000000000000000000000000000000000000000006064820152608401610138565b6000612000876127f9565b905060001981141561207a5760405162461bcd60e51b815260206004820152602360248201527f496e76616c6964206c656e677468206f6620746865206865616465727320636860448201527f61696e00000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001198114156120cc5760405162461bcd60e51b815260206004820152601560248201527f496e76616c6964206865616465727320636861696e00000000000000000000006044820152606401610138565b60021981141561211e5760405162461bcd60e51b815260206004820152601d60248201527f496e73756666696369656e7420776f726b20696e2061206865616465720000006044820152606401610138565b600388015461212d9084613ac6565b8110156121a25760405162461bcd60e51b815260206004820152603360248201527f496e73756666696369656e7420616363756d756c61746564206469666669637560448201527f6c747920696e2068656164657220636861696e000000000000000000000000006064820152608401610138565b5050505050505050565b60008060006121ba84612287565b915050806001146122335760405162461bcd60e51b815260206004820152602d60248201527f4f7574626f756e64207472616e73616374696f6e206d7573742068617665206160448201527f2073696e676c6520696e707574000000000000000000000000000000000000006064820152608401610138565b600061223f8582612a00565b905061224a81612be6565b935061227e61225882612bf3565b60d881901c63ff00ff001662ff00ff60e89290921c9190911617601081811b91901c1790565b92505050915091565b600080612295836000612c00565b91509150915091565b604080516080810182526000808252602082018190529181018290526060810182905290805b83602001518110156124205783516000906122e090889061262e565b85519091506000906122f490899084611b98565b9050600061230182612d7e565b9050600061231f60088085516123179190613a0f565b859190611b98565b9050866060015167ffffffffffffffff16600014801561235b5750604088015181516020830120148061235b5750606088015181516020830120145b8015612371575060008267ffffffffffffffff16115b156123975763ffffffff8516604088015267ffffffffffffffff821660608801526123f1565b6000806123a68d8c8587612df5565b9150915081896000018181516123bc91906137ee565b67ffffffffffffffff169052506020890180518291906123dd9083906137ee565b67ffffffffffffffff169052506001975050505b838860000181815161240391906138ee565b9052508493506124189250839150613a929050565b9150506122c4565b50806124945760405162461bcd60e51b815260206004820152603b60248201527f526564656d7074696f6e207472616e73616374696f6e206d7573742070726f6360448201527f657373206174206c65617374206f6e6520726564656d7074696f6e00000000006064820152608401610138565b50949350505050565b6001600160601b031981166000908152601983016020526040902060018101546124d0576124cb8383613184565b612563565b60028101805463ffffffff42166c01000000000000000000000000027fffffffffffffffffffffff00ffffffff00000000ffffffffffffffffffffffff909116177402000000000000000000000000000000000000000017905580546040516001600160601b0319841691907fbdc9ce990a067e5fd3a5d8dfc68e27e9f221aaa3fe55265e0b7e93c460b3efe290600090a35b601783015460601b6001600160601b031990811690831614156125a05760178301805473ffffffffffffffffffffffffffffffffffffffff191690555b601783018054600160a01b900463ffffffff169060146125bf83613ae5565b91906101000a81548163ffffffff021916908363ffffffff16021790555050505050565b60008060006125f28585613220565b909250905060001982141561260d5760001992505050611c74565b806126198360256138ee565b61262391906138ee565b611e349060046138ee565b600061263b8260096138ee565b8351101561264c5750600019611c74565b6000806126638561265e8660086138ee565b612c00565b909250905060001982141561267e5760001992505050611c74565b8061268a8360096138ee565b611e3491906138ee565b6000602084516126a49190613b05565b156126b15750600061127c565b83516126bf5750600061127c565b818560005b865181101561272f576126d8600284613b05565b600114156126fd576126f66126f08883016020015190565b83613262565b9150612716565b6127138261270e8984016020015190565b613262565b91505b60019290921c916127286020826138ee565b90506126c4565b5090931495945050505050565b60008061274a836048611c62565b60e81c9050600083604b81518110612764576127646139b1565b016020015160f81c9050600061279883600060108262ffffff16901c8261ff001660108462ffffff16901b17179050919050565b62ffffff16905060006127ac6003846139ec565b60ff1690506127bd81610100613bfd565b6127c79083613ac6565b9695505050505050565b6000611c747bffff00000000000000000000000000000000000000000000000000008361326e565b6000605082516128099190613b05565b156128175750600019919050565b506040805160808101909152605081526000908190815b84518110156129f85761284285838361327a565b801561286257612852828461330f565b6128625750600119949350505050565b600061286d8361273c565b905061287883611dcd565b9350806129bc8560008190506008817eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff16901b600882901c7eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff161790506010817dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff16901b601082901c7dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff161790506020817bffffffff00000000ffffffff00000000ffffffff00000000ffffffff16901b602082901c7bffffffff00000000ffffffff00000000ffffffff00000000ffffffff1617905060408177ffffffffffffffff0000000000000000ffffffffffffffff16901b604082901c77ffffffffffffffff0000000000000000ffffffffffffffff16179050608081901b608082901c179050919050565b11156129cf575060021995945050505050565b6129e26129db826127d1565b8690613338565b94506129f190506050826138ee565b905061282e565b505050919050565b6060600080612a0e85612287565b9092509050600019821415612a8b5760405162461bcd60e51b815260206004820152602260248201527f52656164206f76657272756e20647572696e6720566172496e7420706172736960448201527f6e670000000000000000000000000000000000000000000000000000000000006064820152608401610138565b808410612ada5760405162461bcd60e51b815260206004820152601060248201527f56696e2072656164206f76657272756e000000000000000000000000000000006044820152606401610138565b600080612ae88460016138ee565b905060005b86811015612b7157612aff88836125e3565b9250600019831415612b535760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612b5d83836138ee565b915080612b6981613a92565b915050612aed565b50612b7c87826125e3565b9150600019821415612bd05760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612bdb878284611b98565b979650505050505050565b6020810151600090611c74565b6000611c74826020611c62565b6000806000612c0f8585613396565b905060ff8116612c41576000858581518110612c2d57612c2d6139b1565b016020015190935060f81c9150612d779050565b83612c4d8260016139c7565b60ff16612c5a91906138ee565b85511015612c715760001960009250925050612d77565b60008160ff1660021415612cb657612cab612c97612c908760016138ee565b8890611c62565b62ffff0060e882901c1660f89190911c1790565b61ffff169050612d6d565b8160ff1660041415612ce057612cd3612258612c908760016138ee565b63ffffffff169050612d6d565b8160ff1660081415612d6d57612d60612cfd612c908760016138ee565b60c01c64ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b67ffffffffffffffff1690505b60ff909116925090505b9250929050565b600080612d8a83613422565b60c01c9050600061127c8264ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b60008060008585604051602001612e0d929190613c09565b60408051808303601f1901815291815281516020928301206000818152600e8b01909352912060010154909150600160801b900463ffffffff1615612fca576000818152600e88016020526040812060018101548154919291612e849167ffffffffffffffff90811691600160a01b9004166137c5565b600183015490915067ffffffffffffffff80881691612eb1916801000000000000000090910416836137c5565b67ffffffffffffffff1611158015612edd57508067ffffffffffffffff168667ffffffffffffffff1611155b612f755760405162461bcd60e51b815260206004820152604660248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652070656e64696e67207260648201527f6571756573740000000000000000000000000000000000000000000000000000608482015260a401610138565b6001918201546000848152600e8b016020526040902080546001600160e01b0319168155909201805473ffffffffffffffffffffffffffffffffffffffff19169055935067ffffffffffffffff16915061317a565b6000818152600f8801602052604090206001810154600160801b900463ffffffff1661305d5760405162461bcd60e51b8152602060048201526024808201527f4f75747075742069732061206e6f6e2d72657175657374656420726564656d7060448201527f74696f6e000000000000000000000000000000000000000000000000000000006064820152608401610138565b600181015481546000916130869167ffffffffffffffff91821691600160a01b909104166137c5565b600183015490915067ffffffffffffffff808816916130b3916801000000000000000090910416836137c5565b67ffffffffffffffff16111580156130df57508067ffffffffffffffff168667ffffffffffffffff1611155b6131775760405162461bcd60e51b815260206004820152604860248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652074696d6564206f757460648201527f2072657175657374000000000000000000000000000000000000000000000000608482015260a401610138565b50505b5094509492505050565b6001600160601b03198116600081815260198401602052604080822060028101805463ffffffff4216600160801b027fffffffffffffffffffffff0000000000ffffffffffffffffffffffffffffffff9091161774030000000000000000000000000000000000000000179055805491519093927f68cb496f5e64383745876664ef119840f154a729c03ba866b8aecb5c9f53d51691a3505050565b60008061322e8360256138ee565b84511015613243575060001990506000612d77565b6000806132558661265e8760246138ee565b9097909650945050505050565b6000611c71838361342e565b6000611c718284613c60565b8151600061328882846138ee565b9050828111801561329a575080855110155b6132e65760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b826020860101602085018382015b808310156121a25782518252602092830192909101906132f4565b60008061331b8461345c565b905082811461332e576000915050611c74565b5060019392505050565b600061334482846138ee565b905082811015611c745760405162461bcd60e51b815260206004820152601960248201527f4f766572666c6f7720647572696e67206164646974696f6e2e000000000000006044820152606401610138565b60008282815181106133aa576133aa6139b1565b60209101015160f81c60ff14156133c357506008611c74565b8282815181106133d5576133d56139b1565b60209101015160f81c60fe14156133ee57506004611c74565b828281518110613400576134006139b1565b60209101015160f81c60fd141561341957506002611c74565b50600092915050565b6000611c748282611c62565b60008260005281602052602060006040600060025afa50602060006020600060025afa505060005192915050565b6024810151600090611c74565b80356001600160601b03198116811461348157600080fd5b919050565b60006060828403121561349857600080fd5b50919050565b60008083601f8401126134b057600080fd5b50813567ffffffffffffffff8111156134c857600080fd5b602083019150836020828501011115612d7757600080fd5b803567ffffffffffffffff8116811461348157600080fd5b60008060008060008060e0878903121561351157600080fd5b8635955061352160208801613469565b94506135308860408901613486565b935060a087013567ffffffffffffffff81111561354c57600080fd5b61355889828a0161349e565b909450925061356b905060c088016134e0565b90509295509295509295565b600080600080600060e0868803121561358f57600080fd5b85359450602086013567ffffffffffffffff808211156135ae57600080fd5b908701906080828a0312156135c257600080fd5b909450604087013590808211156135d857600080fd5b506135e588828901613486565b9350506135f58760608801613486565b915061360360c08701613469565b90509295509295909350565b6000806000806000806080878903121561362857600080fd5b8635955061363860208801613469565b9450604087013567ffffffffffffffff8082111561365557600080fd5b818901915089601f83011261366957600080fd5b81358181111561367857600080fd5b8a60208260051b850101111561368d57600080fd5b6020830196508095505060608901359150808211156136ab57600080fd5b506136b889828a0161349e565b979a9699509497509295939492505050565b634e487b7160e01b600052602160045260246000fd5b803563ffffffff8116811461348157600080fd5b60006020828403121561370657600080fd5b611c71826136e0565b60006020828403121561372157600080fd5b611c71826134e0565b6001600160c01b031984168152818360088301376000910160080190815292915050565b6001600160601b031984168152818360148301376000910160140190815292915050565b634e487b7160e01b600052601260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b600067ffffffffffffffff808416806137b9576137b9613772565b92169190910492915050565b600067ffffffffffffffff838116908316818110156137e6576137e6613788565b039392505050565b600067ffffffffffffffff80831681851680830382111561381157613811613788565b01949350505050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b6bffffffffffffffffffffffff198816815260c06020820152600061386c60c08301888a61381a565b6001600160a01b039690961660408301525067ffffffffffffffff9384166060820152918316608083015290911660a0909101529392505050565b6000808335601e198436030181126138be57600080fd5b83018035915067ffffffffffffffff8211156138d957600080fd5b602001915036819003821315612d7757600080fd5b6000821982111561390157613901613788565b500190565b600060a082016bffffffffffffffffffffffff89168352602088818501526001600160a01b038816604085015286606085015260a060808501528185835260c08501905086925060005b868110156139795763ffffffff613966856136e0565b1682529282019290820190600101613950565b509a9950505050505050505050565b6bffffffffffffffffffffffff1984168152604060208201526000611e3460408301848661381a565b634e487b7160e01b600052603260045260246000fd5b600060ff821660ff84168060ff038211156139e4576139e4613788565b019392505050565b600060ff821660ff841680821015613a0657613a06613788565b90039392505050565b600082821015613a2157613a21613788565b500390565b600060208284031215613a3857600080fd5b81356001600160e01b03198116811461170b57600080fd5b60006001600160e01b03198089168352868860048501378683016004810160008152868882375093169390920160048101939093525050600801949350505050565b6000600019821415613aa657613aa6613788565b5060010190565b600060208284031215613abf57600080fd5b5051919050565b6000816000190483118215151615613ae057613ae0613788565b500290565b600063ffffffff821680613afb57613afb613788565b6000190192915050565b600082613b1457613b14613772565b500690565b600181815b80851115613b54578160001904821115613b3a57613b3a613788565b80851615613b4757918102915b93841c9390800290613b1e565b509250929050565b600082613b6b57506001611c74565b81613b7857506000611c74565b8160018114613b8e5760028114613b9857613bb4565b6001915050611c74565b60ff841115613ba957613ba9613788565b50506001821b611c74565b5060208310610133831016604e8410600b8410161715613bd7575081810a611c74565b613be18383613b19565b8060001904821115613bf557613bf5613788565b029392505050565b6000611c718383613b5c565b6bffffffffffffffffffffffff19831681526000825160005b81811015613c3f5760208186018101516014868401015201613c22565b81811115613c51576000601483860101525b50919091016014019392505050565b600082613c6f57613c6f613772565b50049056fea264697066735822122045e46e6276df23e3759cd97107ec469d3cc68a078a31b7cd86f673828fccf14f64736f6c63430008090033",
+  "solcInputHash": "d1140ac40baa1ba6f0d558afe0fa6d54",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.9+commit.e5eed63a\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"bytes20\",\"name\":\"walletPubKeyHash\",\"type\":\"bytes20\"},{\"indexed\":false,\"internalType\":\"bytes\",\"name\":\"redeemerOutputScript\",\"type\":\"bytes\"},{\"indexed\":false,\"internalType\":\"address\",\"name\":\"redeemer\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"requestedAmount\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"treasuryFee\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"txMaxFee\",\"type\":\"uint64\"}],\"name\":\"RedemptionRequested\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"bytes20\",\"name\":\"walletPubKeyHash\",\"type\":\"bytes20\"},{\"indexed\":false,\"internalType\":\"bytes\",\"name\":\"redeemerOutputScript\",\"type\":\"bytes\"}],\"name\":\"RedemptionTimedOut\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"bytes20\",\"name\":\"walletPubKeyHash\",\"type\":\"bytes20\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"redemptionTxHash\",\"type\":\"bytes32\"}],\"name\":\"RedemptionsCompleted\",\"type\":\"event\"}],\"devdoc\":{\"details\":\"To initiate a redemption, a user with a Bank balance supplies      a Bitcoin address. Then, the system calculates the redemption fee, and      releases balance to the provided Bitcoin address. Just like in case of      sweeps of revealed deposits, redemption requests are processed in      batches and require SPV proof to be submitted to the Bridge.\",\"kind\":\"dev\",\"methods\":{\"notifyRedemptionTimeout(BridgeState.Storage storage,bytes20,uint32[],bytes)\":{\"details\":\"Requirements:      - The wallet must be in the Live or MovingFunds or Terminated state      - The redemption request identified by `walletPubKeyHash` and        `redeemerOutputScript` must exist      - The expression `keccak256(abi.encode(walletMembersIDs))` must        be exactly the same as the hash stored under `membersIdsHash`        for the given `walletID`. Those IDs are not directly stored        in the contract for gas efficiency purposes but they can be        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`        events of the `WalletRegistry` contract      - The amount of time defined by `redemptionTimeout` must have        passed since the redemption was requested (the request must be        timed-out)\",\"params\":{\"redeemerOutputScript\":\"The redeemer's length-prefixed output        script (P2PKH, P2WPKH, P2SH or P2WSH)\",\"walletMembersIDs\":\"Identifiers of the wallet signing group members\",\"walletPubKeyHash\":\"20-byte public key hash of the wallet\"}},\"requestRedemption(BridgeState.Storage storage,bytes20,BitcoinTx.UTXO,bytes,uint64)\":{\"details\":\"Requirements:      - Wallet behind `walletPubKeyHash` must be live      - `mainUtxo` components must point to the recent main UTXO        of the given wallet, as currently known on the Ethereum chain.      - `redeemerOutputScript` must be a proper Bitcoin script      - `redeemerOutputScript` cannot have wallet PKH as payload      - `amount` must be above or equal the `redemptionDustThreshold`      - Given `walletPubKeyHash` and `redeemerOutputScript` pair can be        used for only one pending request at the same time      - Wallet must have enough Bitcoin balance to proceed the request      - Redeemer must make an allowance in the Bank that the Bridge        contract can spend the given `amount`.\",\"params\":{\"amount\":\"Requested amount in satoshi. This is also the TBTC amount        that is taken from redeemer's balance in the Bank upon request.        Once the request is handled, the actual amount of BTC locked        on the redeemer output script will be always lower than this value        since the treasury and Bitcoin transaction fees must be incurred.        The minimal amount satisfying the request can be computed as:        `amount - (amount / redemptionTreasuryFeeDivisor) - redemptionTxMaxFee`.        Fees values are taken at the moment of request creation.\",\"mainUtxo\":\"Data of the wallet's main UTXO, as currently known on        the Ethereum chain\",\"redeemerOutputScript\":\"The redeemer's length-prefixed output        script (P2PKH, P2WPKH, P2SH or P2WSH) that will be used to lock        redeemed BTC\",\"walletPubKeyHash\":\"The 20-byte wallet public key hash (computed        using Bitcoin HASH160 over the compressed ECDSA public key)\"}},\"submitRedemptionProof(BridgeState.Storage storage,BitcoinTx.Info,BitcoinTx.Proof,BitcoinTx.UTXO,bytes20)\":{\"details\":\"Requirements:      - `redemptionTx` components must match the expected structure. See        `BitcoinTx.Info` docs for reference. Their values must exactly        correspond to appropriate Bitcoin transaction fields to produce        a provable transaction hash.      - The `redemptionTx` should represent a Bitcoin transaction with        exactly 1 input that refers to the wallet's main UTXO. That        transaction should have 1..n outputs handling existing pending        redemption requests or pointing to reported timed out requests.        There can be also 1 optional output representing the        change and pointing back to the 20-byte wallet public key hash.        The change should be always present if the redeemed value sum        is lower than the total wallet's BTC balance.      - `redemptionProof` components must match the expected structure.        See `BitcoinTx.Proof` docs for reference. The `bitcoinHeaders`        field must contain a valid number of block headers, not less        than the `txProofDifficultyFactor` contract constant.      - `mainUtxo` components must point to the recent main UTXO        of the given wallet, as currently known on the Ethereum chain.        Additionally, the recent main UTXO on Ethereum must be set.      - `walletPubKeyHash` must be connected with the main UTXO used        as transaction single input.      Other remarks:      - Putting the change output as the first transaction output can        save some gas because the output processing loop begins each        iteration by checking whether the given output is the change        thus uses some gas for making the comparison. Once the change        is identified, that check is omitted in further iterations.\",\"params\":{\"mainUtxo\":\"Data of the wallet's main UTXO, as currently known on        the Ethereum chain\",\"redemptionProof\":\"Bitcoin redemption proof data\",\"redemptionTx\":\"Bitcoin redemption transaction data\",\"walletPubKeyHash\":\"20-byte public key hash (computed using Bitcoin        HASH160 over the compressed ECDSA public key) of the wallet which        performed the redemption transaction\"}}},\"title\":\"Bridge redemption\",\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{\"notifyRedemptionTimeout(BridgeState.Storage storage,bytes20,uint32[],bytes)\":{\"notice\":\"Notifies that there is a pending redemption request associated         with the given wallet, that has timed out. The redemption         request is identified by the key built as         `keccak256(walletPubKeyHash | redeemerOutputScript)`.         The results of calling this function:         - the pending redemptions value for the wallet will be decreased           by the requested amount (minus treasury fee),         - the tokens taken from the redeemer on redemption request will           be returned to the redeemer,         - the request will be moved from pending redemptions to           timed-out redemptions,         - if the state of the wallet is `Live` or `MovingFunds`, the           wallet operators will be slashed and the notifier will be           rewarded,         - if the state of wallet is `Live`, the wallet will be closed or           marked as `MovingFunds` (depending on the presence or absence           of the wallet's main UTXO) and the wallet will no longer be           marked as the active wallet (if it was marked as such).\"},\"requestRedemption(BridgeState.Storage storage,bytes20,BitcoinTx.UTXO,bytes,uint64)\":{\"notice\":\"Requests redemption of the given amount from the specified         wallet to the redeemer Bitcoin output script.\"},\"submitRedemptionProof(BridgeState.Storage storage,BitcoinTx.Info,BitcoinTx.Proof,BitcoinTx.UTXO,bytes20)\":{\"notice\":\"Used by the wallet to prove the BTC redemption transaction         and to make the necessary bookkeeping. Redemption is only         accepted if it satisfies SPV proof.         The function is performing Bank balance updates by burning         the total redeemed Bitcoin amount from Bridge balance and         transferring the treasury fee sum to the treasury address.         It is possible to prove the given redemption only one time.\"}},\"notice\":\"The library handles the logic for redeeming Bitcoin balances from         the Bridge.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"contracts/bridge/Redemption.sol\":\"Redemption\"},\"evmVersion\":\"london\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[]},\"sources\":{\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title BitcoinSPV */\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {SafeMath} from \\\"./SafeMath.sol\\\";\\n\\nlibrary BTCUtils {\\n    using BytesLib for bytes;\\n    using SafeMath for uint256;\\n\\n    // The target at minimum Difficulty. Also the target of the genesis block\\n    uint256 public constant DIFF1_TARGET = 0xffff0000000000000000000000000000000000000000000000000000;\\n\\n    uint256 public constant RETARGET_PERIOD = 2 * 7 * 24 * 60 * 60;  // 2 weeks in seconds\\n    uint256 public constant RETARGET_PERIOD_BLOCKS = 2016;  // 2 weeks in blocks\\n\\n    uint256 public constant ERR_BAD_ARG = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;\\n\\n    /* ***** */\\n    /* UTILS */\\n    /* ***** */\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _flag    The first byte of a VarInt\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLength(bytes memory _flag) internal pure returns (uint8) {\\n        return determineVarIntDataLengthAt(_flag, 0);\\n    }\\n\\n    /// @notice         Determines the length of a VarInt in bytes\\n    /// @dev            A VarInt of >1 byte is prefixed with a flag indicating its length\\n    /// @param _b       The byte array containing a VarInt\\n    /// @param _at      The position of the VarInt in the array\\n    /// @return         The number of non-flag bytes in the VarInt\\n    function determineVarIntDataLengthAt(bytes memory _b, uint256 _at) internal pure returns (uint8) {\\n        if (uint8(_b[_at]) == 0xff) {\\n            return 8;  // one-byte flag, 8 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfe) {\\n            return 4;  // one-byte flag, 4 bytes data\\n        }\\n        if (uint8(_b[_at]) == 0xfd) {\\n            return 2;  // one-byte flag, 2 bytes data\\n        }\\n\\n        return 0;  // flag is data\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string starting with a VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarInt(bytes memory _b) internal pure returns (uint256, uint256) {\\n        return parseVarIntAt(_b, 0);\\n    }\\n\\n    /// @notice     Parse a VarInt into its data length and the number it represents\\n    /// @dev        Useful for Parsing Vins and Vouts. Returns ERR_BAD_ARG if insufficient bytes.\\n    ///             Caller SHOULD explicitly handle this case (or bubble it up)\\n    /// @param _b   A byte-string containing a VarInt\\n    /// @param _at  The position of the VarInt\\n    /// @return     number of bytes in the encoding (not counting the tag), the encoded int\\n    function parseVarIntAt(bytes memory _b, uint256 _at) internal pure returns (uint256, uint256) {\\n        uint8 _dataLen = determineVarIntDataLengthAt(_b, _at);\\n\\n        if (_dataLen == 0) {\\n            return (0, uint8(_b[_at]));\\n        }\\n        if (_b.length < 1 + _dataLen + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n        uint256 _number;\\n        if (_dataLen == 2) {\\n            _number = reverseUint16(uint16(_b.slice2(1 + _at)));\\n        } else if (_dataLen == 4) {\\n            _number = reverseUint32(uint32(_b.slice4(1 + _at)));\\n        } else if (_dataLen == 8) {\\n            _number = reverseUint64(uint64(_b.slice8(1 + _at)));\\n        }\\n        return (_dataLen, _number);\\n    }\\n\\n    /// @notice          Changes the endianness of a byte array\\n    /// @dev             Returns a new, backwards, bytes\\n    /// @param _b        The bytes to reverse\\n    /// @return          The reversed bytes\\n    function reverseEndianness(bytes memory _b) internal pure returns (bytes memory) {\\n        bytes memory _newValue = new bytes(_b.length);\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _newValue[_b.length - i - 1] = _b[i];\\n        }\\n\\n        return _newValue;\\n    }\\n\\n    /// @notice          Changes the endianness of a uint256\\n    /// @dev             https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint256(uint256 _b) internal pure returns (uint256 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = ((v >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |\\n            ((v & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);\\n        // swap 8-byte long pairs\\n        v = ((v >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |\\n            ((v & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);\\n        // swap 16-byte long pairs\\n        v = (v >> 128) | (v << 128);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint64\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint64(uint64 _b) internal pure returns (uint64 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF00FF00FF) |\\n            ((v & 0x00FF00FF00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = ((v >> 16) & 0x0000FFFF0000FFFF) |\\n            ((v & 0x0000FFFF0000FFFF) << 16);\\n        // swap 4-byte long pairs\\n        v = (v >> 32) | (v << 32);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint32\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint32(uint32 _b) internal pure returns (uint32 v) {\\n        v = _b;\\n\\n        // swap bytes\\n        v = ((v >> 8) & 0x00FF00FF) |\\n            ((v & 0x00FF00FF) << 8);\\n        // swap 2-byte long pairs\\n        v = (v >> 16) | (v << 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint24\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint24(uint24 _b) internal pure returns (uint24 v) {\\n        v =  (_b << 16) | (_b & 0x00FF00) | (_b >> 16);\\n    }\\n\\n    /// @notice          Changes the endianness of a uint16\\n    /// @param _b        The unsigned integer to reverse\\n    /// @return v        The reversed value\\n    function reverseUint16(uint16 _b) internal pure returns (uint16 v) {\\n        v =  (_b << 8) | (_b >> 8);\\n    }\\n\\n\\n    /// @notice          Converts big-endian bytes to a uint\\n    /// @dev             Traverses the byte array and sums the bytes\\n    /// @param _b        The big-endian bytes-encoded integer\\n    /// @return          The integer representation\\n    function bytesToUint(bytes memory _b) internal pure returns (uint256) {\\n        uint256 _number;\\n\\n        for (uint i = 0; i < _b.length; i++) {\\n            _number = _number + uint8(_b[i]) * (2 ** (8 * (_b.length - (i + 1))));\\n        }\\n\\n        return _number;\\n    }\\n\\n    /// @notice          Get the last _num bytes from a byte array\\n    /// @param _b        The byte array to slice\\n    /// @param _num      The number of bytes to extract from the end\\n    /// @return          The last _num bytes of _b\\n    function lastBytes(bytes memory _b, uint256 _num) internal pure returns (bytes memory) {\\n        uint256 _start = _b.length.sub(_num);\\n\\n        return _b.slice(_start, _num);\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (rmd160(sha2()))\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash160(bytes memory _b) internal pure returns (bytes memory) {\\n        return abi.encodePacked(ripemd160(abi.encodePacked(sha256(_b))));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash160 (sha2 + ripemd160)\\n    /// @dev             sha2 precompile at address(2), ripemd160 at address(3)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash160View(bytes memory _b) internal view returns (bytes20 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 3, 0x00, 32, 0x00, 32))\\n            // read from position 12 = 0c\\n            res := mload(0x0c)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             abi.encodePacked changes the return to bytes instead of bytes32\\n    /// @param _b        The pre-image\\n    /// @return          The digest\\n    function hash256(bytes memory _b) internal pure returns (bytes32) {\\n        return sha256(abi.encodePacked(sha256(_b)));\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 (double sha2)\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _b        The pre-image\\n    /// @return res      The digest\\n    function hash256View(bytes memory _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            pop(staticcall(gas(), 2, add(_b, 32), mload(_b), 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /// @notice          Implements bitcoin's hash256 on a pair of bytes32\\n    /// @dev             sha2 is precompiled smart contract located at address(2)\\n    /// @param _a        The first bytes32 of the pre-image\\n    /// @param _b        The second bytes32 of the pre-image\\n    /// @return res      The digest\\n    function hash256Pair(bytes32 _a, bytes32 _b) internal view returns (bytes32 res) {\\n        // solium-disable-next-line security/no-inline-assembly\\n        assembly {\\n            mstore(0x00, _a)\\n            mstore(0x20, _b)\\n            pop(staticcall(gas(), 2, 0x00, 64, 0x00, 32))\\n            pop(staticcall(gas(), 2, 0x00, 32, 0x00, 32))\\n            res := mload(0x00)\\n        }\\n    }\\n\\n    /* ************ */\\n    /* Legacy Input */\\n    /* ************ */\\n\\n    /// @notice          Extracts the nth input from the vin (0-indexed)\\n    /// @dev             Iterates over the vin. If you need to extract several, write a custom function\\n    /// @param _vin      The vin as a tightly-packed byte array\\n    /// @param _index    The 0-indexed location of the input to extract\\n    /// @return          The input as a byte array\\n    function extractInputAtIndex(bytes memory _vin, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nIns, \\\"Vin read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineInputLengthAt(_vin, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n            _offset = _offset + _len;\\n        }\\n\\n        _len = determineInputLengthAt(_vin, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _vin.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Determines whether an input is legacy\\n    /// @dev             False if no scriptSig, otherwise True\\n    /// @param _input    The input\\n    /// @return          True for legacy, False for witness\\n    function isLegacyInput(bytes memory _input) internal pure returns (bool) {\\n        return _input[36] != hex\\\"00\\\";\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The LEGACY input\\n    /// @return          The length of the script sig\\n    function extractScriptSigLen(bytes memory _input) internal pure returns (uint256, uint256) {\\n        return extractScriptSigLenAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of a scriptSig in an input\\n    ///                  starting at the specified position\\n    /// @dev             Will return 0 if passed a witness input.\\n    /// @param _input    The byte array containing the LEGACY input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the script sig\\n    function extractScriptSigLenAt(bytes memory _input, uint256 _at) internal pure returns (uint256, uint256) {\\n        if (_input.length < 37 + _at) {\\n            return (ERR_BAD_ARG, 0);\\n        }\\n\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = parseVarIntAt(_input, _at + 36);\\n\\n        return (_varIntDataLen, _scriptSigLen);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The input\\n    /// @return          The length of the input in bytes\\n    function determineInputLength(bytes memory _input) internal pure returns (uint256) {\\n        return determineInputLengthAt(_input, 0);\\n    }\\n\\n    /// @notice          Determines the length of an input from its scriptSig,\\n    ///                  starting at the specified position\\n    /// @dev             36 for outpoint, 1 for scriptSig length, 4 for sequence\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input in the array\\n    /// @return          The length of the input in bytes\\n    function determineInputLengthAt(bytes memory _input, uint256 _at) internal pure returns (uint256) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLenAt(_input, _at);\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        return 36 + 1 + _varIntDataLen + _scriptSigLen + 4;\\n    }\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLELegacy(bytes memory _input) internal pure returns (bytes4) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice4(36 + 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The LEGACY input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceLegacy(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLELegacy(_input));\\n        uint32 _beSequence = reverseUint32(_leSeqence);\\n        return _beSequence;\\n    }\\n    /// @notice          Extracts the VarInt-prepended scriptSig from the input in a tx\\n    /// @dev             Will return hex\\\"00\\\" if passed a witness input\\n    /// @param _input    The LEGACY input\\n    /// @return          The length-prepended scriptSig\\n    function extractScriptSig(bytes memory _input) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _scriptSigLen;\\n        (_varIntDataLen, _scriptSigLen) = extractScriptSigLen(_input);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Bad VarInt in scriptSig\\\");\\n        return _input.slice(36, 1 + _varIntDataLen + _scriptSigLen);\\n    }\\n\\n\\n    /* ************* */\\n    /* Witness Input */\\n    /* ************* */\\n\\n    /// @notice          Extracts the LE sequence bytes from an input\\n    /// @dev             Sequence is used for relative time locks\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence bytes (LE uint)\\n    function extractSequenceLEWitness(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(37);\\n    }\\n\\n    /// @notice          Extracts the sequence from the input in a tx\\n    /// @dev             Sequence is a 4-byte little-endian number\\n    /// @param _input    The WITNESS input\\n    /// @return          The sequence number (big-endian uint)\\n    function extractSequenceWitness(bytes memory _input) internal pure returns (uint32) {\\n        uint32 _leSeqence = uint32(extractSequenceLEWitness(_input));\\n        uint32 _inputeSequence = reverseUint32(_leSeqence);\\n        return _inputeSequence;\\n    }\\n\\n    /// @notice          Extracts the outpoint from the input in a tx\\n    /// @dev             32-byte tx id with 4-byte index\\n    /// @param _input    The input\\n    /// @return          The outpoint (LE bytes of prev tx hash + LE bytes of prev tx index)\\n    function extractOutpoint(bytes memory _input) internal pure returns (bytes memory) {\\n        return _input.slice(0, 36);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    /// @dev             32-byte tx id\\n    /// @param _input    The input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLE(bytes memory _input) internal pure returns (bytes32) {\\n        return _input.slice32(0);\\n    }\\n\\n    /// @notice          Extracts the outpoint tx id from an input\\n    ///                  starting at the specified position\\n    /// @dev             32-byte tx id\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx id (little-endian bytes)\\n    function extractInputTxIdLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes32) {\\n        return _input.slice32(_at);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    /// @dev             4-byte tx index\\n    /// @param _input    The input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLE(bytes memory _input) internal pure returns (bytes4) {\\n        return _input.slice4(32);\\n    }\\n\\n    /// @notice          Extracts the LE tx input index from the input in a tx\\n    ///                  starting at the specified position\\n    /// @dev             4-byte tx index\\n    /// @param _input    The byte array containing the input\\n    /// @param _at       The position of the input\\n    /// @return          The tx index (little-endian bytes)\\n    function extractTxIndexLeAt(bytes memory _input, uint256 _at) internal pure returns (bytes4) {\\n        return _input.slice4(32 + _at);\\n    }\\n\\n    /* ****** */\\n    /* Output */\\n    /* ****** */\\n\\n    /// @notice          Determines the length of an output\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLength(bytes memory _output) internal pure returns (uint256) {\\n        return determineOutputLengthAt(_output, 0);\\n    }\\n\\n    /// @notice          Determines the length of an output\\n    ///                  starting at the specified position\\n    /// @dev             Works with any properly formatted output\\n    /// @param _output   The byte array containing the output\\n    /// @param _at       The position of the output\\n    /// @return          The length indicated by the prefix, error if invalid length\\n    function determineOutputLengthAt(bytes memory _output, uint256 _at) internal pure returns (uint256) {\\n        if (_output.length < 9 + _at) {\\n            return ERR_BAD_ARG;\\n        }\\n        uint256 _varIntDataLen;\\n        uint256 _scriptPubkeyLength;\\n        (_varIntDataLen, _scriptPubkeyLength) = parseVarIntAt(_output, 8 + _at);\\n\\n        if (_varIntDataLen == ERR_BAD_ARG) {\\n            return ERR_BAD_ARG;\\n        }\\n\\n        // 8-byte value, 1-byte for tag itself\\n        return 8 + 1 + _varIntDataLen + _scriptPubkeyLength;\\n    }\\n\\n    /// @notice          Extracts the output at a given index in the TxOuts vector\\n    /// @dev             Iterates over the vout. If you need to extract multiple, write a custom function\\n    /// @param _vout     The _vout to extract from\\n    /// @param _index    The 0-indexed location of the output to extract\\n    /// @return          The specified output\\n    function extractOutputAtIndex(bytes memory _vout, uint256 _index) internal pure returns (bytes memory) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n        require(_varIntDataLen != ERR_BAD_ARG, \\\"Read overrun during VarInt parsing\\\");\\n        require(_index < _nOuts, \\\"Vout read overrun\\\");\\n\\n        uint256 _len = 0;\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 _i = 0; _i < _index; _i ++) {\\n            _len = determineOutputLengthAt(_vout, _offset);\\n            require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n            _offset += _len;\\n        }\\n\\n        _len = determineOutputLengthAt(_vout, _offset);\\n        require(_len != ERR_BAD_ARG, \\\"Bad VarInt in scriptPubkey\\\");\\n        return _vout.slice(_offset, _len);\\n    }\\n\\n    /// @notice          Extracts the value bytes from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value as LE bytes\\n    function extractValueLE(bytes memory _output) internal pure returns (bytes8) {\\n        return _output.slice8(0);\\n    }\\n\\n    /// @notice          Extracts the value from the output in a tx\\n    /// @dev             Value is an 8-byte little-endian number\\n    /// @param _output   The output\\n    /// @return          The output value\\n    function extractValue(bytes memory _output) internal pure returns (uint64) {\\n        uint64 _leValue = uint64(extractValueLE(_output));\\n        uint64 _beValue = reverseUint64(_leValue);\\n        return _beValue;\\n    }\\n\\n    /// @notice          Extracts the data from an op return output\\n    /// @dev             Returns hex\\\"\\\" if no data or not an op return\\n    /// @param _output   The output\\n    /// @return          Any data contained in the opreturn output, null if not an op return\\n    function extractOpReturnData(bytes memory _output) internal pure returns (bytes memory) {\\n        if (_output[9] != hex\\\"6a\\\") {\\n            return hex\\\"\\\";\\n        }\\n        bytes1 _dataLen = _output[10];\\n        return _output.slice(11, uint256(uint8(_dataLen)));\\n    }\\n\\n    /// @notice          Extracts the hash from the output script\\n    /// @dev             Determines type by the length prefix and validates format\\n    /// @param _output   The output\\n    /// @return          The hash committed to by the pk_script, or null for errors\\n    function extractHash(bytes memory _output) internal pure returns (bytes memory) {\\n        uint8 _scriptLen = uint8(_output[8]);\\n\\n        // don't have to worry about overflow here.\\n        // if _scriptLen + 9 overflows, then output.length would have to be < 9\\n        // for this check to pass. if it's < 9, then we errored when assigning\\n        // _scriptLen\\n        if (_scriptLen + 9 != _output.length) {\\n            return hex\\\"\\\";\\n        }\\n\\n        if (uint8(_output[9]) == 0) {\\n            if (_scriptLen < 2) {\\n                return hex\\\"\\\";\\n            }\\n            uint256 _payloadLen = uint8(_output[10]);\\n            // Check for maliciously formatted witness outputs.\\n            // No need to worry about underflow as long b/c of the `< 2` check\\n            if (_payloadLen != _scriptLen - 2 || (_payloadLen != 0x20 && _payloadLen != 0x14)) {\\n                return hex\\\"\\\";\\n            }\\n            return _output.slice(11, _payloadLen);\\n        } else {\\n            bytes3 _tag = _output.slice3(8);\\n            // p2pkh\\n            if (_tag == hex\\\"1976a9\\\") {\\n                // Check for maliciously formatted p2pkh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[11]) != 0x14 ||\\n                    _output.slice2(_output.length - 2) != hex\\\"88ac\\\") {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(12, 20);\\n            //p2sh\\n            } else if (_tag == hex\\\"17a914\\\") {\\n                // Check for maliciously formatted p2sh\\n                // No need to worry about underflow, b/c of _scriptLen check\\n                if (uint8(_output[_output.length - 1]) != 0x87) {\\n                    return hex\\\"\\\";\\n                }\\n                return _output.slice(11, 20);\\n            }\\n        }\\n        return hex\\\"\\\";  /* NB: will trigger on OPRETURN and any non-standard that doesn't overrun */\\n    }\\n\\n    /* ********** */\\n    /* Witness TX */\\n    /* ********** */\\n\\n\\n    /// @notice      Checks that the vin passed up is properly formatted\\n    /// @dev         Consider a vin with a valid vout in its scriptsig\\n    /// @param _vin  Raw bytes length-prefixed input vector\\n    /// @return      True if it represents a validly formatted vin\\n    function validateVin(bytes memory _vin) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nIns;\\n\\n        (_varIntDataLen, _nIns) = parseVarInt(_vin);\\n\\n        // Not valid if it says there are too many or no inputs\\n        if (_nIns == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nIns; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vin.length) {\\n                return false;\\n            }\\n\\n            // Grab the next input and determine its length.\\n            uint256 _nextLen = determineInputLengthAt(_vin, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            // Increase the offset by that much\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vin.length;\\n    }\\n\\n    /// @notice      Checks that the vout passed up is properly formatted\\n    /// @dev         Consider a vout with a valid scriptpubkey\\n    /// @param _vout Raw bytes length-prefixed output vector\\n    /// @return      True if it represents a validly formatted vout\\n    function validateVout(bytes memory _vout) internal pure returns (bool) {\\n        uint256 _varIntDataLen;\\n        uint256 _nOuts;\\n\\n        (_varIntDataLen, _nOuts) = parseVarInt(_vout);\\n\\n        // Not valid if it says there are too many or no outputs\\n        if (_nOuts == 0 || _varIntDataLen == ERR_BAD_ARG) {\\n            return false;\\n        }\\n\\n        uint256 _offset = 1 + _varIntDataLen;\\n\\n        for (uint256 i = 0; i < _nOuts; i++) {\\n            // If we're at the end, but still expect more\\n            if (_offset >= _vout.length) {\\n                return false;\\n            }\\n\\n            // Grab the next output and determine its length.\\n            // Increase the offset by that much\\n            uint256 _nextLen = determineOutputLengthAt(_vout, _offset);\\n            if (_nextLen == ERR_BAD_ARG) {\\n                return false;\\n            }\\n\\n            _offset += _nextLen;\\n        }\\n\\n        // Returns false if we're not exactly at the end\\n        return _offset == _vout.length;\\n    }\\n\\n\\n\\n    /* ************ */\\n    /* Block Header */\\n    /* ************ */\\n\\n    /// @notice          Extracts the transaction merkle root from a block header\\n    /// @dev             Use verifyHash256Merkle to verify proofs with this root\\n    /// @param _header   The header\\n    /// @return          The merkle root (little-endian)\\n    function extractMerkleRootLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(36);\\n    }\\n\\n    /// @notice          Extracts the target from a block header\\n    /// @dev             Target is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _header   The header\\n    /// @return          The target threshold\\n    function extractTarget(bytes memory _header) internal pure returns (uint256) {\\n        uint24 _m = uint24(_header.slice3(72));\\n        uint8 _e = uint8(_header[75]);\\n        uint256 _mantissa = uint256(reverseUint24(_m));\\n        uint _exponent = _e - 3;\\n\\n        return _mantissa * (256 ** _exponent);\\n    }\\n\\n    /// @notice          Calculate difficulty from the difficulty 1 target and current target\\n    /// @dev             Difficulty 1 is 0x1d00ffff on mainnet and testnet\\n    /// @dev             Difficulty 1 is a 256-bit number encoded as a 3-byte mantissa and 1-byte exponent\\n    /// @param _target   The current target\\n    /// @return          The block difficulty (bdiff)\\n    function calculateDifficulty(uint256 _target) internal pure returns (uint256) {\\n        // Difficulty 1 calculated from 0x1d00ffff\\n        return DIFF1_TARGET.div(_target);\\n    }\\n\\n    /// @notice          Extracts the previous block's hash from a block header\\n    /// @dev             Block headers do NOT include block number :(\\n    /// @param _header   The header\\n    /// @return          The previous block's hash (little-endian)\\n    function extractPrevBlockLE(bytes memory _header) internal pure returns (bytes32) {\\n        return _header.slice32(4);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (little-endian bytes)\\n    function extractTimestampLE(bytes memory _header) internal pure returns (bytes4) {\\n        return _header.slice4(68);\\n    }\\n\\n    /// @notice          Extracts the timestamp from a block header\\n    /// @dev             Time is not 100% reliable\\n    /// @param _header   The header\\n    /// @return          The timestamp (uint)\\n    function extractTimestamp(bytes memory _header) internal pure returns (uint32) {\\n        return reverseUint32(uint32(extractTimestampLE(_header)));\\n    }\\n\\n    /// @notice          Extracts the expected difficulty from a block header\\n    /// @dev             Does NOT verify the work\\n    /// @param _header   The header\\n    /// @return          The difficulty as an integer\\n    function extractDifficulty(bytes memory _header) internal pure returns (uint256) {\\n        return calculateDifficulty(extractTarget(_header));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes memory _a, bytes memory _b) internal view returns (bytes32) {\\n        return hash256View(abi.encodePacked(_a, _b));\\n    }\\n\\n    /// @notice          Concatenates and hashes two inputs for merkle proving\\n    /// @param _a        The first hash\\n    /// @param _b        The second hash\\n    /// @return          The double-sha256 of the concatenated hashes\\n    function _hash256MerkleStep(bytes32 _a, bytes32 _b) internal view returns (bytes32) {\\n        return hash256Pair(_a, _b);\\n    }\\n\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Inefficient version.\\n    /// @param _proof    The proof. Tightly packed LE sha256 hashes. The last hash is the root\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(bytes memory _proof, uint _index) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_proof.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Special case for coinbase-only blocks\\n        if (_proof.length == 32) {\\n            return true;\\n        }\\n\\n        // Should never occur\\n        if (_proof.length == 64) {\\n            return false;\\n        }\\n\\n        bytes32 _root = _proof.slice32(_proof.length - 32);\\n        bytes32 _current = _proof.slice32(0);\\n        bytes memory _tree = _proof.slice(32, _proof.length - 64);\\n\\n        return verifyHash256Merkle(_current, _tree, _root, _index);\\n    }\\n\\n    /// @notice          Verifies a Bitcoin-style merkle tree\\n    /// @dev             Leaves are 0-indexed. Efficient version.\\n    /// @param _leaf     The leaf of the proof. LE sha256 hash.\\n    /// @param _tree     The intermediate nodes in the proof.\\n    ///                  Tightly packed LE sha256 hashes.\\n    /// @param _root     The root of the proof. LE sha256 hash.\\n    /// @param _index    The index of the leaf\\n    /// @return          true if the proof is valid, else false\\n    function verifyHash256Merkle(\\n        bytes32 _leaf,\\n        bytes memory _tree,\\n        bytes32 _root,\\n        uint _index\\n    ) internal view returns (bool) {\\n        // Not an even number of hashes\\n        if (_tree.length % 32 != 0) {\\n            return false;\\n        }\\n\\n        // Should never occur\\n        if (_tree.length == 0) {\\n            return false;\\n        }\\n\\n        uint _idx = _index;\\n        bytes32 _current = _leaf;\\n\\n        // i moves in increments of 32\\n        for (uint i = 0; i < _tree.length; i += 32) {\\n            if (_idx % 2 == 1) {\\n                _current = _hash256MerkleStep(_tree.slice32(i), _current);\\n            } else {\\n                _current = _hash256MerkleStep(_current, _tree.slice32(i));\\n            }\\n            _idx = _idx >> 1;\\n        }\\n        return _current == _root;\\n    }\\n\\n    /*\\n    NB: https://github.com/bitcoin/bitcoin/blob/78dae8caccd82cfbfd76557f1fb7d7557c7b5edb/src/pow.cpp#L49-L72\\n    NB: We get a full-bitlength target from this. For comparison with\\n        header-encoded targets we need to mask it with the header target\\n        e.g. (full & truncated) == truncated\\n    */\\n    /// @notice                 performs the bitcoin difficulty retarget\\n    /// @dev                    implements the Bitcoin algorithm precisely\\n    /// @param _previousTarget  the target of the previous period\\n    /// @param _firstTimestamp  the timestamp of the first block in the difficulty period\\n    /// @param _secondTimestamp the timestamp of the last block in the difficulty period\\n    /// @return                 the new period's target threshold\\n    function retargetAlgorithm(\\n        uint256 _previousTarget,\\n        uint256 _firstTimestamp,\\n        uint256 _secondTimestamp\\n    ) internal pure returns (uint256) {\\n        uint256 _elapsedTime = _secondTimestamp.sub(_firstTimestamp);\\n\\n        // Normalize ratio to factor of 4 if very long or very short\\n        if (_elapsedTime < RETARGET_PERIOD.div(4)) {\\n            _elapsedTime = RETARGET_PERIOD.div(4);\\n        }\\n        if (_elapsedTime > RETARGET_PERIOD.mul(4)) {\\n            _elapsedTime = RETARGET_PERIOD.mul(4);\\n        }\\n\\n        /*\\n          NB: high targets e.g. ffff0020 can cause overflows here\\n              so we divide it by 256**2, then multiply by 256**2 later\\n              we know the target is evenly divisible by 256**2, so this isn't an issue\\n        */\\n\\n        uint256 _adjusted = _previousTarget.div(65536).mul(_elapsedTime);\\n        return _adjusted.div(RETARGET_PERIOD).mul(65536);\\n    }\\n}\\n\",\"keccak256\":\"0x0f6b9a8deec659541f8bf2e5c4ecf4596ffa7502f7a8f4d9e88a681a01ef0dfb\"},\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\n\\nhttps://github.com/GNSPS/solidity-bytes-utils/\\n\\nThis is free and unencumbered software released into the public domain.\\n\\nAnyone is free to copy, modify, publish, use, compile, sell, or\\ndistribute this software, either in source code form or as a compiled\\nbinary, for any purpose, commercial or non-commercial, and by any\\nmeans.\\n\\nIn jurisdictions that recognize copyright laws, the author or authors\\nof this software dedicate any and all copyright interest in the\\nsoftware to the public domain. We make this dedication for the benefit\\nof the public at large and to the detriment of our heirs and\\nsuccessors. We intend this dedication to be an overt act of\\nrelinquishment in perpetuity of all present and future rights to this\\nsoftware under copyright law.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\nOTHER DEALINGS IN THE SOFTWARE.\\n\\nFor more information, please refer to <https://unlicense.org>\\n*/\\n\\n\\n/** @title BytesLib **/\\n/** @author https://github.com/GNSPS **/\\n\\nlibrary BytesLib {\\n    function concat(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bytes memory) {\\n        bytes memory tempBytes;\\n\\n        assembly {\\n            // Get a location of some free memory and store it in tempBytes as\\n            // Solidity does for memory variables.\\n            tempBytes := mload(0x40)\\n\\n            // Store the length of the first bytes array at the beginning of\\n            // the memory for tempBytes.\\n            let length := mload(_preBytes)\\n            mstore(tempBytes, length)\\n\\n            // Maintain a memory counter for the current write location in the\\n            // temp bytes array by adding the 32 bytes for the array length to\\n            // the starting location.\\n            let mc := add(tempBytes, 0x20)\\n            // Stop copying when the memory counter reaches the length of the\\n            // first bytes array.\\n            let end := add(mc, length)\\n\\n            for {\\n                // Initialize a copy counter to the start of the _preBytes data,\\n                // 32 bytes into its memory.\\n                let cc := add(_preBytes, 0x20)\\n            } lt(mc, end) {\\n                // Increase both counters by 32 bytes each iteration.\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                // Write the _preBytes data into the tempBytes memory 32 bytes\\n                // at a time.\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Add the length of _postBytes to the current length of tempBytes\\n            // and store it as the new length in the first 32 bytes of the\\n            // tempBytes memory.\\n            length := mload(_postBytes)\\n            mstore(tempBytes, add(length, mload(tempBytes)))\\n\\n            // Move the memory counter back from a multiple of 0x20 to the\\n            // actual end of the _preBytes data.\\n            mc := end\\n            // Stop copying when the memory counter reaches the new combined\\n            // length of the arrays.\\n            end := add(mc, length)\\n\\n            for {\\n                let cc := add(_postBytes, 0x20)\\n            } lt(mc, end) {\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Update the free-memory pointer by padding our last write location\\n            // to 32 bytes: add 31 bytes to the end of tempBytes to move to the\\n            // next 32 byte block, then round down to the nearest multiple of\\n            // 32. If the sum of the length of the two arrays is zero then add\\n            // one before rounding down to leave a blank 32 bytes (the length block with 0).\\n            mstore(0x40, and(\\n                add(add(end, iszero(add(length, mload(_preBytes)))), 31),\\n                not(31) // Round down to the nearest 32 bytes.\\n            ))\\n        }\\n\\n        return tempBytes;\\n    }\\n\\n    function concatStorage(bytes storage _preBytes, bytes memory _postBytes) internal {\\n        assembly {\\n            // Read the first 32 bytes of _preBytes storage, which is the length\\n            // of the array. (We don't need to use the offset into the slot\\n            // because arrays use the entire slot.)\\n            let fslot := sload(_preBytes.slot)\\n            // Arrays of 31 bytes or less have an even value in their slot,\\n            // while longer arrays have an odd value. The actual length is\\n            // the slot divided by two for odd values, and the lowest order\\n            // byte divided by two for even values.\\n            // If the slot is even, bitwise and the slot with 255 and divide by\\n            // two to get the length. If the slot is odd, bitwise and the slot\\n            // with -1 and divide by two.\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n            let newlength := add(slength, mlength)\\n            // slength can contain both the length and contents of the array\\n            // if length < 32 bytes so let's prepare for that\\n            // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n            switch add(lt(slength, 32), lt(newlength, 32))\\n            case 2 {\\n                // Since the new array still fits in the slot, we just need to\\n                // update the contents of the slot.\\n                // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length\\n                sstore(\\n                    _preBytes.slot,\\n                    // all the modifications to the slot are inside this\\n                    // next block\\n                    add(\\n                        // we can just add to the slot contents because the\\n                        // bytes we want to change are the LSBs\\n                        fslot,\\n                        add(\\n                            mul(\\n                                div(\\n                                    // load the bytes from memory\\n                                    mload(add(_postBytes, 0x20)),\\n                                    // zero all bytes to the right\\n                                    exp(0x100, sub(32, mlength))\\n                        ),\\n                        // and now shift left the number of bytes to\\n                        // leave space for the length in the slot\\n                        exp(0x100, sub(32, newlength))\\n                        ),\\n                        // increase length by the double of the memory\\n                        // bytes length\\n                        mul(mlength, 2)\\n                        )\\n                    )\\n                )\\n            }\\n            case 1 {\\n                // The stored value fits in the slot, but the combined value\\n                // will exceed it.\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // The contents of the _postBytes array start 32 bytes into\\n                // the structure. Our first read should obtain the `submod`\\n                // bytes that can fit into the unused space in the last word\\n                // of the stored array. To get this, we read 32 bytes starting\\n                // from `submod`, so the data we read overlaps with the array\\n                // contents by `submod` bytes. Masking the lowest-order\\n                // `submod` bytes allows us to add that value directly to the\\n                // stored value.\\n\\n                let submod := sub(32, slength)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(\\n                    sc,\\n                    add(\\n                        and(\\n                            fslot,\\n                            0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00\\n                    ),\\n                    and(mload(mc), mask)\\n                    )\\n                )\\n\\n                for {\\n                    mc := add(mc, 0x20)\\n                    sc := add(sc, 1)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n            default {\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                // Start copying to the last used word of the stored array.\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // Copy over the first `submod` bytes of the new data as in\\n                // case 1 above.\\n                let slengthmod := mod(slength, 32)\\n                let mlengthmod := mod(mlength, 32)\\n                let submod := sub(32, slengthmod)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(sc, add(sload(sc), and(mload(mc), mask)))\\n\\n                for {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n        }\\n    }\\n\\n    function slice(bytes memory _bytes, uint _start, uint _length) internal  pure returns (bytes memory res) {\\n        if (_length == 0) {\\n            return hex\\\"\\\";\\n        }\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            // Alloc bytes array with additional 32 bytes afterspace and assign it's size\\n            res := mload(0x40)\\n            mstore(0x40, add(add(res, 64), _length))\\n            mstore(res, _length)\\n\\n            // Compute distance between source and destination pointers\\n            let diff := sub(res, add(_bytes, _start))\\n\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n            } {\\n                mstore(add(src, diff), mload(src))\\n            }\\n        }\\n    }\\n\\n    /// @notice Take a slice of the byte array, overwriting the destination.\\n    /// The length of the slice will equal the length of the destination array.\\n    /// @dev Make sure the destination array has afterspace if required.\\n    /// @param _bytes The source array\\n    /// @param _dest The destination array.\\n    /// @param _start The location to start in the source array.\\n    function sliceInPlace(\\n        bytes memory _bytes,\\n        bytes memory _dest,\\n        uint _start\\n    ) internal pure {\\n        uint _length = _dest.length;\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let res := add(_dest, 32)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n                res := add(res, 32)\\n            } {\\n                mstore(res, mload(src))\\n            }\\n        }\\n    }\\n\\n    // Static slice functions, no bounds checking\\n    /// @notice take a 32-byte slice from the specified position\\n    function slice32(bytes memory _bytes, uint _start) internal pure returns (bytes32 res) {\\n        assembly {\\n            res := mload(add(add(_bytes, 32), _start))\\n        }\\n    }\\n\\n    /// @notice take a 20-byte slice from the specified position\\n    function slice20(bytes memory _bytes, uint _start) internal pure returns (bytes20) {\\n        return bytes20(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 8-byte slice from the specified position\\n    function slice8(bytes memory _bytes, uint _start) internal pure returns (bytes8) {\\n        return bytes8(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 4-byte slice from the specified position\\n    function slice4(bytes memory _bytes, uint _start) internal pure returns (bytes4) {\\n        return bytes4(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 3-byte slice from the specified position\\n    function slice3(bytes memory _bytes, uint _start) internal pure returns (bytes3) {\\n        return bytes3(slice32(_bytes, _start));\\n    }\\n\\n    /// @notice take a 2-byte slice from the specified position\\n    function slice2(bytes memory _bytes, uint _start) internal pure returns (bytes2) {\\n        return bytes2(slice32(_bytes, _start));\\n    }\\n\\n    function toAddress(bytes memory _bytes, uint _start) internal  pure returns (address) {\\n        uint _totalLen = _start + 20;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Address conversion out of bounds.\\\");\\n        address tempAddress;\\n\\n        assembly {\\n            tempAddress := div(mload(add(add(_bytes, 0x20), _start)), 0x1000000000000000000000000)\\n        }\\n\\n        return tempAddress;\\n    }\\n\\n    function toUint(bytes memory _bytes, uint _start) internal  pure returns (uint256) {\\n        uint _totalLen = _start + 32;\\n        require(_totalLen > _start && _bytes.length >= _totalLen, \\\"Uint conversion out of bounds.\\\");\\n        uint256 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x20), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function equal(bytes memory _preBytes, bytes memory _postBytes) internal pure returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            let length := mload(_preBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(length, mload(_postBytes))\\n            case 1 {\\n                // cb is a circuit breaker in the for loop since there's\\n                //  no said feature for inline assembly loops\\n                // cb = 1 - don't breaker\\n                // cb = 0 - break\\n                let cb := 1\\n\\n                let mc := add(_preBytes, 0x20)\\n                let end := add(mc, length)\\n\\n                for {\\n                    let cc := add(_postBytes, 0x20)\\n                    // the next line is the loop condition:\\n                    // while(uint(mc < end) + cb == 2)\\n                } eq(add(lt(mc, end), cb), 2) {\\n                    mc := add(mc, 0x20)\\n                    cc := add(cc, 0x20)\\n                } {\\n                    // if any of these checks fails then arrays are not equal\\n                    if iszero(eq(mload(mc), mload(cc))) {\\n                        // unsuccess:\\n                        success := 0\\n                        cb := 0\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function equalStorage(bytes storage _preBytes, bytes memory _postBytes) internal view returns (bool) {\\n        bool success = true;\\n\\n        assembly {\\n            // we know _preBytes_offset is 0\\n            let fslot := sload(_preBytes.slot)\\n            // Decode the length of the stored array like in concatStorage().\\n            let slength := div(and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)), 2)\\n            let mlength := mload(_postBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(slength, mlength)\\n            case 1 {\\n                // slength can contain both the length and contents of the array\\n                // if length < 32 bytes so let's prepare for that\\n                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n                if iszero(iszero(slength)) {\\n                    switch lt(slength, 32)\\n                    case 1 {\\n                        // blank the last byte which is the length\\n                        fslot := mul(div(fslot, 0x100), 0x100)\\n\\n                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {\\n                            // unsuccess:\\n                            success := 0\\n                        }\\n                    }\\n                    default {\\n                        // cb is a circuit breaker in the for loop since there's\\n                        //  no said feature for inline assembly loops\\n                        // cb = 1 - don't breaker\\n                        // cb = 0 - break\\n                        let cb := 1\\n\\n                        // get the keccak hash to get the contents of the array\\n                        mstore(0x0, _preBytes.slot)\\n                        let sc := keccak256(0x0, 0x20)\\n\\n                        let mc := add(_postBytes, 0x20)\\n                        let end := add(mc, mlength)\\n\\n                        // the next line is the loop condition:\\n                        // while(uint(mc < end) + cb == 2)\\n                        for {} eq(add(lt(mc, end), cb), 2) {\\n                            sc := add(sc, 1)\\n                            mc := add(mc, 0x20)\\n                        } {\\n                            if iszero(eq(sload(sc), mload(mc))) {\\n                                // unsuccess:\\n                                success := 0\\n                                cb := 0\\n                            }\\n                        }\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function toBytes32(bytes memory _source) pure internal returns (bytes32 result) {\\n        if (_source.length == 0) {\\n            return 0x0;\\n        }\\n\\n        assembly {\\n            result := mload(add(_source, 32))\\n        }\\n    }\\n\\n    function keccak256Slice(bytes memory _bytes, uint _start, uint _length) pure internal returns (bytes32 result) {\\n        uint _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            result := keccak256(add(add(_bytes, 32), _start), _length)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x43e0f3b3b23c861bd031588bf410dfdd02e2af17941a89aa38d70e534e0380d1\"},\"@keep-network/bitcoin-spv-sol/contracts/CheckBitcoinSigs.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title CheckBitcoinSigs */\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {BTCUtils} from \\\"./BTCUtils.sol\\\";\\n\\n\\nlibrary CheckBitcoinSigs {\\n\\n    using BytesLib for bytes;\\n    using BTCUtils for bytes;\\n\\n    /// @notice          Derives an Ethereum Account address from a pubkey\\n    /// @dev             The address is the last 20 bytes of the keccak256 of the address\\n    /// @param _pubkey   The public key X & Y. Unprefixed, as a 64-byte array\\n    /// @return          The account address\\n    function accountFromPubkey(bytes memory _pubkey) internal pure returns (address) {\\n        require(_pubkey.length == 64, \\\"Pubkey must be 64-byte raw, uncompressed key.\\\");\\n\\n        // keccak hash of uncompressed unprefixed pubkey\\n        bytes32 _digest = keccak256(_pubkey);\\n        return address(uint160(uint256(_digest)));\\n    }\\n\\n    /// @notice          Calculates the p2wpkh output script of a pubkey\\n    /// @dev             Compresses keys to 33 bytes as required by Bitcoin\\n    /// @param _pubkey   The public key, compressed or uncompressed\\n    /// @return          The p2wkph output script\\n    function p2wpkhFromPubkey(bytes memory _pubkey) internal view returns (bytes memory) {\\n        bytes memory _compressedPubkey;\\n        uint8 _prefix;\\n\\n        if (_pubkey.length == 64) {\\n            _prefix = uint8(_pubkey[_pubkey.length - 1]) % 2 == 1 ? 3 : 2;\\n            _compressedPubkey = abi.encodePacked(_prefix, _pubkey.slice32(0));\\n        } else if (_pubkey.length == 65) {\\n            _prefix = uint8(_pubkey[_pubkey.length - 1]) % 2 == 1 ? 3 : 2;\\n            _compressedPubkey = abi.encodePacked(_prefix, _pubkey.slice32(1));\\n        } else {\\n            _compressedPubkey = _pubkey;\\n        }\\n\\n        require(_compressedPubkey.length == 33, \\\"Witness PKH requires compressed keys\\\");\\n\\n        bytes20 _pubkeyHash = _compressedPubkey.hash160View();\\n        return abi.encodePacked(hex\\\"0014\\\", _pubkeyHash);\\n    }\\n\\n    /// @notice          checks a signed message's validity under a pubkey\\n    /// @dev             does this using ecrecover because Ethereum has no soul\\n    /// @param _pubkey   the public key to check (64 bytes)\\n    /// @param _digest   the message digest signed\\n    /// @param _v        the signature recovery value\\n    /// @param _r        the signature r value\\n    /// @param _s        the signature s value\\n    /// @return          true if signature is valid, else false\\n    function checkSig(\\n        bytes memory _pubkey,\\n        bytes32 _digest,\\n        uint8 _v,\\n        bytes32 _r,\\n        bytes32 _s\\n    ) internal pure returns (bool) {\\n        require(_pubkey.length == 64, \\\"Requires uncompressed unprefixed pubkey\\\");\\n        address _expected = accountFromPubkey(_pubkey);\\n        address _actual = ecrecover(_digest, _v, _r, _s);\\n        return _actual == _expected;\\n    }\\n\\n    /// @notice                     checks a signed message against a bitcoin p2wpkh output script\\n    /// @dev                        does this my verifying the p2wpkh matches an ethereum account\\n    /// @param _p2wpkhOutputScript  the bitcoin output script\\n    /// @param _pubkey              the uncompressed, unprefixed public key to check\\n    /// @param _digest              the message digest signed\\n    /// @param _v                   the signature recovery value\\n    /// @param _r                   the signature r value\\n    /// @param _s                   the signature s value\\n    /// @return                     true if signature is valid, else false\\n    function checkBitcoinSig(\\n        bytes memory _p2wpkhOutputScript,\\n        bytes memory _pubkey,\\n        bytes32 _digest,\\n        uint8 _v,\\n        bytes32 _r,\\n        bytes32 _s\\n    ) internal view returns (bool) {\\n        require(_pubkey.length == 64, \\\"Requires uncompressed unprefixed pubkey\\\");\\n\\n        bool _isExpectedSigner = keccak256(p2wpkhFromPubkey(_pubkey)) == keccak256(_p2wpkhOutputScript);  // is it the expected signer?\\n        if (!_isExpectedSigner) {return false;}\\n\\n        bool _sigResult = checkSig(_pubkey, _digest, _v, _r, _s);\\n        return _sigResult;\\n    }\\n\\n    /// @notice             checks if a message is the sha256 preimage of a digest\\n    /// @dev                this is NOT the hash256!  this step is necessary for ECDSA security!\\n    /// @param _digest      the digest\\n    /// @param _candidate   the purported preimage\\n    /// @return             true if the preimage matches the digest, else false\\n    function isSha256Preimage(\\n        bytes memory _candidate,\\n        bytes32 _digest\\n    ) internal pure returns (bool) {\\n        return sha256(_candidate) == _digest;\\n    }\\n\\n    /// @notice             checks if a message is the keccak256 preimage of a digest\\n    /// @dev                this step is necessary for ECDSA security!\\n    /// @param _digest      the digest\\n    /// @param _candidate   the purported preimage\\n    /// @return             true if the preimage matches the digest, else false\\n    function isKeccak256Preimage(\\n        bytes memory _candidate,\\n        bytes32 _digest\\n    ) internal pure returns (bool) {\\n        return keccak256(_candidate) == _digest;\\n    }\\n\\n    /// @notice                 calculates the signature hash of a Bitcoin transaction with the provided details\\n    /// @dev                    documented in bip143. many values are hardcoded here\\n    /// @param _outpoint        the bitcoin UTXO id (32-byte txid + 4-byte output index)\\n    /// @param _inputPKH        the input pubkeyhash (hash160(sender_pubkey))\\n    /// @param _inputValue      the value of the input in satoshi\\n    /// @param _outputValue     the value of the output in satoshi\\n    /// @param _outputScript    the length-prefixed output script\\n    /// @return                 the double-sha256 (hash256) signature hash as defined by bip143\\n    function wpkhSpendSighash(\\n        bytes memory _outpoint,  // 36-byte UTXO id\\n        bytes20 _inputPKH,       // 20-byte hash160\\n        bytes8 _inputValue,      // 8-byte LE\\n        bytes8 _outputValue,     // 8-byte LE\\n        bytes memory _outputScript    // lenght-prefixed output script\\n    ) internal view returns (bytes32) {\\n        // Fixes elements to easily make a 1-in 1-out sighash digest\\n        // Does not support timelocks\\n        // bytes memory _scriptCode = abi.encodePacked(\\n        //     hex\\\"1976a914\\\",  // length, dup, hash160, pkh_length\\n        //     _inputPKH,\\n        //     hex\\\"88ac\\\");  // equal, checksig\\n\\n        bytes32 _hashOutputs = abi.encodePacked(\\n            _outputValue,  // 8-byte LE\\n            _outputScript).hash256View();\\n\\n        bytes memory _sighashPreimage = abi.encodePacked(\\n            hex\\\"01000000\\\",  // version\\n            _outpoint.hash256View(),  // hashPrevouts\\n            hex\\\"8cb9012517c817fead650287d61bdd9c68803b6bf9c64133dcab3e65b5a50cb9\\\",  // hashSequence(00000000)\\n            _outpoint,  // outpoint\\n            // p2wpkh script code\\n            hex\\\"1976a914\\\",  // length, dup, hash160, pkh_length\\n            _inputPKH,\\n            hex\\\"88ac\\\",  // equal, checksig\\n            // end script code\\n            _inputValue,  // value of the input in 8-byte LE\\n            hex\\\"00000000\\\",  // input nSequence\\n            _hashOutputs,  // hash of the single output\\n            hex\\\"00000000\\\",  // nLockTime\\n            hex\\\"01000000\\\"  // SIGHASH_ALL\\n        );\\n        return _sighashPreimage.hash256View();\\n    }\\n\\n    /// @notice                 calculates the signature hash of a Bitcoin transaction with the provided details\\n    /// @dev                    documented in bip143. many values are hardcoded here\\n    /// @param _outpoint        the bitcoin UTXO id (32-byte txid + 4-byte output index)\\n    /// @param _inputPKH        the input pubkeyhash (hash160(sender_pubkey))\\n    /// @param _inputValue      the value of the input in satoshi\\n    /// @param _outputValue     the value of the output in satoshi\\n    /// @param _outputPKH       the output pubkeyhash (hash160(recipient_pubkey))\\n    /// @return                 the double-sha256 (hash256) signature hash as defined by bip143\\n    function wpkhToWpkhSighash(\\n        bytes memory _outpoint,  // 36-byte UTXO id\\n        bytes20 _inputPKH,  // 20-byte hash160\\n        bytes8 _inputValue,  // 8-byte LE\\n        bytes8 _outputValue,  // 8-byte LE\\n        bytes20 _outputPKH  // 20-byte hash160\\n    ) internal view returns (bytes32) {\\n        return wpkhSpendSighash(\\n            _outpoint,\\n            _inputPKH,\\n            _inputValue,\\n            _outputValue,\\n            abi.encodePacked(\\n              hex\\\"160014\\\",  // wpkh tag\\n              _outputPKH)\\n            );\\n    }\\n\\n    /// @notice                 Preserved for API compatibility with older version\\n    /// @dev                    documented in bip143. many values are hardcoded here\\n    /// @param _outpoint        the bitcoin UTXO id (32-byte txid + 4-byte output index)\\n    /// @param _inputPKH        the input pubkeyhash (hash160(sender_pubkey))\\n    /// @param _inputValue      the value of the input in satoshi\\n    /// @param _outputValue     the value of the output in satoshi\\n    /// @param _outputPKH       the output pubkeyhash (hash160(recipient_pubkey))\\n    /// @return                 the double-sha256 (hash256) signature hash as defined by bip143\\n    function oneInputOneOutputSighash(\\n        bytes memory _outpoint,  // 36-byte UTXO id\\n        bytes20 _inputPKH,  // 20-byte hash160\\n        bytes8 _inputValue,  // 8-byte LE\\n        bytes8 _outputValue,  // 8-byte LE\\n        bytes20 _outputPKH  // 20-byte hash160\\n    ) internal view returns (bytes32) {\\n        return wpkhToWpkhSighash(_outpoint, _inputPKH, _inputValue, _outputValue, _outputPKH);\\n    }\\n\\n}\\n\",\"keccak256\":\"0xfffbd5486af77058fe9385d63d433da914a043994b1affdfcb87248aa10a234c\"},\"@keep-network/bitcoin-spv-sol/contracts/SafeMath.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/*\\nThe MIT License (MIT)\\n\\nCopyright (c) 2016 Smart Contract Solutions, Inc.\\n\\nPermission is hereby granted, free of charge, to any person obtaining\\na copy of this software and associated documentation files (the\\n\\\"Software\\\"), to deal in the Software without restriction, including\\nwithout limitation the rights to use, copy, modify, merge, publish,\\ndistribute, sublicense, and/or sell copies of the Software, and to\\npermit persons to whom the Software is furnished to do so, subject to\\nthe following conditions:\\n\\nThe above copyright notice and this permission notice shall be included\\nin all copies or substantial portions of the Software.\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\\nOR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\\n*/\\n\\n\\n/**\\n * @title SafeMath\\n * @dev Math operations with safety checks that throw on error\\n */\\nlibrary SafeMath {\\n\\n    /**\\n     * @dev Multiplies two numbers, throws on overflow.\\n     */\\n    function mul(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        // Gas optimization: this is cheaper than asserting 'a' not being zero, but the\\n        // benefit is lost if 'b' is also tested.\\n        // See: https://github.com/OpenZeppelin/openzeppelin-solidity/pull/522\\n        if (_a == 0) {\\n            return 0;\\n        }\\n\\n        c = _a * _b;\\n        require(c / _a == _b, \\\"Overflow during multiplication.\\\");\\n        return c;\\n    }\\n\\n    /**\\n     * @dev Integer division of two numbers, truncating the quotient.\\n     */\\n    function div(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        // assert(_b > 0); // Solidity automatically throws when dividing by 0\\n        // uint256 c = _a / _b;\\n        // assert(_a == _b * c + _a % _b); // There is no case in which this doesn't hold\\n        return _a / _b;\\n    }\\n\\n    /**\\n     * @dev Subtracts two numbers, throws on overflow (i.e. if subtrahend is greater than minuend).\\n     */\\n    function sub(uint256 _a, uint256 _b) internal pure returns (uint256) {\\n        require(_b <= _a, \\\"Underflow during subtraction.\\\");\\n        return _a - _b;\\n    }\\n\\n    /**\\n     * @dev Adds two numbers, throws on overflow.\\n     */\\n    function add(uint256 _a, uint256 _b) internal pure returns (uint256 c) {\\n        c = _a + _b;\\n        require(c >= _a, \\\"Overflow during addition.\\\");\\n        return c;\\n    }\\n}\\n\",\"keccak256\":\"0x35930d982394c7ffde439b82e5e696c5b21a6f09699d44861dfe409ef64084a3\"},\"@keep-network/bitcoin-spv-sol/contracts/ValidateSPV.sol\":{\"content\":\"pragma solidity ^0.8.4;\\n\\n/** @title ValidateSPV*/\\n/** @author Summa (https://summa.one) */\\n\\nimport {BytesLib} from \\\"./BytesLib.sol\\\";\\nimport {SafeMath} from \\\"./SafeMath.sol\\\";\\nimport {BTCUtils} from \\\"./BTCUtils.sol\\\";\\n\\n\\nlibrary ValidateSPV {\\n\\n    using BTCUtils for bytes;\\n    using BTCUtils for uint256;\\n    using BytesLib for bytes;\\n    using SafeMath for uint256;\\n\\n    enum InputTypes { NONE, LEGACY, COMPATIBILITY, WITNESS }\\n    enum OutputTypes { NONE, WPKH, WSH, OP_RETURN, PKH, SH, NONSTANDARD }\\n\\n    uint256 constant ERR_BAD_LENGTH = 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;\\n    uint256 constant ERR_INVALID_CHAIN = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe;\\n    uint256 constant ERR_LOW_WORK = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffd;\\n\\n    function getErrBadLength() internal pure returns (uint256) {\\n        return ERR_BAD_LENGTH;\\n    }\\n\\n    function getErrInvalidChain() internal pure returns (uint256) {\\n        return ERR_INVALID_CHAIN;\\n    }\\n\\n    function getErrLowWork() internal pure returns (uint256) {\\n        return ERR_LOW_WORK;\\n    }\\n\\n    /// @notice                     Validates a tx inclusion in the block\\n    /// @dev                        `index` is not a reliable indicator of location within a block\\n    /// @param _txid                The txid (LE)\\n    /// @param _merkleRoot          The merkle root (as in the block header)\\n    /// @param _intermediateNodes   The proof's intermediate nodes (digests between leaf and root)\\n    /// @param _index               The leaf's index in the tree (0-indexed)\\n    /// @return                     true if fully valid, false otherwise\\n    function prove(\\n        bytes32 _txid,\\n        bytes32 _merkleRoot,\\n        bytes memory _intermediateNodes,\\n        uint _index\\n    ) internal view returns (bool) {\\n        // Shortcut the empty-block case\\n        if (_txid == _merkleRoot && _index == 0 && _intermediateNodes.length == 0) {\\n            return true;\\n        }\\n\\n        // If the Merkle proof failed, bubble up error\\n        return BTCUtils.verifyHash256Merkle(\\n            _txid,\\n            _intermediateNodes,\\n            _merkleRoot,\\n            _index\\n        );\\n    }\\n\\n    /// @notice             Hashes transaction to get txid\\n    /// @dev                Supports Legacy and Witness\\n    /// @param _version     4-bytes version\\n    /// @param _vin         Raw bytes length-prefixed input vector\\n    /// @param _vout        Raw bytes length-prefixed output vector\\n    /// @param _locktime    4-byte tx locktime\\n    /// @return             32-byte transaction id, little endian\\n    function calculateTxId(\\n        bytes4 _version,\\n        bytes memory _vin,\\n        bytes memory _vout,\\n        bytes4 _locktime\\n    ) internal view returns (bytes32) {\\n        // Get transaction hash double-Sha256(version + nIns + inputs + nOuts + outputs + locktime)\\n        return abi.encodePacked(_version, _vin, _vout, _locktime).hash256View();\\n    }\\n\\n    /// @notice                  Checks validity of header chain\\n    /// @notice                  Compares the hash of each header to the prevHash in the next header\\n    /// @param _headers          Raw byte array of header chain\\n    /// @return _totalDifficulty The total accumulated difficulty of the header chain, or an error code\\n    function validateHeaderChain(bytes memory _headers) internal view returns (uint256 _totalDifficulty) {\\n\\n        // Check header chain length\\n        if (_headers.length % 80 != 0) {return ERR_BAD_LENGTH;}\\n\\n        // Initialize header start index\\n        bytes32 _digest;\\n\\n        _totalDifficulty = 0;\\n\\n        bytes memory _header;\\n\\n        // Allocate _header with extra space after it to fit 3 full words\\n        assembly {\\n            _header := mload(0x40)\\n            mstore(0x40, add(_header, add(32, 96)))\\n            mstore(_header, 80)\\n        }\\n\\n        for (uint256 _start = 0; _start < _headers.length; _start += 80) {\\n\\n            // ith header start index and ith header\\n            _headers.sliceInPlace(_header, _start);\\n\\n            // After the first header, check that headers are in a chain\\n            if (_start != 0) {\\n                if (!validateHeaderPrevHash(_header, _digest)) {return ERR_INVALID_CHAIN;}\\n            }\\n\\n            // ith header target\\n            uint256 _target = _header.extractTarget();\\n\\n            // Require that the header has sufficient work\\n            _digest = _header.hash256View();\\n            if(uint256(_digest).reverseUint256() > _target) {\\n                return ERR_LOW_WORK;\\n            }\\n\\n            // Add ith header difficulty to difficulty sum\\n            _totalDifficulty = _totalDifficulty.add(_target.calculateDifficulty());\\n        }\\n    }\\n\\n    /// @notice             Checks validity of header work\\n    /// @param _digest      Header digest\\n    /// @param _target      The target threshold\\n    /// @return             true if header work is valid, false otherwise\\n    function validateHeaderWork(bytes32 _digest, uint256 _target) internal pure returns (bool) {\\n        if (_digest == bytes32(0)) {return false;}\\n        return (uint256(_digest).reverseUint256() < _target);\\n    }\\n\\n    /// @notice                     Checks validity of header chain\\n    /// @dev                        Compares current header prevHash to previous header's digest\\n    /// @param _header              The raw bytes header\\n    /// @param _prevHeaderDigest    The previous header's digest\\n    /// @return                     true if the connect is valid, false otherwise\\n    function validateHeaderPrevHash(bytes memory _header, bytes32 _prevHeaderDigest) internal pure returns (bool) {\\n\\n        // Extract prevHash of current header\\n        bytes32 _prevHash = _header.extractPrevBlockLE();\\n\\n        // Compare prevHash of current header to previous header's digest\\n        if (_prevHash != _prevHeaderDigest) {return false;}\\n\\n        return true;\\n    }\\n}\\n\",\"keccak256\":\"0x504c3de02695728018b1f54d0b0f3abdae11624305c8985f541f8f79eea5eeb4\"},\"@keep-network/ecdsa/contracts/EcdsaDkgValidator.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//                           Trust math, not hardware.\\n\\n// Initial version copied from Keep Network Random Beacon:\\n// https://github.com/keep-network/keep-core/blob/5138c7628868dbeed3ae2164f76fccc6c1fbb9e8/solidity/random-beacon/contracts/DKGValidator.sol\\n//\\n// With the following differences:\\n// - group public key length,\\n// - group size and related thresholds,\\n// - documentation.\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\\\";\\nimport \\\"@keep-network/random-beacon/contracts/libraries/BytesLib.sol\\\";\\nimport \\\"@keep-network/sortition-pools/contracts/SortitionPool.sol\\\";\\nimport \\\"./libraries/EcdsaDkg.sol\\\";\\n\\n/// @title DKG result validator\\n/// @notice EcdsaDkgValidator allows performing a full validation of DKG result,\\n///         including checking the format of fields in the result, declared\\n///         selected group members, and signatures of operators supporting the\\n///         result. The operator submitting the result should perform the\\n///         validation using a free contract call before submitting the result\\n///         to ensure their result is valid and can not be challenged. All other\\n///         network operators should perform validation of the submitted result\\n///         using a free contract call and challenge the result if the\\n///         validation fails.\\ncontract EcdsaDkgValidator {\\n    using BytesLib for bytes;\\n    using ECDSA for bytes32;\\n\\n    /// @dev Size of a group in DKG.\\n    uint256 public constant groupSize = 100;\\n\\n    /// @dev The minimum number of group members needed to interact according to\\n    ///      the protocol to produce a signature. The adversary can not learn\\n    ///      anything about the key as long as it does not break into\\n    ///      groupThreshold+1 of members.\\n    uint256 public constant groupThreshold = 51;\\n\\n    /// @dev The minimum number of active and properly behaving group members\\n    ///      during the DKG needed to accept the result. This number is higher\\n    ///      than `groupThreshold` to keep a safety margin for members becoming\\n    ///      inactive after DKG so that the group can still produce signature.\\n    uint256 public constant activeThreshold = 90; // 90% of groupSize\\n\\n    /// @dev Size in bytes of a public key produced by group members during the\\n    /// the DKG. The length assumes uncompressed ECDSA public key.\\n    uint256 public constant publicKeyByteSize = 64;\\n\\n    /// @dev Size in bytes of a single signature produced by operator supporting\\n    ///      DKG result.\\n    uint256 public constant signatureByteSize = 65;\\n\\n    SortitionPool public sortitionPool;\\n\\n    constructor(SortitionPool _sortitionPool) {\\n        sortitionPool = _sortitionPool;\\n    }\\n\\n    /// @notice Performs a full validation of DKG result, including checking the\\n    ///         format of fields in the result, declared selected group members,\\n    ///         and signatures of operators supporting the result.\\n    /// @param seed seed used to start the DKG and select group members\\n    /// @param startBlock DKG start block\\n    /// @return isValid true if the result is valid, false otherwise\\n    /// @return errorMsg validation error message; empty for a valid result\\n    function validate(\\n        EcdsaDkg.Result calldata result,\\n        uint256 seed,\\n        uint256 startBlock\\n    ) external view returns (bool isValid, string memory errorMsg) {\\n        (bool hasValidFields, string memory error) = validateFields(result);\\n        if (!hasValidFields) {\\n            return (false, error);\\n        }\\n\\n        if (!validateSignatures(result, startBlock)) {\\n            return (false, \\\"Invalid signatures\\\");\\n        }\\n\\n        if (!validateGroupMembers(result, seed)) {\\n            return (false, \\\"Invalid group members\\\");\\n        }\\n\\n        // At this point all group members and misbehaved members were verified\\n        if (!validateMembersHash(result)) {\\n            return (false, \\\"Invalid members hash\\\");\\n        }\\n\\n        return (true, \\\"\\\");\\n    }\\n\\n    /// @notice Performs a static validation of DKG result fields: lengths,\\n    ///         ranges, and order of arrays.\\n    /// @return isValid true if the result is valid, false otherwise\\n    /// @return errorMsg validation error message; empty for a valid result\\n    function validateFields(EcdsaDkg.Result calldata result)\\n        public\\n        view\\n        returns (bool isValid, string memory errorMsg)\\n    {\\n        if (result.groupPubKey.length != publicKeyByteSize) {\\n            return (false, \\\"Malformed group public key\\\");\\n        }\\n\\n        // The number of misbehaved members can not exceed the threshold.\\n        // Misbehaved member indices needs to be unique, between [1, groupSize],\\n        // and sorted in ascending order.\\n        uint8[] calldata misbehavedMembersIndices = result\\n            .misbehavedMembersIndices;\\n        if (groupSize - misbehavedMembersIndices.length < activeThreshold) {\\n            return (false, \\\"Too many members misbehaving during DKG\\\");\\n        }\\n        if (misbehavedMembersIndices.length > 1) {\\n            if (\\n                misbehavedMembersIndices[0] < 1 ||\\n                misbehavedMembersIndices[misbehavedMembersIndices.length - 1] >\\n                groupSize\\n            ) {\\n                return (false, \\\"Corrupted misbehaved members indices\\\");\\n            }\\n            for (uint256 i = 1; i < misbehavedMembersIndices.length; i++) {\\n                if (\\n                    misbehavedMembersIndices[i - 1] >=\\n                    misbehavedMembersIndices[i]\\n                ) {\\n                    return (false, \\\"Corrupted misbehaved members indices\\\");\\n                }\\n            }\\n        }\\n\\n        // Each signature needs to have a correct length and signatures need to\\n        // be provided.\\n        uint256 signaturesCount = result.signatures.length / signatureByteSize;\\n        if (result.signatures.length == 0) {\\n            return (false, \\\"No signatures provided\\\");\\n        }\\n        if (result.signatures.length % signatureByteSize != 0) {\\n            return (false, \\\"Malformed signatures array\\\");\\n        }\\n\\n        // We expect the same amount of signatures as the number of declared\\n        // group member indices that signed the result.\\n        uint256[] calldata signingMembersIndices = result.signingMembersIndices;\\n        if (signaturesCount != signingMembersIndices.length) {\\n            return (false, \\\"Unexpected signatures count\\\");\\n        }\\n        if (signaturesCount < groupThreshold) {\\n            return (false, \\\"Too few signatures\\\");\\n        }\\n        if (signaturesCount > groupSize) {\\n            return (false, \\\"Too many signatures\\\");\\n        }\\n\\n        // Signing member indices needs to be unique, between [1,groupSize],\\n        // and sorted in ascending order.\\n        if (\\n            signingMembersIndices[0] < 1 ||\\n            signingMembersIndices[signingMembersIndices.length - 1] > groupSize\\n        ) {\\n            return (false, \\\"Corrupted signing member indices\\\");\\n        }\\n        for (uint256 i = 1; i < signingMembersIndices.length; i++) {\\n            if (signingMembersIndices[i - 1] >= signingMembersIndices[i]) {\\n                return (false, \\\"Corrupted signing member indices\\\");\\n            }\\n        }\\n\\n        return (true, \\\"\\\");\\n    }\\n\\n    /// @notice Performs validation of group members as declared in DKG\\n    ///         result against group members selected by the sortition pool.\\n    /// @param seed seed used to start the DKG and select group members\\n    /// @return true if group members matches; false otherwise\\n    function validateGroupMembers(EcdsaDkg.Result calldata result, uint256 seed)\\n        public\\n        view\\n        returns (bool)\\n    {\\n        uint32[] calldata resultMembers = result.members;\\n        uint32[] memory actualGroupMembers = sortitionPool.selectGroup(\\n            groupSize,\\n            bytes32(seed)\\n        );\\n        if (resultMembers.length != actualGroupMembers.length) {\\n            return false;\\n        }\\n        for (uint256 i = 0; i < resultMembers.length; i++) {\\n            if (resultMembers[i] != actualGroupMembers[i]) {\\n                return false;\\n            }\\n        }\\n        return true;\\n    }\\n\\n    /// @notice Performs validation of signatures supplied in DKG result.\\n    ///         Note that this function does not check if addresses which\\n    ///         supplied signatures supporting the result are the ones selected\\n    ///         to the group by sortition pool. This function should be used\\n    ///         together with `validateGroupMembers`.\\n    /// @param startBlock DKG start block\\n    /// @return true if group members matches; false otherwise\\n    function validateSignatures(\\n        EcdsaDkg.Result calldata result,\\n        uint256 startBlock\\n    ) public view returns (bool) {\\n        bytes32 hash = keccak256(\\n            abi.encodePacked(\\n                result.groupPubKey,\\n                result.misbehavedMembersIndices,\\n                startBlock\\n            )\\n        ).toEthSignedMessageHash();\\n\\n        uint256[] calldata signingMembersIndices = result.signingMembersIndices;\\n        uint32[] memory signingMemberIds = new uint32[](\\n            signingMembersIndices.length\\n        );\\n        for (uint256 i = 0; i < signingMembersIndices.length; i++) {\\n            signingMemberIds[i] = result.members[signingMembersIndices[i] - 1];\\n        }\\n\\n        address[] memory signingMemberAddresses = sortitionPool.getIDOperators(\\n            signingMemberIds\\n        );\\n\\n        bytes memory current; // Current signature to be checked.\\n\\n        uint256 signaturesCount = result.signatures.length / signatureByteSize;\\n        for (uint256 i = 0; i < signaturesCount; i++) {\\n            current = result.signatures.slice(\\n                signatureByteSize * i,\\n                signatureByteSize\\n            );\\n            address recoveredAddress = hash.recover(current);\\n\\n            if (signingMemberAddresses[i] != recoveredAddress) {\\n                return false;\\n            }\\n        }\\n\\n        return true;\\n    }\\n\\n    /// @notice Performs validation of hashed group members that actively took\\n    ///         part in DKG.\\n    /// @param result DKG result\\n    /// @return true if calculated result's group members hash matches with the\\n    /// one that is challenged.\\n    function validateMembersHash(EcdsaDkg.Result calldata result)\\n        public\\n        view\\n        returns (bool)\\n    {\\n        if (result.misbehavedMembersIndices.length > 0) {\\n            // members that generated a group signing key\\n            uint32[] memory groupMembers = new uint32[](\\n                result.members.length - result.misbehavedMembersIndices.length\\n            );\\n            uint256 k = 0; // misbehaved members counter\\n            uint256 j = 0; // group members counter\\n            for (uint256 i = 0; i < result.members.length; i++) {\\n                // misbehaved member indices start from 1, so we need to -1 on misbehaved\\n                if (i != result.misbehavedMembersIndices[k] - 1) {\\n                    groupMembers[j] = result.members[i];\\n                    j++;\\n                } else if (k < result.misbehavedMembersIndices.length - 1) {\\n                    k++;\\n                }\\n            }\\n\\n            return keccak256(abi.encode(groupMembers)) == result.membersHash;\\n        }\\n\\n        return keccak256(abi.encode(result.members)) == result.membersHash;\\n    }\\n}\\n\",\"keccak256\":\"0x03f6dca16ca31db65b537860005e0b34fcc7013eca5113ceeb0baae494a7e4a7\",\"license\":\"MIT\"},\"@keep-network/ecdsa/contracts/api/IWalletRegistry.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//                           Trust math, not hardware.\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"../libraries/EcdsaDkg.sol\\\";\\n\\ninterface IWalletRegistry {\\n    /// @notice Requests a new wallet creation.\\n    /// @dev Only the Wallet Owner can call this function.\\n    function requestNewWallet() external;\\n\\n    /// @notice Closes an existing wallet.\\n    /// @param walletID ID of the wallet.\\n    /// @dev Only the Wallet Owner can call this function.\\n    function closeWallet(bytes32 walletID) external;\\n\\n    /// @notice Adds all signing group members of the wallet with the given ID\\n    ///         to the slashing queue of the staking contract. The notifier will\\n    ///         receive reward per each group member from the staking contract\\n    ///         notifiers treasury. The reward is scaled by the\\n    ///         `rewardMultiplier` provided as a parameter.\\n    /// @param amount Amount of tokens to seize from each signing group member\\n    /// @param rewardMultiplier Fraction of the staking contract notifiers\\n    ///        reward the notifier should receive; should be between [0, 100]\\n    /// @param notifier Address of the misbehavior notifier\\n    /// @param walletID ID of the wallet\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @dev Only the Wallet Owner can call this function.\\n    ///      Requirements:\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events.\\n    ///      - `rewardMultiplier` must be between [0, 100].\\n    ///      - This function does revert if staking contract call reverts.\\n    ///        The calling code needs to handle the potential revert.\\n    function seize(\\n        uint96 amount,\\n        uint256 rewardMultiplier,\\n        address notifier,\\n        bytes32 walletID,\\n        uint32[] calldata walletMembersIDs\\n    ) external;\\n\\n    /// @notice Gets public key of a wallet with a given wallet ID.\\n    ///         The public key is returned in an uncompressed format as a 64-byte\\n    ///         concatenation of X and Y coordinates.\\n    /// @param walletID ID of the wallet.\\n    /// @return Uncompressed public key of the wallet.\\n    function getWalletPublicKey(bytes32 walletID)\\n        external\\n        view\\n        returns (bytes memory);\\n\\n    /// @notice Check current wallet creation state.\\n    function getWalletCreationState() external view returns (EcdsaDkg.State);\\n\\n    /// @notice Checks whether the given operator is a member of the given\\n    ///         wallet signing group.\\n    /// @param walletID ID of the wallet\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @param operator Address of the checked operator\\n    /// @param walletMemberIndex Position of the operator in the wallet signing\\n    ///        group members list\\n    /// @return True - if the operator is a member of the given wallet signing\\n    ///         group. False - otherwise.\\n    /// @dev Requirements:\\n    ///      - The `operator` parameter must be an actual sortition pool operator.\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events.\\n    ///      - The `walletMemberIndex` must be in range [1, walletMembersIDs.length]\\n    function isWalletMember(\\n        bytes32 walletID,\\n        uint32[] calldata walletMembersIDs,\\n        address operator,\\n        uint256 walletMemberIndex\\n    ) external view returns (bool);\\n}\\n\",\"keccak256\":\"0x18f1f76f6b59dedf00ab6d79872589e349d28d8e527a754d0e215a57deb67e89\",\"license\":\"MIT\"},\"@keep-network/ecdsa/contracts/libraries/EcdsaDkg.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//\\n\\n// Initial version copied from Keep Network Random Beacon:\\n// https://github.com/keep-network/keep-core/blob/5138c7628868dbeed3ae2164f76fccc6c1fbb9e8/solidity/random-beacon/contracts/libraries/DKG.sol\\n//\\n// With the following differences:\\n// - the group size was set to 100,\\n// - offchainDkgTimeout was removed,\\n// - submission eligibility verification is not performed on-chain,\\n// - submission eligibility delay was replaced with a submission timeout,\\n// - seed timeout notification requires seedTimeout period to pass.\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\\\";\\nimport \\\"@keep-network/sortition-pools/contracts/SortitionPool.sol\\\";\\nimport \\\"@keep-network/random-beacon/contracts/libraries/BytesLib.sol\\\";\\nimport \\\"../EcdsaDkgValidator.sol\\\";\\n\\nlibrary EcdsaDkg {\\n    using BytesLib for bytes;\\n    using ECDSA for bytes32;\\n\\n    struct Parameters {\\n        // Time in blocks during which a seed is expected to be delivered.\\n        // DKG starts only after a seed is delivered. The time the contract\\n        // awaits for a seed is not included in the DKG timeout.\\n        uint256 seedTimeout;\\n        // Time in blocks during which a submitted result can be challenged.\\n        uint256 resultChallengePeriodLength;\\n        // Time in blocks during which a result is expected to be submitted.\\n        uint256 resultSubmissionTimeout;\\n        // Time in blocks during which only the result submitter is allowed to\\n        // approve it. Once this period ends and the submitter have not approved\\n        // the result, anyone can do it.\\n        uint256 submitterPrecedencePeriodLength;\\n    }\\n\\n    struct Data {\\n        // Address of the Sortition Pool contract.\\n        SortitionPool sortitionPool;\\n        // Address of the EcdsaDkgValidator contract.\\n        EcdsaDkgValidator dkgValidator;\\n        // DKG parameters. The parameters should persist between DKG executions.\\n        // They should be updated with dedicated set functions only when DKG is not\\n        // in progress.\\n        Parameters parameters;\\n        // Time in block at which DKG state was locked.\\n        uint256 stateLockBlock;\\n        // Time in blocks at which DKG started.\\n        uint256 startBlock;\\n        // Seed used to start DKG.\\n        uint256 seed;\\n        // Time in blocks that should be added to result submission eligibility\\n        // delay calculation. It is used in case of a challenge to adjust\\n        // DKG timeout calculation.\\n        uint256 resultSubmissionStartBlockOffset;\\n        // Hash of submitted DKG result.\\n        bytes32 submittedResultHash;\\n        // Block number from the moment of the DKG result submission.\\n        uint256 submittedResultBlock;\\n    }\\n\\n    /// @notice DKG result.\\n    struct Result {\\n        // Claimed submitter candidate group member index.\\n        // Must be in range [1, groupSize].\\n        uint256 submitterMemberIndex;\\n        // Generated candidate group public key\\n        bytes groupPubKey;\\n        // Array of misbehaved members indices (disqualified or inactive).\\n        // Indices must be in range [1, groupSize], unique, and sorted in ascending\\n        // order.\\n        uint8[] misbehavedMembersIndices;\\n        // Concatenation of signatures from members supporting the result.\\n        // The message to be signed by each member is keccak256 hash of the\\n        // calculated group public key, misbehaved members indices and DKG\\n        // start block. The calculated hash should be prefixed with prefixed with\\n        // `\\\\x19Ethereum signed message:\\\\n` before signing, so the message to\\n        // sign is:\\n        // `\\\\x19Ethereum signed message:\\\\n${keccak256(\\n        //    groupPubKey, misbehavedMembersIndices, dkgStartBlock\\n        // )}`\\n        bytes signatures;\\n        // Indices of members corresponding to each signature. Indices must be\\n        // be in range [1, groupSize], unique, and sorted in ascending order.\\n        uint256[] signingMembersIndices;\\n        // Identifiers of candidate group members as outputted by the group\\n        // selection protocol.\\n        uint32[] members;\\n        // Keccak256 hash of group members identifiers that actively took part\\n        // in DKG (excluding IA/DQ members).\\n        bytes32 membersHash;\\n    }\\n\\n    /// @notice States for phases of group creation. The states doesn't include\\n    ///         timeouts which should be tracked and notified individually.\\n    enum State {\\n        // Group creation is not in progress. It is a state set after group creation\\n        // completion either by timeout or by a result approval.\\n        IDLE,\\n        // Group creation is awaiting the seed and sortition pool is locked.\\n        AWAITING_SEED,\\n        // DKG protocol execution is in progress. A result is being calculated\\n        // by the clients in this state and the contract awaits a result submission.\\n        // This is a state to which group creation returns in case of a result\\n        // challenge notification.\\n        AWAITING_RESULT,\\n        // DKG result was submitted and awaits an approval or a challenge. If a result\\n        // gets challenge the state returns to `AWAITING_RESULT`. If a result gets\\n        // approval the state changes to `IDLE`.\\n        CHALLENGE\\n    }\\n\\n    /// @dev Size of a group in ECDSA wallet.\\n    uint256 public constant groupSize = 100;\\n\\n    event DkgStarted(uint256 indexed seed);\\n\\n    // To recreate the members that actively took part in dkg, the selected members\\n    // array should be filtered out from misbehavedMembersIndices.\\n    event DkgResultSubmitted(\\n        bytes32 indexed resultHash,\\n        uint256 indexed seed,\\n        Result result\\n    );\\n\\n    event DkgTimedOut();\\n\\n    event DkgResultApproved(\\n        bytes32 indexed resultHash,\\n        address indexed approver\\n    );\\n\\n    event DkgResultChallenged(\\n        bytes32 indexed resultHash,\\n        address indexed challenger,\\n        string reason\\n    );\\n\\n    event DkgStateLocked();\\n\\n    event DkgSeedTimedOut();\\n\\n    /// @notice Initializes SortitionPool and EcdsaDkgValidator addresses.\\n    ///        Can be performed only once.\\n    /// @param _sortitionPool Sortition Pool reference\\n    /// @param _dkgValidator EcdsaDkgValidator reference\\n    function init(\\n        Data storage self,\\n        SortitionPool _sortitionPool,\\n        EcdsaDkgValidator _dkgValidator\\n    ) internal {\\n        require(\\n            address(self.sortitionPool) == address(0),\\n            \\\"Sortition Pool address already set\\\"\\n        );\\n\\n        require(\\n            address(self.dkgValidator) == address(0),\\n            \\\"DKG Validator address already set\\\"\\n        );\\n\\n        self.sortitionPool = _sortitionPool;\\n        self.dkgValidator = _dkgValidator;\\n    }\\n\\n    /// @notice Determines the current state of group creation. It doesn't take\\n    ///         timeouts into consideration. The timeouts should be tracked and\\n    ///         notified separately.\\n    function currentState(Data storage self)\\n        internal\\n        view\\n        returns (State state)\\n    {\\n        state = State.IDLE;\\n\\n        if (self.sortitionPool.isLocked()) {\\n            state = State.AWAITING_SEED;\\n\\n            if (self.startBlock > 0) {\\n                state = State.AWAITING_RESULT;\\n\\n                if (self.submittedResultBlock > 0) {\\n                    state = State.CHALLENGE;\\n                }\\n            }\\n        }\\n    }\\n\\n    /// @notice Locks the sortition pool and starts awaiting for the\\n    ///         group creation seed.\\n    function lockState(Data storage self) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        emit DkgStateLocked();\\n\\n        self.sortitionPool.lock();\\n\\n        self.stateLockBlock = block.number;\\n    }\\n\\n    function start(Data storage self, uint256 seed) internal {\\n        require(\\n            currentState(self) == State.AWAITING_SEED,\\n            \\\"Current state is not AWAITING_SEED\\\"\\n        );\\n\\n        emit DkgStarted(seed);\\n\\n        self.startBlock = block.number;\\n        self.seed = seed;\\n    }\\n\\n    /// @notice Allows to submit a DKG result. The submitted result does not go\\n    ///         through a validation and before it gets accepted, it needs to\\n    ///         wait through the challenge period during which everyone has\\n    ///         a chance to challenge the result as invalid one. Submitter of\\n    ///         the result needs to be in the sortition pool and if the result\\n    ///         gets challenged, the submitter will get slashed.\\n    function submitResult(Data storage self, Result calldata result) internal {\\n        require(\\n            currentState(self) == State.AWAITING_RESULT,\\n            \\\"Current state is not AWAITING_RESULT\\\"\\n        );\\n        require(!hasDkgTimedOut(self), \\\"DKG timeout already passed\\\");\\n\\n        SortitionPool sortitionPool = self.sortitionPool;\\n\\n        // Submitter must be an operator in the sortition pool.\\n        // Declared submitter's member index in the DKG result needs to match\\n        // the address calling this function.\\n        require(\\n            sortitionPool.isOperatorInPool(msg.sender),\\n            \\\"Submitter not in the sortition pool\\\"\\n        );\\n        require(\\n            sortitionPool.getIDOperator(\\n                result.members[result.submitterMemberIndex - 1]\\n            ) == msg.sender,\\n            \\\"Unexpected submitter index\\\"\\n        );\\n\\n        self.submittedResultHash = keccak256(abi.encode(result));\\n        self.submittedResultBlock = block.number;\\n\\n        emit DkgResultSubmitted(self.submittedResultHash, self.seed, result);\\n    }\\n\\n    /// @notice Checks if awaiting seed timed out.\\n    /// @return True if awaiting seed timed out, false otherwise.\\n    function hasSeedTimedOut(Data storage self) internal view returns (bool) {\\n        return\\n            currentState(self) == State.AWAITING_SEED &&\\n            block.number > (self.stateLockBlock + self.parameters.seedTimeout);\\n    }\\n\\n    /// @notice Checks if DKG timed out. The DKG timeout period includes time required\\n    ///         for off-chain protocol execution and time for the result publication.\\n    ///         After this time a result cannot be submitted and DKG can be notified\\n    ///         about the timeout. DKG period is adjusted by result submission\\n    ///         offset that include blocks that were mined while invalid result\\n    ///         has been registered until it got challenged.\\n    /// @return True if DKG timed out, false otherwise.\\n    function hasDkgTimedOut(Data storage self) internal view returns (bool) {\\n        return\\n            currentState(self) == State.AWAITING_RESULT &&\\n            block.number >\\n            (self.startBlock +\\n                self.resultSubmissionStartBlockOffset +\\n                self.parameters.resultSubmissionTimeout);\\n    }\\n\\n    /// @notice Notifies about the seed was not delivered and restores the\\n    ///         initial DKG state (IDLE).\\n    function notifySeedTimeout(Data storage self) internal {\\n        require(hasSeedTimedOut(self), \\\"Awaiting seed has not timed out\\\");\\n\\n        emit DkgSeedTimedOut();\\n\\n        complete(self);\\n    }\\n\\n    /// @notice Notifies about DKG timeout.\\n    function notifyDkgTimeout(Data storage self) internal {\\n        require(hasDkgTimedOut(self), \\\"DKG has not timed out\\\");\\n\\n        emit DkgTimedOut();\\n\\n        complete(self);\\n    }\\n\\n    /// @notice Approves DKG result. Can be called when the challenge period for\\n    ///         the submitted result is finished. Considers the submitted result\\n    ///         as valid. For the first `submitterPrecedencePeriodLength`\\n    ///         blocks after the end of the challenge period can be called only\\n    ///         by the DKG result submitter. After that time, can be called by\\n    ///         anyone.\\n    /// @dev Can be called after a challenge period for the submitted result.\\n    /// @param result Result to approve. Must match the submitted result stored\\n    ///        during `submitResult`.\\n    /// @return misbehavedMembers Identifiers of members who misbehaved during DKG.\\n    function approveResult(Data storage self, Result calldata result)\\n        internal\\n        returns (uint32[] memory misbehavedMembers)\\n    {\\n        require(\\n            currentState(self) == State.CHALLENGE,\\n            \\\"Current state is not CHALLENGE\\\"\\n        );\\n\\n        uint256 challengePeriodEnd = self.submittedResultBlock +\\n            self.parameters.resultChallengePeriodLength;\\n\\n        require(\\n            block.number > challengePeriodEnd,\\n            \\\"Challenge period has not passed yet\\\"\\n        );\\n\\n        require(\\n            keccak256(abi.encode(result)) == self.submittedResultHash,\\n            \\\"Result under approval is different than the submitted one\\\"\\n        );\\n\\n        // Extract submitter member address. Submitter member index is in\\n        // range [1, groupSize] so we need to -1 when fetching identifier from members\\n        // array.\\n        address submitterMember = self.sortitionPool.getIDOperator(\\n            result.members[result.submitterMemberIndex - 1]\\n        );\\n\\n        require(\\n            msg.sender == submitterMember ||\\n                block.number >\\n                challengePeriodEnd +\\n                    self.parameters.submitterPrecedencePeriodLength,\\n            \\\"Only the DKG result submitter can approve the result at this moment\\\"\\n        );\\n\\n        // Extract misbehaved members identifiers. Misbehaved members indices\\n        // are in range [1, groupSize], so we need to -1 when fetching identifiers from\\n        // members array.\\n        misbehavedMembers = new uint32[](\\n            result.misbehavedMembersIndices.length\\n        );\\n        for (uint256 i = 0; i < result.misbehavedMembersIndices.length; i++) {\\n            misbehavedMembers[i] = result.members[\\n                result.misbehavedMembersIndices[i] - 1\\n            ];\\n        }\\n\\n        emit DkgResultApproved(self.submittedResultHash, msg.sender);\\n\\n        return misbehavedMembers;\\n    }\\n\\n    /// @notice Challenges DKG result. If the submitted result is proved to be\\n    ///         invalid it reverts the DKG back to the result submission phase.\\n    /// @dev Can be called during a challenge period for the submitted result.\\n    /// @param result Result to challenge. Must match the submitted result\\n    ///        stored during `submitResult`.\\n    /// @return maliciousResultHash Hash of the malicious result.\\n    /// @return maliciousSubmitter Identifier of the malicious submitter.\\n    function challengeResult(Data storage self, Result calldata result)\\n        internal\\n        returns (bytes32 maliciousResultHash, uint32 maliciousSubmitter)\\n    {\\n        require(\\n            currentState(self) == State.CHALLENGE,\\n            \\\"Current state is not CHALLENGE\\\"\\n        );\\n\\n        require(\\n            block.number <=\\n                self.submittedResultBlock +\\n                    self.parameters.resultChallengePeriodLength,\\n            \\\"Challenge period has already passed\\\"\\n        );\\n\\n        require(\\n            keccak256(abi.encode(result)) == self.submittedResultHash,\\n            \\\"Result under challenge is different than the submitted one\\\"\\n        );\\n\\n        // https://github.com/crytic/slither/issues/982\\n        // slither-disable-next-line unused-return\\n        try\\n            self.dkgValidator.validate(result, self.seed, self.startBlock)\\n        returns (\\n            // slither-disable-next-line uninitialized-local,variable-scope\\n            bool isValid,\\n            // slither-disable-next-line uninitialized-local,variable-scope\\n            string memory errorMsg\\n        ) {\\n            if (isValid) {\\n                revert(\\\"unjustified challenge\\\");\\n            }\\n\\n            emit DkgResultChallenged(\\n                self.submittedResultHash,\\n                msg.sender,\\n                errorMsg\\n            );\\n        } catch {\\n            // if the validation reverted we consider the DKG result as invalid\\n            emit DkgResultChallenged(\\n                self.submittedResultHash,\\n                msg.sender,\\n                \\\"validation reverted\\\"\\n            );\\n        }\\n\\n        // Consider result hash as malicious.\\n        maliciousResultHash = self.submittedResultHash;\\n        maliciousSubmitter = result.members[result.submitterMemberIndex - 1];\\n\\n        // Adjust DKG result submission block start, so submission stage starts\\n        // from the beginning.\\n        self.resultSubmissionStartBlockOffset = block.number - self.startBlock;\\n\\n        submittedResultCleanup(self);\\n\\n        return (maliciousResultHash, maliciousSubmitter);\\n    }\\n\\n    /// @notice Checks if DKG result is valid for the current DKG.\\n    /// @param result DKG result.\\n    /// @return True if the result is valid. If the result is invalid it returns\\n    ///         false and an error message.\\n    function isResultValid(Data storage self, Result calldata result)\\n        internal\\n        view\\n        returns (bool, string memory)\\n    {\\n        require(self.startBlock > 0, \\\"DKG has not been started\\\");\\n\\n        return self.dkgValidator.validate(result, self.seed, self.startBlock);\\n    }\\n\\n    /// @notice Set setSeedTimeout parameter.\\n    function setSeedTimeout(Data storage self, uint256 newSeedTimeout)\\n        internal\\n    {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(newSeedTimeout > 0, \\\"New value should be greater than zero\\\");\\n\\n        self.parameters.seedTimeout = newSeedTimeout;\\n    }\\n\\n    /// @notice Set resultChallengePeriodLength parameter.\\n    function setResultChallengePeriodLength(\\n        Data storage self,\\n        uint256 newResultChallengePeriodLength\\n    ) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(\\n            newResultChallengePeriodLength > 0,\\n            \\\"New value should be greater than zero\\\"\\n        );\\n\\n        self\\n            .parameters\\n            .resultChallengePeriodLength = newResultChallengePeriodLength;\\n    }\\n\\n    /// @notice Set resultSubmissionTimeout parameter.\\n    function setResultSubmissionTimeout(\\n        Data storage self,\\n        uint256 newResultSubmissionTimeout\\n    ) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(\\n            newResultSubmissionTimeout > 0,\\n            \\\"New value should be greater than zero\\\"\\n        );\\n\\n        self.parameters.resultSubmissionTimeout = newResultSubmissionTimeout;\\n    }\\n\\n    /// @notice Set submitterPrecedencePeriodLength parameter.\\n    function setSubmitterPrecedencePeriodLength(\\n        Data storage self,\\n        uint256 newSubmitterPrecedencePeriodLength\\n    ) internal {\\n        require(currentState(self) == State.IDLE, \\\"Current state is not IDLE\\\");\\n\\n        require(\\n            newSubmitterPrecedencePeriodLength <\\n                self.parameters.resultSubmissionTimeout,\\n            \\\"New value should be less than result submission period length\\\"\\n        );\\n\\n        self\\n            .parameters\\n            .submitterPrecedencePeriodLength = newSubmitterPrecedencePeriodLength;\\n    }\\n\\n    /// @notice Completes DKG by cleaning up state.\\n    /// @dev Should be called after DKG times out or a result is approved.\\n    function complete(Data storage self) internal {\\n        delete self.startBlock;\\n        delete self.seed;\\n        delete self.resultSubmissionStartBlockOffset;\\n        submittedResultCleanup(self);\\n        self.sortitionPool.unlock();\\n    }\\n\\n    /// @notice Cleans up submitted result state either after DKG completion\\n    ///         (as part of `complete` method) or after justified challenge.\\n    function submittedResultCleanup(Data storage self) private {\\n        delete self.submittedResultHash;\\n        delete self.submittedResultBlock;\\n    }\\n}\\n\",\"keccak256\":\"0xb3aada6a96598150d042944e675e93381183b01ad258e774e7c94500062db0f9\",\"license\":\"MIT\"},\"@keep-network/random-beacon/contracts/libraries/BytesLib.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n//\\n// \\u2593\\u2593\\u258c \\u2593\\u2593 \\u2590\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593    \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580      \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584\\u2584\\u2584\\u2584         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580        \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584       \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\u2580\\u2580\\u2580         \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2580\\n//   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593   \\u2580\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2584     \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593     \\u2593\\u2593\\u2593\\u2593\\u2593   \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u258c\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2588\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n// \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2590\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593 \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593  \\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\u2593\\n//\\n//\\n\\npragma solidity ^0.8.9;\\n\\n/*\\nVersion pulled from keep-core v1:\\nhttps://github.com/keep-network/keep-core/blob/f297202db00c027978ad8e7103a356503de5773c/solidity-v1/contracts/utils/BytesLib.sol\\n\\nTo compile it with solidity 0.8 `_preBytes_slot` was replaced with `_preBytes.slot`.\\n*/\\n\\n/*\\nhttps://github.com/GNSPS/solidity-bytes-utils/\\nThis is free and unencumbered software released into the public domain.\\nAnyone is free to copy, modify, publish, use, compile, sell, or\\ndistribute this software, either in source code form or as a compiled\\nbinary, for any purpose, commercial or non-commercial, and by any\\nmeans.\\nIn jurisdictions that recognize copyright laws, the author or authors\\nof this software dedicate any and all copyright interest in the\\nsoftware to the public domain. We make this dedication for the benefit\\nof the public at large and to the detriment of our heirs and\\nsuccessors. We intend this dedication to be an overt act of\\nrelinquishment in perpetuity of all present and future rights to this\\nsoftware under copyright law.\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND,\\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\\nIN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\\nOTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\\nOTHER DEALINGS IN THE SOFTWARE.\\nFor more information, please refer to <https://unlicense.org>\\n*/\\n\\n/** @title BytesLib **/\\n/** @author https://github.com/GNSPS **/\\n\\nlibrary BytesLib {\\n    function concatStorage(bytes storage _preBytes, bytes memory _postBytes)\\n        internal\\n    {\\n        assembly {\\n            // Read the first 32 bytes of _preBytes storage, which is the length\\n            // of the array. (We don't need to use the offset into the slot\\n            // because arrays use the entire slot.)\\n            let fslot := sload(_preBytes.slot)\\n            // Arrays of 31 bytes or less have an even value in their slot,\\n            // while longer arrays have an odd value. The actual length is\\n            // the slot divided by two for odd values, and the lowest order\\n            // byte divided by two for even values.\\n            // If the slot is even, bitwise and the slot with 255 and divide by\\n            // two to get the length. If the slot is odd, bitwise and the slot\\n            // with -1 and divide by two.\\n            let slength := div(\\n                and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)),\\n                2\\n            )\\n            let mlength := mload(_postBytes)\\n            let newlength := add(slength, mlength)\\n            // slength can contain both the length and contents of the array\\n            // if length < 32 bytes so let's prepare for that\\n            // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n            switch add(lt(slength, 32), lt(newlength, 32))\\n            case 2 {\\n                // Since the new array still fits in the slot, we just need to\\n                // update the contents of the slot.\\n                // uint256(bytes_storage) = uint256(bytes_storage) + uint256(bytes_memory) + new_length\\n                sstore(\\n                    _preBytes.slot,\\n                    // all the modifications to the slot are inside this\\n                    // next block\\n                    add(\\n                        // we can just add to the slot contents because the\\n                        // bytes we want to change are the LSBs\\n                        fslot,\\n                        add(\\n                            mul(\\n                                div(\\n                                    // load the bytes from memory\\n                                    mload(add(_postBytes, 0x20)),\\n                                    // zero all bytes to the right\\n                                    exp(0x100, sub(32, mlength))\\n                                ),\\n                                // and now shift left the number of bytes to\\n                                // leave space for the length in the slot\\n                                exp(0x100, sub(32, newlength))\\n                            ),\\n                            // increase length by the double of the memory\\n                            // bytes length\\n                            mul(mlength, 2)\\n                        )\\n                    )\\n                )\\n            }\\n            case 1 {\\n                // The stored value fits in the slot, but the combined value\\n                // will exceed it.\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // The contents of the _postBytes array start 32 bytes into\\n                // the structure. Our first read should obtain the `submod`\\n                // bytes that can fit into the unused space in the last word\\n                // of the stored array. To get this, we read 32 bytes starting\\n                // from `submod`, so the data we read overlaps with the array\\n                // contents by `submod` bytes. Masking the lowest-order\\n                // `submod` bytes allows us to add that value directly to the\\n                // stored value.\\n\\n                let submod := sub(32, slength)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(\\n                    sc,\\n                    add(\\n                        and(\\n                            fslot,\\n                            0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00\\n                        ),\\n                        and(mload(mc), mask)\\n                    )\\n                )\\n\\n                for {\\n                    mc := add(mc, 0x20)\\n                    sc := add(sc, 1)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n            default {\\n                // get the keccak hash to get the contents of the array\\n                mstore(0x0, _preBytes.slot)\\n                // Start copying to the last used word of the stored array.\\n                let sc := add(keccak256(0x0, 0x20), div(slength, 32))\\n\\n                // save new length\\n                sstore(_preBytes.slot, add(mul(newlength, 2), 1))\\n\\n                // Copy over the first `submod` bytes of the new data as in\\n                // case 1 above.\\n                let slengthmod := mod(slength, 32)\\n                let submod := sub(32, slengthmod)\\n                let mc := add(_postBytes, submod)\\n                let end := add(_postBytes, mlength)\\n                let mask := sub(exp(0x100, submod), 1)\\n\\n                sstore(sc, add(sload(sc), and(mload(mc), mask)))\\n\\n                for {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } lt(mc, end) {\\n                    sc := add(sc, 1)\\n                    mc := add(mc, 0x20)\\n                } {\\n                    sstore(sc, mload(mc))\\n                }\\n\\n                mask := exp(0x100, sub(mc, end))\\n\\n                sstore(sc, mul(div(mload(mc), mask), mask))\\n            }\\n        }\\n    }\\n\\n    function equalStorage(bytes storage _preBytes, bytes memory _postBytes)\\n        internal\\n        view\\n        returns (bool)\\n    {\\n        bool success = true;\\n\\n        assembly {\\n            // we know _preBytes_offset is 0\\n            let fslot := sload(_preBytes.slot)\\n            // Decode the length of the stored array like in concatStorage().\\n            let slength := div(\\n                and(fslot, sub(mul(0x100, iszero(and(fslot, 1))), 1)),\\n                2\\n            )\\n            let mlength := mload(_postBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(slength, mlength)\\n            case 1 {\\n                // slength can contain both the length and contents of the array\\n                // if length < 32 bytes so let's prepare for that\\n                // v. http://solidity.readthedocs.io/en/latest/miscellaneous.html#layout-of-state-variables-in-storage\\n                if iszero(iszero(slength)) {\\n                    switch lt(slength, 32)\\n                    case 1 {\\n                        // blank the last byte which is the length\\n                        fslot := mul(div(fslot, 0x100), 0x100)\\n\\n                        if iszero(eq(fslot, mload(add(_postBytes, 0x20)))) {\\n                            // unsuccess:\\n                            success := 0\\n                        }\\n                    }\\n                    default {\\n                        // cb is a circuit breaker in the for loop since there's\\n                        //  no said feature for inline assembly loops\\n                        // cb = 1 - don't breaker\\n                        // cb = 0 - break\\n                        let cb := 1\\n\\n                        // get the keccak hash to get the contents of the array\\n                        mstore(0x0, _preBytes.slot)\\n                        let sc := keccak256(0x0, 0x20)\\n\\n                        let mc := add(_postBytes, 0x20)\\n                        let end := add(mc, mlength)\\n\\n                        // the next line is the loop condition:\\n                        // while(uint(mc < end) + cb == 2)\\n                        for {\\n\\n                        } eq(add(lt(mc, end), cb), 2) {\\n                            sc := add(sc, 1)\\n                            mc := add(mc, 0x20)\\n                        } {\\n                            if iszero(eq(sload(sc), mload(mc))) {\\n                                // unsuccess:\\n                                success := 0\\n                                cb := 0\\n                            }\\n                        }\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function concat(bytes memory _preBytes, bytes memory _postBytes)\\n        internal\\n        pure\\n        returns (bytes memory)\\n    {\\n        bytes memory tempBytes;\\n\\n        assembly {\\n            // Get a location of some free memory and store it in tempBytes as\\n            // Solidity does for memory variables.\\n            tempBytes := mload(0x40)\\n\\n            // Store the length of the first bytes array at the beginning of\\n            // the memory for tempBytes.\\n            let length := mload(_preBytes)\\n            mstore(tempBytes, length)\\n\\n            // Maintain a memory counter for the current write location in the\\n            // temp bytes array by adding the 32 bytes for the array length to\\n            // the starting location.\\n            let mc := add(tempBytes, 0x20)\\n            // Stop copying when the memory counter reaches the length of the\\n            // first bytes array.\\n            let end := add(mc, length)\\n\\n            for {\\n                // Initialize a copy counter to the start of the _preBytes data,\\n                // 32 bytes into its memory.\\n                let cc := add(_preBytes, 0x20)\\n            } lt(mc, end) {\\n                // Increase both counters by 32 bytes each iteration.\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                // Write the _preBytes data into the tempBytes memory 32 bytes\\n                // at a time.\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Add the length of _postBytes to the current length of tempBytes\\n            // and store it as the new length in the first 32 bytes of the\\n            // tempBytes memory.\\n            length := mload(_postBytes)\\n            mstore(tempBytes, add(length, mload(tempBytes)))\\n\\n            // Move the memory counter back from a multiple of 0x20 to the\\n            // actual end of the _preBytes data.\\n            mc := end\\n            // Stop copying when the memory counter reaches the new combined\\n            // length of the arrays.\\n            end := add(mc, length)\\n\\n            for {\\n                let cc := add(_postBytes, 0x20)\\n            } lt(mc, end) {\\n                mc := add(mc, 0x20)\\n                cc := add(cc, 0x20)\\n            } {\\n                mstore(mc, mload(cc))\\n            }\\n\\n            // Update the free-memory pointer by padding our last write location\\n            // to 32 bytes: add 31 bytes to the end of tempBytes to move to the\\n            // next 32 byte block, then round down to the nearest multiple of\\n            // 32. If the sum of the length of the two arrays is zero then add\\n            // one before rounding down to leave a blank 32 bytes (the length block with 0).\\n            mstore(\\n                0x40,\\n                and(\\n                    add(add(end, iszero(add(length, mload(_preBytes)))), 31),\\n                    not(31) // Round down to the nearest 32 bytes.\\n                )\\n            )\\n        }\\n\\n        return tempBytes;\\n    }\\n\\n    function slice(\\n        bytes memory _bytes,\\n        uint256 _start,\\n        uint256 _length\\n    ) internal pure returns (bytes memory res) {\\n        uint256 _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            // Alloc bytes array with additional 32 bytes afterspace and assign it's size\\n            res := mload(0x40)\\n            mstore(0x40, add(add(res, 64), _length))\\n            mstore(res, _length)\\n\\n            // Compute distance between source and destination pointers\\n            let diff := sub(res, add(_bytes, _start))\\n\\n            for {\\n                let src := add(add(_bytes, 32), _start)\\n                let end := add(src, _length)\\n            } lt(src, end) {\\n                src := add(src, 32)\\n            } {\\n                mstore(add(src, diff), mload(src))\\n            }\\n        }\\n    }\\n\\n    function toAddress(bytes memory _bytes, uint256 _start)\\n        internal\\n        pure\\n        returns (address)\\n    {\\n        uint256 _totalLen = _start + 20;\\n        require(\\n            _totalLen > _start && _bytes.length >= _totalLen,\\n            \\\"Address conversion out of bounds.\\\"\\n        );\\n        address tempAddress;\\n\\n        assembly {\\n            tempAddress := div(\\n                mload(add(add(_bytes, 0x20), _start)),\\n                0x1000000000000000000000000\\n            )\\n        }\\n\\n        return tempAddress;\\n    }\\n\\n    function toUint8(bytes memory _bytes, uint256 _start)\\n        internal\\n        pure\\n        returns (uint8)\\n    {\\n        require(\\n            _bytes.length >= (_start + 1),\\n            \\\"Uint8 conversion out of bounds.\\\"\\n        );\\n        uint8 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x1), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function toUint(bytes memory _bytes, uint256 _start)\\n        internal\\n        pure\\n        returns (uint256)\\n    {\\n        uint256 _totalLen = _start + 32;\\n        require(\\n            _totalLen > _start && _bytes.length >= _totalLen,\\n            \\\"Uint conversion out of bounds.\\\"\\n        );\\n        uint256 tempUint;\\n\\n        assembly {\\n            tempUint := mload(add(add(_bytes, 0x20), _start))\\n        }\\n\\n        return tempUint;\\n    }\\n\\n    function equal(bytes memory _preBytes, bytes memory _postBytes)\\n        internal\\n        pure\\n        returns (bool)\\n    {\\n        bool success = true;\\n\\n        assembly {\\n            let length := mload(_preBytes)\\n\\n            // if lengths don't match the arrays are not equal\\n            switch eq(length, mload(_postBytes))\\n            case 1 {\\n                // cb is a circuit breaker in the for loop since there's\\n                //  no said feature for inline assembly loops\\n                // cb = 1 - don't breaker\\n                // cb = 0 - break\\n                let cb := 1\\n\\n                let mc := add(_preBytes, 0x20)\\n                let end := add(mc, length)\\n\\n                for {\\n                    let cc := add(_postBytes, 0x20)\\n                    // the next line is the loop condition:\\n                    // while(uint(mc < end) + cb == 2)\\n                } eq(add(lt(mc, end), cb), 2) {\\n                    mc := add(mc, 0x20)\\n                    cc := add(cc, 0x20)\\n                } {\\n                    // if any of these checks fails then arrays are not equal\\n                    if iszero(eq(mload(mc), mload(cc))) {\\n                        // unsuccess:\\n                        success := 0\\n                        cb := 0\\n                    }\\n                }\\n            }\\n            default {\\n                // unsuccess:\\n                success := 0\\n            }\\n        }\\n\\n        return success;\\n    }\\n\\n    function toBytes32(bytes memory _source)\\n        internal\\n        pure\\n        returns (bytes32 result)\\n    {\\n        if (_source.length == 0) {\\n            return 0x0;\\n        }\\n\\n        assembly {\\n            result := mload(add(_source, 32))\\n        }\\n    }\\n\\n    function keccak256Slice(\\n        bytes memory _bytes,\\n        uint256 _start,\\n        uint256 _length\\n    ) internal pure returns (bytes32 result) {\\n        uint256 _end = _start + _length;\\n        require(_end > _start && _bytes.length >= _end, \\\"Slice out of bounds\\\");\\n\\n        assembly {\\n            result := keccak256(add(add(_bytes, 32), _start), _length)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xd778546e5ccb131b9dbf25abc4fa8668168b55bae599ffe40f040e7100aa8a35\",\"license\":\"MIT\"},\"@keep-network/sortition-pools/contracts/Branch.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\n/// @notice The implicit 8-ary trees of the sortition pool\\n/// rely on packing 8 \\\"slots\\\" of 32-bit values into each uint256.\\n/// The Branch library permits efficient calculations on these slots.\\nlibrary Branch {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant SLOT_WIDTH = 256 / SLOT_COUNT;\\n  uint256 private constant LAST_SLOT = SLOT_COUNT - 1;\\n  uint256 private constant SLOT_MAX = (2**SLOT_WIDTH) - 1;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  /// @notice Calculate the right shift required\\n  /// to make the 32 least significant bits of an uint256\\n  /// be the bits of the `position`th slot\\n  /// when treating the uint256 as a uint32[8].\\n  ///\\n  /// @dev Not used for efficiency reasons,\\n  /// but left to illustrate the meaning of a common pattern.\\n  /// I wish solidity had macros, even C macros.\\n  function slotShift(uint256 position) internal pure returns (uint256) {\\n    unchecked {\\n      return position * SLOT_WIDTH;\\n    }\\n  }\\n\\n  /// @notice Return the `position`th slot of the `node`,\\n  /// treating `node` as a uint32[32].\\n  function getSlot(uint256 node, uint256 position)\\n    internal\\n    pure\\n    returns (uint256)\\n  {\\n    unchecked {\\n      uint256 shiftBits = position * SLOT_WIDTH;\\n      // Doing a bitwise AND with `SLOT_MAX`\\n      // clears all but the 32 least significant bits.\\n      // Because of the right shift by `slotShift(position)` bits,\\n      // those 32 bits contain the 32 bits in the `position`th slot of `node`.\\n      return (node >> shiftBits) & SLOT_MAX;\\n    }\\n  }\\n\\n  /// @notice Return `node` with the `position`th slot set to zero.\\n  function clearSlot(uint256 node, uint256 position)\\n    internal\\n    pure\\n    returns (uint256)\\n  {\\n    unchecked {\\n      uint256 shiftBits = position * SLOT_WIDTH;\\n      // Shifting `SLOT_MAX` left by `slotShift(position)` bits\\n      // gives us a number where all bits of the `position`th slot are set,\\n      // and all other bits are unset.\\n      //\\n      // Using a bitwise NOT on this number,\\n      // we get a uint256 where all bits are set\\n      // except for those of the `position`th slot.\\n      //\\n      // Bitwise ANDing the original `node` with this number\\n      // sets the bits of `position`th slot to zero,\\n      // leaving all other bits unchanged.\\n      return node & ~(SLOT_MAX << shiftBits);\\n    }\\n  }\\n\\n  /// @notice Return `node` with the `position`th slot set to `weight`.\\n  ///\\n  /// @param weight The weight of of the node.\\n  /// Safely truncated to a 32-bit number,\\n  /// but this should never be called with an overflowing weight regardless.\\n  function setSlot(\\n    uint256 node,\\n    uint256 position,\\n    uint256 weight\\n  ) internal pure returns (uint256) {\\n    unchecked {\\n      uint256 shiftBits = position * SLOT_WIDTH;\\n      // Clear the `position`th slot like in `clearSlot()`.\\n      uint256 clearedNode = node & ~(SLOT_MAX << shiftBits);\\n      // Bitwise AND `weight` with `SLOT_MAX`\\n      // to clear all but the 32 least significant bits.\\n      //\\n      // Shift this left by `slotShift(position)` bits\\n      // to obtain a uint256 with all bits unset\\n      // except in the `position`th slot\\n      // which contains the 32-bit value of `weight`.\\n      uint256 shiftedWeight = (weight & SLOT_MAX) << shiftBits;\\n      // When we bitwise OR these together,\\n      // all other slots except the `position`th one come from the left argument,\\n      // and the `position`th gets filled with `weight` from the right argument.\\n      return clearedNode | shiftedWeight;\\n    }\\n  }\\n\\n  /// @notice Calculate the summed weight of all slots in the `node`.\\n  function sumWeight(uint256 node) internal pure returns (uint256 sum) {\\n    unchecked {\\n      sum = node & SLOT_MAX;\\n      // Iterate through each slot\\n      // by shifting `node` right in increments of 32 bits,\\n      // and adding the 32 least significant bits to the `sum`.\\n      uint256 newNode = node >> SLOT_WIDTH;\\n      while (newNode > 0) {\\n        sum += (newNode & SLOT_MAX);\\n        newNode = newNode >> SLOT_WIDTH;\\n      }\\n      return sum;\\n    }\\n  }\\n\\n  /// @notice Pick a slot in `node` that corresponds to `index`.\\n  /// Treats the node like an array of virtual stakers,\\n  /// the number of virtual stakers in each slot corresponding to its weight,\\n  /// and picks which slot contains the `index`th virtual staker.\\n  ///\\n  /// @dev Requires that `index` be lower than `sumWeight(node)`.\\n  /// However, this is not enforced for performance reasons.\\n  /// If `index` exceeds the permitted range,\\n  /// `pickWeightedSlot()` returns the rightmost slot\\n  /// and an excessively high `newIndex`.\\n  ///\\n  /// @return slot The slot of `node` containing the `index`th virtual staker.\\n  ///\\n  /// @return newIndex The index of the `index`th virtual staker of `node`\\n  /// within the returned slot.\\n  function pickWeightedSlot(uint256 node, uint256 index)\\n    internal\\n    pure\\n    returns (uint256 slot, uint256 newIndex)\\n  {\\n    unchecked {\\n      newIndex = index;\\n      uint256 newNode = node;\\n      uint256 currentSlotWeight = newNode & SLOT_MAX;\\n      while (newIndex >= currentSlotWeight) {\\n        newIndex -= currentSlotWeight;\\n        slot++;\\n        newNode = newNode >> SLOT_WIDTH;\\n        currentSlotWeight = newNode & SLOT_MAX;\\n      }\\n      return (slot, newIndex);\\n    }\\n  }\\n}\\n\",\"keccak256\":\"0x7ba28c2d49aa038c3a80e3e66a09f035c156abfc1ee3412c8d615c84612bdf29\"},\"@keep-network/sortition-pools/contracts/Leaf.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nlibrary Leaf {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant SLOT_WIDTH = 256 / SLOT_COUNT;\\n  uint256 private constant SLOT_MAX = (2**SLOT_WIDTH) - 1;\\n\\n  uint256 private constant ID_WIDTH = SLOT_WIDTH;\\n  uint256 private constant ID_MAX = SLOT_MAX;\\n\\n  uint256 private constant BLOCKHEIGHT_WIDTH = 96 - ID_WIDTH;\\n  uint256 private constant BLOCKHEIGHT_MAX = (2**BLOCKHEIGHT_WIDTH) - 1;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  function make(\\n    address _operator,\\n    uint256 _creationBlock,\\n    uint256 _id\\n  ) internal pure returns (uint256) {\\n    assert(_creationBlock <= type(uint64).max);\\n    assert(_id <= type(uint32).max);\\n    // Converting a bytesX type into a larger type\\n    // adds zero bytes on the right.\\n    uint256 op = uint256(bytes32(bytes20(_operator)));\\n    // Bitwise AND the id to erase\\n    // all but the 32 least significant bits\\n    uint256 uid = _id & ID_MAX;\\n    // Erase all but the 64 least significant bits,\\n    // then shift left by 32 bits to make room for the id\\n    uint256 cb = (_creationBlock & BLOCKHEIGHT_MAX) << ID_WIDTH;\\n    // Bitwise OR them all together to get\\n    // [address operator || uint64 creationBlock || uint32 id]\\n    return (op | cb | uid);\\n  }\\n\\n  function operator(uint256 leaf) internal pure returns (address) {\\n    // Converting a bytesX type into a smaller type\\n    // truncates it on the right.\\n    return address(bytes20(bytes32(leaf)));\\n  }\\n\\n  /// @notice Return the block number the leaf was created in.\\n  function creationBlock(uint256 leaf) internal pure returns (uint256) {\\n    return ((leaf >> ID_WIDTH) & BLOCKHEIGHT_MAX);\\n  }\\n\\n  function id(uint256 leaf) internal pure returns (uint32) {\\n    // Id is stored in the 32 least significant bits.\\n    // Bitwise AND ensures that we only get the contents of those bits.\\n    return uint32(leaf & ID_MAX);\\n  }\\n}\\n\",\"keccak256\":\"0xaa56ba64d0990b014ce555b8edfd5e2fb3e62b6fade61e0b6d428c6058a33709\"},\"@keep-network/sortition-pools/contracts/Position.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nlibrary Position {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_POINTER_MAX = (2**SLOT_BITS) - 1;\\n  uint256 private constant LEAF_FLAG = 1 << 255;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  // Return the last 3 bits of a position number,\\n  // corresponding to its slot in its parent\\n  function slot(uint256 a) internal pure returns (uint256) {\\n    return a & SLOT_POINTER_MAX;\\n  }\\n\\n  // Return the parent of a position number\\n  function parent(uint256 a) internal pure returns (uint256) {\\n    return a >> SLOT_BITS;\\n  }\\n\\n  // Return the location of the child of a at the given slot\\n  function child(uint256 a, uint256 s) internal pure returns (uint256) {\\n    return (a << SLOT_BITS) | (s & SLOT_POINTER_MAX); // slot(s)\\n  }\\n\\n  // Return the uint p as a flagged position uint:\\n  // the least significant 21 bits contain the position\\n  // and the 22nd bit is set as a flag\\n  // to distinguish the position 0x000000 from an empty field.\\n  function setFlag(uint256 p) internal pure returns (uint256) {\\n    return p | LEAF_FLAG;\\n  }\\n\\n  // Turn a flagged position into an unflagged position\\n  // by removing the flag at the 22nd least significant bit.\\n  //\\n  // We shouldn't _actually_ need this\\n  // as all position-manipulating code should ignore non-position bits anyway\\n  // but it's cheap to call so might as well do it.\\n  function unsetFlag(uint256 p) internal pure returns (uint256) {\\n    return p & (~LEAF_FLAG);\\n  }\\n}\\n\",\"keccak256\":\"0x2068219deb725390f294d2a710ec802b519e6e47eca00024034011d21e5fb8ac\"},\"@keep-network/sortition-pools/contracts/RNG.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nimport \\\"./Leaf.sol\\\";\\n\\nlibrary RNG {\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant WEIGHT_WIDTH = 256 / SLOT_COUNT;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  /// @notice Get an index in the range `[0 .. range-1]`\\n  /// and the new state of the RNG,\\n  /// using the provided `state` of the RNG.\\n  ///\\n  /// @param range The upper bound of the index, exclusive.\\n  ///\\n  /// @param state The previous state of the RNG.\\n  /// The initial state needs to be obtained\\n  /// from a trusted randomness oracle (the random beacon),\\n  /// or from a chain of earlier calls to `RNG.getIndex()`\\n  /// on an originally trusted seed.\\n  ///\\n  /// @dev Calculates the number of bits required for the desired range,\\n  /// takes the least significant bits of `state`\\n  /// and checks if the obtained index is within the desired range.\\n  /// The original state is hashed with `keccak256` to get a new state.\\n  /// If the index is outside the range,\\n  /// the function retries until it gets a suitable index.\\n  ///\\n  /// @return index A random integer between `0` and `range - 1`, inclusive.\\n  ///\\n  /// @return newState The new state of the RNG.\\n  /// When `getIndex()` is called one or more times,\\n  /// care must be taken to always use the output `state`\\n  /// of the most recent call as the input `state` of a subsequent call.\\n  /// At the end of a transaction calling `RNG.getIndex()`,\\n  /// the previous stored state must be overwritten with the latest output.\\n  function getIndex(\\n    uint256 range,\\n    bytes32 state,\\n    uint256 bits\\n  ) internal view returns (uint256, bytes32) {\\n    bool found = false;\\n    uint256 index = 0;\\n    bytes32 newState = state;\\n    while (!found) {\\n      index = truncate(bits, uint256(newState));\\n      newState = keccak256(abi.encodePacked(newState, address(this)));\\n      if (index < range) {\\n        found = true;\\n      }\\n    }\\n    return (index, newState);\\n  }\\n\\n  /// @notice Calculate how many bits are required\\n  /// for an index in the range `[0 .. range-1]`.\\n  ///\\n  /// @param range The upper bound of the desired range, exclusive.\\n  ///\\n  /// @return uint The smallest number of bits\\n  /// that can contain the number `range-1`.\\n  function bitsRequired(uint256 range) internal pure returns (uint256) {\\n    unchecked {\\n      if (range == 1) {\\n        return 0;\\n      }\\n\\n      uint256 bits = WEIGHT_WIDTH - 1;\\n\\n      // Left shift by `bits`,\\n      // so we have a 1 in the (bits + 1)th least significant bit\\n      // and 0 in other bits.\\n      // If this number is equal or greater than `range`,\\n      // the range [0, range-1] fits in `bits` bits.\\n      //\\n      // Because we loop from high bits to low bits,\\n      // we find the highest number of bits that doesn't fit the range,\\n      // and return that number + 1.\\n      while (1 << bits >= range) {\\n        bits--;\\n      }\\n\\n      return bits + 1;\\n    }\\n  }\\n\\n  /// @notice Truncate `input` to the `bits` least significant bits.\\n  function truncate(uint256 bits, uint256 input)\\n    internal\\n    pure\\n    returns (uint256)\\n  {\\n    unchecked {\\n      return input & ((1 << bits) - 1);\\n    }\\n  }\\n}\\n\",\"keccak256\":\"0x1b52b2c45669145cbd9fa7337def843e3de69bfde089039a7fcc09f0aa00c81f\"},\"@keep-network/sortition-pools/contracts/Rewards.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\n/// @title Rewards\\n/// @notice Rewards are allocated proportionally to operators\\n/// present in the pool at payout based on their weight in the pool.\\n///\\n/// To facilitate this, we use a global accumulator value\\n/// to track the total rewards one unit of weight would've earned\\n/// since the creation of the pool.\\n///\\n/// Whenever a reward is paid, the accumulator is increased\\n/// by the size of the reward divided by the total weight\\n/// of all eligible operators in the pool.\\n///\\n/// Each operator has an individual accumulator value,\\n/// set to equal the global accumulator when the operator joins the pool.\\n/// This accumulator reflects the amount of rewards\\n/// that have already been accounted for with that operator.\\n///\\n/// Whenever an operator's weight in the pool changes,\\n/// we can update the amount of rewards the operator has earned\\n/// by subtracting the operator's accumulator from the global accumulator.\\n/// This gives us the amount of rewards one unit of weight has earned\\n/// since the last time the operator's rewards have been updated.\\n/// Then we multiply that by the operator's previous (pre-change) weight\\n/// to determine how much rewards in total the operator has earned,\\n/// and add this to the operator's earned rewards.\\n/// Finally, we set the operator's accumulator to the global accumulator value.\\ncontract Rewards {\\n  struct OperatorRewards {\\n    // The state of the global accumulator\\n    // when the operator's rewards were last updated\\n    uint96 accumulated;\\n    // The amount of rewards collected by the operator after the latest update.\\n    // The amount the operator could withdraw may equal `available`\\n    // or it may be greater, if more rewards have been paid in since then.\\n    // To evaulate the most recent amount including rewards potentially paid\\n    // since the last update, use `availableRewards` function.\\n    uint96 available;\\n    // If nonzero, the operator is ineligible for rewards\\n    // and may only re-enable rewards after the specified timestamp.\\n    // XXX: unsigned 32-bit integer unix seconds, will break around 2106\\n    uint32 ineligibleUntil;\\n    // Locally cached weight of the operator,\\n    // used to reduce the cost of setting operators ineligible.\\n    uint32 weight;\\n  }\\n\\n  // The global accumulator of how much rewards\\n  // a hypothetical operator of weight 1 would have earned\\n  // since the creation of the pool.\\n  uint96 internal globalRewardAccumulator;\\n  // If the amount of reward tokens paid in\\n  // does not divide cleanly by pool weight,\\n  // the difference is recorded as rounding dust\\n  // and added to the next reward.\\n  uint96 internal rewardRoundingDust;\\n\\n  // The amount of rewards that would've been earned by ineligible operators\\n  // had they not been ineligible.\\n  uint96 public ineligibleEarnedRewards;\\n\\n  // Ineligibility times are calculated from this offset,\\n  // set at contract creation.\\n  uint256 internal immutable ineligibleOffsetStart;\\n\\n  mapping(uint32 => OperatorRewards) internal operatorRewards;\\n\\n  constructor() {\\n    // solhint-disable-next-line not-rely-on-time\\n    ineligibleOffsetStart = block.timestamp;\\n  }\\n\\n  /// @notice Return whether the operator is eligible for rewards or not.\\n  function isEligibleForRewards(uint32 operator) public view returns (bool) {\\n    return operatorRewards[operator].ineligibleUntil == 0;\\n  }\\n\\n  /// @notice Return the time the operator's reward eligibility can be restored.\\n  function rewardsEligibilityRestorableAt(uint32 operator)\\n    public\\n    view\\n    returns (uint256)\\n  {\\n    uint32 until = operatorRewards[operator].ineligibleUntil;\\n    require(until != 0, \\\"Operator already eligible\\\");\\n    return (uint256(until) + ineligibleOffsetStart);\\n  }\\n\\n  /// @notice Return whether the operator is able\\n  /// to restore their eligibility for rewards right away.\\n  function canRestoreRewardEligibility(uint32 operator)\\n    public\\n    view\\n    returns (bool)\\n  {\\n    // solhint-disable-next-line not-rely-on-time\\n    return rewardsEligibilityRestorableAt(operator) <= block.timestamp;\\n  }\\n\\n  /// @notice Internal function for updating the global state of rewards.\\n  function addRewards(uint96 rewardAmount, uint32 currentPoolWeight) internal {\\n    require(currentPoolWeight >= 0, \\\"No recipients in pool\\\");\\n\\n    uint96 totalAmount = rewardAmount + rewardRoundingDust;\\n    uint96 perWeightReward = totalAmount / currentPoolWeight;\\n    uint96 newRoundingDust = totalAmount % currentPoolWeight;\\n\\n    globalRewardAccumulator += perWeightReward;\\n    rewardRoundingDust = newRoundingDust;\\n  }\\n\\n  /// @notice Internal function for updating the operator's reward state.\\n  function updateOperatorRewards(uint32 operator, uint32 newWeight) internal {\\n    uint96 acc = globalRewardAccumulator;\\n    OperatorRewards memory o = operatorRewards[operator];\\n    uint96 accruedRewards = (acc - o.accumulated) * uint96(o.weight);\\n    if (o.ineligibleUntil == 0) {\\n      // If operator is not ineligible, update their earned rewards\\n      o.available += accruedRewards;\\n    } else {\\n      // If ineligible, put the rewards into the ineligible pot\\n      ineligibleEarnedRewards += accruedRewards;\\n    }\\n    // In any case, update their accumulator and weight\\n    o.accumulated = acc;\\n    o.weight = newWeight;\\n    operatorRewards[operator] = o;\\n  }\\n\\n  /// @notice Set the amount of withdrawable tokens to zero\\n  /// and return the previous withdrawable amount.\\n  /// @dev Does not update the withdrawable amount,\\n  /// but should usually be accompanied by an update.\\n  function withdrawOperatorRewards(uint32 operator)\\n    internal\\n    returns (uint96 withdrawable)\\n  {\\n    OperatorRewards storage o = operatorRewards[operator];\\n    withdrawable = o.available;\\n    o.available = 0;\\n  }\\n\\n  /// @notice Set the amount of ineligible-earned tokens to zero\\n  /// and return the previous amount.\\n  function withdrawIneligibleRewards() internal returns (uint96 withdrawable) {\\n    withdrawable = ineligibleEarnedRewards;\\n    ineligibleEarnedRewards = 0;\\n  }\\n\\n  /// @notice Set the given operators as ineligible for rewards.\\n  /// The operators can restore their eligibility at the given time.\\n  function setIneligible(uint32[] memory operators, uint256 until) internal {\\n    OperatorRewards memory o = OperatorRewards(0, 0, 0, 0);\\n    uint96 globalAcc = globalRewardAccumulator;\\n    uint96 accrued = 0;\\n    // Record ineligibility as seconds after contract creation\\n    uint32 _until = uint32(until - ineligibleOffsetStart);\\n\\n    for (uint256 i = 0; i < operators.length; i++) {\\n      uint32 operator = operators[i];\\n      OperatorRewards storage r = operatorRewards[operator];\\n      o.available = r.available;\\n      o.accumulated = r.accumulated;\\n      o.ineligibleUntil = r.ineligibleUntil;\\n      o.weight = r.weight;\\n\\n      if (o.ineligibleUntil != 0) {\\n        // If operator is already ineligible,\\n        // don't earn rewards or shorten its ineligibility\\n        if (o.ineligibleUntil < _until) {\\n          o.ineligibleUntil = _until;\\n        }\\n      } else {\\n        // The operator becomes ineligible -> earn rewards\\n        o.ineligibleUntil = _until;\\n        accrued = (globalAcc - o.accumulated) * uint96(o.weight);\\n        o.available += accrued;\\n      }\\n      o.accumulated = globalAcc;\\n\\n      r.available = o.available;\\n      r.accumulated = o.accumulated;\\n      r.ineligibleUntil = o.ineligibleUntil;\\n      r.weight = o.weight;\\n    }\\n  }\\n\\n  /// @notice Restore the given operator's eligibility for rewards.\\n  function restoreEligibility(uint32 operator) internal {\\n    // solhint-disable-next-line not-rely-on-time\\n    require(canRestoreRewardEligibility(operator), \\\"Operator still ineligible\\\");\\n    uint96 acc = globalRewardAccumulator;\\n    OperatorRewards memory o = operatorRewards[operator];\\n    uint96 accruedRewards = (acc - o.accumulated) * uint96(o.weight);\\n    ineligibleEarnedRewards += accruedRewards;\\n    o.accumulated = acc;\\n    o.ineligibleUntil = 0;\\n    operatorRewards[operator] = o;\\n  }\\n\\n  /// @notice Returns the amount of rewards currently available for withdrawal\\n  ///         for the given operator.\\n  function availableRewards(uint32 operator) internal view returns (uint96) {\\n    uint96 acc = globalRewardAccumulator;\\n    OperatorRewards memory o = operatorRewards[operator];\\n    if (o.ineligibleUntil == 0) {\\n      // If operator is not ineligible, calculate newly accrued rewards and add\\n      // them to the available ones, calculated during the last update.\\n      uint96 accruedRewards = (acc - o.accumulated) * uint96(o.weight);\\n      return o.available + accruedRewards;\\n    } else {\\n      // If ineligible, return only the rewards calculated during the last\\n      // update.\\n      return o.available;\\n    }\\n  }\\n}\\n\",\"keccak256\":\"0x608d5d04411469682191b8fe26bbc0d925e1f950e24ac45c272b74e3df2e91cf\"},\"@keep-network/sortition-pools/contracts/SortitionPool.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nimport \\\"@thesis/solidity-contracts/contracts/token/IERC20WithPermit.sol\\\";\\nimport \\\"@thesis/solidity-contracts/contracts/token/IReceiveApproval.sol\\\";\\n\\nimport \\\"@openzeppelin/contracts/access/Ownable.sol\\\";\\n\\nimport \\\"./RNG.sol\\\";\\nimport \\\"./SortitionTree.sol\\\";\\nimport \\\"./Rewards.sol\\\";\\n\\n/// @title Sortition Pool\\n/// @notice A logarithmic data structure used to store the pool of eligible\\n/// operators weighted by their stakes. It allows to select a group of operators\\n/// based on the provided pseudo-random seed.\\ncontract SortitionPool is SortitionTree, Rewards, Ownable, IReceiveApproval {\\n  using Branch for uint256;\\n  using Leaf for uint256;\\n  using Position for uint256;\\n\\n  IERC20WithPermit public immutable rewardToken;\\n\\n  uint256 public immutable poolWeightDivisor;\\n\\n  bool public isLocked;\\n\\n  event IneligibleForRewards(uint32[] ids, uint256 until);\\n\\n  event RewardEligibilityRestored(address indexed operator, uint32 indexed id);\\n\\n  /// @notice Reverts if called while pool is locked.\\n  modifier onlyUnlocked() {\\n    require(!isLocked, \\\"Sortition pool locked\\\");\\n    _;\\n  }\\n\\n  /// @notice Reverts if called while pool is unlocked.\\n  modifier onlyLocked() {\\n    require(isLocked, \\\"Sortition pool unlocked\\\");\\n    _;\\n  }\\n\\n  constructor(IERC20WithPermit _rewardToken, uint256 _poolWeightDivisor) {\\n    rewardToken = _rewardToken;\\n    poolWeightDivisor = _poolWeightDivisor;\\n  }\\n\\n  function receiveApproval(\\n    address sender,\\n    uint256 amount,\\n    address token,\\n    bytes calldata\\n  ) external override {\\n    require(token == address(rewardToken), \\\"Unsupported token\\\");\\n    rewardToken.transferFrom(sender, address(this), amount);\\n    Rewards.addRewards(uint96(amount), uint32(root.sumWeight()));\\n  }\\n\\n  /// @notice Withdraws all available rewards for the given operator to the\\n  ///         given beneficiary.\\n  /// @dev Can be called only be the owner. Does not validate if the provided\\n  ///      beneficiary is associated with the provided operator - this needs to\\n  ///      be done by the owner calling this function.\\n  /// @return The amount of rewards withdrawn in this call.\\n  function withdrawRewards(address operator, address beneficiary)\\n    public\\n    onlyOwner\\n    returns (uint96)\\n  {\\n    uint32 id = getOperatorID(operator);\\n    Rewards.updateOperatorRewards(id, uint32(getPoolWeight(operator)));\\n    uint96 earned = Rewards.withdrawOperatorRewards(id);\\n    rewardToken.transfer(beneficiary, uint256(earned));\\n    return earned;\\n  }\\n\\n  /// @notice Withdraws rewards not allocated to operators marked as ineligible\\n  ///         to the given recipient address.\\n  /// @dev Can be called only by the owner.\\n  function withdrawIneligible(address recipient) public onlyOwner {\\n    uint96 earned = Rewards.withdrawIneligibleRewards();\\n    rewardToken.transfer(recipient, uint256(earned));\\n  }\\n\\n  /// @notice Locks the sortition pool. In locked state, members cannot be\\n  ///         inserted and removed from the pool. Members statuses cannot\\n  ///         be updated as well.\\n  /// @dev Can be called only by the contract owner.\\n  function lock() public onlyOwner {\\n    isLocked = true;\\n  }\\n\\n  /// @notice Unlocks the sortition pool. Removes all restrictions set by\\n  ///         the `lock` method.\\n  /// @dev Can be called only by the contract owner.\\n  function unlock() public onlyOwner {\\n    isLocked = false;\\n  }\\n\\n  /// @notice Inserts an operator to the pool. Reverts if the operator is\\n  /// already present.\\n  /// @dev Can be called only by the contract owner.\\n  /// @param operator Address of the inserted operator.\\n  /// @param authorizedStake Inserted operator's authorized stake for the application.\\n  function insertOperator(address operator, uint256 authorizedStake)\\n    public\\n    onlyOwner\\n    onlyUnlocked\\n  {\\n    uint256 weight = getWeight(authorizedStake);\\n    require(weight > 0, \\\"Operator not eligible\\\");\\n\\n    _insertOperator(operator, weight);\\n    uint32 id = getOperatorID(operator);\\n    Rewards.updateOperatorRewards(id, uint32(weight));\\n  }\\n\\n  /// @notice Update the operator's weight if present and eligible,\\n  /// or remove from the pool if present and ineligible.\\n  /// @dev Can be called only by the contract owner.\\n  /// @param operator Address of the updated operator.\\n  /// @param authorizedStake Operator's authorized stake for the application.\\n  function updateOperatorStatus(address operator, uint256 authorizedStake)\\n    public\\n    onlyOwner\\n    onlyUnlocked\\n  {\\n    uint256 weight = getWeight(authorizedStake);\\n\\n    uint32 id = getOperatorID(operator);\\n    Rewards.updateOperatorRewards(id, uint32(weight));\\n\\n    if (weight == 0) {\\n      _removeOperator(operator);\\n    } else {\\n      updateOperator(operator, weight);\\n    }\\n  }\\n\\n  function setRewardIneligibility(uint32[] calldata operators, uint256 until)\\n    public\\n    onlyOwner\\n  {\\n    Rewards.setIneligible(operators, until);\\n    emit IneligibleForRewards(operators, until);\\n  }\\n\\n  function restoreRewardEligibility(address operator) public {\\n    uint32 id = getOperatorID(operator);\\n    Rewards.restoreEligibility(id);\\n    emit RewardEligibilityRestored(operator, id);\\n  }\\n\\n  /// @notice Returns the amount of rewards withdrawable for the given operator.\\n  function getAvailableRewards(address operator) public view returns (uint96) {\\n    uint32 id = getOperatorID(operator);\\n    return availableRewards(id);\\n  }\\n\\n  /// @notice Return whether the operator is present in the pool.\\n  function isOperatorInPool(address operator) public view returns (bool) {\\n    return getFlaggedLeafPosition(operator) != 0;\\n  }\\n\\n  /// @notice Return whether the operator's weight in the pool\\n  /// matches their eligible weight.\\n  function isOperatorUpToDate(address operator, uint256 authorizedStake)\\n    public\\n    view\\n    returns (bool)\\n  {\\n    return getWeight(authorizedStake) == getPoolWeight(operator);\\n  }\\n\\n  /// @notice Return the weight of the operator in the pool,\\n  /// which may or may not be out of date.\\n  function getPoolWeight(address operator) public view returns (uint256) {\\n    uint256 flaggedPosition = getFlaggedLeafPosition(operator);\\n    if (flaggedPosition == 0) {\\n      return 0;\\n    } else {\\n      uint256 leafPosition = flaggedPosition.unsetFlag();\\n      uint256 leafWeight = getLeafWeight(leafPosition);\\n      return leafWeight;\\n    }\\n  }\\n\\n  /// @notice Selects a new group of operators of the provided size based on\\n  /// the provided pseudo-random seed. At least one operator has to be\\n  /// registered in the pool, otherwise the function fails reverting the\\n  /// transaction.\\n  /// @param groupSize Size of the requested group\\n  /// @param seed Pseudo-random number used to select operators to group\\n  /// @return selected Members of the selected group\\n  function selectGroup(uint256 groupSize, bytes32 seed)\\n    public\\n    view\\n    onlyLocked\\n    returns (uint32[] memory)\\n  {\\n    uint256 _root = root;\\n\\n    bytes32 rngState = seed;\\n    uint256 rngRange = _root.sumWeight();\\n    require(rngRange > 0, \\\"Not enough operators in pool\\\");\\n    uint256 currentIndex;\\n\\n    uint256 bits = RNG.bitsRequired(rngRange);\\n\\n    uint32[] memory selected = new uint32[](groupSize);\\n\\n    for (uint256 i = 0; i < groupSize; i++) {\\n      (currentIndex, rngState) = RNG.getIndex(rngRange, rngState, bits);\\n\\n      uint256 leafPosition = pickWeightedLeaf(currentIndex, _root);\\n\\n      uint256 leaf = leaves[leafPosition];\\n      selected[i] = leaf.id();\\n    }\\n    return selected;\\n  }\\n\\n  function getWeight(uint256 authorization) internal view returns (uint256) {\\n    return authorization / poolWeightDivisor;\\n  }\\n}\\n\",\"keccak256\":\"0x93d8bd42838147a475cb4c0086e3175714c9438bc5515fd6065577958d5b2b73\"},\"@keep-network/sortition-pools/contracts/SortitionTree.sol\":{\"content\":\"pragma solidity 0.8.9;\\n\\nimport \\\"./Branch.sol\\\";\\nimport \\\"./Position.sol\\\";\\nimport \\\"./Leaf.sol\\\";\\n\\ncontract SortitionTree {\\n  using Branch for uint256;\\n  using Position for uint256;\\n  using Leaf for uint256;\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Parameters for configuration\\n\\n  // How many bits a position uses per level of the tree;\\n  // each branch of the tree contains 2**SLOT_BITS slots.\\n  uint256 private constant SLOT_BITS = 3;\\n  uint256 private constant LEVELS = 7;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  ////////////////////////////////////////////////////////////////////////////\\n  // Derived constants, do not touch\\n  uint256 private constant SLOT_COUNT = 2**SLOT_BITS;\\n  uint256 private constant SLOT_WIDTH = 256 / SLOT_COUNT;\\n  uint256 private constant SLOT_MAX = (2**SLOT_WIDTH) - 1;\\n  uint256 private constant POOL_CAPACITY = SLOT_COUNT**LEVELS;\\n  ////////////////////////////////////////////////////////////////////////////\\n\\n  // implicit tree\\n  // root 8\\n  // level2 64\\n  // level3 512\\n  // level4 4k\\n  // level5 32k\\n  // level6 256k\\n  // level7 2M\\n  uint256 internal root;\\n  mapping(uint256 => mapping(uint256 => uint256)) internal branches;\\n  mapping(uint256 => uint256) internal leaves;\\n\\n  // the flagged (see setFlag() and unsetFlag() in Position.sol) positions\\n  // of all operators present in the pool\\n  mapping(address => uint256) internal flaggedLeafPosition;\\n\\n  // the leaf after the rightmost occupied leaf of each stack\\n  uint256 internal rightmostLeaf;\\n  // the empty leaves in each stack\\n  // between 0 and the rightmost occupied leaf\\n  uint256[] internal emptyLeaves;\\n\\n  // Each operator has an uint32 ID number\\n  // which is allocated when they first join the pool\\n  // and remains unchanged even if they leave and rejoin the pool.\\n  mapping(address => uint32) internal operatorID;\\n  // The idAddress array records the address corresponding to each ID number.\\n  // The ID number 0 is initialized with a zero address and is not used.\\n  address[] internal idAddress;\\n\\n  constructor() {\\n    root = 0;\\n    rightmostLeaf = 0;\\n    idAddress.push();\\n  }\\n\\n  // Return the ID number of the given operator address.\\n  // An ID number of 0 means the operator has not been allocated an ID number yet.\\n  function getOperatorID(address operator) public view returns (uint32) {\\n    return operatorID[operator];\\n  }\\n\\n  // Get the operator address corresponding to the given ID number.\\n  // An empty address means the ID number has not been allocated yet.\\n  function getIDOperator(uint32 id) public view returns (address) {\\n    return idAddress.length > id ? idAddress[id] : address(0);\\n  }\\n\\n  // Gets the operator addresses corresponding to the given ID numbers.\\n  // An empty address means the ID number has not been allocated yet.\\n  // This function works just like getIDOperator except that it allows to fetch\\n  // operator addresses for multiple IDs in one call.\\n  function getIDOperators(uint32[] calldata ids)\\n    public\\n    view\\n    returns (address[] memory)\\n  {\\n    uint256 idCount = idAddress.length;\\n\\n    address[] memory operators = new address[](ids.length);\\n    for (uint256 i = 0; i < ids.length; i++) {\\n      uint32 id = ids[i];\\n      operators[i] = idCount > id ? idAddress[id] : address(0);\\n    }\\n    return operators;\\n  }\\n\\n  // checks if operator is already registered in the pool\\n  function isOperatorRegistered(address operator) public view returns (bool) {\\n    return getFlaggedLeafPosition(operator) != 0;\\n  }\\n\\n  // Sum the number of operators in each trunk\\n  function operatorsInPool() public view returns (uint256) {\\n    // Get the number of leaves that might be occupied;\\n    // if `rightmostLeaf` equals `firstLeaf()` the tree must be empty,\\n    // otherwise the difference between these numbers\\n    // gives the number of leaves that may be occupied.\\n    uint256 nPossiblyUsedLeaves = rightmostLeaf;\\n    // Get the number of empty leaves\\n    // not accounted for by the `rightmostLeaf`\\n    uint256 nEmptyLeaves = emptyLeaves.length;\\n\\n    return (nPossiblyUsedLeaves - nEmptyLeaves);\\n  }\\n\\n  function totalWeight() public view returns (uint256) {\\n    return root.sumWeight();\\n  }\\n\\n  // Give the operator a new ID number\\n  // Does not check if the operator already has an ID number\\n  function allocateOperatorID(address operator) internal returns (uint256) {\\n    uint256 id = idAddress.length;\\n\\n    require(id <= type(uint32).max, \\\"Pool capacity exceeded\\\");\\n\\n    operatorID[operator] = uint32(id);\\n    idAddress.push(operator);\\n    return id;\\n  }\\n\\n  function _insertOperator(address operator, uint256 weight) internal {\\n    require(\\n      !isOperatorRegistered(operator),\\n      \\\"Operator is already registered in the pool\\\"\\n    );\\n\\n    uint256 id = getOperatorID(operator);\\n    if (id == 0) {\\n      id = allocateOperatorID(operator);\\n    }\\n\\n    uint256 position = getEmptyLeafPosition();\\n    // Record the block the operator was inserted in\\n    uint256 theLeaf = Leaf.make(operator, block.number, id);\\n\\n    root = setLeaf(position, theLeaf, weight, root);\\n\\n    // Without position flags,\\n    // the position 0x000000 would be treated as empty\\n    flaggedLeafPosition[operator] = position.setFlag();\\n  }\\n\\n  function _removeOperator(address operator) internal {\\n    uint256 flaggedPosition = getFlaggedLeafPosition(operator);\\n    require(flaggedPosition != 0, \\\"Operator is not registered in the pool\\\");\\n    uint256 unflaggedPosition = flaggedPosition.unsetFlag();\\n    root = removeLeaf(unflaggedPosition, root);\\n    removeLeafPositionRecord(operator);\\n  }\\n\\n  function updateOperator(address operator, uint256 weight) internal {\\n    require(\\n      isOperatorRegistered(operator),\\n      \\\"Operator is not registered in the pool\\\"\\n    );\\n\\n    uint256 flaggedPosition = getFlaggedLeafPosition(operator);\\n    uint256 unflaggedPosition = flaggedPosition.unsetFlag();\\n    root = updateLeaf(unflaggedPosition, weight, root);\\n  }\\n\\n  function removeLeafPositionRecord(address operator) internal {\\n    flaggedLeafPosition[operator] = 0;\\n  }\\n\\n  function removeLeaf(uint256 position, uint256 _root)\\n    internal\\n    returns (uint256)\\n  {\\n    uint256 rightmostSubOne = rightmostLeaf - 1;\\n    bool isRightmost = position == rightmostSubOne;\\n\\n    uint256 newRoot = setLeaf(position, 0, 0, _root);\\n\\n    if (isRightmost) {\\n      rightmostLeaf = rightmostSubOne;\\n    } else {\\n      emptyLeaves.push(position);\\n    }\\n    return newRoot;\\n  }\\n\\n  function updateLeaf(\\n    uint256 position,\\n    uint256 weight,\\n    uint256 _root\\n  ) internal returns (uint256) {\\n    if (getLeafWeight(position) != weight) {\\n      return updateTree(position, weight, _root);\\n    } else {\\n      return _root;\\n    }\\n  }\\n\\n  function setLeaf(\\n    uint256 position,\\n    uint256 theLeaf,\\n    uint256 leafWeight,\\n    uint256 _root\\n  ) internal returns (uint256) {\\n    // set leaf\\n    leaves[position] = theLeaf;\\n\\n    return (updateTree(position, leafWeight, _root));\\n  }\\n\\n  function updateTree(\\n    uint256 position,\\n    uint256 weight,\\n    uint256 _root\\n  ) internal returns (uint256) {\\n    uint256 childSlot;\\n    uint256 treeNode;\\n    uint256 newNode;\\n    uint256 nodeWeight = weight;\\n\\n    uint256 parent = position;\\n    // set levels 7 to 2\\n    for (uint256 level = LEVELS; level >= 2; level--) {\\n      childSlot = parent.slot();\\n      parent = parent.parent();\\n      treeNode = branches[level][parent];\\n      newNode = treeNode.setSlot(childSlot, nodeWeight);\\n      branches[level][parent] = newNode;\\n      nodeWeight = newNode.sumWeight();\\n    }\\n\\n    // set level Root\\n    childSlot = parent.slot();\\n    return _root.setSlot(childSlot, nodeWeight);\\n  }\\n\\n  function getEmptyLeafPosition() internal returns (uint256) {\\n    uint256 rLeaf = rightmostLeaf;\\n    bool spaceOnRight = (rLeaf + 1) < POOL_CAPACITY;\\n    if (spaceOnRight) {\\n      rightmostLeaf = rLeaf + 1;\\n      return rLeaf;\\n    } else {\\n      uint256 emptyLeafCount = emptyLeaves.length;\\n      require(emptyLeafCount > 0, \\\"Pool is full\\\");\\n      uint256 emptyLeaf = emptyLeaves[emptyLeafCount - 1];\\n      emptyLeaves.pop();\\n      return emptyLeaf;\\n    }\\n  }\\n\\n  function getFlaggedLeafPosition(address operator)\\n    internal\\n    view\\n    returns (uint256)\\n  {\\n    return flaggedLeafPosition[operator];\\n  }\\n\\n  function getLeafWeight(uint256 position) internal view returns (uint256) {\\n    uint256 slot = position.slot();\\n    uint256 parent = position.parent();\\n    uint256 node = branches[LEVELS][parent];\\n    return node.getSlot(slot);\\n  }\\n\\n  function pickWeightedLeaf(uint256 index, uint256 _root)\\n    internal\\n    view\\n    returns (uint256 leafPosition)\\n  {\\n    uint256 currentIndex = index;\\n    uint256 currentNode = _root;\\n    uint256 currentPosition = 0;\\n    uint256 currentSlot;\\n\\n    require(index < currentNode.sumWeight(), \\\"Index exceeds weight\\\");\\n\\n    // get root slot\\n    (currentSlot, currentIndex) = currentNode.pickWeightedSlot(currentIndex);\\n\\n    // get slots from levels 2 to 7\\n    for (uint256 level = 2; level <= LEVELS; level++) {\\n      currentPosition = currentPosition.child(currentSlot);\\n      currentNode = branches[level][currentPosition];\\n      (currentSlot, currentIndex) = currentNode.pickWeightedSlot(currentIndex);\\n    }\\n\\n    // get leaf position\\n    leafPosition = currentPosition.child(currentSlot);\\n  }\\n}\\n\",\"keccak256\":\"0x706033e40b631b2bb1d24b230f770c51546c7476605dd1f87475013673c36367\"},\"@openzeppelin/contracts/access/Ownable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"../utils/Context.sol\\\";\\n\\n/**\\n * @dev Contract module which provides a basic access control mechanism, where\\n * there is an account (an owner) that can be granted exclusive access to\\n * specific functions.\\n *\\n * By default, the owner account will be the one that deploys the contract. This\\n * can later be changed with {transferOwnership}.\\n *\\n * This module is used through inheritance. It will make available the modifier\\n * `onlyOwner`, which can be applied to your functions to restrict their use to\\n * the owner.\\n */\\nabstract contract Ownable is Context {\\n    address private _owner;\\n\\n    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\\n\\n    /**\\n     * @dev Initializes the contract setting the deployer as the initial owner.\\n     */\\n    constructor() {\\n        _setOwner(_msgSender());\\n    }\\n\\n    /**\\n     * @dev Returns the address of the current owner.\\n     */\\n    function owner() public view virtual returns (address) {\\n        return _owner;\\n    }\\n\\n    /**\\n     * @dev Throws if called by any account other than the owner.\\n     */\\n    modifier onlyOwner() {\\n        require(owner() == _msgSender(), \\\"Ownable: caller is not the owner\\\");\\n        _;\\n    }\\n\\n    /**\\n     * @dev Leaves the contract without owner. It will not be possible to call\\n     * `onlyOwner` functions anymore. Can only be called by the current owner.\\n     *\\n     * NOTE: Renouncing ownership will leave the contract without an owner,\\n     * thereby removing any functionality that is only available to the owner.\\n     */\\n    function renounceOwnership() public virtual onlyOwner {\\n        _setOwner(address(0));\\n    }\\n\\n    /**\\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\\n     * Can only be called by the current owner.\\n     */\\n    function transferOwnership(address newOwner) public virtual onlyOwner {\\n        require(newOwner != address(0), \\\"Ownable: new owner is the zero address\\\");\\n        _setOwner(newOwner);\\n    }\\n\\n    function _setOwner(address newOwner) private {\\n        address oldOwner = _owner;\\n        _owner = newOwner;\\n        emit OwnershipTransferred(oldOwner, newOwner);\\n    }\\n}\\n\",\"keccak256\":\"0x6bb804a310218875e89d12c053e94a13a4607cdf7cc2052f3e52bd32a0dc50a1\",\"license\":\"MIT\"},\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Interface of the ERC20 standard as defined in the EIP.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Returns the amount of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the amount of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves `amount` tokens from the caller's account to `recipient`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address recipient, uint256 amount) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 amount) external returns (bool);\\n\\n    /**\\n     * @dev Moves `amount` tokens from `sender` to `recipient` using the\\n     * allowance mechanism. `amount` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(\\n        address sender,\\n        address recipient,\\n        uint256 amount\\n    ) external returns (bool);\\n\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n}\\n\",\"keccak256\":\"0x027b891937d20ccf213fdb9c31531574256de774bda99d3a70ecef6e1913ed2a\",\"license\":\"MIT\"},\"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\nimport \\\"../IERC20.sol\\\";\\n\\n/**\\n * @dev Interface for the optional metadata functions from the ERC20 standard.\\n *\\n * _Available since v4.1._\\n */\\ninterface IERC20Metadata is IERC20 {\\n    /**\\n     * @dev Returns the name of the token.\\n     */\\n    function name() external view returns (string memory);\\n\\n    /**\\n     * @dev Returns the symbol of the token.\\n     */\\n    function symbol() external view returns (string memory);\\n\\n    /**\\n     * @dev Returns the decimals places of the token.\\n     */\\n    function decimals() external view returns (uint8);\\n}\\n\",\"keccak256\":\"0x83fe24f5c04a56091e50f4a345ff504c8bff658a76d4c43b16878c8f940c53b2\",\"license\":\"MIT\"},\"@openzeppelin/contracts/utils/Context.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/*\\n * @dev Provides information about the current execution context, including the\\n * sender of the transaction and its data. While these are generally available\\n * via msg.sender and msg.data, they should not be accessed in such a direct\\n * manner, since when dealing with meta-transactions the account sending and\\n * paying for execution may not be the actual sender (as far as an application\\n * is concerned).\\n *\\n * This contract is only required for intermediate, library-like contracts.\\n */\\nabstract contract Context {\\n    function _msgSender() internal view virtual returns (address) {\\n        return msg.sender;\\n    }\\n\\n    function _msgData() internal view virtual returns (bytes calldata) {\\n        return msg.data;\\n    }\\n}\\n\",\"keccak256\":\"0x95098bd1d9c8dec4d80d3dedb88a0d949fa0d740ee99f2aa466bc308216ca6d5\",\"license\":\"MIT\"},\"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.\\n *\\n * These functions can be used to verify that a message was signed by the holder\\n * of the private keys of a given address.\\n */\\nlibrary ECDSA {\\n    /**\\n     * @dev Returns the address that signed a hashed message (`hash`) with\\n     * `signature`. This address can then be used for verification purposes.\\n     *\\n     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:\\n     * this function rejects them by requiring the `s` value to be in the lower\\n     * half order, and the `v` value to be either 27 or 28.\\n     *\\n     * IMPORTANT: `hash` _must_ be the result of a hash operation for the\\n     * verification to be secure: it is possible to craft signatures that\\n     * recover to arbitrary addresses for non-hashed data. A safe way to ensure\\n     * this is by receiving a hash of the original message (which may otherwise\\n     * be too long), and then calling {toEthSignedMessageHash} on it.\\n     *\\n     * Documentation for signature generation:\\n     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]\\n     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]\\n     */\\n    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {\\n        // Check the signature length\\n        // - case 65: r,s,v signature (standard)\\n        // - case 64: r,vs signature (cf https://eips.ethereum.org/EIPS/eip-2098) _Available since v4.1._\\n        if (signature.length == 65) {\\n            bytes32 r;\\n            bytes32 s;\\n            uint8 v;\\n            // ecrecover takes the signature parameters, and the only way to get them\\n            // currently is to use assembly.\\n            assembly {\\n                r := mload(add(signature, 0x20))\\n                s := mload(add(signature, 0x40))\\n                v := byte(0, mload(add(signature, 0x60)))\\n            }\\n            return recover(hash, v, r, s);\\n        } else if (signature.length == 64) {\\n            bytes32 r;\\n            bytes32 vs;\\n            // ecrecover takes the signature parameters, and the only way to get them\\n            // currently is to use assembly.\\n            assembly {\\n                r := mload(add(signature, 0x20))\\n                vs := mload(add(signature, 0x40))\\n            }\\n            return recover(hash, r, vs);\\n        } else {\\n            revert(\\\"ECDSA: invalid signature length\\\");\\n        }\\n    }\\n\\n    /**\\n     * @dev Overload of {ECDSA-recover} that receives the `r` and `vs` short-signature fields separately.\\n     *\\n     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]\\n     *\\n     * _Available since v4.2._\\n     */\\n    function recover(\\n        bytes32 hash,\\n        bytes32 r,\\n        bytes32 vs\\n    ) internal pure returns (address) {\\n        bytes32 s;\\n        uint8 v;\\n        assembly {\\n            s := and(vs, 0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff)\\n            v := add(shr(255, vs), 27)\\n        }\\n        return recover(hash, v, r, s);\\n    }\\n\\n    /**\\n     * @dev Overload of {ECDSA-recover} that receives the `v`, `r` and `s` signature fields separately.\\n     */\\n    function recover(\\n        bytes32 hash,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    ) internal pure returns (address) {\\n        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature\\n        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines\\n        // the valid range for s in (281): 0 < s < secp256k1n \\u00f7 2 + 1, and for v in (282): v \\u2208 {27, 28}. Most\\n        // signatures from current libraries generate a unique signature with an s-value in the lower half order.\\n        //\\n        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value\\n        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or\\n        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept\\n        // these malleable signatures as well.\\n        require(\\n            uint256(s) <= 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0,\\n            \\\"ECDSA: invalid signature 's' value\\\"\\n        );\\n        require(v == 27 || v == 28, \\\"ECDSA: invalid signature 'v' value\\\");\\n\\n        // If the signature is valid (and not malleable), return the signer address\\n        address signer = ecrecover(hash, v, r, s);\\n        require(signer != address(0), \\\"ECDSA: invalid signature\\\");\\n\\n        return signer;\\n    }\\n\\n    /**\\n     * @dev Returns an Ethereum Signed Message, created from a `hash`. This\\n     * produces hash corresponding to the one signed with the\\n     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]\\n     * JSON-RPC method as part of EIP-191.\\n     *\\n     * See {recover}.\\n     */\\n    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32) {\\n        // 32 is the length in bytes of hash,\\n        // enforced by the type signature above\\n        return keccak256(abi.encodePacked(\\\"\\\\x19Ethereum Signed Message:\\\\n32\\\", hash));\\n    }\\n\\n    /**\\n     * @dev Returns an Ethereum Signed Typed Data, created from a\\n     * `domainSeparator` and a `structHash`. This produces hash corresponding\\n     * to the one signed with the\\n     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]\\n     * JSON-RPC method as part of EIP-712.\\n     *\\n     * See {recover}.\\n     */\\n    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32) {\\n        return keccak256(abi.encodePacked(\\\"\\\\x19\\\\x01\\\", domainSeparator, structHash));\\n    }\\n}\\n\",\"keccak256\":\"0x828774372910d18e7337bc31a288d786748af4cd9da80222467e486ed1d569ab\",\"license\":\"MIT\"},\"@openzeppelin/contracts/utils/math/Math.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.0;\\n\\n/**\\n * @dev Standard math utilities missing in the Solidity language.\\n */\\nlibrary Math {\\n    /**\\n     * @dev Returns the largest of two numbers.\\n     */\\n    function max(uint256 a, uint256 b) internal pure returns (uint256) {\\n        return a >= b ? a : b;\\n    }\\n\\n    /**\\n     * @dev Returns the smallest of two numbers.\\n     */\\n    function min(uint256 a, uint256 b) internal pure returns (uint256) {\\n        return a < b ? a : b;\\n    }\\n\\n    /**\\n     * @dev Returns the average of two numbers. The result is rounded towards\\n     * zero.\\n     */\\n    function average(uint256 a, uint256 b) internal pure returns (uint256) {\\n        // (a + b) / 2 can overflow, so we distribute.\\n        return (a / 2) + (b / 2) + (((a % 2) + (b % 2)) / 2);\\n    }\\n\\n    /**\\n     * @dev Returns the ceiling of the division of two numbers.\\n     *\\n     * This differs from standard division with `/` in that it rounds up instead\\n     * of rounding down.\\n     */\\n    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {\\n        // (a + b - 1) / b can overflow on addition, so we distribute.\\n        return a / b + (a % b == 0 ? 0 : 1);\\n    }\\n}\\n\",\"keccak256\":\"0x2cc1535d318fe533ffa4ad30de28f5abed305ff748bc72d0344072ac10007e29\",\"license\":\"MIT\"},\"@thesis/solidity-contracts/contracts/token/IApproveAndCall.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.4;\\n\\n/// @notice An interface that should be implemented by tokens supporting\\n///         `approveAndCall`/`receiveApproval` pattern.\\ninterface IApproveAndCall {\\n    /// @notice Executes `receiveApproval` function on spender as specified in\\n    ///         `IReceiveApproval` interface. Approves spender to withdraw from\\n    ///         the caller multiple times, up to the `amount`. If this\\n    ///         function is called again, it overwrites the current allowance\\n    ///         with `amount`. Reverts if the approval reverted or if\\n    ///         `receiveApproval` call on the spender reverted.\\n    function approveAndCall(\\n        address spender,\\n        uint256 amount,\\n        bytes memory extraData\\n    ) external returns (bool);\\n}\\n\",\"keccak256\":\"0x393d18ef81a57dcc96fff4c340cc2945deaebb37b9796c322cf2bc96872c3df8\",\"license\":\"MIT\"},\"@thesis/solidity-contracts/contracts/token/IERC20WithPermit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.4;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"@openzeppelin/contracts/token/ERC20/extensions/IERC20Metadata.sol\\\";\\n\\nimport \\\"./IApproveAndCall.sol\\\";\\n\\n/// @title  IERC20WithPermit\\n/// @notice Burnable ERC20 token with EIP2612 permit functionality. User can\\n///         authorize a transfer of their token with a signature conforming\\n///         EIP712 standard instead of an on-chain transaction from their\\n///         address. Anyone can submit this signature on the user's behalf by\\n///         calling the permit function, as specified in EIP2612 standard,\\n///         paying gas fees, and possibly performing other actions in the same\\n///         transaction.\\ninterface IERC20WithPermit is IERC20, IERC20Metadata, IApproveAndCall {\\n    /// @notice EIP2612 approval made with secp256k1 signature.\\n    ///         Users can authorize a transfer of their tokens with a signature\\n    ///         conforming EIP712 standard, rather than an on-chain transaction\\n    ///         from their address. Anyone can submit this signature on the\\n    ///         user's behalf by calling the permit function, paying gas fees,\\n    ///         and possibly performing other actions in the same transaction.\\n    /// @dev    The deadline argument can be set to `type(uint256).max to create\\n    ///         permits that effectively never expire.\\n    function permit(\\n        address owner,\\n        address spender,\\n        uint256 amount,\\n        uint256 deadline,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    ) external;\\n\\n    /// @notice Destroys `amount` tokens from the caller.\\n    function burn(uint256 amount) external;\\n\\n    /// @notice Destroys `amount` of tokens from `account`, deducting the amount\\n    ///         from caller's allowance.\\n    function burnFrom(address account, uint256 amount) external;\\n\\n    /// @notice Returns hash of EIP712 Domain struct with the token name as\\n    ///         a signing domain and token contract as a verifying contract.\\n    ///         Used to construct EIP2612 signature provided to `permit`\\n    ///         function.\\n    /* solhint-disable-next-line func-name-mixedcase */\\n    function DOMAIN_SEPARATOR() external view returns (bytes32);\\n\\n    /// @notice Returns the current nonce for EIP2612 permission for the\\n    ///         provided token owner for a replay protection. Used to construct\\n    ///         EIP2612 signature provided to `permit` function.\\n    function nonce(address owner) external view returns (uint256);\\n\\n    /// @notice Returns EIP2612 Permit message hash. Used to construct EIP2612\\n    ///         signature provided to `permit` function.\\n    /* solhint-disable-next-line func-name-mixedcase */\\n    function PERMIT_TYPEHASH() external pure returns (bytes32);\\n}\\n\",\"keccak256\":\"0xdac9a5086c19a7128b505a7be1ab0ac1aa314f6989cb88d2417e9d7383f89fa9\",\"license\":\"MIT\"},\"@thesis/solidity-contracts/contracts/token/IReceiveApproval.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.4;\\n\\n/// @notice An interface that should be implemented by contracts supporting\\n///         `approveAndCall`/`receiveApproval` pattern.\\ninterface IReceiveApproval {\\n    /// @notice Receives approval to spend tokens. Called as a result of\\n    ///         `approveAndCall` call on the token.\\n    function receiveApproval(\\n        address from,\\n        uint256 amount,\\n        address token,\\n        bytes calldata extraData\\n    ) external;\\n}\\n\",\"keccak256\":\"0x6a30d83ad230548b1e7839737affc8489a035314209de14b89dbef7fb0f66395\",\"license\":\"MIT\"},\"contracts/bank/Bank.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@openzeppelin/contracts/access/Ownable.sol\\\";\\n\\nimport \\\"../vault/IVault.sol\\\";\\n\\n/// @title Bitcoin Bank\\n/// @notice Bank is a central component tracking Bitcoin balances. Balances can\\n///         be transferred between holders and holders can approve their\\n///         balances to be spent by others. Balances in the Bank are updated for\\n///         depositors who deposit their Bitcoin into the Bridge and only the\\n///         Bridge can increase balances.\\n/// @dev Bank is a governable contract and the Governance can upgrade the Bridge\\n///      address.\\ncontract Bank is Ownable {\\n    address public bridge;\\n\\n    /// @notice The balance of a given account in the Bank. Zero by default.\\n    mapping(address => uint256) public balanceOf;\\n\\n    /// @notice The remaining amount of balance a spender will be\\n    ///         allowed to transfer on behalf of an owner using\\n    ///         `transferBalanceFrom`. Zero by default.\\n    mapping(address => mapping(address => uint256)) public allowance;\\n\\n    /// @notice Returns the current nonce for EIP2612 permission for the\\n    ///         provided balance owner for a replay protection. Used to\\n    ///         construct EIP2612 signature provided to `permit` function.\\n    mapping(address => uint256) public nonce;\\n\\n    uint256 public immutable cachedChainId;\\n    bytes32 public immutable cachedDomainSeparator;\\n\\n    /// @notice Returns EIP2612 Permit message hash. Used to construct EIP2612\\n    ///         signature provided to `permit` function.\\n    bytes32 public constant PERMIT_TYPEHASH =\\n        keccak256(\\n            \\\"Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)\\\"\\n        );\\n\\n    event BalanceTransferred(\\n        address indexed from,\\n        address indexed to,\\n        uint256 amount\\n    );\\n\\n    event BalanceApproved(\\n        address indexed owner,\\n        address indexed spender,\\n        uint256 amount\\n    );\\n\\n    event BalanceIncreased(address indexed owner, uint256 amount);\\n\\n    event BalanceDecreased(address indexed owner, uint256 amount);\\n\\n    event BridgeUpdated(address newBridge);\\n\\n    modifier onlyBridge() {\\n        require(msg.sender == address(bridge), \\\"Caller is not the bridge\\\");\\n        _;\\n    }\\n\\n    constructor() {\\n        cachedChainId = block.chainid;\\n        cachedDomainSeparator = buildDomainSeparator();\\n    }\\n\\n    /// @notice Allows the Governance to upgrade the Bridge address.\\n    /// @dev The function does not implement any governance delay and does not\\n    ///      check the status of the Bridge. The Governance implementation needs\\n    ///      to ensure all requirements for the upgrade are satisfied before\\n    ///      executing this function.\\n    function updateBridge(address _bridge) external onlyOwner {\\n        require(_bridge != address(0), \\\"Bridge address must not be 0x0\\\");\\n        bridge = _bridge;\\n        emit BridgeUpdated(_bridge);\\n    }\\n\\n    /// @notice Moves the given `amount` of balance from the caller to\\n    ///         `recipient`.\\n    /// @dev Requirements:\\n    ///       - `recipient` cannot be the zero address,\\n    ///       - the caller must have a balance of at least `amount`.\\n    function transferBalance(address recipient, uint256 amount) external {\\n        _transferBalance(msg.sender, recipient, amount);\\n    }\\n\\n    /// @notice Sets `amount` as the allowance of `spender` over the caller's\\n    ///         balance.\\n    /// @dev If the `amount` is set to `type(uint256).max` then\\n    ///      `transferBalanceFrom` will not reduce an allowance.\\n    ///      Beware that changing an allowance with this function brings the\\n    ///      risk that someone may use both the old and the new allowance by\\n    ///      unfortunate transaction ordering. Please use\\n    ///      `increaseBalanceAllowance` and `decreaseBalanceAllowance` to\\n    ///      eliminate the risk.\\n    function approveBalance(address spender, uint256 amount) external {\\n        _approveBalance(msg.sender, spender, amount);\\n    }\\n\\n    /// @notice Sets `amount` as the allowance of a smart contract `vault` over\\n    ///         the caller's balance and calls the vault via\\n    ///         `receiveBalanceApproval`.\\n    /// @dev If the `amount` is set to `type(uint256).max` then the logic in\\n    ///     `receiveBalanceApproval` or later call to `transferBalanceFrom` by\\n    ///      the vault will not reduce an allowance. Beware that changing an\\n    ///      allowance with this function brings the risk that vault may use\\n    ///      both the old and the new allowance by unfortunate transaction\\n    ///      ordering. Please use `increaseBalanceAllowance` and\\n    ///      `decreaseBalanceAllowance` to eliminate the risk.\\n    function approveBalanceAndCall(address vault, uint256 amount) external {\\n        _approveBalance(msg.sender, vault, amount);\\n        IVault(vault).receiveBalanceApproval(msg.sender, amount);\\n    }\\n\\n    /// @notice Atomically increases the balance allowance granted to `spender`\\n    ///         by the caller by the given `addedValue`.\\n    function increaseBalanceAllowance(address spender, uint256 addedValue)\\n        external\\n    {\\n        _approveBalance(\\n            msg.sender,\\n            spender,\\n            allowance[msg.sender][spender] + addedValue\\n        );\\n    }\\n\\n    /// @notice Atomically decreases the balance allowance granted to `spender`\\n    ///         by the caller by the given `subtractedValue`.\\n    function decreaseBalanceAllowance(address spender, uint256 subtractedValue)\\n        external\\n    {\\n        uint256 currentAllowance = allowance[msg.sender][spender];\\n        require(\\n            currentAllowance >= subtractedValue,\\n            \\\"Can not decrease balance allowance below zero\\\"\\n        );\\n        unchecked {\\n            _approveBalance(\\n                msg.sender,\\n                spender,\\n                currentAllowance - subtractedValue\\n            );\\n        }\\n    }\\n\\n    /// @notice Moves `amount` of balance from `spender` to `recipient` using the\\n    ///         allowance mechanism. `amount` is then deducted from the caller's\\n    ///         allowance unless the allowance was made for `type(uint256).max`.\\n    /// @dev Requirements:\\n    ///      - `recipient` cannot be the zero address,\\n    ///      - `spender` must have a balance of at least `amount`,\\n    ///      - the caller must have allowance for `spender`'s balance of at\\n    ///        least `amount`.\\n    function transferBalanceFrom(\\n        address spender,\\n        address recipient,\\n        uint256 amount\\n    ) external {\\n        uint256 currentAllowance = allowance[spender][msg.sender];\\n        if (currentAllowance != type(uint256).max) {\\n            require(\\n                currentAllowance >= amount,\\n                \\\"Transfer amount exceeds allowance\\\"\\n            );\\n            unchecked {\\n                _approveBalance(spender, msg.sender, currentAllowance - amount);\\n            }\\n        }\\n        _transferBalance(spender, recipient, amount);\\n    }\\n\\n    /// @notice EIP2612 approval made with secp256k1 signature.\\n    ///         Users can authorize a transfer of their balance with a signature\\n    ///         conforming EIP712 standard, rather than an on-chain transaction\\n    ///         from their address. Anyone can submit this signature on the\\n    ///         user's behalf by calling the permit function, paying gas fees,\\n    ///         and possibly performing other actions in the same transaction.\\n    /// @dev The deadline argument can be set to `type(uint256).max to create\\n    ///      permits that effectively never expire.  If the `amount` is set\\n    ///      to `type(uint256).max` then `transferBalanceFrom` will not\\n    ///      reduce an allowance. Beware that changing an allowance with this\\n    ///      function brings the risk that someone may use both the old and the\\n    ///      new allowance by unfortunate transaction ordering. Please use\\n    ///      `increaseBalanceAllowance` and `decreaseBalanceAllowance` to\\n    ///      eliminate the risk.\\n    function permit(\\n        address owner,\\n        address spender,\\n        uint256 amount,\\n        uint256 deadline,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    ) external {\\n        /* solhint-disable-next-line not-rely-on-time */\\n        require(deadline >= block.timestamp, \\\"Permission expired\\\");\\n\\n        // Validate `s` and `v` values for a malleability concern described in EIP2.\\n        // Only signatures with `s` value in the lower half of the secp256k1\\n        // curve's order and `v` value of 27 or 28 are considered valid.\\n        require(\\n            uint256(s) <=\\n                0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0,\\n            \\\"Invalid signature 's' value\\\"\\n        );\\n        require(v == 27 || v == 28, \\\"Invalid signature 'v' value\\\");\\n\\n        bytes32 digest = keccak256(\\n            abi.encodePacked(\\n                \\\"\\\\x19\\\\x01\\\",\\n                DOMAIN_SEPARATOR(),\\n                keccak256(\\n                    abi.encode(\\n                        PERMIT_TYPEHASH,\\n                        owner,\\n                        spender,\\n                        amount,\\n                        nonce[owner]++,\\n                        deadline\\n                    )\\n                )\\n            )\\n        );\\n        address recoveredAddress = ecrecover(digest, v, r, s);\\n        require(\\n            recoveredAddress != address(0) && recoveredAddress == owner,\\n            \\\"Invalid signature\\\"\\n        );\\n        _approveBalance(owner, spender, amount);\\n    }\\n\\n    /// @notice Increases balances of the provided `recipients` by the provided\\n    ///         `amounts`. Can only be called by the Bridge.\\n    /// @dev Requirements:\\n    ///       - length of `recipients` and `amounts` must be the same.\\n    function increaseBalances(\\n        address[] calldata recipients,\\n        uint256[] calldata amounts\\n    ) external onlyBridge {\\n        require(\\n            recipients.length == amounts.length,\\n            \\\"Arrays must have the same length\\\"\\n        );\\n        for (uint256 i = 0; i < recipients.length; i++) {\\n            _increaseBalance(recipients[i], amounts[i]);\\n        }\\n    }\\n\\n    /// @notice Increases balance of the provided `recipient` by the provided\\n    ///         `amount`. Can only be called by the Bridge.\\n    function increaseBalance(address recipient, uint256 amount)\\n        external\\n        onlyBridge\\n    {\\n        _increaseBalance(recipient, amount);\\n    }\\n\\n    /// @notice Increases the given smart contract `vault`'s balance and\\n    ///         notifies the `vault` contract. Called by the Bridge after\\n    ///         the deposits routed by depositors to that `vault` have been\\n    ///         swept by the Bridge. This way, the depositor does not have to\\n    ///         issue a separate  transaction to the `vault` contract.\\n    ///         Can be called only by the Bridge.\\n    /// @dev Requirements:\\n    ///       - `vault` must implement `IVault` interface,\\n    ///       - length of `depositors` and `depositedAmounts` must be the same.\\n    /// @param vault Address of `IVault` recipient contract\\n    /// @param depositors Addresses of depositors whose deposits have been swept\\n    /// @param depositedAmounts Amounts deposited by individual depositors and\\n    ///        swept. The `vault`'s balance in the Bank will be increased by the\\n    ///        sum of all elements in this array.\\n    function increaseBalanceAndCall(\\n        address vault,\\n        address[] calldata depositors,\\n        uint256[] calldata depositedAmounts\\n    ) external onlyBridge {\\n        require(\\n            depositors.length == depositedAmounts.length,\\n            \\\"Arrays must have the same length\\\"\\n        );\\n        uint256 totalAmount = 0;\\n        for (uint256 i = 0; i < depositedAmounts.length; i++) {\\n            totalAmount += depositedAmounts[i];\\n        }\\n        _increaseBalance(vault, totalAmount);\\n        IVault(vault).receiveBalanceIncrease(depositors, depositedAmounts);\\n    }\\n\\n    /// @notice Decreases caller's balance by the provided `amount`. There is no\\n    ///         way to restore the balance so do not call this function unless\\n    ///         you really know what you are doing!\\n    function decreaseBalance(uint256 amount) external {\\n        balanceOf[msg.sender] -= amount;\\n        emit BalanceDecreased(msg.sender, amount);\\n    }\\n\\n    /// @notice Returns hash of EIP712 Domain struct with `TBTC Bank` as\\n    ///         a signing domain and Bank contract as a verifying contract.\\n    ///         Used to construct EIP2612 signature provided to `permit`\\n    ///         function.\\n    /* solhint-disable-next-line func-name-mixedcase */\\n    function DOMAIN_SEPARATOR() public view returns (bytes32) {\\n        // As explained in EIP-2612, if the DOMAIN_SEPARATOR contains the\\n        // chainId and is defined at contract deployment instead of\\n        // reconstructed for every signature, there is a risk of possible replay\\n        // attacks between chains in the event of a future chain split.\\n        // To address this issue, we check the cached chain ID against the\\n        // current one and in case they are different, we build domain separator\\n        // from scratch.\\n        if (block.chainid == cachedChainId) {\\n            return cachedDomainSeparator;\\n        } else {\\n            return buildDomainSeparator();\\n        }\\n    }\\n\\n    function _increaseBalance(address recipient, uint256 amount) internal {\\n        require(\\n            recipient != address(this),\\n            \\\"Can not increase balance for Bank\\\"\\n        );\\n        balanceOf[recipient] += amount;\\n        emit BalanceIncreased(recipient, amount);\\n    }\\n\\n    function _transferBalance(\\n        address spender,\\n        address recipient,\\n        uint256 amount\\n    ) private {\\n        require(\\n            recipient != address(0),\\n            \\\"Can not transfer to the zero address\\\"\\n        );\\n        require(\\n            recipient != address(this),\\n            \\\"Can not transfer to the Bank address\\\"\\n        );\\n\\n        uint256 spenderBalance = balanceOf[spender];\\n        require(spenderBalance >= amount, \\\"Transfer amount exceeds balance\\\");\\n        unchecked {\\n            balanceOf[spender] = spenderBalance - amount;\\n        }\\n        balanceOf[recipient] += amount;\\n        emit BalanceTransferred(spender, recipient, amount);\\n    }\\n\\n    function _approveBalance(\\n        address owner,\\n        address spender,\\n        uint256 amount\\n    ) private {\\n        require(spender != address(0), \\\"Can not approve to the zero address\\\");\\n        allowance[owner][spender] = amount;\\n        emit BalanceApproved(owner, spender, amount);\\n    }\\n\\n    function buildDomainSeparator() private view returns (bytes32) {\\n        return\\n            keccak256(\\n                abi.encode(\\n                    keccak256(\\n                        \\\"EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)\\\"\\n                    ),\\n                    keccak256(bytes(\\\"TBTC Bank\\\")),\\n                    keccak256(bytes(\\\"1\\\")),\\n                    block.chainid,\\n                    address(this)\\n                )\\n            );\\n    }\\n}\\n\",\"keccak256\":\"0x8c19af6dbb1974dcbf6bb623c6d3de6b28493b5f44e5fb1e36f47cdebf500453\",\"license\":\"MIT\"},\"contracts/bridge/BitcoinTx.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\nimport {ValidateSPV} from \\\"@keep-network/bitcoin-spv-sol/contracts/ValidateSPV.sol\\\";\\n\\nimport \\\"./BridgeState.sol\\\";\\n\\n/// @title Bitcoin transaction\\n/// @notice Allows to reference Bitcoin raw transaction in Solidity.\\n/// @dev See https://developer.bitcoin.org/reference/transactions.html#raw-transaction-format\\n///\\n///      Raw Bitcoin transaction data:\\n///\\n///      | Bytes  |     Name     |        BTC type        |        Description        |\\n///      |--------|--------------|------------------------|---------------------------|\\n///      | 4      | version      | int32_t (LE)           | TX version number         |\\n///      | varies | tx_in_count  | compactSize uint (LE)  | Number of TX inputs       |\\n///      | varies | tx_in        | txIn[]                 | TX inputs                 |\\n///      | varies | tx_out count | compactSize uint (LE)  | Number of TX outputs      |\\n///      | varies | tx_out       | txOut[]                | TX outputs                |\\n///      | 4      | lock_time    | uint32_t (LE)          | Unix time or block number |\\n///\\n//\\n///      Non-coinbase transaction input (txIn):\\n///\\n///      | Bytes  |       Name       |        BTC type        |                 Description                 |\\n///      |--------|------------------|------------------------|---------------------------------------------|\\n///      | 36     | previous_output  | outpoint               | The previous outpoint being spent           |\\n///      | varies | script bytes     | compactSize uint (LE)  | The number of bytes in the signature script |\\n///      | varies | signature script | char[]                 | The signature script, empty for P2WSH       |\\n///      | 4      | sequence         | uint32_t (LE)          | Sequence number                             |\\n///\\n///\\n///      The reference to transaction being spent (outpoint):\\n///\\n///      | Bytes | Name  |   BTC type    |               Description                |\\n///      |-------|-------|---------------|------------------------------------------|\\n///      |    32 | hash  | char[32]      | Hash of the transaction to spend         |\\n///      |    4  | index | uint32_t (LE) | Index of the specific output from the TX |\\n///\\n///\\n///      Transaction output (txOut):\\n///\\n///      | Bytes  |      Name       |     BTC type          |             Description              |\\n///      |--------|-----------------|-----------------------|--------------------------------------|\\n///      | 8      | value           | int64_t (LE)          | Number of satoshis to spend          |\\n///      | 1+     | pk_script_bytes | compactSize uint (LE) | Number of bytes in the pubkey script |\\n///      | varies | pk_script       | char[]                | Pubkey script                        |\\n///\\n///      compactSize uint format:\\n///\\n///      |                  Value                  | Bytes |                    Format                    |\\n///      |-----------------------------------------|-------|----------------------------------------------|\\n///      | >= 0 && <= 252                          | 1     | uint8_t                                      |\\n///      | >= 253 && <= 0xffff                     | 3     | 0xfd followed by the number as uint16_t (LE) |\\n///      | >= 0x10000 && <= 0xffffffff             | 5     | 0xfe followed by the number as uint32_t (LE) |\\n///      | >= 0x100000000 && <= 0xffffffffffffffff | 9     | 0xff followed by the number as uint64_t (LE) |\\n///\\n///      (*) compactSize uint is often references as VarInt)\\n///\\nlibrary BitcoinTx {\\n    using BTCUtils for bytes;\\n    using BTCUtils for uint256;\\n    using BytesLib for bytes;\\n    using ValidateSPV for bytes;\\n    using ValidateSPV for bytes32;\\n\\n    /// @notice Represents Bitcoin transaction data.\\n    struct Info {\\n        /// @notice Bitcoin transaction version\\n        /// @dev `version` from raw Bitcoin transaction data.\\n        ///      Encoded as 4-bytes signed integer, little endian.\\n        bytes4 version;\\n        /// @notice All Bitcoin transaction inputs, prepended by the number of\\n        ///         transaction inputs.\\n        /// @dev `tx_in_count | tx_in` from raw Bitcoin transaction data.\\n        ///\\n        ///      The number of transaction inputs encoded as compactSize\\n        ///      unsigned integer, little-endian.\\n        ///\\n        ///      Note that some popular block explorers reverse the order of\\n        ///      bytes from `outpoint`'s `hash` and display it as big-endian.\\n        ///      Solidity code of Bridge expects hashes in little-endian, just\\n        ///      like they are represented in a raw Bitcoin transaction.\\n        bytes inputVector;\\n        /// @notice All Bitcoin transaction outputs prepended by the number of\\n        ///         transaction outputs.\\n        /// @dev `tx_out_count | tx_out` from raw Bitcoin transaction data.\\n        ///\\n        ///       The number of transaction outputs encoded as a compactSize\\n        ///       unsigned integer, little-endian.\\n        bytes outputVector;\\n        /// @notice Bitcoin transaction locktime.\\n        ///\\n        /// @dev `lock_time` from raw Bitcoin transaction data.\\n        ///      Encoded as 4-bytes unsigned integer, little endian.\\n        bytes4 locktime;\\n    }\\n\\n    /// @notice Represents data needed to perform a Bitcoin SPV proof.\\n    struct Proof {\\n        /// @notice The merkle proof of transaction inclusion in a block.\\n        bytes merkleProof;\\n        /// @notice Transaction index in the block (0-indexed).\\n        uint256 txIndexInBlock;\\n        /// @notice Single byte-string of 80-byte bitcoin headers,\\n        ///         lowest height first.\\n        bytes bitcoinHeaders;\\n    }\\n\\n    /// @notice Represents info about an unspent transaction output.\\n    struct UTXO {\\n        /// @notice Hash of the transaction the output belongs to.\\n        /// @dev Byte order corresponds to the Bitcoin internal byte order.\\n        bytes32 txHash;\\n        /// @notice Index of the transaction output (0-indexed).\\n        uint32 txOutputIndex;\\n        /// @notice Value of the transaction output.\\n        uint64 txOutputValue;\\n    }\\n\\n    /// @notice Represents Bitcoin signature in the R/S/V format.\\n    struct RSVSignature {\\n        /// @notice Signature r value.\\n        bytes32 r;\\n        /// @notice Signature s value.\\n        bytes32 s;\\n        /// @notice Signature recovery value.\\n        uint8 v;\\n    }\\n\\n    /// @notice Validates the SPV proof of the Bitcoin transaction.\\n    ///         Reverts in case the validation or proof verification fail.\\n    /// @param txInfo Bitcoin transaction data\\n    /// @param proof Bitcoin proof data\\n    /// @return txHash Proven 32-byte transaction hash.\\n    function validateProof(\\n        BridgeState.Storage storage self,\\n        Info calldata txInfo,\\n        Proof calldata proof\\n    ) internal view returns (bytes32 txHash) {\\n        require(\\n            txInfo.inputVector.validateVin(),\\n            \\\"Invalid input vector provided\\\"\\n        );\\n        require(\\n            txInfo.outputVector.validateVout(),\\n            \\\"Invalid output vector provided\\\"\\n        );\\n\\n        txHash = abi\\n            .encodePacked(\\n                txInfo.version,\\n                txInfo.inputVector,\\n                txInfo.outputVector,\\n                txInfo.locktime\\n            )\\n            .hash256View();\\n\\n        require(\\n            txHash.prove(\\n                proof.bitcoinHeaders.extractMerkleRootLE(),\\n                proof.merkleProof,\\n                proof.txIndexInBlock\\n            ),\\n            \\\"Tx merkle proof is not valid for provided header and tx hash\\\"\\n        );\\n\\n        evaluateProofDifficulty(self, proof.bitcoinHeaders);\\n\\n        return txHash;\\n    }\\n\\n    /// @notice Evaluates the given Bitcoin proof difficulty against the actual\\n    ///         Bitcoin chain difficulty provided by the relay oracle.\\n    ///         Reverts in case the evaluation fails.\\n    /// @param bitcoinHeaders Bitcoin headers chain being part of the SPV\\n    ///        proof. Used to extract the observed proof difficulty\\n    function evaluateProofDifficulty(\\n        BridgeState.Storage storage self,\\n        bytes memory bitcoinHeaders\\n    ) internal view {\\n        IRelay relay = self.relay;\\n        uint256 currentEpochDifficulty = relay.getCurrentEpochDifficulty();\\n        uint256 previousEpochDifficulty = relay.getPrevEpochDifficulty();\\n\\n        uint256 requestedDiff = 0;\\n        uint256 firstHeaderDiff = bitcoinHeaders\\n            .extractTarget()\\n            .calculateDifficulty();\\n\\n        if (firstHeaderDiff == currentEpochDifficulty) {\\n            requestedDiff = currentEpochDifficulty;\\n        } else if (firstHeaderDiff == previousEpochDifficulty) {\\n            requestedDiff = previousEpochDifficulty;\\n        } else {\\n            revert(\\\"Not at current or previous difficulty\\\");\\n        }\\n\\n        uint256 observedDiff = bitcoinHeaders.validateHeaderChain();\\n\\n        require(\\n            observedDiff != ValidateSPV.getErrBadLength(),\\n            \\\"Invalid length of the headers chain\\\"\\n        );\\n        require(\\n            observedDiff != ValidateSPV.getErrInvalidChain(),\\n            \\\"Invalid headers chain\\\"\\n        );\\n        require(\\n            observedDiff != ValidateSPV.getErrLowWork(),\\n            \\\"Insufficient work in a header\\\"\\n        );\\n\\n        require(\\n            observedDiff >= requestedDiff * self.txProofDifficultyFactor,\\n            \\\"Insufficient accumulated difficulty in header chain\\\"\\n        );\\n    }\\n\\n    /// @notice Extracts public key hash from the provided P2PKH or P2WPKH output.\\n    ///         Reverts if the validation fails.\\n    /// @param output The transaction output\\n    /// @return pubKeyHash 20-byte public key hash the output locks funds on\\n    /// @dev Requirements:\\n    ///      - The output must be of P2PKH or P2WPKH type and lock the funds\\n    ///        on a 20-byte public key hash\\n    function extractPubKeyHash(BridgeState.Storage storage, bytes memory output)\\n        internal\\n        view\\n        returns (bytes20 pubKeyHash)\\n    {\\n        bytes memory pubKeyHashBytes = output.extractHash();\\n\\n        require(\\n            pubKeyHashBytes.length == 20,\\n            \\\"Output's public key hash must have 20 bytes\\\"\\n        );\\n\\n        pubKeyHash = pubKeyHashBytes.slice20(0);\\n\\n        // We need to make sure that the 20-byte public key hash\\n        // is actually used in the right context of a P2PKH or P2WPKH\\n        // output. To do so, we must extract the full script from the output\\n        // and compare with the expected P2PKH and P2WPKH scripts\\n        // referring to that 20-byte public key hash. The output consists\\n        // of an 8-byte value and a variable length script. To extract the\\n        // script we slice the output starting from 9th byte until the end.\\n        bytes32 outputScriptKeccak = keccak256(\\n            output.slice(8, output.length - 8)\\n        );\\n        // Build the expected P2PKH script which has the following byte\\n        // format: <0x1976a914> <20-byte PKH> <0x88ac>. According to\\n        // https://en.bitcoin.it/wiki/Script#Opcodes this translates to:\\n        // - 0x19: Byte length of the entire script\\n        // - 0x76: OP_DUP\\n        // - 0xa9: OP_HASH160\\n        // - 0x14: Byte length of the public key hash\\n        // - 0x88: OP_EQUALVERIFY\\n        // - 0xac: OP_CHECKSIG\\n        // which matches the P2PKH structure as per:\\n        // https://en.bitcoin.it/wiki/Transaction#Pay-to-PubkeyHash\\n        bytes32 P2PKHScriptKeccak = keccak256(\\n            abi.encodePacked(hex\\\"1976a914\\\", pubKeyHash, hex\\\"88ac\\\")\\n        );\\n        // Build the expected P2WPKH script which has the following format:\\n        // <0x160014> <20-byte PKH>. According to\\n        // https://en.bitcoin.it/wiki/Script#Opcodes this translates to:\\n        // - 0x16: Byte length of the entire script\\n        // - 0x00: OP_0\\n        // - 0x14: Byte length of the public key hash\\n        // which matches the P2WPKH structure as per:\\n        // https://github.com/bitcoin/bips/blob/master/bip-0141.mediawiki#P2WPKH\\n        bytes32 P2WPKHScriptKeccak = keccak256(\\n            abi.encodePacked(hex\\\"160014\\\", pubKeyHash)\\n        );\\n        // Make sure the actual output script matches either the P2PKH\\n        // or P2WPKH format.\\n        require(\\n            outputScriptKeccak == P2PKHScriptKeccak ||\\n                outputScriptKeccak == P2WPKHScriptKeccak,\\n            \\\"Output must be P2PKH or P2WPKH\\\"\\n        );\\n\\n        return pubKeyHash;\\n    }\\n}\\n\",\"keccak256\":\"0x5111b37d47e2e19406f3973c296bab27e87b11833dbbd410c6d555eb181bc075\",\"license\":\"MIT\"},\"contracts/bridge/BridgeState.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {IWalletRegistry as EcdsaWalletRegistry} from \\\"@keep-network/ecdsa/contracts/api/IWalletRegistry.sol\\\";\\n\\nimport \\\"./IRelay.sol\\\";\\nimport \\\"./Deposit.sol\\\";\\nimport \\\"./Redemption.sol\\\";\\nimport \\\"./Fraud.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\nimport \\\"./MovingFunds.sol\\\";\\n\\nimport \\\"../bank/Bank.sol\\\";\\n\\nlibrary BridgeState {\\n    // TODO: Make parameters governable\\n    struct Storage {\\n        // Address of the Bank the Bridge belongs to.\\n        Bank bank;\\n        // Bitcoin relay providing the current Bitcoin network difficulty.\\n        IRelay relay;\\n        // ECDSA Wallet Registry contract handle.\\n        EcdsaWalletRegistry ecdsaWalletRegistry;\\n        // The number of confirmations on the Bitcoin chain required to\\n        // successfully evaluate an SPV proof.\\n        uint256 txProofDifficultyFactor;\\n        // Address where the deposit and redemption treasury fees will be sent\\n        // to. Treasury takes part in the operators rewarding process.\\n        address treasury;\\n        // The minimal amount that can be requested to deposit.\\n        // Value of this parameter must take into account the value of\\n        // `depositTreasuryFeeDivisor` and `depositTxMaxFee` parameters in order\\n        // to make requests that can incur the treasury and transaction fee and\\n        // still satisfy the depositor.\\n        uint64 depositDustThreshold;\\n        // Divisor used to compute the treasury fee taken from each deposit and\\n        // transferred to the treasury upon sweep proof submission. That fee is\\n        // computed as follows:\\n        // `treasuryFee = depositedAmount / depositTreasuryFeeDivisor`\\n        // For example, if the treasury fee needs to be 2% of each deposit,\\n        // the `depositTreasuryFeeDivisor` should be set to `50` because\\n        // `1/50 = 0.02 = 2%`.\\n        uint64 depositTreasuryFeeDivisor;\\n        // Maximum amount of BTC transaction fee that can be incurred by each\\n        // swept deposit being part of the given sweep transaction. If the\\n        // maximum BTC transaction fee is exceeded, such transaction is\\n        // considered a fraud.\\n        //\\n        // This is a per-deposit input max fee for the sweep transaction.\\n        uint64 depositTxMaxFee;\\n        // Collection of all revealed deposits indexed by\\n        // `keccak256(fundingTxHash | fundingOutputIndex)`.\\n        // The `fundingTxHash` is `bytes32` (ordered as in Bitcoin internally)\\n        // and `fundingOutputIndex` an `uint32`. This mapping may contain valid\\n        // and invalid deposits and the wallet is responsible for validating\\n        // them before attempting to execute a sweep.\\n        mapping(uint256 => Deposit.DepositRequest) deposits;\\n        // Indicates if the vault with the given address is trusted or not.\\n        // Depositors can route their revealed deposits only to trusted vaults\\n        // and have trusted vaults notified about new deposits as soon as these\\n        // deposits get swept. Vaults not trusted by the Bridge can still be\\n        // used by Bank balance owners on their own responsibility - anyone can\\n        // approve their Bank balance to any address.\\n        mapping(address => bool) isVaultTrusted;\\n        // Maximum amount of the total BTC transaction fee that is acceptable in\\n        // a single moving funds transaction.\\n        //\\n        // This is a TOTAL max fee for the moving funds transaction. Note\\n        // that `depositTxMaxFee` is per single deposit and `redemptionTxMaxFee`\\n        // if per single redemption. `movingFundsTxMaxTotalFee` is a total\\n        // fee for the entire transaction.\\n        uint64 movingFundsTxMaxTotalFee;\\n        // The minimal satoshi amount that makes sense to be transferred during\\n        // the moving funds process. Moving funds wallets having their BTC\\n        // balance below that value can begin closing immediately as\\n        // transferring such a low value may not be possible due to\\n        // BTC network fees.\\n        uint64 movingFundsDustThreshold;\\n        // Time after which the moving funds process can be reported as\\n        // timed out. It is counted from the moment when the wallet\\n        // was requested to move their funds and switched to the MovingFunds\\n        // state. Value in seconds.\\n        uint32 movingFundsTimeout;\\n        // The amount of stake slashed from each member of a wallet for a moving\\n        // funds timeout.\\n        uint96 movingFundsTimeoutSlashingAmount;\\n        // The percentage of the notifier reward from the staking contract\\n        // the notifier of a moving funds timeout receives. The value is in the\\n        // range [0, 100].\\n        uint256 movingFundsTimeoutNotifierRewardMultiplier;\\n        // Maximum amount of the total BTC transaction fee that is acceptable in\\n        // a single moved funds sweep transaction.\\n        //\\n        // This is a TOTAL max fee for the moved funds sweep transaction. Note\\n        // that `depositTxMaxFee` is per single deposit and `redemptionTxMaxFee`\\n        // if per single redemption. `movedFundsSweepTxMaxTotalFee` is a total\\n        // fee for the entire transaction.\\n        uint64 movedFundsSweepTxMaxTotalFee;\\n        // Collection of all moved funds sweep requests indexed by\\n        // `keccak256(movingFundsTxHash | movingFundsOutputIndex)`.\\n        // The `movingFundsTxHash` is `bytes32` (ordered as in Bitcoin\\n        // internally) and `movingFundsOutputIndex` an `uint32`. Each entry\\n        // is actually an UTXO representing the moved funds and is supposed\\n        // to be swept with the current main UTXO of the recipient wallet.\\n        mapping(uint256 => MovingFunds.MovedFundsSweepRequest) movedFundsSweepRequests;\\n        // The minimal amount that can be requested for redemption.\\n        // Value of this parameter must take into account the value of\\n        // `redemptionTreasuryFeeDivisor` and `redemptionTxMaxFee`\\n        // parameters in order to make requests that can incur the\\n        // treasury and transaction fee and still satisfy the redeemer.\\n        uint64 redemptionDustThreshold;\\n        // Divisor used to compute the treasury fee taken from each\\n        // redemption request and transferred to the treasury upon\\n        // successful request finalization. That fee is computed as follows:\\n        // `treasuryFee = requestedAmount / redemptionTreasuryFeeDivisor`\\n        // For example, if the treasury fee needs to be 2% of each\\n        // redemption request, the `redemptionTreasuryFeeDivisor` should\\n        // be set to `50` because `1/50 = 0.02 = 2%`.\\n        uint64 redemptionTreasuryFeeDivisor;\\n        // Maximum amount of BTC transaction fee that can be incurred by\\n        // each redemption request being part of the given redemption\\n        // transaction. If the maximum BTC transaction fee is exceeded, such\\n        // transaction is considered a fraud.\\n        //\\n        // This is a per-redemption output max fee for the redemption\\n        // transaction.\\n        uint64 redemptionTxMaxFee;\\n        // Time after which the redemption request can be reported as\\n        // timed out. It is counted from the moment when the redemption\\n        // request was created via `requestRedemption` call. Reported\\n        // timed out requests are cancelled and locked TBTC is returned\\n        // to the redeemer in full amount.\\n        uint256 redemptionTimeout;\\n        // The amount of stake slashed from each member of a wallet for a\\n        // redemption timeout.\\n        uint96 redemptionTimeoutSlashingAmount;\\n        // The percentage of the notifier reward from the staking contract\\n        // the notifier of a redemption timeout receives. The value is in the\\n        // range [0, 100].\\n        uint256 redemptionTimeoutNotifierRewardMultiplier;\\n        // Collection of all pending redemption requests indexed by\\n        // redemption key built as\\n        // `keccak256(walletPubKeyHash | redeemerOutputScript)`.\\n        // The `walletPubKeyHash` is the 20-byte wallet's public key hash\\n        // (computed using Bitcoin HASH160 over the compressed ECDSA\\n        // public key) and `redeemerOutputScript` is a Bitcoin script\\n        // (P2PKH, P2WPKH, P2SH or P2WSH) that will be used to lock\\n        // redeemed BTC as requested by the redeemer. Requests are added\\n        // to this mapping by the `requestRedemption` method (duplicates\\n        // not allowed) and are removed by one of the following methods:\\n        // - `submitRedemptionProof` in case the request was handled\\n        //    successfully\\n        // - `notifyRedemptionTimeout` in case the request was reported\\n        //    to be timed out\\n        mapping(uint256 => Redemption.RedemptionRequest) pendingRedemptions;\\n        // Collection of all timed out redemptions requests indexed by\\n        // redemption key built as\\n        // `keccak256(walletPubKeyHash | redeemerOutputScript)`. The\\n        // `walletPubKeyHash` is the 20-byte wallet's public key hash\\n        // (computed using Bitcoin HASH160 over the compressed ECDSA\\n        // public key) and `redeemerOutputScript` is the Bitcoin script\\n        // (P2PKH, P2WPKH, P2SH or P2WSH) that is involved in the timed\\n        // out request. Timed out requests are stored in this mapping to\\n        // avoid slashing the wallets multiple times for the same timeout.\\n        // Only one method can add to this mapping:\\n        // - `notifyRedemptionTimeout` which puts the redemption key to this\\n        //    mapping basing on a timed out request stored previously in\\n        //    `pendingRedemptions` mapping.\\n        mapping(uint256 => Redemption.RedemptionRequest) timedOutRedemptions;\\n        // The amount of ETH in wei the party challenging the wallet for fraud\\n        // needs to deposit.\\n        uint256 fraudChallengeDepositAmount;\\n        // The amount of time the wallet has to defeat a fraud challenge.\\n        uint256 fraudChallengeDefeatTimeout;\\n        // The amount of stake slashed from each member of a wallet for a fraud.\\n        uint96 fraudSlashingAmount;\\n        // The percentage of the notifier reward from the staking contract\\n        // the notifier of a fraud receives. The value is in the range [0, 100].\\n        uint256 fraudNotifierRewardMultiplier;\\n        // Collection of all submitted fraud challenges indexed by challenge\\n        // key built as `keccak256(walletPublicKey|sighash)`.\\n        mapping(uint256 => Fraud.FraudChallenge) fraudChallenges;\\n        // Collection of main UTXOs that are honestly spent indexed by\\n        // `keccak256(fundingTxHash | fundingOutputIndex)`. The `fundingTxHash`\\n        // is `bytes32` (ordered as in Bitcoin internally) and\\n        // `fundingOutputIndex` an `uint32`. A main UTXO is considered honestly\\n        // spent if it was used as an input of a transaction that have been\\n        // proven in the Bridge.\\n        mapping(uint256 => bool) spentMainUTXOs;\\n        // Determines how frequently a new wallet creation can be requested.\\n        // Value in seconds.\\n        uint32 walletCreationPeriod;\\n        // The minimum BTC threshold in satoshi that is used to decide about\\n        // wallet creation. Specifically, we allow for the creation of a new\\n        // wallet if the active wallet is old enough and their amount of BTC\\n        // is greater than or equal this threshold.\\n        uint64 walletCreationMinBtcBalance;\\n        // The maximum BTC threshold in satoshi that is used to decide about\\n        // wallet creation. Specifically, we allow for the creation of a new\\n        // wallet if the active wallet's amount of BTC is greater than or equal\\n        // this threshold, regardless of the active wallet's age.\\n        uint64 walletCreationMaxBtcBalance;\\n        // The minimum BTC threshold in satoshi that is used to decide about\\n        // wallet closing. Specifically, we allow for the closure of the given\\n        // wallet if their amount of BTC is lesser than this threshold,\\n        // regardless of the wallet's age.\\n        uint64 walletClosureMinBtcBalance;\\n        // The maximum age of a wallet in seconds, after which the wallet\\n        // moving funds process can be requested.\\n        uint32 walletMaxAge;\\n        // 20-byte wallet public key hash being reference to the currently\\n        // active wallet. Can be unset to the zero value under certain\\n        // circumstances.\\n        bytes20 activeWalletPubKeyHash;\\n        // The current number of wallets in the Live state.\\n        uint32 liveWalletsCount;\\n        // The maximum BTC amount in satoshi than can be transferred to a single\\n        // target wallet during the moving funds process.\\n        uint64 walletMaxBtcTransfer;\\n        // Determines the length of the wallet closing period, i.e. the period\\n        // when the wallet remains in the Closing state and can be subject\\n        // of deposit fraud challenges. This value is in seconds and should be\\n        // greater than the deposit refund time plus some time margin.\\n        uint32 walletClosingPeriod;\\n        // Maps the 20-byte wallet public key hash (computed using Bitcoin\\n        // HASH160 over the compressed ECDSA public key) to the basic wallet\\n        // information like state and pending redemptions value.\\n        mapping(bytes20 => Wallets.Wallet) registeredWallets;\\n    }\\n\\n    event DepositParametersUpdated(\\n        uint64 depositDustThreshold,\\n        uint64 depositTreasuryFeeDivisor,\\n        uint64 depositTxMaxFee\\n    );\\n\\n    event RedemptionParametersUpdated(\\n        uint64 redemptionDustThreshold,\\n        uint64 redemptionTreasuryFeeDivisor,\\n        uint64 redemptionTxMaxFee,\\n        uint256 redemptionTimeout,\\n        uint96 redemptionTimeoutSlashingAmount,\\n        uint256 redemptionTimeoutNotifierRewardMultiplier\\n    );\\n\\n    event MovingFundsParametersUpdated(\\n        uint64 movingFundsTxMaxTotalFee,\\n        uint64 movingFundsDustThreshold,\\n        uint32 movingFundsTimeout,\\n        uint96 movingFundsTimeoutSlashingAmount,\\n        uint256 movingFundsTimeoutNotifierRewardMultiplier,\\n        uint64 movedFundsSweepTxMaxTotalFee\\n    );\\n\\n    event WalletParametersUpdated(\\n        uint32 walletCreationPeriod,\\n        uint64 walletCreationMinBtcBalance,\\n        uint64 walletCreationMaxBtcBalance,\\n        uint64 walletClosureMinBtcBalance,\\n        uint32 walletMaxAge,\\n        uint64 walletMaxBtcTransfer,\\n        uint32 walletClosingPeriod\\n    );\\n\\n    event FraudParametersUpdated(\\n        uint256 fraudChallengeDepositAmount,\\n        uint256 fraudChallengeDefeatTimeout,\\n        uint96 fraudSlashingAmount,\\n        uint256 fraudNotifierRewardMultiplier\\n    );\\n\\n    /// @notice Updates parameters of deposits.\\n    /// @param _depositDustThreshold New value of the deposit dust threshold in\\n    ///        satoshis. It is the minimal amount that can be requested to\\n    ////       deposit. Value of this parameter must take into account the value\\n    ///        of `depositTreasuryFeeDivisor` and `depositTxMaxFee` parameters\\n    ///        in order to make requests that can incur the treasury and\\n    ///        transaction fee and still satisfy the depositor\\n    /// @param _depositTreasuryFeeDivisor New value of the treasury fee divisor.\\n    ///        It is the divisor used to compute the treasury fee taken from\\n    ///        each deposit and transferred to the treasury upon sweep proof\\n    ///        submission. That fee is computed as follows:\\n    ///        `treasuryFee = depositedAmount / depositTreasuryFeeDivisor`\\n    ///        For example, if the treasury fee needs to be 2% of each deposit,\\n    ///        the `depositTreasuryFeeDivisor` should be set to `50`\\n    ///        because `1/50 = 0.02 = 2%`\\n    /// @param _depositTxMaxFee New value of the deposit tx max fee in satoshis.\\n    ///        It is the maximum amount of BTC transaction fee that can\\n    ///        be incurred by each swept deposit being part of the given sweep\\n    ///        transaction. If the maximum BTC transaction fee is exceeded,\\n    ///        such transaction is considered a fraud\\n    /// @dev Requirements:\\n    ///      - Deposit dust threshold must be greater than zero\\n    ///      - Deposit treasury fee divisor must be greater than zero\\n    ///      - Deposit transaction max fee must be greater than zero\\n    function updateDepositParameters(\\n        Storage storage self,\\n        uint64 _depositDustThreshold,\\n        uint64 _depositTreasuryFeeDivisor,\\n        uint64 _depositTxMaxFee\\n    ) internal {\\n        require(\\n            _depositDustThreshold > 0,\\n            \\\"Deposit dust threshold must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _depositTreasuryFeeDivisor > 0,\\n            \\\"Deposit treasury fee divisor must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _depositTxMaxFee > 0,\\n            \\\"Deposit transaction max fee must be greater than zero\\\"\\n        );\\n\\n        self.depositDustThreshold = _depositDustThreshold;\\n        self.depositTreasuryFeeDivisor = _depositTreasuryFeeDivisor;\\n        self.depositTxMaxFee = _depositTxMaxFee;\\n\\n        emit DepositParametersUpdated(\\n            _depositDustThreshold,\\n            _depositTreasuryFeeDivisor,\\n            _depositTxMaxFee\\n        );\\n    }\\n\\n    /// @notice Updates parameters of redemptions.\\n    /// @param _redemptionDustThreshold New value of the redemption dust\\n    ///        threshold in satoshis. It is the minimal amount that can be\\n    ///        requested for redemption. Value of this parameter must take into\\n    ///        account the value of `redemptionTreasuryFeeDivisor` and\\n    ///        `redemptionTxMaxFee` parameters in order to make requests that\\n    ///        can incur the treasury and transaction fee and still satisfy the\\n    ///        redeemer.\\n    /// @param _redemptionTreasuryFeeDivisor New value of the redemption\\n    ///        treasury fee divisor. It is the divisor used to compute the\\n    ///        treasury fee taken from each redemption request and transferred\\n    ///        to the treasury upon successful request finalization. That fee is\\n    ///        computed as follows:\\n    ///        `treasuryFee = requestedAmount / redemptionTreasuryFeeDivisor`\\n    ///        For example, if the treasury fee needs to be 2% of each\\n    ///        redemption request, the `redemptionTreasuryFeeDivisor` should\\n    ///        be set to `50` because `1/50 = 0.02 = 2%`.\\n    /// @param _redemptionTxMaxFee New value of the redemption transaction max\\n    ///        fee in satoshis. It is the maximum amount of BTC transaction fee\\n    ///        that can be incurred by each redemption request being part of the\\n    ///        given redemption transaction. If the maximum BTC transaction fee\\n    ///        is exceeded, such transaction is considered a fraud.\\n    ///        This is a per-redemption output max fee for the redemption\\n    ///        transaction.\\n    /// @param _redemptionTimeout New value of the redemption timeout in seconds.\\n    ///        It is the time after which the redemption request can be reported\\n    ///        as timed out. It is counted from the moment when the redemption\\n    ///        request was created via `requestRedemption` call. Reported  timed\\n    ///        out requests are cancelled and locked TBTC is returned to the\\n    ///        redeemer in full amount.\\n    /// @param _redemptionTimeoutSlashingAmount New value of the redemption\\n    ///        timeout slashing amount in T, it is the amount slashed from each\\n    ///        wallet member for redemption timeout\\n    /// @param _redemptionTimeoutNotifierRewardMultiplier New value of the\\n    ///        redemption timeout notifier reward multiplier as percentage,\\n    ///        it determines the percentage of the notifier reward from the\\n    ///        staking contact the notifier of a redemption timeout receives.\\n    ///        The value must be in the range [0, 100]\\n    /// @dev Requirements:\\n    ///      - Redemption dust threshold must be greater than zero\\n    ///      - Redemption treasury fee divisor must be greater than zero\\n    ///      - Redemption transaction max fee must be greater than zero\\n    ///      - Redemption timeout must be greater than zero\\n    ///      - Redemption timeout notifier reward multiplier must be in the\\n    ///        range [0, 100]\\n    function updateRedemptionParameters(\\n        Storage storage self,\\n        uint64 _redemptionDustThreshold,\\n        uint64 _redemptionTreasuryFeeDivisor,\\n        uint64 _redemptionTxMaxFee,\\n        uint256 _redemptionTimeout,\\n        uint96 _redemptionTimeoutSlashingAmount,\\n        uint256 _redemptionTimeoutNotifierRewardMultiplier\\n    ) internal {\\n        require(\\n            _redemptionDustThreshold > 0,\\n            \\\"Redemption dust threshold must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTreasuryFeeDivisor > 0,\\n            \\\"Redemption treasury fee divisor must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTxMaxFee > 0,\\n            \\\"Redemption transaction max fee must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTimeout > 0,\\n            \\\"Redemption timeout must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _redemptionTimeoutNotifierRewardMultiplier <= 100,\\n            \\\"Redemption timeout notifier reward multiplier must be in the range [0, 100]\\\"\\n        );\\n\\n        self.redemptionDustThreshold = _redemptionDustThreshold;\\n        self.redemptionTreasuryFeeDivisor = _redemptionTreasuryFeeDivisor;\\n        self.redemptionTxMaxFee = _redemptionTxMaxFee;\\n        self.redemptionTimeout = _redemptionTimeout;\\n        self.redemptionTimeoutSlashingAmount = _redemptionTimeoutSlashingAmount;\\n        self\\n            .redemptionTimeoutNotifierRewardMultiplier = _redemptionTimeoutNotifierRewardMultiplier;\\n\\n        emit RedemptionParametersUpdated(\\n            _redemptionDustThreshold,\\n            _redemptionTreasuryFeeDivisor,\\n            _redemptionTxMaxFee,\\n            _redemptionTimeout,\\n            _redemptionTimeoutSlashingAmount,\\n            _redemptionTimeoutNotifierRewardMultiplier\\n        );\\n    }\\n\\n    /// @notice Updates parameters of moving funds.\\n    /// @param _movingFundsTxMaxTotalFee New value of the moving funds transaction\\n    ///        max total fee in satoshis. It is the maximum amount of the total\\n    ///        BTC transaction fee that is acceptable in a single moving funds\\n    ///        transaction. This is a _total_ max fee for the entire moving\\n    ///        funds transaction.\\n    /// @param _movingFundsDustThreshold New value of the moving funds dust\\n    ///        threshold. It is the minimal satoshi amount that makes sense to\\n    //         be transferred during the moving funds process. Moving funds\\n    //         wallets having their BTC balance below that value can begin\\n    //         closing immediately as transferring such a low value may not be\\n    //         possible due to BTC network fees.\\n    /// @param _movingFundsTimeout New value of the moving funds timeout in\\n    ///        seconds. It is the time after which the moving funds process can\\n    ///        be reported as timed out. It is counted from the moment when the\\n    ///        wallet was requested to move their funds and switched to the\\n    ///        MovingFunds state.\\n    /// @param _movingFundsTimeoutSlashingAmount New value of the moving funds\\n    ///        timeout slashing amount in T, it is the amount slashed from each\\n    ///        wallet member for moving funds timeout\\n    /// @param _movingFundsTimeoutNotifierRewardMultiplier New value of the\\n    ///        moving funds timeout notifier reward multiplier as percentage,\\n    ///        it determines the percentage of the notifier reward from the\\n    ///        staking contact the notifier of a moving funds timeout receives.\\n    ///        The value must be in the range [0, 100]\\n    /// @param _movedFundsSweepTxMaxTotalFee New value of the moved funds sweep\\n    ///        transaction max total fee in satoshis. It is the maximum amount\\n    ///        of the total BTC transaction fee that is acceptable in a single\\n    ///        moved funds sweep transaction. This is a _total_ max fee for the\\n    ///        entire moved funds sweep transaction.\\n    /// @dev Requirements:\\n    ///      - Moving funds transaction max total fee must be greater than zero\\n    ///      - Moving funds dust threshold must be greater than zero\\n    ///      - Moving funds timeout must be greater than zero\\n    ///      - Moving funds timeout notifier reward multiplier must be in the\\n    ///        range [0, 100]\\n    ///      - Moved funds sweep transaction max total fee must be greater than zero\\n    function updateMovingFundsParameters(\\n        Storage storage self,\\n        uint64 _movingFundsTxMaxTotalFee,\\n        uint64 _movingFundsDustThreshold,\\n        uint32 _movingFundsTimeout,\\n        uint96 _movingFundsTimeoutSlashingAmount,\\n        uint256 _movingFundsTimeoutNotifierRewardMultiplier,\\n        uint64 _movedFundsSweepTxMaxTotalFee\\n    ) internal {\\n        require(\\n            _movingFundsTxMaxTotalFee > 0,\\n            \\\"Moving funds transaction max total fee must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _movingFundsDustThreshold > 0,\\n            \\\"Moving funds dust threshold must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _movingFundsTimeout > 0,\\n            \\\"Moving funds timeout must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _movingFundsTimeoutNotifierRewardMultiplier <= 100,\\n            \\\"Moving funds timeout notifier reward multiplier must be in the range [0, 100]\\\"\\n        );\\n\\n        require(\\n            _movedFundsSweepTxMaxTotalFee > 0,\\n            \\\"Moved funds sweep transaction max total fee must be greater than zero\\\"\\n        );\\n\\n        self.movingFundsTxMaxTotalFee = _movingFundsTxMaxTotalFee;\\n        self.movingFundsDustThreshold = _movingFundsDustThreshold;\\n        self.movingFundsTimeout = _movingFundsTimeout;\\n        self\\n            .movingFundsTimeoutSlashingAmount = _movingFundsTimeoutSlashingAmount;\\n        self\\n            .movingFundsTimeoutNotifierRewardMultiplier = _movingFundsTimeoutNotifierRewardMultiplier;\\n        self.movedFundsSweepTxMaxTotalFee = _movedFundsSweepTxMaxTotalFee;\\n\\n        emit MovingFundsParametersUpdated(\\n            _movingFundsTxMaxTotalFee,\\n            _movingFundsDustThreshold,\\n            _movingFundsTimeout,\\n            _movingFundsTimeoutSlashingAmount,\\n            _movingFundsTimeoutNotifierRewardMultiplier,\\n            _movedFundsSweepTxMaxTotalFee\\n        );\\n    }\\n\\n    /// @notice Updates parameters of wallets.\\n    /// @param _walletCreationPeriod New value of the wallet creation period in\\n    ///        seconds, determines how frequently a new wallet creation can be\\n    ///        requested\\n    /// @param _walletCreationMinBtcBalance New value of the wallet minimum BTC\\n    ///        balance in satoshi, used to decide about wallet creation\\n    /// @param _walletCreationMaxBtcBalance New value of the wallet maximum BTC\\n    ///        balance in satoshi, used to decide about wallet creation\\n    /// @param _walletClosureMinBtcBalance New value of the wallet minimum BTC\\n    ///        balance in satoshi, used to decide about wallet closure\\n    /// @param _walletMaxAge New value of the wallet maximum age in seconds,\\n    ///        indicates the maximum age of a wallet in seconds, after which\\n    ///        the wallet moving funds process can be requested\\n    /// @param _walletMaxBtcTransfer New value of the wallet maximum BTC transfer\\n    ///        in satoshi, determines the maximum amount that can be transferred\\n    ///        to a single target wallet during the moving funds process\\n    /// @param _walletClosingPeriod New value of the wallet closing period in\\n    ///        seconds, determines the length of the wallet closing period,\\n    //         i.e. the period when the wallet remains in the Closing state\\n    //         and can be subject of deposit fraud challenges\\n    /// @dev Requirements:\\n    ///      - Wallet minimum BTC balance must be greater than zero\\n    ///      - Wallet maximum BTC balance must be greater than the wallet\\n    ///        minimum BTC balance\\n    ///      - Wallet maximum BTC transfer must be greater than zero\\n    ///      - Wallet closing period must be greater than zero\\n    function updateWalletParameters(\\n        Storage storage self,\\n        uint32 _walletCreationPeriod,\\n        uint64 _walletCreationMinBtcBalance,\\n        uint64 _walletCreationMaxBtcBalance,\\n        uint64 _walletClosureMinBtcBalance,\\n        uint32 _walletMaxAge,\\n        uint64 _walletMaxBtcTransfer,\\n        uint32 _walletClosingPeriod\\n    ) internal {\\n        require(\\n            _walletCreationMaxBtcBalance > _walletCreationMinBtcBalance,\\n            \\\"Wallet creation maximum BTC balance must be greater than the creation minimum BTC balance\\\"\\n        );\\n        require(\\n            _walletClosureMinBtcBalance > 0,\\n            \\\"Wallet closure minimum BTC balance must be greater than zero\\\"\\n        );\\n        require(\\n            _walletMaxBtcTransfer > 0,\\n            \\\"Wallet maximum BTC transfer must be greater than zero\\\"\\n        );\\n        require(\\n            _walletClosingPeriod > 0,\\n            \\\"Wallet closing period must be greater than zero\\\"\\n        );\\n\\n        self.walletCreationPeriod = _walletCreationPeriod;\\n        self.walletCreationMinBtcBalance = _walletCreationMinBtcBalance;\\n        self.walletCreationMaxBtcBalance = _walletCreationMaxBtcBalance;\\n        self.walletClosureMinBtcBalance = _walletClosureMinBtcBalance;\\n        self.walletMaxAge = _walletMaxAge;\\n        self.walletMaxBtcTransfer = _walletMaxBtcTransfer;\\n        self.walletClosingPeriod = _walletClosingPeriod;\\n\\n        emit WalletParametersUpdated(\\n            _walletCreationPeriod,\\n            _walletCreationMinBtcBalance,\\n            _walletCreationMaxBtcBalance,\\n            _walletClosureMinBtcBalance,\\n            _walletMaxAge,\\n            _walletMaxBtcTransfer,\\n            _walletClosingPeriod\\n        );\\n    }\\n\\n    /// @notice Updates parameters related to frauds.\\n    /// @param _fraudChallengeDepositAmount New value of the fraud challenge\\n    ///        deposit amount in wei, it is the amount of ETH the party\\n    ///        challenging the wallet for fraud needs to deposit\\n    /// @param _fraudChallengeDefeatTimeout New value of the challenge defeat\\n    ///        timeout in seconds, it is the amount of time the wallet has to\\n    ///        defeat a fraud challenge. The value must be greater than zero\\n    /// @param _fraudSlashingAmount New value of the fraud slashing amount in T,\\n    ///        it is the amount slashed from each wallet member for committing\\n    ///        a fraud\\n    /// @param _fraudNotifierRewardMultiplier New value of the fraud notifier\\n    ///        reward multiplier as percentage, it determines the percentage of\\n    ///        the notifier reward from the staking contact the notifier of\\n    ///        a fraud receives. The value must be in the range [0, 100]\\n    /// @dev Requirements:\\n    ///      - Fraud challenge defeat timeout must be greater than 0\\n    ///      - Fraud notifier reward multiplier must be in the range [0, 100]\\n    function updateFraudParameters(\\n        Storage storage self,\\n        uint256 _fraudChallengeDepositAmount,\\n        uint256 _fraudChallengeDefeatTimeout,\\n        uint96 _fraudSlashingAmount,\\n        uint256 _fraudNotifierRewardMultiplier\\n    ) internal {\\n        require(\\n            _fraudChallengeDefeatTimeout > 0,\\n            \\\"Fraud challenge defeat timeout must be greater than zero\\\"\\n        );\\n\\n        require(\\n            _fraudNotifierRewardMultiplier <= 100,\\n            \\\"Fraud notifier reward multiplier must be in the range [0, 100]\\\"\\n        );\\n\\n        self.fraudChallengeDepositAmount = _fraudChallengeDepositAmount;\\n        self.fraudChallengeDefeatTimeout = _fraudChallengeDefeatTimeout;\\n        self.fraudSlashingAmount = _fraudSlashingAmount;\\n        self.fraudNotifierRewardMultiplier = _fraudNotifierRewardMultiplier;\\n\\n        emit FraudParametersUpdated(\\n            _fraudChallengeDepositAmount,\\n            _fraudChallengeDefeatTimeout,\\n            _fraudSlashingAmount,\\n            _fraudNotifierRewardMultiplier\\n        );\\n    }\\n}\\n\",\"keccak256\":\"0x412e9eedfd9a3cb0f33f559badec24ab1b1fcd7c5f66805e9e6cdc279fc1516f\",\"license\":\"MIT\"},\"contracts/bridge/Deposit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\n/// @title Bridge deposit\\n/// @notice The library handles the logic for revealing Bitcoin deposits to\\n///         the Bridge.\\n/// @dev The depositor puts together a P2SH or P2WSH address to deposit the\\n///      funds. This script is unique to each depositor and looks like this:\\n///\\n///      ```\\n///      <depositorAddress> DROP\\n///      <blindingFactor> DROP\\n///      DUP HASH160 <walletPubKeyHash> EQUAL\\n///      IF\\n///        CHECKSIG\\n///      ELSE\\n///        DUP HASH160 <refundPubkeyHash> EQUALVERIFY\\n///        <refundLocktime> CHECKLOCKTIMEVERIFY DROP\\n///        CHECKSIG\\n///      ENDIF\\n///      ```\\n///\\n///      Since each depositor has their own Ethereum address and their own\\n///      secret blinding factor, each depositor\\u2019s script is unique, and the hash\\n///      of each depositor\\u2019s script is unique.\\nlibrary Deposit {\\n    using BTCUtils for bytes;\\n    using BytesLib for bytes;\\n\\n    /// @notice Represents data which must be revealed by the depositor during\\n    ///         deposit reveal.\\n    struct DepositRevealInfo {\\n        // Index of the funding output belonging to the funding transaction.\\n        uint32 fundingOutputIndex;\\n        // Ethereum depositor address.\\n        address depositor;\\n        // The blinding factor as 8 bytes. Byte endianness doesn't matter\\n        // as this factor is not interpreted as uint.\\n        bytes8 blindingFactor;\\n        // The compressed Bitcoin public key (33 bytes and 02 or 03 prefix)\\n        // of the deposit's wallet hashed in the HASH160 Bitcoin opcode style.\\n        bytes20 walletPubKeyHash;\\n        // The compressed Bitcoin public key (33 bytes and 02 or 03 prefix)\\n        // that can be used to make the deposit refund after the refund\\n        // locktime passes. Hashed in the HASH160 Bitcoin opcode style.\\n        bytes20 refundPubKeyHash;\\n        // The refund locktime (4-byte LE). Interpreted according to locktime\\n        // parsing rules described in:\\n        // https://developer.bitcoin.org/devguide/transactions.html#locktime-and-sequence-number\\n        // and used with OP_CHECKLOCKTIMEVERIFY opcode as described in:\\n        // https://github.com/bitcoin/bips/blob/master/bip-0065.mediawiki\\n        bytes4 refundLocktime;\\n        // Address of the Bank vault to which the deposit is routed to.\\n        // Optional, can be 0x0. The vault must be trusted by the Bridge.\\n        address vault;\\n    }\\n\\n    /// @notice Represents tBTC deposit request data.\\n    struct DepositRequest {\\n        // Ethereum depositor address.\\n        address depositor;\\n        // Deposit amount in satoshi.\\n        uint64 amount;\\n        // UNIX timestamp the deposit was revealed at.\\n        uint32 revealedAt;\\n        // Address of the Bank vault the deposit is routed to.\\n        // Optional, can be 0x0.\\n        address vault;\\n        // Treasury TBTC fee in satoshi at the moment of deposit reveal.\\n        uint64 treasuryFee;\\n        // UNIX timestamp the deposit was swept at. Note this is not the\\n        // time when the deposit was swept on the Bitcoin chain but actually\\n        // the time when the sweep proof was delivered to the Ethereum chain.\\n        uint32 sweptAt;\\n    }\\n\\n    event DepositRevealed(\\n        bytes32 fundingTxHash,\\n        uint32 fundingOutputIndex,\\n        address depositor,\\n        uint64 amount,\\n        bytes8 blindingFactor,\\n        bytes20 walletPubKeyHash,\\n        bytes20 refundPubKeyHash,\\n        bytes4 refundLocktime,\\n        address vault\\n    );\\n\\n    /// @notice Used by the depositor to reveal information about their P2(W)SH\\n    ///         Bitcoin deposit to the Bridge on Ethereum chain. The off-chain\\n    ///         wallet listens for revealed deposit events and may decide to\\n    ///         include the revealed deposit in the next executed sweep.\\n    ///         Information about the Bitcoin deposit can be revealed before or\\n    ///         after the Bitcoin transaction with P2(W)SH deposit is mined on\\n    ///         the Bitcoin chain. Worth noting, the gas cost of this function\\n    ///         scales with the number of P2(W)SH transaction inputs and\\n    ///         outputs. The deposit may be routed to one of the trusted vaults.\\n    ///         When a deposit is routed to a vault, vault gets notified when\\n    ///         the deposit gets swept and it may execute the appropriate action.\\n    /// @param fundingTx Bitcoin funding transaction data, see `BitcoinTx.Info`\\n    /// @param reveal Deposit reveal data, see `RevealInfo struct\\n    /// @dev Requirements:\\n    ///      - `reveal.walletPubKeyHash` must identify a `Live` wallet\\n    ///      - `reveal.vault` must be 0x0 or point to a trusted vault\\n    ///      - `reveal.fundingOutputIndex` must point to the actual P2(W)SH\\n    ///        output of the BTC deposit transaction\\n    ///      - `reveal.depositor` must be the Ethereum address used in the\\n    ///        P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.blindingFactor` must be the blinding factor used in the\\n    ///        P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.walletPubKeyHash` must be the wallet pub key hash used in\\n    ///        the P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.refundPubKeyHash` must be the refund pub key hash used in\\n    ///        the P2(W)SH BTC deposit transaction,\\n    ///      - `reveal.refundLocktime` must be the refund locktime used in the\\n    ///        P2(W)SH BTC deposit transaction,\\n    ///      - BTC deposit for the given `fundingTxHash`, `fundingOutputIndex`\\n    ///        can be revealed only one time.\\n    ///\\n    ///      If any of these requirements is not met, the wallet _must_ refuse\\n    ///      to sweep the deposit and the depositor has to wait until the\\n    ///      deposit script unlocks to receive their BTC back.\\n    function revealDeposit(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.Info calldata fundingTx,\\n        DepositRevealInfo calldata reveal\\n    ) external {\\n        require(\\n            self.registeredWallets[reveal.walletPubKeyHash].state ==\\n                Wallets.WalletState.Live,\\n            \\\"Wallet must be in Live state\\\"\\n        );\\n\\n        require(\\n            reveal.vault == address(0) || self.isVaultTrusted[reveal.vault],\\n            \\\"Vault is not trusted\\\"\\n        );\\n\\n        // TODO: Should we enforce a specific locktime at contract level?\\n\\n        bytes memory expectedScript = abi.encodePacked(\\n            hex\\\"14\\\", // Byte length of depositor Ethereum address.\\n            reveal.depositor,\\n            hex\\\"75\\\", // OP_DROP\\n            hex\\\"08\\\", // Byte length of blinding factor value.\\n            reveal.blindingFactor,\\n            hex\\\"75\\\", // OP_DROP\\n            hex\\\"76\\\", // OP_DUP\\n            hex\\\"a9\\\", // OP_HASH160\\n            hex\\\"14\\\", // Byte length of a compressed Bitcoin public key hash.\\n            reveal.walletPubKeyHash,\\n            hex\\\"87\\\", // OP_EQUAL\\n            hex\\\"63\\\", // OP_IF\\n            hex\\\"ac\\\", // OP_CHECKSIG\\n            hex\\\"67\\\", // OP_ELSE\\n            hex\\\"76\\\", // OP_DUP\\n            hex\\\"a9\\\", // OP_HASH160\\n            hex\\\"14\\\", // Byte length of a compressed Bitcoin public key hash.\\n            reveal.refundPubKeyHash,\\n            hex\\\"88\\\", // OP_EQUALVERIFY\\n            hex\\\"04\\\", // Byte length of refund locktime value.\\n            reveal.refundLocktime,\\n            hex\\\"b1\\\", // OP_CHECKLOCKTIMEVERIFY\\n            hex\\\"75\\\", // OP_DROP\\n            hex\\\"ac\\\", // OP_CHECKSIG\\n            hex\\\"68\\\" // OP_ENDIF\\n        );\\n\\n        bytes memory fundingOutput = fundingTx\\n            .outputVector\\n            .extractOutputAtIndex(reveal.fundingOutputIndex);\\n        bytes memory fundingOutputHash = fundingOutput.extractHash();\\n\\n        if (fundingOutputHash.length == 20) {\\n            // A 20-byte output hash is used by P2SH. That hash is constructed\\n            // by applying OP_HASH160 on the locking script. A 20-byte output\\n            // hash is used as well by P2PKH and P2WPKH (OP_HASH160 on the\\n            // public key). However, since we compare the actual output hash\\n            // with an expected locking script hash, this check will succeed only\\n            // for P2SH transaction type with expected script hash value. For\\n            // P2PKH and P2WPKH, it will fail on the output hash comparison with\\n            // the expected locking script hash.\\n            require(\\n                fundingOutputHash.slice20(0) == expectedScript.hash160View(),\\n                \\\"Wrong 20-byte script hash\\\"\\n            );\\n        } else if (fundingOutputHash.length == 32) {\\n            // A 32-byte output hash is used by P2WSH. That hash is constructed\\n            // by applying OP_SHA256 on the locking script.\\n            require(\\n                fundingOutputHash.toBytes32() == sha256(expectedScript),\\n                \\\"Wrong 32-byte script hash\\\"\\n            );\\n        } else {\\n            revert(\\\"Wrong script hash length\\\");\\n        }\\n\\n        // Resulting TX hash is in native Bitcoin little-endian format.\\n        bytes32 fundingTxHash = abi\\n            .encodePacked(\\n                fundingTx.version,\\n                fundingTx.inputVector,\\n                fundingTx.outputVector,\\n                fundingTx.locktime\\n            )\\n            .hash256View();\\n\\n        DepositRequest storage deposit = self.deposits[\\n            uint256(\\n                keccak256(\\n                    abi.encodePacked(fundingTxHash, reveal.fundingOutputIndex)\\n                )\\n            )\\n        ];\\n        require(deposit.revealedAt == 0, \\\"Deposit already revealed\\\");\\n\\n        uint64 fundingOutputAmount = fundingOutput.extractValue();\\n\\n        require(\\n            fundingOutputAmount >= self.depositDustThreshold,\\n            \\\"Deposit amount too small\\\"\\n        );\\n\\n        deposit.amount = fundingOutputAmount;\\n        deposit.depositor = reveal.depositor;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        deposit.revealedAt = uint32(block.timestamp);\\n        deposit.vault = reveal.vault;\\n        deposit.treasuryFee = self.depositTreasuryFeeDivisor > 0\\n            ? fundingOutputAmount / self.depositTreasuryFeeDivisor\\n            : 0;\\n        // slither-disable-next-line reentrancy-events\\n        emit DepositRevealed(\\n            fundingTxHash,\\n            reveal.fundingOutputIndex,\\n            reveal.depositor,\\n            fundingOutputAmount,\\n            reveal.blindingFactor,\\n            reveal.walletPubKeyHash,\\n            reveal.refundPubKeyHash,\\n            reveal.refundLocktime,\\n            reveal.vault\\n        );\\n    }\\n}\\n\",\"keccak256\":\"0x2f3c592eb79ecf1411bb4e98530166efd722d926594e639ba8b09786777237bb\",\"license\":\"MIT\"},\"contracts/bridge/EcdsaLib.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\n\\nlibrary EcdsaLib {\\n    using BytesLib for bytes;\\n\\n    /// @notice Converts public key X and Y coordinates (32-byte each) to a\\n    ///         compressed public key (33-byte). Compressed public key is X\\n    ///         coordinate prefixed with `02` or `03` based on the Y coordinate parity.\\n    ///         It is expected that the uncompressed public key is stripped\\n    ///         (i.e. it is not prefixed with `04`).\\n    /// @param x Wallet's public key's X coordinate.\\n    /// @param y Wallet's public key's Y coordinate.\\n    /// @return Compressed public key (33-byte), prefixed with `02` or `03`.\\n    function compressPublicKey(bytes32 x, bytes32 y)\\n        internal\\n        pure\\n        returns (bytes memory)\\n    {\\n        bytes1 prefix;\\n        if (uint256(y) % 2 == 0) {\\n            prefix = hex\\\"02\\\";\\n        } else {\\n            prefix = hex\\\"03\\\";\\n        }\\n\\n        return bytes.concat(prefix, x);\\n    }\\n}\\n\",\"keccak256\":\"0x0b1b1755b6332c9d6d58a1d156a7151905a656faa7768345eb190b938f48c38d\",\"license\":\"MIT\"},\"contracts/bridge/Fraud.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {CheckBitcoinSigs} from \\\"@keep-network/bitcoin-spv-sol/contracts/CheckBitcoinSigs.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./EcdsaLib.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\n/// @title Bridge fraud\\n/// @notice The library handles the logic for challenging Bridge wallets that\\n///         committed fraud.\\n/// @dev Anyone can submit a fraud challenge indicating that a UTXO being under\\n///      the wallet control was unlocked by the wallet but was not used\\n///      according to the protocol rules. That means the wallet signed\\n///      a transaction input pointing to that UTXO and there is a unique\\n///      sighash and signature pair associated with that input.\\n///\\n///      In order to defeat the challenge, the same wallet public key and\\n///      signature must be provided as were used to calculate the sighash during\\n///      the challenge. The wallet provides the preimage which produces sighash\\n///      used to generate the ECDSA signature that is the subject of the fraud\\n///      claim. The fraud challenge defeat attempt will only succeed if the\\n///      inputs in the preimage are considered honestly spent by the wallet.\\n///      Therefore the transaction spending the UTXO must be proven in the\\n///      Bridge before a challenge defeat is called.\\nlibrary Fraud {\\n    using Wallets for BridgeState.Storage;\\n\\n    using BytesLib for bytes;\\n    using BTCUtils for bytes;\\n    using BTCUtils for uint32;\\n    using EcdsaLib for bytes;\\n\\n    struct FraudChallenge {\\n        // The address of the party challenging the wallet.\\n        address challenger;\\n        // The amount of ETH the challenger deposited.\\n        uint256 depositAmount;\\n        // The timestamp the challenge was submitted at.\\n        uint32 reportedAt;\\n        // The flag indicating whether the challenge has been resolved.\\n        bool resolved;\\n    }\\n\\n    event FraudChallengeSubmitted(\\n        bytes20 walletPubKeyHash,\\n        bytes32 sighash,\\n        uint8 v,\\n        bytes32 r,\\n        bytes32 s\\n    );\\n\\n    event FraudChallengeDefeated(bytes20 walletPubKeyHash, bytes32 sighash);\\n\\n    event FraudChallengeDefeatTimedOut(\\n        bytes20 walletPubKeyHash,\\n        bytes32 sighash\\n    );\\n\\n    /// @notice Submits a fraud challenge indicating that a UTXO being under\\n    ///         wallet control was unlocked by the wallet but was not used\\n    ///         according to the protocol rules. That means the wallet signed\\n    ///         a transaction input pointing to that UTXO and there is a unique\\n    ///         sighash and signature pair associated with that input. This\\n    ///         function uses those parameters to create a fraud accusation that\\n    ///         proves a given transaction input unlocking the given UTXO was\\n    ///         actually signed by the wallet. This function cannot determine\\n    ///         whether the transaction was actually broadcast and the input was\\n    ///         consumed in a fraudulent way so it just opens a challenge period\\n    ///         during which the wallet can defeat the challenge by submitting\\n    ///         proof of a transaction that consumes the given input according\\n    ///         to protocol rules. To prevent spurious allegations, the caller\\n    ///         must deposit ETH that is returned back upon justified fraud\\n    ///         challenge or confiscated otherwise\\n    /// @param walletPublicKey The public key of the wallet in the uncompressed\\n    ///        and unprefixed format (64 bytes)\\n    /// @param sighash The hash that was used to produce the ECDSA signature\\n    ///        that is the subject of the fraud claim. This hash is constructed\\n    ///        by applying double SHA-256 over a serialized subset of the\\n    ///        transaction. The exact subset used as hash preimage depends on\\n    ///        the transaction input the signature is produced for. See BIP-143\\n    ///        for reference\\n    /// @param signature Bitcoin signature in the R/S/V format\\n    /// @dev Requirements:\\n    ///      - Wallet behind `walletPublicKey` must be in Live or MovingFunds\\n    ///        or Closing state\\n    ///      - The challenger must send appropriate amount of ETH used as\\n    ///        fraud challenge deposit\\n    ///      - The signature (represented by r, s and v) must be generated by\\n    ///        the wallet behind `walletPublicKey` during signing of `sighash`\\n    ///      - Wallet can be challenged for the given signature only once\\n    function submitFraudChallenge(\\n        BridgeState.Storage storage self,\\n        bytes calldata walletPublicKey,\\n        bytes32 sighash,\\n        BitcoinTx.RSVSignature calldata signature\\n    ) external {\\n        require(\\n            msg.value >= self.fraudChallengeDepositAmount,\\n            \\\"The amount of ETH deposited is too low\\\"\\n        );\\n\\n        require(\\n            CheckBitcoinSigs.checkSig(\\n                walletPublicKey,\\n                sighash,\\n                signature.v,\\n                signature.r,\\n                signature.s\\n            ),\\n            \\\"Signature verification failure\\\"\\n        );\\n\\n        bytes memory compressedWalletPublicKey = EcdsaLib.compressPublicKey(\\n            walletPublicKey.slice32(0),\\n            walletPublicKey.slice32(32)\\n        );\\n        bytes20 walletPubKeyHash = compressedWalletPublicKey.hash160View();\\n\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        require(\\n            wallet.state == Wallets.WalletState.Live ||\\n                wallet.state == Wallets.WalletState.MovingFunds ||\\n                wallet.state == Wallets.WalletState.Closing,\\n            \\\"Wallet must be in Live or MovingFunds or Closing state\\\"\\n        );\\n\\n        uint256 challengeKey = uint256(\\n            keccak256(abi.encodePacked(walletPublicKey, sighash))\\n        );\\n\\n        FraudChallenge storage challenge = self.fraudChallenges[challengeKey];\\n        require(challenge.reportedAt == 0, \\\"Fraud challenge already exists\\\");\\n\\n        challenge.challenger = msg.sender;\\n        challenge.depositAmount = msg.value;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        challenge.reportedAt = uint32(block.timestamp);\\n        challenge.resolved = false;\\n        // slither-disable-next-line reentrancy-events\\n        emit FraudChallengeSubmitted(\\n            walletPubKeyHash,\\n            sighash,\\n            signature.v,\\n            signature.r,\\n            signature.s\\n        );\\n    }\\n\\n    /// @notice Allows to defeat a pending fraud challenge against a wallet if\\n    ///         the transaction that spends the UTXO follows the protocol rules.\\n    ///         In order to defeat the challenge the same `walletPublicKey` and\\n    ///         signature (represented by `r`, `s` and `v`) must be provided as\\n    ///         were used to calculate the sighash during input signing.\\n    ///         The fraud challenge defeat attempt will only succeed if the\\n    ///         inputs in the preimage are considered honestly spent by the\\n    ///         wallet. Therefore the transaction spending the UTXO must be\\n    ///         proven in the Bridge before a challenge defeat is called.\\n    ///         If successfully defeated, the fraud challenge is marked as\\n    ///         resolved and the amount of ether deposited by the challenger is\\n    ///         sent to the treasury.\\n    /// @param walletPublicKey The public key of the wallet in the uncompressed\\n    ///        and unprefixed format (64 bytes)\\n    /// @param preimage The preimage which produces sighash used to generate the\\n    ///        ECDSA signature that is the subject of the fraud claim. It is a\\n    ///        serialized subset of the transaction. The exact subset used as\\n    ///        the preimage depends on the transaction input the signature is\\n    ///        produced for. See BIP-143 for reference\\n    /// @param witness Flag indicating whether the preimage was produced for a\\n    ///        witness input. True for witness, false for non-witness input.\\n    /// @dev Requirements:\\n    ///      - `walletPublicKey` and `sighash` calculated as `hash256(preimage)`\\n    ///        must identify an open fraud challenge\\n    ///      - the preimage must be a valid preimage of a transaction generated\\n    ///        according to the protocol rules and already proved in the Bridge\\n    ///      - before a defeat attempt is made the transaction that spends the\\n    ///        given UTXO must be proven in the Bridge\\n    function defeatFraudChallenge(\\n        BridgeState.Storage storage self,\\n        bytes calldata walletPublicKey,\\n        bytes calldata preimage,\\n        bool witness\\n    ) external {\\n        bytes32 sighash = preimage.hash256();\\n\\n        uint256 challengeKey = uint256(\\n            keccak256(abi.encodePacked(walletPublicKey, sighash))\\n        );\\n\\n        FraudChallenge storage challenge = self.fraudChallenges[challengeKey];\\n\\n        require(challenge.reportedAt > 0, \\\"Fraud challenge does not exist\\\");\\n        require(\\n            !challenge.resolved,\\n            \\\"Fraud challenge has already been resolved\\\"\\n        );\\n\\n        // Ensure SIGHASH_ALL type was used during signing, which is represented\\n        // by type value `1`.\\n        require(extractSighashType(preimage) == 1, \\\"Wrong sighash type\\\");\\n\\n        uint256 utxoKey = witness\\n            ? extractUtxoKeyFromWitnessPreimage(preimage)\\n            : extractUtxoKeyFromNonWitnessPreimage(preimage);\\n\\n        // Check that the UTXO key identifies a correctly spent UTXO.\\n        require(\\n            self.deposits[utxoKey].sweptAt > 0 || self.spentMainUTXOs[utxoKey],\\n            \\\"Spent UTXO not found among correctly spent UTXOs\\\"\\n        );\\n\\n        // Mark the challenge as resolved as it was successfully defeated\\n        challenge.resolved = true;\\n\\n        // Send the ether deposited by the challenger to the treasury\\n        /* solhint-disable avoid-low-level-calls */\\n        // slither-disable-next-line low-level-calls,unchecked-lowlevel,arbitrary-send\\n        self.treasury.call{gas: 100000, value: challenge.depositAmount}(\\\"\\\");\\n        /* solhint-enable avoid-low-level-calls */\\n\\n        bytes memory compressedWalletPublicKey = EcdsaLib.compressPublicKey(\\n            walletPublicKey.slice32(0),\\n            walletPublicKey.slice32(32)\\n        );\\n        bytes20 walletPubKeyHash = compressedWalletPublicKey.hash160View();\\n        // slither-disable-next-line reentrancy-events\\n        emit FraudChallengeDefeated(walletPubKeyHash, sighash);\\n    }\\n\\n    /// @notice Notifies about defeat timeout for the given fraud challenge.\\n    ///         Can be called only if there was a fraud challenge identified by\\n    ///         the provided `walletPublicKey` and `sighash` and it was not\\n    ///         defeated on time. The amount of time that needs to pass after a\\n    ///         fraud challenge is reported is indicated by the\\n    ///         `challengeDefeatTimeout`. After a successful fraud challenge\\n    ///         defeat timeout notification the fraud challenge is marked as\\n    ///         resolved, the stake of each operator is slashed, the ether\\n    ///         deposited is returned to the challenger and the challenger is\\n    ///         rewarded.\\n    /// @param walletPublicKey The public key of the wallet in the uncompressed\\n    ///        and unprefixed format (64 bytes)\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @param sighash The hash that was used to produce the ECDSA signature\\n    ///        that is the subject of the fraud claim. This hash is constructed\\n    ///        by applying double SHA-256 over a serialized subset of the\\n    ///        transaction. The exact subset used as hash preimage depends on\\n    ///        the transaction input the signature is produced for. See BIP-143\\n    ///        for reference\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the Live or MovingFunds or Closing or\\n    ///        Terminated state\\n    ///      - The `walletPublicKey` and `sighash` must identify an open fraud\\n    ///        challenge\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events of the `WalletRegistry` contract\\n    ///      - The amount of time indicated by `challengeDefeatTimeout` must pass\\n    ///        after the challenge was reported\\n    function notifyFraudChallengeDefeatTimeout(\\n        BridgeState.Storage storage self,\\n        bytes calldata walletPublicKey,\\n        uint32[] calldata walletMembersIDs,\\n        bytes32 sighash\\n    ) external {\\n        uint256 challengeKey = uint256(\\n            keccak256(abi.encodePacked(walletPublicKey, sighash))\\n        );\\n\\n        FraudChallenge storage challenge = self.fraudChallenges[challengeKey];\\n\\n        require(challenge.reportedAt > 0, \\\"Fraud challenge does not exist\\\");\\n\\n        require(\\n            !challenge.resolved,\\n            \\\"Fraud challenge has already been resolved\\\"\\n        );\\n\\n        require(\\n            /* solhint-disable-next-line not-rely-on-time */\\n            block.timestamp >=\\n                challenge.reportedAt + self.fraudChallengeDefeatTimeout,\\n            \\\"Fraud challenge defeat period did not time out yet\\\"\\n        );\\n\\n        challenge.resolved = true;\\n        // Return the ether deposited by the challenger\\n        /* solhint-disable avoid-low-level-calls */\\n        // slither-disable-next-line low-level-calls,unchecked-lowlevel\\n        challenge.challenger.call{gas: 100000, value: challenge.depositAmount}(\\n            \\\"\\\"\\n        );\\n        /* solhint-enable avoid-low-level-calls */\\n\\n        bytes memory compressedWalletPublicKey = EcdsaLib.compressPublicKey(\\n            walletPublicKey.slice32(0),\\n            walletPublicKey.slice32(32)\\n        );\\n        bytes20 walletPubKeyHash = compressedWalletPublicKey.hash160View();\\n\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        Wallets.WalletState walletState = wallet.state;\\n\\n        if (\\n            walletState == Wallets.WalletState.Live ||\\n            walletState == Wallets.WalletState.MovingFunds ||\\n            walletState == Wallets.WalletState.Closing\\n        ) {\\n            self.terminateWallet(walletPubKeyHash);\\n\\n            self.ecdsaWalletRegistry.seize(\\n                self.fraudSlashingAmount,\\n                self.fraudNotifierRewardMultiplier,\\n                challenge.challenger,\\n                wallet.ecdsaWalletID,\\n                walletMembersIDs\\n            );\\n        } else if (walletState == Wallets.WalletState.Terminated) {\\n            // This is a special case when the wallet was already terminated\\n            // due to a previous deliberate protocol violation. In that\\n            // case, this function should be still callable for other fraud\\n            // challenges timeouts in order to let the challenger unlock its\\n            // ETH deposit back. However, the wallet termination logic is\\n            // not called and the challenger is not rewarded.\\n        } else {\\n            revert(\\n                \\\"Wallet must be in Live or MovingFunds or Closing or Terminated state\\\"\\n            );\\n        }\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit FraudChallengeDefeatTimedOut(walletPubKeyHash, sighash);\\n    }\\n\\n    /// @notice Extracts the UTXO keys from the given preimage used during\\n    ///         signing of a witness input.\\n    /// @param preimage The preimage which produces sighash used to generate the\\n    ///        ECDSA signature that is the subject of the fraud claim. It is a\\n    ///        serialized subset of the transaction. The exact subset used as\\n    ///        the preimage depends on the transaction input the signature is\\n    ///        produced for. See BIP-143 for reference\\n    /// @return utxoKey UTXO key that identifies spent input.\\n    function extractUtxoKeyFromWitnessPreimage(bytes calldata preimage)\\n        internal\\n        pure\\n        returns (uint256 utxoKey)\\n    {\\n        // The expected structure of the preimage created during signing of a\\n        // witness input:\\n        // - transaction version (4 bytes)\\n        // - hash of previous outpoints of all inputs (32 bytes)\\n        // - hash of sequences of all inputs (32 bytes)\\n        // - outpoint (hash + index) of the input being signed (36 bytes)\\n        // - the unlocking script of the input (variable length)\\n        // - value of the outpoint (8 bytes)\\n        // - sequence of the input being signed (4 bytes)\\n        // - hash of all outputs (32 bytes)\\n        // - transaction locktime (4 bytes)\\n        // - sighash type (4 bytes)\\n\\n        // See Bitcoin's BIP-143 for reference:\\n        // https://github.com/bitcoin/bips/blob/master/bip-0143.mediawiki.\\n\\n        // The outpoint (hash and index) is located at the constant offset of\\n        // 68 (4 + 32 + 32).\\n        bytes32 outpointTxHash = preimage.extractInputTxIdLeAt(68);\\n        uint32 outpointIndex = BTCUtils.reverseUint32(\\n            uint32(preimage.extractTxIndexLeAt(68))\\n        );\\n\\n        return\\n            uint256(keccak256(abi.encodePacked(outpointTxHash, outpointIndex)));\\n    }\\n\\n    /// @notice Extracts the UTXO key from the given preimage used during\\n    ///         signing of a non-witness input.\\n    /// @param preimage The preimage which produces sighash used to generate the\\n    ///        ECDSA signature that is the subject of the fraud claim. It is a\\n    ///        serialized subset of the transaction. The exact subset used as\\n    ///        the preimage depends on the transaction input the signature is\\n    ///        produced for. See BIP-143 for reference\\n    /// @return utxoKey UTXO key that identifies spent input.\\n    function extractUtxoKeyFromNonWitnessPreimage(bytes calldata preimage)\\n        internal\\n        pure\\n        returns (uint256 utxoKey)\\n    {\\n        // The expected structure of the preimage created during signing of a\\n        // non-witness input:\\n        // - transaction version (4 bytes)\\n        // - number of inputs written as compactSize uint (1 byte, 3 bytes,\\n        //   5 bytes or 9 bytes)\\n        // - for each input\\n        //   - outpoint (hash and index) (36 bytes)\\n        //   - unlocking script for the input being signed (variable length)\\n        //     or `00` for all other inputs (1 byte)\\n        //   - input sequence (4 bytes)\\n        // - number of outputs written as compactSize uint (1 byte, 3 bytes,\\n        //   5 bytes or 9 bytes)\\n        // - outputs (variable length)\\n        // - transaction locktime (4 bytes)\\n        // - sighash type (4 bytes)\\n\\n        // See example for reference:\\n        // https://en.bitcoin.it/wiki/OP_CHECKSIG#Code_samples_and_raw_dumps.\\n\\n        // The input data begins at the constant offset of 4 (the first 4 bytes\\n        // are for the transaction version).\\n        (uint256 inputsCompactSizeUintLength, uint256 inputsCount) = preimage\\n            .parseVarIntAt(4);\\n\\n        // To determine the first input starting index, we must jump 4 bytes\\n        // over the transaction version length and the compactSize uint which\\n        // prepends the input vector. One byte must be added because\\n        // `BtcUtils.parseVarInt` does not include compactSize uint tag in the\\n        // returned length.\\n        //\\n        // For >= 0 && <= 252, `BTCUtils.determineVarIntDataLengthAt`\\n        // returns `0`, so we jump over one byte of compactSize uint.\\n        //\\n        // For >= 253 && <= 0xffff there is `0xfd` tag,\\n        // `BTCUtils.determineVarIntDataLengthAt` returns `2` (no\\n        // tag byte included) so we need to jump over 1+2 bytes of\\n        // compactSize uint.\\n        //\\n        // Please refer `BTCUtils` library and compactSize uint\\n        // docs in `BitcoinTx` library for more details.\\n        uint256 inputStartingIndex = 4 + 1 + inputsCompactSizeUintLength;\\n\\n        for (uint256 i = 0; i < inputsCount; i++) {\\n            uint256 inputLength = preimage.determineInputLengthAt(\\n                inputStartingIndex\\n            );\\n\\n            (, uint256 scriptSigLength) = preimage.extractScriptSigLenAt(\\n                inputStartingIndex\\n            );\\n\\n            if (scriptSigLength > 0) {\\n                // The input this preimage was generated for was found.\\n                // All the other inputs in the preimage are marked with a null\\n                // scriptSig (\\\"00\\\") which has length of 1.\\n                bytes32 outpointTxHash = preimage.extractInputTxIdLeAt(\\n                    inputStartingIndex\\n                );\\n                uint32 outpointIndex = BTCUtils.reverseUint32(\\n                    uint32(preimage.extractTxIndexLeAt(inputStartingIndex))\\n                );\\n\\n                utxoKey = uint256(\\n                    keccak256(abi.encodePacked(outpointTxHash, outpointIndex))\\n                );\\n\\n                break;\\n            }\\n\\n            inputStartingIndex += inputLength;\\n        }\\n\\n        return utxoKey;\\n    }\\n\\n    /// @notice Extracts the sighash type from the given preimage.\\n    /// @param preimage Serialized subset of the transaction. See BIP-143 for\\n    ///        reference\\n    /// @dev Sighash type is stored as the last 4 bytes in the preimage (little\\n    ///      endian).\\n    /// @return sighashType Sighash type as a 32-bit integer.\\n    function extractSighashType(bytes calldata preimage)\\n        internal\\n        pure\\n        returns (uint32 sighashType)\\n    {\\n        bytes4 sighashTypeBytes = preimage.slice4(preimage.length - 4);\\n        uint32 sighashTypeLE = uint32(sighashTypeBytes);\\n        return sighashTypeLE.reverseUint32();\\n    }\\n}\\n\",\"keccak256\":\"0xbb2b4056d6053cf430e6dba9b1d25f257db5bd08388988441bd562894b844de2\",\"license\":\"MIT\"},\"contracts/bridge/IRelay.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\n/// @title Interface for the Bitcoin relay\\n/// @notice Contains only the methods needed by tBTC v2. The Bitcoin relay\\n///         provides the difficulty of the previous and current epoch. One\\n///         difficulty epoch spans 2016 blocks.\\ninterface IRelay {\\n    /// @notice Returns the difficulty of the current epoch.\\n    function getCurrentEpochDifficulty() external view returns (uint256);\\n\\n    /// @notice Returns the difficulty of the previous epoch.\\n    function getPrevEpochDifficulty() external view returns (uint256);\\n}\\n\",\"keccak256\":\"0xc8d3f66aacc2e9f645397e0114f9671099acade21ef5805ae1de297773c9c81a\",\"license\":\"MIT\"},\"contracts/bridge/MovingFunds.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\nimport \\\"./Redemption.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\n/// @title Moving Bridge wallet funds\\n/// @notice The library handles the logic for moving Bitcoin between Bridge\\n///         wallets.\\n/// @dev A wallet that failed a heartbeat, did not process requested redemption\\n///      on time, or qualifies to be closed, begins the procedure of moving\\n///      funds to other wallets in the Bridge. The wallet needs to commit to\\n///      which other Live wallets it is moving the funds to and then, provide an\\n///      SPV proof of moving funds to the previously committed wallets.\\n///      Once the proof is submitted, all target wallets are supposed to\\n///      sweep the received UTXOs with their own main UTXOs in order to\\n///      update their BTC balances.\\nlibrary MovingFunds {\\n    using BridgeState for BridgeState.Storage;\\n    using Wallets for BridgeState.Storage;\\n    using BitcoinTx for BridgeState.Storage;\\n\\n    using BTCUtils for bytes;\\n    using BytesLib for bytes;\\n\\n    /// @notice Represents temporary information needed during the processing\\n    ///         of the moving funds Bitcoin transaction outputs. This structure\\n    ///         is an internal one and should not be exported outside of the\\n    ///         moving funds transaction processing code.\\n    /// @dev Allows to mitigate \\\"stack too deep\\\" errors on EVM.\\n    struct MovingFundsTxOutputsProcessingInfo {\\n        // 32-byte hash of the moving funds Bitcoin transaction.\\n        bytes32 movingFundsTxHash;\\n        // Output vector of the moving funds Bitcoin transaction. It is\\n        // assumed the vector's structure is valid so it must be validated\\n        // using e.g. `BTCUtils.validateVout` function before being used\\n        // during the processing. The validation is usually done as part\\n        // of the `BitcoinTx.validateProof` call that checks the SPV proof.\\n        bytes movingFundsTxOutputVector;\\n    }\\n\\n    /// @notice Represents a moved funds sweep request. The request is\\n    ///         registered in `submitMovingFundsProof` where we know funds\\n    ///         have been moved to the target wallet and the only step left is\\n    ///         to have the target wallet sweep them.\\n    struct MovedFundsSweepRequest {\\n        // 20-byte public key hash of the wallet supposed to sweep the UTXO\\n        // representing the received funds with their own main UTXO\\n        bytes20 walletPubKeyHash;\\n        // Value of the received funds.\\n        uint64 value;\\n        // UNIX timestamp the request was created at.\\n        uint32 createdAt;\\n        // UNIX timestamp the funds were swept at.\\n        uint32 sweptAt;\\n    }\\n\\n    event MovingFundsCommitmentSubmitted(\\n        bytes20 walletPubKeyHash,\\n        bytes20[] targetWallets,\\n        address submitter\\n    );\\n\\n    event MovingFundsCompleted(\\n        bytes20 walletPubKeyHash,\\n        bytes32 movingFundsTxHash\\n    );\\n\\n    event MovingFundsTimedOut(bytes20 walletPubKeyHash);\\n\\n    event MovingFundsBelowDustReported(bytes20 walletPubKeyHash);\\n\\n    event MovedFundsSwept(bytes20 walletPubKeyHash, bytes32 sweepTxHash);\\n\\n    /// @notice Submits the moving funds target wallets commitment.\\n    ///         Once all requirements are met, that function registers the\\n    ///         target wallets commitment and opens the way for moving funds\\n    ///         proof submission.\\n    /// @param walletPubKeyHash 20-byte public key hash of the source wallet\\n    /// @param walletMainUtxo Data of the source wallet's main UTXO, as\\n    ///        currently known on the Ethereum chain\\n    /// @param walletMembersIDs Identifiers of the source wallet signing group\\n    ///        members\\n    /// @param walletMemberIndex Position of the caller in the source wallet\\n    ///        signing group members list\\n    /// @param targetWallets List of 20-byte public key hashes of the target\\n    ///        wallets that the source wallet commits to move the funds to\\n    /// @dev Requirements:\\n    ///      - The source wallet must be in the MovingFunds state\\n    ///      - The source wallet must not have pending redemption requests\\n    ///      - The source wallet must not have pending moved funds sweep requests\\n    ///      - The source wallet must not have submitted its commitment already\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given source wallet in the ECDSA registry. Those IDs are\\n    ///        not directly stored in the contract for gas efficiency purposes\\n    ///        but they can be read from appropriate `DkgResultSubmitted`\\n    ///        and `DkgResultApproved` events.\\n    ///      - The `walletMemberIndex` must be in range [1, walletMembersIDs.length]\\n    ///      - The caller must be the member of the source wallet signing group\\n    ///        at the position indicated by `walletMemberIndex` parameter\\n    ///      - The `walletMainUtxo` components must point to the recent main\\n    ///        UTXO of the source wallet, as currently known on the Ethereum\\n    ///        chain.\\n    ///      - Source wallet BTC balance must be greater than zero\\n    ///      - At least one Live wallet must exist in the system\\n    ///      - Submitted target wallets count must match the expected count\\n    ///        `N = min(liveWalletsCount, ceil(walletBtcBalance / walletMaxBtcTransfer))`\\n    ///        where `N > 0`\\n    ///      - Each target wallet must be not equal to the source wallet\\n    ///      - Each target wallet must follow the expected order i.e. all\\n    ///        target wallets 20-byte public key hashes represented as numbers\\n    ///        must form a strictly increasing sequence without duplicates.\\n    ///      - Each target wallet must be in Live state\\n    function submitMovingFundsCommitment(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata walletMainUtxo,\\n        uint32[] calldata walletMembersIDs,\\n        uint256 walletMemberIndex,\\n        bytes20[] calldata targetWallets\\n    ) external {\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        require(\\n            wallet.state == Wallets.WalletState.MovingFunds,\\n            \\\"Source wallet must be in MovingFunds state\\\"\\n        );\\n\\n        require(\\n            wallet.pendingRedemptionsValue == 0,\\n            \\\"Source wallet must handle all pending redemptions first\\\"\\n        );\\n\\n        require(\\n            wallet.pendingMovedFundsSweepRequestsCount == 0,\\n            \\\"Source wallet must handle all pending moved funds sweep requests first\\\"\\n        );\\n\\n        require(\\n            wallet.movingFundsTargetWalletsCommitmentHash == bytes32(0),\\n            \\\"Target wallets commitment already submitted\\\"\\n        );\\n\\n        require(\\n            self.ecdsaWalletRegistry.isWalletMember(\\n                wallet.ecdsaWalletID,\\n                walletMembersIDs,\\n                msg.sender,\\n                walletMemberIndex\\n            ),\\n            \\\"Caller is not a member of the source wallet\\\"\\n        );\\n\\n        uint64 walletBtcBalance = self.getWalletBtcBalance(\\n            walletPubKeyHash,\\n            walletMainUtxo\\n        );\\n\\n        require(walletBtcBalance > 0, \\\"Wallet BTC balance is zero\\\");\\n\\n        uint256 expectedTargetWalletsCount = Math.min(\\n            self.liveWalletsCount,\\n            Math.ceilDiv(walletBtcBalance, self.walletMaxBtcTransfer)\\n        );\\n\\n        // This requirement fails only when `liveWalletsCount` is zero. In\\n        // that case, the system cannot accept the commitment and must provide\\n        // new wallets first.\\n        //\\n        // TODO: Expose separate function to reset the moving funds timeout\\n        //       if no Live wallets exist in the system.\\n        require(expectedTargetWalletsCount > 0, \\\"No target wallets available\\\");\\n\\n        require(\\n            targetWallets.length == expectedTargetWalletsCount,\\n            \\\"Submitted target wallets count is other than expected\\\"\\n        );\\n\\n        uint160 lastProcessedTargetWallet = 0;\\n\\n        for (uint256 i = 0; i < targetWallets.length; i++) {\\n            bytes20 targetWallet = targetWallets[i];\\n\\n            require(\\n                targetWallet != walletPubKeyHash,\\n                \\\"Submitted target wallet cannot be equal to the source wallet\\\"\\n            );\\n\\n            require(\\n                uint160(targetWallet) > lastProcessedTargetWallet,\\n                \\\"Submitted target wallet breaks the expected order\\\"\\n            );\\n\\n            require(\\n                self.registeredWallets[targetWallet].state ==\\n                    Wallets.WalletState.Live,\\n                \\\"Submitted target wallet must be in Live state\\\"\\n            );\\n\\n            lastProcessedTargetWallet = uint160(targetWallet);\\n        }\\n\\n        wallet.movingFundsTargetWalletsCommitmentHash = keccak256(\\n            abi.encodePacked(targetWallets)\\n        );\\n\\n        emit MovingFundsCommitmentSubmitted(\\n            walletPubKeyHash,\\n            targetWallets,\\n            msg.sender\\n        );\\n    }\\n\\n    /// @notice Used by the wallet to prove the BTC moving funds transaction\\n    ///         and to make the necessary state changes. Moving funds is only\\n    ///         accepted if it satisfies SPV proof.\\n    ///\\n    ///         The function validates the moving funds transaction structure\\n    ///         by checking if it actually spends the main UTXO of the declared\\n    ///         wallet and locks the value on the pre-committed target wallets\\n    ///         using a reasonable transaction fee. If all preconditions are\\n    ///         met, this functions closes the source wallet.\\n    ///\\n    ///         It is possible to prove the given moving funds transaction only\\n    ///         one time.\\n    /// @param movingFundsTx Bitcoin moving funds transaction data\\n    /// @param movingFundsProof Bitcoin moving funds proof data\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    ///        HASH160 over the compressed ECDSA public key) of the wallet\\n    ///        which performed the moving funds transaction\\n    /// @dev Requirements:\\n    ///      - `movingFundsTx` components must match the expected structure. See\\n    ///        `BitcoinTx.Info` docs for reference. Their values must exactly\\n    ///        correspond to appropriate Bitcoin transaction fields to produce\\n    ///        a provable transaction hash.\\n    ///      - The `movingFundsTx` should represent a Bitcoin transaction with\\n    ///        exactly 1 input that refers to the wallet's main UTXO. That\\n    ///        transaction should have 1..n outputs corresponding to the\\n    ///        pre-committed target wallets. Outputs must be ordered in the\\n    ///        same way as their corresponding target wallets are ordered\\n    ///        within the target wallets commitment.\\n    ///      - `movingFundsProof` components must match the expected structure.\\n    ///        See `BitcoinTx.Proof` docs for reference. The `bitcoinHeaders`\\n    ///        field must contain a valid number of block headers, not less\\n    ///        than the `txProofDifficultyFactor` contract constant.\\n    ///      - `mainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///        Additionally, the recent main UTXO on Ethereum must be set.\\n    ///      - `walletPubKeyHash` must be connected with the main UTXO used\\n    ///        as transaction single input.\\n    ///      - The wallet that `walletPubKeyHash` points to must be in the\\n    ///        MovingFunds state.\\n    ///      - The target wallets commitment must be submitted by the wallet\\n    ///        that `walletPubKeyHash` points to.\\n    ///      - The total Bitcoin transaction fee must be lesser or equal\\n    ///        to `movingFundsTxMaxTotalFee` governable parameter.\\n    function submitMovingFundsProof(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.Info calldata movingFundsTx,\\n        BitcoinTx.Proof calldata movingFundsProof,\\n        BitcoinTx.UTXO calldata mainUtxo,\\n        bytes20 walletPubKeyHash\\n    ) external {\\n        // The actual transaction proof is performed here. After that point, we\\n        // can assume the transaction happened on Bitcoin chain and has\\n        // a sufficient number of confirmations as determined by\\n        // `txProofDifficultyFactor` constant.\\n        bytes32 movingFundsTxHash = self.validateProof(\\n            movingFundsTx,\\n            movingFundsProof\\n        );\\n\\n        // Process the moving funds transaction input. Specifically, check if\\n        // it refers to the expected wallet's main UTXO.\\n        OutboundTx.processWalletOutboundTxInput(\\n            self,\\n            movingFundsTx.inputVector,\\n            mainUtxo,\\n            walletPubKeyHash\\n        );\\n\\n        (\\n            bytes32 targetWalletsHash,\\n            uint256 outputsTotalValue\\n        ) = processMovingFundsTxOutputs(\\n                self,\\n                MovingFundsTxOutputsProcessingInfo(\\n                    movingFundsTxHash,\\n                    movingFundsTx.outputVector\\n                )\\n            );\\n\\n        require(\\n            mainUtxo.txOutputValue - outputsTotalValue <=\\n                self.movingFundsTxMaxTotalFee,\\n            \\\"Transaction fee is too high\\\"\\n        );\\n\\n        self.notifyWalletFundsMoved(walletPubKeyHash, targetWalletsHash);\\n        // slither-disable-next-line reentrancy-events\\n        emit MovingFundsCompleted(walletPubKeyHash, movingFundsTxHash);\\n    }\\n\\n    /// @notice Processes the moving funds Bitcoin transaction output vector\\n    ///         and extracts information required for further processing.\\n    /// @param processInfo Processing info containing the moving funds tx\\n    ///        hash and output vector.\\n    /// @return targetWalletsHash keccak256 hash over the list of actual\\n    ///         target wallets used in the transaction.\\n    /// @return outputsTotalValue Sum of all outputs values.\\n    /// @dev Requirements:\\n    ///      - The `movingFundsTxOutputVector` must be parseable, i.e. must\\n    ///        be validated by the caller as stated in their parameter doc.\\n    ///      - Each output must refer to a 20-byte public key hash.\\n    ///      - The total outputs value must be evenly divided over all outputs.\\n    function processMovingFundsTxOutputs(\\n        BridgeState.Storage storage self,\\n        MovingFundsTxOutputsProcessingInfo memory processInfo\\n    ) internal returns (bytes32 targetWalletsHash, uint256 outputsTotalValue) {\\n        // Determining the total number of Bitcoin transaction outputs in\\n        // the same way as for number of inputs. See `BitcoinTx.outputVector`\\n        // docs for more details.\\n        (\\n            uint256 outputsCompactSizeUintLength,\\n            uint256 outputsCount\\n        ) = processInfo.movingFundsTxOutputVector.parseVarInt();\\n\\n        // To determine the first output starting index, we must jump over\\n        // the compactSize uint which prepends the output vector. One byte\\n        // must be added because `BtcUtils.parseVarInt` does not include\\n        // compactSize uint tag in the returned length.\\n        //\\n        // For >= 0 && <= 252, `BTCUtils.determineVarIntDataLengthAt`\\n        // returns `0`, so we jump over one byte of compactSize uint.\\n        //\\n        // For >= 253 && <= 0xffff there is `0xfd` tag,\\n        // `BTCUtils.determineVarIntDataLengthAt` returns `2` (no\\n        // tag byte included) so we need to jump over 1+2 bytes of\\n        // compactSize uint.\\n        //\\n        // Please refer `BTCUtils` library and compactSize uint\\n        // docs in `BitcoinTx` library for more details.\\n        uint256 outputStartingIndex = 1 + outputsCompactSizeUintLength;\\n\\n        bytes20[] memory targetWallets = new bytes20[](outputsCount);\\n        uint64[] memory outputsValues = new uint64[](outputsCount);\\n\\n        // Outputs processing loop. Note that the `outputIndex` must be\\n        // `uint32` to build proper `movedFundsSweepRequests` keys.\\n        for (\\n            uint32 outputIndex = 0;\\n            outputIndex < outputsCount;\\n            outputIndex++\\n        ) {\\n            uint256 outputLength = processInfo\\n                .movingFundsTxOutputVector\\n                .determineOutputLengthAt(outputStartingIndex);\\n\\n            bytes memory output = processInfo.movingFundsTxOutputVector.slice(\\n                outputStartingIndex,\\n                outputLength\\n            );\\n\\n            bytes20 targetWalletPubKeyHash = self.extractPubKeyHash(output);\\n\\n            // Add the wallet public key hash to the list that will be used\\n            // to build the result list hash. There is no need to check if\\n            // given output is a change here because the actual target wallet\\n            // list must be exactly the same as the pre-committed target wallet\\n            // list which is guaranteed to be valid.\\n            targetWallets[outputIndex] = targetWalletPubKeyHash;\\n\\n            // Extract the value from given output.\\n            outputsValues[outputIndex] = output.extractValue();\\n            outputsTotalValue += outputsValues[outputIndex];\\n\\n            // Register a moved funds sweep request that must be handled\\n            // by the target wallet. The target wallet must sweep the\\n            // received funds with their own main UTXO in order to update\\n            // their BTC balance. Worth noting there is no need to check\\n            // if the sweep request already exists in the system because\\n            // the moving funds wallet is moved to the Closing state after\\n            // submitting the moving funds proof so there is no possibility\\n            // to submit the proof again and register the sweep request twice.\\n            self.movedFundsSweepRequests[\\n                uint256(\\n                    keccak256(\\n                        abi.encodePacked(\\n                            processInfo.movingFundsTxHash,\\n                            outputIndex\\n                        )\\n                    )\\n                )\\n            ] = MovedFundsSweepRequest(\\n                targetWalletPubKeyHash,\\n                outputsValues[outputIndex],\\n                /* solhint-disable-next-line not-rely-on-time */\\n                uint32(block.timestamp),\\n                0\\n            );\\n            // We added a new moved funds sweep request for the target wallet\\n            // so we must increment their request counter.\\n            self\\n                .registeredWallets[targetWalletPubKeyHash]\\n                .pendingMovedFundsSweepRequestsCount++;\\n\\n            // Make the `outputStartingIndex` pointing to the next output by\\n            // increasing it by current output's length.\\n            outputStartingIndex += outputLength;\\n        }\\n\\n        // Compute the indivisible remainder that remains after dividing the\\n        // outputs total value over all outputs evenly.\\n        uint256 outputsTotalValueRemainder = outputsTotalValue % outputsCount;\\n        // Compute the minimum allowed output value by dividing the outputs\\n        // total value (reduced by the remainder) by the number of outputs.\\n        uint256 minOutputValue = (outputsTotalValue -\\n            outputsTotalValueRemainder) / outputsCount;\\n        // Maximum possible value is the minimum value with the remainder included.\\n        uint256 maxOutputValue = minOutputValue + outputsTotalValueRemainder;\\n\\n        for (uint256 i = 0; i < outputsCount; i++) {\\n            require(\\n                minOutputValue <= outputsValues[i] &&\\n                    outputsValues[i] <= maxOutputValue,\\n                \\\"Transaction amount is not distributed evenly\\\"\\n            );\\n        }\\n\\n        targetWalletsHash = keccak256(abi.encodePacked(targetWallets));\\n\\n        return (targetWalletsHash, outputsTotalValue);\\n    }\\n\\n    /// @notice Notifies about a timed out moving funds process. Terminates\\n    ///         the wallet and slashes signing group members as a result.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the MovingFunds state\\n    ///      - The moving funds timeout must be actually exceeded\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events of the `WalletRegistry` contract\\n    function notifyMovingFundsTimeout(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        uint32[] calldata walletMembersIDs\\n    ) external {\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        require(\\n            wallet.state == Wallets.WalletState.MovingFunds,\\n            \\\"ECDSA wallet must be in MovingFunds state\\\"\\n        );\\n\\n        require(\\n            /* solhint-disable-next-line not-rely-on-time */\\n            block.timestamp >\\n                wallet.movingFundsRequestedAt + self.movingFundsTimeout,\\n            \\\"Moving funds has not timed out yet\\\"\\n        );\\n\\n        self.terminateWallet(walletPubKeyHash);\\n\\n        self.ecdsaWalletRegistry.seize(\\n            self.movingFundsTimeoutSlashingAmount,\\n            self.movingFundsTimeoutNotifierRewardMultiplier,\\n            msg.sender,\\n            wallet.ecdsaWalletID,\\n            walletMembersIDs\\n        );\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit MovingFundsTimedOut(walletPubKeyHash);\\n    }\\n\\n    /// @notice Notifies about a moving funds wallet whose BTC balance is\\n    ///         below the moving funds dust threshold. Ends the moving funds\\n    ///         process and begins wallet closing immediately.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known\\n    ///        on the Ethereum chain.\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the MovingFunds state\\n    ///      - The `mainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///        If the wallet has no main UTXO, this parameter can be empty as it\\n    ///        is ignored.\\n    ///      - The wallet BTC balance must be below the moving funds threshold\\n    function notifyMovingFundsBelowDust(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata mainUtxo\\n    ) external {\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        require(\\n            wallet.state == Wallets.WalletState.MovingFunds,\\n            \\\"ECDSA wallet must be in MovingFunds state\\\"\\n        );\\n\\n        uint64 walletBtcBalance = self.getWalletBtcBalance(\\n            walletPubKeyHash,\\n            mainUtxo\\n        );\\n\\n        require(\\n            walletBtcBalance < self.movingFundsDustThreshold,\\n            \\\"Wallet BTC balance must be below the moving funds dust threshold\\\"\\n        );\\n\\n        self.beginWalletClosing(walletPubKeyHash);\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit MovingFundsBelowDustReported(walletPubKeyHash);\\n    }\\n\\n    /// @notice Used by the wallet to prove the BTC moved funds sweep\\n    ///         transaction and to make the necessary state changes. Moved\\n    ///         funds sweep is only accepted if it satisfies SPV proof.\\n    ///\\n    ///         The function validates the sweep transaction structure by\\n    ///         checking if it actually spends the moved funds UTXO and the\\n    ///         sweeping wallet's main UTXO (optionally), and if it locks the\\n    ///         value on the sweeping wallet's 20-byte public key hash using a\\n    ///         reasonable transaction fee. If all preconditions are\\n    ///         met, this function updates the sweeping wallet main UTXO, thus\\n    ///         their BTC balance.\\n    ///\\n    ///         It is possible to prove the given sweep transaction only\\n    ///         one time.\\n    /// @param sweepTx Bitcoin sweep funds transaction data\\n    /// @param sweepProof Bitcoin sweep funds proof data\\n    /// @param mainUtxo Data of the sweeping wallet's main UTXO, as currently\\n    ///        known on the Ethereum chain\\n    /// @dev Requirements:\\n    ///      - `sweepTx` components must match the expected structure. See\\n    ///        `BitcoinTx.Info` docs for reference. Their values must exactly\\n    ///        correspond to appropriate Bitcoin transaction fields to produce\\n    ///        a provable transaction hash.\\n    ///      - The `sweepTx` should represent a Bitcoin transaction with\\n    ///        the first input pointing to a wallet's sweep request and,\\n    ///        optionally, the second input pointing to the wallet's main UTXO,\\n    ///        if the sweeping wallet has a main UTXO set. There should be only\\n    ///        one output locking funds on the sweeping wallet 20-byte public\\n    ///        key hash.\\n    ///      - `sweepProof` components must match the expected structure.\\n    ///        See `BitcoinTx.Proof` docs for reference. The `bitcoinHeaders`\\n    ///        field must contain a valid number of block headers, not less\\n    ///        than the `txProofDifficultyFactor` contract constant.\\n    ///      - `mainUtxo` components must point to the recent main UTXO\\n    ///        of the sweeping wallet, as currently known on the Ethereum chain.\\n    ///        If there is no main UTXO, this parameter is ignored.\\n    ///      - The sweeping wallet must be in the Live or MovingFunds state.\\n    ///      - The total Bitcoin transaction fee must be lesser or equal\\n    ///        to `movedFundsSweepTxMaxTotalFee` governable parameter.\\n    function submitMovedFundsSweepProof(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.Info calldata sweepTx,\\n        BitcoinTx.Proof calldata sweepProof,\\n        BitcoinTx.UTXO calldata mainUtxo\\n    ) external {\\n        // The actual transaction proof is performed here. After that point, we\\n        // can assume the transaction happened on Bitcoin chain and has\\n        // a sufficient number of confirmations as determined by\\n        // `txProofDifficultyFactor` constant.\\n        bytes32 sweepTxHash = self.validateProof(sweepTx, sweepProof);\\n\\n        (\\n            bytes20 walletPubKeyHash,\\n            uint64 sweepTxOutputValue\\n        ) = processMovedFundsSweepTxOutput(self, sweepTx.outputVector);\\n\\n        (\\n            Wallets.Wallet storage wallet,\\n            BitcoinTx.UTXO memory resolvedMainUtxo\\n        ) = resolveMovedFundsSweepingWallet(self, walletPubKeyHash, mainUtxo);\\n\\n        uint256 sweepTxInputsTotalValue = processMovedFundsSweepTxInputs(\\n            self,\\n            sweepTx.inputVector,\\n            resolvedMainUtxo,\\n            walletPubKeyHash\\n        );\\n\\n        require(\\n            sweepTxInputsTotalValue - sweepTxOutputValue <=\\n                self.movedFundsSweepTxMaxTotalFee,\\n            \\\"Transaction fee is too high\\\"\\n        );\\n\\n        // Use the sweep transaction output as the new sweeping wallet's main UTXO.\\n        // Transaction output index is always 0 as sweep transaction always\\n        // contains only one output.\\n        wallet.mainUtxoHash = keccak256(\\n            abi.encodePacked(sweepTxHash, uint32(0), sweepTxOutputValue)\\n        );\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit MovedFundsSwept(walletPubKeyHash, sweepTxHash);\\n    }\\n\\n    /// @notice Processes the Bitcoin moved funds sweep transaction output vector\\n    ///         by extracting the single output and using it to gain additional\\n    ///         information required for further processing (e.g. value and\\n    ///         wallet public key hash).\\n    /// @param sweepTxOutputVector Bitcoin moved funds sweep transaction output\\n    ///        vector.\\n    ///        This function assumes vector's structure is valid so it must be\\n    ///        validated using e.g. `BTCUtils.validateVout` function before\\n    ///        it is passed here\\n    /// @return walletPubKeyHash 20-byte wallet public key hash.\\n    /// @return value 8-byte moved funds sweep transaction output value.\\n    /// @dev Requirements:\\n    ///      - Output vector must contain only one output\\n    ///      - The single output must be of P2PKH or P2WPKH type and lock the\\n    ///        funds on a 20-byte public key hash\\n    function processMovedFundsSweepTxOutput(\\n        BridgeState.Storage storage self,\\n        bytes memory sweepTxOutputVector\\n    ) internal view returns (bytes20 walletPubKeyHash, uint64 value) {\\n        // To determine the total number of sweep transaction outputs, we need to\\n        // parse the compactSize uint (VarInt) the output vector is prepended by.\\n        // That compactSize uint encodes the number of vector elements using the\\n        // format presented in:\\n        // https://developer.bitcoin.org/reference/transactions.html#compactsize-unsigned-integers\\n        // We don't need asserting the compactSize uint is parseable since it\\n        // was already checked during `validateVout` validation performed as\\n        // part of the `BitcoinTx.validateProof` call.\\n        // See `BitcoinTx.outputVector` docs for more details.\\n        (, uint256 outputsCount) = sweepTxOutputVector.parseVarInt();\\n        require(\\n            outputsCount == 1,\\n            \\\"Moved funds sweep transaction must have a single output\\\"\\n        );\\n\\n        bytes memory output = sweepTxOutputVector.extractOutputAtIndex(0);\\n        walletPubKeyHash = self.extractPubKeyHash(output);\\n        value = output.extractValue();\\n\\n        return (walletPubKeyHash, value);\\n    }\\n\\n    /// @notice Resolves sweeping wallet based on the provided wallet public key\\n    ///         hash. Validates the wallet state and current main UTXO, as\\n    ///         currently known on the Ethereum chain.\\n    /// @param walletPubKeyHash public key hash of the wallet proving the sweep\\n    ///        Bitcoin transaction.\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain. If no main UTXO exists for the given wallet,\\n    ///        this parameter is ignored\\n    /// @return wallet Data of the sweeping wallet.\\n    /// @return resolvedMainUtxo The actual main UTXO of the sweeping wallet\\n    ///         resolved by cross-checking the `mainUtxo` parameter with\\n    ///         the chain state. If the validation went well, this is the\\n    ///         plain-text main UTXO corresponding to the `wallet.mainUtxoHash`.\\n    /// @dev Requirements:\\n    ///     - Sweeping wallet must be either in Live or MovingFunds state.\\n    ///     - If the main UTXO of the sweeping wallet exists in the storage,\\n    ///       the passed `mainUTXO` parameter must be equal to the stored one.\\n    function resolveMovedFundsSweepingWallet(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata mainUtxo\\n    )\\n        internal\\n        view\\n        returns (\\n            Wallets.Wallet storage wallet,\\n            BitcoinTx.UTXO memory resolvedMainUtxo\\n        )\\n    {\\n        wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        Wallets.WalletState walletState = wallet.state;\\n        require(\\n            walletState == Wallets.WalletState.Live ||\\n                walletState == Wallets.WalletState.MovingFunds,\\n            \\\"Wallet must be in Live or MovingFunds state\\\"\\n        );\\n\\n        // Check if the main UTXO for given wallet exists. If so, validate\\n        // passed main UTXO data against the stored hash and use them for\\n        // further processing. If no main UTXO exists, use empty data.\\n        resolvedMainUtxo = BitcoinTx.UTXO(bytes32(0), 0, 0);\\n        bytes32 mainUtxoHash = wallet.mainUtxoHash;\\n        if (mainUtxoHash != bytes32(0)) {\\n            require(\\n                keccak256(\\n                    abi.encodePacked(\\n                        mainUtxo.txHash,\\n                        mainUtxo.txOutputIndex,\\n                        mainUtxo.txOutputValue\\n                    )\\n                ) == mainUtxoHash,\\n                \\\"Invalid main UTXO data\\\"\\n            );\\n            resolvedMainUtxo = mainUtxo;\\n        }\\n    }\\n\\n    /// @notice Processes the Bitcoin moved funds sweep transaction input vector.\\n    ///         It extracts the first input and tries to match it with one of\\n    ///         the moved funds sweep requests targeting the sweeping wallet.\\n    ///         If the sweep request is found and not yet processed, this\\n    ///         function marks it as processed. If the sweeping wallet has a\\n    ///         main UTXO, this function extracts the second input, makes sure\\n    ///         it refers to the wallet main UTXO, and marks that main UTXO as\\n    ///         correctly spent.\\n    /// @param sweepTxInputVector Bitcoin moved funds sweep transaction input vector.\\n    ///        This function assumes vector's structure is valid so it must be\\n    ///        validated using e.g. `BTCUtils.validateVin` function before\\n    ///        it is passed here\\n    /// @param mainUtxo Data of the sweeping wallet's main UTXO. If no main UTXO\\n    ///        exists for the given the wallet, this parameter's fields should\\n    ///        be zeroed to bypass the main UTXO validation\\n    /// @param walletPubKeyHash 20-byte public key hash of the sweeping wallet\\n    /// @return inputsTotalValue Total inputs value sum.\\n    /// @dev Requirements:\\n    ///      - The input vector must consist of one mandatory and one optional\\n    ///        input.\\n    ///      - The mandatory input must be the first input in the vector\\n    ///      - The mandatory input must point to a known moved funds sweep\\n    ///        request that is not processed yet and is targeted to the sweeping\\n    ///        wallet\\n    ///      - The optional output must be the second input in the vector\\n    ///      - The optional input is required if the sweeping wallet has a\\n    ///        main UTXO (i.e. the `mainUtxo` is not zeroed). In that case,\\n    ///        that input must point the the sweeping wallet main UTXO.\\n    function processMovedFundsSweepTxInputs(\\n        BridgeState.Storage storage self,\\n        bytes memory sweepTxInputVector,\\n        BitcoinTx.UTXO memory mainUtxo,\\n        bytes20 walletPubKeyHash\\n    ) internal returns (uint256 inputsTotalValue) {\\n        // To determine the total number of Bitcoin transaction inputs,\\n        // we need to parse the compactSize uint (VarInt) the input vector is\\n        // prepended by. That compactSize uint encodes the number of vector\\n        // elements using the format presented in:\\n        // https://developer.bitcoin.org/reference/transactions.html#compactsize-unsigned-integers\\n        // We don't need asserting the compactSize uint is parseable since it\\n        // was already checked during `validateVin` validation performed as\\n        // part of the `BitcoinTx.validateProof` call.\\n        // See `BitcoinTx.inputVector` docs for more details.\\n        (\\n            uint256 inputsCompactSizeUintLength,\\n            uint256 inputsCount\\n        ) = sweepTxInputVector.parseVarInt();\\n\\n        // To determine the first input starting index, we must jump over\\n        // the compactSize uint which prepends the input vector. One byte\\n        // must be added because `BtcUtils.parseVarInt` does not include\\n        // compactSize uint tag in the returned length.\\n        //\\n        // For >= 0 && <= 252, `BTCUtils.determineVarIntDataLengthAt`\\n        // returns `0`, so we jump over one byte of compactSize uint.\\n        //\\n        // For >= 253 && <= 0xffff there is `0xfd` tag,\\n        // `BTCUtils.determineVarIntDataLengthAt` returns `2` (no\\n        // tag byte included) so we need to jump over 1+2 bytes of\\n        // compactSize uint.\\n        //\\n        // Please refer `BTCUtils` library and compactSize uint\\n        // docs in `BitcoinTx` library for more details.\\n        uint256 inputStartingIndex = 1 + inputsCompactSizeUintLength;\\n\\n        // We always expect the first input to be the swept UTXO. Additionally,\\n        // if the sweeping wallet has a main UTXO, that main UTXO should be\\n        // pointed by the second input.\\n        require(\\n            inputsCount == (mainUtxo.txHash != bytes32(0) ? 2 : 1),\\n            \\\"Moved funds sweep transaction must have a proper inputs count\\\"\\n        );\\n\\n        // Parse the first input and extract its outpoint tx hash and index.\\n        (\\n            bytes32 firstInputOutpointTxHash,\\n            uint32 firstInputOutpointIndex,\\n            uint256 firstInputLength\\n        ) = parseMovedFundsSweepTxInputAt(\\n                sweepTxInputVector,\\n                inputStartingIndex\\n            );\\n\\n        // Build the request key and fetch the corresponding moved funds sweep\\n        // request from contract storage.\\n        MovedFundsSweepRequest storage sweepRequest = self\\n            .movedFundsSweepRequests[\\n                uint256(\\n                    keccak256(\\n                        abi.encodePacked(\\n                            firstInputOutpointTxHash,\\n                            firstInputOutpointIndex\\n                        )\\n                    )\\n                )\\n            ];\\n\\n        // The sweep request must exist, must be not processed yet, and must\\n        // belong to the sweeping wallet.\\n        require(sweepRequest.createdAt != 0, \\\"Sweep request does not exist\\\");\\n        require(sweepRequest.sweptAt == 0, \\\"Sweep request already processed\\\");\\n        // We must check if the wallet extracted from the moved funds sweep\\n        // transaction output is truly the owner of the sweep request connected\\n        // with the swept UTXO. This is needed to prevent a case when a wallet\\n        // handles its own sweep request but locks the funds on another\\n        // wallet public key hash.\\n        require(\\n            sweepRequest.walletPubKeyHash == walletPubKeyHash,\\n            \\\"Sweep request belongs to another wallet\\\"\\n        );\\n        // If the validation passed, the sweep request must be marked as\\n        // processed and its value should be counted into the total inputs\\n        // value sum.\\n        /* solhint-disable-next-line not-rely-on-time */\\n        sweepRequest.sweptAt = uint32(block.timestamp);\\n        inputsTotalValue += sweepRequest.value;\\n\\n        self\\n            .registeredWallets[walletPubKeyHash]\\n            .pendingMovedFundsSweepRequestsCount--;\\n\\n        // If the main UTXO for the sweeping wallet exists, it must be processed.\\n        if (mainUtxo.txHash != bytes32(0)) {\\n            // The second input is supposed to point to that sweeping wallet\\n            // main UTXO. We need to parse that input.\\n            (\\n                bytes32 secondInputOutpointTxHash,\\n                uint32 secondInputOutpointIndex,\\n\\n            ) = parseMovedFundsSweepTxInputAt(\\n                    sweepTxInputVector,\\n                    inputStartingIndex + firstInputLength\\n                );\\n            // Make sure the second input refers to the sweeping wallet main UTXO.\\n            require(\\n                mainUtxo.txHash == secondInputOutpointTxHash &&\\n                    mainUtxo.txOutputIndex == secondInputOutpointIndex,\\n                \\\"Second input must point to the wallet's main UTXO\\\"\\n            );\\n\\n            // If the validation passed, count the main UTXO value into the\\n            // total inputs value sum.\\n            inputsTotalValue += mainUtxo.txOutputValue;\\n\\n            // Main UTXO used as an input, mark it as spent. This is needed\\n            // to defend against fraud challenges referring to this main UTXO.\\n            self.spentMainUTXOs[\\n                uint256(\\n                    keccak256(\\n                        abi.encodePacked(\\n                            secondInputOutpointTxHash,\\n                            secondInputOutpointIndex\\n                        )\\n                    )\\n                )\\n            ] = true;\\n        }\\n\\n        return inputsTotalValue;\\n    }\\n\\n    /// @notice Parses a Bitcoin transaction input starting at the given index.\\n    /// @param inputVector Bitcoin transaction input vector\\n    /// @param inputStartingIndex Index the given input starts at\\n    /// @return outpointTxHash 32-byte hash of the Bitcoin transaction which is\\n    ///         pointed in the given input's outpoint.\\n    /// @return outpointIndex 4-byte index of the Bitcoin transaction output\\n    ///         which is pointed in the given input's outpoint.\\n    /// @return inputLength Byte length of the given input.\\n    /// @dev This function assumes vector's structure is valid so it must be\\n    ///      validated using e.g. `BTCUtils.validateVin` function before it\\n    ///      is passed here.\\n    function parseMovedFundsSweepTxInputAt(\\n        bytes memory inputVector,\\n        uint256 inputStartingIndex\\n    )\\n        internal\\n        pure\\n        returns (\\n            bytes32 outpointTxHash,\\n            uint32 outpointIndex,\\n            uint256 inputLength\\n        )\\n    {\\n        outpointTxHash = inputVector.extractInputTxIdLeAt(inputStartingIndex);\\n\\n        outpointIndex = BTCUtils.reverseUint32(\\n            uint32(inputVector.extractTxIndexLeAt(inputStartingIndex))\\n        );\\n\\n        inputLength = inputVector.determineInputLengthAt(inputStartingIndex);\\n\\n        return (outpointTxHash, outpointIndex, inputLength);\\n    }\\n}\\n\",\"keccak256\":\"0x7cc0d9a9c2f6df56afb1833c0e7123f5b92ee3f4126cf3a801cf13e7735ed824\",\"license\":\"MIT\"},\"contracts/bridge/Redemption.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {BytesLib} from \\\"@keep-network/bitcoin-spv-sol/contracts/BytesLib.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\nimport \\\"./Wallets.sol\\\";\\n\\nimport \\\"../bank/Bank.sol\\\";\\n\\n/// @notice Aggregates functions common to the redemption transaction proof\\n///         validation and to the moving funds transaction proof validation.\\nlibrary OutboundTx {\\n    using BTCUtils for bytes;\\n\\n    /// @notice Checks whether an outbound Bitcoin transaction performed from\\n    ///         the given wallet has an input vector that contains a single\\n    ///         input referring to the wallet's main UTXO. Marks that main UTXO\\n    ///         as correctly spent if the validation succeeds. Reverts otherwise.\\n    ///         There are two outbound transactions from a wallet possible: a\\n    ///         redemption transaction or a moving funds to another wallet\\n    ///         transaction.\\n    /// @param walletOutboundTxInputVector Bitcoin outbound transaction's input\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVin` function\\n    ///        before it is passed here\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain.\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the outbound transaction.\\n    function processWalletOutboundTxInput(\\n        BridgeState.Storage storage self,\\n        bytes memory walletOutboundTxInputVector,\\n        BitcoinTx.UTXO calldata mainUtxo,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        // Assert that main UTXO for passed wallet exists in storage.\\n        bytes32 mainUtxoHash = self\\n            .registeredWallets[walletPubKeyHash]\\n            .mainUtxoHash;\\n        require(mainUtxoHash != bytes32(0), \\\"No main UTXO for given wallet\\\");\\n\\n        // Assert that passed main UTXO parameter is the same as in storage and\\n        // can be used for further processing.\\n        require(\\n            keccak256(\\n                abi.encodePacked(\\n                    mainUtxo.txHash,\\n                    mainUtxo.txOutputIndex,\\n                    mainUtxo.txOutputValue\\n                )\\n            ) == mainUtxoHash,\\n            \\\"Invalid main UTXO data\\\"\\n        );\\n\\n        // Assert that the single outbound transaction input actually\\n        // refers to the wallet's main UTXO.\\n        (\\n            bytes32 outpointTxHash,\\n            uint32 outpointIndex\\n        ) = parseWalletOutboundTxInput(walletOutboundTxInputVector);\\n        require(\\n            mainUtxo.txHash == outpointTxHash &&\\n                mainUtxo.txOutputIndex == outpointIndex,\\n            \\\"Outbound transaction input must point to the wallet's main UTXO\\\"\\n        );\\n\\n        // Main UTXO used as an input, mark it as spent.\\n        self.spentMainUTXOs[\\n            uint256(\\n                keccak256(\\n                    abi.encodePacked(mainUtxo.txHash, mainUtxo.txOutputIndex)\\n                )\\n            )\\n        ] = true;\\n    }\\n\\n    /// @notice Parses the input vector of an outbound Bitcoin transaction\\n    ///         performed from the given wallet. It extracts the single input\\n    ///         then the transaction hash and output index from its outpoint.\\n    ///         There are two outbound transactions from a wallet possible: a\\n    ///         redemption transaction or a moving funds to another wallet\\n    ///         transaction.\\n    /// @param walletOutboundTxInputVector Bitcoin outbound transaction input\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVin` function\\n    ///        before it is passed here\\n    /// @return outpointTxHash 32-byte hash of the Bitcoin transaction which is\\n    ///         pointed in the input's outpoint.\\n    /// @return outpointIndex 4-byte index of the Bitcoin transaction output\\n    ///         which is pointed in the input's outpoint.\\n    function parseWalletOutboundTxInput(\\n        bytes memory walletOutboundTxInputVector\\n    ) internal pure returns (bytes32 outpointTxHash, uint32 outpointIndex) {\\n        // To determine the total number of Bitcoin transaction inputs,\\n        // we need to parse the compactSize uint (VarInt) the input vector is\\n        // prepended by. That compactSize uint encodes the number of vector\\n        // elements using the format presented in:\\n        // https://developer.bitcoin.org/reference/transactions.html#compactsize-unsigned-integers\\n        // We don't need asserting the compactSize uint is parseable since it\\n        // was already checked during `validateVin` validation.\\n        // See `BitcoinTx.inputVector` docs for more details.\\n        (, uint256 inputsCount) = walletOutboundTxInputVector.parseVarInt();\\n        require(\\n            inputsCount == 1,\\n            \\\"Outbound transaction must have a single input\\\"\\n        );\\n\\n        bytes memory input = walletOutboundTxInputVector.extractInputAtIndex(0);\\n\\n        outpointTxHash = input.extractInputTxIdLE();\\n\\n        outpointIndex = BTCUtils.reverseUint32(\\n            uint32(input.extractTxIndexLE())\\n        );\\n\\n        // There is only one input in the transaction. Input has an outpoint\\n        // field that is a reference to the transaction being spent (see\\n        // `BitcoinTx` docs). The outpoint contains the hash of the transaction\\n        // to spend (`outpointTxHash`) and the index of the specific output\\n        // from that transaction (`outpointIndex`).\\n        return (outpointTxHash, outpointIndex);\\n    }\\n}\\n\\n/// @title Bridge redemption\\n/// @notice The library handles the logic for redeeming Bitcoin balances from\\n///         the Bridge.\\n/// @dev To initiate a redemption, a user with a Bank balance supplies\\n///      a Bitcoin address. Then, the system calculates the redemption fee, and\\n///      releases balance to the provided Bitcoin address. Just like in case of\\n///      sweeps of revealed deposits, redemption requests are processed in\\n///      batches and require SPV proof to be submitted to the Bridge.\\nlibrary Redemption {\\n    using BridgeState for BridgeState.Storage;\\n    using Wallets for BridgeState.Storage;\\n    using BitcoinTx for BridgeState.Storage;\\n\\n    using BTCUtils for bytes;\\n    using BytesLib for bytes;\\n\\n    /// @notice Represents a redemption request.\\n    struct RedemptionRequest {\\n        // ETH address of the redeemer who created the request.\\n        address redeemer;\\n        // Requested TBTC amount in satoshi.\\n        uint64 requestedAmount;\\n        // Treasury TBTC fee in satoshi at the moment of request creation.\\n        uint64 treasuryFee;\\n        // Transaction maximum BTC fee in satoshi at the moment of request\\n        // creation.\\n        uint64 txMaxFee;\\n        // UNIX timestamp the request was created at.\\n        uint32 requestedAt;\\n    }\\n\\n    /// @notice Represents an outcome of the redemption Bitcoin transaction\\n    ///         outputs processing.\\n    struct RedemptionTxOutputsInfo {\\n        // Total TBTC value in satoshi that should be burned by the Bridge.\\n        // It includes the total amount of all BTC redeemed in the transaction\\n        // and the fee paid to BTC miners for the redemption transaction.\\n        uint64 totalBurnableValue;\\n        // Total TBTC value in satoshi that should be transferred to\\n        // the treasury. It is a sum of all treasury fees paid by all\\n        // redeemers included in the redemption transaction.\\n        uint64 totalTreasuryFee;\\n        // Index of the change output. The change output becomes\\n        // the new main wallet's UTXO.\\n        uint32 changeIndex;\\n        // Value in satoshi of the change output.\\n        uint64 changeValue;\\n    }\\n\\n    /// @notice Represents temporary information needed during the processing of\\n    ///         the redemption Bitcoin transaction outputs. This structure is an\\n    ///         internal one and should not be exported outside of the redemption\\n    ///         transaction processing code.\\n    /// @dev Allows to mitigate \\\"stack too deep\\\" errors on EVM.\\n    struct RedemptionTxOutputsProcessingInfo {\\n        // The first output starting index in the transaction.\\n        uint256 outputStartingIndex;\\n        // The number of outputs in the transaction.\\n        uint256 outputsCount;\\n        // P2PKH script for the wallet. Needed to determine the change output.\\n        bytes32 walletP2PKHScriptKeccak;\\n        // P2WPKH script for the wallet. Needed to determine the change output.\\n        bytes32 walletP2WPKHScriptKeccak;\\n    }\\n\\n    event RedemptionRequested(\\n        bytes20 walletPubKeyHash,\\n        bytes redeemerOutputScript,\\n        address redeemer,\\n        uint64 requestedAmount,\\n        uint64 treasuryFee,\\n        uint64 txMaxFee\\n    );\\n\\n    event RedemptionsCompleted(\\n        bytes20 walletPubKeyHash,\\n        bytes32 redemptionTxHash\\n    );\\n\\n    event RedemptionTimedOut(\\n        bytes20 walletPubKeyHash,\\n        bytes redeemerOutputScript\\n    );\\n\\n    /// @notice Requests redemption of the given amount from the specified\\n    ///         wallet to the redeemer Bitcoin output script.\\n    /// @param walletPubKeyHash The 20-byte wallet public key hash (computed\\n    ///        using Bitcoin HASH160 over the compressed ECDSA public key)\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain\\n    /// @param redeemerOutputScript The redeemer's length-prefixed output\\n    ///        script (P2PKH, P2WPKH, P2SH or P2WSH) that will be used to lock\\n    ///        redeemed BTC\\n    /// @param amount Requested amount in satoshi. This is also the TBTC amount\\n    ///        that is taken from redeemer's balance in the Bank upon request.\\n    ///        Once the request is handled, the actual amount of BTC locked\\n    ///        on the redeemer output script will be always lower than this value\\n    ///        since the treasury and Bitcoin transaction fees must be incurred.\\n    ///        The minimal amount satisfying the request can be computed as:\\n    ///        `amount - (amount / redemptionTreasuryFeeDivisor) - redemptionTxMaxFee`.\\n    ///        Fees values are taken at the moment of request creation.\\n    /// @dev Requirements:\\n    ///      - Wallet behind `walletPubKeyHash` must be live\\n    ///      - `mainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///      - `redeemerOutputScript` must be a proper Bitcoin script\\n    ///      - `redeemerOutputScript` cannot have wallet PKH as payload\\n    ///      - `amount` must be above or equal the `redemptionDustThreshold`\\n    ///      - Given `walletPubKeyHash` and `redeemerOutputScript` pair can be\\n    ///        used for only one pending request at the same time\\n    ///      - Wallet must have enough Bitcoin balance to proceed the request\\n    ///      - Redeemer must make an allowance in the Bank that the Bridge\\n    ///        contract can spend the given `amount`.\\n    function requestRedemption(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata mainUtxo,\\n        bytes calldata redeemerOutputScript,\\n        uint64 amount\\n    ) external {\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        require(\\n            wallet.state == Wallets.WalletState.Live,\\n            \\\"Wallet must be in Live state\\\"\\n        );\\n\\n        bytes32 mainUtxoHash = wallet.mainUtxoHash;\\n        require(\\n            mainUtxoHash != bytes32(0),\\n            \\\"No main UTXO for the given wallet\\\"\\n        );\\n        require(\\n            keccak256(\\n                abi.encodePacked(\\n                    mainUtxo.txHash,\\n                    mainUtxo.txOutputIndex,\\n                    mainUtxo.txOutputValue\\n                )\\n            ) == mainUtxoHash,\\n            \\\"Invalid main UTXO data\\\"\\n        );\\n\\n        // TODO: Confirm if `walletPubKeyHash` should be validated by checking\\n        //       if it is the oldest one who can handle the request. This will\\n        //       be suggested by the dApp but may not be respected by users who\\n        //       interact directly with the contract. Do we need to enforce it\\n        //       here? One option is not to enforce it, to save on gas, but if\\n        //       we see this rule is not respected, upgrade Bridge contract to\\n        //       require it.\\n\\n        // Validate if redeemer output script is a correct standard type\\n        // (P2PKH, P2WPKH, P2SH or P2WSH). This is done by building a stub\\n        // output with 0 as value and using `BTCUtils.extractHash` on it. Such\\n        // a function extracts the payload properly only from standard outputs\\n        // so if it succeeds, we have a guarantee the redeemer output script\\n        // is proper. Worth to note `extractHash` ignores the value at all\\n        // so this is why we can use 0 safely. This way of validation is the\\n        // same as in tBTC v1.\\n        bytes memory redeemerOutputScriptPayload = abi\\n            .encodePacked(bytes8(0), redeemerOutputScript)\\n            .extractHash();\\n        require(\\n            redeemerOutputScriptPayload.length > 0,\\n            \\\"Redeemer output script must be a standard type\\\"\\n        );\\n        // Check if the redeemer output script payload does not point to the\\n        // wallet public key hash.\\n        require(\\n            keccak256(abi.encodePacked(walletPubKeyHash)) !=\\n                keccak256(redeemerOutputScriptPayload),\\n            \\\"Redeemer output script must not point to the wallet PKH\\\"\\n        );\\n\\n        require(\\n            amount >= self.redemptionDustThreshold,\\n            \\\"Redemption amount too small\\\"\\n        );\\n\\n        // The redemption key is built on top of the wallet public key hash\\n        // and redeemer output script pair. That means there can be only one\\n        // request asking for redemption from the given wallet to the given\\n        // BTC script at the same time.\\n        uint256 redemptionKey = uint256(\\n            keccak256(abi.encodePacked(walletPubKeyHash, redeemerOutputScript))\\n        );\\n\\n        // Check if given redemption key is not used by a pending redemption.\\n        // There is no need to check for existence in `timedOutRedemptions`\\n        // since the wallet's state is changed to other than Live after\\n        // first time out is reported so making new requests is not possible.\\n        // slither-disable-next-line incorrect-equality\\n        require(\\n            self.pendingRedemptions[redemptionKey].requestedAt == 0,\\n            \\\"There is a pending redemption request from this wallet to the same address\\\"\\n        );\\n\\n        // No need to check whether `amount - treasuryFee - txMaxFee > 0`\\n        // since the `redemptionDustThreshold` should force that condition\\n        // to be always true.\\n        uint64 treasuryFee = self.redemptionTreasuryFeeDivisor > 0\\n            ? amount / self.redemptionTreasuryFeeDivisor\\n            : 0;\\n        uint64 txMaxFee = self.redemptionTxMaxFee;\\n\\n        // The main wallet UTXO's value doesn't include all pending redemptions.\\n        // To determine if the requested redemption can be performed by the\\n        // wallet we need to subtract the total value of all pending redemptions\\n        // from that wallet's main UTXO value. Given that the treasury fee is\\n        // not redeemed from the wallet, we are subtracting it.\\n        wallet.pendingRedemptionsValue += amount - treasuryFee;\\n        require(\\n            mainUtxo.txOutputValue >= wallet.pendingRedemptionsValue,\\n            \\\"Insufficient wallet funds\\\"\\n        );\\n\\n        self.pendingRedemptions[redemptionKey] = RedemptionRequest(\\n            msg.sender,\\n            amount,\\n            treasuryFee,\\n            txMaxFee,\\n            /* solhint-disable-next-line not-rely-on-time */\\n            uint32(block.timestamp)\\n        );\\n\\n        emit RedemptionRequested(\\n            walletPubKeyHash,\\n            redeemerOutputScript,\\n            msg.sender,\\n            amount,\\n            treasuryFee,\\n            txMaxFee\\n        );\\n\\n        self.bank.transferBalanceFrom(msg.sender, address(this), amount);\\n    }\\n\\n    /// @notice Used by the wallet to prove the BTC redemption transaction\\n    ///         and to make the necessary bookkeeping. Redemption is only\\n    ///         accepted if it satisfies SPV proof.\\n    ///\\n    ///         The function is performing Bank balance updates by burning\\n    ///         the total redeemed Bitcoin amount from Bridge balance and\\n    ///         transferring the treasury fee sum to the treasury address.\\n    ///\\n    ///         It is possible to prove the given redemption only one time.\\n    /// @param redemptionTx Bitcoin redemption transaction data\\n    /// @param redemptionProof Bitcoin redemption proof data\\n    /// @param mainUtxo Data of the wallet's main UTXO, as currently known on\\n    ///        the Ethereum chain\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    ///        HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction\\n    /// @dev Requirements:\\n    ///      - `redemptionTx` components must match the expected structure. See\\n    ///        `BitcoinTx.Info` docs for reference. Their values must exactly\\n    ///        correspond to appropriate Bitcoin transaction fields to produce\\n    ///        a provable transaction hash.\\n    ///      - The `redemptionTx` should represent a Bitcoin transaction with\\n    ///        exactly 1 input that refers to the wallet's main UTXO. That\\n    ///        transaction should have 1..n outputs handling existing pending\\n    ///        redemption requests or pointing to reported timed out requests.\\n    ///        There can be also 1 optional output representing the\\n    ///        change and pointing back to the 20-byte wallet public key hash.\\n    ///        The change should be always present if the redeemed value sum\\n    ///        is lower than the total wallet's BTC balance.\\n    ///      - `redemptionProof` components must match the expected structure.\\n    ///        See `BitcoinTx.Proof` docs for reference. The `bitcoinHeaders`\\n    ///        field must contain a valid number of block headers, not less\\n    ///        than the `txProofDifficultyFactor` contract constant.\\n    ///      - `mainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///        Additionally, the recent main UTXO on Ethereum must be set.\\n    ///      - `walletPubKeyHash` must be connected with the main UTXO used\\n    ///        as transaction single input.\\n    ///      Other remarks:\\n    ///      - Putting the change output as the first transaction output can\\n    ///        save some gas because the output processing loop begins each\\n    ///        iteration by checking whether the given output is the change\\n    ///        thus uses some gas for making the comparison. Once the change\\n    ///        is identified, that check is omitted in further iterations.\\n    function submitRedemptionProof(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.Info calldata redemptionTx,\\n        BitcoinTx.Proof calldata redemptionProof,\\n        BitcoinTx.UTXO calldata mainUtxo,\\n        bytes20 walletPubKeyHash\\n    ) external {\\n        // The actual transaction proof is performed here. After that point, we\\n        // can assume the transaction happened on Bitcoin chain and has\\n        // a sufficient number of confirmations as determined by\\n        // `txProofDifficultyFactor` constant.\\n        bytes32 redemptionTxHash = self.validateProof(\\n            redemptionTx,\\n            redemptionProof\\n        );\\n\\n        // Process the redemption transaction input. Specifically, check if it\\n        // refers to the expected wallet's main UTXO.\\n        OutboundTx.processWalletOutboundTxInput(\\n            self,\\n            redemptionTx.inputVector,\\n            mainUtxo,\\n            walletPubKeyHash\\n        );\\n\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n\\n        Wallets.WalletState walletState = wallet.state;\\n        require(\\n            walletState == Wallets.WalletState.Live ||\\n                walletState == Wallets.WalletState.MovingFunds,\\n            \\\"Wallet must be in Live or MovingFunds state\\\"\\n        );\\n\\n        // Process redemption transaction outputs to extract some info required\\n        // for further processing.\\n        RedemptionTxOutputsInfo memory outputsInfo = processRedemptionTxOutputs(\\n            self,\\n            redemptionTx.outputVector,\\n            walletPubKeyHash\\n        );\\n\\n        if (outputsInfo.changeValue > 0) {\\n            // If the change value is grater than zero, it means the change\\n            // output exists and can be used as new wallet's main UTXO.\\n            wallet.mainUtxoHash = keccak256(\\n                abi.encodePacked(\\n                    redemptionTxHash,\\n                    outputsInfo.changeIndex,\\n                    outputsInfo.changeValue\\n                )\\n            );\\n        } else {\\n            // If the change value is zero, it means the change output doesn't\\n            // exists and no funds left on the wallet. Delete the main UTXO\\n            // for that wallet to represent that state in a proper way.\\n            delete wallet.mainUtxoHash;\\n        }\\n\\n        wallet.pendingRedemptionsValue -= outputsInfo.totalBurnableValue;\\n\\n        emit RedemptionsCompleted(walletPubKeyHash, redemptionTxHash);\\n\\n        self.bank.decreaseBalance(outputsInfo.totalBurnableValue);\\n        self.bank.transferBalance(self.treasury, outputsInfo.totalTreasuryFee);\\n    }\\n\\n    /// @notice Processes the Bitcoin redemption transaction output vector.\\n    ///         It extracts each output and tries to identify it as a pending\\n    ///         redemption request, reported timed out request, or change.\\n    ///         Reverts if one of the outputs cannot be recognized properly.\\n    ///         This function also marks each request as processed by removing\\n    ///         them from `pendingRedemptions` mapping.\\n    /// @param redemptionTxOutputVector Bitcoin redemption transaction output\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVout` function\\n    ///        before it is passed here\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction.\\n    /// @return info Outcomes of the processing.\\n    function processRedemptionTxOutputs(\\n        BridgeState.Storage storage self,\\n        bytes memory redemptionTxOutputVector,\\n        bytes20 walletPubKeyHash\\n    ) internal returns (RedemptionTxOutputsInfo memory info) {\\n        // Determining the total number of redemption transaction outputs in\\n        // the same way as for number of inputs. See `BitcoinTx.outputVector`\\n        // docs for more details.\\n        (\\n            uint256 outputsCompactSizeUintLength,\\n            uint256 outputsCount\\n        ) = redemptionTxOutputVector.parseVarInt();\\n\\n        // To determine the first output starting index, we must jump over\\n        // the compactSize uint which prepends the output vector. One byte\\n        // must be added because `BtcUtils.parseVarInt` does not include\\n        // compactSize uint tag in the returned length.\\n        //\\n        // For >= 0 && <= 252, `BTCUtils.determineVarIntDataLengthAt`\\n        // returns `0`, so we jump over one byte of compactSize uint.\\n        //\\n        // For >= 253 && <= 0xffff there is `0xfd` tag,\\n        // `BTCUtils.determineVarIntDataLengthAt` returns `2` (no\\n        // tag byte included) so we need to jump over 1+2 bytes of\\n        // compactSize uint.\\n        //\\n        // Please refer `BTCUtils` library and compactSize uint\\n        // docs in `BitcoinTx` library for more details.\\n        uint256 outputStartingIndex = 1 + outputsCompactSizeUintLength;\\n\\n        // Calculate the keccak256 for two possible wallet's P2PKH or P2WPKH\\n        // scripts that can be used to lock the change. This is done upfront to\\n        // save on gas. Both scripts have a strict format defined by Bitcoin.\\n        //\\n        // The P2PKH script has the byte format: <0x1976a914> <20-byte PKH> <0x88ac>.\\n        // According to https://en.bitcoin.it/wiki/Script#Opcodes this translates to:\\n        // - 0x19: Byte length of the entire script\\n        // - 0x76: OP_DUP\\n        // - 0xa9: OP_HASH160\\n        // - 0x14: Byte length of the public key hash\\n        // - 0x88: OP_EQUALVERIFY\\n        // - 0xac: OP_CHECKSIG\\n        // which matches the P2PKH structure as per:\\n        // https://en.bitcoin.it/wiki/Transaction#Pay-to-PubkeyHash\\n        bytes32 walletP2PKHScriptKeccak = keccak256(\\n            abi.encodePacked(hex\\\"1976a914\\\", walletPubKeyHash, hex\\\"88ac\\\")\\n        );\\n        // The P2WPKH script has the byte format: <0x160014> <20-byte PKH>.\\n        // According to https://en.bitcoin.it/wiki/Script#Opcodes this translates to:\\n        // - 0x16: Byte length of the entire script\\n        // - 0x00: OP_0\\n        // - 0x14: Byte length of the public key hash\\n        // which matches the P2WPKH structure as per:\\n        // https://github.com/bitcoin/bips/blob/master/bip-0141.mediawiki#P2WPKH\\n        bytes32 walletP2WPKHScriptKeccak = keccak256(\\n            abi.encodePacked(hex\\\"160014\\\", walletPubKeyHash)\\n        );\\n\\n        return\\n            processRedemptionTxOutputs(\\n                self,\\n                redemptionTxOutputVector,\\n                walletPubKeyHash,\\n                RedemptionTxOutputsProcessingInfo(\\n                    outputStartingIndex,\\n                    outputsCount,\\n                    walletP2PKHScriptKeccak,\\n                    walletP2WPKHScriptKeccak\\n                )\\n            );\\n    }\\n\\n    /// @notice Processes all outputs from the redemption transaction. Tries to\\n    ///         identify output as a change output, pending redemption request\\n    //          or reported redemption. Reverts if one of the outputs cannot be\\n    ///         recognized properly. Marks each request as processed by removing\\n    ///         them from `pendingRedemptions` mapping.\\n    /// @param redemptionTxOutputVector Bitcoin redemption transaction output\\n    ///        vector. This function assumes vector's structure is valid so it\\n    ///        must be validated using e.g. `BTCUtils.validateVout` function\\n    ///        before it is passed here\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction.\\n    /// @param processInfo RedemptionTxOutputsProcessingInfo identifying output\\n    ///        starting index, the number of outputs and possible wallet change\\n    ///        P2PKH and P2WPKH scripts.\\n    function processRedemptionTxOutputs(\\n        BridgeState.Storage storage self,\\n        bytes memory redemptionTxOutputVector,\\n        bytes20 walletPubKeyHash,\\n        RedemptionTxOutputsProcessingInfo memory processInfo\\n    ) internal returns (RedemptionTxOutputsInfo memory resultInfo) {\\n        // Helper flag indicating whether there was at least one redemption\\n        // output present (redemption must be either pending or reported as\\n        // timed out).\\n        bool redemptionPresent = false;\\n\\n        // Outputs processing loop.\\n        for (uint256 i = 0; i < processInfo.outputsCount; i++) {\\n            // TODO: Check if we can optimize gas costs by adding\\n            //       `extractValueAt` and `extractHashAt` in `bitcoin-spv-sol`\\n            //       in order to avoid allocating bytes in memory.\\n            uint256 outputLength = redemptionTxOutputVector\\n                .determineOutputLengthAt(processInfo.outputStartingIndex);\\n            bytes memory output = redemptionTxOutputVector.slice(\\n                processInfo.outputStartingIndex,\\n                outputLength\\n            );\\n\\n            // Extract the value from given output.\\n            uint64 outputValue = output.extractValue();\\n            // The output consists of an 8-byte value and a variable length\\n            // script. To extract that script we slice the output starting from\\n            // 9th byte until the end.\\n            bytes memory outputScript = output.slice(8, output.length - 8);\\n\\n            if (\\n                resultInfo.changeValue == 0 &&\\n                (keccak256(outputScript) ==\\n                    processInfo.walletP2PKHScriptKeccak ||\\n                    keccak256(outputScript) ==\\n                    processInfo.walletP2WPKHScriptKeccak) &&\\n                outputValue > 0\\n            ) {\\n                // If we entered here, that means the change output with a\\n                // proper non-zero value was found.\\n                resultInfo.changeIndex = uint32(i);\\n                resultInfo.changeValue = outputValue;\\n            } else {\\n                // If we entered here, that the means the given output is\\n                // supposed to represent a redemption.\\n                (\\n                    uint64 burnableValue,\\n                    uint64 treasuryFee\\n                ) = processNonChangeRedemptionTxOutput(\\n                        self,\\n                        walletPubKeyHash,\\n                        outputScript,\\n                        outputValue\\n                    );\\n                resultInfo.totalBurnableValue += burnableValue;\\n                resultInfo.totalTreasuryFee += treasuryFee;\\n                redemptionPresent = true;\\n            }\\n\\n            // Make the `outputStartingIndex` pointing to the next output by\\n            // increasing it by current output's length.\\n            processInfo.outputStartingIndex += outputLength;\\n        }\\n\\n        // Protect against the cases when there is only a single change output\\n        // referring back to the wallet PKH and just burning main UTXO value\\n        // for transaction fees.\\n        require(\\n            redemptionPresent,\\n            \\\"Redemption transaction must process at least one redemption\\\"\\n        );\\n    }\\n\\n    /// @notice Processes a single redemption transaction output. Tries to\\n    ///         identify output as a pending redemption request or reported\\n    ///         redemption timeout. Output script passed to this function must\\n    ///         not be the change output. Such output needs to be identified\\n    ///         separately before calling this function.\\n    ///         Reverts if output is neither requested pending redemption nor\\n    ///         requested and reported timed-out redemption.\\n    ///         This function also marks each pending request as processed by\\n    ///         removing them from `pendingRedemptions` mapping.\\n    /// @param walletPubKeyHash 20-byte public key hash (computed using Bitcoin\\n    //         HASH160 over the compressed ECDSA public key) of the wallet which\\n    ///        performed the redemption transaction.\\n    /// @param outputScript Non-change output script to be processed\\n    /// @param outputValue Value of the output being processed\\n    /// @return burnableValue The value burnable as a result of processing this\\n    ///         single redemption output. This value needs to be summed up with\\n    ///         burnable values of all other outputs to evaluate total burnable\\n    ///         value for the entire redemption transaction. This value is 0\\n    ///         for a timed-out redemption request.\\n    /// @return treasuryFee The treasury fee from this single redemption output.\\n    ///         This value needs to be summed up with treasury fees of all other\\n    ///         outputs to evaluate the total treasury fee for the entire\\n    ///         redemption transaction. This value is 0 for a timed-out\\n    ///         redemption request.\\n    function processNonChangeRedemptionTxOutput(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        bytes memory outputScript,\\n        uint64 outputValue\\n    ) internal returns (uint64 burnableValue, uint64 treasuryFee) {\\n        // This function should be called only if the given output is\\n        // supposed to represent a redemption. Build the redemption key\\n        // to perform that check.\\n        uint256 redemptionKey = uint256(\\n            keccak256(abi.encodePacked(walletPubKeyHash, outputScript))\\n        );\\n\\n        if (self.pendingRedemptions[redemptionKey].requestedAt != 0) {\\n            // If we entered here, that means the output was identified\\n            // as a pending redemption request.\\n            RedemptionRequest storage request = self.pendingRedemptions[\\n                redemptionKey\\n            ];\\n            // Compute the request's redeemable amount as the requested\\n            // amount reduced by the treasury fee. The request's\\n            // minimal amount is then the redeemable amount reduced by\\n            // the maximum transaction fee.\\n            uint64 redeemableAmount = request.requestedAmount -\\n                request.treasuryFee;\\n            // Output value must fit between the request's redeemable\\n            // and minimal amounts to be deemed valid.\\n            require(\\n                redeemableAmount - request.txMaxFee <= outputValue &&\\n                    outputValue <= redeemableAmount,\\n                \\\"Output value is not within the acceptable range of the pending request\\\"\\n            );\\n            // Add the redeemable amount to the total burnable value\\n            // the Bridge will use to decrease its balance in the Bank.\\n            burnableValue = redeemableAmount;\\n            // Add the request's treasury fee to the total treasury fee\\n            // value the Bridge will transfer to the treasury.\\n            treasuryFee = request.treasuryFee;\\n            // Request was properly handled so remove its redemption\\n            // key from the mapping to make it reusable for further\\n            // requests.\\n            delete self.pendingRedemptions[redemptionKey];\\n        } else {\\n            // If we entered here, the output is not a redemption\\n            // request but there is still a chance the given output is\\n            // related to a reported timed out redemption request.\\n            // If so, check if the output value matches the request\\n            // amount to confirm this is an overdue request fulfillment\\n            // then bypass this output and process the subsequent\\n            // ones. That also means the wallet was already punished\\n            // for the inactivity. Otherwise, just revert.\\n            RedemptionRequest storage request = self.timedOutRedemptions[\\n                redemptionKey\\n            ];\\n\\n            require(\\n                request.requestedAt != 0,\\n                \\\"Output is a non-requested redemption\\\"\\n            );\\n\\n            uint64 redeemableAmount = request.requestedAmount -\\n                request.treasuryFee;\\n\\n            require(\\n                redeemableAmount - request.txMaxFee <= outputValue &&\\n                    outputValue <= redeemableAmount,\\n                \\\"Output value is not within the acceptable range of the timed out request\\\"\\n            );\\n        }\\n    }\\n\\n    /// @notice Notifies that there is a pending redemption request associated\\n    ///         with the given wallet, that has timed out. The redemption\\n    ///         request is identified by the key built as\\n    ///         `keccak256(walletPubKeyHash | redeemerOutputScript)`.\\n    ///         The results of calling this function:\\n    ///         - the pending redemptions value for the wallet will be decreased\\n    ///           by the requested amount (minus treasury fee),\\n    ///         - the tokens taken from the redeemer on redemption request will\\n    ///           be returned to the redeemer,\\n    ///         - the request will be moved from pending redemptions to\\n    ///           timed-out redemptions,\\n    ///         - if the state of the wallet is `Live` or `MovingFunds`, the\\n    ///           wallet operators will be slashed and the notifier will be\\n    ///           rewarded,\\n    ///         - if the state of wallet is `Live`, the wallet will be closed or\\n    ///           marked as `MovingFunds` (depending on the presence or absence\\n    ///           of the wallet's main UTXO) and the wallet will no longer be\\n    ///           marked as the active wallet (if it was marked as such).\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param walletMembersIDs Identifiers of the wallet signing group members\\n    /// @param redeemerOutputScript  The redeemer's length-prefixed output\\n    ///        script (P2PKH, P2WPKH, P2SH or P2WSH)\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the Live or MovingFunds or Terminated state\\n    ///      - The redemption request identified by `walletPubKeyHash` and\\n    ///        `redeemerOutputScript` must exist\\n    ///      - The expression `keccak256(abi.encode(walletMembersIDs))` must\\n    ///        be exactly the same as the hash stored under `membersIdsHash`\\n    ///        for the given `walletID`. Those IDs are not directly stored\\n    ///        in the contract for gas efficiency purposes but they can be\\n    ///        read from appropriate `DkgResultSubmitted` and `DkgResultApproved`\\n    ///        events of the `WalletRegistry` contract\\n    ///      - The amount of time defined by `redemptionTimeout` must have\\n    ///        passed since the redemption was requested (the request must be\\n    ///        timed-out)\\n    function notifyRedemptionTimeout(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        uint32[] calldata walletMembersIDs,\\n        bytes calldata redeemerOutputScript\\n    ) external {\\n        uint256 redemptionKey = uint256(\\n            keccak256(abi.encodePacked(walletPubKeyHash, redeemerOutputScript))\\n        );\\n        Redemption.RedemptionRequest memory request = self.pendingRedemptions[\\n            redemptionKey\\n        ];\\n\\n        require(request.requestedAt > 0, \\\"Redemption request does not exist\\\");\\n        require(\\n            /* solhint-disable-next-line not-rely-on-time */\\n            request.requestedAt + self.redemptionTimeout < block.timestamp,\\n            \\\"Redemption request has not timed out\\\"\\n        );\\n\\n        // Update the wallet's pending redemptions value\\n        Wallets.Wallet storage wallet = self.registeredWallets[\\n            walletPubKeyHash\\n        ];\\n        wallet.pendingRedemptionsValue -=\\n            request.requestedAmount -\\n            request.treasuryFee;\\n\\n        require(\\n            // TODO: Allow the wallets in `Closing` state when the state is added\\n            wallet.state == Wallets.WalletState.Live ||\\n                wallet.state == Wallets.WalletState.MovingFunds ||\\n                wallet.state == Wallets.WalletState.Terminated,\\n            \\\"The wallet must be in Live, MovingFunds or Terminated state\\\"\\n        );\\n\\n        // It is worth noting that there is no need to check if\\n        // `timedOutRedemption` mapping already contains the given redemption\\n        // key. There is no possibility to re-use a key of a reported timed-out\\n        // redemption because the wallet responsible for causing the timeout is\\n        // moved to a state that prevents it to receive new redemption requests.\\n\\n        // Move the redemption from pending redemptions to timed-out redemptions\\n        self.timedOutRedemptions[redemptionKey] = request;\\n        delete self.pendingRedemptions[redemptionKey];\\n\\n        if (\\n            wallet.state == Wallets.WalletState.Live ||\\n            wallet.state == Wallets.WalletState.MovingFunds\\n        ) {\\n            // Propagate timeout consequences to the wallet\\n            self.notifyWalletTimedOutRedemption(walletPubKeyHash);\\n\\n            // Slash the wallet operators and reward the notifier\\n            self.ecdsaWalletRegistry.seize(\\n                self.redemptionTimeoutSlashingAmount,\\n                self.redemptionTimeoutNotifierRewardMultiplier,\\n                msg.sender,\\n                wallet.ecdsaWalletID,\\n                walletMembersIDs\\n            );\\n        }\\n\\n        // slither-disable-next-line reentrancy-events\\n        emit RedemptionTimedOut(walletPubKeyHash, redeemerOutputScript);\\n\\n        // Return the requested amount of tokens to the redeemer\\n        self.bank.transferBalance(request.redeemer, request.requestedAmount);\\n    }\\n}\\n\",\"keccak256\":\"0x7abf06527135f3e650e106b44d105ba5ca27a9c3dcad12f4f8aa77cc60460720\",\"license\":\"MIT\"},\"contracts/bridge/Wallets.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\nimport {BTCUtils} from \\\"@keep-network/bitcoin-spv-sol/contracts/BTCUtils.sol\\\";\\nimport {EcdsaDkg} from \\\"@keep-network/ecdsa/contracts/libraries/EcdsaDkg.sol\\\";\\nimport {Math} from \\\"@openzeppelin/contracts/utils/math/Math.sol\\\";\\n\\nimport \\\"./BitcoinTx.sol\\\";\\nimport \\\"./EcdsaLib.sol\\\";\\nimport \\\"./BridgeState.sol\\\";\\n\\n/// @title Wallet library\\n/// @notice Library responsible for handling integration between Bridge\\n///         contract and ECDSA wallets.\\nlibrary Wallets {\\n    using BTCUtils for bytes;\\n\\n    /// @notice Represents wallet state:\\n    enum WalletState {\\n        /// @dev The wallet is unknown to the Bridge.\\n        Unknown,\\n        /// @dev The wallet can sweep deposits and accept redemption requests.\\n        Live,\\n        /// @dev The wallet was deemed unhealthy and is expected to move their\\n        ///      outstanding funds to another wallet. The wallet can still\\n        ///      fulfill their pending redemption requests although new\\n        ///      redemption requests and new deposit reveals are not accepted.\\n        MovingFunds,\\n        /// @dev The wallet moved or redeemed all their funds and is in the\\n        ///      closing period where they can be subject of fraud challenges\\n        ///      and must defend against them. This state is needed to protect\\n        ///      against deposit frauds on deposits revealed but not swept.\\n        ///      The closing period must be greater that the deposit refund\\n        ///      time plus some time margin.\\n        Closing,\\n        /// @dev The wallet finalized the closing period successfully and\\n        ///      cannot perform any action in the Bridge.\\n        Closed,\\n        /// @dev The wallet committed a fraud that was reported. The wallet is\\n        ///      blocked and can not perform any actions in the Bridge.\\n        ///      Off-chain coordination with the wallet operators is needed to\\n        ///      recover funds.\\n        Terminated\\n    }\\n\\n    /// @notice Holds information about a wallet.\\n    struct Wallet {\\n        // Identifier of a ECDSA Wallet registered in the ECDSA Wallet Registry.\\n        bytes32 ecdsaWalletID;\\n        // Latest wallet's main UTXO hash computed as\\n        // keccak256(txHash | txOutputIndex | txOutputValue). The `tx` prefix\\n        // refers to the transaction which created that main UTXO. The `txHash`\\n        // is `bytes32` (ordered as in Bitcoin internally), `txOutputIndex`\\n        // an `uint32`, and `txOutputValue` an `uint64` value.\\n        bytes32 mainUtxoHash;\\n        // The total redeemable value of pending redemption requests targeting\\n        // that wallet.\\n        uint64 pendingRedemptionsValue;\\n        // UNIX timestamp the wallet was created at.\\n        uint32 createdAt;\\n        // UNIX timestamp indicating the moment the wallet was requested to\\n        // move their funds.\\n        uint32 movingFundsRequestedAt;\\n        // UNIX timestamp indicating the moment the wallet's closing period\\n        // started.\\n        uint32 closingStartedAt;\\n        // Total count of pending moved funds sweep requests targeting this wallet.\\n        uint32 pendingMovedFundsSweepRequestsCount;\\n        // Current state of the wallet.\\n        WalletState state;\\n        // Moving funds target wallet commitment submitted by the wallet. It\\n        // is built by applying the keccak256 hash over the list of 20-byte\\n        // public key hashes of the target wallets.\\n        bytes32 movingFundsTargetWalletsCommitmentHash;\\n    }\\n\\n    event NewWalletRequested();\\n\\n    event NewWalletRegistered(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletMovingFunds(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletClosing(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletClosed(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    event WalletTerminated(\\n        bytes32 indexed ecdsaWalletID,\\n        bytes20 indexed walletPubKeyHash\\n    );\\n\\n    /// @notice Requests creation of a new wallet. This function just\\n    ///         forms a request and the creation process is performed\\n    ///         asynchronously. Outcome of that process should be delivered\\n    ///         using `registerNewWallet` function.\\n    /// @param activeWalletMainUtxo Data of the active wallet's main UTXO, as\\n    ///        currently known on the Ethereum chain.\\n    /// @dev Requirements:\\n    ///      - `activeWalletMainUtxo` components must point to the recent main\\n    ///        UTXO of the given active wallet, as currently known on the\\n    ///        Ethereum chain. If there is no active wallet at the moment, or\\n    ///        the active wallet has no main UTXO, this parameter can be\\n    ///        empty as it is ignored.\\n    ///      - Wallet creation must not be in progress\\n    ///      - If the active wallet is set, one of the following\\n    ///        conditions must be true:\\n    ///        - The active wallet BTC balance is above the minimum threshold\\n    ///          and the active wallet is old enough, i.e. the creation period\\n    ///           was elapsed since its creation time\\n    ///        - The active wallet BTC balance is above the maximum threshold\\n    function requestNewWallet(\\n        BridgeState.Storage storage self,\\n        BitcoinTx.UTXO calldata activeWalletMainUtxo\\n    ) external {\\n        require(\\n            self.ecdsaWalletRegistry.getWalletCreationState() ==\\n                EcdsaDkg.State.IDLE,\\n            \\\"Wallet creation already in progress\\\"\\n        );\\n\\n        bytes20 activeWalletPubKeyHash = self.activeWalletPubKeyHash;\\n\\n        // If the active wallet is set, fetch this wallet's details from\\n        // storage to perform conditions check. The `registerNewWallet`\\n        // function guarantees an active wallet is always one of the\\n        // registered ones.\\n        if (activeWalletPubKeyHash != bytes20(0)) {\\n            uint64 activeWalletBtcBalance = getWalletBtcBalance(\\n                self,\\n                activeWalletPubKeyHash,\\n                activeWalletMainUtxo\\n            );\\n            uint32 activeWalletCreatedAt = self\\n                .registeredWallets[activeWalletPubKeyHash]\\n                .createdAt;\\n            /* solhint-disable-next-line not-rely-on-time */\\n            bool activeWalletOldEnough = block.timestamp >=\\n                activeWalletCreatedAt + self.walletCreationPeriod;\\n\\n            require(\\n                (activeWalletOldEnough &&\\n                    activeWalletBtcBalance >=\\n                    self.walletCreationMinBtcBalance) ||\\n                    activeWalletBtcBalance >= self.walletCreationMaxBtcBalance,\\n                \\\"Wallet creation conditions are not met\\\"\\n            );\\n        }\\n\\n        emit NewWalletRequested();\\n\\n        self.ecdsaWalletRegistry.requestNewWallet();\\n    }\\n\\n    /// @notice Gets BTC balance for given the wallet.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param walletMainUtxo Data of the wallet's main UTXO, as currently\\n    ///        known on the Ethereum chain.\\n    /// @return walletBtcBalance Current BTC balance for the given wallet.\\n    /// @dev Requirements:\\n    ///      - `walletMainUtxo` components must point to the recent main UTXO\\n    ///        of the given wallet, as currently known on the Ethereum chain.\\n    ///        If the wallet has no main UTXO, this parameter can be empty as it\\n    ///        is ignored.\\n    function getWalletBtcBalance(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata walletMainUtxo\\n    ) internal view returns (uint64 walletBtcBalance) {\\n        bytes32 walletMainUtxoHash = self\\n            .registeredWallets[walletPubKeyHash]\\n            .mainUtxoHash;\\n\\n        // If the wallet has a main UTXO hash set, cross-check it with the\\n        // provided plain-text parameter and get the transaction output value\\n        // as BTC balance. Otherwise, the BTC balance is just zero.\\n        if (walletMainUtxoHash != bytes32(0)) {\\n            require(\\n                keccak256(\\n                    abi.encodePacked(\\n                        walletMainUtxo.txHash,\\n                        walletMainUtxo.txOutputIndex,\\n                        walletMainUtxo.txOutputValue\\n                    )\\n                ) == walletMainUtxoHash,\\n                \\\"Invalid wallet main UTXO data\\\"\\n            );\\n\\n            walletBtcBalance = walletMainUtxo.txOutputValue;\\n        }\\n\\n        return walletBtcBalance;\\n    }\\n\\n    /// @notice Registers a new wallet. This function should be called\\n    ///         after the wallet creation process initiated using\\n    ///         `requestNewWallet` completes and brings the outcomes.\\n    /// @param ecdsaWalletID Wallet's unique identifier.\\n    /// @param publicKeyX Wallet's public key's X coordinate.\\n    /// @param publicKeyY Wallet's public key's Y coordinate.\\n    /// @dev Requirements:\\n    ///      - The only caller authorized to call this function is `registry`\\n    ///      - Given wallet data must not belong to an already registered wallet\\n    function registerNewWallet(\\n        BridgeState.Storage storage self,\\n        bytes32 ecdsaWalletID,\\n        bytes32 publicKeyX,\\n        bytes32 publicKeyY\\n    ) external {\\n        require(\\n            msg.sender == address(self.ecdsaWalletRegistry),\\n            \\\"Caller is not the ECDSA Wallet Registry\\\"\\n        );\\n\\n        // Compress wallet's public key and calculate Bitcoin's hash160 of it.\\n        bytes20 walletPubKeyHash = bytes20(\\n            EcdsaLib.compressPublicKey(publicKeyX, publicKeyY).hash160View()\\n        );\\n\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        require(\\n            wallet.state == WalletState.Unknown,\\n            \\\"ECDSA wallet has been already registered\\\"\\n        );\\n        wallet.ecdsaWalletID = ecdsaWalletID;\\n        wallet.state = WalletState.Live;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        wallet.createdAt = uint32(block.timestamp);\\n\\n        // Set the freshly created wallet as the new active wallet.\\n        self.activeWalletPubKeyHash = walletPubKeyHash;\\n\\n        self.liveWalletsCount++;\\n\\n        emit NewWalletRegistered(ecdsaWalletID, walletPubKeyHash);\\n    }\\n\\n    /// @notice Handles a notification about a wallet heartbeat failure and\\n    ///         triggers the wallet moving funds process.\\n    /// @param publicKeyX Wallet's public key's X coordinate.\\n    /// @param publicKeyY Wallet's public key's Y coordinate.\\n    /// @dev Requirements:\\n    ///      - The only caller authorized to call this function is `registry`\\n    ///      - Wallet must be in Live state\\n    function notifyWalletHeartbeatFailed(\\n        BridgeState.Storage storage self,\\n        bytes32 publicKeyX,\\n        bytes32 publicKeyY\\n    ) external {\\n        require(\\n            msg.sender == address(self.ecdsaWalletRegistry),\\n            \\\"Caller is not the ECDSA Wallet Registry\\\"\\n        );\\n\\n        // Compress wallet's public key and calculate Bitcoin's hash160 of it.\\n        bytes20 walletPubKeyHash = bytes20(\\n            EcdsaLib.compressPublicKey(publicKeyX, publicKeyY).hash160View()\\n        );\\n\\n        require(\\n            self.registeredWallets[walletPubKeyHash].state == WalletState.Live,\\n            \\\"ECDSA wallet must be in Live state\\\"\\n        );\\n\\n        moveFunds(self, walletPubKeyHash);\\n    }\\n\\n    /// @notice Handles a notification about a wallet redemption timeout.\\n    ///         Triggers the wallet moving funds process only if the wallet is\\n    ///         still in the Live state. That means multiple action timeouts can\\n    ///         be reported for the same wallet but only the first report\\n    ///         requests the wallet to move their funds.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the `Live` or `MovingFunds` state\\n    function notifyWalletTimedOutRedemption(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        WalletState walletState = self\\n            .registeredWallets[walletPubKeyHash]\\n            .state;\\n\\n        require(\\n            walletState == WalletState.Live ||\\n                walletState == WalletState.MovingFunds,\\n            \\\"ECDSA wallet must be in Live or MovingFunds state\\\"\\n        );\\n\\n        if (walletState == WalletState.Live) {\\n            moveFunds(self, walletPubKeyHash);\\n        }\\n    }\\n\\n    /// @notice Notifies that the wallet is either old enough or has too few\\n    ///         satoshis left and qualifies to be closed.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param walletMainUtxo Data of the wallet's main UTXO, as currently\\n    ///        known on the Ethereum chain.\\n    /// @dev Requirements:\\n    ///      - Wallet must not be set as the current active wallet\\n    ///      - Wallet must exceed the wallet maximum age OR the wallet BTC\\n    ///        balance must be lesser than the minimum threshold. If the latter\\n    ///        case is true, the `walletMainUtxo` components must point to the\\n    ///        recent main UTXO of the given wallet, as currently known on the\\n    ///        Ethereum chain. If the wallet has no main UTXO, this parameter\\n    ///        can be empty as it is ignored since the wallet balance is\\n    ///        assumed to be zero.\\n    ///      - Wallet must be in Live state\\n    function notifyCloseableWallet(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        BitcoinTx.UTXO calldata walletMainUtxo\\n    ) external {\\n        require(\\n            self.activeWalletPubKeyHash != walletPubKeyHash,\\n            \\\"Active wallet cannot be considered closeable\\\"\\n        );\\n\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        require(\\n            wallet.state == WalletState.Live,\\n            \\\"ECDSA wallet must be in Live state\\\"\\n        );\\n\\n        /* solhint-disable-next-line not-rely-on-time */\\n        bool walletOldEnough = block.timestamp >=\\n            wallet.createdAt + self.walletMaxAge;\\n\\n        require(\\n            walletOldEnough ||\\n                getWalletBtcBalance(self, walletPubKeyHash, walletMainUtxo) <\\n                self.walletClosureMinBtcBalance,\\n            \\\"Wallet needs to be old enough or have too few satoshis\\\"\\n        );\\n\\n        moveFunds(self, walletPubKeyHash);\\n    }\\n\\n    /// @notice Requests a wallet to move their funds. If the wallet balance\\n    ///         is zero, the wallet closing begins immediately. If the move\\n    ///         funds request refers to the current active wallet, such a wallet\\n    ///         is no longer considered active and the active wallet slot\\n    ///         is unset allowing to trigger a new wallet creation immediately.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the Live state\\n    function moveFunds(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        if (wallet.mainUtxoHash == bytes32(0)) {\\n            // If the wallet has no main UTXO, that means its BTC balance\\n            // is zero and the wallet closing should begin immediately.\\n            beginWalletClosing(self, walletPubKeyHash);\\n        } else {\\n            // Otherwise, initialize the moving funds process.\\n            wallet.state = WalletState.MovingFunds;\\n            /* solhint-disable-next-line not-rely-on-time */\\n            wallet.movingFundsRequestedAt = uint32(block.timestamp);\\n\\n            emit WalletMovingFunds(wallet.ecdsaWalletID, walletPubKeyHash);\\n        }\\n\\n        if (self.activeWalletPubKeyHash == walletPubKeyHash) {\\n            // If the move funds request refers to the current active wallet,\\n            // unset the active wallet and make the wallet creation process\\n            // possible in order to get a new healthy active wallet.\\n            delete self.activeWalletPubKeyHash;\\n        }\\n\\n        self.liveWalletsCount--;\\n    }\\n\\n    /// @notice Begins the closing period of the given wallet.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the\\n    ///        MovingFunds state\\n    function beginWalletClosing(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        // Initialize the closing period.\\n        wallet.state = WalletState.Closing;\\n        /* solhint-disable-next-line not-rely-on-time */\\n        wallet.closingStartedAt = uint32(block.timestamp);\\n\\n        emit WalletClosing(wallet.ecdsaWalletID, walletPubKeyHash);\\n    }\\n\\n    /// @notice Notifies about the end of the closing period for the given wallet.\\n    ///         Closes the wallet ultimately and notifies the ECDSA registry\\n    ///         about this fact.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The wallet must be in the Closing state\\n    ///      - The wallet closing period must have elapsed\\n    function notifyWalletClosingPeriodElapsed(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        require(\\n            wallet.state == WalletState.Closing,\\n            \\\"ECDSA wallet must be in Closing state\\\"\\n        );\\n\\n        require(\\n            /* solhint-disable-next-line not-rely-on-time */\\n            block.timestamp >\\n                wallet.closingStartedAt + self.walletClosingPeriod,\\n            \\\"Closing period has not elapsed yet\\\"\\n        );\\n\\n        finalizeWalletClosing(self, walletPubKeyHash);\\n    }\\n\\n    /// @notice Finalizes the closing period of the given wallet and notifies\\n    ///         the ECDSA registry about this fact.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the Closing state\\n    function finalizeWalletClosing(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        wallet.state = WalletState.Closed;\\n\\n        emit WalletClosed(wallet.ecdsaWalletID, walletPubKeyHash);\\n\\n        self.ecdsaWalletRegistry.closeWallet(wallet.ecdsaWalletID);\\n    }\\n\\n    /// @notice Terminates the given wallet and notifies the ECDSA registry\\n    ///         about this fact. If the wallet termination refers to the current\\n    ///         active wallet, such a wallet is no longer considered active and\\n    ///         the active wallet slot is unset allowing to trigger a new wallet\\n    ///         creation immediately.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @dev Requirements:\\n    ///      - The caller must make sure that the wallet is in the\\n    ///        Live or MovingFunds or Closing state.\\n    function terminateWallet(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n\\n        if (wallet.state == WalletState.Live) {\\n            self.liveWalletsCount--;\\n        }\\n\\n        wallet.state = WalletState.Terminated;\\n\\n        emit WalletTerminated(wallet.ecdsaWalletID, walletPubKeyHash);\\n\\n        if (self.activeWalletPubKeyHash == walletPubKeyHash) {\\n            // If termination refers to the current active wallet,\\n            // unset the active wallet and make the wallet creation process\\n            // possible in order to get a new healthy active wallet.\\n            delete self.activeWalletPubKeyHash;\\n        }\\n\\n        self.ecdsaWalletRegistry.closeWallet(wallet.ecdsaWalletID);\\n    }\\n\\n    /// @notice Notifies that the wallet completed the moving funds process\\n    ///         successfully. Checks if the funds were moved to the expected\\n    ///         target wallets. Closes the source wallet if everything went\\n    ///         good and reverts otherwise.\\n    /// @param walletPubKeyHash 20-byte public key hash of the wallet\\n    /// @param targetWalletsHash 32-byte keccak256 hash over the list of\\n    ///        20-byte public key hashes of the target wallets actually used\\n    ///        within the moving funds transactions.\\n    /// @dev Requirements:\\n    ///      - The caller must make sure the moving funds transaction actually\\n    ///        happened on Bitcoin chain and fits the protocol requirements.\\n    ///      - The source wallet must be in the MovingFunds state\\n    ///      - The target wallets commitment must be submitted by the source\\n    ///        wallet.\\n    ///      - The actual target wallets used in the moving funds transaction\\n    ///        must be exactly the same as the target wallets commitment.\\n    function notifyWalletFundsMoved(\\n        BridgeState.Storage storage self,\\n        bytes20 walletPubKeyHash,\\n        bytes32 targetWalletsHash\\n    ) internal {\\n        Wallet storage wallet = self.registeredWallets[walletPubKeyHash];\\n        // Check that the wallet is in the MovingFunds state but don't check\\n        // if the moving funds timeout is exceeded. That should give a\\n        // possibility to move funds in case when timeout was hit but was\\n        // not reported yet.\\n        require(\\n            wallet.state == WalletState.MovingFunds,\\n            \\\"ECDSA wallet must be in MovingFunds state\\\"\\n        );\\n\\n        bytes32 targetWalletsCommitmentHash = wallet\\n            .movingFundsTargetWalletsCommitmentHash;\\n\\n        require(\\n            targetWalletsCommitmentHash != bytes32(0),\\n            \\\"Target wallets commitment not submitted yet\\\"\\n        );\\n\\n        // Make sure that the target wallets where funds were moved to are\\n        // exactly the same as the ones the source wallet committed to.\\n        require(\\n            targetWalletsCommitmentHash == targetWalletsHash,\\n            \\\"Target wallets don't correspond to the commitment\\\"\\n        );\\n\\n        // If funds were moved, the wallet has no longer a main UTXO.\\n        delete wallet.mainUtxoHash;\\n\\n        beginWalletClosing(self, walletPubKeyHash);\\n    }\\n}\\n\",\"keccak256\":\"0xf6f877bed856dfac60e98c24cb73e4388659d3633f6c440a9b8c094b9b3dbbcf\",\"license\":\"MIT\"},\"contracts/vault/IVault.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n// \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588     \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c     \\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\u2588\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n//               \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c    \\u2590\\u2588\\u2588\\u2588\\u2588\\u258c\\n\\npragma solidity ^0.8.9;\\n\\n/// @title Bank Vault interface\\n/// @notice `IVault` is an interface for a smart contract consuming Bank\\n///         balances of other contracts or externally owned accounts (EOA).\\ninterface IVault {\\n    /// @notice Called by the Bank in `approveBalanceAndCall` function after\\n    ///         the balance `owner` approved `amount` of their balance in the\\n    ///         Bank for the vault. This way, the depositor can approve balance\\n    ///         and call the vault to use the approved balance in a single\\n    ///         transaction.\\n    /// @param owner Address of the Bank balance owner who approved their\\n    ///        balance to be used by the vault\\n    /// @param amount The amount of the Bank balance approved by the owner\\n    ///        to be used by the vault\\n    // @dev The implementation must ensure this function can only be called\\n    ///      by the Bank. The Bank does _not_ guarantee that the `amount`\\n    ///      approved by the `owner` currently exists on their balance. That is,\\n    ///      the `owner` could approve more balance than they currently have.\\n    ///      This works the same as `Bank.approve` function. The vault must\\n    ///      ensure the actual balance is checked before performing any action\\n    ///      based on it.\\n    function receiveBalanceApproval(address owner, uint256 amount) external;\\n\\n    /// @notice Called by the Bank in `increaseBalanceAndCall` function after\\n    ///         increasing the balance in the Bank for the vault. It happens in\\n    ///         the same transaction in which deposits were swept by the Bridge.\\n    ///         This allows the depositor to route their deposit revealed to the\\n    ///         Bridge to the particular smart contract (vault) in the same\\n    ///         transaction in which the deposit is revealed. This way, the\\n    ///         depositor does not have to execute additional transaction after\\n    ///         the deposit gets swept by the Bridge to approve and transfer\\n    ///         their balance to the vault.\\n    /// @param depositors Addresses of depositors whose deposits have been swept\\n    /// @param depositedAmounts Amounts deposited by individual depositors and\\n    ///        swept\\n    /// @dev The implementation must ensure this function can only be called\\n    ///      by the Bank. The Bank guarantees that the vault's balance was\\n    ///      increased by the sum of all deposited amounts before this function\\n    ///      is called, in the same transaction.\\n    function receiveBalanceIncrease(\\n        address[] calldata depositors,\\n        uint256[] calldata depositedAmounts\\n    ) external;\\n}\\n\",\"keccak256\":\"0x48d596548f2e6a69e31825f49882998789ea43ff5bcaeb5eea2d9b910577a5e9\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x613c9b61003a600b82828239805160001a60731461002d57634e487b7160e01b600052600060045260246000fd5b30600052607381538281f3fe730000000000000000000000000000000000000000301460806040526004361061004b5760003560e01c80637333b36914610050578063a164de6e14610072578063a76558b314610092575b600080fd5b81801561005c57600080fd5b5061007061006b3660046134e9565b6100b2565b005b81801561007e57600080fd5b5061007061008d366004613568565b610853565b81801561009e57600080fd5b506100706100ad366004613600565b610bf2565b6001600160601b031985166000908152601b87016020526040902060016002820154600160c01b900460ff1660058111156100ef576100ef6136bb565b146101415760405162461bcd60e51b815260206004820152601c60248201527f57616c6c6574206d75737420626520696e204c6976652073746174650000000060448201526064015b60405180910390fd5b60018101548061019d5760405162461bcd60e51b815260206004820152602160248201527f4e6f206d61696e205554584f20666f722074686520676976656e2077616c6c656044820152601d60fa1b6064820152608401610138565b8086356101b06040890160208a016136e5565b6101c060608a0160408b01613700565b6040516020016101fd9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60405160208183030381529060405280519060200120146102605760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b6000610292600060c01b878760405160200161027e9392919061371b565b604051602081830303815290604052611165565b9050600081511161030b5760405162461bcd60e51b815260206004820152602e60248201527f52656465656d6572206f757470757420736372697074206d757374206265206160448201527f207374616e6461726420747970650000000000000000000000000000000000006064820152608401610138565b80805190602001208860405160200161033491906001600160601b031991909116815260140190565b6040516020818303038152906040528051906020012014156103be5760405162461bcd60e51b815260206004820152603760248201527f52656465656d6572206f757470757420736372697074206d757374206e6f742060448201527f706f696e7420746f207468652077616c6c657420504b480000000000000000006064820152608401610138565b600c89015467ffffffffffffffff90811690851610156104205760405162461bcd60e51b815260206004820152601b60248201527f526564656d7074696f6e20616d6f756e7420746f6f20736d616c6c00000000006044820152606401610138565b60008887876040516020016104379392919061373f565b60408051808303601f190181529181528151602092830120600081815260108e01909352912060010154909150600160801b900463ffffffff161561050a5760405162461bcd60e51b815260206004820152604a60248201527f546865726520697320612070656e64696e6720726564656d7074696f6e20726560448201527f71756573742066726f6d20746869732077616c6c657420746f2074686520736160648201527f6d65206164647265737300000000000000000000000000000000000000000000608482015260a401610138565b600c8a015460009068010000000000000000900467ffffffffffffffff16610533576000610558565b600c8b01546105589068010000000000000000900467ffffffffffffffff168761378f565b600c8c0154909150600160801b900467ffffffffffffffff1661057b82886137b6565b60028701805460009061059990849067ffffffffffffffff166137df565b82546101009290920a67ffffffffffffffff81810219909316918316021790915560028801541690506105d260608c0160408d01613700565b67ffffffffffffffff16101561062a5760405162461bcd60e51b815260206004820152601960248201527f496e73756666696369656e742077616c6c65742066756e6473000000000000006044820152606401610138565b6040518060a00160405280336001600160a01b031681526020018867ffffffffffffffff1681526020018367ffffffffffffffff1681526020018267ffffffffffffffff1681526020014263ffffffff168152508c601001600085815260200190815260200160002060008201518160000160006101000a8154816001600160a01b0302191690836001600160a01b0316021790555060208201518160000160146101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060408201518160010160006101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060608201518160010160086101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060808201518160010160106101000a81548163ffffffff021916908363ffffffff1602179055509050507f97a0199072f487232635d50ab75860891afe0b91c976ed2fc76502c4d82d0d958b8a8a338b87876040516107b29796959493929190613834565b60405180910390a18b546040517f7c6db49c00000000000000000000000000000000000000000000000000000000815233600482015230602482015267ffffffffffffffff891660448201526001600160a01b0390911690637c6db49c90606401600060405180830381600087803b15801561082d57600080fd5b505af1158015610841573d6000803e3d6000fd5b50505050505050505050505050505050565b600061086086868661140b565b90506108b1866108736020880188613898565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508892508791506116fb9050565b6001600160601b031982166000908152601b8701602052604090206002810154600160c01b900460ff1660018160058111156108ef576108ef6136bb565b148061090c5750600281600581111561090a5761090a6136bb565b145b61097e5760405162461bcd60e51b815260206004820152602b60248201527f57616c6c6574206d75737420626520696e204c697665206f72204d6f76696e6760448201527f46756e64732073746174650000000000000000000000000000000000000000006064820152608401610138565b60006109cd8961099160408b018b613898565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508a9250611955915050565b606081015190915067ffffffffffffffff1615610a4e578381604001518260600151604051602001610a2c9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60408051601f1981840301815291905280516020909101206001840155610a56565b600060018401555b8051600284018054600090610a7690849067ffffffffffffffff166137b6565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff1602179055507fa45596c10f758d32ec8cca64a0fbfe776052b08fdb3f026e0a87f52118bf8fbe8585604051610ae29291906001600160601b0319929092168252602082015260400190565b60405180910390a1885481516040517f392aee4300000000000000000000000000000000000000000000000000000000815267ffffffffffffffff90911660048201526001600160a01b039091169063392aee4390602401600060405180830381600087803b158015610b5457600080fd5b505af1158015610b68573d6000803e3d6000fd5b50508a546004808d015460208601516040516356a6d9ef60e01b81526001600160a01b039283169381019390935267ffffffffffffffff16602483015290911692506356a6d9ef91506044015b600060405180830381600087803b158015610bcf57600080fd5b505af1158015610be3573d6000803e3d6000fd5b50505050505050505050505050565b6000858383604051602001610c099392919061373f565b60408051808303601f190181528282528051602091820120600081815260108c01835283902060a08501845280546001600160a01b0381168652600160a01b900467ffffffffffffffff9081169386019390935260010154808316938501939093526801000000000000000083049091166060840152600160801b90910463ffffffff1660808301819052909250610ced5760405162461bcd60e51b815260206004820152602160248201527f526564656d7074696f6e207265717565737420646f6573206e6f7420657869736044820152601d60fa1b6064820152608401610138565b4288600d0154826080015163ffffffff16610d0891906138df565b10610d7a5760405162461bcd60e51b8152602060048201526024808201527f526564656d7074696f6e207265717565737420686173206e6f742074696d656460448201527f206f7574000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001600160601b031987166000908152601b890160209081526040918290209183015190830151610dab91906137b6565b600282018054600090610dc990849067ffffffffffffffff166137b6565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060016005811115610e0257610e026136bb565b6002820154600160c01b900460ff166005811115610e2257610e226136bb565b1480610e4c5750600280820154600160c01b900460ff166005811115610e4a57610e4a6136bb565b145b80610e76575060056002820154600160c01b900460ff166005811115610e7457610e746136bb565b145b610ee85760405162461bcd60e51b815260206004820152603b60248201527f5468652077616c6c6574206d75737420626520696e204c6976652c204d6f766960448201527f6e6746756e6473206f72205465726d696e6174656420737461746500000000006064820152608401610138565b600083815260118a016020908152604080832085518154878501516001600160a01b039092166001600160e01b031991821617600160a01b67ffffffffffffffff93841602178355878401516001938401805460608b015160808c01519386167fffffffffffffffffffffffffffffffff0000000000000000000000000000000090921691909117680100000000000000009190951602939093177fffffffffffffffffffffffff00000000ffffffffffffffffffffffffffffffff16600160801b63ffffffff909216919091021790915560108e019093529220805490911681558101805473ffffffffffffffffffffffffffffffffffffffff191690556002820154600160c01b900460ff166005811115611007576110076136bb565b14806110315750600280820154600160c01b900460ff16600581111561102f5761102f6136bb565b145b156110e2576110408989611a8c565b6002890154600e8a0154600f8b015483546040517fd8dc404d0000000000000000000000000000000000000000000000000000000081526001600160a01b039094169363d8dc404d936110af936bffffffffffffffffffffffff9091169290913391908e908e906004016138f7565b600060405180830381600087803b1580156110c957600080fd5b505af11580156110dd573d6000803e3d6000fd5b505050505b7f013dddc8debc4730cd01232fdcea9ae6013689837732356c187fe5edb9a8a8d588868660405161111593929190613979565b60405180910390a18854825160208401516040516356a6d9ef60e01b81526001600160a01b03928316600482015267ffffffffffffffff90911660248201529116906356a6d9ef90604401610bb5565b606060008260088151811061117c5761117c6139a2565b0160200151835160f89190911c91506111968260096139b8565b60ff16146111b4575050604080516020810190915260008152919050565b826009815181106111c7576111c76139a2565b016020015160f81c61126d5760028160ff1610156111f5575050604080516020810190915260008152919050565b600083600a8151811061120a5761120a6139a2565b016020015160f81c905061121f6002836139dd565b60ff168114158061123d57508060201415801561123d575080601414155b1561125957505060408051602081019091526000815292915050565b61126584600b83611b81565b949350505050565b600061127a846008611c4b565b90507f1976a900000000000000000000000000000000000000000000000000000000007fffffff0000000000000000000000000000000000000000000000000000000000821614156113575783600b815181106112d9576112d96139a2565b60209101015160f81c601414158061132e5750611304600285516112fd9190613a00565b8590611c4b565b7dffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191661222b60f21b14155b1561134a57505060408051602081019091526000815292915050565b61126584600c6014611b81565b7f17a91400000000000000000000000000000000000000000000000000000000007fffffff0000000000000000000000000000000000000000000000000000000000821614156113f45783600185516113b09190613a00565b815181106113c0576113c06139a2565b60209101015160f81c6087146113e757505060408051602081019091526000815292915050565b61126584600b6014611b81565b505050604080516020810190915260008152919050565b600061145761141d6020850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611c6392505050565b6114a35760405162461bcd60e51b815260206004820152601d60248201527f496e76616c696420696e70757420766563746f722070726f76696465640000006044820152606401610138565b6114ed6114b36040850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611d1392505050565b6115395760405162461bcd60e51b815260206004820152601e60248201527f496e76616c6964206f757470757420766563746f722070726f766964656400006044820152606401610138565b61159c6115496020850185613a17565b6115566020860186613898565b6115636040880188613898565b61157360808a0160608b01613a17565b60405160200161158896959493929190613a41565b604051602081830303815290604052611db6565b90506116376115eb6115b16040850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611ddd92505050565b6115f58480613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250869493925050506020860135611dea565b6116a95760405162461bcd60e51b815260206004820152603c60248201527f5478206d65726b6c652070726f6f66206973206e6f742076616c696420666f7260448201527f2070726f76696465642068656164657220616e642074782068617368000000006064820152608401610138565b6116f4846116ba6040850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611e2692505050565b9392505050565b6001600160601b031981166000908152601b85016020526040902060010154806117675760405162461bcd60e51b815260206004820152601d60248201527f4e6f206d61696e205554584f20666f7220676976656e2077616c6c65740000006044820152606401610138565b80833561177a60408601602087016136e5565b61178a6060870160408801613700565b6040516020016117c79392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b604051602081830303815290604052805190602001201461182a5760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b60008061183686612195565b9092509050843582148015611865575063ffffffff811661185d60408701602088016136e5565b63ffffffff16145b6118d75760405162461bcd60e51b815260206004820152603f60248201527f4f7574626f756e64207472616e73616374696f6e20696e707574206d7573742060448201527f706f696e7420746f207468652077616c6c65742773206d61696e205554584f006064820152608401610138565b600160178801600087356118f160408a0160208b016136e5565b60405160200161191892919091825260e01b6001600160e01b031916602082015260240190565b60408051808303601f19018152918152815160209283012083529082019290925201600020805460ff191691151591909117905550505050505050565b6040805160808101825260008082526020820181905291810182905260608101829052908061198385612270565b909250905060006119958360016138df565b6040517f1976a9140000000000000000000000000000000000000000000000000000000060208201526001600160601b03198716602482015261222b60f21b6038820152909150600090603a0160408051601f198184030181529082905280516020918201207f1600140000000000000000000000000000000000000000000000000000000000918301919091526001600160601b0319881660238301529150600090603701604051602081830303815290604052805190602001209050611a7f898989604051806080016040528088815260200189815260200187815260200186815250612287565b9998505050505050505050565b6001600160601b031981166000908152601b83016020526040902060020154600160c01b900460ff166001816005811115611ac957611ac96136bb565b1480611ae657506002816005811115611ae457611ae46136bb565b145b611b585760405162461bcd60e51b815260206004820152603160248201527f45434453412077616c6c6574206d75737420626520696e204c697665206f722060448201527f4d6f76696e6746756e64732073746174650000000000000000000000000000006064820152608401610138565b6001816005811115611b6c57611b6c6136bb565b1415611b7c57611b7c8383612486565b505050565b606081611b9d57506040805160208101909152600081526116f4565b6000611ba983856138df565b90508381118015611bbb575080855110155b611c075760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b604051915082604083010160405282825283850182038460208701018481015b80821015611c4057815183830152602082019150611c27565b505050509392505050565b6000611c5a8383016020015190565b90505b92915050565b6000806000611c7184612270565b9092509050801580611c84575060001982145b15611c93575060009392505050565b6000611ca08360016138df565b905060005b82811015611d065785518210611cc15750600095945050505050565b6000611ccd87846125d0565b9050600019811415611ce6575060009695505050505050565b611cf081846138df565b9250508080611cfe90613a83565b915050611ca5565b5093519093149392505050565b6000806000611d2184612270565b9092509050801580611d34575060001982145b15611d43575060009392505050565b6000611d508360016138df565b905060005b82811015611d065785518210611d715750600095945050505050565b6000611d7d878461261b565b9050600019811415611d96575060009695505050505050565b611da081846138df565b9250508080611dae90613a83565b915050611d55565b60006020600083516020850160025afa50602060006020600060025afa5050600051919050565b6044810151600090611c5d565b60008385148015611df9575081155b8015611e0457508251155b15611e1157506001611265565b611e1d85848685612681565b95945050505050565b6001820154604080517f113764be00000000000000000000000000000000000000000000000000000000815290516001600160a01b0390921691600091839163113764be91600480820192602092909190829003018186803b158015611e8b57600080fd5b505afa158015611e9f573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611ec39190613a9e565b90506000826001600160a01b0316632b97be246040518163ffffffff1660e01b815260040160206040518083038186803b158015611f0057600080fd5b505afa158015611f14573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611f389190613a9e565b9050600080611f4e611f4987612729565b6127be565b905083811415611f6057839150611fde565b82811415611f7057829150611fde565b60405162461bcd60e51b815260206004820152602560248201527f4e6f742061742063757272656e74206f722070726576696f757320646966666960448201527f63756c74790000000000000000000000000000000000000000000000000000006064820152608401610138565b6000611fe9876127e6565b90506000198114156120635760405162461bcd60e51b815260206004820152602360248201527f496e76616c6964206c656e677468206f6620746865206865616465727320636860448201527f61696e00000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001198114156120b55760405162461bcd60e51b815260206004820152601560248201527f496e76616c6964206865616465727320636861696e00000000000000000000006044820152606401610138565b6002198114156121075760405162461bcd60e51b815260206004820152601d60248201527f496e73756666696369656e7420776f726b20696e2061206865616465720000006044820152606401610138565b60038801546121169084613ab7565b81101561218b5760405162461bcd60e51b815260206004820152603360248201527f496e73756666696369656e7420616363756d756c61746564206469666669637560448201527f6c747920696e2068656164657220636861696e000000000000000000000000006064820152608401610138565b5050505050505050565b60008060006121a384612270565b9150508060011461221c5760405162461bcd60e51b815260206004820152602d60248201527f4f7574626f756e64207472616e73616374696f6e206d7573742068617665206160448201527f2073696e676c6520696e707574000000000000000000000000000000000000006064820152608401610138565b600061222885826129ed565b905061223381612bd3565b935061226761224182612be0565b60d881901c63ff00ff001662ff00ff60e89290921c9190911617601081811b91901c1790565b92505050915091565b60008061227e836000612bed565b91509150915091565b604080516080810182526000808252602082018190529181018290526060810182905290805b83602001518110156124095783516000906122c990889061261b565b85519091506000906122dd90899084611b81565b905060006122ea82612d6b565b9050600061230860088085516123009190613a00565b859190611b81565b9050866060015167ffffffffffffffff166000148015612344575060408801518151602083012014806123445750606088015181516020830120145b801561235a575060008267ffffffffffffffff16115b156123805763ffffffff8516604088015267ffffffffffffffff821660608801526123da565b60008061238f8d8c8587612de2565b9150915081896000018181516123a591906137df565b67ffffffffffffffff169052506020890180518291906123c69083906137df565b67ffffffffffffffff169052506001975050505b83886000018181516123ec91906138df565b9052508493506124019250839150613a839050565b9150506122ad565b508061247d5760405162461bcd60e51b815260206004820152603b60248201527f526564656d7074696f6e207472616e73616374696f6e206d7573742070726f6360448201527f657373206174206c65617374206f6e6520726564656d7074696f6e00000000006064820152608401610138565b50949350505050565b6001600160601b031981166000908152601b83016020526040902060018101546124b9576124b48383613171565b612550565b60028101805463ffffffff42166c01000000000000000000000000027fffffffffffffff00ffffffffffffffff00000000ffffffffffffffffffffffff90911617780200000000000000000000000000000000000000000000000017905580546040516001600160601b0319841691907fbdc9ce990a067e5fd3a5d8dfc68e27e9f221aaa3fe55265e0b7e93c460b3efe290600090a35b601983015460601b6001600160601b0319908116908316141561258d5760198301805473ffffffffffffffffffffffffffffffffffffffff191690555b601983018054600160a01b900463ffffffff169060146125ac83613ad6565b91906101000a81548163ffffffff021916908363ffffffff16021790555050505050565b60008060006125df8585613211565b90925090506000198214156125fa5760001992505050611c5d565b806126068360256138df565b61261091906138df565b611e1d9060046138df565b60006126288260096138df565b835110156126395750600019611c5d565b6000806126508561264b8660086138df565b612bed565b909250905060001982141561266b5760001992505050611c5d565b806126778360096138df565b611e1d91906138df565b6000602084516126919190613af6565b1561269e57506000611265565b83516126ac57506000611265565b818560005b865181101561271c576126c5600284613af6565b600114156126ea576126e36126dd8883016020015190565b83613253565b9150612703565b612700826126fb8984016020015190565b613253565b91505b60019290921c916127156020826138df565b90506126b1565b5090931495945050505050565b600080612737836048611c4b565b60e81c9050600083604b81518110612751576127516139a2565b016020015160f81c9050600061278583600060108262ffffff16901c8261ff001660108462ffffff16901b17179050919050565b62ffffff16905060006127996003846139dd565b60ff1690506127aa81610100613bee565b6127b49083613ab7565b9695505050505050565b6000611c5d7bffff00000000000000000000000000000000000000000000000000008361325f565b6000605082516127f69190613af6565b156128045750600019919050565b506040805160808101909152605081526000908190815b84518110156129e55761282f85838361326b565b801561284f5761283f8284613300565b61284f5750600119949350505050565b600061285a83612729565b905061286583611db6565b9350806129a98560008190506008817eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff16901b600882901c7eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff161790506010817dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff16901b601082901c7dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff161790506020817bffffffff00000000ffffffff00000000ffffffff00000000ffffffff16901b602082901c7bffffffff00000000ffffffff00000000ffffffff00000000ffffffff1617905060408177ffffffffffffffff0000000000000000ffffffffffffffff16901b604082901c77ffffffffffffffff0000000000000000ffffffffffffffff16179050608081901b608082901c179050919050565b11156129bc575060021995945050505050565b6129cf6129c8826127be565b8690613329565b94506129de90506050826138df565b905061281b565b505050919050565b60606000806129fb85612270565b9092509050600019821415612a785760405162461bcd60e51b815260206004820152602260248201527f52656164206f76657272756e20647572696e6720566172496e7420706172736960448201527f6e670000000000000000000000000000000000000000000000000000000000006064820152608401610138565b808410612ac75760405162461bcd60e51b815260206004820152601060248201527f56696e2072656164206f76657272756e000000000000000000000000000000006044820152606401610138565b600080612ad58460016138df565b905060005b86811015612b5e57612aec88836125d0565b9250600019831415612b405760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612b4a83836138df565b915080612b5681613a83565b915050612ada565b50612b6987826125d0565b9150600019821415612bbd5760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612bc8878284611b81565b979650505050505050565b6020810151600090611c5d565b6000611c5d826020611c4b565b6000806000612bfc8585613387565b905060ff8116612c2e576000858581518110612c1a57612c1a6139a2565b016020015190935060f81c9150612d649050565b83612c3a8260016139b8565b60ff16612c4791906138df565b85511015612c5e5760001960009250925050612d64565b60008160ff1660021415612ca357612c98612c84612c7d8760016138df565b8890611c4b565b62ffff0060e882901c1660f89190911c1790565b61ffff169050612d5a565b8160ff1660041415612ccd57612cc0612241612c7d8760016138df565b63ffffffff169050612d5a565b8160ff1660081415612d5a57612d4d612cea612c7d8760016138df565b60c01c64ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b67ffffffffffffffff1690505b60ff909116925090505b9250929050565b600080612d7783613413565b60c01c905060006112658264ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b60008060008585604051602001612dfa929190613bfa565b60408051808303601f190181529181528151602092830120600081815260108b01909352912060010154909150600160801b900463ffffffff1615612fb7576000818152601088016020526040812060018101548154919291612e719167ffffffffffffffff90811691600160a01b9004166137b6565b600183015490915067ffffffffffffffff80881691612e9e916801000000000000000090910416836137b6565b67ffffffffffffffff1611158015612eca57508067ffffffffffffffff168667ffffffffffffffff1611155b612f625760405162461bcd60e51b815260206004820152604660248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652070656e64696e67207260648201527f6571756573740000000000000000000000000000000000000000000000000000608482015260a401610138565b600191820154600084815260108b016020526040902080546001600160e01b0319168155909201805473ffffffffffffffffffffffffffffffffffffffff19169055935067ffffffffffffffff169150613167565b600081815260118801602052604090206001810154600160801b900463ffffffff1661304a5760405162461bcd60e51b8152602060048201526024808201527f4f75747075742069732061206e6f6e2d72657175657374656420726564656d7060448201527f74696f6e000000000000000000000000000000000000000000000000000000006064820152608401610138565b600181015481546000916130739167ffffffffffffffff91821691600160a01b909104166137b6565b600183015490915067ffffffffffffffff808816916130a0916801000000000000000090910416836137b6565b67ffffffffffffffff16111580156130cc57508067ffffffffffffffff168667ffffffffffffffff1611155b6131645760405162461bcd60e51b815260206004820152604860248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652074696d6564206f757460648201527f2072657175657374000000000000000000000000000000000000000000000000608482015260a401610138565b50505b5094509492505050565b6001600160601b031981166000818152601b8401602052604080822060028101805463ffffffff4216600160801b027fffffffffffffff00ffffffff00000000ffffffffffffffffffffffffffffffff909116177803000000000000000000000000000000000000000000000000179055805491519093927f68cb496f5e64383745876664ef119840f154a729c03ba866b8aecb5c9f53d51691a3505050565b60008061321f8360256138df565b84511015613234575060001990506000612d64565b6000806132468661264b8760246138df565b9097909650945050505050565b6000611c5a838361341f565b6000611c5a8284613c51565b8151600061327982846138df565b9050828111801561328b575080855110155b6132d75760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b826020860101602085018382015b8083101561218b5782518252602092830192909101906132e5565b60008061330c8461344d565b905082811461331f576000915050611c5d565b5060019392505050565b600061333582846138df565b905082811015611c5d5760405162461bcd60e51b815260206004820152601960248201527f4f766572666c6f7720647572696e67206164646974696f6e2e000000000000006044820152606401610138565b600082828151811061339b5761339b6139a2565b60209101015160f81c60ff14156133b457506008611c5d565b8282815181106133c6576133c66139a2565b60209101015160f81c60fe14156133df57506004611c5d565b8282815181106133f1576133f16139a2565b60209101015160f81c60fd141561340a57506002611c5d565b50600092915050565b6000611c5d8282611c4b565b60008260005281602052602060006040600060025afa50602060006020600060025afa505060005192915050565b6024810151600090611c5d565b80356001600160601b03198116811461347257600080fd5b919050565b60006060828403121561348957600080fd5b50919050565b60008083601f8401126134a157600080fd5b50813567ffffffffffffffff8111156134b957600080fd5b602083019150836020828501011115612d6457600080fd5b803567ffffffffffffffff8116811461347257600080fd5b60008060008060008060e0878903121561350257600080fd5b863595506135126020880161345a565b94506135218860408901613477565b935060a087013567ffffffffffffffff81111561353d57600080fd5b61354989828a0161348f565b909450925061355c905060c088016134d1565b90509295509295509295565b600080600080600060e0868803121561358057600080fd5b85359450602086013567ffffffffffffffff8082111561359f57600080fd5b908701906080828a0312156135b357600080fd5b909450604087013590808211156135c957600080fd5b506135d688828901613477565b9350506135e68760608801613477565b91506135f460c0870161345a565b90509295509295909350565b6000806000806000806080878903121561361957600080fd5b863595506136296020880161345a565b9450604087013567ffffffffffffffff8082111561364657600080fd5b818901915089601f83011261365a57600080fd5b81358181111561366957600080fd5b8a60208260051b850101111561367e57600080fd5b60208301965080955050606089013591508082111561369c57600080fd5b506136a989828a0161348f565b979a9699509497509295939492505050565b634e487b7160e01b600052602160045260246000fd5b803563ffffffff8116811461347257600080fd5b6000602082840312156136f757600080fd5b611c5a826136d1565b60006020828403121561371257600080fd5b611c5a826134d1565b6001600160c01b031984168152818360088301376000910160080190815292915050565b6001600160601b031984168152818360148301376000910160140190815292915050565b634e487b7160e01b600052601260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b600067ffffffffffffffff808416806137aa576137aa613763565b92169190910492915050565b600067ffffffffffffffff838116908316818110156137d7576137d7613779565b039392505050565b600067ffffffffffffffff80831681851680830382111561380257613802613779565b01949350505050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b6bffffffffffffffffffffffff198816815260c06020820152600061385d60c08301888a61380b565b6001600160a01b039690961660408301525067ffffffffffffffff9384166060820152918316608083015290911660a0909101529392505050565b6000808335601e198436030181126138af57600080fd5b83018035915067ffffffffffffffff8211156138ca57600080fd5b602001915036819003821315612d6457600080fd5b600082198211156138f2576138f2613779565b500190565b600060a082016bffffffffffffffffffffffff89168352602088818501526001600160a01b038816604085015286606085015260a060808501528185835260c08501905086925060005b8681101561396a5763ffffffff613957856136d1565b1682529282019290820190600101613941565b509a9950505050505050505050565b6bffffffffffffffffffffffff1984168152604060208201526000611e1d60408301848661380b565b634e487b7160e01b600052603260045260246000fd5b600060ff821660ff84168060ff038211156139d5576139d5613779565b019392505050565b600060ff821660ff8416808210156139f7576139f7613779565b90039392505050565b600082821015613a1257613a12613779565b500390565b600060208284031215613a2957600080fd5b81356001600160e01b0319811681146116f457600080fd5b60006001600160e01b03198089168352868860048501378683016004810160008152868882375093169390920160048101939093525050600801949350505050565b6000600019821415613a9757613a97613779565b5060010190565b600060208284031215613ab057600080fd5b5051919050565b6000816000190483118215151615613ad157613ad1613779565b500290565b600063ffffffff821680613aec57613aec613779565b6000190192915050565b600082613b0557613b05613763565b500690565b600181815b80851115613b45578160001904821115613b2b57613b2b613779565b80851615613b3857918102915b93841c9390800290613b0f565b509250929050565b600082613b5c57506001611c5d565b81613b6957506000611c5d565b8160018114613b7f5760028114613b8957613ba5565b6001915050611c5d565b60ff841115613b9a57613b9a613779565b50506001821b611c5d565b5060208310610133831016604e8410600b8410161715613bc8575081810a611c5d565b613bd28383613b0a565b8060001904821115613be657613be6613779565b029392505050565b6000611c5a8383613b4d565b6bffffffffffffffffffffffff19831681526000825160005b81811015613c305760208186018101516014868401015201613c13565b81811115613c42576000601483860101525b50919091016014019392505050565b600082613c6057613c60613763565b50049056fea2646970667358221220187769f7811aba04a75701a2c9c172e77f296d55e76d44563426a58742db12a764736f6c63430008090033",
+  "deployedBytecode": "0x730000000000000000000000000000000000000000301460806040526004361061004b5760003560e01c80637333b36914610050578063a164de6e14610072578063a76558b314610092575b600080fd5b81801561005c57600080fd5b5061007061006b3660046134e9565b6100b2565b005b81801561007e57600080fd5b5061007061008d366004613568565b610853565b81801561009e57600080fd5b506100706100ad366004613600565b610bf2565b6001600160601b031985166000908152601b87016020526040902060016002820154600160c01b900460ff1660058111156100ef576100ef6136bb565b146101415760405162461bcd60e51b815260206004820152601c60248201527f57616c6c6574206d75737420626520696e204c6976652073746174650000000060448201526064015b60405180910390fd5b60018101548061019d5760405162461bcd60e51b815260206004820152602160248201527f4e6f206d61696e205554584f20666f722074686520676976656e2077616c6c656044820152601d60fa1b6064820152608401610138565b8086356101b06040890160208a016136e5565b6101c060608a0160408b01613700565b6040516020016101fd9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60405160208183030381529060405280519060200120146102605760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b6000610292600060c01b878760405160200161027e9392919061371b565b604051602081830303815290604052611165565b9050600081511161030b5760405162461bcd60e51b815260206004820152602e60248201527f52656465656d6572206f757470757420736372697074206d757374206265206160448201527f207374616e6461726420747970650000000000000000000000000000000000006064820152608401610138565b80805190602001208860405160200161033491906001600160601b031991909116815260140190565b6040516020818303038152906040528051906020012014156103be5760405162461bcd60e51b815260206004820152603760248201527f52656465656d6572206f757470757420736372697074206d757374206e6f742060448201527f706f696e7420746f207468652077616c6c657420504b480000000000000000006064820152608401610138565b600c89015467ffffffffffffffff90811690851610156104205760405162461bcd60e51b815260206004820152601b60248201527f526564656d7074696f6e20616d6f756e7420746f6f20736d616c6c00000000006044820152606401610138565b60008887876040516020016104379392919061373f565b60408051808303601f190181529181528151602092830120600081815260108e01909352912060010154909150600160801b900463ffffffff161561050a5760405162461bcd60e51b815260206004820152604a60248201527f546865726520697320612070656e64696e6720726564656d7074696f6e20726560448201527f71756573742066726f6d20746869732077616c6c657420746f2074686520736160648201527f6d65206164647265737300000000000000000000000000000000000000000000608482015260a401610138565b600c8a015460009068010000000000000000900467ffffffffffffffff16610533576000610558565b600c8b01546105589068010000000000000000900467ffffffffffffffff168761378f565b600c8c0154909150600160801b900467ffffffffffffffff1661057b82886137b6565b60028701805460009061059990849067ffffffffffffffff166137df565b82546101009290920a67ffffffffffffffff81810219909316918316021790915560028801541690506105d260608c0160408d01613700565b67ffffffffffffffff16101561062a5760405162461bcd60e51b815260206004820152601960248201527f496e73756666696369656e742077616c6c65742066756e6473000000000000006044820152606401610138565b6040518060a00160405280336001600160a01b031681526020018867ffffffffffffffff1681526020018367ffffffffffffffff1681526020018267ffffffffffffffff1681526020014263ffffffff168152508c601001600085815260200190815260200160002060008201518160000160006101000a8154816001600160a01b0302191690836001600160a01b0316021790555060208201518160000160146101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060408201518160010160006101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060608201518160010160086101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060808201518160010160106101000a81548163ffffffff021916908363ffffffff1602179055509050507f97a0199072f487232635d50ab75860891afe0b91c976ed2fc76502c4d82d0d958b8a8a338b87876040516107b29796959493929190613834565b60405180910390a18b546040517f7c6db49c00000000000000000000000000000000000000000000000000000000815233600482015230602482015267ffffffffffffffff891660448201526001600160a01b0390911690637c6db49c90606401600060405180830381600087803b15801561082d57600080fd5b505af1158015610841573d6000803e3d6000fd5b50505050505050505050505050505050565b600061086086868661140b565b90506108b1866108736020880188613898565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508892508791506116fb9050565b6001600160601b031982166000908152601b8701602052604090206002810154600160c01b900460ff1660018160058111156108ef576108ef6136bb565b148061090c5750600281600581111561090a5761090a6136bb565b145b61097e5760405162461bcd60e51b815260206004820152602b60248201527f57616c6c6574206d75737420626520696e204c697665206f72204d6f76696e6760448201527f46756e64732073746174650000000000000000000000000000000000000000006064820152608401610138565b60006109cd8961099160408b018b613898565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508a9250611955915050565b606081015190915067ffffffffffffffff1615610a4e578381604001518260600151604051602001610a2c9392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b60408051601f1981840301815291905280516020909101206001840155610a56565b600060018401555b8051600284018054600090610a7690849067ffffffffffffffff166137b6565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff1602179055507fa45596c10f758d32ec8cca64a0fbfe776052b08fdb3f026e0a87f52118bf8fbe8585604051610ae29291906001600160601b0319929092168252602082015260400190565b60405180910390a1885481516040517f392aee4300000000000000000000000000000000000000000000000000000000815267ffffffffffffffff90911660048201526001600160a01b039091169063392aee4390602401600060405180830381600087803b158015610b5457600080fd5b505af1158015610b68573d6000803e3d6000fd5b50508a546004808d015460208601516040516356a6d9ef60e01b81526001600160a01b039283169381019390935267ffffffffffffffff16602483015290911692506356a6d9ef91506044015b600060405180830381600087803b158015610bcf57600080fd5b505af1158015610be3573d6000803e3d6000fd5b50505050505050505050505050565b6000858383604051602001610c099392919061373f565b60408051808303601f190181528282528051602091820120600081815260108c01835283902060a08501845280546001600160a01b0381168652600160a01b900467ffffffffffffffff9081169386019390935260010154808316938501939093526801000000000000000083049091166060840152600160801b90910463ffffffff1660808301819052909250610ced5760405162461bcd60e51b815260206004820152602160248201527f526564656d7074696f6e207265717565737420646f6573206e6f7420657869736044820152601d60fa1b6064820152608401610138565b4288600d0154826080015163ffffffff16610d0891906138df565b10610d7a5760405162461bcd60e51b8152602060048201526024808201527f526564656d7074696f6e207265717565737420686173206e6f742074696d656460448201527f206f7574000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001600160601b031987166000908152601b890160209081526040918290209183015190830151610dab91906137b6565b600282018054600090610dc990849067ffffffffffffffff166137b6565b92506101000a81548167ffffffffffffffff021916908367ffffffffffffffff16021790555060016005811115610e0257610e026136bb565b6002820154600160c01b900460ff166005811115610e2257610e226136bb565b1480610e4c5750600280820154600160c01b900460ff166005811115610e4a57610e4a6136bb565b145b80610e76575060056002820154600160c01b900460ff166005811115610e7457610e746136bb565b145b610ee85760405162461bcd60e51b815260206004820152603b60248201527f5468652077616c6c6574206d75737420626520696e204c6976652c204d6f766960448201527f6e6746756e6473206f72205465726d696e6174656420737461746500000000006064820152608401610138565b600083815260118a016020908152604080832085518154878501516001600160a01b039092166001600160e01b031991821617600160a01b67ffffffffffffffff93841602178355878401516001938401805460608b015160808c01519386167fffffffffffffffffffffffffffffffff0000000000000000000000000000000090921691909117680100000000000000009190951602939093177fffffffffffffffffffffffff00000000ffffffffffffffffffffffffffffffff16600160801b63ffffffff909216919091021790915560108e019093529220805490911681558101805473ffffffffffffffffffffffffffffffffffffffff191690556002820154600160c01b900460ff166005811115611007576110076136bb565b14806110315750600280820154600160c01b900460ff16600581111561102f5761102f6136bb565b145b156110e2576110408989611a8c565b6002890154600e8a0154600f8b015483546040517fd8dc404d0000000000000000000000000000000000000000000000000000000081526001600160a01b039094169363d8dc404d936110af936bffffffffffffffffffffffff9091169290913391908e908e906004016138f7565b600060405180830381600087803b1580156110c957600080fd5b505af11580156110dd573d6000803e3d6000fd5b505050505b7f013dddc8debc4730cd01232fdcea9ae6013689837732356c187fe5edb9a8a8d588868660405161111593929190613979565b60405180910390a18854825160208401516040516356a6d9ef60e01b81526001600160a01b03928316600482015267ffffffffffffffff90911660248201529116906356a6d9ef90604401610bb5565b606060008260088151811061117c5761117c6139a2565b0160200151835160f89190911c91506111968260096139b8565b60ff16146111b4575050604080516020810190915260008152919050565b826009815181106111c7576111c76139a2565b016020015160f81c61126d5760028160ff1610156111f5575050604080516020810190915260008152919050565b600083600a8151811061120a5761120a6139a2565b016020015160f81c905061121f6002836139dd565b60ff168114158061123d57508060201415801561123d575080601414155b1561125957505060408051602081019091526000815292915050565b61126584600b83611b81565b949350505050565b600061127a846008611c4b565b90507f1976a900000000000000000000000000000000000000000000000000000000007fffffff0000000000000000000000000000000000000000000000000000000000821614156113575783600b815181106112d9576112d96139a2565b60209101015160f81c601414158061132e5750611304600285516112fd9190613a00565b8590611c4b565b7dffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191661222b60f21b14155b1561134a57505060408051602081019091526000815292915050565b61126584600c6014611b81565b7f17a91400000000000000000000000000000000000000000000000000000000007fffffff0000000000000000000000000000000000000000000000000000000000821614156113f45783600185516113b09190613a00565b815181106113c0576113c06139a2565b60209101015160f81c6087146113e757505060408051602081019091526000815292915050565b61126584600b6014611b81565b505050604080516020810190915260008152919050565b600061145761141d6020850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611c6392505050565b6114a35760405162461bcd60e51b815260206004820152601d60248201527f496e76616c696420696e70757420766563746f722070726f76696465640000006044820152606401610138565b6114ed6114b36040850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611d1392505050565b6115395760405162461bcd60e51b815260206004820152601e60248201527f496e76616c6964206f757470757420766563746f722070726f766964656400006044820152606401610138565b61159c6115496020850185613a17565b6115566020860186613898565b6115636040880188613898565b61157360808a0160608b01613a17565b60405160200161158896959493929190613a41565b604051602081830303815290604052611db6565b90506116376115eb6115b16040850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611ddd92505050565b6115f58480613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250869493925050506020860135611dea565b6116a95760405162461bcd60e51b815260206004820152603c60248201527f5478206d65726b6c652070726f6f66206973206e6f742076616c696420666f7260448201527f2070726f76696465642068656164657220616e642074782068617368000000006064820152608401610138565b6116f4846116ba6040850185613898565b8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250611e2692505050565b9392505050565b6001600160601b031981166000908152601b85016020526040902060010154806117675760405162461bcd60e51b815260206004820152601d60248201527f4e6f206d61696e205554584f20666f7220676976656e2077616c6c65740000006044820152606401610138565b80833561177a60408601602087016136e5565b61178a6060870160408801613700565b6040516020016117c79392919092835260e09190911b6001600160e01b031916602083015260c01b6001600160c01b0319166024820152602c0190565b604051602081830303815290604052805190602001201461182a5760405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d61696e205554584f2064617461000000000000000000006044820152606401610138565b60008061183686612195565b9092509050843582148015611865575063ffffffff811661185d60408701602088016136e5565b63ffffffff16145b6118d75760405162461bcd60e51b815260206004820152603f60248201527f4f7574626f756e64207472616e73616374696f6e20696e707574206d7573742060448201527f706f696e7420746f207468652077616c6c65742773206d61696e205554584f006064820152608401610138565b600160178801600087356118f160408a0160208b016136e5565b60405160200161191892919091825260e01b6001600160e01b031916602082015260240190565b60408051808303601f19018152918152815160209283012083529082019290925201600020805460ff191691151591909117905550505050505050565b6040805160808101825260008082526020820181905291810182905260608101829052908061198385612270565b909250905060006119958360016138df565b6040517f1976a9140000000000000000000000000000000000000000000000000000000060208201526001600160601b03198716602482015261222b60f21b6038820152909150600090603a0160408051601f198184030181529082905280516020918201207f1600140000000000000000000000000000000000000000000000000000000000918301919091526001600160601b0319881660238301529150600090603701604051602081830303815290604052805190602001209050611a7f898989604051806080016040528088815260200189815260200187815260200186815250612287565b9998505050505050505050565b6001600160601b031981166000908152601b83016020526040902060020154600160c01b900460ff166001816005811115611ac957611ac96136bb565b1480611ae657506002816005811115611ae457611ae46136bb565b145b611b585760405162461bcd60e51b815260206004820152603160248201527f45434453412077616c6c6574206d75737420626520696e204c697665206f722060448201527f4d6f76696e6746756e64732073746174650000000000000000000000000000006064820152608401610138565b6001816005811115611b6c57611b6c6136bb565b1415611b7c57611b7c8383612486565b505050565b606081611b9d57506040805160208101909152600081526116f4565b6000611ba983856138df565b90508381118015611bbb575080855110155b611c075760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b604051915082604083010160405282825283850182038460208701018481015b80821015611c4057815183830152602082019150611c27565b505050509392505050565b6000611c5a8383016020015190565b90505b92915050565b6000806000611c7184612270565b9092509050801580611c84575060001982145b15611c93575060009392505050565b6000611ca08360016138df565b905060005b82811015611d065785518210611cc15750600095945050505050565b6000611ccd87846125d0565b9050600019811415611ce6575060009695505050505050565b611cf081846138df565b9250508080611cfe90613a83565b915050611ca5565b5093519093149392505050565b6000806000611d2184612270565b9092509050801580611d34575060001982145b15611d43575060009392505050565b6000611d508360016138df565b905060005b82811015611d065785518210611d715750600095945050505050565b6000611d7d878461261b565b9050600019811415611d96575060009695505050505050565b611da081846138df565b9250508080611dae90613a83565b915050611d55565b60006020600083516020850160025afa50602060006020600060025afa5050600051919050565b6044810151600090611c5d565b60008385148015611df9575081155b8015611e0457508251155b15611e1157506001611265565b611e1d85848685612681565b95945050505050565b6001820154604080517f113764be00000000000000000000000000000000000000000000000000000000815290516001600160a01b0390921691600091839163113764be91600480820192602092909190829003018186803b158015611e8b57600080fd5b505afa158015611e9f573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611ec39190613a9e565b90506000826001600160a01b0316632b97be246040518163ffffffff1660e01b815260040160206040518083038186803b158015611f0057600080fd5b505afa158015611f14573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611f389190613a9e565b9050600080611f4e611f4987612729565b6127be565b905083811415611f6057839150611fde565b82811415611f7057829150611fde565b60405162461bcd60e51b815260206004820152602560248201527f4e6f742061742063757272656e74206f722070726576696f757320646966666960448201527f63756c74790000000000000000000000000000000000000000000000000000006064820152608401610138565b6000611fe9876127e6565b90506000198114156120635760405162461bcd60e51b815260206004820152602360248201527f496e76616c6964206c656e677468206f6620746865206865616465727320636860448201527f61696e00000000000000000000000000000000000000000000000000000000006064820152608401610138565b6001198114156120b55760405162461bcd60e51b815260206004820152601560248201527f496e76616c6964206865616465727320636861696e00000000000000000000006044820152606401610138565b6002198114156121075760405162461bcd60e51b815260206004820152601d60248201527f496e73756666696369656e7420776f726b20696e2061206865616465720000006044820152606401610138565b60038801546121169084613ab7565b81101561218b5760405162461bcd60e51b815260206004820152603360248201527f496e73756666696369656e7420616363756d756c61746564206469666669637560448201527f6c747920696e2068656164657220636861696e000000000000000000000000006064820152608401610138565b5050505050505050565b60008060006121a384612270565b9150508060011461221c5760405162461bcd60e51b815260206004820152602d60248201527f4f7574626f756e64207472616e73616374696f6e206d7573742068617665206160448201527f2073696e676c6520696e707574000000000000000000000000000000000000006064820152608401610138565b600061222885826129ed565b905061223381612bd3565b935061226761224182612be0565b60d881901c63ff00ff001662ff00ff60e89290921c9190911617601081811b91901c1790565b92505050915091565b60008061227e836000612bed565b91509150915091565b604080516080810182526000808252602082018190529181018290526060810182905290805b83602001518110156124095783516000906122c990889061261b565b85519091506000906122dd90899084611b81565b905060006122ea82612d6b565b9050600061230860088085516123009190613a00565b859190611b81565b9050866060015167ffffffffffffffff166000148015612344575060408801518151602083012014806123445750606088015181516020830120145b801561235a575060008267ffffffffffffffff16115b156123805763ffffffff8516604088015267ffffffffffffffff821660608801526123da565b60008061238f8d8c8587612de2565b9150915081896000018181516123a591906137df565b67ffffffffffffffff169052506020890180518291906123c69083906137df565b67ffffffffffffffff169052506001975050505b83886000018181516123ec91906138df565b9052508493506124019250839150613a839050565b9150506122ad565b508061247d5760405162461bcd60e51b815260206004820152603b60248201527f526564656d7074696f6e207472616e73616374696f6e206d7573742070726f6360448201527f657373206174206c65617374206f6e6520726564656d7074696f6e00000000006064820152608401610138565b50949350505050565b6001600160601b031981166000908152601b83016020526040902060018101546124b9576124b48383613171565b612550565b60028101805463ffffffff42166c01000000000000000000000000027fffffffffffffff00ffffffffffffffff00000000ffffffffffffffffffffffff90911617780200000000000000000000000000000000000000000000000017905580546040516001600160601b0319841691907fbdc9ce990a067e5fd3a5d8dfc68e27e9f221aaa3fe55265e0b7e93c460b3efe290600090a35b601983015460601b6001600160601b0319908116908316141561258d5760198301805473ffffffffffffffffffffffffffffffffffffffff191690555b601983018054600160a01b900463ffffffff169060146125ac83613ad6565b91906101000a81548163ffffffff021916908363ffffffff16021790555050505050565b60008060006125df8585613211565b90925090506000198214156125fa5760001992505050611c5d565b806126068360256138df565b61261091906138df565b611e1d9060046138df565b60006126288260096138df565b835110156126395750600019611c5d565b6000806126508561264b8660086138df565b612bed565b909250905060001982141561266b5760001992505050611c5d565b806126778360096138df565b611e1d91906138df565b6000602084516126919190613af6565b1561269e57506000611265565b83516126ac57506000611265565b818560005b865181101561271c576126c5600284613af6565b600114156126ea576126e36126dd8883016020015190565b83613253565b9150612703565b612700826126fb8984016020015190565b613253565b91505b60019290921c916127156020826138df565b90506126b1565b5090931495945050505050565b600080612737836048611c4b565b60e81c9050600083604b81518110612751576127516139a2565b016020015160f81c9050600061278583600060108262ffffff16901c8261ff001660108462ffffff16901b17179050919050565b62ffffff16905060006127996003846139dd565b60ff1690506127aa81610100613bee565b6127b49083613ab7565b9695505050505050565b6000611c5d7bffff00000000000000000000000000000000000000000000000000008361325f565b6000605082516127f69190613af6565b156128045750600019919050565b506040805160808101909152605081526000908190815b84518110156129e55761282f85838361326b565b801561284f5761283f8284613300565b61284f5750600119949350505050565b600061285a83612729565b905061286583611db6565b9350806129a98560008190506008817eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff16901b600882901c7eff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff00ff161790506010817dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff16901b601082901c7dffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff0000ffff161790506020817bffffffff00000000ffffffff00000000ffffffff00000000ffffffff16901b602082901c7bffffffff00000000ffffffff00000000ffffffff00000000ffffffff1617905060408177ffffffffffffffff0000000000000000ffffffffffffffff16901b604082901c77ffffffffffffffff0000000000000000ffffffffffffffff16179050608081901b608082901c179050919050565b11156129bc575060021995945050505050565b6129cf6129c8826127be565b8690613329565b94506129de90506050826138df565b905061281b565b505050919050565b60606000806129fb85612270565b9092509050600019821415612a785760405162461bcd60e51b815260206004820152602260248201527f52656164206f76657272756e20647572696e6720566172496e7420706172736960448201527f6e670000000000000000000000000000000000000000000000000000000000006064820152608401610138565b808410612ac75760405162461bcd60e51b815260206004820152601060248201527f56696e2072656164206f76657272756e000000000000000000000000000000006044820152606401610138565b600080612ad58460016138df565b905060005b86811015612b5e57612aec88836125d0565b9250600019831415612b405760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612b4a83836138df565b915080612b5681613a83565b915050612ada565b50612b6987826125d0565b9150600019821415612bbd5760405162461bcd60e51b815260206004820152601760248201527f42616420566172496e7420696e207363726970745369670000000000000000006044820152606401610138565b612bc8878284611b81565b979650505050505050565b6020810151600090611c5d565b6000611c5d826020611c4b565b6000806000612bfc8585613387565b905060ff8116612c2e576000858581518110612c1a57612c1a6139a2565b016020015190935060f81c9150612d649050565b83612c3a8260016139b8565b60ff16612c4791906138df565b85511015612c5e5760001960009250925050612d64565b60008160ff1660021415612ca357612c98612c84612c7d8760016138df565b8890611c4b565b62ffff0060e882901c1660f89190911c1790565b61ffff169050612d5a565b8160ff1660041415612ccd57612cc0612241612c7d8760016138df565b63ffffffff169050612d5a565b8160ff1660081415612d5a57612d4d612cea612c7d8760016138df565b60c01c64ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b67ffffffffffffffff1690505b60ff909116925090505b9250929050565b600080612d7783613413565b60c01c905060006112658264ff000000ff600882811c91821665ff000000ff009390911b92831617601090811b67ffffffffffffffff1666ff00ff00ff00ff9290921667ff00ff00ff00ff009093169290921790911c65ffff0000ffff1617602081811c91901b1790565b60008060008585604051602001612dfa929190613bfa565b60408051808303601f190181529181528151602092830120600081815260108b01909352912060010154909150600160801b900463ffffffff1615612fb7576000818152601088016020526040812060018101548154919291612e719167ffffffffffffffff90811691600160a01b9004166137b6565b600183015490915067ffffffffffffffff80881691612e9e916801000000000000000090910416836137b6565b67ffffffffffffffff1611158015612eca57508067ffffffffffffffff168667ffffffffffffffff1611155b612f625760405162461bcd60e51b815260206004820152604660248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652070656e64696e67207260648201527f6571756573740000000000000000000000000000000000000000000000000000608482015260a401610138565b600191820154600084815260108b016020526040902080546001600160e01b0319168155909201805473ffffffffffffffffffffffffffffffffffffffff19169055935067ffffffffffffffff169150613167565b600081815260118801602052604090206001810154600160801b900463ffffffff1661304a5760405162461bcd60e51b8152602060048201526024808201527f4f75747075742069732061206e6f6e2d72657175657374656420726564656d7060448201527f74696f6e000000000000000000000000000000000000000000000000000000006064820152608401610138565b600181015481546000916130739167ffffffffffffffff91821691600160a01b909104166137b6565b600183015490915067ffffffffffffffff808816916130a0916801000000000000000090910416836137b6565b67ffffffffffffffff16111580156130cc57508067ffffffffffffffff168667ffffffffffffffff1611155b6131645760405162461bcd60e51b815260206004820152604860248201527f4f75747075742076616c7565206973206e6f742077697468696e20746865206160448201527f636365707461626c652072616e6765206f66207468652074696d6564206f757460648201527f2072657175657374000000000000000000000000000000000000000000000000608482015260a401610138565b50505b5094509492505050565b6001600160601b031981166000818152601b8401602052604080822060028101805463ffffffff4216600160801b027fffffffffffffff00ffffffff00000000ffffffffffffffffffffffffffffffff909116177803000000000000000000000000000000000000000000000000179055805491519093927f68cb496f5e64383745876664ef119840f154a729c03ba866b8aecb5c9f53d51691a3505050565b60008061321f8360256138df565b84511015613234575060001990506000612d64565b6000806132468661264b8760246138df565b9097909650945050505050565b6000611c5a838361341f565b6000611c5a8284613c51565b8151600061327982846138df565b9050828111801561328b575080855110155b6132d75760405162461bcd60e51b815260206004820152601360248201527f536c696365206f7574206f6620626f756e6473000000000000000000000000006044820152606401610138565b826020860101602085018382015b8083101561218b5782518252602092830192909101906132e5565b60008061330c8461344d565b905082811461331f576000915050611c5d565b5060019392505050565b600061333582846138df565b905082811015611c5d5760405162461bcd60e51b815260206004820152601960248201527f4f766572666c6f7720647572696e67206164646974696f6e2e000000000000006044820152606401610138565b600082828151811061339b5761339b6139a2565b60209101015160f81c60ff14156133b457506008611c5d565b8282815181106133c6576133c66139a2565b60209101015160f81c60fe14156133df57506004611c5d565b8282815181106133f1576133f16139a2565b60209101015160f81c60fd141561340a57506002611c5d565b50600092915050565b6000611c5d8282611c4b565b60008260005281602052602060006040600060025afa50602060006020600060025afa505060005192915050565b6024810151600090611c5d565b80356001600160601b03198116811461347257600080fd5b919050565b60006060828403121561348957600080fd5b50919050565b60008083601f8401126134a157600080fd5b50813567ffffffffffffffff8111156134b957600080fd5b602083019150836020828501011115612d6457600080fd5b803567ffffffffffffffff8116811461347257600080fd5b60008060008060008060e0878903121561350257600080fd5b863595506135126020880161345a565b94506135218860408901613477565b935060a087013567ffffffffffffffff81111561353d57600080fd5b61354989828a0161348f565b909450925061355c905060c088016134d1565b90509295509295509295565b600080600080600060e0868803121561358057600080fd5b85359450602086013567ffffffffffffffff8082111561359f57600080fd5b908701906080828a0312156135b357600080fd5b909450604087013590808211156135c957600080fd5b506135d688828901613477565b9350506135e68760608801613477565b91506135f460c0870161345a565b90509295509295909350565b6000806000806000806080878903121561361957600080fd5b863595506136296020880161345a565b9450604087013567ffffffffffffffff8082111561364657600080fd5b818901915089601f83011261365a57600080fd5b81358181111561366957600080fd5b8a60208260051b850101111561367e57600080fd5b60208301965080955050606089013591508082111561369c57600080fd5b506136a989828a0161348f565b979a9699509497509295939492505050565b634e487b7160e01b600052602160045260246000fd5b803563ffffffff8116811461347257600080fd5b6000602082840312156136f757600080fd5b611c5a826136d1565b60006020828403121561371257600080fd5b611c5a826134d1565b6001600160c01b031984168152818360088301376000910160080190815292915050565b6001600160601b031984168152818360148301376000910160140190815292915050565b634e487b7160e01b600052601260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b600067ffffffffffffffff808416806137aa576137aa613763565b92169190910492915050565b600067ffffffffffffffff838116908316818110156137d7576137d7613779565b039392505050565b600067ffffffffffffffff80831681851680830382111561380257613802613779565b01949350505050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b6bffffffffffffffffffffffff198816815260c06020820152600061385d60c08301888a61380b565b6001600160a01b039690961660408301525067ffffffffffffffff9384166060820152918316608083015290911660a0909101529392505050565b6000808335601e198436030181126138af57600080fd5b83018035915067ffffffffffffffff8211156138ca57600080fd5b602001915036819003821315612d6457600080fd5b600082198211156138f2576138f2613779565b500190565b600060a082016bffffffffffffffffffffffff89168352602088818501526001600160a01b038816604085015286606085015260a060808501528185835260c08501905086925060005b8681101561396a5763ffffffff613957856136d1565b1682529282019290820190600101613941565b509a9950505050505050505050565b6bffffffffffffffffffffffff1984168152604060208201526000611e1d60408301848661380b565b634e487b7160e01b600052603260045260246000fd5b600060ff821660ff84168060ff038211156139d5576139d5613779565b019392505050565b600060ff821660ff8416808210156139f7576139f7613779565b90039392505050565b600082821015613a1257613a12613779565b500390565b600060208284031215613a2957600080fd5b81356001600160e01b0319811681146116f457600080fd5b60006001600160e01b03198089168352868860048501378683016004810160008152868882375093169390920160048101939093525050600801949350505050565b6000600019821415613a9757613a97613779565b5060010190565b600060208284031215613ab057600080fd5b5051919050565b6000816000190483118215151615613ad157613ad1613779565b500290565b600063ffffffff821680613aec57613aec613779565b6000190192915050565b600082613b0557613b05613763565b500690565b600181815b80851115613b45578160001904821115613b2b57613b2b613779565b80851615613b3857918102915b93841c9390800290613b0f565b509250929050565b600082613b5c57506001611c5d565b81613b6957506000611c5d565b8160018114613b7f5760028114613b8957613ba5565b6001915050611c5d565b60ff841115613b9a57613b9a613779565b50506001821b611c5d565b5060208310610133831016604e8410600b8410161715613bc8575081810a611c5d565b613bd28383613b0a565b8060001904821115613be657613be6613779565b029392505050565b6000611c5a8383613b4d565b6bffffffffffffffffffffffff19831681526000825160005b81811015613c305760208186018101516014868401015201613c13565b81811115613c42576000601483860101525b50919091016014019392505050565b600082613c6057613c60613763565b50049056fea2646970667358221220187769f7811aba04a75701a2c9c172e77f296d55e76d44563426a58742db12a764736f6c63430008090033",
   "devdoc": {
     "details": "To initiate a redemption, a user with a Bank balance supplies      a Bitcoin address. Then, the system calculates the redemption fee, and      releases balance to the provided Bitcoin address. Just like in case of      sweeps of revealed deposits, redemption requests are processed in      batches and require SPV proof to be submitted to the Bridge.",
     "kind": "dev",