creation_sourcecode: {{
    "language": "Solidity",
    "sources": {
      "contracts/verifiers/SgxVerifier.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"@openzeppelin/contracts/utils/cryptography/ECDSA.sol\";\nimport \"../L1/ITaikoL1.sol\";\nimport \"../common/EssentialContract.sol\";\nimport \"../common/LibStrings.sol\";\nimport \"../automata-attestation/interfaces/IAttestation.sol\";\nimport \"../automata-attestation/lib/QuoteV3Auth/V3Struct.sol\";\nimport \"./libs/LibPublicInput.sol\";\nimport \"./IVerifier.sol\";\n\n/// @title SgxVerifier\n/// @notice This contract is the implementation of verifying SGX signature proofs\n/// onchain.\n/// @dev Please see references below:\n/// - Reference #1: https://ethresear.ch/t/2fa-zk-rollups-using-sgx/14462\n/// - Reference #2: https://github.com/gramineproject/gramine/discussions/1579\n/// @custom:security-contact security@taiko.xyz\ncontract SgxVerifier is EssentialContract, IVerifier {\n    /// @dev Each public-private key pair (Ethereum address) is generated within\n    /// the SGX program when it boots up. The off-chain remote attestation\n    /// ensures the validity of the program hash and has the capability of\n    /// bootstrapping the network with trustworthy instances.\n    struct Instance {\n        address addr;\n        uint64 validSince;\n    }\n\n    /// @notice The expiry time for the SGX instance.\n    uint64 public constant INSTANCE_EXPIRY = 365 days;\n\n    /// @notice A security feature, a delay until an instance is enabled when using onchain RA\n    /// verification\n    uint64 public constant INSTANCE_VALIDITY_DELAY = 0;\n\n    /// @dev For gas savings, we shall assign each SGX instance with an id that when we need to\n    /// set a new pub key, just write storage once.\n    /// Slot 1.\n    uint256 public nextInstanceId;\n\n    /// @dev One SGX instance is uniquely identified (on-chain) by it's ECDSA public key\n    /// (or rather ethereum address). Once that address is used (by proof verification) it has to be\n    /// overwritten by a new one (representing the same instance). This is due to side-channel\n    /// protection. Also this public key shall expire after some time\n    /// (for now it is a long enough 6 months setting).\n    /// Slot 2.\n    mapping(uint256 instanceId => Instance instance) public instances;\n\n    /// @dev One address shall be registered (during attestation) only once, otherwise it could\n    /// bypass this contract's expiry check by always registering with the same attestation and\n    /// getting multiple valid instanceIds. While during proving, it is technically possible to\n    /// register the old addresses, it is less of a problem, because the instanceId would be the\n    /// same for those addresses and if deleted - the attestation cannot be reused anyways.\n    /// Slot 3.\n    mapping(address instanceAddress => bool alreadyAttested) public addressRegistered;\n\n    uint256[47] private __gap;\n\n    /// @notice Emitted when a new SGX instance is added to the registry, or replaced.\n    /// @param id The ID of the SGX instance.\n    /// @param instance The address of the SGX instance.\n    /// @param replaced The address of the SGX instance that was replaced. If it is the first\n    /// instance, this value is zero address.\n    /// @param validSince The time since the instance is valid.\n    event InstanceAdded(\n        uint256 indexed id, address indexed instance, address replaced, uint256 validSince\n    );\n\n    /// @notice Emitted when an SGX instance is deleted from the registry.\n    /// @param id The ID of the SGX instance.\n    /// @param instance The address of the SGX instance.\n    event InstanceDeleted(uint256 indexed id, address indexed instance);\n\n    error SGX_ALREADY_ATTESTED();\n    error SGX_INVALID_ATTESTATION();\n    error SGX_INVALID_INSTANCE();\n    error SGX_INVALID_PROOF();\n    error SGX_RA_NOT_SUPPORTED();\n\n    /// @notice Initializes the contract.\n    /// @param _owner The owner of this contract. msg.sender will be used if this value is zero.\n    /// @param _addressManager The address of the {AddressManager} contract.\n    function init(address _owner, address _addressManager) external initializer {\n        __Essential_init(_owner, _addressManager);\n    }\n\n    /// @notice Adds trusted SGX instances to the registry.\n    /// @param _instances The address array of trusted SGX instances.\n    /// @return The respective instanceId array per addresses.\n    function addInstances(address[] calldata _instances)\n        external\n        onlyOwner\n        returns (uint256[] memory)\n    {\n        return _addInstances(_instances, true);\n    }\n\n    /// @notice Deletes SGX instances from the registry.\n    /// @param _ids The ids array of SGX instances.\n    function deleteInstances(uint256[] calldata _ids)\n        external\n        onlyFromOwnerOrNamed(LibStrings.B_SGX_WATCHDOG)\n    {\n        for (uint256 i; i < _ids.length; ++i) {\n            uint256 idx = _ids[i];\n\n            if (instances[idx].addr == address(0)) revert SGX_INVALID_INSTANCE();\n\n            emit InstanceDeleted(idx, instances[idx].addr);\n\n            delete instances[idx];\n        }\n    }\n\n    /// @notice Adds an SGX instance after the attestation is verified\n    /// @param _attestation The parsed attestation quote.\n    /// @return The respective instanceId\n    function registerInstance(V3Struct.ParsedV3QuoteStruct calldata _attestation)\n        external\n        returns (uint256)\n    {\n        address automataDcapAttestation = (resolve(LibStrings.B_AUTOMATA_DCAP_ATTESTATION, true));\n\n        if (automataDcapAttestation == address(0)) {\n            revert SGX_RA_NOT_SUPPORTED();\n        }\n\n        (bool verified,) = IAttestation(automataDcapAttestation).verifyParsedQuote(_attestation);\n\n        if (!verified) revert SGX_INVALID_ATTESTATION();\n\n        address[] memory _address = new address[](1);\n        _address[0] = address(bytes20(_attestation.localEnclaveReport.reportData));\n\n        return _addInstances(_address, false)[0];\n    }\n\n    /// @inheritdoc IVerifier\n    function verifyProof(\n        Context calldata _ctx,\n        TaikoData.Transition calldata _tran,\n        TaikoData.TierProof calldata _proof\n    )\n        external\n        onlyFromNamed(LibStrings.B_TAIKO)\n    {\n        // Do not run proof verification to contest an existing proof\n        if (_ctx.isContesting) return;\n\n        // Size is: 89 bytes\n        // 4 bytes + 20 bytes + 65 bytes (signature) = 89\n        if (_proof.data.length != 89) revert SGX_INVALID_PROOF();\n\n        uint32 id = uint32(bytes4(_proof.data[:4]));\n        address newInstance = address(bytes20(_proof.data[4:24]));\n\n        uint64 chainId = ITaikoL1(resolve(LibStrings.B_TAIKO, false)).getConfig().chainId;\n\n        address oldInstance = ECDSA.recover(\n            LibPublicInput.hashPublicInputs(\n                _tran, address(this), newInstance, _ctx.prover, _ctx.metaHash, chainId\n            ),\n            _proof.data[24:]\n        );\n\n        if (!_isInstanceValid(id, oldInstance)) revert SGX_INVALID_INSTANCE();\n        _replaceInstance(id, oldInstance, newInstance);\n    }\n\n    function _addInstances(\n        address[] memory _instances,\n        bool instantValid\n    )\n        private\n        returns (uint256[] memory ids)\n    {\n        ids = new uint256[](_instances.length);\n\n        uint64 validSince = uint64(block.timestamp);\n\n        if (!instantValid) {\n            validSince += INSTANCE_VALIDITY_DELAY;\n        }\n\n        for (uint256 i; i < _instances.length; ++i) {\n            if (addressRegistered[_instances[i]]) revert SGX_ALREADY_ATTESTED();\n\n            addressRegistered[_instances[i]] = true;\n\n            if (_instances[i] == address(0)) revert SGX_INVALID_INSTANCE();\n\n            instances[nextInstanceId] = Instance(_instances[i], validSince);\n            ids[i] = nextInstanceId;\n\n            emit InstanceAdded(nextInstanceId, _instances[i], address(0), validSince);\n\n            ++nextInstanceId;\n        }\n    }\n\n    function _replaceInstance(uint256 id, address oldInstance, address newInstance) private {\n        // Replacing an instance means, it went through a cooldown (if added by on-chain RA) so no\n        // need to have a cooldown\n        instances[id] = Instance(newInstance, uint64(block.timestamp));\n        emit InstanceAdded(id, newInstance, oldInstance, block.timestamp);\n    }\n\n    function _isInstanceValid(uint256 id, address instance) private view returns (bool) {\n        if (instance == address(0)) return false;\n        if (instance != instances[id].addr) return false;\n        return instances[id].validSince <= block.timestamp\n            && block.timestamp <= instances[id].validSince + INSTANCE_EXPIRY;\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts/utils/cryptography/ECDSA.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/cryptography/ECDSA.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../Strings.sol\";\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    enum RecoverError {\n        NoError,\n        InvalidSignature,\n        InvalidSignatureLength,\n        InvalidSignatureS,\n        InvalidSignatureV // Deprecated in v4.8\n    }\n\n    function _throwError(RecoverError error) private pure {\n        if (error == RecoverError.NoError) {\n            return; // no error: do nothing\n        } else if (error == RecoverError.InvalidSignature) {\n            revert(\"ECDSA: invalid signature\");\n        } else if (error == RecoverError.InvalidSignatureLength) {\n            revert(\"ECDSA: invalid signature length\");\n        } else if (error == RecoverError.InvalidSignatureS) {\n            revert(\"ECDSA: invalid signature 's' value\");\n        }\n    }\n\n    /**\n     * @dev Returns the address that signed a hashed message (`hash`) with\n     * `signature` or error string. 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     * _Available since v4.3._\n     */\n    function tryRecover(bytes32 hash, bytes memory signature) internal pure returns (address, RecoverError) {\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            /// @solidity memory-safe-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 tryRecover(hash, v, r, s);\n        } else {\n            return (address(0), RecoverError.InvalidSignatureLength);\n        }\n    }\n\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    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {\n        (address recovered, RecoverError error) = tryRecover(hash, signature);\n        _throwError(error);\n        return recovered;\n    }\n\n    /**\n     * @dev Overload of {ECDSA-tryRecover} 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.3._\n     */\n    function tryRecover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address, RecoverError) {\n        bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);\n        uint8 v = uint8((uint256(vs) >> 255) + 27);\n        return tryRecover(hash, v, r, s);\n    }\n\n    /**\n     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.\n     *\n     * _Available since v4.2._\n     */\n    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {\n        (address recovered, RecoverError error) = tryRecover(hash, r, vs);\n        _throwError(error);\n        return recovered;\n    }\n\n    /**\n     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,\n     * `r` and `s` signature fields separately.\n     *\n     * _Available since v4.3._\n     */\n    function tryRecover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address, RecoverError) {\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 (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {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        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {\n            return (address(0), RecoverError.InvalidSignatureS);\n        }\n\n        // If the signature is valid (and not malleable), return the signer address\n        address signer = ecrecover(hash, v, r, s);\n        if (signer == address(0)) {\n            return (address(0), RecoverError.InvalidSignature);\n        }\n\n        return (signer, RecoverError.NoError);\n    }\n\n    /**\n     * @dev Overload of {ECDSA-recover} that receives the `v`,\n     * `r` and `s` signature fields separately.\n     */\n    function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {\n        (address recovered, RecoverError error) = tryRecover(hash, v, r, s);\n        _throwError(error);\n        return recovered;\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 message) {\n        // 32 is the length in bytes of hash,\n        // enforced by the type signature above\n        /// @solidity memory-safe-assembly\n        assembly {\n            mstore(0x00, \"\\x19Ethereum Signed Message:\\n32\")\n            mstore(0x1c, hash)\n            message := keccak256(0x00, 0x3c)\n        }\n    }\n\n    /**\n     * @dev Returns an Ethereum Signed Message, created from `s`. 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(bytes memory s) internal pure returns (bytes32) {\n        return keccak256(abi.encodePacked(\"\\x19Ethereum Signed Message:\\n\", Strings.toString(s.length), s));\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 data) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            let ptr := mload(0x40)\n            mstore(ptr, \"\\x19\\x01\")\n            mstore(add(ptr, 0x02), domainSeparator)\n            mstore(add(ptr, 0x22), structHash)\n            data := keccak256(ptr, 0x42)\n        }\n    }\n\n    /**\n     * @dev Returns an Ethereum Signed Data with intended validator, created from a\n     * `validator` and `data` according to the version 0 of EIP-191.\n     *\n     * See {recover}.\n     */\n    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {\n        return keccak256(abi.encodePacked(\"\\x19\\x00\", validator, data));\n    }\n}\n"
      },
      "contracts/L1/ITaikoL1.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"./TaikoData.sol\";\n\n/// @title ITaikoL1\n/// @custom:security-contact security@taiko.xyz\ninterface ITaikoL1 {\n    /// @notice Proposes a Taiko L2 block.\n    /// @param _params Block parameters, currently an encoded BlockParams object.\n    /// @param _txList txList data if calldata is used for DA.\n    /// @return meta_ The metadata of the proposed L2 block.\n    /// @return deposits_ The Ether deposits processed.\n    function proposeBlock(\n        bytes calldata _params,\n        bytes calldata _txList\n    )\n        external\n        payable\n        returns (TaikoData.BlockMetadata memory meta_, TaikoData.EthDeposit[] memory deposits_);\n\n    /// @notice Proves or contests a block transition.\n    /// @param _blockId The index of the block to prove. This is also used to\n    /// select the right implementation version.\n    /// @param _input An abi-encoded (TaikoData.BlockMetadata, TaikoData.Transition,\n    /// TaikoData.TierProof) tuple.\n    function proveBlock(uint64 _blockId, bytes calldata _input) external;\n\n    /// @notice Verifies up to a certain number of blocks.\n    /// @param _maxBlocksToVerify Max number of blocks to verify.\n    function verifyBlocks(uint64 _maxBlocksToVerify) external;\n\n    /// @notice Gets the configuration of the TaikoL1 contract.\n    /// @return Config struct containing configuration parameters.\n    function getConfig() external view returns (TaikoData.Config memory);\n}\n"
      },
      "contracts/common/EssentialContract.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"@openzeppelin/contracts/proxy/utils/UUPSUpgradeable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/access/Ownable2StepUpgradeable.sol\";\nimport \"./AddressResolver.sol\";\nimport \"../libs/LibNetwork.sol\";\n\n/// @title EssentialContract\n/// @custom:security-contact security@taiko.xyz\nabstract contract EssentialContract is UUPSUpgradeable, Ownable2StepUpgradeable, AddressResolver {\n    uint8 private constant _FALSE = 1;\n\n    uint8 private constant _TRUE = 2;\n\n    /// @dev The slot in transient storage of the reentry lock.\n    /// This is the result of keccak256(\"ownerUUPS.reentry_slot\") plus 1. The addition aims to\n    /// prevent hash collisions with slots defined in EIP-1967, where slots are derived by\n    /// keccak256(\"something\") - 1, and with slots in SignalService, calculated directly with\n    /// keccak256(\"something\").\n    bytes32 private constant _REENTRY_SLOT =\n        0xa5054f728453d3dbe953bdc43e4d0cb97e662ea32d7958190f3dc2da31d9721b;\n\n    /// @dev Slot 1.\n    uint8 private __reentry;\n    uint8 private __paused;\n    uint64 public lastUnpausedAt;\n\n    uint256[49] private __gap;\n\n    /// @notice Emitted when the contract is paused.\n    /// @param account The account that paused the contract.\n    event Paused(address account);\n\n    /// @notice Emitted when the contract is unpaused.\n    /// @param account The account that unpaused the contract.\n    event Unpaused(address account);\n\n    error REENTRANT_CALL();\n    error INVALID_PAUSE_STATUS();\n    error ZERO_ADDR_MANAGER();\n\n    /// @dev Modifier that ensures the caller is the owner or resolved address of a given name.\n    /// @param _name The name to check against.\n    modifier onlyFromOwnerOrNamed(bytes32 _name) {\n        if (msg.sender != owner() && msg.sender != resolve(_name, true)) revert RESOLVER_DENIED();\n        _;\n    }\n\n    modifier nonReentrant() {\n        if (_loadReentryLock() == _TRUE) revert REENTRANT_CALL();\n        _storeReentryLock(_TRUE);\n        _;\n        _storeReentryLock(_FALSE);\n    }\n\n    modifier whenPaused() {\n        if (!paused()) revert INVALID_PAUSE_STATUS();\n        _;\n    }\n\n    modifier whenNotPaused() {\n        if (paused()) revert INVALID_PAUSE_STATUS();\n        _;\n    }\n\n    /// @custom:oz-upgrades-unsafe-allow constructor\n    constructor() {\n        _disableInitializers();\n    }\n\n    /// @notice Pauses the contract.\n    function pause() public virtual {\n        _pause();\n        // We call the authorize function here to avoid:\n        // Warning (5740): Unreachable code.\n        _authorizePause(msg.sender, true);\n    }\n\n    /// @notice Unpauses the contract.\n    function unpause() public virtual {\n        _unpause();\n        // We call the authorize function here to avoid:\n        // Warning (5740): Unreachable code.\n        _authorizePause(msg.sender, false);\n    }\n\n    /// @notice Returns true if the contract is paused, and false otherwise.\n    /// @return true if paused, false otherwise.\n    function paused() public view returns (bool) {\n        return __paused == _TRUE;\n    }\n\n    /// @notice Initializes the contract.\n    /// @param _owner The owner of this contract. msg.sender will be used if this value is zero.\n    /// @param _addressManager The address of the {AddressManager} contract.\n    function __Essential_init(address _owner, address _addressManager) internal onlyInitializing {\n        if (_addressManager == address(0)) revert ZERO_ADDR_MANAGER();\n        __Essential_init(_owner);\n        __AddressResolver_init(_addressManager);\n    }\n\n    function __Essential_init(address _owner) internal virtual {\n        _transferOwnership(_owner == address(0) ? msg.sender : _owner);\n        __paused = _FALSE;\n    }\n\n    function _pause() internal whenNotPaused {\n        __paused = _TRUE;\n        emit Paused(msg.sender);\n    }\n\n    function _unpause() internal whenPaused {\n        __paused = _FALSE;\n        lastUnpausedAt = uint64(block.timestamp);\n        emit Unpaused(msg.sender);\n    }\n\n    function _authorizeUpgrade(address) internal virtual override onlyOwner { }\n\n    function _authorizePause(address, bool) internal virtual onlyOwner { }\n\n    // Stores the reentry lock\n    function _storeReentryLock(uint8 _reentry) internal virtual {\n        if (LibNetwork.isDencunSupported(block.chainid)) {\n            assembly {\n                tstore(_REENTRY_SLOT, _reentry)\n            }\n        } else {\n            __reentry = _reentry;\n        }\n    }\n\n    // Loads the reentry lock\n    function _loadReentryLock() internal view virtual returns (uint8 reentry_) {\n        if (LibNetwork.isDencunSupported(block.chainid)) {\n            assembly {\n                reentry_ := tload(_REENTRY_SLOT)\n            }\n        } else {\n            reentry_ = __reentry;\n        }\n    }\n\n    function _inNonReentrant() internal view returns (bool) {\n        return _loadReentryLock() == _TRUE;\n    }\n}\n"
      },
      "contracts/common/LibStrings.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\n/// @title LibStrings\n/// @custom:security-contact security@taiko.xyz\nlibrary LibStrings {\n    bytes32 internal constant B_CHAIN_WATCHDOG = bytes32(\"chain_watchdog\");\n    bytes32 internal constant B_WITHDRAWER = bytes32(\"withdrawer\");\n    bytes32 internal constant B_PROPOSER = bytes32(\"proposer\");\n    bytes32 internal constant B_PROPOSER_ONE = bytes32(\"proposer_one\");\n    bytes32 internal constant B_SIGNAL_SERVICE = bytes32(\"signal_service\");\n    bytes32 internal constant B_TAIKO_TOKEN = bytes32(\"taiko_token\");\n    bytes32 internal constant B_TAIKO = bytes32(\"taiko\");\n    bytes32 internal constant B_BRIDGE = bytes32(\"bridge\");\n    bytes32 internal constant B_ERC20_VAULT = bytes32(\"erc20_vault\");\n    bytes32 internal constant B_BRIDGED_ERC20 = bytes32(\"bridged_erc20\");\n    bytes32 internal constant B_ERC1155_VAULT = bytes32(\"erc1155_vault\");\n    bytes32 internal constant B_BRIDGED_ERC1155 = bytes32(\"bridged_erc1155\");\n    bytes32 internal constant B_ERC721_VAULT = bytes32(\"erc721_vault\");\n    bytes32 internal constant B_BRIDGED_ERC721 = bytes32(\"bridged_erc721\");\n    bytes32 internal constant B_BRIDGE_WATCHDOG = bytes32(\"bridge_watchdog\");\n    bytes32 internal constant B_SGX_WATCHDOG = bytes32(\"sgx_watchdog\");\n    bytes32 internal constant B_TIER_PROVIDER = bytes32(\"tier_provider\");\n    bytes32 internal constant B_TIER_SGX = bytes32(\"tier_sgx\");\n    bytes32 internal constant B_TIER_SGX_ZKVM = bytes32(\"tier_sgx_zkvm\");\n    bytes32 internal constant B_TIER_GUARDIAN_MINORITY = bytes32(\"tier_guardian_minority\");\n    bytes32 internal constant B_TIER_GUARDIAN = bytes32(\"tier_guardian\");\n    bytes32 internal constant B_AUTOMATA_DCAP_ATTESTATION = bytes32(\"automata_dcap_attestation\");\n    bytes32 internal constant B_PROVER_ASSIGNMENT = bytes32(\"PROVER_ASSIGNMENT\");\n    bytes32 internal constant H_RETURN_LIVENESS_BOND = keccak256(\"RETURN_LIVENESS_BOND\");\n    bytes32 internal constant H_STATE_ROOT = keccak256(\"STATE_ROOT\");\n    bytes32 internal constant H_SIGNAL_ROOT = keccak256(\"SIGNAL_ROOT\");\n    string internal constant S_SIGNAL = \"SIGNAL\";\n}\n"
      },
      "contracts/automata-attestation/interfaces/IAttestation.sol": {
        "content": "//SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport { V3Struct } from \"../lib/QuoteV3Auth/V3Struct.sol\";\n\n/// @title IAttestation\n/// @custom:security-contact security@taiko.xyz\ninterface IAttestation {\n    function verifyAttestation(bytes calldata data) external returns (bool);\n    function verifyParsedQuote(V3Struct.ParsedV3QuoteStruct calldata v3quote)\n        external\n        returns (bool success, bytes memory retData);\n}\n"
      },
      "contracts/automata-attestation/lib/QuoteV3Auth/V3Struct.sol": {
        "content": "//SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\n/// @title V3Struct\n/// @custom:security-contact security@taiko.xyz\nlibrary V3Struct {\n    struct Header {\n        bytes2 version;\n        bytes2 attestationKeyType;\n        bytes4 teeType;\n        bytes2 qeSvn;\n        bytes2 pceSvn;\n        bytes16 qeVendorId;\n        bytes20 userData;\n    }\n\n    struct EnclaveReport {\n        bytes16 cpuSvn;\n        bytes4 miscSelect;\n        bytes28 reserved1;\n        bytes16 attributes;\n        bytes32 mrEnclave;\n        bytes32 reserved2;\n        bytes32 mrSigner;\n        bytes reserved3; // 96 bytes\n        uint16 isvProdId;\n        uint16 isvSvn;\n        bytes reserved4; // 60 bytes\n        bytes reportData; // 64 bytes - For QEReports, this contains the hash of the concatenation\n            // of attestation key and QEAuthData\n    }\n\n    struct QEAuthData {\n        uint16 parsedDataSize;\n        bytes data;\n    }\n\n    struct CertificationData {\n        uint16 certType;\n        // todo! In encoded path, we need to calculate the size of certDataArray\n        // certDataSize = len(join((BEGIN_CERT, certArray[i], END_CERT) for i in 0..3))\n        // But for plain bytes path, we don't need that.\n        uint32 certDataSize;\n        bytes[3] decodedCertDataArray; // base64 decoded cert bytes array\n    }\n\n    struct ECDSAQuoteV3AuthData {\n        bytes ecdsa256BitSignature; // 64 bytes\n        bytes ecdsaAttestationKey; // 64 bytes\n        EnclaveReport pckSignedQeReport; // 384 bytes\n        bytes qeReportSignature; // 64 bytes\n        QEAuthData qeAuthData;\n        CertificationData certification;\n    }\n\n    struct ParsedV3QuoteStruct {\n        Header header;\n        EnclaveReport localEnclaveReport;\n        ECDSAQuoteV3AuthData v3AuthData;\n    }\n}\n"
      },
      "contracts/verifiers/libs/LibPublicInput.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"../../L1/TaikoData.sol\";\n\n/// @title LibPublicInput\n/// @notice A library for handling hashing the so-called public input hash, used by sgx and zk\n/// proofs.\n/// @custom:security-contact security@taiko.xyz\nlibrary LibPublicInput {\n    /// @notice Hashes the public input for the proof verification.\n    /// @param _tran The transition to verify.\n    /// @param _verifierContract The contract address which as current verifier.\n    /// @param _newInstance The new instance address. For SGX it is the new signer address, for ZK\n    /// this variable is not used and must have value address(0).\n    /// @param _prover The prover address.\n    /// @param _metaHash The meta hash.\n    /// @param _chainId The chain id.\n    /// @return The public input hash.\n    function hashPublicInputs(\n        TaikoData.Transition memory _tran,\n        address _verifierContract,\n        address _newInstance,\n        address _prover,\n        bytes32 _metaHash,\n        uint64 _chainId\n    )\n        internal\n        pure\n        returns (bytes32)\n    {\n        return keccak256(\n            abi.encode(\n                \"VERIFY_PROOF\", _chainId, _verifierContract, _tran, _newInstance, _prover, _metaHash\n            )\n        );\n    }\n}\n"
      },
      "contracts/verifiers/IVerifier.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"../L1/TaikoData.sol\";\n\n/// @title IVerifier\n/// @notice Defines the function that handles proof verification.\n/// @custom:security-contact security@taiko.xyz\ninterface IVerifier {\n    struct Context {\n        bytes32 metaHash;\n        bytes32 blobHash;\n        address prover;\n        uint64 blockId;\n        bool isContesting;\n        bool blobUsed;\n        address msgSender;\n    }\n\n    /// @notice Verifies a proof.\n    /// @param _ctx The context of the proof verification.\n    /// @param _tran The transition to verify.\n    /// @param _proof The proof to verify.\n    function verifyProof(\n        Context calldata _ctx,\n        TaikoData.Transition calldata _tran,\n        TaikoData.TierProof calldata _proof\n    )\n        external;\n}\n"
      },
      "node_modules/@openzeppelin/contracts/utils/Strings.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./math/Math.sol\";\nimport \"./math/SignedMath.sol\";\n\n/**\n * @dev String operations.\n */\nlibrary Strings {\n    bytes16 private constant _SYMBOLS = \"0123456789abcdef\";\n    uint8 private constant _ADDRESS_LENGTH = 20;\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` decimal representation.\n     */\n    function toString(uint256 value) internal pure returns (string memory) {\n        unchecked {\n            uint256 length = Math.log10(value) + 1;\n            string memory buffer = new string(length);\n            uint256 ptr;\n            /// @solidity memory-safe-assembly\n            assembly {\n                ptr := add(buffer, add(32, length))\n            }\n            while (true) {\n                ptr--;\n                /// @solidity memory-safe-assembly\n                assembly {\n                    mstore8(ptr, byte(mod(value, 10), _SYMBOLS))\n                }\n                value /= 10;\n                if (value == 0) break;\n            }\n            return buffer;\n        }\n    }\n\n    /**\n     * @dev Converts a `int256` to its ASCII `string` decimal representation.\n     */\n    function toString(int256 value) internal pure returns (string memory) {\n        return string(abi.encodePacked(value < 0 ? \"-\" : \"\", toString(SignedMath.abs(value))));\n    }\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.\n     */\n    function toHexString(uint256 value) internal pure returns (string memory) {\n        unchecked {\n            return toHexString(value, Math.log256(value) + 1);\n        }\n    }\n\n    /**\n     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.\n     */\n    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {\n        bytes memory buffer = new bytes(2 * length + 2);\n        buffer[0] = \"0\";\n        buffer[1] = \"x\";\n        for (uint256 i = 2 * length + 1; i > 1; --i) {\n            buffer[i] = _SYMBOLS[value & 0xf];\n            value >>= 4;\n        }\n        require(value == 0, \"Strings: hex length insufficient\");\n        return string(buffer);\n    }\n\n    /**\n     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.\n     */\n    function toHexString(address addr) internal pure returns (string memory) {\n        return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);\n    }\n\n    /**\n     * @dev Returns true if the two strings are equal.\n     */\n    function equal(string memory a, string memory b) internal pure returns (bool) {\n        return keccak256(bytes(a)) == keccak256(bytes(b));\n    }\n}\n"
      },
      "contracts/L1/TaikoData.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\n/// @title TaikoData\n/// @notice This library defines various data structures used in the Taiko\n/// protocol.\n/// @custom:security-contact security@taiko.xyz\nlibrary TaikoData {\n    /// @dev Struct holding Taiko configuration parameters. See {TaikoConfig}.\n    struct Config {\n        // ---------------------------------------------------------------------\n        // Group 1: General configs\n        // ---------------------------------------------------------------------\n        // The chain ID of the network where Taiko contracts are deployed.\n        uint64 chainId;\n        // ---------------------------------------------------------------------\n        // Group 2: Block level configs\n        // ---------------------------------------------------------------------\n        // The maximum number of proposals allowed in a single block.\n        uint64 blockMaxProposals;\n        // Size of the block ring buffer, allowing extra space for proposals.\n        uint64 blockRingBufferSize;\n        // The maximum number of verifications allowed when a block is proposed.\n        uint64 maxBlocksToVerifyPerProposal;\n        // The maximum gas limit allowed for a block.\n        uint32 blockMaxGasLimit;\n        // ---------------------------------------------------------------------\n        // Group 3: Proof related configs\n        // ---------------------------------------------------------------------\n        // The amount of Taiko token as a prover liveness bond\n        uint96 livenessBond;\n        // ---------------------------------------------------------------------\n        // Group 4: Cross-chain sync\n        // ---------------------------------------------------------------------\n        // The max number of L2 blocks that can stay unsynced on L1 (a value of zero disables\n        // syncing)\n        uint8 blockSyncThreshold;\n    }\n\n    /// @dev Struct representing prover fees per given tier\n    struct TierFee {\n        uint16 tier;\n        uint128 fee;\n    }\n\n    /// @dev A proof and the tier of proof it belongs to\n    struct TierProof {\n        uint16 tier;\n        bytes data;\n    }\n\n    /// @dev Hook and it's data (currently used only during proposeBlock)\n    struct HookCall {\n        address hook;\n        bytes data;\n    }\n\n    /// @dev Represents proposeBlock's _data input parameter\n    struct BlockParams {\n        address assignedProver;\n        address coinbase;\n        bytes32 extraData;\n        bytes32 parentMetaHash;\n        HookCall[] hookCalls;\n        bytes signature;\n    }\n\n    /// @dev Struct containing data only required for proving a block\n    /// Note: On L2, `block.difficulty` is the pseudo name of\n    /// `block.prevrandao`, which returns a random number provided by the layer\n    /// 1 chain.\n    struct BlockMetadata {\n        bytes32 l1Hash;\n        bytes32 difficulty;\n        bytes32 blobHash; //or txListHash (if Blob not yet supported)\n        bytes32 extraData;\n        bytes32 depositsHash;\n        address coinbase; // L2 coinbase,\n        uint64 id;\n        uint32 gasLimit;\n        uint64 timestamp;\n        uint64 l1Height;\n        uint16 minTier;\n        bool blobUsed;\n        bytes32 parentMetaHash;\n        address sender; // a.k.a proposer\n    }\n\n    /// @dev Struct representing transition to be proven.\n    struct Transition {\n        bytes32 parentHash;\n        bytes32 blockHash;\n        bytes32 stateRoot;\n        bytes32 graffiti; // Arbitrary data that the prover can use for various purposes.\n    }\n\n    /// @dev Struct representing state transition data.\n    /// 10 slots reserved for upgradability, 6 slots used.\n    struct TransitionState {\n        bytes32 key; // slot 1, only written/read for the 1st state transition.\n        bytes32 blockHash; // slot 2\n        bytes32 stateRoot; // slot 3\n        address prover; // slot 4\n        uint96 validityBond;\n        address contester; // slot 5\n        uint96 contestBond;\n        uint64 timestamp; // slot 6 (90 bits)\n        uint16 tier;\n        uint8 __reserved1;\n    }\n\n    /// @dev Struct containing data required for verifying a block.\n    /// 3 slots used.\n    struct Block {\n        bytes32 metaHash; // slot 1\n        address assignedProver; // slot 2\n        uint96 livenessBond;\n        uint64 blockId; // slot 3\n        uint64 proposedAt; // timestamp\n        uint64 proposedIn; // L1 block number, required/used by node/client.\n        uint32 nextTransitionId;\n        uint32 verifiedTransitionId;\n    }\n\n    /// @dev Struct representing an Ethereum deposit.\n    /// 2 slot used. Currently removed from protocol, but to be backwards compatible, the struct and\n    /// return values stayed for now.\n    struct EthDeposit {\n        address recipient;\n        uint96 amount;\n        uint64 id;\n    }\n\n    /// @dev Forge is only able to run coverage in case the contracts by default\n    /// capable of compiling without any optimization (neither optimizer runs,\n    /// no compiling --via-ir flag).\n    /// In order to resolve stack too deep without optimizations, we needed to\n    /// introduce outsourcing vars into structs below.\n    struct SlotA {\n        uint64 genesisHeight;\n        uint64 genesisTimestamp;\n        uint64 lastSyncedBlockId;\n        uint64 lastSynecdAt; // typo!\n    }\n\n    struct SlotB {\n        uint64 numBlocks;\n        uint64 lastVerifiedBlockId;\n        bool provingPaused;\n        uint8 __reservedB1;\n        uint16 __reservedB2;\n        uint32 __reservedB3;\n        uint64 lastUnpausedAt;\n    }\n\n    /// @dev Struct holding the state variables for the {TaikoL1} contract.\n    struct State {\n        // Ring buffer for proposed blocks and a some recent verified blocks.\n        mapping(uint64 blockId_mod_blockRingBufferSize => Block blk) blocks;\n        // Indexing to transition ids (ring buffer not possible)\n        mapping(uint64 blockId => mapping(bytes32 parentHash => uint32 transitionId)) transitionIds;\n        // Ring buffer for transitions\n        mapping(\n            uint64 blockId_mod_blockRingBufferSize\n                => mapping(uint32 transitionId => TransitionState ts)\n            ) transitions;\n        // Ring buffer for Ether deposits\n        bytes32 __reserve1;\n        SlotA slotA; // slot 5\n        SlotB slotB; // slot 6\n        uint256[44] __gap;\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts/proxy/utils/UUPSUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/UUPSUpgradeable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../../interfaces/draft-IERC1822.sol\";\nimport \"../ERC1967/ERC1967Upgrade.sol\";\n\n/**\n * @dev An upgradeability mechanism designed for UUPS proxies. The functions included here can perform an upgrade of an\n * {ERC1967Proxy}, when this contract is set as the implementation behind such a proxy.\n *\n * A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\n * reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\n * `UUPSUpgradeable` with a custom implementation of upgrades.\n *\n * The {_authorizeUpgrade} function must be overridden to include access restriction to the upgrade mechanism.\n *\n * _Available since v4.1._\n */\nabstract contract UUPSUpgradeable is IERC1822Proxiable, ERC1967Upgrade {\n    /// @custom:oz-upgrades-unsafe-allow state-variable-immutable state-variable-assignment\n    address private immutable __self = address(this);\n\n    /**\n     * @dev Check that the execution is being performed through a delegatecall call and that the execution context is\n     * a proxy contract with an implementation (as defined in ERC1967) pointing to self. This should only be the case\n     * for UUPS and transparent proxies that are using the current contract as their implementation. Execution of a\n     * function through ERC1167 minimal proxies (clones) would not normally pass this test, but is not guaranteed to\n     * fail.\n     */\n    modifier onlyProxy() {\n        require(address(this) != __self, \"Function must be called through delegatecall\");\n        require(_getImplementation() == __self, \"Function must be called through active proxy\");\n        _;\n    }\n\n    /**\n     * @dev Check that the execution is not being performed through a delegate call. This allows a function to be\n     * callable on the implementing contract but not through proxies.\n     */\n    modifier notDelegated() {\n        require(address(this) == __self, \"UUPSUpgradeable: must not be called through delegatecall\");\n        _;\n    }\n\n    /**\n     * @dev Implementation of the ERC1822 {proxiableUUID} function. This returns the storage slot used by the\n     * implementation. It is used to validate the implementation's compatibility when performing an upgrade.\n     *\n     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\n     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\n     * function revert if invoked through a proxy. This is guaranteed by the `notDelegated` modifier.\n     */\n    function proxiableUUID() external view virtual override notDelegated returns (bytes32) {\n        return _IMPLEMENTATION_SLOT;\n    }\n\n    /**\n     * @dev Upgrade the implementation of the proxy to `newImplementation`.\n     *\n     * Calls {_authorizeUpgrade}.\n     *\n     * Emits an {Upgraded} event.\n     *\n     * @custom:oz-upgrades-unsafe-allow-reachable delegatecall\n     */\n    function upgradeTo(address newImplementation) public virtual onlyProxy {\n        _authorizeUpgrade(newImplementation);\n        _upgradeToAndCallUUPS(newImplementation, new bytes(0), false);\n    }\n\n    /**\n     * @dev Upgrade the implementation of the proxy to `newImplementation`, and subsequently execute the function call\n     * encoded in `data`.\n     *\n     * Calls {_authorizeUpgrade}.\n     *\n     * Emits an {Upgraded} event.\n     *\n     * @custom:oz-upgrades-unsafe-allow-reachable delegatecall\n     */\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual onlyProxy {\n        _authorizeUpgrade(newImplementation);\n        _upgradeToAndCallUUPS(newImplementation, data, true);\n    }\n\n    /**\n     * @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract. Called by\n     * {upgradeTo} and {upgradeToAndCall}.\n     *\n     * Normally, this function will use an xref:access.adoc[access control] modifier such as {Ownable-onlyOwner}.\n     *\n     * ```solidity\n     * function _authorizeUpgrade(address) internal override onlyOwner {}\n     * ```\n     */\n    function _authorizeUpgrade(address newImplementation) internal virtual;\n}\n"
      },
      "node_modules/@openzeppelin/contracts-upgradeable/access/Ownable2StepUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (access/Ownable2Step.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./OwnableUpgradeable.sol\";\nimport {Initializable} from \"../proxy/utils/Initializable.sol\";\n\n/**\n * @dev Contract module which provides 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} and {acceptOwnership}.\n *\n * This module is used through inheritance. It will make available all functions\n * from parent (Ownable).\n */\nabstract contract Ownable2StepUpgradeable is Initializable, OwnableUpgradeable {\n    address private _pendingOwner;\n\n    event OwnershipTransferStarted(address indexed previousOwner, address indexed newOwner);\n\n    function __Ownable2Step_init() internal onlyInitializing {\n        __Ownable_init_unchained();\n    }\n\n    function __Ownable2Step_init_unchained() internal onlyInitializing {\n    }\n    /**\n     * @dev Returns the address of the pending owner.\n     */\n    function pendingOwner() public view virtual returns (address) {\n        return _pendingOwner;\n    }\n\n    /**\n     * @dev Starts the ownership transfer of the contract to a new account. Replaces the pending transfer if there is one.\n     * Can only be called by the current owner.\n     */\n    function transferOwnership(address newOwner) public virtual override onlyOwner {\n        _pendingOwner = newOwner;\n        emit OwnershipTransferStarted(owner(), newOwner);\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`) and deletes any pending owner.\n     * Internal function without access restriction.\n     */\n    function _transferOwnership(address newOwner) internal virtual override {\n        delete _pendingOwner;\n        super._transferOwnership(newOwner);\n    }\n\n    /**\n     * @dev The new owner accepts the ownership transfer.\n     */\n    function acceptOwnership() public virtual {\n        address sender = _msgSender();\n        require(pendingOwner() == sender, \"Ownable2Step: caller is not the new owner\");\n        _transferOwnership(sender);\n    }\n\n    /**\n     * @dev This empty reserved space is put in place to allow future versions to add new\n     * variables without shifting down storage in the inheritance chain.\n     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n     */\n    uint256[49] private __gap;\n}\n"
      },
      "contracts/common/AddressResolver.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\";\nimport \"./IAddressManager.sol\";\nimport \"./IAddressResolver.sol\";\n\n/// @title AddressResolver\n/// @notice See the documentation in {IAddressResolver}.\n/// @custom:security-contact security@taiko.xyz\nabstract contract AddressResolver is IAddressResolver, Initializable {\n    /// @notice Address of the AddressManager.\n    address public addressManager;\n    uint256[49] private __gap;\n\n    error RESOLVER_DENIED();\n    error RESOLVER_INVALID_MANAGER();\n    error RESOLVER_UNEXPECTED_CHAINID();\n    error RESOLVER_ZERO_ADDR(uint64 chainId, bytes32 name);\n\n    /// @dev Modifier that ensures the caller is the resolved address of a given\n    /// name.\n    /// @param _name The name to check against.\n    modifier onlyFromNamed(bytes32 _name) {\n        if (msg.sender != resolve(_name, true)) revert RESOLVER_DENIED();\n        _;\n    }\n\n    /// @custom:oz-upgrades-unsafe-allow constructor\n    constructor() {\n        _disableInitializers();\n    }\n\n    /// @inheritdoc IAddressResolver\n    function resolve(\n        bytes32 _name,\n        bool _allowZeroAddress\n    )\n        public\n        view\n        virtual\n        returns (address payable)\n    {\n        return _resolve(uint64(block.chainid), _name, _allowZeroAddress);\n    }\n\n    /// @inheritdoc IAddressResolver\n    function resolve(\n        uint64 _chainId,\n        bytes32 _name,\n        bool _allowZeroAddress\n    )\n        public\n        view\n        virtual\n        returns (address payable)\n    {\n        return _resolve(_chainId, _name, _allowZeroAddress);\n    }\n\n    /// @dev Initialization method for setting up AddressManager reference.\n    /// @param _addressManager Address of the AddressManager.\n    function __AddressResolver_init(address _addressManager) internal virtual onlyInitializing {\n        if (block.chainid > type(uint64).max) {\n            revert RESOLVER_UNEXPECTED_CHAINID();\n        }\n        addressManager = _addressManager;\n    }\n\n    /// @dev Helper method to resolve name-to-address.\n    /// @param _chainId The chainId of interest.\n    /// @param _name Name whose address is to be resolved.\n    /// @param _allowZeroAddress If set to true, does not throw if the resolved\n    /// address is `address(0)`.\n    /// @return addr_ Address associated with the given name on the specified\n    /// chain.\n    function _resolve(\n        uint64 _chainId,\n        bytes32 _name,\n        bool _allowZeroAddress\n    )\n        private\n        view\n        returns (address payable addr_)\n    {\n        address _addressManager = addressManager;\n        if (_addressManager == address(0)) revert RESOLVER_INVALID_MANAGER();\n\n        addr_ = payable(IAddressManager(_addressManager).getAddress(_chainId, _name));\n\n        if (!_allowZeroAddress && addr_ == address(0)) {\n            revert RESOLVER_ZERO_ADDR(_chainId, _name);\n        }\n    }\n}\n"
      },
      "contracts/libs/LibNetwork.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\n/// @title LibNetwork\nlibrary LibNetwork {\n    uint256 internal constant MAINNET = 1;\n    uint256 internal constant ROPSTEN = 2;\n    uint256 internal constant RINKEBY = 4;\n    uint256 internal constant GOERLI = 5;\n    uint256 internal constant KOVAN = 42;\n    uint256 internal constant HOLESKY = 17_000;\n    uint256 internal constant SEPOLIA = 11_155_111;\n\n    uint64 internal constant TAIKO = 167_000;\n\n    /// @dev Checks if the chain ID represents an Ethereum testnet.\n    /// @param _chainId The chain ID.\n    /// @return true if the chain ID represents an Ethereum testnet, false otherwise.\n    function isEthereumTestnet(uint256 _chainId) internal pure returns (bool) {\n        return _chainId == LibNetwork.ROPSTEN || _chainId == LibNetwork.RINKEBY\n            || _chainId == LibNetwork.GOERLI || _chainId == LibNetwork.KOVAN\n            || _chainId == LibNetwork.HOLESKY || _chainId == LibNetwork.SEPOLIA;\n    }\n\n    /// @dev Checks if the chain ID represents an Ethereum testnet or the Etheruem mainnet.\n    /// @param _chainId The chain ID.\n    /// @return true if the chain ID represents an Ethereum testnet or the Etheruem mainnet, false\n    /// otherwise.\n    function isEthereumMainnetOrTestnet(uint256 _chainId) internal pure returns (bool) {\n        return _chainId == LibNetwork.MAINNET || isEthereumTestnet(_chainId);\n    }\n\n    /// @dev Checks if the chain ID represents the Taiko L2 mainnet.\n    /// @param _chainId The chain ID.\n    /// @return true if the chain ID represents the Taiko L2 mainnet.\n    function isTaikoMainnet(uint256 _chainId) internal pure returns (bool) {\n        return _chainId == TAIKO;\n    }\n\n    /// @dev Checks if the chain ID represents an internal Taiko devnet's base layer.\n    /// @param _chainId The chain ID.\n    /// @return true if the chain ID represents an internal Taiko devnet's base layer, false\n    /// otherwise.\n    function isTaikoDevnetL1(uint256 _chainId) internal pure returns (bool) {\n        return _chainId >= 32_300 && _chainId <= 32_400;\n    }\n\n    /// @dev Checks if the chain supports Dencun hardfork. Note that this check doesn't need to be\n    /// exhaustive.\n    /// @param _chainId The chain ID.\n    /// @return true if the chain supports Dencun hardfork, false otherwise.\n    function isDencunSupported(uint256 _chainId) internal pure returns (bool) {\n        return _chainId == LibNetwork.MAINNET || _chainId == LibNetwork.HOLESKY\n            || _chainId == LibNetwork.SEPOLIA || isTaikoDevnetL1(_chainId);\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts/utils/math/Math.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Standard math utilities missing in the Solidity language.\n */\nlibrary Math {\n    enum Rounding {\n        Down, // Toward negative infinity\n        Up, // Toward infinity\n        Zero // Toward zero\n    }\n\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.\n        return (a & b) + (a ^ b) / 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 == 0 ? 0 : (a - 1) / b + 1;\n    }\n\n    /**\n     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0\n     * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv)\n     * with further edits by Uniswap Labs also under MIT license.\n     */\n    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {\n        unchecked {\n            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use\n            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256\n            // variables such that product = prod1 * 2^256 + prod0.\n            uint256 prod0; // Least significant 256 bits of the product\n            uint256 prod1; // Most significant 256 bits of the product\n            assembly {\n                let mm := mulmod(x, y, not(0))\n                prod0 := mul(x, y)\n                prod1 := sub(sub(mm, prod0), lt(mm, prod0))\n            }\n\n            // Handle non-overflow cases, 256 by 256 division.\n            if (prod1 == 0) {\n                // Solidity will revert if denominator == 0, unlike the div opcode on its own.\n                // The surrounding unchecked block does not change this fact.\n                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.\n                return prod0 / denominator;\n            }\n\n            // Make sure the result is less than 2^256. Also prevents denominator == 0.\n            require(denominator > prod1, \"Math: mulDiv overflow\");\n\n            ///////////////////////////////////////////////\n            // 512 by 256 division.\n            ///////////////////////////////////////////////\n\n            // Make division exact by subtracting the remainder from [prod1 prod0].\n            uint256 remainder;\n            assembly {\n                // Compute remainder using mulmod.\n                remainder := mulmod(x, y, denominator)\n\n                // Subtract 256 bit number from 512 bit number.\n                prod1 := sub(prod1, gt(remainder, prod0))\n                prod0 := sub(prod0, remainder)\n            }\n\n            // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.\n            // See https://cs.stackexchange.com/q/138556/92363.\n\n            // Does not overflow because the denominator cannot be zero at this stage in the function.\n            uint256 twos = denominator & (~denominator + 1);\n            assembly {\n                // Divide denominator by twos.\n                denominator := div(denominator, twos)\n\n                // Divide [prod1 prod0] by twos.\n                prod0 := div(prod0, twos)\n\n                // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.\n                twos := add(div(sub(0, twos), twos), 1)\n            }\n\n            // Shift in bits from prod1 into prod0.\n            prod0 |= prod1 * twos;\n\n            // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such\n            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for\n            // four bits. That is, denominator * inv = 1 mod 2^4.\n            uint256 inverse = (3 * denominator) ^ 2;\n\n            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works\n            // in modular arithmetic, doubling the correct bits in each step.\n            inverse *= 2 - denominator * inverse; // inverse mod 2^8\n            inverse *= 2 - denominator * inverse; // inverse mod 2^16\n            inverse *= 2 - denominator * inverse; // inverse mod 2^32\n            inverse *= 2 - denominator * inverse; // inverse mod 2^64\n            inverse *= 2 - denominator * inverse; // inverse mod 2^128\n            inverse *= 2 - denominator * inverse; // inverse mod 2^256\n\n            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.\n            // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is\n            // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1\n            // is no longer required.\n            result = prod0 * inverse;\n            return result;\n        }\n    }\n\n    /**\n     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.\n     */\n    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {\n        uint256 result = mulDiv(x, y, denominator);\n        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {\n            result += 1;\n        }\n        return result;\n    }\n\n    /**\n     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.\n     *\n     * Inspired by Henry S. Warren, Jr.'s \"Hacker's Delight\" (Chapter 11).\n     */\n    function sqrt(uint256 a) internal pure returns (uint256) {\n        if (a == 0) {\n            return 0;\n        }\n\n        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.\n        //\n        // We know that the \"msb\" (most significant bit) of our target number `a` is a power of 2 such that we have\n        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.\n        //\n        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`\n        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`\n        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`\n        //\n        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.\n        uint256 result = 1 << (log2(a) >> 1);\n\n        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,\n        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at\n        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision\n        // into the expected uint128 result.\n        unchecked {\n            result = (result + a / result) >> 1;\n            result = (result + a / result) >> 1;\n            result = (result + a / result) >> 1;\n            result = (result + a / result) >> 1;\n            result = (result + a / result) >> 1;\n            result = (result + a / result) >> 1;\n            result = (result + a / result) >> 1;\n            return min(result, a / result);\n        }\n    }\n\n    /**\n     * @notice Calculates sqrt(a), following the selected rounding direction.\n     */\n    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = sqrt(a);\n            return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 2, rounded down, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log2(uint256 value) internal pure returns (uint256) {\n        uint256 result = 0;\n        unchecked {\n            if (value >> 128 > 0) {\n                value >>= 128;\n                result += 128;\n            }\n            if (value >> 64 > 0) {\n                value >>= 64;\n                result += 64;\n            }\n            if (value >> 32 > 0) {\n                value >>= 32;\n                result += 32;\n            }\n            if (value >> 16 > 0) {\n                value >>= 16;\n                result += 16;\n            }\n            if (value >> 8 > 0) {\n                value >>= 8;\n                result += 8;\n            }\n            if (value >> 4 > 0) {\n                value >>= 4;\n                result += 4;\n            }\n            if (value >> 2 > 0) {\n                value >>= 2;\n                result += 2;\n            }\n            if (value >> 1 > 0) {\n                result += 1;\n            }\n        }\n        return result;\n    }\n\n    /**\n     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log2(value);\n            return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 10, rounded down, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log10(uint256 value) internal pure returns (uint256) {\n        uint256 result = 0;\n        unchecked {\n            if (value >= 10 ** 64) {\n                value /= 10 ** 64;\n                result += 64;\n            }\n            if (value >= 10 ** 32) {\n                value /= 10 ** 32;\n                result += 32;\n            }\n            if (value >= 10 ** 16) {\n                value /= 10 ** 16;\n                result += 16;\n            }\n            if (value >= 10 ** 8) {\n                value /= 10 ** 8;\n                result += 8;\n            }\n            if (value >= 10 ** 4) {\n                value /= 10 ** 4;\n                result += 4;\n            }\n            if (value >= 10 ** 2) {\n                value /= 10 ** 2;\n                result += 2;\n            }\n            if (value >= 10 ** 1) {\n                result += 1;\n            }\n        }\n        return result;\n    }\n\n    /**\n     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log10(value);\n            return result + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0);\n        }\n    }\n\n    /**\n     * @dev Return the log in base 256, rounded down, of a positive value.\n     * Returns 0 if given 0.\n     *\n     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.\n     */\n    function log256(uint256 value) internal pure returns (uint256) {\n        uint256 result = 0;\n        unchecked {\n            if (value >> 128 > 0) {\n                value >>= 128;\n                result += 16;\n            }\n            if (value >> 64 > 0) {\n                value >>= 64;\n                result += 8;\n            }\n            if (value >> 32 > 0) {\n                value >>= 32;\n                result += 4;\n            }\n            if (value >> 16 > 0) {\n                value >>= 16;\n                result += 2;\n            }\n            if (value >> 8 > 0) {\n                result += 1;\n            }\n        }\n        return result;\n    }\n\n    /**\n     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.\n     * Returns 0 if given 0.\n     */\n    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {\n        unchecked {\n            uint256 result = log256(value);\n            return result + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0);\n        }\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts/utils/math/SignedMath.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Standard signed math utilities missing in the Solidity language.\n */\nlibrary SignedMath {\n    /**\n     * @dev Returns the largest of two signed numbers.\n     */\n    function max(int256 a, int256 b) internal pure returns (int256) {\n        return a > b ? a : b;\n    }\n\n    /**\n     * @dev Returns the smallest of two signed numbers.\n     */\n    function min(int256 a, int256 b) internal pure returns (int256) {\n        return a < b ? a : b;\n    }\n\n    /**\n     * @dev Returns the average of two signed numbers without overflow.\n     * The result is rounded towards zero.\n     */\n    function average(int256 a, int256 b) internal pure returns (int256) {\n        // Formula from the book \"Hacker's Delight\"\n        int256 x = (a & b) + ((a ^ b) >> 1);\n        return x + (int256(uint256(x) >> 255) & (a ^ b));\n    }\n\n    /**\n     * @dev Returns the absolute unsigned value of a signed value.\n     */\n    function abs(int256 n) internal pure returns (uint256) {\n        unchecked {\n            // must be unchecked in order to support `n = type(int256).min`\n            return uint256(n >= 0 ? n : -n);\n        }\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts/interfaces/draft-IERC1822.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.5.0) (interfaces/draft-IERC1822.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev ERC1822: Universal Upgradeable Proxy Standard (UUPS) documents a method for upgradeability through a simplified\n * proxy whose upgrades are fully controlled by the current implementation.\n */\ninterface IERC1822Proxiable {\n    /**\n     * @dev Returns the storage slot that the proxiable contract assumes is being used to store the implementation\n     * address.\n     *\n     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\n     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\n     * function revert if invoked through a proxy.\n     */\n    function proxiableUUID() external view returns (bytes32);\n}\n"
      },
      "node_modules/@openzeppelin/contracts/proxy/ERC1967/ERC1967Upgrade.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/ERC1967/ERC1967Upgrade.sol)\n\npragma solidity ^0.8.2;\n\nimport \"../beacon/IBeacon.sol\";\nimport \"../../interfaces/IERC1967.sol\";\nimport \"../../interfaces/draft-IERC1822.sol\";\nimport \"../../utils/Address.sol\";\nimport \"../../utils/StorageSlot.sol\";\n\n/**\n * @dev This abstract contract provides getters and event emitting update functions for\n * https://eips.ethereum.org/EIPS/eip-1967[EIP1967] slots.\n *\n * _Available since v4.1._\n */\nabstract contract ERC1967Upgrade is IERC1967 {\n    // This is the keccak-256 hash of \"eip1967.proxy.rollback\" subtracted by 1\n    bytes32 private constant _ROLLBACK_SLOT = 0x4910fdfa16fed3260ed0e7147f7cc6da11a60208b5b9406d12a635614ffd9143;\n\n    /**\n     * @dev Storage slot with the address of the current implementation.\n     * This is the keccak-256 hash of \"eip1967.proxy.implementation\" subtracted by 1, and is\n     * validated in the constructor.\n     */\n    bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\n\n    /**\n     * @dev Returns the current implementation address.\n     */\n    function _getImplementation() internal view returns (address) {\n        return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;\n    }\n\n    /**\n     * @dev Stores a new address in the EIP1967 implementation slot.\n     */\n    function _setImplementation(address newImplementation) private {\n        require(Address.isContract(newImplementation), \"ERC1967: new implementation is not a contract\");\n        StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;\n    }\n\n    /**\n     * @dev Perform implementation upgrade\n     *\n     * Emits an {Upgraded} event.\n     */\n    function _upgradeTo(address newImplementation) internal {\n        _setImplementation(newImplementation);\n        emit Upgraded(newImplementation);\n    }\n\n    /**\n     * @dev Perform implementation upgrade with additional setup call.\n     *\n     * Emits an {Upgraded} event.\n     */\n    function _upgradeToAndCall(address newImplementation, bytes memory data, bool forceCall) internal {\n        _upgradeTo(newImplementation);\n        if (data.length > 0 || forceCall) {\n            Address.functionDelegateCall(newImplementation, data);\n        }\n    }\n\n    /**\n     * @dev Perform implementation upgrade with security checks for UUPS proxies, and additional setup call.\n     *\n     * Emits an {Upgraded} event.\n     */\n    function _upgradeToAndCallUUPS(address newImplementation, bytes memory data, bool forceCall) internal {\n        // Upgrades from old implementations will perform a rollback test. This test requires the new\n        // implementation to upgrade back to the old, non-ERC1822 compliant, implementation. Removing\n        // this special case will break upgrade paths from old UUPS implementation to new ones.\n        if (StorageSlot.getBooleanSlot(_ROLLBACK_SLOT).value) {\n            _setImplementation(newImplementation);\n        } else {\n            try IERC1822Proxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\n                require(slot == _IMPLEMENTATION_SLOT, \"ERC1967Upgrade: unsupported proxiableUUID\");\n            } catch {\n                revert(\"ERC1967Upgrade: new implementation is not UUPS\");\n            }\n            _upgradeToAndCall(newImplementation, data, forceCall);\n        }\n    }\n\n    /**\n     * @dev Storage slot with the admin of the contract.\n     * This is the keccak-256 hash of \"eip1967.proxy.admin\" subtracted by 1, and is\n     * validated in the constructor.\n     */\n    bytes32 internal constant _ADMIN_SLOT = 0xb53127684a568b3173ae13b9f8a6016e243e63b6e8ee1178d6a717850b5d6103;\n\n    /**\n     * @dev Returns the current admin.\n     */\n    function _getAdmin() internal view returns (address) {\n        return StorageSlot.getAddressSlot(_ADMIN_SLOT).value;\n    }\n\n    /**\n     * @dev Stores a new address in the EIP1967 admin slot.\n     */\n    function _setAdmin(address newAdmin) private {\n        require(newAdmin != address(0), \"ERC1967: new admin is the zero address\");\n        StorageSlot.getAddressSlot(_ADMIN_SLOT).value = newAdmin;\n    }\n\n    /**\n     * @dev Changes the admin of the proxy.\n     *\n     * Emits an {AdminChanged} event.\n     */\n    function _changeAdmin(address newAdmin) internal {\n        emit AdminChanged(_getAdmin(), newAdmin);\n        _setAdmin(newAdmin);\n    }\n\n    /**\n     * @dev The storage slot of the UpgradeableBeacon contract which defines the implementation for this proxy.\n     * This is bytes32(uint256(keccak256('eip1967.proxy.beacon')) - 1)) and is validated in the constructor.\n     */\n    bytes32 internal constant _BEACON_SLOT = 0xa3f0ad74e5423aebfd80d3ef4346578335a9a72aeaee59ff6cb3582b35133d50;\n\n    /**\n     * @dev Returns the current beacon.\n     */\n    function _getBeacon() internal view returns (address) {\n        return StorageSlot.getAddressSlot(_BEACON_SLOT).value;\n    }\n\n    /**\n     * @dev Stores a new beacon in the EIP1967 beacon slot.\n     */\n    function _setBeacon(address newBeacon) private {\n        require(Address.isContract(newBeacon), \"ERC1967: new beacon is not a contract\");\n        require(\n            Address.isContract(IBeacon(newBeacon).implementation()),\n            \"ERC1967: beacon implementation is not a contract\"\n        );\n        StorageSlot.getAddressSlot(_BEACON_SLOT).value = newBeacon;\n    }\n\n    /**\n     * @dev Perform beacon upgrade with additional setup call. Note: This upgrades the address of the beacon, it does\n     * not upgrade the implementation contained in the beacon (see {UpgradeableBeacon-_setImplementation} for that).\n     *\n     * Emits a {BeaconUpgraded} event.\n     */\n    function _upgradeBeaconToAndCall(address newBeacon, bytes memory data, bool forceCall) internal {\n        _setBeacon(newBeacon);\n        emit BeaconUpgraded(newBeacon);\n        if (data.length > 0 || forceCall) {\n            Address.functionDelegateCall(IBeacon(newBeacon).implementation(), data);\n        }\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (access/Ownable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../utils/ContextUpgradeable.sol\";\nimport {Initializable} from \"../proxy/utils/Initializable.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 OwnableUpgradeable is Initializable, ContextUpgradeable {\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    function __Ownable_init() internal onlyInitializing {\n        __Ownable_init_unchained();\n    }\n\n    function __Ownable_init_unchained() internal onlyInitializing {\n        _transferOwnership(_msgSender());\n    }\n\n    /**\n     * @dev Throws if called by any account other than the owner.\n     */\n    modifier onlyOwner() {\n        _checkOwner();\n        _;\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 the sender is not the owner.\n     */\n    function _checkOwner() internal view virtual {\n        require(owner() == _msgSender(), \"Ownable: caller is not the owner\");\n    }\n\n    /**\n     * @dev Leaves the contract without owner. It will not be possible to call\n     * `onlyOwner` functions. Can only be called by the current owner.\n     *\n     * NOTE: Renouncing ownership will leave the contract without an owner,\n     * thereby disabling any functionality that is only available to the owner.\n     */\n    function renounceOwnership() public virtual onlyOwner {\n        _transferOwnership(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        _transferOwnership(newOwner);\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\n     * Internal function without access restriction.\n     */\n    function _transferOwnership(address newOwner) internal virtual {\n        address oldOwner = _owner;\n        _owner = newOwner;\n        emit OwnershipTransferred(oldOwner, newOwner);\n    }\n\n    /**\n     * @dev This empty reserved space is put in place to allow future versions to add new\n     * variables without shifting down storage in the inheritance chain.\n     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n     */\n    uint256[49] private __gap;\n}\n"
      },
      "node_modules/@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol)\n\npragma solidity ^0.8.2;\n\nimport \"../../utils/AddressUpgradeable.sol\";\n\n/**\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\n *\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\n * reused. This mechanism prevents re-execution of each \"step\" but allows the creation of new initialization steps in\n * case an upgrade adds a module that needs to be initialized.\n *\n * For example:\n *\n * [.hljs-theme-light.nopadding]\n * ```solidity\n * contract MyToken is ERC20Upgradeable {\n *     function initialize() initializer public {\n *         __ERC20_init(\"MyToken\", \"MTK\");\n *     }\n * }\n *\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\n *     function initializeV2() reinitializer(2) public {\n *         __ERC20Permit_init(\"MyToken\");\n *     }\n * }\n * ```\n *\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\n * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.\n *\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\n *\n * [CAUTION]\n * ====\n * Avoid leaving a contract uninitialized.\n *\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\n *\n * [.hljs-theme-light.nopadding]\n * ```\n * /// @custom:oz-upgrades-unsafe-allow constructor\n * constructor() {\n *     _disableInitializers();\n * }\n * ```\n * ====\n */\nabstract contract Initializable {\n    /**\n     * @dev Indicates that the contract has been initialized.\n     * @custom:oz-retyped-from bool\n     */\n    uint8 private _initialized;\n\n    /**\n     * @dev Indicates that the contract is in the process of being initialized.\n     */\n    bool private _initializing;\n\n    /**\n     * @dev Triggered when the contract has been initialized or reinitialized.\n     */\n    event Initialized(uint8 version);\n\n    /**\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\n     * `onlyInitializing` functions can be used to initialize parent contracts.\n     *\n     * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\n     * constructor.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier initializer() {\n        bool isTopLevelCall = !_initializing;\n        require(\n            (isTopLevelCall && _initialized < 1) || (!AddressUpgradeable.isContract(address(this)) && _initialized == 1),\n            \"Initializable: contract is already initialized\"\n        );\n        _initialized = 1;\n        if (isTopLevelCall) {\n            _initializing = true;\n        }\n        _;\n        if (isTopLevelCall) {\n            _initializing = false;\n            emit Initialized(1);\n        }\n    }\n\n    /**\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\n     * used to initialize parent contracts.\n     *\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\n     * are added through upgrades and that require initialization.\n     *\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\n     *\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\n     * a contract, executing them in the right order is up to the developer or operator.\n     *\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier reinitializer(uint8 version) {\n        require(!_initializing && _initialized < version, \"Initializable: contract is already initialized\");\n        _initialized = version;\n        _initializing = true;\n        _;\n        _initializing = false;\n        emit Initialized(version);\n    }\n\n    /**\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\n     */\n    modifier onlyInitializing() {\n        require(_initializing, \"Initializable: contract is not initializing\");\n        _;\n    }\n\n    /**\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\n     * through proxies.\n     *\n     * Emits an {Initialized} event the first time it is successfully executed.\n     */\n    function _disableInitializers() internal virtual {\n        require(!_initializing, \"Initializable: contract is initializing\");\n        if (_initialized != type(uint8).max) {\n            _initialized = type(uint8).max;\n            emit Initialized(type(uint8).max);\n        }\n    }\n\n    /**\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\n     */\n    function _getInitializedVersion() internal view returns (uint8) {\n        return _initialized;\n    }\n\n    /**\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\n     */\n    function _isInitializing() internal view returns (bool) {\n        return _initializing;\n    }\n}\n"
      },
      "contracts/common/IAddressManager.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\n/// @title IAddressManager\n/// @notice Manages a mapping of (chainId, name) pairs to Ethereum addresses.\n/// @custom:security-contact security@taiko.xyz\ninterface IAddressManager {\n    /// @notice Gets the address mapped to a specific chainId-name pair.\n    /// @dev Note that in production, this method shall be a pure function\n    /// without any storage access.\n    /// @param _chainId The chainId for which the address needs to be fetched.\n    /// @param _name The name for which the address needs to be fetched.\n    /// @return Address associated with the chainId-name pair.\n    function getAddress(uint64 _chainId, bytes32 _name) external view returns (address);\n}\n"
      },
      "contracts/common/IAddressResolver.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\n/// @title IAddressResolver\n/// @notice This contract acts as a bridge for name-to-address resolution.\n/// It delegates the resolution to the AddressManager. By separating the logic,\n/// we can maintain flexibility in address management without affecting the\n/// resolving process.\n/// @dev Note that the address manager should be changed using upgradability, there\n/// is no setAddressManager() function to guarantee atomicity across all\n/// contracts that are resolvers.\n/// @custom:security-contact security@taiko.xyz\ninterface IAddressResolver {\n    /// @notice Resolves a name to its address deployed on this chain.\n    /// @param _name Name whose address is to be resolved.\n    /// @param _allowZeroAddress If set to true, does not throw if the resolved\n    /// address is `address(0)`.\n    /// @return Address associated with the given name.\n    function resolve(\n        bytes32 _name,\n        bool _allowZeroAddress\n    )\n        external\n        view\n        returns (address payable);\n\n    /// @notice Resolves a name to its address deployed on a specified chain.\n    /// @param _chainId The chainId of interest.\n    /// @param _name Name whose address is to be resolved.\n    /// @param _allowZeroAddress If set to true, does not throw if the resolved\n    /// address is `address(0)`.\n    /// @return Address associated with the given name on the specified\n    /// chain.\n    function resolve(\n        uint64 _chainId,\n        bytes32 _name,\n        bool _allowZeroAddress\n    )\n        external\n        view\n        returns (address payable);\n}\n"
      },
      "node_modules/@openzeppelin/contracts/proxy/beacon/IBeacon.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (proxy/beacon/IBeacon.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev This is the interface that {BeaconProxy} expects of its beacon.\n */\ninterface IBeacon {\n    /**\n     * @dev Must return an address that can be used as a delegate call target.\n     *\n     * {BeaconProxy} will check that this address is a contract.\n     */\n    function implementation() external view returns (address);\n}\n"
      },
      "node_modules/@openzeppelin/contracts/interfaces/IERC1967.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (interfaces/IERC1967.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev ERC-1967: Proxy Storage Slots. This interface contains the events defined in the ERC.\n *\n * _Available since v4.8.3._\n */\ninterface IERC1967 {\n    /**\n     * @dev Emitted when the implementation is upgraded.\n     */\n    event Upgraded(address indexed implementation);\n\n    /**\n     * @dev Emitted when the admin account has changed.\n     */\n    event AdminChanged(address previousAdmin, address newAdmin);\n\n    /**\n     * @dev Emitted when the beacon is changed.\n     */\n    event BeaconUpgraded(address indexed beacon);\n}\n"
      },
      "node_modules/@openzeppelin/contracts/utils/Address.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)\n\npragma solidity ^0.8.1;\n\n/**\n * @dev Collection of functions related to the address type\n */\nlibrary Address {\n    /**\n     * @dev Returns true if `account` is a contract.\n     *\n     * [IMPORTANT]\n     * ====\n     * It is unsafe to assume that an address for which this function returns\n     * false is an externally-owned account (EOA) and not a contract.\n     *\n     * Among others, `isContract` will return false for the following\n     * types of addresses:\n     *\n     *  - an externally-owned account\n     *  - a contract in construction\n     *  - an address where a contract will be created\n     *  - an address where a contract lived, but was destroyed\n     *\n     * Furthermore, `isContract` will also return true if the target contract within\n     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,\n     * which only has an effect at the end of a transaction.\n     * ====\n     *\n     * [IMPORTANT]\n     * ====\n     * You shouldn't rely on `isContract` to protect against flash loan attacks!\n     *\n     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets\n     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract\n     * constructor.\n     * ====\n     */\n    function isContract(address account) internal view returns (bool) {\n        // This method relies on extcodesize/address.code.length, which returns 0\n        // for contracts in construction, since the code is only stored at the end\n        // of the constructor execution.\n\n        return account.code.length > 0;\n    }\n\n    /**\n     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to\n     * `recipient`, forwarding all available gas and reverting on errors.\n     *\n     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost\n     * of certain opcodes, possibly making contracts go over the 2300 gas limit\n     * imposed by `transfer`, making them unable to receive funds via\n     * `transfer`. {sendValue} removes this limitation.\n     *\n     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].\n     *\n     * IMPORTANT: because control is transferred to `recipient`, care must be\n     * taken to not create reentrancy vulnerabilities. Consider using\n     * {ReentrancyGuard} or the\n     * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].\n     */\n    function sendValue(address payable recipient, uint256 amount) internal {\n        require(address(this).balance >= amount, \"Address: insufficient balance\");\n\n        (bool success, ) = recipient.call{value: amount}(\"\");\n        require(success, \"Address: unable to send value, recipient may have reverted\");\n    }\n\n    /**\n     * @dev Performs a Solidity function call using a low level `call`. A\n     * plain `call` is an unsafe replacement for a function call: use this\n     * function instead.\n     *\n     * If `target` reverts with a revert reason, it is bubbled up by this\n     * function (like regular Solidity function calls).\n     *\n     * Returns the raw returned data. To convert to the expected return value,\n     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].\n     *\n     * Requirements:\n     *\n     * - `target` must be a contract.\n     * - calling `target` with `data` must not revert.\n     *\n     * _Available since v3.1._\n     */\n    function functionCall(address target, bytes memory data) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, 0, \"Address: low-level call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with\n     * `errorMessage` as a fallback revert reason when `target` reverts.\n     *\n     * _Available since v3.1._\n     */\n    function functionCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, 0, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but also transferring `value` wei to `target`.\n     *\n     * Requirements:\n     *\n     * - the calling contract must have an ETH balance of at least `value`.\n     * - the called Solidity function must be `payable`.\n     *\n     * _Available since v3.1._\n     */\n    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, value, \"Address: low-level call with value failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but\n     * with `errorMessage` as a fallback revert reason when `target` reverts.\n     *\n     * _Available since v3.1._\n     */\n    function functionCallWithValue(\n        address target,\n        bytes memory data,\n        uint256 value,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        require(address(this).balance >= value, \"Address: insufficient balance for call\");\n        (bool success, bytes memory returndata) = target.call{value: value}(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but performing a static call.\n     *\n     * _Available since v3.3._\n     */\n    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {\n        return functionStaticCall(target, data, \"Address: low-level static call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n     * but performing a static call.\n     *\n     * _Available since v3.3._\n     */\n    function functionStaticCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal view returns (bytes memory) {\n        (bool success, bytes memory returndata) = target.staticcall(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but performing a delegate call.\n     *\n     * _Available since v3.4._\n     */\n    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {\n        return functionDelegateCall(target, data, \"Address: low-level delegate call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n     * but performing a delegate call.\n     *\n     * _Available since v3.4._\n     */\n    function functionDelegateCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        (bool success, bytes memory returndata) = target.delegatecall(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling\n     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.\n     *\n     * _Available since v4.8._\n     */\n    function verifyCallResultFromTarget(\n        address target,\n        bool success,\n        bytes memory returndata,\n        string memory errorMessage\n    ) internal view returns (bytes memory) {\n        if (success) {\n            if (returndata.length == 0) {\n                // only check isContract if the call was successful and the return data is empty\n                // otherwise we already know that it was a contract\n                require(isContract(target), \"Address: call to non-contract\");\n            }\n            return returndata;\n        } else {\n            _revert(returndata, errorMessage);\n        }\n    }\n\n    /**\n     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the\n     * revert reason or using the provided one.\n     *\n     * _Available since v4.3._\n     */\n    function verifyCallResult(\n        bool success,\n        bytes memory returndata,\n        string memory errorMessage\n    ) internal pure returns (bytes memory) {\n        if (success) {\n            return returndata;\n        } else {\n            _revert(returndata, errorMessage);\n        }\n    }\n\n    function _revert(bytes memory returndata, string memory errorMessage) private pure {\n        // Look for revert reason and bubble it up if present\n        if (returndata.length > 0) {\n            // The easiest way to bubble the revert reason is using memory via assembly\n            /// @solidity memory-safe-assembly\n            assembly {\n                let returndata_size := mload(returndata)\n                revert(add(32, returndata), returndata_size)\n            }\n        } else {\n            revert(errorMessage);\n        }\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts/utils/StorageSlot.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/StorageSlot.sol)\n// This file was procedurally generated from scripts/generate/templates/StorageSlot.js.\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Library for reading and writing primitive types to specific storage slots.\n *\n * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.\n * This library helps with reading and writing to such slots without the need for inline assembly.\n *\n * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.\n *\n * Example usage to set ERC1967 implementation slot:\n * ```solidity\n * contract ERC1967 {\n *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\n *\n *     function _getImplementation() internal view returns (address) {\n *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;\n *     }\n *\n *     function _setImplementation(address newImplementation) internal {\n *         require(Address.isContract(newImplementation), \"ERC1967: new implementation is not a contract\");\n *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;\n *     }\n * }\n * ```\n *\n * _Available since v4.1 for `address`, `bool`, `bytes32`, `uint256`._\n * _Available since v4.9 for `string`, `bytes`._\n */\nlibrary StorageSlot {\n    struct AddressSlot {\n        address value;\n    }\n\n    struct BooleanSlot {\n        bool value;\n    }\n\n    struct Bytes32Slot {\n        bytes32 value;\n    }\n\n    struct Uint256Slot {\n        uint256 value;\n    }\n\n    struct StringSlot {\n        string value;\n    }\n\n    struct BytesSlot {\n        bytes value;\n    }\n\n    /**\n     * @dev Returns an `AddressSlot` with member `value` located at `slot`.\n     */\n    function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `BooleanSlot` with member `value` located at `slot`.\n     */\n    function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `Bytes32Slot` with member `value` located at `slot`.\n     */\n    function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `Uint256Slot` with member `value` located at `slot`.\n     */\n    function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `StringSlot` with member `value` located at `slot`.\n     */\n    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `StringSlot` representation of the string storage pointer `store`.\n     */\n    function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := store.slot\n        }\n    }\n\n    /**\n     * @dev Returns an `BytesSlot` with member `value` located at `slot`.\n     */\n    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := slot\n        }\n    }\n\n    /**\n     * @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.\n     */\n    function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            r.slot := store.slot\n        }\n    }\n}\n"
      },
      "node_modules/@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.4) (utils/Context.sol)\n\npragma solidity ^0.8.0;\nimport {Initializable} from \"../proxy/utils/Initializable.sol\";\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 ContextUpgradeable is Initializable {\n    function __Context_init() internal onlyInitializing {\n    }\n\n    function __Context_init_unchained() internal onlyInitializing {\n    }\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    function _contextSuffixLength() internal view virtual returns (uint256) {\n        return 0;\n    }\n\n    /**\n     * @dev This empty reserved space is put in place to allow future versions to add new\n     * variables without shifting down storage in the inheritance chain.\n     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n     */\n    uint256[50] private __gap;\n}\n"
      },
      "node_modules/@openzeppelin/contracts-upgradeable/utils/AddressUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)\n\npragma solidity ^0.8.1;\n\n/**\n * @dev Collection of functions related to the address type\n */\nlibrary AddressUpgradeable {\n    /**\n     * @dev Returns true if `account` is a contract.\n     *\n     * [IMPORTANT]\n     * ====\n     * It is unsafe to assume that an address for which this function returns\n     * false is an externally-owned account (EOA) and not a contract.\n     *\n     * Among others, `isContract` will return false for the following\n     * types of addresses:\n     *\n     *  - an externally-owned account\n     *  - a contract in construction\n     *  - an address where a contract will be created\n     *  - an address where a contract lived, but was destroyed\n     *\n     * Furthermore, `isContract` will also return true if the target contract within\n     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,\n     * which only has an effect at the end of a transaction.\n     * ====\n     *\n     * [IMPORTANT]\n     * ====\n     * You shouldn't rely on `isContract` to protect against flash loan attacks!\n     *\n     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets\n     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract\n     * constructor.\n     * ====\n     */\n    function isContract(address account) internal view returns (bool) {\n        // This method relies on extcodesize/address.code.length, which returns 0\n        // for contracts in construction, since the code is only stored at the end\n        // of the constructor execution.\n\n        return account.code.length > 0;\n    }\n\n    /**\n     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to\n     * `recipient`, forwarding all available gas and reverting on errors.\n     *\n     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost\n     * of certain opcodes, possibly making contracts go over the 2300 gas limit\n     * imposed by `transfer`, making them unable to receive funds via\n     * `transfer`. {sendValue} removes this limitation.\n     *\n     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].\n     *\n     * IMPORTANT: because control is transferred to `recipient`, care must be\n     * taken to not create reentrancy vulnerabilities. Consider using\n     * {ReentrancyGuard} or the\n     * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].\n     */\n    function sendValue(address payable recipient, uint256 amount) internal {\n        require(address(this).balance >= amount, \"Address: insufficient balance\");\n\n        (bool success, ) = recipient.call{value: amount}(\"\");\n        require(success, \"Address: unable to send value, recipient may have reverted\");\n    }\n\n    /**\n     * @dev Performs a Solidity function call using a low level `call`. A\n     * plain `call` is an unsafe replacement for a function call: use this\n     * function instead.\n     *\n     * If `target` reverts with a revert reason, it is bubbled up by this\n     * function (like regular Solidity function calls).\n     *\n     * Returns the raw returned data. To convert to the expected return value,\n     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].\n     *\n     * Requirements:\n     *\n     * - `target` must be a contract.\n     * - calling `target` with `data` must not revert.\n     *\n     * _Available since v3.1._\n     */\n    function functionCall(address target, bytes memory data) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, 0, \"Address: low-level call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with\n     * `errorMessage` as a fallback revert reason when `target` reverts.\n     *\n     * _Available since v3.1._\n     */\n    function functionCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, 0, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but also transferring `value` wei to `target`.\n     *\n     * Requirements:\n     *\n     * - the calling contract must have an ETH balance of at least `value`.\n     * - the called Solidity function must be `payable`.\n     *\n     * _Available since v3.1._\n     */\n    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, value, \"Address: low-level call with value failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but\n     * with `errorMessage` as a fallback revert reason when `target` reverts.\n     *\n     * _Available since v3.1._\n     */\n    function functionCallWithValue(\n        address target,\n        bytes memory data,\n        uint256 value,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        require(address(this).balance >= value, \"Address: insufficient balance for call\");\n        (bool success, bytes memory returndata) = target.call{value: value}(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but performing a static call.\n     *\n     * _Available since v3.3._\n     */\n    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {\n        return functionStaticCall(target, data, \"Address: low-level static call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n     * but performing a static call.\n     *\n     * _Available since v3.3._\n     */\n    function functionStaticCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal view returns (bytes memory) {\n        (bool success, bytes memory returndata) = target.staticcall(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but performing a delegate call.\n     *\n     * _Available since v3.4._\n     */\n    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {\n        return functionDelegateCall(target, data, \"Address: low-level delegate call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n     * but performing a delegate call.\n     *\n     * _Available since v3.4._\n     */\n    function functionDelegateCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        (bool success, bytes memory returndata) = target.delegatecall(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling\n     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.\n     *\n     * _Available since v4.8._\n     */\n    function verifyCallResultFromTarget(\n        address target,\n        bool success,\n        bytes memory returndata,\n        string memory errorMessage\n    ) internal view returns (bytes memory) {\n        if (success) {\n            if (returndata.length == 0) {\n                // only check isContract if the call was successful and the return data is empty\n                // otherwise we already know that it was a contract\n                require(isContract(target), \"Address: call to non-contract\");\n            }\n            return returndata;\n        } else {\n            _revert(returndata, errorMessage);\n        }\n    }\n\n    /**\n     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the\n     * revert reason or using the provided one.\n     *\n     * _Available since v4.3._\n     */\n    function verifyCallResult(\n        bool success,\n        bytes memory returndata,\n        string memory errorMessage\n    ) internal pure returns (bytes memory) {\n        if (success) {\n            return returndata;\n        } else {\n            _revert(returndata, errorMessage);\n        }\n    }\n\n    function _revert(bytes memory returndata, string memory errorMessage) private pure {\n        // Look for revert reason and bubble it up if present\n        if (returndata.length > 0) {\n            // The easiest way to bubble the revert reason is using memory via assembly\n            /// @solidity memory-safe-assembly\n            assembly {\n                let returndata_size := mload(returndata)\n                revert(add(32, returndata), returndata_size)\n            }\n        } else {\n            revert(errorMessage);\n        }\n    }\n}\n"
      }
    },
    "settings": {
      "remappings": [
        "@openzeppelin/contracts-upgradeable/=node_modules/@openzeppelin/contracts-upgradeable/",
        "@openzeppelin/contracts/=node_modules/@openzeppelin/contracts/",
        "solady/=node_modules/solady/",
        "forge-std/=node_modules/forge-std/",
        "ds-test/=node_modules/ds-test/src/",
        "p256-verifier/=node_modules/p256-verifier/"
      ],
      "optimizer": {
        "enabled": true,
        "runs": 200
      },
      "metadata": {
        "useLiteralContent": false,
        "bytecodeHash": "ipfs",
        "appendCBOR": true
      },
      "outputSelection": {
        "*": {
          "*": [
            "evm.bytecode",
            "evm.deployedBytecode",
            "devdoc",
            "userdoc",
            "metadata",
            "abi"
          ]
        }
      },
      "evmVersion": "cancun",
      "libraries": {}
    }
  }}