Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.24;

// Revert to standard OpenZeppelin imports
import "@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol";
import "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";
import "@openzeppelin/contracts-upgradeable/utils/ReentrancyGuardUpgradeable.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "@openzeppelin/contracts/utils/cryptography/ECDSA.sol";
import "@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol";
import "./ITrailblazerGame.sol";
import "./IGameHubRouter.sol";
import "./IAddressManager.sol";


/**
 * @title CashOrCrashTrailblazer
 * @dev Smart contract to manage CashOrCrash game
 * 
 * The contract handles game creation, payout management, and provable fairness
 * for the CashOrCrashTrailblazer game, where players navigate through a grid to maximize 
 * their potential winnings. Requires server-signed parameters for critical actions.
 */
contract CashOrCrashTrailblazer is Initializable, OwnableUpgradeable, ReentrancyGuardUpgradeable, ITrailblazerGame {
    using ECDSA for bytes32;
    using MessageHashUtils for bytes32;

    // State Variables

    /// @notice Counter for unique on-chain game IDs
    uint256 public gameCounter;

    /// @notice Prefix used in messageHash for domain separation
    string public messagePrefix;

    /// @notice Address of the signer
    address public signerAddress;

    /// @notice Whether the game is currently active
    bool public isActive;

    /// @notice Mapping of admin addresses (can call privileged functions)
    mapping(address => bool) public isAdmin;

    /// @notice Mapping from preliminary game ID to on-chain game ID
    mapping(string => uint256) public preliminaryToOnChainId;

    /// @notice Address of the game hub router
    address public gameHubRouter;

    /// @notice Game status enum
    enum GameStatus {
        Created,
        Active,
        Won,
        Lost
    }

    /// @notice Game data structure
    struct Game {
        uint256 createdAt;       // Block timestamp when game was created
        address player;          // Player's wallet address
        uint256 betAmount;       // Original bet amount in wei
        GameStatus status;       // Current game status
        uint256 payoutAmount;    // Final payout amount (0 if lost)
        bytes32 gameSeedHash;    // Hash of the seed + gameConfig + algoVersion
        string gameSeed;         // Seed used to generate the game state
        string algoVersion;      // Algorithm version for going from seed to game state
        string gameConfig;       // JSON string containing game configuration
        string gameState;        // JSON string containing final game state/player moves
        uint256 sessionId;       // session id
    }

    /// @notice Mapping from on-chain game ID to Game data
    mapping(uint256 => Game) public games;

    /// @notice Mapping from session ID to on-chain game ID
    mapping(uint256 => uint256) public sessionToOnChainId;

    /// @notice Reserved slots for upgradeability
    uint256[50] private __gap; // 50 reserved slots


    // Events

    /// @notice Emitted when a new game is created
    event GameCreated(
        string preliminaryGameId,
        uint256 indexed onChainGameId,
        address indexed player,
        uint256 betAmount,
        bytes32 gameSeedHash // Keep seed hash in event for listener correlation
    );

    /// @notice Emitted when a payout is sent to a player
    event PayoutSent(
        uint256 indexed onChainGameId,
        uint256 amount,
        address indexed recipient
    );

    /// @notice Emitted when a game status is updated
    event GameStatusUpdated(
        uint256 indexed onChainGameId,
        GameStatus status
    );

    /// @notice Emitted when funds are deposited directly into the contract
    event DepositReceived(address indexed sender, uint256 amount);

    /// @notice Emitted when an admin is added
    event AdminAdded(address indexed newAdmin);

    /// @notice Emitted when an admin is removed
    event AdminRemoved(address indexed removedAdmin);

    /// @notice Emitted when a referral payment is made
    event ReferralPaid(address indexed recipient, uint256 amount, address indexed admin);

    /// @notice Emitted when an admin sets game seed and state
    event GameSeedAndStateSet(uint256 indexed onChainGameId, string gameSeed, string gameState);


    // Errors

    /// @notice Error when game already exists
    error GameAlreadyExists(string preliminaryGameId);

    /// @notice Error when game doesn't exist
    error GameDoesNotExist(uint256 onChainGameId);

    /// @notice Error when caller is not the player
    error NotGamePlayer(uint256 onChainGameId, address caller);

    /// @notice Error when game is not in active status
    error GameNotActive(uint256 onChainGameId);

    /// @notice Error when payout fails
    error PayoutFailed(uint256 onChainGameId, uint256 amount);

    /// @notice Error when server signature is invalid or doesn't match expected signer
    error InvalidServerSignature();

    /// @notice Error when caller is not authorized
    error UnauthorizedForSessionManagement();


    modifier onlyGameHubOrSessionManagerOrSigner() {
        // Get GameHub address from router
        address gameHub = IGameHubRouter(gameHubRouter).gameHub();

        // Get AddressManager from GameHub and then get SessionManager
        IAddressManager addressManager = IGameHub(gameHub).addressManager();
        address sessionManager = addressManager.getAddress("SESSION_MANAGER");

        if (msg.sender != gameHub && msg.sender != sessionManager && msg.sender != signerAddress) {
            revert UnauthorizedForSessionManagement();
        }
        _;
    }


    // Constructor

    /**
     * @dev Initializer sets the contract owner and initial server signer address
     * @param _messagePrefix The prefix used in messageHash for domain separation
     * @param _signerAddress The address of the signer
     */
    function initialize(string memory _messagePrefix, address _signerAddress) public initializer {
        __Ownable_init(msg.sender);
        __ReentrancyGuard_init();
        gameCounter = 0;
        isActive = true;
        messagePrefix = _messagePrefix;
        isAdmin[msg.sender] = true;
        signerAddress = _signerAddress;
        emit AdminAdded(msg.sender);
    }


    /**
     * @notice Creates a new game placeholder on-chain. Requires server signature.
     * Only gameSeedHash is needed for provable fairness.
     * @param preliminaryGameId The preliminary game ID generated by the backend
     * @param gameSeedHash Hash of the actual game seed (used for listener correlation)
     * @param algoVersion The algorithm version for provable fairness
     * @param gameConfig JSON string containing game configuration
     * @param deadline The latest timestamp this signature is valid for
     * @param serverSignature Signature from the server authorizing this game creation
     */
    function createGame(
        string calldata preliminaryGameId,
        bytes32 gameSeedHash,
        string calldata algoVersion,
        string calldata gameConfig,
        uint256 deadline,
        bytes calldata serverSignature
    ) external payable {
        require(block.timestamp <= deadline, "Signature expired");
        require(msg.value > 0, "Bet amount must be positive");
        
        // Use domain separation and abi.encode for signature
        bytes32 messageHash = keccak256(
            abi.encode(
                string.concat(messagePrefix, ":createGame"),
                preliminaryGameId,
                gameSeedHash,
                algoVersion,
                gameConfig,
                msg.sender,
                msg.value,
                deadline
            )
        );
        _verifyAnyAdminSignature(messageHash, serverSignature);

        if (preliminaryToOnChainId[preliminaryGameId] != 0) {
            revert GameAlreadyExists(preliminaryGameId);
        }

        gameCounter += 1;
        uint256 onChainGameId = gameCounter;
        preliminaryToOnChainId[preliminaryGameId] = onChainGameId;

        // Create game struct with all metadata
        games[onChainGameId] = Game({
            player: msg.sender,
            betAmount: msg.value,
            gameSeedHash: gameSeedHash,
            status: GameStatus.Created,
            payoutAmount: 0,
            gameSeed: "",
            algoVersion: algoVersion,
            gameConfig: gameConfig,
            gameState: "",
            createdAt: block.timestamp,
            sessionId: 0
        });

        emit GameCreated(preliminaryGameId, onChainGameId, msg.sender, msg.value, gameSeedHash);
    }

    /**
     * @notice Get details for a specific game
     * @param onChainGameId The on-chain game ID
     * @return Game struct with all game details
     */
    function getGameDetails(uint256 onChainGameId) external view returns (Game memory) {
         if (games[onChainGameId].player == address(0)) {
             revert GameDoesNotExist(onChainGameId);
         }
        return games[onChainGameId];
    }

    /**
     * @notice Get on-chain ID from preliminary ID
     * @param preliminaryGameId The preliminary game ID
     * @return onChainGameId The corresponding on-chain game ID (0 if not found)
     */
    function getOnChainGameId(string calldata preliminaryGameId) external view returns (uint256) {
        return preliminaryToOnChainId[preliminaryGameId];
    }



    // Admin Functions

    /**
     * @notice Withdraw contract funds to a specified recipient. Only callable by the owner.
     * Funds represent implicitly collected fees (Total Bets - Total Net Payouts).
     * @param amount The amount to withdraw.
     * @param recipient The address to send the withdrawn funds to.
     */
    function withdrawFunds(uint256 amount, address payable recipient) external onlyOwner nonReentrant {
        require(amount > 0, "Withdraw amount must be positive");
        require(recipient != address(0), "Invalid recipient address");
        require(amount <= address(this).balance, "Insufficient contract balance");
        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Withdrawal failed");
    }

    /**
     * @notice Receive function to accept direct Ether deposits into the treasury.
     */
    receive() external payable {
        emit DepositReceived(msg.sender, msg.value);
    }

    /**
     * @notice Adds a new admin address. Only callable by the contract owner.
     * @param newAdmin The address to grant admin privileges.
     */
    function addAdmin(address newAdmin) external onlyOwner {
        require(newAdmin != address(0), "Invalid admin address");
        require(!isAdmin[newAdmin], "Already admin");
        isAdmin[newAdmin] = true;
        emit AdminAdded(newAdmin);
    }

    /**
     * @notice Removes an admin address. Only callable by the contract owner.
     * @param adminToRemove The address to revoke admin privileges from.
     */ 
    function removeAdmin(address adminToRemove) external onlyOwner {
        require(isAdmin[adminToRemove], "Not an admin");
        require(adminToRemove != owner(), "Cannot remove owner");
        isAdmin[adminToRemove] = false;
        emit AdminRemoved(adminToRemove);
    }

    /**
     * @notice Allows the owner to manually set the gameCounter (for migration/upgrades).
     * @param newCounter The new value for gameCounter. Must be >= current value.
     */
    function setGameCounter(uint256 newCounter) external onlyOwner {
        require(newCounter >= gameCounter, "Cannot decrease gameCounter");
        gameCounter = newCounter;
    }

    /**
     * @notice Allows an admin to set the game seed and game state for a specific game.
     * @param onChainGameId The on-chain game ID
     * @param gameSeed The game seed to set
     * @param gameState The game state to set
     */
    function setGameSeedAndState(
        uint256 onChainGameId,
        string calldata gameSeed,
        string calldata gameState
    ) external {
        require(isAdmin[msg.sender], "Only admins can set game seed and state");
        
        // Verify game exists
        Game storage game = games[onChainGameId];
        if (game.player == address(0)) {
            revert GameDoesNotExist(onChainGameId);
        }
        
        // Set the game seed and state
        game.gameSeed = gameSeed;
        game.gameState = gameState;
        
        // Emit an event for transparency
        emit GameSeedAndStateSet(onChainGameId, gameSeed, gameState);
    }

    /**
     * @notice Sets the game hub router address. Only callable by the owner.
     * @param _gameHubRouter The address of the game hub router.
     */
    function setGameHubRouter(address _gameHubRouter) external onlyOwner {
        require(_gameHubRouter != address(0), "Invalid game hub router address");
        gameHubRouter = _gameHubRouter;
    }


    // Internal Helper Functions

    /**
     * @dev Verifies that the provided signature for the given hash was generated by any admin.
     * Reverts with InvalidServerSignature if verification fails.
     * @param _hash The hash that was signed.
     * @param _signature The signature bytes (expected length 65).
     */
    function _verifyAnyAdminSignature(bytes32 _hash, bytes calldata _signature) internal view {
        // Use OpenZeppelin's ECDSA library for robust verification
        address recoveredSigner = _hash.toEthSignedMessageHash().recover(_signature);
        if (recoveredSigner == address(0) || !isAdmin[recoveredSigner]) {
            revert InvalidServerSignature();
        }
    }

    /**
     * @dev Converts bytes32 to string, trimming any trailing zeros.
     * @param _bytes32 The bytes32 data to convert.
     * @return The resulting string.
     */
    function bytes32ToString(bytes32 _bytes32) internal pure returns (string memory) {
        uint8 i = 0;
        while(i < 32 && _bytes32[i] != 0) {
            i++;
        }
        bytes memory bytesArray = new bytes(i);
        for (i = 0; i < 32 && _bytes32[i] != 0; i++) {
            bytesArray[i] = _bytes32[i];
        }
        return string(bytesArray);
    }

    // ITrailblazerGame interface implementation

    /**
     * @notice Returns core game information
     */
    function getGameInfo() external pure override returns (
        string memory name,
        string memory category,
        uint256 minPlayers,
        uint256 maxPlayers,
        string memory version
    ) {
        return ("CashOrCrash", "Strategy", 1, 1, "1.0.0");
    }

    /**
     * @notice Returns the authorized signer for game results
     */
    function getGameSigner() external view override returns (address) {
        return signerAddress;
    }

    /**
     * @notice Returns whether the game is currently active
     */
    function isGameActive() external view override returns (bool) {
        return isActive;
    }
    
    /**
     * @notice Sets the game status to active
     */
    function setGameActive(bool _isGameActive) external onlyOwner {
        isActive = _isGameActive;
    }

    /**
     * @notice Called when a session starts
     */
    function onSessionStarted(
        uint256 sessionId,
        address[] calldata players,
        bytes32 gameData
    ) external override onlyGameHubOrSessionManagerOrSigner {
        // Convert bytes32 gameData to string using utility function
        string memory preliminaryId = bytes32ToString(gameData);
        
        // Get the on-chain game ID from preliminary ID
        uint256 onChainGameId = preliminaryToOnChainId[preliminaryId];
        require(onChainGameId != 0, "Game not found");
        
        // Get the game and verify it exists
        Game storage game = games[onChainGameId];
        require(game.status == GameStatus.Created, "Game not created or already active");
        require(game.player != address(0), "Game does not exist");
        require(players.length == 1, "Only one player allowed");
        require(game.player == players[0], "Player does not match");
        
        // Set the game status to active (it should already be active, but ensure it)
        game.status = GameStatus.Active;
        game.sessionId = sessionId;
        
        // Store the session ID mapping
        sessionToOnChainId[sessionId] = onChainGameId;
        
        emit GameStatusUpdated(onChainGameId, GameStatus.Active);
    }

    /**
     * @notice Called when a session ends
     */
    function onSessionEnded(
        uint256 sessionId,
        address winner,
        bytes32 resultData
    ) external override onlyGameHubOrSessionManagerOrSigner {
        // Get the on-chain game ID from session ID
        uint256 onChainGameId = sessionToOnChainId[sessionId];
        require(onChainGameId != 0, "Session not found");
        
        // Get the game and verify it exists
        Game storage game = games[onChainGameId];
        require(game.player != address(0), "Game does not exist");
        require(game.status == GameStatus.Active, "Game not active");
        
        // Cast resultData to payout amount
        uint256 payoutAmount = uint256(resultData);
        
        if (winner != game.player) {
            // Game is lost
            game.status = GameStatus.Lost;
            game.payoutAmount = 0;
        } else {
            // Game is won
            game.status = GameStatus.Won;
            game.payoutAmount = payoutAmount;
            
            // Transfer payout directly to player
            (bool success, ) = payable(game.player).call{value: payoutAmount}("");
            if (!success) {
                revert PayoutFailed(onChainGameId, payoutAmount);
            }
            
            emit PayoutSent(onChainGameId, payoutAmount, game.player);
        }
        
        emit GameStatusUpdated(onChainGameId, game.status);
    }

    /**
     * @notice Validates session start parameters
     */
    function validateSessionStart(
        address[] calldata players,
        bytes32 gameData
    ) external view override returns (bool isValid, string memory reason) {
        // Convert bytes32 gameData to string using utility function
        string memory preliminaryId = bytes32ToString(gameData);
        
        // Check if only one player
        if (players.length != 1) {
            return (false, "Only one player allowed");
        }
        
        // Get the on-chain game ID from preliminary ID
        uint256 onChainGameId = preliminaryToOnChainId[preliminaryId];
        if (onChainGameId == 0) {
            return (false, "Game not found");
        }
        
        // Get the game and verify it exists
        Game storage game = games[onChainGameId];
        if (game.status != GameStatus.Created) {
            return (false, "Game not created or already active");
        }
        
        if (game.player == address(0)) {
            return (false, "Game does not exist");
        }
        
        if (game.player != players[0]) {
            return (false, "Player does not match");
        }
        
        return (true, "");
    }

    /**
     * @notice Validates session end parameters
     */
    function validateSessionEnd(
        uint256 sessionId,
        address winner,
        bytes32 resultData
    ) external view override returns (bool isValid, string memory reason) {
        // Get the on-chain game ID from session ID
        uint256 onChainGameId = sessionToOnChainId[sessionId];
        if (onChainGameId == 0) {
            return (false, "Session not found");
        }
        
        // Get the game and verify it exists
        Game storage game = games[onChainGameId];
        if (game.player == address(0)) {
            return (false, "Game does not exist");
        }
        
        if (game.status != GameStatus.Active) {
            return (false, "Game not active");
        }
        
        // Cast resultData to payout amount for validation
        uint256 payoutAmount = uint256(resultData);
        
        // If there's a payout, winner should be the game player
        if (payoutAmount > 0 && winner != game.player) {
            return (false, "Winner does not match game player");
        }
        
        // If no payout, winner can be anyone (or address(0) for loss)
        // This is valid as the game is lost
        
        return (true, "");
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)

pragma solidity ^0.8.20;

import {ContextUpgradeable} from "../utils/ContextUpgradeable.sol";
import {Initializable} from "../proxy/utils/Initializable.sol";

/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * The initial owner is set to the address provided by the deployer. This can
 * later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract OwnableUpgradeable is Initializable, ContextUpgradeable {
    /// @custom:storage-location erc7201:openzeppelin.storage.Ownable
    struct OwnableStorage {
        address _owner;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Ownable")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant OwnableStorageLocation = 0x9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300;

    function _getOwnableStorage() private pure returns (OwnableStorage storage $) {
        assembly {
            $.slot := OwnableStorageLocation
        }
    }

    /**
     * @dev The caller account is not authorized to perform an operation.
     */
    error OwnableUnauthorizedAccount(address account);

    /**
     * @dev The owner is not a valid owner account. (eg. `address(0)`)
     */
    error OwnableInvalidOwner(address owner);

    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    /**
     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.
     */
    function __Ownable_init(address initialOwner) internal onlyInitializing {
        __Ownable_init_unchained(initialOwner);
    }

    function __Ownable_init_unchained(address initialOwner) internal onlyInitializing {
        if (initialOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(initialOwner);
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        _checkOwner();
        _;
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        OwnableStorage storage $ = _getOwnableStorage();
        return $._owner;
    }

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        if (owner() != _msgSender()) {
            revert OwnableUnauthorizedAccount(_msgSender());
        }
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby disabling any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        if (newOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual {
        OwnableStorage storage $ = _getOwnableStorage();
        address oldOwner = $._owner;
        $._owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (proxy/utils/Initializable.sol)

pragma solidity ^0.8.20;

/**
 * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed
 * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an
 * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer
 * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.
 *
 * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be
 * reused. This mechanism prevents re-execution of each "step" but allows the creation of new initialization steps in
 * case an upgrade adds a module that needs to be initialized.
 *
 * For example:
 *
 * [.hljs-theme-light.nopadding]
 * ```solidity
 * contract MyToken is ERC20Upgradeable {
 *     function initialize() initializer public {
 *         __ERC20_init("MyToken", "MTK");
 *     }
 * }
 *
 * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {
 *     function initializeV2() reinitializer(2) public {
 *         __ERC20Permit_init("MyToken");
 *     }
 * }
 * ```
 *
 * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as
 * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.
 *
 * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure
 * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.
 *
 * [CAUTION]
 * ====
 * Avoid leaving a contract uninitialized.
 *
 * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation
 * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke
 * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:
 *
 * [.hljs-theme-light.nopadding]
 * ```
 * /// @custom:oz-upgrades-unsafe-allow constructor
 * constructor() {
 *     _disableInitializers();
 * }
 * ```
 * ====
 */
abstract contract Initializable {
    /**
     * @dev Storage of the initializable contract.
     *
     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions
     * when using with upgradeable contracts.
     *
     * @custom:storage-location erc7201:openzeppelin.storage.Initializable
     */
    struct InitializableStorage {
        /**
         * @dev Indicates that the contract has been initialized.
         */
        uint64 _initialized;
        /**
         * @dev Indicates that the contract is in the process of being initialized.
         */
        bool _initializing;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.Initializable")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant INITIALIZABLE_STORAGE = 0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00;

    /**
     * @dev The contract is already initialized.
     */
    error InvalidInitialization();

    /**
     * @dev The contract is not initializing.
     */
    error NotInitializing();

    /**
     * @dev Triggered when the contract has been initialized or reinitialized.
     */
    event Initialized(uint64 version);

    /**
     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,
     * `onlyInitializing` functions can be used to initialize parent contracts.
     *
     * Similar to `reinitializer(1)`, except that in the context of a constructor an `initializer` may be invoked any
     * number of times. This behavior in the constructor can be useful during testing and is not expected to be used in
     * production.
     *
     * Emits an {Initialized} event.
     */
    modifier initializer() {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        // Cache values to avoid duplicated sloads
        bool isTopLevelCall = !$._initializing;
        uint64 initialized = $._initialized;

        // Allowed calls:
        // - initialSetup: the contract is not in the initializing state and no previous version was
        //                 initialized
        // - construction: the contract is initialized at version 1 (no reininitialization) and the
        //                 current contract is just being deployed
        bool initialSetup = initialized == 0 && isTopLevelCall;
        bool construction = initialized == 1 && address(this).code.length == 0;

        if (!initialSetup && !construction) {
            revert InvalidInitialization();
        }
        $._initialized = 1;
        if (isTopLevelCall) {
            $._initializing = true;
        }
        _;
        if (isTopLevelCall) {
            $._initializing = false;
            emit Initialized(1);
        }
    }

    /**
     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the
     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be
     * used to initialize parent contracts.
     *
     * A reinitializer may be used after the original initialization step. This is essential to configure modules that
     * are added through upgrades and that require initialization.
     *
     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`
     * cannot be nested. If one is invoked in the context of another, execution will revert.
     *
     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in
     * a contract, executing them in the right order is up to the developer or operator.
     *
     * WARNING: Setting the version to 2**64 - 1 will prevent any future reinitialization.
     *
     * Emits an {Initialized} event.
     */
    modifier reinitializer(uint64 version) {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        if ($._initializing || $._initialized >= version) {
            revert InvalidInitialization();
        }
        $._initialized = version;
        $._initializing = true;
        _;
        $._initializing = false;
        emit Initialized(version);
    }

    /**
     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the
     * {initializer} and {reinitializer} modifiers, directly or indirectly.
     */
    modifier onlyInitializing() {
        _checkInitializing();
        _;
    }

    /**
     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.
     */
    function _checkInitializing() internal view virtual {
        if (!_isInitializing()) {
            revert NotInitializing();
        }
    }

    /**
     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.
     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized
     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called
     * through proxies.
     *
     * Emits an {Initialized} event the first time it is successfully executed.
     */
    function _disableInitializers() internal virtual {
        // solhint-disable-next-line var-name-mixedcase
        InitializableStorage storage $ = _getInitializableStorage();

        if ($._initializing) {
            revert InvalidInitialization();
        }
        if ($._initialized != type(uint64).max) {
            $._initialized = type(uint64).max;
            emit Initialized(type(uint64).max);
        }
    }

    /**
     * @dev Returns the highest version that has been initialized. See {reinitializer}.
     */
    function _getInitializedVersion() internal view returns (uint64) {
        return _getInitializableStorage()._initialized;
    }

    /**
     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.
     */
    function _isInitializing() internal view returns (bool) {
        return _getInitializableStorage()._initializing;
    }

    /**
     * @dev Returns a pointer to the storage namespace.
     */
    // solhint-disable-next-line var-name-mixedcase
    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {
        assembly {
            $.slot := INITIALIZABLE_STORAGE
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)

pragma solidity ^0.8.20;
import {Initializable} from "../proxy/utils/Initializable.sol";

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract ContextUpgradeable is Initializable {
    function __Context_init() internal onlyInitializing {
    }

    function __Context_init_unchained() internal onlyInitializing {
    }
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }

    function _contextSuffixLength() internal view virtual returns (uint256) {
        return 0;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/ReentrancyGuard.sol)

pragma solidity ^0.8.20;
import {Initializable} from "../proxy/utils/Initializable.sol";

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If EIP-1153 (transient storage) is available on the chain you're deploying at,
 * consider using {ReentrancyGuardTransient} instead.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuardUpgradeable is Initializable {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant NOT_ENTERED = 1;
    uint256 private constant ENTERED = 2;

    /// @custom:storage-location erc7201:openzeppelin.storage.ReentrancyGuard
    struct ReentrancyGuardStorage {
        uint256 _status;
    }

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ReentrancyGuard")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant ReentrancyGuardStorageLocation = 0x9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00;

    function _getReentrancyGuardStorage() private pure returns (ReentrancyGuardStorage storage $) {
        assembly {
            $.slot := ReentrancyGuardStorageLocation
        }
    }

    /**
     * @dev Unauthorized reentrant call.
     */
    error ReentrancyGuardReentrantCall();

    function __ReentrancyGuard_init() internal onlyInitializing {
        __ReentrancyGuard_init_unchained();
    }

    function __ReentrancyGuard_init_unchained() internal onlyInitializing {
        ReentrancyGuardStorage storage $ = _getReentrancyGuardStorage();
        $._status = NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        ReentrancyGuardStorage storage $ = _getReentrancyGuardStorage();
        // On the first call to nonReentrant, _status will be NOT_ENTERED
        if ($._status == ENTERED) {
            revert ReentrancyGuardReentrantCall();
        }

        // Any calls to nonReentrant after this point will fail
        $._status = ENTERED;
    }

    function _nonReentrantAfter() private {
        ReentrancyGuardStorage storage $ = _getReentrancyGuardStorage();
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        $._status = NOT_ENTERED;
    }

    /**
     * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
     * `nonReentrant` function in the call stack.
     */
    function _reentrancyGuardEntered() internal view returns (bool) {
        ReentrancyGuardStorage storage $ = _getReentrancyGuardStorage();
        return $._status == ENTERED;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/ECDSA.sol)

pragma solidity ^0.8.20;

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSA {
    enum RecoverError {
        NoError,
        InvalidSignature,
        InvalidSignatureLength,
        InvalidSignatureS
    }

    /**
     * @dev The signature derives the `address(0)`.
     */
    error ECDSAInvalidSignature();

    /**
     * @dev The signature has an invalid length.
     */
    error ECDSAInvalidSignatureLength(uint256 length);

    /**
     * @dev The signature has an S value that is in the upper half order.
     */
    error ECDSAInvalidSignatureS(bytes32 s);

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with `signature` or an error. This will not
     * return address(0) without also returning an error description. Errors are documented using an enum (error type)
     * and a bytes32 providing additional information about the error.
     *
     * If no error is returned, then the address can be used for verification purposes.
     *
     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
     *
     * Documentation for signature generation:
     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
     */
    function tryRecover(
        bytes32 hash,
        bytes memory signature
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, and the only way to get them
            // currently is to use assembly.
            assembly ("memory-safe") {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            return tryRecover(hash, v, r, s);
        } else {
            return (address(0), RecoverError.InvalidSignatureLength, bytes32(signature.length));
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM precompile allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {MessageHashUtils-toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, signature);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[ERC-2098 short signatures]
     */
    function tryRecover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        unchecked {
            bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
            // We do not check for an overflow here since the shift operation results in 0 or 1.
            uint8 v = uint8((uint256(vs) >> 255) + 27);
            return tryRecover(hash, v, r, s);
        }
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
     */
    function recover(bytes32 hash, bytes32 r, bytes32 vs) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, r, vs);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function tryRecover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address recovered, RecoverError err, bytes32 errArg) {
        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
        // signatures from current libraries generate a unique signature with an s-value in the lower half order.
        //
        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
        // these malleable signatures as well.
        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
            return (address(0), RecoverError.InvalidSignatureS, s);
        }

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        if (signer == address(0)) {
            return (address(0), RecoverError.InvalidSignature, bytes32(0));
        }

        return (signer, RecoverError.NoError, bytes32(0));
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function recover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal pure returns (address) {
        (address recovered, RecoverError error, bytes32 errorArg) = tryRecover(hash, v, r, s);
        _throwError(error, errorArg);
        return recovered;
    }

    /**
     * @dev Optionally reverts with the corresponding custom error according to the `error` argument provided.
     */
    function _throwError(RecoverError error, bytes32 errorArg) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert ECDSAInvalidSignature();
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert ECDSAInvalidSignatureLength(uint256(errorArg));
        } else if (error == RecoverError.InvalidSignatureS) {
            revert ECDSAInvalidSignatureS(errorArg);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MessageHashUtils.sol)

pragma solidity ^0.8.20;

import {Strings} from "../Strings.sol";

/**
 * @dev Signature message hash utilities for producing digests to be consumed by {ECDSA} recovery or signing.
 *
 * The library provides methods for generating a hash of a message that conforms to the
 * https://eips.ethereum.org/EIPS/eip-191[ERC-191] and https://eips.ethereum.org/EIPS/eip-712[EIP 712]
 * specifications.
 */
library MessageHashUtils {
    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing a bytes32 `messageHash` with
     * `"\x19Ethereum Signed Message:\n32"` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * NOTE: The `messageHash` parameter is intended to be the result of hashing a raw message with
     * keccak256, although any bytes32 value can be safely used because the final digest will
     * be re-hashed.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes32 messageHash) internal pure returns (bytes32 digest) {
        assembly ("memory-safe") {
            mstore(0x00, "\x19Ethereum Signed Message:\n32") // 32 is the bytes-length of messageHash
            mstore(0x1c, messageHash) // 0x1c (28) is the length of the prefix
            digest := keccak256(0x00, 0x3c) // 0x3c is the length of the prefix (0x1c) + messageHash (0x20)
        }
    }

    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x45` (`personal_sign` messages).
     *
     * The digest is calculated by prefixing an arbitrary `message` with
     * `"\x19Ethereum Signed Message:\n" + len(message)` and hashing the result. It corresponds with the
     * hash signed when using the https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`] JSON-RPC method.
     *
     * See {ECDSA-recover}.
     */
    function toEthSignedMessageHash(bytes memory message) internal pure returns (bytes32) {
        return
            keccak256(bytes.concat("\x19Ethereum Signed Message:\n", bytes(Strings.toString(message.length)), message));
    }

    /**
     * @dev Returns the keccak256 digest of an ERC-191 signed data with version
     * `0x00` (data with intended validator).
     *
     * The digest is calculated by prefixing an arbitrary `data` with `"\x19\x00"` and the intended
     * `validator` address. Then hashing the result.
     *
     * See {ECDSA-recover}.
     */
    function toDataWithIntendedValidatorHash(address validator, bytes memory data) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked(hex"19_00", validator, data));
    }

    /**
     * @dev Returns the keccak256 digest of an EIP-712 typed data (ERC-191 version `0x01`).
     *
     * The digest is calculated from a `domainSeparator` and a `structHash`, by prefixing them with
     * `\x19\x01` and hashing the result. It corresponds to the hash signed by the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`] JSON-RPC method as part of EIP-712.
     *
     * See {ECDSA-recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32 digest) {
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            mstore(ptr, hex"19_01")
            mstore(add(ptr, 0x02), domainSeparator)
            mstore(add(ptr, 0x22), structHash)
            digest := keccak256(ptr, 0x42)
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;

import {Panic} from "../Panic.sol";
import {SafeCast} from "./SafeCast.sol";

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a > b, a, b);
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a < b, a, b);
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }

        // The following calculation ensures accurate ceiling division without overflow.
        // Since a is non-zero, (a - 1) / b will not overflow.
        // The largest possible result occurs when (a - 1) / b is type(uint256).max,
        // but the largest value we can obtain is type(uint256).max - 1, which happens
        // when a = type(uint256).max and b = 1.
        unchecked {
            return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
        }
    }

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
            // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2²⁵⁶ + prod0.
            uint256 prod0 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
            if (denominator <= prod1) {
                Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
            }

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator.
            // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.

            uint256 twos = denominator & (0 - denominator);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
            // that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv ≡ 1 mod 2⁴.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
            // works in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
            inverse *= 2 - denominator * inverse; // inverse mod 2³²
            inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
            inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
            // less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
    }

    /**
     * @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
     *
     * If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
     * If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
     *
     * If the input value is not inversible, 0 is returned.
     *
     * NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
     * inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
     */
    function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
        unchecked {
            if (n == 0) return 0;

            // The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
            // Used to compute integers x and y such that: ax + ny = gcd(a, n).
            // When the gcd is 1, then the inverse of a modulo n exists and it's x.
            // ax + ny = 1
            // ax = 1 + (-y)n
            // ax ≡ 1 (mod n) # x is the inverse of a modulo n

            // If the remainder is 0 the gcd is n right away.
            uint256 remainder = a % n;
            uint256 gcd = n;

            // Therefore the initial coefficients are:
            // ax + ny = gcd(a, n) = n
            // 0a + 1n = n
            int256 x = 0;
            int256 y = 1;

            while (remainder != 0) {
                uint256 quotient = gcd / remainder;

                (gcd, remainder) = (
                    // The old remainder is the next gcd to try.
                    remainder,
                    // Compute the next remainder.
                    // Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
                    // where gcd is at most n (capped to type(uint256).max)
                    gcd - remainder * quotient
                );

                (x, y) = (
                    // Increment the coefficient of a.
                    y,
                    // Decrement the coefficient of n.
                    // Can overflow, but the result is casted to uint256 so that the
                    // next value of y is "wrapped around" to a value between 0 and n - 1.
                    x - y * int256(quotient)
                );
            }

            if (gcd != 1) return 0; // No inverse exists.
            return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
        }
    }

    /**
     * @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
     *
     * From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
     * prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
     * `a**(p-2)` is the modular multiplicative inverse of a in Fp.
     *
     * NOTE: this function does NOT check that `p` is a prime greater than `2`.
     */
    function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
        unchecked {
            return Math.modExp(a, p - 2, p);
        }
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
     *
     * Requirements:
     * - modulus can't be zero
     * - underlying staticcall to precompile must succeed
     *
     * IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
     * sure the chain you're using it on supports the precompiled contract for modular exponentiation
     * at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
     * the underlying function will succeed given the lack of a revert, but the result may be incorrectly
     * interpreted as 0.
     */
    function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
        (bool success, uint256 result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
     * It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
     * to operate modulo 0 or if the underlying precompile reverted.
     *
     * IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
     * you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
     * https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
     * of a revert, but the result may be incorrectly interpreted as 0.
     */
    function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
        if (m == 0) return (false, 0);
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            // | Offset    | Content    | Content (Hex)                                                      |
            // |-----------|------------|--------------------------------------------------------------------|
            // | 0x00:0x1f | size of b  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x20:0x3f | size of e  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x40:0x5f | size of m  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x60:0x7f | value of b | 0x<.............................................................b> |
            // | 0x80:0x9f | value of e | 0x<.............................................................e> |
            // | 0xa0:0xbf | value of m | 0x<.............................................................m> |
            mstore(ptr, 0x20)
            mstore(add(ptr, 0x20), 0x20)
            mstore(add(ptr, 0x40), 0x20)
            mstore(add(ptr, 0x60), b)
            mstore(add(ptr, 0x80), e)
            mstore(add(ptr, 0xa0), m)

            // Given the result < m, it's guaranteed to fit in 32 bytes,
            // so we can use the memory scratch space located at offset 0.
            success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
            result := mload(0x00)
        }
    }

    /**
     * @dev Variant of {modExp} that supports inputs of arbitrary length.
     */
    function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
        (bool success, bytes memory result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Variant of {tryModExp} that supports inputs of arbitrary length.
     */
    function tryModExp(
        bytes memory b,
        bytes memory e,
        bytes memory m
    ) internal view returns (bool success, bytes memory result) {
        if (_zeroBytes(m)) return (false, new bytes(0));

        uint256 mLen = m.length;

        // Encode call args in result and move the free memory pointer
        result = abi.encodePacked(b.length, e.length, mLen, b, e, m);

        assembly ("memory-safe") {
            let dataPtr := add(result, 0x20)
            // Write result on top of args to avoid allocating extra memory.
            success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
            // Overwrite the length.
            // result.length > returndatasize() is guaranteed because returndatasize() == m.length
            mstore(result, mLen)
            // Set the memory pointer after the returned data.
            mstore(0x40, add(dataPtr, mLen))
        }
    }

    /**
     * @dev Returns whether the provided byte array is zero.
     */
    function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
        for (uint256 i = 0; i < byteArray.length; ++i) {
            if (byteArray[i] != 0) {
                return false;
            }
        }
        return true;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
     * towards zero.
     *
     * This method is based on Newton's method for computing square roots; the algorithm is restricted to only
     * using integer operations.
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        unchecked {
            // Take care of easy edge cases when a == 0 or a == 1
            if (a <= 1) {
                return a;
            }

            // In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
            // sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
            // the current value as `ε_n = | x_n - sqrt(a) |`.
            //
            // For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
            // of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
            // bigger than any uint256.
            //
            // By noticing that
            // `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
            // we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
            // to the msb function.
            uint256 aa = a;
            uint256 xn = 1;

            if (aa >= (1 << 128)) {
                aa >>= 128;
                xn <<= 64;
            }
            if (aa >= (1 << 64)) {
                aa >>= 64;
                xn <<= 32;
            }
            if (aa >= (1 << 32)) {
                aa >>= 32;
                xn <<= 16;
            }
            if (aa >= (1 << 16)) {
                aa >>= 16;
                xn <<= 8;
            }
            if (aa >= (1 << 8)) {
                aa >>= 8;
                xn <<= 4;
            }
            if (aa >= (1 << 4)) {
                aa >>= 4;
                xn <<= 2;
            }
            if (aa >= (1 << 2)) {
                xn <<= 1;
            }

            // We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
            //
            // We can refine our estimation by noticing that the middle of that interval minimizes the error.
            // If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
            // This is going to be our x_0 (and ε_0)
            xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)

            // From here, Newton's method give us:
            // x_{n+1} = (x_n + a / x_n) / 2
            //
            // One should note that:
            // x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
            //              = ((x_n² + a) / (2 * x_n))² - a
            //              = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
            //              = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
            //              = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
            //              = (x_n² - a)² / (2 * x_n)²
            //              = ((x_n² - a) / (2 * x_n))²
            //              ≥ 0
            // Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
            //
            // This gives us the proof of quadratic convergence of the sequence:
            // ε_{n+1} = | x_{n+1} - sqrt(a) |
            //         = | (x_n + a / x_n) / 2 - sqrt(a) |
            //         = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
            //         = | (x_n - sqrt(a))² / (2 * x_n) |
            //         = | ε_n² / (2 * x_n) |
            //         = ε_n² / | (2 * x_n) |
            //
            // For the first iteration, we have a special case where x_0 is known:
            // ε_1 = ε_0² / | (2 * x_0) |
            //     ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
            //     ≤ 2**(2*e-4) / (3 * 2**(e-1))
            //     ≤ 2**(e-3) / 3
            //     ≤ 2**(e-3-log2(3))
            //     ≤ 2**(e-4.5)
            //
            // For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
            // ε_{n+1} = ε_n² / | (2 * x_n) |
            //         ≤ (2**(e-k))² / (2 * 2**(e-1))
            //         ≤ 2**(2*e-2*k) / 2**e
            //         ≤ 2**(e-2*k)
            xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5)  -- special case, see above
            xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9)    -- general case with k = 4.5
            xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18)   -- general case with k = 9
            xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36)   -- general case with k = 18
            xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72)   -- general case with k = 36
            xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144)  -- general case with k = 72

            // Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
            // ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
            // sqrt(a) or sqrt(a) + 1.
            return xn - SafeCast.toUint(xn > a / xn);
        }
    }

    /**
     * @dev Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 exp;
        unchecked {
            exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
            value >>= exp;
            result += exp;

            exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
            value >>= exp;
            result += exp;

            exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
            value >>= exp;
            result += exp;

            exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
            value >>= exp;
            result += exp;

            exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
            value >>= exp;
            result += exp;

            exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
            value >>= exp;
            result += exp;

            exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
            value >>= exp;
            result += exp;

            result += SafeCast.toUint(value > 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
        }
    }

    /**
     * @dev Return the log in base 10 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
        }
    }

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 isGt;
        unchecked {
            isGt = SafeCast.toUint(value > (1 << 128) - 1);
            value >>= isGt * 128;
            result += isGt * 16;

            isGt = SafeCast.toUint(value > (1 << 64) - 1);
            value >>= isGt * 64;
            result += isGt * 8;

            isGt = SafeCast.toUint(value > (1 << 32) - 1);
            value >>= isGt * 32;
            result += isGt * 4;

            isGt = SafeCast.toUint(value > (1 << 16) - 1);
            value >>= isGt * 16;
            result += isGt * 2;

            result += SafeCast.toUint(value > (1 << 8) - 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
        }
    }

    /**
     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
     */
    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
        return uint8(rounding) % 2 == 1;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.

pragma solidity ^0.8.20;

/**
 * @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
 * checks.
 *
 * Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
 * easily result in undesired exploitation or bugs, since developers usually
 * assume that overflows raise errors. `SafeCast` restores this intuition by
 * reverting the transaction when such an operation overflows.
 *
 * Using this library instead of the unchecked operations eliminates an entire
 * class of bugs, so it's recommended to use it always.
 */
library SafeCast {
    /**
     * @dev Value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);

    /**
     * @dev An int value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedIntToUint(int256 value);

    /**
     * @dev Value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);

    /**
     * @dev An uint value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedUintToInt(uint256 value);

    /**
     * @dev Returns the downcasted uint248 from uint256, reverting on
     * overflow (when the input is greater than largest uint248).
     *
     * Counterpart to Solidity's `uint248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toUint248(uint256 value) internal pure returns (uint248) {
        if (value > type(uint248).max) {
            revert SafeCastOverflowedUintDowncast(248, value);
        }
        return uint248(value);
    }

    /**
     * @dev Returns the downcasted uint240 from uint256, reverting on
     * overflow (when the input is greater than largest uint240).
     *
     * Counterpart to Solidity's `uint240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toUint240(uint256 value) internal pure returns (uint240) {
        if (value > type(uint240).max) {
            revert SafeCastOverflowedUintDowncast(240, value);
        }
        return uint240(value);
    }

    /**
     * @dev Returns the downcasted uint232 from uint256, reverting on
     * overflow (when the input is greater than largest uint232).
     *
     * Counterpart to Solidity's `uint232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toUint232(uint256 value) internal pure returns (uint232) {
        if (value > type(uint232).max) {
            revert SafeCastOverflowedUintDowncast(232, value);
        }
        return uint232(value);
    }

    /**
     * @dev Returns the downcasted uint224 from uint256, reverting on
     * overflow (when the input is greater than largest uint224).
     *
     * Counterpart to Solidity's `uint224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toUint224(uint256 value) internal pure returns (uint224) {
        if (value > type(uint224).max) {
            revert SafeCastOverflowedUintDowncast(224, value);
        }
        return uint224(value);
    }

    /**
     * @dev Returns the downcasted uint216 from uint256, reverting on
     * overflow (when the input is greater than largest uint216).
     *
     * Counterpart to Solidity's `uint216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toUint216(uint256 value) internal pure returns (uint216) {
        if (value > type(uint216).max) {
            revert SafeCastOverflowedUintDowncast(216, value);
        }
        return uint216(value);
    }

    /**
     * @dev Returns the downcasted uint208 from uint256, reverting on
     * overflow (when the input is greater than largest uint208).
     *
     * Counterpart to Solidity's `uint208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toUint208(uint256 value) internal pure returns (uint208) {
        if (value > type(uint208).max) {
            revert SafeCastOverflowedUintDowncast(208, value);
        }
        return uint208(value);
    }

    /**
     * @dev Returns the downcasted uint200 from uint256, reverting on
     * overflow (when the input is greater than largest uint200).
     *
     * Counterpart to Solidity's `uint200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toUint200(uint256 value) internal pure returns (uint200) {
        if (value > type(uint200).max) {
            revert SafeCastOverflowedUintDowncast(200, value);
        }
        return uint200(value);
    }

    /**
     * @dev Returns the downcasted uint192 from uint256, reverting on
     * overflow (when the input is greater than largest uint192).
     *
     * Counterpart to Solidity's `uint192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toUint192(uint256 value) internal pure returns (uint192) {
        if (value > type(uint192).max) {
            revert SafeCastOverflowedUintDowncast(192, value);
        }
        return uint192(value);
    }

    /**
     * @dev Returns the downcasted uint184 from uint256, reverting on
     * overflow (when the input is greater than largest uint184).
     *
     * Counterpart to Solidity's `uint184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toUint184(uint256 value) internal pure returns (uint184) {
        if (value > type(uint184).max) {
            revert SafeCastOverflowedUintDowncast(184, value);
        }
        return uint184(value);
    }

    /**
     * @dev Returns the downcasted uint176 from uint256, reverting on
     * overflow (when the input is greater than largest uint176).
     *
     * Counterpart to Solidity's `uint176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toUint176(uint256 value) internal pure returns (uint176) {
        if (value > type(uint176).max) {
            revert SafeCastOverflowedUintDowncast(176, value);
        }
        return uint176(value);
    }

    /**
     * @dev Returns the downcasted uint168 from uint256, reverting on
     * overflow (when the input is greater than largest uint168).
     *
     * Counterpart to Solidity's `uint168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toUint168(uint256 value) internal pure returns (uint168) {
        if (value > type(uint168).max) {
            revert SafeCastOverflowedUintDowncast(168, value);
        }
        return uint168(value);
    }

    /**
     * @dev Returns the downcasted uint160 from uint256, reverting on
     * overflow (when the input is greater than largest uint160).
     *
     * Counterpart to Solidity's `uint160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toUint160(uint256 value) internal pure returns (uint160) {
        if (value > type(uint160).max) {
            revert SafeCastOverflowedUintDowncast(160, value);
        }
        return uint160(value);
    }

    /**
     * @dev Returns the downcasted uint152 from uint256, reverting on
     * overflow (when the input is greater than largest uint152).
     *
     * Counterpart to Solidity's `uint152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toUint152(uint256 value) internal pure returns (uint152) {
        if (value > type(uint152).max) {
            revert SafeCastOverflowedUintDowncast(152, value);
        }
        return uint152(value);
    }

    /**
     * @dev Returns the downcasted uint144 from uint256, reverting on
     * overflow (when the input is greater than largest uint144).
     *
     * Counterpart to Solidity's `uint144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toUint144(uint256 value) internal pure returns (uint144) {
        if (value > type(uint144).max) {
            revert SafeCastOverflowedUintDowncast(144, value);
        }
        return uint144(value);
    }

    /**
     * @dev Returns the downcasted uint136 from uint256, reverting on
     * overflow (when the input is greater than largest uint136).
     *
     * Counterpart to Solidity's `uint136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toUint136(uint256 value) internal pure returns (uint136) {
        if (value > type(uint136).max) {
            revert SafeCastOverflowedUintDowncast(136, value);
        }
        return uint136(value);
    }

    /**
     * @dev Returns the downcasted uint128 from uint256, reverting on
     * overflow (when the input is greater than largest uint128).
     *
     * Counterpart to Solidity's `uint128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toUint128(uint256 value) internal pure returns (uint128) {
        if (value > type(uint128).max) {
            revert SafeCastOverflowedUintDowncast(128, value);
        }
        return uint128(value);
    }

    /**
     * @dev Returns the downcasted uint120 from uint256, reverting on
     * overflow (when the input is greater than largest uint120).
     *
     * Counterpart to Solidity's `uint120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toUint120(uint256 value) internal pure returns (uint120) {
        if (value > type(uint120).max) {
            revert SafeCastOverflowedUintDowncast(120, value);
        }
        return uint120(value);
    }

    /**
     * @dev Returns the downcasted uint112 from uint256, reverting on
     * overflow (when the input is greater than largest uint112).
     *
     * Counterpart to Solidity's `uint112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toUint112(uint256 value) internal pure returns (uint112) {
        if (value > type(uint112).max) {
            revert SafeCastOverflowedUintDowncast(112, value);
        }
        return uint112(value);
    }

    /**
     * @dev Returns the downcasted uint104 from uint256, reverting on
     * overflow (when the input is greater than largest uint104).
     *
     * Counterpart to Solidity's `uint104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toUint104(uint256 value) internal pure returns (uint104) {
        if (value > type(uint104).max) {
            revert SafeCastOverflowedUintDowncast(104, value);
        }
        return uint104(value);
    }

    /**
     * @dev Returns the downcasted uint96 from uint256, reverting on
     * overflow (when the input is greater than largest uint96).
     *
     * Counterpart to Solidity's `uint96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toUint96(uint256 value) internal pure returns (uint96) {
        if (value > type(uint96).max) {
            revert SafeCastOverflowedUintDowncast(96, value);
        }
        return uint96(value);
    }

    /**
     * @dev Returns the downcasted uint88 from uint256, reverting on
     * overflow (when the input is greater than largest uint88).
     *
     * Counterpart to Solidity's `uint88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toUint88(uint256 value) internal pure returns (uint88) {
        if (value > type(uint88).max) {
            revert SafeCastOverflowedUintDowncast(88, value);
        }
        return uint88(value);
    }

    /**
     * @dev Returns the downcasted uint80 from uint256, reverting on
     * overflow (when the input is greater than largest uint80).
     *
     * Counterpart to Solidity's `uint80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toUint80(uint256 value) internal pure returns (uint80) {
        if (value > type(uint80).max) {
            revert SafeCastOverflowedUintDowncast(80, value);
        }
        return uint80(value);
    }

    /**
     * @dev Returns the downcasted uint72 from uint256, reverting on
     * overflow (when the input is greater than largest uint72).
     *
     * Counterpart to Solidity's `uint72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toUint72(uint256 value) internal pure returns (uint72) {
        if (value > type(uint72).max) {
            revert SafeCastOverflowedUintDowncast(72, value);
        }
        return uint72(value);
    }

    /**
     * @dev Returns the downcasted uint64 from uint256, reverting on
     * overflow (when the input is greater than largest uint64).
     *
     * Counterpart to Solidity's `uint64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toUint64(uint256 value) internal pure returns (uint64) {
        if (value > type(uint64).max) {
            revert SafeCastOverflowedUintDowncast(64, value);
        }
        return uint64(value);
    }

    /**
     * @dev Returns the downcasted uint56 from uint256, reverting on
     * overflow (when the input is greater than largest uint56).
     *
     * Counterpart to Solidity's `uint56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toUint56(uint256 value) internal pure returns (uint56) {
        if (value > type(uint56).max) {
            revert SafeCastOverflowedUintDowncast(56, value);
        }
        return uint56(value);
    }

    /**
     * @dev Returns the downcasted uint48 from uint256, reverting on
     * overflow (when the input is greater than largest uint48).
     *
     * Counterpart to Solidity's `uint48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toUint48(uint256 value) internal pure returns (uint48) {
        if (value > type(uint48).max) {
            revert SafeCastOverflowedUintDowncast(48, value);
        }
        return uint48(value);
    }

    /**
     * @dev Returns the downcasted uint40 from uint256, reverting on
     * overflow (when the input is greater than largest uint40).
     *
     * Counterpart to Solidity's `uint40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toUint40(uint256 value) internal pure returns (uint40) {
        if (value > type(uint40).max) {
            revert SafeCastOverflowedUintDowncast(40, value);
        }
        return uint40(value);
    }

    /**
     * @dev Returns the downcasted uint32 from uint256, reverting on
     * overflow (when the input is greater than largest uint32).
     *
     * Counterpart to Solidity's `uint32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toUint32(uint256 value) internal pure returns (uint32) {
        if (value > type(uint32).max) {
            revert SafeCastOverflowedUintDowncast(32, value);
        }
        return uint32(value);
    }

    /**
     * @dev Returns the downcasted uint24 from uint256, reverting on
     * overflow (when the input is greater than largest uint24).
     *
     * Counterpart to Solidity's `uint24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toUint24(uint256 value) internal pure returns (uint24) {
        if (value > type(uint24).max) {
            revert SafeCastOverflowedUintDowncast(24, value);
        }
        return uint24(value);
    }

    /**
     * @dev Returns the downcasted uint16 from uint256, reverting on
     * overflow (when the input is greater than largest uint16).
     *
     * Counterpart to Solidity's `uint16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toUint16(uint256 value) internal pure returns (uint16) {
        if (value > type(uint16).max) {
            revert SafeCastOverflowedUintDowncast(16, value);
        }
        return uint16(value);
    }

    /**
     * @dev Returns the downcasted uint8 from uint256, reverting on
     * overflow (when the input is greater than largest uint8).
     *
     * Counterpart to Solidity's `uint8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toUint8(uint256 value) internal pure returns (uint8) {
        if (value > type(uint8).max) {
            revert SafeCastOverflowedUintDowncast(8, value);
        }
        return uint8(value);
    }

    /**
     * @dev Converts a signed int256 into an unsigned uint256.
     *
     * Requirements:
     *
     * - input must be greater than or equal to 0.
     */
    function toUint256(int256 value) internal pure returns (uint256) {
        if (value < 0) {
            revert SafeCastOverflowedIntToUint(value);
        }
        return uint256(value);
    }

    /**
     * @dev Returns the downcasted int248 from int256, reverting on
     * overflow (when the input is less than smallest int248 or
     * greater than largest int248).
     *
     * Counterpart to Solidity's `int248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toInt248(int256 value) internal pure returns (int248 downcasted) {
        downcasted = int248(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(248, value);
        }
    }

    /**
     * @dev Returns the downcasted int240 from int256, reverting on
     * overflow (when the input is less than smallest int240 or
     * greater than largest int240).
     *
     * Counterpart to Solidity's `int240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toInt240(int256 value) internal pure returns (int240 downcasted) {
        downcasted = int240(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(240, value);
        }
    }

    /**
     * @dev Returns the downcasted int232 from int256, reverting on
     * overflow (when the input is less than smallest int232 or
     * greater than largest int232).
     *
     * Counterpart to Solidity's `int232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toInt232(int256 value) internal pure returns (int232 downcasted) {
        downcasted = int232(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(232, value);
        }
    }

    /**
     * @dev Returns the downcasted int224 from int256, reverting on
     * overflow (when the input is less than smallest int224 or
     * greater than largest int224).
     *
     * Counterpart to Solidity's `int224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toInt224(int256 value) internal pure returns (int224 downcasted) {
        downcasted = int224(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(224, value);
        }
    }

    /**
     * @dev Returns the downcasted int216 from int256, reverting on
     * overflow (when the input is less than smallest int216 or
     * greater than largest int216).
     *
     * Counterpart to Solidity's `int216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toInt216(int256 value) internal pure returns (int216 downcasted) {
        downcasted = int216(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(216, value);
        }
    }

    /**
     * @dev Returns the downcasted int208 from int256, reverting on
     * overflow (when the input is less than smallest int208 or
     * greater than largest int208).
     *
     * Counterpart to Solidity's `int208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toInt208(int256 value) internal pure returns (int208 downcasted) {
        downcasted = int208(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(208, value);
        }
    }

    /**
     * @dev Returns the downcasted int200 from int256, reverting on
     * overflow (when the input is less than smallest int200 or
     * greater than largest int200).
     *
     * Counterpart to Solidity's `int200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toInt200(int256 value) internal pure returns (int200 downcasted) {
        downcasted = int200(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(200, value);
        }
    }

    /**
     * @dev Returns the downcasted int192 from int256, reverting on
     * overflow (when the input is less than smallest int192 or
     * greater than largest int192).
     *
     * Counterpart to Solidity's `int192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toInt192(int256 value) internal pure returns (int192 downcasted) {
        downcasted = int192(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(192, value);
        }
    }

    /**
     * @dev Returns the downcasted int184 from int256, reverting on
     * overflow (when the input is less than smallest int184 or
     * greater than largest int184).
     *
     * Counterpart to Solidity's `int184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toInt184(int256 value) internal pure returns (int184 downcasted) {
        downcasted = int184(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(184, value);
        }
    }

    /**
     * @dev Returns the downcasted int176 from int256, reverting on
     * overflow (when the input is less than smallest int176 or
     * greater than largest int176).
     *
     * Counterpart to Solidity's `int176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toInt176(int256 value) internal pure returns (int176 downcasted) {
        downcasted = int176(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(176, value);
        }
    }

    /**
     * @dev Returns the downcasted int168 from int256, reverting on
     * overflow (when the input is less than smallest int168 or
     * greater than largest int168).
     *
     * Counterpart to Solidity's `int168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toInt168(int256 value) internal pure returns (int168 downcasted) {
        downcasted = int168(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(168, value);
        }
    }

    /**
     * @dev Returns the downcasted int160 from int256, reverting on
     * overflow (when the input is less than smallest int160 or
     * greater than largest int160).
     *
     * Counterpart to Solidity's `int160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toInt160(int256 value) internal pure returns (int160 downcasted) {
        downcasted = int160(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(160, value);
        }
    }

    /**
     * @dev Returns the downcasted int152 from int256, reverting on
     * overflow (when the input is less than smallest int152 or
     * greater than largest int152).
     *
     * Counterpart to Solidity's `int152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toInt152(int256 value) internal pure returns (int152 downcasted) {
        downcasted = int152(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(152, value);
        }
    }

    /**
     * @dev Returns the downcasted int144 from int256, reverting on
     * overflow (when the input is less than smallest int144 or
     * greater than largest int144).
     *
     * Counterpart to Solidity's `int144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toInt144(int256 value) internal pure returns (int144 downcasted) {
        downcasted = int144(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(144, value);
        }
    }

    /**
     * @dev Returns the downcasted int136 from int256, reverting on
     * overflow (when the input is less than smallest int136 or
     * greater than largest int136).
     *
     * Counterpart to Solidity's `int136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toInt136(int256 value) internal pure returns (int136 downcasted) {
        downcasted = int136(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(136, value);
        }
    }

    /**
     * @dev Returns the downcasted int128 from int256, reverting on
     * overflow (when the input is less than smallest int128 or
     * greater than largest int128).
     *
     * Counterpart to Solidity's `int128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toInt128(int256 value) internal pure returns (int128 downcasted) {
        downcasted = int128(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(128, value);
        }
    }

    /**
     * @dev Returns the downcasted int120 from int256, reverting on
     * overflow (when the input is less than smallest int120 or
     * greater than largest int120).
     *
     * Counterpart to Solidity's `int120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toInt120(int256 value) internal pure returns (int120 downcasted) {
        downcasted = int120(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(120, value);
        }
    }

    /**
     * @dev Returns the downcasted int112 from int256, reverting on
     * overflow (when the input is less than smallest int112 or
     * greater than largest int112).
     *
     * Counterpart to Solidity's `int112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toInt112(int256 value) internal pure returns (int112 downcasted) {
        downcasted = int112(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(112, value);
        }
    }

    /**
     * @dev Returns the downcasted int104 from int256, reverting on
     * overflow (when the input is less than smallest int104 or
     * greater than largest int104).
     *
     * Counterpart to Solidity's `int104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toInt104(int256 value) internal pure returns (int104 downcasted) {
        downcasted = int104(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(104, value);
        }
    }

    /**
     * @dev Returns the downcasted int96 from int256, reverting on
     * overflow (when the input is less than smallest int96 or
     * greater than largest int96).
     *
     * Counterpart to Solidity's `int96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toInt96(int256 value) internal pure returns (int96 downcasted) {
        downcasted = int96(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(96, value);
        }
    }

    /**
     * @dev Returns the downcasted int88 from int256, reverting on
     * overflow (when the input is less than smallest int88 or
     * greater than largest int88).
     *
     * Counterpart to Solidity's `int88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toInt88(int256 value) internal pure returns (int88 downcasted) {
        downcasted = int88(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(88, value);
        }
    }

    /**
     * @dev Returns the downcasted int80 from int256, reverting on
     * overflow (when the input is less than smallest int80 or
     * greater than largest int80).
     *
     * Counterpart to Solidity's `int80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toInt80(int256 value) internal pure returns (int80 downcasted) {
        downcasted = int80(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(80, value);
        }
    }

    /**
     * @dev Returns the downcasted int72 from int256, reverting on
     * overflow (when the input is less than smallest int72 or
     * greater than largest int72).
     *
     * Counterpart to Solidity's `int72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toInt72(int256 value) internal pure returns (int72 downcasted) {
        downcasted = int72(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(72, value);
        }
    }

    /**
     * @dev Returns the downcasted int64 from int256, reverting on
     * overflow (when the input is less than smallest int64 or
     * greater than largest int64).
     *
     * Counterpart to Solidity's `int64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toInt64(int256 value) internal pure returns (int64 downcasted) {
        downcasted = int64(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(64, value);
        }
    }

    /**
     * @dev Returns the downcasted int56 from int256, reverting on
     * overflow (when the input is less than smallest int56 or
     * greater than largest int56).
     *
     * Counterpart to Solidity's `int56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toInt56(int256 value) internal pure returns (int56 downcasted) {
        downcasted = int56(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(56, value);
        }
    }

    /**
     * @dev Returns the downcasted int48 from int256, reverting on
     * overflow (when the input is less than smallest int48 or
     * greater than largest int48).
     *
     * Counterpart to Solidity's `int48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toInt48(int256 value) internal pure returns (int48 downcasted) {
        downcasted = int48(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(48, value);
        }
    }

    /**
     * @dev Returns the downcasted int40 from int256, reverting on
     * overflow (when the input is less than smallest int40 or
     * greater than largest int40).
     *
     * Counterpart to Solidity's `int40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toInt40(int256 value) internal pure returns (int40 downcasted) {
        downcasted = int40(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(40, value);
        }
    }

    /**
     * @dev Returns the downcasted int32 from int256, reverting on
     * overflow (when the input is less than smallest int32 or
     * greater than largest int32).
     *
     * Counterpart to Solidity's `int32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toInt32(int256 value) internal pure returns (int32 downcasted) {
        downcasted = int32(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(32, value);
        }
    }

    /**
     * @dev Returns the downcasted int24 from int256, reverting on
     * overflow (when the input is less than smallest int24 or
     * greater than largest int24).
     *
     * Counterpart to Solidity's `int24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toInt24(int256 value) internal pure returns (int24 downcasted) {
        downcasted = int24(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(24, value);
        }
    }

    /**
     * @dev Returns the downcasted int16 from int256, reverting on
     * overflow (when the input is less than smallest int16 or
     * greater than largest int16).
     *
     * Counterpart to Solidity's `int16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toInt16(int256 value) internal pure returns (int16 downcasted) {
        downcasted = int16(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(16, value);
        }
    }

    /**
     * @dev Returns the downcasted int8 from int256, reverting on
     * overflow (when the input is less than smallest int8 or
     * greater than largest int8).
     *
     * Counterpart to Solidity's `int8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toInt8(int256 value) internal pure returns (int8 downcasted) {
        downcasted = int8(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(8, value);
        }
    }

    /**
     * @dev Converts an unsigned uint256 into a signed int256.
     *
     * Requirements:
     *
     * - input must be less than or equal to maxInt256.
     */
    function toInt256(uint256 value) internal pure returns (int256) {
        // Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
        if (value > uint256(type(int256).max)) {
            revert SafeCastOverflowedUintToInt(value);
        }
        return int256(value);
    }

    /**
     * @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
     */
    function toUint(bool b) internal pure returns (uint256 u) {
        assembly ("memory-safe") {
            u := iszero(iszero(b))
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.20;

import {SafeCast} from "./SafeCast.sol";

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
        }
    }

    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return ternary(a > b, a, b);
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return ternary(a < b, a, b);
    }

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
            // Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
            // taking advantage of the most significant (or "sign" bit) in two's complement representation.
            // This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
            // the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
            int256 mask = n >> 255;

            // A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
            return uint256((n + mask) ^ mask);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)

pragma solidity ^0.8.20;

/**
 * @dev Helper library for emitting standardized panic codes.
 *
 * ```solidity
 * contract Example {
 *      using Panic for uint256;
 *
 *      // Use any of the declared internal constants
 *      function foo() { Panic.GENERIC.panic(); }
 *
 *      // Alternatively
 *      function foo() { Panic.panic(Panic.GENERIC); }
 * }
 * ```
 *
 * Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
 *
 * _Available since v5.1._
 */
// slither-disable-next-line unused-state
library Panic {
    /// @dev generic / unspecified error
    uint256 internal constant GENERIC = 0x00;
    /// @dev used by the assert() builtin
    uint256 internal constant ASSERT = 0x01;
    /// @dev arithmetic underflow or overflow
    uint256 internal constant UNDER_OVERFLOW = 0x11;
    /// @dev division or modulo by zero
    uint256 internal constant DIVISION_BY_ZERO = 0x12;
    /// @dev enum conversion error
    uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
    /// @dev invalid encoding in storage
    uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
    /// @dev empty array pop
    uint256 internal constant EMPTY_ARRAY_POP = 0x31;
    /// @dev array out of bounds access
    uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
    /// @dev resource error (too large allocation or too large array)
    uint256 internal constant RESOURCE_ERROR = 0x41;
    /// @dev calling invalid internal function
    uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;

    /// @dev Reverts with a panic code. Recommended to use with
    /// the internal constants with predefined codes.
    function panic(uint256 code) internal pure {
        assembly ("memory-safe") {
            mstore(0x00, 0x4e487b71)
            mstore(0x20, code)
            revert(0x1c, 0x24)
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.2.0) (utils/Strings.sol)

pragma solidity ^0.8.20;

import {Math} from "./math/Math.sol";
import {SafeCast} from "./math/SafeCast.sol";
import {SignedMath} from "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    using SafeCast for *;

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

    /**
     * @dev The `value` string doesn't fit in the specified `length`.
     */
    error StringsInsufficientHexLength(uint256 value, uint256 length);

    /**
     * @dev The string being parsed contains characters that are not in scope of the given base.
     */
    error StringsInvalidChar();

    /**
     * @dev The string being parsed is not a properly formatted address.
     */
    error StringsInvalidAddressFormat();

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            assembly ("memory-safe") {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                assembly ("memory-safe") {
                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        uint256 localValue = value;
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = HEX_DIGITS[localValue & 0xf];
            localValue >>= 4;
        }
        if (localValue != 0) {
            revert StringsInsufficientHexLength(value, length);
        }
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal
     * representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
     * representation, according to EIP-55.
     */
    function toChecksumHexString(address addr) internal pure returns (string memory) {
        bytes memory buffer = bytes(toHexString(addr));

        // hash the hex part of buffer (skip length + 2 bytes, length 40)
        uint256 hashValue;
        assembly ("memory-safe") {
            hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
        }

        for (uint256 i = 41; i > 1; --i) {
            // possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
            if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
                // case shift by xoring with 0x20
                buffer[i] ^= 0x20;
            }
            hashValue >>= 4;
        }
        return string(buffer);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }

    /**
     * @dev Parse a decimal string and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input) internal pure returns (uint256) {
        return parseUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, uint256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseUint} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseUintUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, uint256 value) {
        bytes memory buffer = bytes(input);

        uint256 result = 0;
        for (uint256 i = begin; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 9) return (false, 0);
            result *= 10;
            result += chr;
        }
        return (true, result);
    }

    /**
     * @dev Parse a decimal string and returns the value as a `int256`.
     *
     * Requirements:
     * - The string must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input) internal pure returns (int256) {
        return parseInt(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {
        (bool success, int256 value) = tryParseInt(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if
     * the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {
        return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);
    }

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

    /**
     * @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character or if the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, int256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseIntUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseInt} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseIntUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, int256 value) {
        bytes memory buffer = bytes(input);

        // Check presence of a negative sign.
        bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        bool positiveSign = sign == bytes1("+");
        bool negativeSign = sign == bytes1("-");
        uint256 offset = (positiveSign || negativeSign).toUint();

        (bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);

        if (absSuccess && absValue < ABS_MIN_INT256) {
            return (true, negativeSign ? -int256(absValue) : int256(absValue));
        } else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {
            return (true, type(int256).min);
        } else return (false, 0);
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input) internal pure returns (uint256) {
        return parseHexUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseHexUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an
     * invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, uint256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseHexUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseHexUint} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseHexUintUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, uint256 value) {
        bytes memory buffer = bytes(input);

        // skip 0x prefix if present
        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 offset = hasPrefix.toUint() * 2;

        uint256 result = 0;
        for (uint256 i = begin + offset; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 15) return (false, 0);
            result *= 16;
            unchecked {
                // Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).
                // This guaratees that adding a value < 16 will not cause an overflow, hence the unchecked.
                result += chr;
            }
        }
        return (true, result);
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as an `address`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input) internal pure returns (address) {
        return parseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {
        (bool success, address value) = tryParseAddress(input, begin, end);
        if (!success) revert StringsInvalidAddressFormat();
        return value;
    }

    /**
     * @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly
     * formatted address. See {parseAddress} requirements.
     */
    function tryParseAddress(string memory input) internal pure returns (bool success, address value) {
        return tryParseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly
     * formatted address. See {parseAddress} requirements.
     */
    function tryParseAddress(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, address value) {
        if (end > bytes(input).length || begin > end) return (false, address(0));

        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 expectedLength = 40 + hasPrefix.toUint() * 2;

        // check that input is the correct length
        if (end - begin == expectedLength) {
            // length guarantees that this does not overflow, and value is at most type(uint160).max
            (bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);
            return (s, address(uint160(v)));
        } else {
            return (false, address(0));
        }
    }

    function _tryParseChr(bytes1 chr) private pure returns (uint8) {
        uint8 value = uint8(chr);

        // Try to parse `chr`:
        // - Case 1: [0-9]
        // - Case 2: [a-f]
        // - Case 3: [A-F]
        // - otherwise not supported
        unchecked {
            if (value > 47 && value < 58) value -= 48;
            else if (value > 96 && value < 103) value -= 87;
            else if (value > 64 && value < 71) value -= 55;
            else return type(uint8).max;
        }

        return value;
    }

    /**
     * @dev Reads a bytes32 from a bytes array without bounds checking.
     *
     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
     * assembly block as such would prevent some optimizations.
     */
    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
        // This is not memory safe in the general case, but all calls to this private function are within bounds.
        assembly ("memory-safe") {
            value := mload(add(buffer, add(0x20, offset)))
        }
    }
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.24;

/**
 * @title IAddressManager
 * @author taiko.xyz
 * @notice Interface for AddressManager contract discovery
 */
interface IAddressManager {
    function getAddress(string memory contractName) external view returns (address);

    function tryGetAddress(string memory contractName) external view returns (bool found, address addr);

    function setAddress(string memory contractName, address contractAddress) external;

    function hasAddress(string memory contractName) external view returns (bool);
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.24;

import "./IAddressManager.sol";

/**
 * @title IGameHub
 * @author taiko.xyz
 * @notice Interface for the core GameHub contract
 * @dev Central session management system for blockchain games
 */
interface IGameHub {
    // ============================================
    // Data Structures
    // ============================================

    /**
     * @notice Information about a registered game
     * @param gameContract Address of the game contract
     * @param name Human-readable name of the game
     * @param category Game category
     * @param minPlayers Minimum players required
     * @param maxPlayers Maximum players allowed
     * @param isActive Whether the game is currently active
     * @param developer Address of the game developer
     * @param registrationDate When the game was registered
     */
    struct GameInfo {
        address gameContract;
        string name;
        string category;
        uint256 minPlayers;
        uint256 maxPlayers;
        bool isActive;
        address developer;
        uint256 registrationDate;
    }

    /**
     * @notice A game session
     * @param sessionId Unique identifier for the session
     * @param gameContract Address of the game contract
     * @param players Array of player addresses
     * @param winner Address of the winner (address(0) if no winner)
     * @param startTime When the session started (block.timestamp)
     * @param endTime When the session ended (0 if not ended)
     * @param ttl Time-to-live in seconds
     * @param ended Whether the session has ended
     * @param gameData Game-specific data storage
     * @param competitionId Competition ID (bytes32(0) for regular games)
     */
    struct GameSession {
        uint256 sessionId;
        address gameContract;
        address[] players;
        address winner;
        uint256 startTime;
        uint256 endTime;
        uint256 ttl;
        bool ended;
        bytes32 gameData;
        bytes32 competitionId;
    }

    // ============================================
    // Events
    // ============================================

    /// @notice Emitted when a game is whitelisted
    event GameWhitelisted(address indexed gameContract, string name, address indexed developer);

    /// @notice Emitted when a game is removed from whitelist
    event GameRemoved(address indexed gameContract);

    /// @notice Emitted when a game's status is updated
    event GameStatusUpdated(address indexed gameContract, bool isActive);

    /// @notice Emitted when a player is verified
    event PlayerVerified(address indexed player);

    /// @notice Emitted when a game session starts
    event GameSessionStarted(
        uint256 indexed sessionId,
        address indexed gameContract,
        address[] players,
        uint256 ttl,
        bytes32 indexed competitionId
    );

    /// @notice Emitted when a game session ends with different reasons
    event GameSessionCompleted(uint256 indexed sessionId, address indexed winner, uint256 duration, string reason);

    /// @notice Emitted when a session is cleaned up by admin/owner
    event GameSessionCleaned(uint256 indexed sessionId, address indexed cleanedBy, bool isAdmin, bool isGameOwner);

    /// @notice Emitted when a game is paused/unpaused
    event GamePaused(address indexed gameContract, bool paused);

    /// @notice Emitted when XP processing fails (non-critical)
    event ExperienceProcessingFailed(address indexed player, address indexed gameContract, bool isWin, bytes reason);

    /// @notice Emitted when emergency pause is toggled
    event EmergencyPauseToggled(bool paused);

    /// @notice Emitted when a session is emergency ended
    event EmergencySessionEnded(uint256 indexed sessionId);

    // ============================================
    // Core Functions (Moved to SessionManager)
    // ============================================
    // Note: Session management functions have been moved to SessionManagerUpgradeable

    // ============================================
    // View Functions
    // ============================================

    /**
     * @notice Checks if a game is whitelisted
     * @param game The game contract address
     * @return True if the game is whitelisted
     */
    function isWhitelistedGame(address game) external view returns (bool);

    /**
     * @notice Gets information about a game
     * @param game The game contract address
     * @return GameInfo struct with game details
     */
    function getGameInfo(address game) external view returns (GameInfo memory);
    function getGameDetails(address game) external view returns (bool isWhitelisted, GameInfo memory info);


    /**
     * @notice Verifies if a player has a valid profile
     * @param player The player address
     * @return True if the player is verified
     */
    function verifyPlayer(address player) external view returns (bool);

    /**
     * @notice Checks if a player is eligible to join a game
     * @param player The player address
     * @param game The game contract address
     * @return True if the player is eligible
     */
    function checkPlayerEligibility(address player, address game) external view returns (bool);


    // ============================================
    // Admin Functions
    // ============================================

    /**
     * @notice Whitelists a game
     * @param game The game contract address
     * @param info The game information
     */
    function whitelistGame(address game, GameInfo calldata info) external;

    /**
     * @notice Removes a game from whitelist
     * @param game The game contract address
     */
    function removeGameFromWhitelist(address game) external;

    /**
     * @notice Updates a game's active status
     * @param game The game contract address
     * @param isActive The new active status
     */
    function updateGameStatus(address game, bool isActive) external;

    /**
     * @notice Pauses/unpauses a game
     * @param game The game contract address
     * @param paused The pause status
     */
    function pauseGame(address game, bool paused) external;

    /**
     * @notice Sets emergency pause for the entire system
     * @param paused The pause status
     */
    function setEmergencyPause(bool paused) external;


    /**
     * @notice Marks a signature as used (replay protection)
     * @param signatureHash The hash of the signature
     */
    function markSignatureUsed(bytes32 signatureHash) external;

    /**
     * @notice Gets the AddressManager contract
     * @return The AddressManager contract
     */
    function addressManager() external view returns (IAddressManager);
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.24;

import "./IGameHub.sol";

/**
 * @title IGameHubRouter
 * @author taiko.xyz
 * @notice Interface for the GameHub Router contract
 * @dev Authentication and routing layer for all game interactions
 */
interface IGameHubRouter {
    // ============================================
    // Events
    // ============================================

    /// @notice Emitted when the GameHub address is updated
    event GameHubUpdated(address indexed oldGameHub, address indexed newGameHub);

    /// @notice Emitted when the SessionManager address is updated
    event SessionManagerUpdated(address indexed oldSessionManager, address indexed newSessionManager);

    /// @notice Emitted when the auth module is updated
    event AuthModuleUpdated(address indexed oldModule, address indexed newModule);

    // ============================================
    // Router Functions
    // ============================================

    /**
     * @notice Starts a game session through authentication
     * @dev Verifies authentication before forwarding to GameHub
     * @param game The game contract address
     * @param players Array of player addresses
     * @param ttl Time-to-live in seconds
     * @param gameData Game-specific initialization data
     * @param authProof Authentication proof for the first player
     * @return sessionId The created session ID
     */
    function startGameSession(
        address game,
        address[] calldata players,
        uint256 ttl,
        bytes32 gameData,
        bytes calldata authProof
    ) external returns (uint256 sessionId);

    /**
     * @notice Starts a game session with competition support
     * @param game The game contract address
     * @param players Array of player addresses
     * @param ttl Time-to-live in seconds
     * @param gameData Game-specific initialization data
     * @param competitionId Competition identifier (bytes32(0) for regular games)
     * @param authProof Authentication proof for the first player
     * @return sessionId The created session ID
     */
    function startCompetitionGameSession(
        address game,
        address[] calldata players,
        uint256 ttl,
        bytes32 gameData,
        bytes32 competitionId,
        bytes calldata authProof
    ) external returns (uint256 sessionId);

    /**
     * @notice Ends a game session with signature verification
     * @dev Verifies game result signature before forwarding to GameHub
     * @param sessionId The session to end
     * @param player The player ending the session
     * @param winner The winner address
     * @param resultData Game-specific result data
     * @param gameSignature Signature from the game
     */
    function endGameSessionWithSignature(
        uint256 sessionId,
        address player,
        address winner,
        bytes32 resultData,
        bytes calldata gameSignature
    ) external;

    /**
     * @notice Executes a game action with authentication
     * @dev Verifies action signature before forwarding to GameHub
     * @param game The game contract address
     * @param sessionId The session ID
     * @param actionData The encoded action data
     * @param signature The action signature
     */
    function executeGameAction(address game, uint256 sessionId, bytes calldata actionData, bytes calldata signature)
        external;

    // ============================================
    // Admin Functions
    // ============================================

    /**
     * @notice Updates the auth module
     * @param newAuthModule The new auth module address
     */
    function setAuthModule(address newAuthModule) external;

    /**
     * @notice Updates the GameHub contract
     * @param newGameHub The new GameHub address
     */
    function setGameHub(address newGameHub) external;

    // ============================================
    // Convenience Functions (Proxy to GameHub)
    // ============================================

    /**
     * @notice Gets the current GameHub address
     * @return The GameHub contract address
     */
    function gameHub() external view returns (address);

    /**
     * @notice Gets game information (proxy to GameHub)
     * @param game The game contract address
     * @return GameInfo struct
     */
    function getGameInfo(address game) external view returns (IGameHub.GameInfo memory);

    /**
     * @notice Gets session information (proxy to GameHub)
     * @param sessionId The session ID
     * @return GameSession struct
     */
    function getSession(uint256 sessionId) external view returns (IGameHub.GameSession memory);

    /**
     * @notice Checks player eligibility (proxy to GameHub)
     * @param player The player address
     * @param game The game contract address
     * @return True if eligible
     */
    function checkPlayerEligibility(address player, address game) external view returns (bool);

    /**
     * @notice Verifies player (proxy to GameHub)
     * @param player The player address
     * @return True if verified
     */
    function verifyPlayer(address player) external view returns (bool);

    /**
     * @notice Gets player's current session (proxy to GameHub)
     * @param player The player address
     * @return The session ID
     */
    function getPlayerCurrentSession(address player) external view returns (uint256);

    /**
     * @notice Checks if session is expired (proxy to GameHub)
     * @param sessionId The session ID
     * @return True if expired
     */
    function isSessionExpired(uint256 sessionId) external view returns (bool);

    /**
     * @notice Checks if game is whitelisted (proxy to GameHub)
     * @param game The game contract address
     * @return True if whitelisted
     */
    function isWhitelistedGame(address game) external view returns (bool);
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.24;

interface ITrailblazerGame {
    // Core game information
    function getGameInfo() external view returns (
        string memory name,
        string memory category,
        uint256 minPlayers,
        uint256 maxPlayers,
        string memory version
    );

    // Authorized signer for game results
    function getGameSigner() external view returns (address);

    // Game status
    function isGameActive() external view returns (bool);

    // Session callbacks
    function onSessionStarted(
        uint256 sessionId,
        address[] calldata players,
        bytes32 gameData
    ) external;

    function onSessionEnded(
        uint256 sessionId,
        address winner,
        bytes32 resultData
    ) external;

    // Validation functions
    function validateSessionStart(
        address[] calldata players,
        bytes32 gameData
    ) external view returns (bool isValid, string memory reason);

    function validateSessionEnd(
        uint256 sessionId,
        address winner,
        bytes32 resultData
    ) external view returns (bool isValid, string memory reason);
}

{
  "optimizer": {
    "enabled": true,
    "runs": 1000
  },
  "evmVersion": "paris",
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"name":"ECDSAInvalidSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"ECDSAInvalidSignatureLength","type":"error"},{"inputs":[{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"ECDSAInvalidSignatureS","type":"error"},{"inputs":[{"internalType":"string","name":"preliminaryGameId","type":"string"}],"name":"GameAlreadyExists","type":"error"},{"inputs":[{"internalType":"uint256","name":"onChainGameId","type":"uint256"}],"name":"GameDoesNotExist","type":"error"},{"inputs":[{"internalType":"uint256","name":"onChainGameId","type":"uint256"}],"name":"GameNotActive","type":"error"},{"inputs":[],"name":"InvalidInitialization","type":"error"},{"inputs":[],"name":"InvalidServerSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"onChainGameId","type":"uint256"},{"internalType":"address","name":"caller","type":"address"}],"name":"NotGamePlayer","type":"error"},{"inputs":[],"name":"NotInitializing","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[{"internalType":"uint256","name":"onChainGameId","type":"uint256"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"PayoutFailed","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[],"name":"UnauthorizedForSessionManagement","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"newAdmin","type":"address"}],"name":"AdminAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"removedAdmin","type":"address"}],"name":"AdminRemoved","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"sender","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"DepositReceived","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"string","name":"preliminaryGameId","type":"string"},{"indexed":true,"internalType":"uint256","name":"onChainGameId","type":"uint256"},{"indexed":true,"internalType":"address","name":"player","type":"address"},{"indexed":false,"internalType":"uint256","name":"betAmount","type":"uint256"},{"indexed":false,"internalType":"bytes32","name":"gameSeedHash","type":"bytes32"}],"name":"GameCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"onChainGameId","type":"uint256"},{"indexed":false,"internalType":"string","name":"gameSeed","type":"string"},{"indexed":false,"internalType":"string","name":"gameState","type":"string"}],"name":"GameSeedAndStateSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"onChainGameId","type":"uint256"},{"indexed":false,"internalType":"enum CashOrCrashTrailblazer.GameStatus","name":"status","type":"uint8"}],"name":"GameStatusUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint64","name":"version","type":"uint64"}],"name":"Initialized","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"onChainGameId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"},{"indexed":true,"internalType":"address","name":"recipient","type":"address"}],"name":"PayoutSent","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"recipient","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"},{"indexed":true,"internalType":"address","name":"admin","type":"address"}],"name":"ReferralPaid","type":"event"},{"inputs":[{"internalType":"address","name":"newAdmin","type":"address"}],"name":"addAdmin","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"preliminaryGameId","type":"string"},{"internalType":"bytes32","name":"gameSeedHash","type":"bytes32"},{"internalType":"string","name":"algoVersion","type":"string"},{"internalType":"string","name":"gameConfig","type":"string"},{"internalType":"uint256","name":"deadline","type":"uint256"},{"internalType":"bytes","name":"serverSignature","type":"bytes"}],"name":"createGame","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"gameCounter","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"gameHubRouter","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"games","outputs":[{"internalType":"uint256","name":"createdAt","type":"uint256"},{"internalType":"address","name":"player","type":"address"},{"internalType":"uint256","name":"betAmount","type":"uint256"},{"internalType":"enum CashOrCrashTrailblazer.GameStatus","name":"status","type":"uint8"},{"internalType":"uint256","name":"payoutAmount","type":"uint256"},{"internalType":"bytes32","name":"gameSeedHash","type":"bytes32"},{"internalType":"string","name":"gameSeed","type":"string"},{"internalType":"string","name":"algoVersion","type":"string"},{"internalType":"string","name":"gameConfig","type":"string"},{"internalType":"string","name":"gameState","type":"string"},{"internalType":"uint256","name":"sessionId","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"onChainGameId","type":"uint256"}],"name":"getGameDetails","outputs":[{"components":[{"internalType":"uint256","name":"createdAt","type":"uint256"},{"internalType":"address","name":"player","type":"address"},{"internalType":"uint256","name":"betAmount","type":"uint256"},{"internalType":"enum CashOrCrashTrailblazer.GameStatus","name":"status","type":"uint8"},{"internalType":"uint256","name":"payoutAmount","type":"uint256"},{"internalType":"bytes32","name":"gameSeedHash","type":"bytes32"},{"internalType":"string","name":"gameSeed","type":"string"},{"internalType":"string","name":"algoVersion","type":"string"},{"internalType":"string","name":"gameConfig","type":"string"},{"internalType":"string","name":"gameState","type":"string"},{"internalType":"uint256","name":"sessionId","type":"uint256"}],"internalType":"struct CashOrCrashTrailblazer.Game","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getGameInfo","outputs":[{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"category","type":"string"},{"internalType":"uint256","name":"minPlayers","type":"uint256"},{"internalType":"uint256","name":"maxPlayers","type":"uint256"},{"internalType":"string","name":"version","type":"string"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"getGameSigner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"preliminaryGameId","type":"string"}],"name":"getOnChainGameId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"_messagePrefix","type":"string"},{"internalType":"address","name":"_signerAddress","type":"address"}],"name":"initialize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"isActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"isAdmin","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isGameActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"messagePrefix","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"sessionId","type":"uint256"},{"internalType":"address","name":"winner","type":"address"},{"internalType":"bytes32","name":"resultData","type":"bytes32"}],"name":"onSessionEnded","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"sessionId","type":"uint256"},{"internalType":"address[]","name":"players","type":"address[]"},{"internalType":"bytes32","name":"gameData","type":"bytes32"}],"name":"onSessionStarted","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"","type":"string"}],"name":"preliminaryToOnChainId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"adminToRemove","type":"address"}],"name":"removeAdmin","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"sessionToOnChainId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bool","name":"_isGameActive","type":"bool"}],"name":"setGameActive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newCounter","type":"uint256"}],"name":"setGameCounter","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_gameHubRouter","type":"address"}],"name":"setGameHubRouter","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"onChainGameId","type":"uint256"},{"internalType":"string","name":"gameSeed","type":"string"},{"internalType":"string","name":"gameState","type":"string"}],"name":"setGameSeedAndState","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"signerAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"sessionId","type":"uint256"},{"internalType":"address","name":"winner","type":"address"},{"internalType":"bytes32","name":"resultData","type":"bytes32"}],"name":"validateSessionEnd","outputs":[{"internalType":"bool","name":"isValid","type":"bool"},{"internalType":"string","name":"reason","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address[]","name":"players","type":"address[]"},{"internalType":"bytes32","name":"gameData","type":"bytes32"}],"name":"validateSessionStart","outputs":[{"internalType":"bool","name":"isValid","type":"bool"},{"internalType":"string","name":"reason","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"address payable","name":"recipient","type":"address"}],"name":"withdrawFunds","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

608060405234801561001057600080fd5b5061399f806100206000396000f3fe6080604052600436106101d05760003560e01c8063648e8ff7116100f757806391da2b3d11610095578063c8bd926011610064578063c8bd92601461067a578063ccc0897414610698578063eb8045be146106b8578063f2fde38b146106e557600080fd5b806391da2b3d146105e057806396696da114610602578063a24e50f914610622578063a40d8f481461064257600080fd5b8063744bfe61116100d1578063744bfe61146105435780637ab4339d146105635780637c7dbe5f146105835780638da5cb5b146105a357600080fd5b8063648e8ff7146104ee578063704802751461050e578063715018a61461052e57600080fd5b806322f3e2d41161016f5780634135cfea1161013e5780634135cfea146104565780634a7e1a19146104765780635b7633d0146104ae57806362ce21e9146104ce57600080fd5b806322f3e2d4146103b357806324d7806c146103d45780632e0be39a1461040457806331f3ad2d1461042857600080fd5b8063117a5b90116101ab578063117a5b90146102765780631746bd1b146102ad5780631785f53c146103665780631b31abda1461038657600080fd5b80621308d81461021157806302153e29146102265780630c0ef2b01461024657600080fd5b3661020c5760405134815233907f9936746a4565f9766fa768f88f56a7487c78780ac179562773d1c75c5269537e9060200160405180910390a2005b600080fd5b61022461021f366004612daa565b610705565b005b34801561023257600080fd5b50610224610241366004612e84565b610ae5565b34801561025257600080fd5b50600254600160a01b900460ff165b60405190151581526020015b60405180910390f35b34801561028257600080fd5b50610296610291366004612e84565b610b44565b60405161026d9b9a99989796959493929190612f25565b3480156102b957600080fd5b50604080518082018252600b81527f436173684f72437261736800000000000000000000000000000000000000000060208083019190915282518084018452600881527f53747261746567790000000000000000000000000000000000000000000000008183015283518085018552600581527f312e302e3000000000000000000000000000000000000000000000000000000092810192909252925161026d9391600191829190612fc5565b34801561037257600080fd5b5061022461038136600461302b565b610dcb565b34801561039257600080fd5b506103a66103a1366004612e84565b610f0f565b60405161026d9190613048565b3480156103bf57600080fd5b5060025461026190600160a01b900460ff1681565b3480156103e057600080fd5b506102616103ef36600461302b565b60036020526000908152604090205460ff1681565b34801561041057600080fd5b5061041a60005481565b60405190815260200161026d565b34801561043457600080fd5b50610448610443366004613174565b61128f565b60405161026d9291906131c0565b34801561046257600080fd5b506102246104713660046131e3565b61149a565b34801561048257600080fd5b50600554610496906001600160a01b031681565b6040516001600160a01b03909116815260200161026d565b3480156104ba57600080fd5b50600254610496906001600160a01b031681565b3480156104da57600080fd5b506102246104e936600461325d565b6115c1565b3480156104fa57600080fd5b5061022461050936600461302b565b611a3b565b34801561051a57600080fd5b5061022461052936600461302b565b611ac8565b34801561053a57600080fd5b50610224611bdb565b34801561054f57600080fd5b5061022461055e3660046132b0565b611bef565b34801561056f57600080fd5b5061022461057e366004613383565b611dc6565b34801561058f57600080fd5b5061044861059e3660046133ca565b611f9a565b3480156105af57600080fd5b507f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300546001600160a01b0316610496565b3480156105ec57600080fd5b506105f56120fa565b60405161026d9190613402565b34801561060e57600080fd5b5061041a61061d366004613415565b612188565b34801561062e57600080fd5b5061022461063d3660046133ca565b6121b4565b34801561064e57600080fd5b5061041a61065d366004613457565b805160208183018101805160048252928201919093012091525481565b34801561068657600080fd5b506002546001600160a01b0316610496565b3480156106a457600080fd5b506102246106b336600461348c565b61261a565b3480156106c457600080fd5b5061041a6106d3366004612e84565b60076020526000908152604090205481565b3480156106f157600080fd5b5061022461070036600461302b565b612640565b8242111561075a5760405162461bcd60e51b815260206004820152601160248201527f5369676e6174757265206578706972656400000000000000000000000000000060448201526064015b60405180910390fd5b600034116107aa5760405162461bcd60e51b815260206004820152601b60248201527f42657420616d6f756e74206d75737420626520706f73697469766500000000006044820152606401610751565b600060016040516020016107be91906134e8565b60408051601f19818403018152908290526107ef918d908d908d908d908d908d908d90339034908f906020016135ac565b604051602081830303815290604052805190602001209050610812818484612697565b60048b8b604051610824929190613632565b908152602001604051809103902054600014610870578a8a6040517f106cfcb1000000000000000000000000000000000000000000000000000000008152600401610751929190613642565b6001600080828254610882919061366c565b9091555050600054604051819060049061089f908f908f90613632565b908152602001604051809103902081905550604051806101600160405280428152602001336001600160a01b03168152602001348152602001600060038111156108eb576108eb612e9d565b8152602001600081526020018b81526020016040518060200160405280600081525081526020018a8a8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250505090825250604080516020601f8b0181900481028201810190925289815291810191908a908a908190840183828082843760009201829052509385525050604080516020808201835284825280860191909152938101839052858352600684529182902084518155928401516001808501805473ffffffffffffffffffffffffffffffffffffffff19166001600160a01b0390931692909217909155918401516002840155506060830151600380840180549293909260ff1916918490811115610a1257610a12612e9d565b02179055506080820151600482015560a0820151600582015560c08201516006820190610a3f90826136d0565b5060e08201516007820190610a5490826136d0565b506101008201516008820190610a6a90826136d0565b506101208201516009820190610a8090826136d0565b5061014082015181600a0155905050336001600160a01b0316817f5ab4782178ec00656b6f3f3f73d1739ea9d5cba22c641e4b20767fbb571609438e8e348f604051610acf9493929190613790565b60405180910390a3505050505050505050505050565b610aed612752565b600054811015610b3f5760405162461bcd60e51b815260206004820152601b60248201527f43616e6e6f742064656372656173652067616d65436f756e74657200000000006044820152606401610751565b600055565b6006602081905260009182526040909120805460018201546002830154600384015460048501546005860154968601805495976001600160a01b0390951696939560ff9093169491939192610b98906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610bc4906134ae565b8015610c115780601f10610be657610100808354040283529160200191610c11565b820191906000526020600020905b815481529060010190602001808311610bf457829003601f168201915b505050505090806007018054610c26906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610c52906134ae565b8015610c9f5780601f10610c7457610100808354040283529160200191610c9f565b820191906000526020600020905b815481529060010190602001808311610c8257829003601f168201915b505050505090806008018054610cb4906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610ce0906134ae565b8015610d2d5780601f10610d0257610100808354040283529160200191610d2d565b820191906000526020600020905b815481529060010190602001808311610d1057829003601f168201915b505050505090806009018054610d42906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610d6e906134ae565b8015610dbb5780601f10610d9057610100808354040283529160200191610dbb565b820191906000526020600020905b815481529060010190602001808311610d9e57829003601f168201915b50505050509080600a015490508b565b610dd3612752565b6001600160a01b03811660009081526003602052604090205460ff16610e3b5760405162461bcd60e51b815260206004820152600c60248201527f4e6f7420616e2061646d696e00000000000000000000000000000000000000006044820152606401610751565b7f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300546001600160a01b03166001600160a01b0316816001600160a01b031603610ec65760405162461bcd60e51b815260206004820152601360248201527f43616e6e6f742072656d6f7665206f776e6572000000000000000000000000006044820152606401610751565b6001600160a01b038116600081815260036020526040808220805460ff19169055517fa3b62bc36326052d97ea62d63c3d60308ed4c3ea8ac079dd8499f1e9c4f80c0f9190a250565b610f6f60408051610160810182526000808252602082018190529181018290529060608201908152602001600081526020016000801916815260200160608152602001606081526020016060815260200160608152602001600081525090565b6000828152600660205260409020600101546001600160a01b0316610faa576040516337d7bbf560e11b815260048101839052602401610751565b6000828152600660209081526040918290208251610160810184528154815260018201546001600160a01b031692810192909252600281015492820192909252600380830154919291606084019160ff9091169081111561100d5761100d612e9d565b600381111561101e5761101e612e9d565b81526020016004820154815260200160058201548152602001600682018054611046906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611072906134ae565b80156110bf5780601f10611094576101008083540402835291602001916110bf565b820191906000526020600020905b8154815290600101906020018083116110a257829003601f168201915b505050505081526020016007820180546110d8906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611104906134ae565b80156111515780601f1061112657610100808354040283529160200191611151565b820191906000526020600020905b81548152906001019060200180831161113457829003601f168201915b5050505050815260200160088201805461116a906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611196906134ae565b80156111e35780601f106111b8576101008083540402835291602001916111e3565b820191906000526020600020905b8154815290600101906020018083116111c657829003601f168201915b505050505081526020016009820180546111fc906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611228906134ae565b80156112755780601f1061124a57610100808354040283529160200191611275565b820191906000526020600020905b81548152906001019060200180831161125857829003601f168201915b50505050508152602001600a820154815250509050919050565b60006060600061129e846127c6565b9050600185146112e757505060408051808201909152601781527f4f6e6c79206f6e6520706c6179657220616c6c6f776564000000000000000000602082015260009150611492565b60006004826040516112f991906137b7565b9081526020016040518091039020549050806000036113555760006040518060400160405280600e81526020017f47616d65206e6f7420666f756e64000000000000000000000000000000000000815250935093505050611492565b60008181526006602052604081209060038083015460ff169081111561137d5761137d612e9d565b146113a95760006040518060600160405280602281526020016139486022913994509450505050611492565b60018101546001600160a01b03166113f55760006040518060400160405280601381526020017211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b81525094509450505050611492565b87876000818110611408576114086137d3565b905060200201602081019061141d919061302b565b60018201546001600160a01b039081169116146114785760006040518060400160405280601581526020017f506c6179657220646f6573206e6f74206d61746368000000000000000000000081525094509450505050611492565b600160405180602001604052806000815250945094505050505b935093915050565b3360009081526003602052604090205460ff1661151f5760405162461bcd60e51b815260206004820152602760248201527f4f6e6c792061646d696e732063616e207365742067616d65207365656420616e60448201527f64207374617465000000000000000000000000000000000000000000000000006064820152608401610751565b600085815260066020526040902060018101546001600160a01b031661155b576040516337d7bbf560e11b815260048101879052602401610751565b6006810161156a8587836137e9565b506009810161157a8385836137e9565b50857f9ef1b877551ca42458afa86d5a4c36a97e103e47f9638b55deb2ec6631c675b3868686866040516115b194939291906138aa565b60405180910390a2505050505050565b6005546040805163d1d27cf960e01b815290516000926001600160a01b03169163d1d27cf99160048083019260209291908290030181865afa15801561160b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061162f91906138dc565b90506000816001600160a01b0316633ab76e9f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611671573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061169591906138dc565b60405163bf40fac160e01b815260206004820152600f60248201527f53455353494f4e5f4d414e41474552000000000000000000000000000000000060448201529091506000906001600160a01b0383169063bf40fac190606401602060405180830381865afa15801561170d573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061173191906138dc565b9050336001600160a01b038416148015906117555750336001600160a01b03821614155b801561176c57506002546001600160a01b03163314155b1561178a5760405163793e59cd60e01b815260040160405180910390fd5b6000611795856127c6565b905060006004826040516117a991906137b7565b90815260200160405180910390205490508060000361180a5760405162461bcd60e51b815260206004820152600e60248201527f47616d65206e6f7420666f756e640000000000000000000000000000000000006044820152606401610751565b60008181526006602052604081209060038083015460ff169081111561183257611832612e9d565b146118a55760405162461bcd60e51b815260206004820152602260248201527f47616d65206e6f742063726561746564206f7220616c7265616479206163746960448201527f76650000000000000000000000000000000000000000000000000000000000006064820152608401610751565b60018101546001600160a01b03166118f55760405162461bcd60e51b815260206004820152601360248201527211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b6044820152606401610751565b600188146119455760405162461bcd60e51b815260206004820152601760248201527f4f6e6c79206f6e6520706c6179657220616c6c6f7765640000000000000000006044820152606401610751565b88886000818110611958576119586137d3565b905060200201602081019061196d919061302b565b60018201546001600160a01b039081169116146119cc5760405162461bcd60e51b815260206004820152601560248201527f506c6179657220646f6573206e6f74206d6174636800000000000000000000006044820152606401610751565b60038101805460ff19166001908117909155600a82018b905560008b815260076020526040908190208490555183917f4e27b06662347b2bd7ed6e8bde0a4b793dae7d7d05b102ef743cbd9c8d824e4e91611a2791906138f9565b60405180910390a250505050505050505050565b611a43612752565b6001600160a01b038116611a995760405162461bcd60e51b815260206004820152601f60248201527f496e76616c69642067616d652068756220726f757465722061646472657373006044820152606401610751565b6005805473ffffffffffffffffffffffffffffffffffffffff19166001600160a01b0392909216919091179055565b611ad0612752565b6001600160a01b038116611b265760405162461bcd60e51b815260206004820152601560248201527f496e76616c69642061646d696e206164647265737300000000000000000000006044820152606401610751565b6001600160a01b03811660009081526003602052604090205460ff1615611b8f5760405162461bcd60e51b815260206004820152600d60248201527f416c72656164792061646d696e000000000000000000000000000000000000006044820152606401610751565b6001600160a01b038116600081815260036020526040808220805460ff19166001179055517f44d6d25963f097ad14f29f06854a01f575648a1ef82f30e562ccd3889717e3399190a250565b611be3612752565b611bed6000612945565b565b611bf7612752565b611bff6129c3565b60008211611c4f5760405162461bcd60e51b815260206004820181905260248201527f576974686472617720616d6f756e74206d75737420626520706f7369746976656044820152606401610751565b6001600160a01b038116611ca55760405162461bcd60e51b815260206004820152601960248201527f496e76616c696420726563697069656e742061646472657373000000000000006044820152606401610751565b47821115611cf55760405162461bcd60e51b815260206004820152601d60248201527f496e73756666696369656e7420636f6e74726163742062616c616e63650000006044820152606401610751565b6000816001600160a01b03168360405160006040518083038185875af1925050503d8060008114611d42576040519150601f19603f3d011682016040523d82523d6000602084013e611d47565b606091505b5050905080611d985760405162461bcd60e51b815260206004820152601160248201527f5769746864726177616c206661696c65640000000000000000000000000000006044820152606401610751565b50611dc260017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00805468010000000000000000810460ff16159067ffffffffffffffff16600081158015611e115750825b905060008267ffffffffffffffff166001148015611e2e5750303b155b905081158015611e3c575080155b15611e73576040517ff92ee8a900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b845467ffffffffffffffff191660011785558315611ea757845468ff00000000000000001916680100000000000000001785555b611eb033612a4c565b611eb8612a5d565b600080556002805460ff60a01b1916600160a01b1790556001611edb88826136d0565b5033600081815260036020526040808220805460ff19166001179055600280546001600160a01b038b1673ffffffffffffffffffffffffffffffffffffffff19909116179055517f44d6d25963f097ad14f29f06854a01f575648a1ef82f30e562ccd3889717e3399190a28315611f9157845468ff000000000000000019168555604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15b50505050505050565b600083815260076020526040812054606090808303611ff257505060408051808201909152601181527f53657373696f6e206e6f7420666f756e64000000000000000000000000000000602082015260009150611492565b600081815260066020526040902060018101546001600160a01b031661204b5760006040518060400160405280601381526020017211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b815250935093505050611492565b600160038083015460ff169081111561206657612066612e9d565b146120ae5760006040518060400160405280600f81526020017f47616d65206e6f74206163746976650000000000000000000000000000000000815250935093505050611492565b8480158015906120ce575060018201546001600160a01b03888116911614155b156114785760006040518060600160405280602181526020016139276021913994509450505050611492565b60018054612107906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054612133906134ae565b80156121805780601f1061215557610100808354040283529160200191612180565b820191906000526020600020905b81548152906001019060200180831161216357829003601f168201915b505050505081565b60006004838360405161219c929190613632565b90815260200160405180910390205490505b92915050565b6005546040805163d1d27cf960e01b815290516000926001600160a01b03169163d1d27cf99160048083019260209291908290030181865afa1580156121fe573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061222291906138dc565b90506000816001600160a01b0316633ab76e9f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015612264573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061228891906138dc565b60405163bf40fac160e01b815260206004820152600f60248201527f53455353494f4e5f4d414e41474552000000000000000000000000000000000060448201529091506000906001600160a01b0383169063bf40fac190606401602060405180830381865afa158015612300573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061232491906138dc565b9050336001600160a01b038416148015906123485750336001600160a01b03821614155b801561235f57506002546001600160a01b03163314155b1561237d5760405163793e59cd60e01b815260040160405180910390fd5b600086815260076020526040812054908190036123dc5760405162461bcd60e51b815260206004820152601160248201527f53657373696f6e206e6f7420666f756e640000000000000000000000000000006044820152606401610751565b600081815260066020526040902060018101546001600160a01b031661243a5760405162461bcd60e51b815260206004820152601360248201527211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b6044820152606401610751565b600160038083015460ff169081111561245557612455612e9d565b146124a25760405162461bcd60e51b815260206004820152600f60248201527f47616d65206e6f742061637469766500000000000000000000000000000000006044820152606401610751565b600181015486906001600160a01b038981169116146124d7576003828101805460ff19169091179055600060048301556125ce565b60038201805460ff191660021790556004820181905560018201546040516000916001600160a01b03169083908381818185875af1925050503d806000811461253c576040519150601f19603f3d011682016040523d82523d6000602084013e612541565b606091505b5050905080612586576040517ffa9c4e620000000000000000000000000000000000000000000000000000000081526004810185905260248101839052604401610751565b60018301546040518381526001600160a01b039091169085907fca18b3e4c1f4a1342b2e2e8b6c68bd49c1ff679624d67b618db852effe04dcba9060200160405180910390a3505b600382015460405184917f4e27b06662347b2bd7ed6e8bde0a4b793dae7d7d05b102ef743cbd9c8d824e4e916126079160ff16906138f9565b60405180910390a2505050505050505050565b612622612752565b60028054911515600160a01b0260ff60a01b19909216919091179055565b612648612752565b6001600160a01b03811661268b576040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260006004820152602401610751565b61269481612945565b50565b60006126e483838080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152506126de9250889150612a6d9050565b90612aa0565b90506001600160a01b038116158061271557506001600160a01b03811660009081526003602052604090205460ff16155b1561274c576040517ff7c071fd00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b50505050565b336127847f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300546001600160a01b031690565b6001600160a01b031614611bed576040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152602401610751565b606060005b60208160ff161080156128175750828160ff16602081106127ee576127ee6137d3565b1a60f81b7fff000000000000000000000000000000000000000000000000000000000000001615155b1561282e578061282681613907565b9150506127cb565b60008160ff1667ffffffffffffffff81111561284c5761284c6132e0565b6040519080825280601f01601f191660200182016040528015612876576020820181803683370190505b509050600091505b60208260ff161080156128ca5750838260ff16602081106128a1576128a16137d3565b1a60f81b7fff000000000000000000000000000000000000000000000000000000000000001615155b1561293e57838260ff16602081106128e4576128e46137d3565b1a60f81b818360ff16815181106128fd576128fd6137d3565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053508161293681613907565b92505061287e565b9392505050565b7f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300805473ffffffffffffffffffffffffffffffffffffffff1981166001600160a01b03848116918217845560405192169182907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e090600090a3505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00805460011901612a20576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60029055565b60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b612a54612aca565b61269481612b31565b612a65612aca565b611bed612b39565b7f19457468657265756d205369676e6564204d6573736167653a0a3332000000006000908152601c91909152603c902090565b600080600080612ab08686612b41565b925092509250612ac08282612b8e565b5090949350505050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005468010000000000000000900460ff16611bed576040517fd7e6bcf800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b612648612aca565b612a26612aca565b60008060008351604103612b7b5760208401516040850151606086015160001a612b6d88828585612c92565b955095509550505050612b87565b50508151600091506002905b9250925092565b6000826003811115612ba257612ba2612e9d565b03612bab575050565b6001826003811115612bbf57612bbf612e9d565b03612bf6576040517ff645eedf00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6002826003811115612c0a57612c0a612e9d565b03612c44576040517ffce698f700000000000000000000000000000000000000000000000000000000815260048101829052602401610751565b6003826003811115612c5857612c58612e9d565b03611dc2576040517fd78bce0c00000000000000000000000000000000000000000000000000000000815260048101829052602401610751565b600080807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0841115612ccd5750600091506003905082612d57565b604080516000808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612d21573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116612d4d57506000925060019150829050612d57565b9250600091508190505b9450945094915050565b60008083601f840112612d7357600080fd5b50813567ffffffffffffffff811115612d8b57600080fd5b602083019150836020828501011115612da357600080fd5b9250929050565b60008060008060008060008060008060c08b8d031215612dc957600080fd5b8a3567ffffffffffffffff80821115612de157600080fd5b612ded8e838f01612d61565b909c509a5060208d0135995060408d0135915080821115612e0d57600080fd5b612e198e838f01612d61565b909950975060608d0135915080821115612e3257600080fd5b612e3e8e838f01612d61565b909750955060808d0135945060a08d0135915080821115612e5e57600080fd5b50612e6b8d828e01612d61565b915080935050809150509295989b9194979a5092959850565b600060208284031215612e9657600080fd5b5035919050565b634e487b7160e01b600052602160045260246000fd5b60048110612ed157634e487b7160e01b600052602160045260246000fd5b9052565b60005b83811015612ef0578181015183820152602001612ed8565b50506000910152565b60008151808452612f11816020860160208601612ed5565b601f01601f19169290920160200192915050565b60006101608d83526001600160a01b038d1660208401528b6040840152612f4f606084018c612eb3565b8960808401528860a08401528060c0840152612f6d81840189612ef9565b905082810360e0840152612f818188612ef9565b9050828103610100840152612f968187612ef9565b9050828103610120840152612fab8186612ef9565b915050826101408301529c9b505050505050505050505050565b60a081526000612fd860a0830188612ef9565b8281036020840152612fea8188612ef9565b9050856040840152846060840152828103608084015261300a8185612ef9565b98975050505050505050565b6001600160a01b038116811461269457600080fd5b60006020828403121561303d57600080fd5b813561293e81613016565b60208152815160208201526000602083015161306f60408401826001600160a01b03169052565b5060408301516060830152606083015161308c6080840182612eb3565b50608083015160a083015260a083015160c083015260c08301516101608060e08501526130bd610180850183612ef9565b915060e0850151601f196101008187860301818801526130dd8584612ef9565b9450808801519250506101208187860301818801526130fc8584612ef9565b94508088015192505061014081878603018188015261311b8584612ef9565b970151959092019490945250929392505050565b60008083601f84011261314157600080fd5b50813567ffffffffffffffff81111561315957600080fd5b6020830191508360208260051b8501011115612da357600080fd5b60008060006040848603121561318957600080fd5b833567ffffffffffffffff8111156131a057600080fd5b6131ac8682870161312f565b909790965060209590950135949350505050565b82151581526040602082015260006131db6040830184612ef9565b949350505050565b6000806000806000606086880312156131fb57600080fd5b85359450602086013567ffffffffffffffff8082111561321a57600080fd5b61322689838a01612d61565b9096509450604088013591508082111561323f57600080fd5b5061324c88828901612d61565b969995985093965092949392505050565b6000806000806060858703121561327357600080fd5b84359350602085013567ffffffffffffffff81111561329157600080fd5b61329d8782880161312f565b9598909750949560400135949350505050565b600080604083850312156132c357600080fd5b8235915060208301356132d581613016565b809150509250929050565b634e487b7160e01b600052604160045260246000fd5b600082601f83011261330757600080fd5b813567ffffffffffffffff80821115613322576133226132e0565b604051601f8301601f19908116603f0116810190828211818310171561334a5761334a6132e0565b8160405283815286602085880101111561336357600080fd5b836020870160208301376000602085830101528094505050505092915050565b6000806040838503121561339657600080fd5b823567ffffffffffffffff8111156133ad57600080fd5b6133b9858286016132f6565b92505060208301356132d581613016565b6000806000606084860312156133df57600080fd5b8335925060208401356133f181613016565b929592945050506040919091013590565b60208152600061293e6020830184612ef9565b6000806020838503121561342857600080fd5b823567ffffffffffffffff81111561343f57600080fd5b61344b85828601612d61565b90969095509350505050565b60006020828403121561346957600080fd5b813567ffffffffffffffff81111561348057600080fd5b6131db848285016132f6565b60006020828403121561349e57600080fd5b8135801515811461293e57600080fd5b600181811c908216806134c257607f821691505b6020821081036134e257634e487b7160e01b600052602260045260246000fd5b50919050565b60008083546134f6816134ae565b6001828116801561350e576001811461352357613552565b60ff1984168752821515830287019450613552565b8760005260208060002060005b858110156135495781548a820152908401908201613530565b50505082870194505b50507f3a63726561746547616d6500000000000000000000000000000000000000000083525050600b019392505050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b60006101008083526135c08184018f612ef9565b905082810360208401526135d5818d8f613583565b90508a604084015282810360608401526135f0818a8c613583565b9050828103608084015261360581888a613583565b6001600160a01b039690961660a0840152505060c081019290925260e09091015298975050505050505050565b8183823760009101908152919050565b6020815260006131db602083018486613583565b634e487b7160e01b600052601160045260246000fd5b808201808211156121ae576121ae613656565b601f8211156136cb576000816000526020600020601f850160051c810160208610156136a85750805b601f850160051c820191505b818110156136c7578281556001016136b4565b5050505b505050565b815167ffffffffffffffff8111156136ea576136ea6132e0565b6136fe816136f884546134ae565b8461367f565b602080601f831160018114613733576000841561371b5750858301515b600019600386901b1c1916600185901b1785556136c7565b600085815260208120601f198616915b8281101561376257888601518255948401946001909101908401613743565b50858210156137805787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b6060815260006137a4606083018688613583565b6020830194909452506040015292915050565b600082516137c9818460208701612ed5565b9190910192915050565b634e487b7160e01b600052603260045260246000fd5b67ffffffffffffffff831115613801576138016132e0565b6138158361380f83546134ae565b8361367f565b6000601f84116001811461384957600085156138315750838201355b600019600387901b1c1916600186901b1783556138a3565b600083815260209020601f19861690835b8281101561387a578685013582556020948501946001909201910161385a565b50868210156138975760001960f88860031b161c19848701351681555b505060018560011b0183555b5050505050565b6040815260006138be604083018688613583565b82810360208401526138d1818587613583565b979650505050505050565b6000602082840312156138ee57600080fd5b815161293e81613016565b602081016121ae8284612eb3565b600060ff821660ff810361391d5761391d613656565b6001019291505056fe57696e6e657220646f6573206e6f74206d617463682067616d6520706c6179657247616d65206e6f742063726561746564206f7220616c726561647920616374697665a264697066735822122040ece8a1a0b7f7bfa005b42a7241d5bf2686821fec6c0f036070f71895c2e5ed64736f6c63430008180033

0x6080604052600436106101d05760003560e01c8063648e8ff7116100f757806391da2b3d11610095578063c8bd926011610064578063c8bd92601461067a578063ccc0897414610698578063eb8045be146106b8578063f2fde38b146106e557600080fd5b806391da2b3d146105e057806396696da114610602578063a24e50f914610622578063a40d8f481461064257600080fd5b8063744bfe61116100d1578063744bfe61146105435780637ab4339d146105635780637c7dbe5f146105835780638da5cb5b146105a357600080fd5b8063648e8ff7146104ee578063704802751461050e578063715018a61461052e57600080fd5b806322f3e2d41161016f5780634135cfea1161013e5780634135cfea146104565780634a7e1a19146104765780635b7633d0146104ae57806362ce21e9146104ce57600080fd5b806322f3e2d4146103b357806324d7806c146103d45780632e0be39a1461040457806331f3ad2d1461042857600080fd5b8063117a5b90116101ab578063117a5b90146102765780631746bd1b146102ad5780631785f53c146103665780631b31abda1461038657600080fd5b80621308d81461021157806302153e29146102265780630c0ef2b01461024657600080fd5b3661020c5760405134815233907f9936746a4565f9766fa768f88f56a7487c78780ac179562773d1c75c5269537e9060200160405180910390a2005b600080fd5b61022461021f366004612daa565b610705565b005b34801561023257600080fd5b50610224610241366004612e84565b610ae5565b34801561025257600080fd5b50600254600160a01b900460ff165b60405190151581526020015b60405180910390f35b34801561028257600080fd5b50610296610291366004612e84565b610b44565b60405161026d9b9a99989796959493929190612f25565b3480156102b957600080fd5b50604080518082018252600b81527f436173684f72437261736800000000000000000000000000000000000000000060208083019190915282518084018452600881527f53747261746567790000000000000000000000000000000000000000000000008183015283518085018552600581527f312e302e3000000000000000000000000000000000000000000000000000000092810192909252925161026d9391600191829190612fc5565b34801561037257600080fd5b5061022461038136600461302b565b610dcb565b34801561039257600080fd5b506103a66103a1366004612e84565b610f0f565b60405161026d9190613048565b3480156103bf57600080fd5b5060025461026190600160a01b900460ff1681565b3480156103e057600080fd5b506102616103ef36600461302b565b60036020526000908152604090205460ff1681565b34801561041057600080fd5b5061041a60005481565b60405190815260200161026d565b34801561043457600080fd5b50610448610443366004613174565b61128f565b60405161026d9291906131c0565b34801561046257600080fd5b506102246104713660046131e3565b61149a565b34801561048257600080fd5b50600554610496906001600160a01b031681565b6040516001600160a01b03909116815260200161026d565b3480156104ba57600080fd5b50600254610496906001600160a01b031681565b3480156104da57600080fd5b506102246104e936600461325d565b6115c1565b3480156104fa57600080fd5b5061022461050936600461302b565b611a3b565b34801561051a57600080fd5b5061022461052936600461302b565b611ac8565b34801561053a57600080fd5b50610224611bdb565b34801561054f57600080fd5b5061022461055e3660046132b0565b611bef565b34801561056f57600080fd5b5061022461057e366004613383565b611dc6565b34801561058f57600080fd5b5061044861059e3660046133ca565b611f9a565b3480156105af57600080fd5b507f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300546001600160a01b0316610496565b3480156105ec57600080fd5b506105f56120fa565b60405161026d9190613402565b34801561060e57600080fd5b5061041a61061d366004613415565b612188565b34801561062e57600080fd5b5061022461063d3660046133ca565b6121b4565b34801561064e57600080fd5b5061041a61065d366004613457565b805160208183018101805160048252928201919093012091525481565b34801561068657600080fd5b506002546001600160a01b0316610496565b3480156106a457600080fd5b506102246106b336600461348c565b61261a565b3480156106c457600080fd5b5061041a6106d3366004612e84565b60076020526000908152604090205481565b3480156106f157600080fd5b5061022461070036600461302b565b612640565b8242111561075a5760405162461bcd60e51b815260206004820152601160248201527f5369676e6174757265206578706972656400000000000000000000000000000060448201526064015b60405180910390fd5b600034116107aa5760405162461bcd60e51b815260206004820152601b60248201527f42657420616d6f756e74206d75737420626520706f73697469766500000000006044820152606401610751565b600060016040516020016107be91906134e8565b60408051601f19818403018152908290526107ef918d908d908d908d908d908d908d90339034908f906020016135ac565b604051602081830303815290604052805190602001209050610812818484612697565b60048b8b604051610824929190613632565b908152602001604051809103902054600014610870578a8a6040517f106cfcb1000000000000000000000000000000000000000000000000000000008152600401610751929190613642565b6001600080828254610882919061366c565b9091555050600054604051819060049061089f908f908f90613632565b908152602001604051809103902081905550604051806101600160405280428152602001336001600160a01b03168152602001348152602001600060038111156108eb576108eb612e9d565b8152602001600081526020018b81526020016040518060200160405280600081525081526020018a8a8080601f016020809104026020016040519081016040528093929190818152602001838380828437600092019190915250505090825250604080516020601f8b0181900481028201810190925289815291810191908a908a908190840183828082843760009201829052509385525050604080516020808201835284825280860191909152938101839052858352600684529182902084518155928401516001808501805473ffffffffffffffffffffffffffffffffffffffff19166001600160a01b0390931692909217909155918401516002840155506060830151600380840180549293909260ff1916918490811115610a1257610a12612e9d565b02179055506080820151600482015560a0820151600582015560c08201516006820190610a3f90826136d0565b5060e08201516007820190610a5490826136d0565b506101008201516008820190610a6a90826136d0565b506101208201516009820190610a8090826136d0565b5061014082015181600a0155905050336001600160a01b0316817f5ab4782178ec00656b6f3f3f73d1739ea9d5cba22c641e4b20767fbb571609438e8e348f604051610acf9493929190613790565b60405180910390a3505050505050505050505050565b610aed612752565b600054811015610b3f5760405162461bcd60e51b815260206004820152601b60248201527f43616e6e6f742064656372656173652067616d65436f756e74657200000000006044820152606401610751565b600055565b6006602081905260009182526040909120805460018201546002830154600384015460048501546005860154968601805495976001600160a01b0390951696939560ff9093169491939192610b98906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610bc4906134ae565b8015610c115780601f10610be657610100808354040283529160200191610c11565b820191906000526020600020905b815481529060010190602001808311610bf457829003601f168201915b505050505090806007018054610c26906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610c52906134ae565b8015610c9f5780601f10610c7457610100808354040283529160200191610c9f565b820191906000526020600020905b815481529060010190602001808311610c8257829003601f168201915b505050505090806008018054610cb4906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610ce0906134ae565b8015610d2d5780601f10610d0257610100808354040283529160200191610d2d565b820191906000526020600020905b815481529060010190602001808311610d1057829003601f168201915b505050505090806009018054610d42906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054610d6e906134ae565b8015610dbb5780601f10610d9057610100808354040283529160200191610dbb565b820191906000526020600020905b815481529060010190602001808311610d9e57829003601f168201915b50505050509080600a015490508b565b610dd3612752565b6001600160a01b03811660009081526003602052604090205460ff16610e3b5760405162461bcd60e51b815260206004820152600c60248201527f4e6f7420616e2061646d696e00000000000000000000000000000000000000006044820152606401610751565b7f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300546001600160a01b03166001600160a01b0316816001600160a01b031603610ec65760405162461bcd60e51b815260206004820152601360248201527f43616e6e6f742072656d6f7665206f776e6572000000000000000000000000006044820152606401610751565b6001600160a01b038116600081815260036020526040808220805460ff19169055517fa3b62bc36326052d97ea62d63c3d60308ed4c3ea8ac079dd8499f1e9c4f80c0f9190a250565b610f6f60408051610160810182526000808252602082018190529181018290529060608201908152602001600081526020016000801916815260200160608152602001606081526020016060815260200160608152602001600081525090565b6000828152600660205260409020600101546001600160a01b0316610faa576040516337d7bbf560e11b815260048101839052602401610751565b6000828152600660209081526040918290208251610160810184528154815260018201546001600160a01b031692810192909252600281015492820192909252600380830154919291606084019160ff9091169081111561100d5761100d612e9d565b600381111561101e5761101e612e9d565b81526020016004820154815260200160058201548152602001600682018054611046906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611072906134ae565b80156110bf5780601f10611094576101008083540402835291602001916110bf565b820191906000526020600020905b8154815290600101906020018083116110a257829003601f168201915b505050505081526020016007820180546110d8906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611104906134ae565b80156111515780601f1061112657610100808354040283529160200191611151565b820191906000526020600020905b81548152906001019060200180831161113457829003601f168201915b5050505050815260200160088201805461116a906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611196906134ae565b80156111e35780601f106111b8576101008083540402835291602001916111e3565b820191906000526020600020905b8154815290600101906020018083116111c657829003601f168201915b505050505081526020016009820180546111fc906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054611228906134ae565b80156112755780601f1061124a57610100808354040283529160200191611275565b820191906000526020600020905b81548152906001019060200180831161125857829003601f168201915b50505050508152602001600a820154815250509050919050565b60006060600061129e846127c6565b9050600185146112e757505060408051808201909152601781527f4f6e6c79206f6e6520706c6179657220616c6c6f776564000000000000000000602082015260009150611492565b60006004826040516112f991906137b7565b9081526020016040518091039020549050806000036113555760006040518060400160405280600e81526020017f47616d65206e6f7420666f756e64000000000000000000000000000000000000815250935093505050611492565b60008181526006602052604081209060038083015460ff169081111561137d5761137d612e9d565b146113a95760006040518060600160405280602281526020016139486022913994509450505050611492565b60018101546001600160a01b03166113f55760006040518060400160405280601381526020017211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b81525094509450505050611492565b87876000818110611408576114086137d3565b905060200201602081019061141d919061302b565b60018201546001600160a01b039081169116146114785760006040518060400160405280601581526020017f506c6179657220646f6573206e6f74206d61746368000000000000000000000081525094509450505050611492565b600160405180602001604052806000815250945094505050505b935093915050565b3360009081526003602052604090205460ff1661151f5760405162461bcd60e51b815260206004820152602760248201527f4f6e6c792061646d696e732063616e207365742067616d65207365656420616e60448201527f64207374617465000000000000000000000000000000000000000000000000006064820152608401610751565b600085815260066020526040902060018101546001600160a01b031661155b576040516337d7bbf560e11b815260048101879052602401610751565b6006810161156a8587836137e9565b506009810161157a8385836137e9565b50857f9ef1b877551ca42458afa86d5a4c36a97e103e47f9638b55deb2ec6631c675b3868686866040516115b194939291906138aa565b60405180910390a2505050505050565b6005546040805163d1d27cf960e01b815290516000926001600160a01b03169163d1d27cf99160048083019260209291908290030181865afa15801561160b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061162f91906138dc565b90506000816001600160a01b0316633ab76e9f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611671573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061169591906138dc565b60405163bf40fac160e01b815260206004820152600f60248201527f53455353494f4e5f4d414e41474552000000000000000000000000000000000060448201529091506000906001600160a01b0383169063bf40fac190606401602060405180830381865afa15801561170d573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061173191906138dc565b9050336001600160a01b038416148015906117555750336001600160a01b03821614155b801561176c57506002546001600160a01b03163314155b1561178a5760405163793e59cd60e01b815260040160405180910390fd5b6000611795856127c6565b905060006004826040516117a991906137b7565b90815260200160405180910390205490508060000361180a5760405162461bcd60e51b815260206004820152600e60248201527f47616d65206e6f7420666f756e640000000000000000000000000000000000006044820152606401610751565b60008181526006602052604081209060038083015460ff169081111561183257611832612e9d565b146118a55760405162461bcd60e51b815260206004820152602260248201527f47616d65206e6f742063726561746564206f7220616c7265616479206163746960448201527f76650000000000000000000000000000000000000000000000000000000000006064820152608401610751565b60018101546001600160a01b03166118f55760405162461bcd60e51b815260206004820152601360248201527211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b6044820152606401610751565b600188146119455760405162461bcd60e51b815260206004820152601760248201527f4f6e6c79206f6e6520706c6179657220616c6c6f7765640000000000000000006044820152606401610751565b88886000818110611958576119586137d3565b905060200201602081019061196d919061302b565b60018201546001600160a01b039081169116146119cc5760405162461bcd60e51b815260206004820152601560248201527f506c6179657220646f6573206e6f74206d6174636800000000000000000000006044820152606401610751565b60038101805460ff19166001908117909155600a82018b905560008b815260076020526040908190208490555183917f4e27b06662347b2bd7ed6e8bde0a4b793dae7d7d05b102ef743cbd9c8d824e4e91611a2791906138f9565b60405180910390a250505050505050505050565b611a43612752565b6001600160a01b038116611a995760405162461bcd60e51b815260206004820152601f60248201527f496e76616c69642067616d652068756220726f757465722061646472657373006044820152606401610751565b6005805473ffffffffffffffffffffffffffffffffffffffff19166001600160a01b0392909216919091179055565b611ad0612752565b6001600160a01b038116611b265760405162461bcd60e51b815260206004820152601560248201527f496e76616c69642061646d696e206164647265737300000000000000000000006044820152606401610751565b6001600160a01b03811660009081526003602052604090205460ff1615611b8f5760405162461bcd60e51b815260206004820152600d60248201527f416c72656164792061646d696e000000000000000000000000000000000000006044820152606401610751565b6001600160a01b038116600081815260036020526040808220805460ff19166001179055517f44d6d25963f097ad14f29f06854a01f575648a1ef82f30e562ccd3889717e3399190a250565b611be3612752565b611bed6000612945565b565b611bf7612752565b611bff6129c3565b60008211611c4f5760405162461bcd60e51b815260206004820181905260248201527f576974686472617720616d6f756e74206d75737420626520706f7369746976656044820152606401610751565b6001600160a01b038116611ca55760405162461bcd60e51b815260206004820152601960248201527f496e76616c696420726563697069656e742061646472657373000000000000006044820152606401610751565b47821115611cf55760405162461bcd60e51b815260206004820152601d60248201527f496e73756666696369656e7420636f6e74726163742062616c616e63650000006044820152606401610751565b6000816001600160a01b03168360405160006040518083038185875af1925050503d8060008114611d42576040519150601f19603f3d011682016040523d82523d6000602084013e611d47565b606091505b5050905080611d985760405162461bcd60e51b815260206004820152601160248201527f5769746864726177616c206661696c65640000000000000000000000000000006044820152606401610751565b50611dc260017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b5050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a00805468010000000000000000810460ff16159067ffffffffffffffff16600081158015611e115750825b905060008267ffffffffffffffff166001148015611e2e5750303b155b905081158015611e3c575080155b15611e73576040517ff92ee8a900000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b845467ffffffffffffffff191660011785558315611ea757845468ff00000000000000001916680100000000000000001785555b611eb033612a4c565b611eb8612a5d565b600080556002805460ff60a01b1916600160a01b1790556001611edb88826136d0565b5033600081815260036020526040808220805460ff19166001179055600280546001600160a01b038b1673ffffffffffffffffffffffffffffffffffffffff19909116179055517f44d6d25963f097ad14f29f06854a01f575648a1ef82f30e562ccd3889717e3399190a28315611f9157845468ff000000000000000019168555604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15b50505050505050565b600083815260076020526040812054606090808303611ff257505060408051808201909152601181527f53657373696f6e206e6f7420666f756e64000000000000000000000000000000602082015260009150611492565b600081815260066020526040902060018101546001600160a01b031661204b5760006040518060400160405280601381526020017211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b815250935093505050611492565b600160038083015460ff169081111561206657612066612e9d565b146120ae5760006040518060400160405280600f81526020017f47616d65206e6f74206163746976650000000000000000000000000000000000815250935093505050611492565b8480158015906120ce575060018201546001600160a01b03888116911614155b156114785760006040518060600160405280602181526020016139276021913994509450505050611492565b60018054612107906134ae565b80601f0160208091040260200160405190810160405280929190818152602001828054612133906134ae565b80156121805780601f1061215557610100808354040283529160200191612180565b820191906000526020600020905b81548152906001019060200180831161216357829003601f168201915b505050505081565b60006004838360405161219c929190613632565b90815260200160405180910390205490505b92915050565b6005546040805163d1d27cf960e01b815290516000926001600160a01b03169163d1d27cf99160048083019260209291908290030181865afa1580156121fe573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061222291906138dc565b90506000816001600160a01b0316633ab76e9f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015612264573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061228891906138dc565b60405163bf40fac160e01b815260206004820152600f60248201527f53455353494f4e5f4d414e41474552000000000000000000000000000000000060448201529091506000906001600160a01b0383169063bf40fac190606401602060405180830381865afa158015612300573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061232491906138dc565b9050336001600160a01b038416148015906123485750336001600160a01b03821614155b801561235f57506002546001600160a01b03163314155b1561237d5760405163793e59cd60e01b815260040160405180910390fd5b600086815260076020526040812054908190036123dc5760405162461bcd60e51b815260206004820152601160248201527f53657373696f6e206e6f7420666f756e640000000000000000000000000000006044820152606401610751565b600081815260066020526040902060018101546001600160a01b031661243a5760405162461bcd60e51b815260206004820152601360248201527211d85b5948191bd95cc81b9bdd08195e1a5cdd606a1b6044820152606401610751565b600160038083015460ff169081111561245557612455612e9d565b146124a25760405162461bcd60e51b815260206004820152600f60248201527f47616d65206e6f742061637469766500000000000000000000000000000000006044820152606401610751565b600181015486906001600160a01b038981169116146124d7576003828101805460ff19169091179055600060048301556125ce565b60038201805460ff191660021790556004820181905560018201546040516000916001600160a01b03169083908381818185875af1925050503d806000811461253c576040519150601f19603f3d011682016040523d82523d6000602084013e612541565b606091505b5050905080612586576040517ffa9c4e620000000000000000000000000000000000000000000000000000000081526004810185905260248101839052604401610751565b60018301546040518381526001600160a01b039091169085907fca18b3e4c1f4a1342b2e2e8b6c68bd49c1ff679624d67b618db852effe04dcba9060200160405180910390a3505b600382015460405184917f4e27b06662347b2bd7ed6e8bde0a4b793dae7d7d05b102ef743cbd9c8d824e4e916126079160ff16906138f9565b60405180910390a2505050505050505050565b612622612752565b60028054911515600160a01b0260ff60a01b19909216919091179055565b612648612752565b6001600160a01b03811661268b576040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260006004820152602401610751565b61269481612945565b50565b60006126e483838080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152506126de9250889150612a6d9050565b90612aa0565b90506001600160a01b038116158061271557506001600160a01b03811660009081526003602052604090205460ff16155b1561274c576040517ff7c071fd00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b50505050565b336127847f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300546001600160a01b031690565b6001600160a01b031614611bed576040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152602401610751565b606060005b60208160ff161080156128175750828160ff16602081106127ee576127ee6137d3565b1a60f81b7fff000000000000000000000000000000000000000000000000000000000000001615155b1561282e578061282681613907565b9150506127cb565b60008160ff1667ffffffffffffffff81111561284c5761284c6132e0565b6040519080825280601f01601f191660200182016040528015612876576020820181803683370190505b509050600091505b60208260ff161080156128ca5750838260ff16602081106128a1576128a16137d3565b1a60f81b7fff000000000000000000000000000000000000000000000000000000000000001615155b1561293e57838260ff16602081106128e4576128e46137d3565b1a60f81b818360ff16815181106128fd576128fd6137d3565b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053508161293681613907565b92505061287e565b9392505050565b7f9016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c199300805473ffffffffffffffffffffffffffffffffffffffff1981166001600160a01b03848116918217845560405192169182907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e090600090a3505050565b7f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00805460011901612a20576040517f3ee5aeb500000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60029055565b60017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055565b612a54612aca565b61269481612b31565b612a65612aca565b611bed612b39565b7f19457468657265756d205369676e6564204d6573736167653a0a3332000000006000908152601c91909152603c902090565b600080600080612ab08686612b41565b925092509250612ac08282612b8e565b5090949350505050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a005468010000000000000000900460ff16611bed576040517fd7e6bcf800000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b612648612aca565b612a26612aca565b60008060008351604103612b7b5760208401516040850151606086015160001a612b6d88828585612c92565b955095509550505050612b87565b50508151600091506002905b9250925092565b6000826003811115612ba257612ba2612e9d565b03612bab575050565b6001826003811115612bbf57612bbf612e9d565b03612bf6576040517ff645eedf00000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b6002826003811115612c0a57612c0a612e9d565b03612c44576040517ffce698f700000000000000000000000000000000000000000000000000000000815260048101829052602401610751565b6003826003811115612c5857612c58612e9d565b03611dc2576040517fd78bce0c00000000000000000000000000000000000000000000000000000000815260048101829052602401610751565b600080807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0841115612ccd5750600091506003905082612d57565b604080516000808252602082018084528a905260ff891692820192909252606081018790526080810186905260019060a0016020604051602081039080840390855afa158015612d21573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b038116612d4d57506000925060019150829050612d57565b9250600091508190505b9450945094915050565b60008083601f840112612d7357600080fd5b50813567ffffffffffffffff811115612d8b57600080fd5b602083019150836020828501011115612da357600080fd5b9250929050565b60008060008060008060008060008060c08b8d031215612dc957600080fd5b8a3567ffffffffffffffff80821115612de157600080fd5b612ded8e838f01612d61565b909c509a5060208d0135995060408d0135915080821115612e0d57600080fd5b612e198e838f01612d61565b909950975060608d0135915080821115612e3257600080fd5b612e3e8e838f01612d61565b909750955060808d0135945060a08d0135915080821115612e5e57600080fd5b50612e6b8d828e01612d61565b915080935050809150509295989b9194979a5092959850565b600060208284031215612e9657600080fd5b5035919050565b634e487b7160e01b600052602160045260246000fd5b60048110612ed157634e487b7160e01b600052602160045260246000fd5b9052565b60005b83811015612ef0578181015183820152602001612ed8565b50506000910152565b60008151808452612f11816020860160208601612ed5565b601f01601f19169290920160200192915050565b60006101608d83526001600160a01b038d1660208401528b6040840152612f4f606084018c612eb3565b8960808401528860a08401528060c0840152612f6d81840189612ef9565b905082810360e0840152612f818188612ef9565b9050828103610100840152612f968187612ef9565b9050828103610120840152612fab8186612ef9565b915050826101408301529c9b505050505050505050505050565b60a081526000612fd860a0830188612ef9565b8281036020840152612fea8188612ef9565b9050856040840152846060840152828103608084015261300a8185612ef9565b98975050505050505050565b6001600160a01b038116811461269457600080fd5b60006020828403121561303d57600080fd5b813561293e81613016565b60208152815160208201526000602083015161306f60408401826001600160a01b03169052565b5060408301516060830152606083015161308c6080840182612eb3565b50608083015160a083015260a083015160c083015260c08301516101608060e08501526130bd610180850183612ef9565b915060e0850151601f196101008187860301818801526130dd8584612ef9565b9450808801519250506101208187860301818801526130fc8584612ef9565b94508088015192505061014081878603018188015261311b8584612ef9565b970151959092019490945250929392505050565b60008083601f84011261314157600080fd5b50813567ffffffffffffffff81111561315957600080fd5b6020830191508360208260051b8501011115612da357600080fd5b60008060006040848603121561318957600080fd5b833567ffffffffffffffff8111156131a057600080fd5b6131ac8682870161312f565b909790965060209590950135949350505050565b82151581526040602082015260006131db6040830184612ef9565b949350505050565b6000806000806000606086880312156131fb57600080fd5b85359450602086013567ffffffffffffffff8082111561321a57600080fd5b61322689838a01612d61565b9096509450604088013591508082111561323f57600080fd5b5061324c88828901612d61565b969995985093965092949392505050565b6000806000806060858703121561327357600080fd5b84359350602085013567ffffffffffffffff81111561329157600080fd5b61329d8782880161312f565b9598909750949560400135949350505050565b600080604083850312156132c357600080fd5b8235915060208301356132d581613016565b809150509250929050565b634e487b7160e01b600052604160045260246000fd5b600082601f83011261330757600080fd5b813567ffffffffffffffff80821115613322576133226132e0565b604051601f8301601f19908116603f0116810190828211818310171561334a5761334a6132e0565b8160405283815286602085880101111561336357600080fd5b836020870160208301376000602085830101528094505050505092915050565b6000806040838503121561339657600080fd5b823567ffffffffffffffff8111156133ad57600080fd5b6133b9858286016132f6565b92505060208301356132d581613016565b6000806000606084860312156133df57600080fd5b8335925060208401356133f181613016565b929592945050506040919091013590565b60208152600061293e6020830184612ef9565b6000806020838503121561342857600080fd5b823567ffffffffffffffff81111561343f57600080fd5b61344b85828601612d61565b90969095509350505050565b60006020828403121561346957600080fd5b813567ffffffffffffffff81111561348057600080fd5b6131db848285016132f6565b60006020828403121561349e57600080fd5b8135801515811461293e57600080fd5b600181811c908216806134c257607f821691505b6020821081036134e257634e487b7160e01b600052602260045260246000fd5b50919050565b60008083546134f6816134ae565b6001828116801561350e576001811461352357613552565b60ff1984168752821515830287019450613552565b8760005260208060002060005b858110156135495781548a820152908401908201613530565b50505082870194505b50507f3a63726561746547616d6500000000000000000000000000000000000000000083525050600b019392505050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b60006101008083526135c08184018f612ef9565b905082810360208401526135d5818d8f613583565b90508a604084015282810360608401526135f0818a8c613583565b9050828103608084015261360581888a613583565b6001600160a01b039690961660a0840152505060c081019290925260e09091015298975050505050505050565b8183823760009101908152919050565b6020815260006131db602083018486613583565b634e487b7160e01b600052601160045260246000fd5b808201808211156121ae576121ae613656565b601f8211156136cb576000816000526020600020601f850160051c810160208610156136a85750805b601f850160051c820191505b818110156136c7578281556001016136b4565b5050505b505050565b815167ffffffffffffffff8111156136ea576136ea6132e0565b6136fe816136f884546134ae565b8461367f565b602080601f831160018114613733576000841561371b5750858301515b600019600386901b1c1916600185901b1785556136c7565b600085815260208120601f198616915b8281101561376257888601518255948401946001909101908401613743565b50858210156137805787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b6060815260006137a4606083018688613583565b6020830194909452506040015292915050565b600082516137c9818460208701612ed5565b9190910192915050565b634e487b7160e01b600052603260045260246000fd5b67ffffffffffffffff831115613801576138016132e0565b6138158361380f83546134ae565b8361367f565b6000601f84116001811461384957600085156138315750838201355b600019600387901b1c1916600186901b1783556138a3565b600083815260209020601f19861690835b8281101561387a578685013582556020948501946001909201910161385a565b50868210156138975760001960f88860031b161c19848701351681555b505060018560011b0183555b5050505050565b6040815260006138be604083018688613583565b82810360208401526138d1818587613583565b979650505050505050565b6000602082840312156138ee57600080fd5b815161293e81613016565b602081016121ae8284612eb3565b600060ff821660ff810361391d5761391d613656565b6001019291505056fe57696e6e657220646f6573206e6f74206d617463682067616d6520706c6179657247616d65206e6f742063726561746564206f7220616c726561647920616374697665a264697066735822122040ece8a1a0b7f7bfa005b42a7241d5bf2686821fec6c0f036070f71895c2e5ed64736f6c63430008180033