HYPE Price: $37.98 (-1.60%)

Token

Hyper Frogs (HYF2)

Overview

Max Total Supply

0 HYF2

Holders

683

Market

Onchain Market Cap

-

Circulating Supply Market Cap

-
Balance
1 HYF2
0x452c9b57f8029e3049d9a1bc636b509ac39f246e
Loading...
Loading
Loading...
Loading
Loading...
Loading

Click here to update the token information / general information

Contract Source Code Verified (Exact Match)

Contract Name:
HyperFrogsV2

Compiler Version
v0.8.28+commit.7893614a

Optimization Enabled:
Yes with 500 runs

Other Settings:
paris EvmVersion
File 1 of 22 : HyperFrogsV2.sol
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.20;

// OpenZeppelin Contracts
import "@openzeppelin/contracts/token/ERC721/ERC721.sol";
import "@openzeppelin/contracts/token/common/ERC2981.sol";
import "@openzeppelin/contracts/access/AccessControl.sol";
import "@openzeppelin/contracts/utils/Pausable.sol";
import "@openzeppelin/contracts/utils/ReentrancyGuard.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "@openzeppelin/contracts/utils/Base64.sol";

/// --------------------------------------------------------------------------
/// Interfaces for Trait Contracts
/// --------------------------------------------------------------------------
interface IFrogsBackdrop {
    function getBackdropData(uint) external view returns (string memory);
    function getBackdropTrait(uint) external view returns (string memory);
}

interface IFrogsOneOfOne {
    function getOneOfOneData(uint) external view returns (bytes memory);
    function getOneOfOneTrait(uint) external view returns (string memory);
}

interface IFrogsBody {
    function getBodyData(uint) external view returns (bytes memory);
    function getBodyTrait(uint) external view returns (string memory);
}

interface IFrogsHats {
    function getHatsData(uint) external view returns (bytes memory);
    function getHatsTrait(uint) external view returns (string memory);
}

interface IFrogsEyesA {
    function getEyesAData(uint) external view returns (bytes memory);
    function getEyesATrait(uint) external view returns (string memory);
}

interface IFrogsEyesB {
    function getEyesBData(uint) external view returns (bytes memory);
    function getEyesBTrait(uint) external view returns (string memory);
}

interface IFrogsMouth {
    function getMouthData(uint) external view returns (bytes memory);
    function getMouthTrait(uint) external view returns (string memory);
}

interface IFrogsFeet {
    function getFeetData(uint) external view returns (bytes memory);
    function getFeetTrait(uint) external view returns (string memory);
}

/// --------------------------------------------------------------------------
/// Interface for the Old HyperFrogs Contract
/// --------------------------------------------------------------------------
interface IHyperFrogs {
    function ownerOf(uint256 tokenId) external view returns (address);
    function burn(uint256 tokenId) external;
    function transferFrom(address from, address to, uint256 tokenId) external;
    function tokenURI(uint256 tokenId) external view returns (string memory);
    function buildSVG(uint256 tokenId) external view returns (string memory);
    function tokenTraits(uint256 tokenId) external view returns (
        bool oneOfOne,
        uint oneOfOneIndex,
        uint backdrop,
        uint hat,
        uint eyesIndex,
        bool eyesIsA,
        uint mouth,
        uint body,
        uint feet
    );
}

/// --------------------------------------------------------------------------
/// HyperFrogsV2 Migration Contract using ERC721 and AccessControl
/// --------------------------------------------------------------------------
contract HyperFrogsV2 is ERC721, AccessControl, Pausable, ReentrancyGuard, ERC2981 {
    using Strings for uint256;
    uint256 public totalMigrated;
    
    // -----------------------------------------------------------------------
    // Events
    // -----------------------------------------------------------------------    
    event TokenMigrated(address indexed owner, uint256 indexed tokenId, uint256 migrationBatch);

    // -----------------------------------------------------------------------
    // Struct & State Variables
    // -----------------------------------------------------------------------
    struct TraitStruct {
        bool oneOfOne;
        uint oneOfOneIndex;
        uint backdrop;
        uint hat;
        uint eyesIndex;
        bool eyesIsA;
        uint mouth;
        uint body;
        uint feet;
    }

    // -----------------------------------------------------------------------
    // Custom Errors
    // -----------------------------------------------------------------------
    error TokenAlreadyMigrated(uint256 tokenId);
    error NotOwnerOfOldNFT(uint256 tokenId, address actual, address sender);
    error NoTokenIDsProvided();
    error BatchSizeToLarge();
    error TokenNotMigratedYet(uint256 tokenId);

    IHyperFrogs public oldContract;
    mapping(uint256 => bool) public claimed;
    mapping(uint256 => TraitStruct) public tokenTraits;

    // Trait contract references – reuse the same contracts as in the original
    IFrogsBackdrop public frogsBackdrop;
    IFrogsOneOfOne public frogsOneOfOne;
    IFrogsBody public frogsBody;
    IFrogsHats public frogsHats;
    IFrogsEyesA public frogsEyesA;
    IFrogsEyesB public frogsEyesB;
    IFrogsMouth public frogsMouth;
    IFrogsFeet public frogsFeet;

    // -----------------------------------------------------------------------
    // Events
    // -----------------------------------------------------------------------
    event TokenMigrated(address indexed owner, uint256 indexed tokenId);

    // Optional debug event to help with troubleshooting ownerOf values
    event DebugOwner(address actualOwner);

    // -----------------------------------------------------------------------
    // Constructor
    // -----------------------------------------------------------------------
    constructor(
        address _oldContract,
        address _frogsBackdrop,
        address _frogsOneOfOne,
        address _frogsBody,
        address _frogsHats,
        address _frogsEyesA,
        address _frogsEyesB,
        address _frogsMouth,
        address _frogsFeet
    )
        ERC721("Hyper Frogs", "HYF2")
        ERC2981()
    {
        require(_oldContract != address(0), "Invalid old contract address");
        oldContract = IHyperFrogs(_oldContract);
        frogsBackdrop = IFrogsBackdrop(_frogsBackdrop);
        frogsOneOfOne = IFrogsOneOfOne(_frogsOneOfOne);
        frogsBody = IFrogsBody(_frogsBody);
        frogsHats = IFrogsHats(_frogsHats);
        frogsEyesA = IFrogsEyesA(_frogsEyesA);
        frogsEyesB = IFrogsEyesB(_frogsEyesB);
        frogsMouth = IFrogsMouth(_frogsMouth);
        frogsFeet = IFrogsFeet(_frogsFeet);
        _setDefaultRoyalty(msg.sender, 350);
        _grantRole(DEFAULT_ADMIN_ROLE, msg.sender);
    }

    // -----------------------------------------------------------------------
    // ERC2981, ERC721, and AccessControl Interface Support
    // -----------------------------------------------------------------------
    /**
     * @notice Override supportsInterface to combine ERC721, ERC2981, and AccessControl interfaces.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override(ERC721, ERC2981, AccessControl) returns (bool) {
        return ERC721.supportsInterface(interfaceId) ||
               ERC2981.supportsInterface(interfaceId) ||
               AccessControl.supportsInterface(interfaceId);
    }

    // -----------------------------------------------------------------------
    // Migration Functionality
    // -----------------------------------------------------------------------
    /**
     * @notice Batch claim (migrate) multiple NFTs at once.
     * Requirements:
     * - Caller must be owner of each token in the old contract.
     * - Each token must not have been migrated before.
     * - The contract must not be paused.
     */
    function batchClaim(uint256[] calldata tokenIds) external whenNotPaused nonReentrant {
        uint256 length = tokenIds.length;
        uint256 batchId = totalMigrated; // Use as a batch identifier
        if (length == 0) revert NoTokenIDsProvided();
        if (length > 20) revert BatchSizeToLarge();

        for (uint256 i = 0; i < length; i++) {
            uint256 tokenId = tokenIds[i];
            if (claimed[tokenId]) revert TokenAlreadyMigrated(tokenId);
            address actualOwner = oldContract.ownerOf(tokenId);
            if (actualOwner != msg.sender) revert NotOwnerOfOldNFT(tokenId, actualOwner, msg.sender);

            // Retrieve traits from the old contract using its public tokenTraits mapping
            (
                bool oneOfOne,
                uint oneOfOneIndex,
                uint backdrop,
                uint hat,
                uint eyesIndex,
                bool eyesIsA,
                uint mouth,
                uint body,
                uint feet
            ) = oldContract.tokenTraits(tokenId);

            tokenTraits[tokenId] = TraitStruct({
                oneOfOne: oneOfOne,
                oneOfOneIndex: oneOfOneIndex,
                backdrop: backdrop,
                hat: hat,
                eyesIndex: eyesIndex,
                eyesIsA: eyesIsA,
                mouth: mouth,
                body: body,
                feet: feet
            });

            // Mint the NFT with the same tokenId
            _safeMint(msg.sender, tokenId);

            // Mark token as claimed after minting succeeds
            claimed[tokenId] = true;
            totalMigrated++;
            emit TokenMigrated(msg.sender, tokenId, batchId);

            // Attempt to burn the old NFT; if burn fails, transfer it to the old contract's address (lockup)
            try oldContract.burn(tokenId) {
                // Burn succeeded.
            } catch {
                oldContract.transferFrom(msg.sender, address(oldContract), tokenId);
            }

            emit TokenMigrated(msg.sender, tokenId);
        }
    }

    /**
     * @notice Check the migration status of multiple tokens.
     * Returns an array of booleans indicating whether each token has been migrated.
     */
    function checkMigrationStatus(uint256[] calldata tokenIds) external view returns (bool[] memory statuses) {
        statuses = new bool[](tokenIds.length);
        for (uint256 i = 0; i < tokenIds.length; i++) {
            statuses[i] = claimed[tokenIds[i]];
        }
        return statuses;
    }

    // -----------------------------------------------------------------------
    // SVG & Metadata Generation Functions
    // -----------------------------------------------------------------------
    /**
     * @notice Returns the tokenURI for a given tokenId.
     * Rebuilds the on-chain SVG and metadata exactly as in the original contract.
     */
    function tokenURI(uint256 tokenId) public view override returns (string memory) {
        string memory image = buildSVG(tokenId);
        string memory base64Image = Base64.encode(bytes(image));
        string memory json = string(
            abi.encodePacked(
                '{"name": "Hyper Frog #', tokenId.toString(), '",',
                '"description": "Hyper Frogs are pure ASCII art frogs and live 100% onchain on Hyperliquid.",',
                '"attributes": [', _getFrogTraits(tokenId), '],',
                '"image": "data:image/svg+xml;base64,', base64Image, '"}'
            )
        );
        return string(abi.encodePacked("data:application/json;base64,", Base64.encode(bytes(json))));
    }

    /**
     * @notice Rebuilds the on-chain SVG using stored traits.
     */
    
    function buildSVG(uint tokenId) public view returns (string memory) {
        if (!claimed[tokenId]) revert TokenNotMigratedYet(tokenId);
        TraitStruct memory traits = tokenTraits[tokenId];

        if (traits.oneOfOne) {
            return string(
                abi.encodePacked(
                    '<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 90 90" shape-rendering="crispEdges" width="512" height="512">',
                    '<style>',
                    'svg {',
                        'width: 100%;',
                        'height: 100%;',
                        'margin: 0;',
                        'padding: 0;',
                        'overflow: hidden;',
                        'display: flex;',
                        'justify-content: center;',
                        'background:', frogsBackdrop.getBackdropData(traits.backdrop), ';',
                    '}',
                    '</style>',
                    '<rect width="90" height="90" fill="', frogsBackdrop.getBackdropData(traits.backdrop), '"/>',
                    _getSVGTraitData(frogsOneOfOne.getOneOfOneData(traits.oneOfOneIndex)),
                    '</svg>'
                )
            );
        }

        return string(
            abi.encodePacked(
                '<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 90 90" shape-rendering="crispEdges" width="512" height="512">',
                '<style>',
                'svg {',
                    'width: 100%;',
                    'height: 100%;',
                    'margin: 0;',
                    'padding: 0;',
                    'overflow: hidden;',
                    'display: flex;',
                    'justify-content: center;',
                    'background:', frogsBackdrop.getBackdropData(traits.backdrop), ';',
                '}',
                '</style>',
                '<rect width="90" height="90" fill="', frogsBackdrop.getBackdropData(traits.backdrop), '"/>',
                _getSVGTraitData(frogsBody.getBodyData(traits.body)),
                _getSVGTraitData(frogsHats.getHatsData(traits.hat)),
                _getSVGTraitData(traits.eyesIsA ? frogsEyesA.getEyesAData(traits.eyesIndex) : frogsEyesB.getEyesBData(traits.eyesIndex)),
                _getSVGTraitData(frogsMouth.getMouthData(traits.mouth)),
                _getSVGTraitData(frogsFeet.getFeetData(traits.feet)),
                '</svg>'
            )
        );
    }

    /**
     * @notice Trims trailing zero bytes from data.
     */
    function trimTrailingZeros(bytes memory data) internal pure returns (bytes memory) {
        uint256 len = data.length;
        while (len > 0 && data[len - 1] == 0) {
            len--;
        }
        bytes memory trimmed = new bytes(len);
        for (uint256 i = 0; i < len; i++) {
            trimmed[i] = data[i];
        }
        return trimmed;
    }

    /**
     * @notice Converts bytes data to a string after trimming trailing zeros.
     */
    function _getSVGTraitData(bytes memory data) internal pure returns (string memory) {
        if (data.length == 0) return "";
        bytes memory trimmedData = trimTrailingZeros(data);
        return string(trimmedData);
    }

    /**
     * @notice Builds the JSON attributes string for a token.
     */
    function _getFrogTraits(uint tokenId) internal view returns (string memory) {
        TraitStruct memory traits = tokenTraits[tokenId];

        if (traits.oneOfOne) {
            string memory traitName = frogsOneOfOne.getOneOfOneTrait(traits.oneOfOneIndex);
            return string(
                abi.encodePacked(
                    '{"trait_type":"Backdrop", "value":"', frogsBackdrop.getBackdropTrait(traits.backdrop), '"},',
                    '{"trait_type":"Hat", "value":"', traitName, '"},',
                    '{"trait_type":"Eyes", "value":"', traitName, '"},',
                    '{"trait_type":"Mouth", "value":"', traitName, '"},',
                    '{"trait_type":"Body", "value":"', traitName, '"},',
                    '{"trait_type":"Feet", "value":"', traitName, '"}'
                )
            );
        }

        string memory eyesTrait = traits.eyesIsA
            ? frogsEyesA.getEyesATrait(traits.eyesIndex)
            : frogsEyesB.getEyesBTrait(traits.eyesIndex);
        return string(
            abi.encodePacked(
                '{"trait_type":"Backdrop", "value":"', frogsBackdrop.getBackdropTrait(traits.backdrop), '"},',
                '{"trait_type":"Hat", "value":"', frogsHats.getHatsTrait(traits.hat), '"},',
                '{"trait_type":"Eyes", "value":"', eyesTrait, '"},',
                '{"trait_type":"Mouth", "value":"', frogsMouth.getMouthTrait(traits.mouth), '"},',
                '{"trait_type":"Body", "value":"', frogsBody.getBodyTrait(traits.body), '"},',
                '{"trait_type":"Feet", "value":"', frogsFeet.getFeetTrait(traits.feet), '"}'
            )
        );
    }

    // -----------------------------------------------------------------------
    // Admin & Emergency Functions
    // -----------------------------------------------------------------------
    function pause() external onlyRole(DEFAULT_ADMIN_ROLE) {
        _pause();
    }

    function unpause() external onlyRole(DEFAULT_ADMIN_ROLE) {
        _unpause();
    }

    /**
     * @notice Emergency admin function to manually mark tokens as migrated.
     */
    function markAsMigrated(uint256[] calldata tokenIds) external onlyRole(DEFAULT_ADMIN_ROLE) {
        uint256 length = tokenIds.length;
        for (uint256 i = 0; i < length; i++) {
            claimed[tokenIds[i]] = true;
        }
    }

    function adminMigrate(uint256[] calldata tokenIds, address recipient) external onlyRole(DEFAULT_ADMIN_ROLE) {
        for (uint256 i = 0; i < tokenIds.length; i++) {
            uint256 tokenId = tokenIds[i];
            require(!claimed[tokenId], "Token already migrated");
            
            // Retrieve traits from old contract
            (
                bool oneOfOne,
                uint oneOfOneIndex,
                uint backdrop,
                uint hat,
                uint eyesIndex,
                bool eyesIsA,
                uint mouth,
                uint body,
                uint feet
            ) = oldContract.tokenTraits(tokenId);
            
            tokenTraits[tokenId] = TraitStruct({
                oneOfOne: oneOfOne,
                oneOfOneIndex: oneOfOneIndex,
                backdrop: backdrop,
                hat: hat,
                eyesIndex: eyesIndex,
                eyesIsA: eyesIsA,
                mouth: mouth,
                body: body,
                feet: feet
            });
            
            _safeMint(recipient, tokenId);
            claimed[tokenId] = true;
            totalMigrated++;
            
            emit TokenMigrated(recipient, tokenId, totalMigrated);
        }
    }
}

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

pragma solidity ^0.8.20;

import {IAccessControl} from "./IAccessControl.sol";
import {Context} from "../utils/Context.sol";
import {ERC165} from "../utils/introspection/ERC165.sol";

/**
 * @dev Contract module that allows children to implement role-based access
 * control mechanisms. This is a lightweight version that doesn't allow enumerating role
 * members except through off-chain means by accessing the contract event logs. Some
 * applications may benefit from on-chain enumerability, for those cases see
 * {AccessControlEnumerable}.
 *
 * Roles are referred to by their `bytes32` identifier. These should be exposed
 * in the external API and be unique. The best way to achieve this is by
 * using `public constant` hash digests:
 *
 * ```solidity
 * bytes32 public constant MY_ROLE = keccak256("MY_ROLE");
 * ```
 *
 * Roles can be used to represent a set of permissions. To restrict access to a
 * function call, use {hasRole}:
 *
 * ```solidity
 * function foo() public {
 *     require(hasRole(MY_ROLE, msg.sender));
 *     ...
 * }
 * ```
 *
 * Roles can be granted and revoked dynamically via the {grantRole} and
 * {revokeRole} functions. Each role has an associated admin role, and only
 * accounts that have a role's admin role can call {grantRole} and {revokeRole}.
 *
 * By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means
 * that only accounts with this role will be able to grant or revoke other
 * roles. More complex role relationships can be created by using
 * {_setRoleAdmin}.
 *
 * WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to
 * grant and revoke this role. Extra precautions should be taken to secure
 * accounts that have been granted it. We recommend using {AccessControlDefaultAdminRules}
 * to enforce additional security measures for this role.
 */
abstract contract AccessControl is Context, IAccessControl, ERC165 {
    struct RoleData {
        mapping(address account => bool) hasRole;
        bytes32 adminRole;
    }

    mapping(bytes32 role => RoleData) private _roles;

    bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;

    /**
     * @dev Modifier that checks that an account has a specific role. Reverts
     * with an {AccessControlUnauthorizedAccount} error including the required role.
     */
    modifier onlyRole(bytes32 role) {
        _checkRole(role);
        _;
    }

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IAccessControl).interfaceId || super.supportsInterface(interfaceId);
    }

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) public view virtual returns (bool) {
        return _roles[role].hasRole[account];
    }

    /**
     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `_msgSender()`
     * is missing `role`. Overriding this function changes the behavior of the {onlyRole} modifier.
     */
    function _checkRole(bytes32 role) internal view virtual {
        _checkRole(role, _msgSender());
    }

    /**
     * @dev Reverts with an {AccessControlUnauthorizedAccount} error if `account`
     * is missing `role`.
     */
    function _checkRole(bytes32 role, address account) internal view virtual {
        if (!hasRole(role, account)) {
            revert AccessControlUnauthorizedAccount(account, role);
        }
    }

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) public view virtual returns (bytes32) {
        return _roles[role].adminRole;
    }

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleGranted} event.
     */
    function grantRole(bytes32 role, address account) public virtual onlyRole(getRoleAdmin(role)) {
        _grantRole(role, account);
    }

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     *
     * May emit a {RoleRevoked} event.
     */
    function revokeRole(bytes32 role, address account) public virtual onlyRole(getRoleAdmin(role)) {
        _revokeRole(role, account);
    }

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been revoked `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `callerConfirmation`.
     *
     * May emit a {RoleRevoked} event.
     */
    function renounceRole(bytes32 role, address callerConfirmation) public virtual {
        if (callerConfirmation != _msgSender()) {
            revert AccessControlBadConfirmation();
        }

        _revokeRole(role, callerConfirmation);
    }

    /**
     * @dev Sets `adminRole` as ``role``'s admin role.
     *
     * Emits a {RoleAdminChanged} event.
     */
    function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual {
        bytes32 previousAdminRole = getRoleAdmin(role);
        _roles[role].adminRole = adminRole;
        emit RoleAdminChanged(role, previousAdminRole, adminRole);
    }

    /**
     * @dev Attempts to grant `role` to `account` and returns a boolean indicating if `role` was granted.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleGranted} event.
     */
    function _grantRole(bytes32 role, address account) internal virtual returns (bool) {
        if (!hasRole(role, account)) {
            _roles[role].hasRole[account] = true;
            emit RoleGranted(role, account, _msgSender());
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Attempts to revoke `role` to `account` and returns a boolean indicating if `role` was revoked.
     *
     * Internal function without access restriction.
     *
     * May emit a {RoleRevoked} event.
     */
    function _revokeRole(bytes32 role, address account) internal virtual returns (bool) {
        if (hasRole(role, account)) {
            _roles[role].hasRole[account] = false;
            emit RoleRevoked(role, account, _msgSender());
            return true;
        } else {
            return false;
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Metadata.sol)

pragma solidity ^0.8.20;

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

/**
 * @title ERC-721 Non-Fungible Token Standard, optional metadata extension
 * @dev See https://eips.ethereum.org/EIPS/eip-721
 */
interface IERC721Metadata is IERC721 {
    /**
     * @dev Returns the token collection name.
     */
    function name() external view returns (string memory);

    /**
     * @dev Returns the token collection symbol.
     */
    function symbol() external view returns (string memory);

    /**
     * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.
     */
    function tokenURI(uint256 tokenId) external view returns (string memory);
}

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

pragma solidity ^0.8.20;

import {IERC721Receiver} from "../IERC721Receiver.sol";
import {IERC721Errors} from "../../../interfaces/draft-IERC6093.sol";

/**
 * @dev Library that provide common ERC-721 utility functions.
 *
 * See https://eips.ethereum.org/EIPS/eip-721[ERC-721].
 *
 * _Available since v5.1._
 */
library ERC721Utils {
    /**
     * @dev Performs an acceptance check for the provided `operator` by calling {IERC721-onERC721Received}
     * on the `to` address. The `operator` is generally the address that initiated the token transfer (i.e. `msg.sender`).
     *
     * The acceptance call is not executed and treated as a no-op if the target address doesn't contain code (i.e. an EOA).
     * Otherwise, the recipient must implement {IERC721Receiver-onERC721Received} and return the acceptance magic value to accept
     * the transfer.
     */
    function checkOnERC721Received(
        address operator,
        address from,
        address to,
        uint256 tokenId,
        bytes memory data
    ) internal {
        if (to.code.length > 0) {
            try IERC721Receiver(to).onERC721Received(operator, from, tokenId, data) returns (bytes4 retval) {
                if (retval != IERC721Receiver.onERC721Received.selector) {
                    // Token rejected
                    revert IERC721Errors.ERC721InvalidReceiver(to);
                }
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    // non-IERC721Receiver implementer
                    revert IERC721Errors.ERC721InvalidReceiver(to);
                } else {
                    assembly ("memory-safe") {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/common/ERC2981.sol)

pragma solidity ^0.8.20;

import {IERC2981} from "../../interfaces/IERC2981.sol";
import {IERC165, ERC165} from "../../utils/introspection/ERC165.sol";

/**
 * @dev Implementation of the NFT Royalty Standard, a standardized way to retrieve royalty payment information.
 *
 * Royalty information can be specified globally for all token ids via {_setDefaultRoyalty}, and/or individually for
 * specific token ids via {_setTokenRoyalty}. The latter takes precedence over the first.
 *
 * Royalty is specified as a fraction of sale price. {_feeDenominator} is overridable but defaults to 10000, meaning the
 * fee is specified in basis points by default.
 *
 * IMPORTANT: ERC-2981 only specifies a way to signal royalty information and does not enforce its payment. See
 * https://eips.ethereum.org/EIPS/eip-2981#optional-royalty-payments[Rationale] in the ERC. Marketplaces are expected to
 * voluntarily pay royalties together with sales, but note that this standard is not yet widely supported.
 */
abstract contract ERC2981 is IERC2981, ERC165 {
    struct RoyaltyInfo {
        address receiver;
        uint96 royaltyFraction;
    }

    RoyaltyInfo private _defaultRoyaltyInfo;
    mapping(uint256 tokenId => RoyaltyInfo) private _tokenRoyaltyInfo;

    /**
     * @dev The default royalty set is invalid (eg. (numerator / denominator) >= 1).
     */
    error ERC2981InvalidDefaultRoyalty(uint256 numerator, uint256 denominator);

    /**
     * @dev The default royalty receiver is invalid.
     */
    error ERC2981InvalidDefaultRoyaltyReceiver(address receiver);

    /**
     * @dev The royalty set for an specific `tokenId` is invalid (eg. (numerator / denominator) >= 1).
     */
    error ERC2981InvalidTokenRoyalty(uint256 tokenId, uint256 numerator, uint256 denominator);

    /**
     * @dev The royalty receiver for `tokenId` is invalid.
     */
    error ERC2981InvalidTokenRoyaltyReceiver(uint256 tokenId, address receiver);

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override(IERC165, ERC165) returns (bool) {
        return interfaceId == type(IERC2981).interfaceId || super.supportsInterface(interfaceId);
    }

    /**
     * @inheritdoc IERC2981
     */
    function royaltyInfo(
        uint256 tokenId,
        uint256 salePrice
    ) public view virtual returns (address receiver, uint256 amount) {
        RoyaltyInfo storage _royaltyInfo = _tokenRoyaltyInfo[tokenId];
        address royaltyReceiver = _royaltyInfo.receiver;
        uint96 royaltyFraction = _royaltyInfo.royaltyFraction;

        if (royaltyReceiver == address(0)) {
            royaltyReceiver = _defaultRoyaltyInfo.receiver;
            royaltyFraction = _defaultRoyaltyInfo.royaltyFraction;
        }

        uint256 royaltyAmount = (salePrice * royaltyFraction) / _feeDenominator();

        return (royaltyReceiver, royaltyAmount);
    }

    /**
     * @dev The denominator with which to interpret the fee set in {_setTokenRoyalty} and {_setDefaultRoyalty} as a
     * fraction of the sale price. Defaults to 10000 so fees are expressed in basis points, but may be customized by an
     * override.
     */
    function _feeDenominator() internal pure virtual returns (uint96) {
        return 10000;
    }

    /**
     * @dev Sets the royalty information that all ids in this contract will default to.
     *
     * Requirements:
     *
     * - `receiver` cannot be the zero address.
     * - `feeNumerator` cannot be greater than the fee denominator.
     */
    function _setDefaultRoyalty(address receiver, uint96 feeNumerator) internal virtual {
        uint256 denominator = _feeDenominator();
        if (feeNumerator > denominator) {
            // Royalty fee will exceed the sale price
            revert ERC2981InvalidDefaultRoyalty(feeNumerator, denominator);
        }
        if (receiver == address(0)) {
            revert ERC2981InvalidDefaultRoyaltyReceiver(address(0));
        }

        _defaultRoyaltyInfo = RoyaltyInfo(receiver, feeNumerator);
    }

    /**
     * @dev Removes default royalty information.
     */
    function _deleteDefaultRoyalty() internal virtual {
        delete _defaultRoyaltyInfo;
    }

    /**
     * @dev Sets the royalty information for a specific token id, overriding the global default.
     *
     * Requirements:
     *
     * - `receiver` cannot be the zero address.
     * - `feeNumerator` cannot be greater than the fee denominator.
     */
    function _setTokenRoyalty(uint256 tokenId, address receiver, uint96 feeNumerator) internal virtual {
        uint256 denominator = _feeDenominator();
        if (feeNumerator > denominator) {
            // Royalty fee will exceed the sale price
            revert ERC2981InvalidTokenRoyalty(tokenId, feeNumerator, denominator);
        }
        if (receiver == address(0)) {
            revert ERC2981InvalidTokenRoyaltyReceiver(tokenId, address(0));
        }

        _tokenRoyaltyInfo[tokenId] = RoyaltyInfo(receiver, feeNumerator);
    }

    /**
     * @dev Resets royalty information for the token id back to the global default.
     */
    function _resetTokenRoyalty(uint256 tokenId) internal virtual {
        delete _tokenRoyaltyInfo[tokenId];
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Provides a set of functions to operate with Base64 strings.
 */
library Base64 {
    /**
     * @dev Base64 Encoding/Decoding Table
     * See sections 4 and 5 of https://datatracker.ietf.org/doc/html/rfc4648
     */
    string internal constant _TABLE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
    string internal constant _TABLE_URL = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";

    /**
     * @dev Converts a `bytes` to its Bytes64 `string` representation.
     */
    function encode(bytes memory data) internal pure returns (string memory) {
        return _encode(data, _TABLE, true);
    }

    /**
     * @dev Converts a `bytes` to its Bytes64Url `string` representation.
     * Output is not padded with `=` as specified in https://www.rfc-editor.org/rfc/rfc4648[rfc4648].
     */
    function encodeURL(bytes memory data) internal pure returns (string memory) {
        return _encode(data, _TABLE_URL, false);
    }

    /**
     * @dev Internal table-agnostic conversion
     */
    function _encode(bytes memory data, string memory table, bool withPadding) private pure returns (string memory) {
        /**
         * Inspired by Brecht Devos (Brechtpd) implementation - MIT licence
         * https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol
         */
        if (data.length == 0) return "";

        // If padding is enabled, the final length should be `bytes` data length divided by 3 rounded up and then
        // multiplied by 4 so that it leaves room for padding the last chunk
        // - `data.length + 2`  -> Prepare for division rounding up
        // - `/ 3`              -> Number of 3-bytes chunks (rounded up)
        // - `4 *`              -> 4 characters for each chunk
        // This is equivalent to: 4 * Math.ceil(data.length / 3)
        //
        // If padding is disabled, the final length should be `bytes` data length multiplied by 4/3 rounded up as
        // opposed to when padding is required to fill the last chunk.
        // - `4 * data.length`  -> 4 characters for each chunk
        // - ` + 2`             -> Prepare for division rounding up
        // - `/ 3`              -> Number of 3-bytes chunks (rounded up)
        // This is equivalent to: Math.ceil((4 * data.length) / 3)
        uint256 resultLength = withPadding ? 4 * ((data.length + 2) / 3) : (4 * data.length + 2) / 3;

        string memory result = new string(resultLength);

        assembly ("memory-safe") {
            // Prepare the lookup table (skip the first "length" byte)
            let tablePtr := add(table, 1)

            // Prepare result pointer, jump over length
            let resultPtr := add(result, 0x20)
            let dataPtr := data
            let endPtr := add(data, mload(data))

            // In some cases, the last iteration will read bytes after the end of the data. We cache the value, and
            // set it to zero to make sure no dirty bytes are read in that section.
            let afterPtr := add(endPtr, 0x20)
            let afterCache := mload(afterPtr)
            mstore(afterPtr, 0x00)

            // Run over the input, 3 bytes at a time
            for {

            } lt(dataPtr, endPtr) {

            } {
                // Advance 3 bytes
                dataPtr := add(dataPtr, 3)
                let input := mload(dataPtr)

                // To write each character, shift the 3 byte (24 bits) chunk
                // 4 times in blocks of 6 bits for each character (18, 12, 6, 0)
                // and apply logical AND with 0x3F to bitmask the least significant 6 bits.
                // Use this as an index into the lookup table, mload an entire word
                // so the desired character is in the least significant byte, and
                // mstore8 this least significant byte into the result and continue.

                mstore8(resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance

                mstore8(resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance

                mstore8(resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance

                mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance
            }

            // Reset the value that was cached
            mstore(afterPtr, afterCache)

            if withPadding {
                // When data `bytes` is not exactly 3 bytes long
                // it is padded with `=` characters at the end
                switch mod(mload(data), 3)
                case 1 {
                    mstore8(sub(resultPtr, 1), 0x3d)
                    mstore8(sub(resultPtr, 2), 0x3d)
                }
                case 2 {
                    mstore8(sub(resultPtr, 1), 0x3d)
                }
            }
        }

        return result;
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev External interface of AccessControl declared to support ERC-165 detection.
 */
interface IAccessControl {
    /**
     * @dev The `account` is missing a role.
     */
    error AccessControlUnauthorizedAccount(address account, bytes32 neededRole);

    /**
     * @dev The caller of a function is not the expected one.
     *
     * NOTE: Don't confuse with {AccessControlUnauthorizedAccount}.
     */
    error AccessControlBadConfirmation();

    /**
     * @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole`
     *
     * `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite
     * {RoleAdminChanged} not being emitted signaling this.
     */
    event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole);

    /**
     * @dev Emitted when `account` is granted `role`.
     *
     * `sender` is the account that originated the contract call. This account bears the admin role (for the granted role).
     * Expected in cases where the role was granted using the internal {AccessControl-_grantRole}.
     */
    event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Emitted when `account` is revoked `role`.
     *
     * `sender` is the account that originated the contract call:
     *   - if using `revokeRole`, it is the admin role bearer
     *   - if using `renounceRole`, it is the role bearer (i.e. `account`)
     */
    event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender);

    /**
     * @dev Returns `true` if `account` has been granted `role`.
     */
    function hasRole(bytes32 role, address account) external view returns (bool);

    /**
     * @dev Returns the admin role that controls `role`. See {grantRole} and
     * {revokeRole}.
     *
     * To change a role's admin, use {AccessControl-_setRoleAdmin}.
     */
    function getRoleAdmin(bytes32 role) external view returns (bytes32);

    /**
     * @dev Grants `role` to `account`.
     *
     * If `account` had not been already granted `role`, emits a {RoleGranted}
     * event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function grantRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from `account`.
     *
     * If `account` had been granted `role`, emits a {RoleRevoked} event.
     *
     * Requirements:
     *
     * - the caller must have ``role``'s admin role.
     */
    function revokeRole(bytes32 role, address account) external;

    /**
     * @dev Revokes `role` from the calling account.
     *
     * Roles are often managed via {grantRole} and {revokeRole}: this function's
     * purpose is to provide a mechanism for accounts to lose their privileges
     * if they are compromised (such as when a trusted device is misplaced).
     *
     * If the calling account had been granted `role`, emits a {RoleRevoked}
     * event.
     *
     * Requirements:
     *
     * - the caller must be `callerConfirmation`.
     */
    function renounceRole(bytes32 role, address callerConfirmation) external;
}

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

pragma solidity ^0.8.20;

import {IERC165} from "../utils/introspection/IERC165.sol";

/**
 * @dev Interface for the NFT Royalty Standard.
 *
 * A standardized way to retrieve royalty payment information for non-fungible tokens (NFTs) to enable universal
 * support for royalty payments across all NFT marketplaces and ecosystem participants.
 */
interface IERC2981 is IERC165 {
    /**
     * @dev Returns how much royalty is owed and to whom, based on a sale price that may be denominated in any unit of
     * exchange. The royalty amount is denominated and should be paid in that same unit of exchange.
     *
     * NOTE: ERC-2981 allows setting the royalty to 100% of the price. In that case all the price would be sent to the
     * royalty receiver and 0 tokens to the seller. Contracts dealing with royalty should consider empty transfers.
     */
    function royaltyInfo(
        uint256 tokenId,
        uint256 salePrice
    ) external view returns (address receiver, uint256 royaltyAmount);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC6093.sol)
pragma solidity ^0.8.20;

/**
 * @dev Standard ERC-20 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.
 */
interface IERC20Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC20InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC20InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     * @param allowance Amount of tokens a `spender` is allowed to operate with.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC20InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `spender` to be approved. Used in approvals.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC20InvalidSpender(address spender);
}

/**
 * @dev Standard ERC-721 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.
 */
interface IERC721Errors {
    /**
     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-20.
     * Used in balance queries.
     * @param owner Address of the current owner of a token.
     */
    error ERC721InvalidOwner(address owner);

    /**
     * @dev Indicates a `tokenId` whose `owner` is the zero address.
     * @param tokenId Identifier number of a token.
     */
    error ERC721NonexistentToken(uint256 tokenId);

    /**
     * @dev Indicates an error related to the ownership over a particular token. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param tokenId Identifier number of a token.
     * @param owner Address of the current owner of a token.
     */
    error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC721InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC721InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param tokenId Identifier number of a token.
     */
    error ERC721InsufficientApproval(address operator, uint256 tokenId);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC721InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC721InvalidOperator(address operator);
}

/**
 * @dev Standard ERC-1155 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 tokens.
 */
interface IERC1155Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     * @param tokenId Identifier number of a token.
     */
    error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC1155InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC1155InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param owner Address of the current owner of a token.
     */
    error ERC1155MissingApprovalForAll(address operator, address owner);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC1155InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC1155InvalidOperator(address operator);

    /**
     * @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.
     * Used in batch transfers.
     * @param idsLength Length of the array of token identifiers
     * @param valuesLength Length of the array of token amounts
     */
    error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);
}

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

pragma solidity ^0.8.20;

import {IERC721} from "./IERC721.sol";
import {IERC721Metadata} from "./extensions/IERC721Metadata.sol";
import {ERC721Utils} from "./utils/ERC721Utils.sol";
import {Context} from "../../utils/Context.sol";
import {Strings} from "../../utils/Strings.sol";
import {IERC165, ERC165} from "../../utils/introspection/ERC165.sol";
import {IERC721Errors} from "../../interfaces/draft-IERC6093.sol";

/**
 * @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC-721] Non-Fungible Token Standard, including
 * the Metadata extension, but not including the Enumerable extension, which is available separately as
 * {ERC721Enumerable}.
 */
abstract contract ERC721 is Context, ERC165, IERC721, IERC721Metadata, IERC721Errors {
    using Strings for uint256;

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    mapping(uint256 tokenId => address) private _owners;

    mapping(address owner => uint256) private _balances;

    mapping(uint256 tokenId => address) private _tokenApprovals;

    mapping(address owner => mapping(address operator => bool)) private _operatorApprovals;

    /**
     * @dev Initializes the contract by setting a `name` and a `symbol` to the token collection.
     */
    constructor(string memory name_, string memory symbol_) {
        _name = name_;
        _symbol = symbol_;
    }

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override(ERC165, IERC165) returns (bool) {
        return
            interfaceId == type(IERC721).interfaceId ||
            interfaceId == type(IERC721Metadata).interfaceId ||
            super.supportsInterface(interfaceId);
    }

    /**
     * @dev See {IERC721-balanceOf}.
     */
    function balanceOf(address owner) public view virtual returns (uint256) {
        if (owner == address(0)) {
            revert ERC721InvalidOwner(address(0));
        }
        return _balances[owner];
    }

    /**
     * @dev See {IERC721-ownerOf}.
     */
    function ownerOf(uint256 tokenId) public view virtual returns (address) {
        return _requireOwned(tokenId);
    }

    /**
     * @dev See {IERC721Metadata-name}.
     */
    function name() public view virtual returns (string memory) {
        return _name;
    }

    /**
     * @dev See {IERC721Metadata-symbol}.
     */
    function symbol() public view virtual returns (string memory) {
        return _symbol;
    }

    /**
     * @dev See {IERC721Metadata-tokenURI}.
     */
    function tokenURI(uint256 tokenId) public view virtual returns (string memory) {
        _requireOwned(tokenId);

        string memory baseURI = _baseURI();
        return bytes(baseURI).length > 0 ? string.concat(baseURI, tokenId.toString()) : "";
    }

    /**
     * @dev Base URI for computing {tokenURI}. If set, the resulting URI for each
     * token will be the concatenation of the `baseURI` and the `tokenId`. Empty
     * by default, can be overridden in child contracts.
     */
    function _baseURI() internal view virtual returns (string memory) {
        return "";
    }

    /**
     * @dev See {IERC721-approve}.
     */
    function approve(address to, uint256 tokenId) public virtual {
        _approve(to, tokenId, _msgSender());
    }

    /**
     * @dev See {IERC721-getApproved}.
     */
    function getApproved(uint256 tokenId) public view virtual returns (address) {
        _requireOwned(tokenId);

        return _getApproved(tokenId);
    }

    /**
     * @dev See {IERC721-setApprovalForAll}.
     */
    function setApprovalForAll(address operator, bool approved) public virtual {
        _setApprovalForAll(_msgSender(), operator, approved);
    }

    /**
     * @dev See {IERC721-isApprovedForAll}.
     */
    function isApprovedForAll(address owner, address operator) public view virtual returns (bool) {
        return _operatorApprovals[owner][operator];
    }

    /**
     * @dev See {IERC721-transferFrom}.
     */
    function transferFrom(address from, address to, uint256 tokenId) public virtual {
        if (to == address(0)) {
            revert ERC721InvalidReceiver(address(0));
        }
        // Setting an "auth" arguments enables the `_isAuthorized` check which verifies that the token exists
        // (from != 0). Therefore, it is not needed to verify that the return value is not 0 here.
        address previousOwner = _update(to, tokenId, _msgSender());
        if (previousOwner != from) {
            revert ERC721IncorrectOwner(from, tokenId, previousOwner);
        }
    }

    /**
     * @dev See {IERC721-safeTransferFrom}.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId) public {
        safeTransferFrom(from, to, tokenId, "");
    }

    /**
     * @dev See {IERC721-safeTransferFrom}.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes memory data) public virtual {
        transferFrom(from, to, tokenId);
        ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
    }

    /**
     * @dev Returns the owner of the `tokenId`. Does NOT revert if token doesn't exist
     *
     * IMPORTANT: Any overrides to this function that add ownership of tokens not tracked by the
     * core ERC-721 logic MUST be matched with the use of {_increaseBalance} to keep balances
     * consistent with ownership. The invariant to preserve is that for any address `a` the value returned by
     * `balanceOf(a)` must be equal to the number of tokens such that `_ownerOf(tokenId)` is `a`.
     */
    function _ownerOf(uint256 tokenId) internal view virtual returns (address) {
        return _owners[tokenId];
    }

    /**
     * @dev Returns the approved address for `tokenId`. Returns 0 if `tokenId` is not minted.
     */
    function _getApproved(uint256 tokenId) internal view virtual returns (address) {
        return _tokenApprovals[tokenId];
    }

    /**
     * @dev Returns whether `spender` is allowed to manage `owner`'s tokens, or `tokenId` in
     * particular (ignoring whether it is owned by `owner`).
     *
     * WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
     * assumption.
     */
    function _isAuthorized(address owner, address spender, uint256 tokenId) internal view virtual returns (bool) {
        return
            spender != address(0) &&
            (owner == spender || isApprovedForAll(owner, spender) || _getApproved(tokenId) == spender);
    }

    /**
     * @dev Checks if `spender` can operate on `tokenId`, assuming the provided `owner` is the actual owner.
     * Reverts if:
     * - `spender` does not have approval from `owner` for `tokenId`.
     * - `spender` does not have approval to manage all of `owner`'s assets.
     *
     * WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
     * assumption.
     */
    function _checkAuthorized(address owner, address spender, uint256 tokenId) internal view virtual {
        if (!_isAuthorized(owner, spender, tokenId)) {
            if (owner == address(0)) {
                revert ERC721NonexistentToken(tokenId);
            } else {
                revert ERC721InsufficientApproval(spender, tokenId);
            }
        }
    }

    /**
     * @dev Unsafe write access to the balances, used by extensions that "mint" tokens using an {ownerOf} override.
     *
     * NOTE: the value is limited to type(uint128).max. This protect against _balance overflow. It is unrealistic that
     * a uint256 would ever overflow from increments when these increments are bounded to uint128 values.
     *
     * WARNING: Increasing an account's balance using this function tends to be paired with an override of the
     * {_ownerOf} function to resolve the ownership of the corresponding tokens so that balances and ownership
     * remain consistent with one another.
     */
    function _increaseBalance(address account, uint128 value) internal virtual {
        unchecked {
            _balances[account] += value;
        }
    }

    /**
     * @dev Transfers `tokenId` from its current owner to `to`, or alternatively mints (or burns) if the current owner
     * (or `to`) is the zero address. Returns the owner of the `tokenId` before the update.
     *
     * The `auth` argument is optional. If the value passed is non 0, then this function will check that
     * `auth` is either the owner of the token, or approved to operate on the token (by the owner).
     *
     * Emits a {Transfer} event.
     *
     * NOTE: If overriding this function in a way that tracks balances, see also {_increaseBalance}.
     */
    function _update(address to, uint256 tokenId, address auth) internal virtual returns (address) {
        address from = _ownerOf(tokenId);

        // Perform (optional) operator check
        if (auth != address(0)) {
            _checkAuthorized(from, auth, tokenId);
        }

        // Execute the update
        if (from != address(0)) {
            // Clear approval. No need to re-authorize or emit the Approval event
            _approve(address(0), tokenId, address(0), false);

            unchecked {
                _balances[from] -= 1;
            }
        }

        if (to != address(0)) {
            unchecked {
                _balances[to] += 1;
            }
        }

        _owners[tokenId] = to;

        emit Transfer(from, to, tokenId);

        return from;
    }

    /**
     * @dev Mints `tokenId` and transfers it to `to`.
     *
     * WARNING: Usage of this method is discouraged, use {_safeMint} whenever possible
     *
     * Requirements:
     *
     * - `tokenId` must not exist.
     * - `to` cannot be the zero address.
     *
     * Emits a {Transfer} event.
     */
    function _mint(address to, uint256 tokenId) internal {
        if (to == address(0)) {
            revert ERC721InvalidReceiver(address(0));
        }
        address previousOwner = _update(to, tokenId, address(0));
        if (previousOwner != address(0)) {
            revert ERC721InvalidSender(address(0));
        }
    }

    /**
     * @dev Mints `tokenId`, transfers it to `to` and checks for `to` acceptance.
     *
     * Requirements:
     *
     * - `tokenId` must not exist.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function _safeMint(address to, uint256 tokenId) internal {
        _safeMint(to, tokenId, "");
    }

    /**
     * @dev Same as {xref-ERC721-_safeMint-address-uint256-}[`_safeMint`], with an additional `data` parameter which is
     * forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
     */
    function _safeMint(address to, uint256 tokenId, bytes memory data) internal virtual {
        _mint(to, tokenId);
        ERC721Utils.checkOnERC721Received(_msgSender(), address(0), to, tokenId, data);
    }

    /**
     * @dev Destroys `tokenId`.
     * The approval is cleared when the token is burned.
     * This is an internal function that does not check if the sender is authorized to operate on the token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     *
     * Emits a {Transfer} event.
     */
    function _burn(uint256 tokenId) internal {
        address previousOwner = _update(address(0), tokenId, address(0));
        if (previousOwner == address(0)) {
            revert ERC721NonexistentToken(tokenId);
        }
    }

    /**
     * @dev Transfers `tokenId` from `from` to `to`.
     *  As opposed to {transferFrom}, this imposes no restrictions on msg.sender.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     *
     * Emits a {Transfer} event.
     */
    function _transfer(address from, address to, uint256 tokenId) internal {
        if (to == address(0)) {
            revert ERC721InvalidReceiver(address(0));
        }
        address previousOwner = _update(to, tokenId, address(0));
        if (previousOwner == address(0)) {
            revert ERC721NonexistentToken(tokenId);
        } else if (previousOwner != from) {
            revert ERC721IncorrectOwner(from, tokenId, previousOwner);
        }
    }

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`, checking that contract recipients
     * are aware of the ERC-721 standard to prevent tokens from being forever locked.
     *
     * `data` is additional data, it has no specified format and it is sent in call to `to`.
     *
     * This internal function is like {safeTransferFrom} in the sense that it invokes
     * {IERC721Receiver-onERC721Received} on the receiver, and can be used to e.g.
     * implement alternative mechanisms to perform token transfer, such as signature-based.
     *
     * Requirements:
     *
     * - `tokenId` token must exist and be owned by `from`.
     * - `to` cannot be the zero address.
     * - `from` cannot be the zero address.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function _safeTransfer(address from, address to, uint256 tokenId) internal {
        _safeTransfer(from, to, tokenId, "");
    }

    /**
     * @dev Same as {xref-ERC721-_safeTransfer-address-address-uint256-}[`_safeTransfer`], with an additional `data` parameter which is
     * forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
     */
    function _safeTransfer(address from, address to, uint256 tokenId, bytes memory data) internal virtual {
        _transfer(from, to, tokenId);
        ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
    }

    /**
     * @dev Approve `to` to operate on `tokenId`
     *
     * The `auth` argument is optional. If the value passed is non 0, then this function will check that `auth` is
     * either the owner of the token, or approved to operate on all tokens held by this owner.
     *
     * Emits an {Approval} event.
     *
     * Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
     */
    function _approve(address to, uint256 tokenId, address auth) internal {
        _approve(to, tokenId, auth, true);
    }

    /**
     * @dev Variant of `_approve` with an optional flag to enable or disable the {Approval} event. The event is not
     * emitted in the context of transfers.
     */
    function _approve(address to, uint256 tokenId, address auth, bool emitEvent) internal virtual {
        // Avoid reading the owner unless necessary
        if (emitEvent || auth != address(0)) {
            address owner = _requireOwned(tokenId);

            // We do not use _isAuthorized because single-token approvals should not be able to call approve
            if (auth != address(0) && owner != auth && !isApprovedForAll(owner, auth)) {
                revert ERC721InvalidApprover(auth);
            }

            if (emitEvent) {
                emit Approval(owner, to, tokenId);
            }
        }

        _tokenApprovals[tokenId] = to;
    }

    /**
     * @dev Approve `operator` to operate on all of `owner` tokens
     *
     * Requirements:
     * - operator can't be the address zero.
     *
     * Emits an {ApprovalForAll} event.
     */
    function _setApprovalForAll(address owner, address operator, bool approved) internal virtual {
        if (operator == address(0)) {
            revert ERC721InvalidOperator(operator);
        }
        _operatorApprovals[owner][operator] = approved;
        emit ApprovalForAll(owner, operator, approved);
    }

    /**
     * @dev Reverts if the `tokenId` doesn't have a current owner (it hasn't been minted, or it has been burned).
     * Returns the owner.
     *
     * Overrides to ownership logic should be done to {_ownerOf}.
     */
    function _requireOwned(uint256 tokenId) internal view returns (address) {
        address owner = _ownerOf(tokenId);
        if (owner == address(0)) {
            revert ERC721NonexistentToken(tokenId);
        }
        return owner;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721.sol)

pragma solidity ^0.8.20;

import {IERC165} from "../../utils/introspection/IERC165.sol";

/**
 * @dev Required interface of an ERC-721 compliant contract.
 */
interface IERC721 is IERC165 {
    /**
     * @dev Emitted when `tokenId` token is transferred from `from` to `to`.
     */
    event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.
     */
    event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.
     */
    event ApprovalForAll(address indexed owner, address indexed operator, bool approved);

    /**
     * @dev Returns the number of tokens in ``owner``'s account.
     */
    function balanceOf(address owner) external view returns (uint256 balance);

    /**
     * @dev Returns the owner of the `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function ownerOf(uint256 tokenId) external view returns (address owner);

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
     *   a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes calldata data) external;

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients
     * are aware of the ERC-721 protocol to prevent tokens from being forever locked.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must have been allowed to move this token by either {approve} or
     *   {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
     *   a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Transfers `tokenId` token from `from` to `to`.
     *
     * WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC-721
     * or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must
     * understand this adds an external call which potentially creates a reentrancy vulnerability.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Gives permission to `to` to transfer `tokenId` token to another account.
     * The approval is cleared when the token is transferred.
     *
     * Only a single account can be approved at a time, so approving the zero address clears previous approvals.
     *
     * Requirements:
     *
     * - The caller must own the token or be an approved operator.
     * - `tokenId` must exist.
     *
     * Emits an {Approval} event.
     */
    function approve(address to, uint256 tokenId) external;

    /**
     * @dev Approve or remove `operator` as an operator for the caller.
     * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.
     *
     * Requirements:
     *
     * - The `operator` cannot be the address zero.
     *
     * Emits an {ApprovalForAll} event.
     */
    function setApprovalForAll(address operator, bool approved) external;

    /**
     * @dev Returns the account approved for `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function getApproved(uint256 tokenId) external view returns (address operator);

    /**
     * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.
     *
     * See {setApprovalForAll}
     */
    function isApprovedForAll(address owner, address operator) external view returns (bool);
}

File 12 of 22 : IERC721Receiver.sol
// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721Receiver.sol)

pragma solidity ^0.8.20;

/**
 * @title ERC-721 token receiver interface
 * @dev Interface for any contract that wants to support safeTransfers
 * from ERC-721 asset contracts.
 */
interface IERC721Receiver {
    /**
     * @dev Whenever an {IERC721} `tokenId` token is transferred to this contract via {IERC721-safeTransferFrom}
     * by `operator` from `from`, this function is called.
     *
     * It must return its Solidity selector to confirm the token transfer.
     * If any other value is returned or the interface is not implemented by the recipient, the transfer will be
     * reverted.
     *
     * The selector can be obtained in Solidity with `IERC721Receiver.onERC721Received.selector`.
     */
    function onERC721Received(
        address operator,
        address from,
        uint256 tokenId,
        bytes calldata data
    ) external returns (bytes4);
}

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

pragma solidity ^0.8.20;

/**
 * @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 Context {
    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/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.0.0) (utils/Pausable.sol)

pragma solidity ^0.8.20;

import {Context} from "../utils/Context.sol";

/**
 * @dev Contract module which allows children to implement an emergency stop
 * mechanism that can be triggered by an authorized account.
 *
 * This module is used through inheritance. It will make available the
 * modifiers `whenNotPaused` and `whenPaused`, which can be applied to
 * the functions of your contract. Note that they will not be pausable by
 * simply including this module, only once the modifiers are put in place.
 */
abstract contract Pausable is Context {
    bool private _paused;

    /**
     * @dev Emitted when the pause is triggered by `account`.
     */
    event Paused(address account);

    /**
     * @dev Emitted when the pause is lifted by `account`.
     */
    event Unpaused(address account);

    /**
     * @dev The operation failed because the contract is paused.
     */
    error EnforcedPause();

    /**
     * @dev The operation failed because the contract is not paused.
     */
    error ExpectedPause();

    /**
     * @dev Initializes the contract in unpaused state.
     */
    constructor() {
        _paused = false;
    }

    /**
     * @dev Modifier to make a function callable only when the contract is not paused.
     *
     * Requirements:
     *
     * - The contract must not be paused.
     */
    modifier whenNotPaused() {
        _requireNotPaused();
        _;
    }

    /**
     * @dev Modifier to make a function callable only when the contract is paused.
     *
     * Requirements:
     *
     * - The contract must be paused.
     */
    modifier whenPaused() {
        _requirePaused();
        _;
    }

    /**
     * @dev Returns true if the contract is paused, and false otherwise.
     */
    function paused() public view virtual returns (bool) {
        return _paused;
    }

    /**
     * @dev Throws if the contract is paused.
     */
    function _requireNotPaused() internal view virtual {
        if (paused()) {
            revert EnforcedPause();
        }
    }

    /**
     * @dev Throws if the contract is not paused.
     */
    function _requirePaused() internal view virtual {
        if (!paused()) {
            revert ExpectedPause();
        }
    }

    /**
     * @dev Triggers stopped state.
     *
     * Requirements:
     *
     * - The contract must not be paused.
     */
    function _pause() internal virtual whenNotPaused {
        _paused = true;
        emit Paused(_msgSender());
    }

    /**
     * @dev Returns to normal state.
     *
     * Requirements:
     *
     * - The contract must be paused.
     */
    function _unpause() internal virtual whenPaused {
        _paused = false;
        emit Unpaused(_msgSender());
    }
}

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

pragma solidity ^0.8.20;

/**
 * @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 ReentrancyGuard {
    // 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;

    uint256 private _status;

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

    constructor() {
        _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 {
        // 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 {
        // 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) {
        return _status == ENTERED;
    }
}

// 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
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/ERC165.sol)

pragma solidity ^0.8.20;

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

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC-165 should inherit from this contract and override {supportsInterface} to check
 * for the additional interface id that will be supported. For example:
 *
 * ```solidity
 * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
 *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
 * }
 * ```
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[ERC].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

// 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;
    }
}

File 21 of 22 : SafeCast.sol
// 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);
        }
    }
}

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

Contract Security Audit

Contract ABI

API
[{"inputs":[{"internalType":"address","name":"_oldContract","type":"address"},{"internalType":"address","name":"_frogsBackdrop","type":"address"},{"internalType":"address","name":"_frogsOneOfOne","type":"address"},{"internalType":"address","name":"_frogsBody","type":"address"},{"internalType":"address","name":"_frogsHats","type":"address"},{"internalType":"address","name":"_frogsEyesA","type":"address"},{"internalType":"address","name":"_frogsEyesB","type":"address"},{"internalType":"address","name":"_frogsMouth","type":"address"},{"internalType":"address","name":"_frogsFeet","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AccessControlBadConfirmation","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"bytes32","name":"neededRole","type":"bytes32"}],"name":"AccessControlUnauthorizedAccount","type":"error"},{"inputs":[],"name":"BatchSizeToLarge","type":"error"},{"inputs":[{"internalType":"uint256","name":"numerator","type":"uint256"},{"internalType":"uint256","name":"denominator","type":"uint256"}],"name":"ERC2981InvalidDefaultRoyalty","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC2981InvalidDefaultRoyaltyReceiver","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint256","name":"numerator","type":"uint256"},{"internalType":"uint256","name":"denominator","type":"uint256"}],"name":"ERC2981InvalidTokenRoyalty","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC2981InvalidTokenRoyaltyReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[],"name":"EnforcedPause","type":"error"},{"inputs":[],"name":"ExpectedPause","type":"error"},{"inputs":[],"name":"NoTokenIDsProvided","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"actual","type":"address"},{"internalType":"address","name":"sender","type":"address"}],"name":"NotOwnerOfOldNFT","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"TokenAlreadyMigrated","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"TokenNotMigratedYet","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"actualOwner","type":"address"}],"name":"DebugOwner","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"account","type":"address"}],"name":"Paused","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"previousAdminRole","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"newAdminRole","type":"bytes32"}],"name":"RoleAdminChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleGranted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleRevoked","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"migrationBatch","type":"uint256"}],"name":"TokenMigrated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"TokenMigrated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"account","type":"address"}],"name":"Unpaused","type":"event"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"},{"internalType":"address","name":"recipient","type":"address"}],"name":"adminMigrate","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"batchClaim","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"buildSVG","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"checkMigrationStatus","outputs":[{"internalType":"bool[]","name":"statuses","type":"bool[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"claimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsBackdrop","outputs":[{"internalType":"contract IFrogsBackdrop","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsBody","outputs":[{"internalType":"contract IFrogsBody","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsEyesA","outputs":[{"internalType":"contract IFrogsEyesA","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsEyesB","outputs":[{"internalType":"contract IFrogsEyesB","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsFeet","outputs":[{"internalType":"contract IFrogsFeet","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsHats","outputs":[{"internalType":"contract IFrogsHats","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsMouth","outputs":[{"internalType":"contract IFrogsMouth","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"frogsOneOfOne","outputs":[{"internalType":"contract IFrogsOneOfOne","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleAdmin","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"grantRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"hasRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"markAsMigrated","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"oldContract","outputs":[{"internalType":"contract IHyperFrogs","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pause","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"paused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"callerConfirmation","type":"address"}],"name":"renounceRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"revokeRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint256","name":"salePrice","type":"uint256"}],"name":"royaltyInfo","outputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"tokenTraits","outputs":[{"internalType":"bool","name":"oneOfOne","type":"bool"},{"internalType":"uint256","name":"oneOfOneIndex","type":"uint256"},{"internalType":"uint256","name":"backdrop","type":"uint256"},{"internalType":"uint256","name":"hat","type":"uint256"},{"internalType":"uint256","name":"eyesIndex","type":"uint256"},{"internalType":"bool","name":"eyesIsA","type":"bool"},{"internalType":"uint256","name":"mouth","type":"uint256"},{"internalType":"uint256","name":"body","type":"uint256"},{"internalType":"uint256","name":"feet","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalMigrated","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"unpause","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60806040523461050b57613ac2610120813803918261001d81610510565b93849283398101031261050b5761003381610535565b9061004060208201610535565b61004c60408301610535565b61005860608401610535565b61006460808501610535565b9061007160a08601610535565b9261007e60c08701610535565b9461009861010061009160e08a01610535565b9801610535565b976100a36040610510565b600b81526a48797065722046726f677360a81b60208201526100c56040610510565b6004815263242ca31960e11b6020820152815190916001600160401b0382116102ad5760005490600182811c92168015610501575b60208310146104015781601f849311610492575b50602090601f831160011461042c57600092610421575b50508160011b916000199060031b1c1916176000555b8051906001600160401b0382116102ad5760015490600182811c92168015610417575b60208310146104015781601f849311610391575b50602090601f83116001146103295760009261031e575b50508160011b916000199060031b1c1916176001555b6007805460ff1916905560016008556001600160a01b031680156102d957600c80546001600160a01b0319908116929092179055600f805482166001600160a01b03938416179055601080548216938316939093179092556011805483169382169390931790925560128054821693831693909317909255601380548316938216939093179092556014805482169383169390931790925560158054831693821693909317909255601680549091169290911691909117905533156102c357604080519081016001600160401b038111828210176102ad576040523380825261015e60209092019190915260af60a11b811760095561029d90610549565b506040516134ca90816105d88239f35b634e487b7160e01b600052604160045260246000fd5b635b6cc80560e11b600052600060045260246000fd5b60405162461bcd60e51b815260206004820152601c60248201527f496e76616c6964206f6c6420636f6e74726163742061646472657373000000006044820152606490fd5b015190503880610189565b600160009081528281209350601f198516905b8181106103795750908460019594939210610360575b505050811b0160015561019f565b015160001960f88460031b161c19169055388080610352565b9293602060018192878601518155019501930161033c565b60016000529091507fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6601f840160051c810191602085106103f7575b90601f859493920160051c01905b8181106103e85750610172565b600081558493506001016103db565b90915081906103cd565b634e487b7160e01b600052602260045260246000fd5b91607f169161015e565b015190503880610125565b60008080528281209350601f198516905b81811061047a5750908460019594939210610461575b505050811b0160005561013b565b015160001960f88460031b161c19169055388080610453565b9293602060018192878601518155019501930161043d565b600080529091507f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563601f840160051c810191602085106104f7575b90601f859493920160051c01905b8181106104e8575061010e565b600081558493506001016104db565b90915081906104cd565b91607f16916100fa565b600080fd5b6040519190601f01601f191682016001600160401b038111838210176102ad57604052565b51906001600160a01b038216820361050b57565b6001600160a01b0381166000908152600080516020613aa2833981519152602052604090205460ff166105d1576001600160a01b03166000818152600080516020613aa283398151915260205260408120805460ff191660011790553391907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d8180a4600190565b5060009056fe608080604052600436101561001357600080fd5b60003560e01c90816301ffc9a7146117e95750806306fdde031461172e578063081812fc146116ef578063095ea7b3146115f957806323b872dd146115e2578063248a9ca3146115ad5780632a55205a1461150a5780632c3f9afd146114e35780632f2ff15d146114a357806330503c4e1461147c57806332b7e8e61461145557806336568abe1461140f5780633e53eb28146113f05780633f4ba83a146113875780633f9d55f01461136057806342842e0e1461133057806350fadca8146110cc5780635c975abb146110a95780636352211e1461107a57806370a08231146110245780638456cb5914610fca5780638fdd2ee514610f5957806391d1485414610f0b5780639312afa114610ee457806395a0f5eb14610ec657806395d89b4114610dce578063a217fddf14610db2578063a22cb46514610d08578063a6c377ef14610ce1578063a882efd814610cba578063adb5f7e114610c93578063b88d4fde14610bfe578063bc292782146107e4578063c82cac1c146107bd578063c87b56dd1461044c578063d1ae3e2b1461033f578063d547741f146102f8578063dbe7e3bd146102c7578063e05c57bf146102395763e985e9c5146101d757600080fd5b34610234576040366003190112610234576101f06118b4565b6001600160a01b036102006118ca565b911660005260056020526001600160a01b0360406000209116600052602052602060ff604060002054166040519015158152f35b600080fd5b3461023457602036600319011261023457600435600052600e602052610120604060002060ff8154169060018101549060028101546003820154600483015460ff60058501541691600685015493600860078701549601549660405198151589526020890152604088015260608701526080860152151560a085015260c084015260e0830152610100820152f35b3461023457602036600319011261023457600435600052600d602052602060ff604060002054166040519015158152f35b346102345760403660031901126102345761033d6004356103176118ca565b9061033861033382600052600660205260016040600020015490565b6125e2565b6126c3565b005b346102345760203660031901126102345760043567ffffffffffffffff81116102345761037090369060040161191a565b9061037a826124d3565b90610388604051928361197e565b828252610394836124d3565b602083019390601f190136853760005b8181106103f3575050506040519182916020830190602084525180915260408301919060005b8181106103d8575050500390f35b825115158452859450602093840193909201916001016103ca565b610401818385969795612458565b35600052600d60205260ff6040600020541690855181101561043657600191151560208260051b8801015201939291936103a4565b634e487b7160e01b600052603260045260246000fd5b346102345760203660031901126102345760043561047161046c82611c64565b612b8d565b60009082807a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000811015610795575b806d04ee2d6d415b85acef8100000000600a92101561077a575b662386f26fc10000811015610766575b6305f5e100811015610755575b612710811015610746575b6064811015610738575b101561072d575b600a60216104fd60018601612bf4565b948501015b60001901917f30313233343536373839616263646566000000000000000000000000000000008282061a83530490811561053e57600a90610502565b6107296106c18461046c6002602689606d6105588d612c26565b9560366040519788947f7b226e616d65223a202248797065722046726f67202300000000000000000000602087015261059a815180926020868a01910161186c565b850161088b60f21b838201527f226465736372697074696f6e223a202248797065722046726f6773206172652060388201527f70757265204153434949206172742066726f677320616e64206c69766520313060588201527f3025206f6e636861696e206f6e2048797065726c69717569642e222c0000000060788201527f2261747472696275746573223a205b0000000000000000000000000000000000609482015261065282518093602060a38501910161186c565b010161174b60f21b838201527f22696d616765223a2022646174613a696d6167652f7376672b786d6c3b626173606f82015263194d8d0b60e21b608f8201526106a582518093602060938501910161186c565b010161227d60f01b838201520301601d1981018452018261197e565b610715603d60405180937f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000006020830152610704815180926020868601910161186c565b81010301601f19810183528261197e565b60405191829160208352602083019061188f565b0390f35b6001909201916104ed565b6064600291049401936104e6565b612710600491049401936104dc565b6305f5e100600891049401936104d1565b662386f26fc10000601091049401936104c4565b6d04ee2d6d415b85acef8100000000602091049401936104b4565b50604092507a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000840461049a565b346102345760003660031901126102345760206001600160a01b03600f5416604051908152f35b346102345760203660031901126102345760043567ffffffffffffffff81116102345761081590369060040161191a565b9061081e612b70565b600260085414610bed576002600855600b54918015610bdc5760148111610bcb5760005b818110610850576001600855005b61085b818385612458565b359081600052600d60205260ff60406000205416610bb6576001600160a01b03600c54166040516331a9108f60e11b8152836004820152602081602481855afa908115610ade57600091610b67575b506001600160a01b0316338103610b4b57506101206024916040519283809263e05c57bf60e01b82528760048301525afa8015610ade57600090818283848591869387958897610b03575b6008989950906109a5949392916040519a61090f8c61194b565b15158b5260208b0190815260408b0191825260608b0192835260808b0193845260a08b01941515855260c08b0196875260e08b019788526101008b019889528c600052600e60205261097560406000209b5115158c9060ff801983541691151516179055565b5160018b01555160028a0155516003890155516004880155511515600587019060ff801983541691151516179055565b516006850155516007840155519101556109bf8233612824565b81600052600d6020526040600020600160ff198254161790556109e3600b546124c4565b600b55816040518681527ff514c4806c74fdbf9c0a2f2da65792b2e34a9384d0285d4a211dd5dab9af9d6360203392a36001600160a01b03600c5416803b156102345760008091602460405180948193630852cd8d60e31b83528860048401525af19081610af2575b50610aea576001600160a01b03600c541691823b1561023457600080936064604051809681936323b872dd60e01b83523360048401528060248401528660448401525af1928315610ade57600193610acd575b505b337fe30a28750cac72ac01f8b35589582c826b166086b59d0a6ffb19965110b90a94600080a301610842565b6000610ad89161197e565b86610a9f565b6040513d6000823e3d90fd5b600191610aa1565b6000610afd9161197e565b86610a4c565b5050505050505050506008610b326109a5926101203d8111610b44575b610b2a818361197e565b810190612475565b979950899850959094919391906108f5565b503d610b20565b8363215e156760e21b6000526004526024523360445260646000fd5b6020813d8211610bae575b81610b7f6020938361197e565b81010312610baa5751906001600160a01b0382168203610ba757506001600160a01b036108aa565b80fd5b5080fd5b3d9150610b72565b50636c3903c760e11b60005260045260246000fd5b63548f213760e01b60005260046000fd5b63ceb7371d60e01b60005260046000fd5b633ee5aeb560e01b60005260046000fd5b3461023457608036600319011261023457610c176118b4565b610c1f6118ca565b906044356064359267ffffffffffffffff8411610234573660238501121561023457836004013592610c50846119a0565b93610c5e604051958661197e565b808552366024828801011161023457602081600092602461033d99018389013786010152610c8d8383836119bc565b33612a48565b346102345760003660031901126102345760206001600160a01b0360155416604051908152f35b346102345760003660031901126102345760206001600160a01b0360135416604051908152f35b346102345760003660031901126102345760206001600160a01b0360115416604051908152f35b3461023457604036600319011261023457610d216118b4565b6024359081151590818303610234576001600160a01b0316918215610d9d57610d6f9033600052600560205260406000208460005260205260406000209060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b82630b61174360e31b60005260045260246000fd5b3461023457600036600319011261023457602060405160008152f35b346102345760003660031901126102345760405160006001548060011c90600181168015610ebc575b602083108114610ea857828552908115610e845750600114610e24575b610729836107158185038261197e565b91905060016000527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6916000905b808210610e6a57509091508101602001610715610e14565b919260018160209254838588010152019101909291610e52565b60ff191660208086019190915291151560051b840190910191506107159050610e14565b634e487b7160e01b84526022600452602484fd5b91607f1691610df7565b34610234576000366003190112610234576020600b54604051908152f35b346102345760003660031901126102345760206001600160a01b0360105416604051908152f35b3461023457604036600319011261023457610f246118ca565b60043560005260066020526001600160a01b0360406000209116600052602052602060ff604060002054166040519015158152f35b346102345760203660031901126102345760043567ffffffffffffffff811161023457610f8a90369060040161191a565b610f9261258f565b60005b818110610f9e57005b80610fac6001928486612458565b35600052600d60205260406000208260ff1982541617905501610f95565b3461023457600036600319011261023457610fe361258f565b610feb612b70565b600160ff1960075416176007557f62e78cea01bee320cd4e420270b5ea74000d11b0c9f74754ebdbfc544b05a2586020604051338152a1005b34610234576020366003190112610234576001600160a01b036110456118b4565b1680156110645760005260036020526020604060002054604051908152f35b6322718ad960e21b600052600060045260246000fd5b34610234576020366003190112610234576020611098600435612558565b6001600160a01b0360405191168152f35b3461023457600036600319011261023457602060ff600754166040519015158152f35b346102345760403660031901126102345760043567ffffffffffffffff8111610234576110fd90369060040161191a565b906111066118ca565b9161110f61258f565b6001600160a01b0383169060005b81811061112657005b611131818386612458565b359081600052600d60205260ff604060002054166112eb576024916101206001600160a01b03600c54166040519485809263e05c57bf60e01b82528560048301525afa928315610ade576001936000908182838485918693879588976112b3575b600898995090611241949392916040519a6111ac8c61194b565b15158b5260208b0190815260408b0191825260608b0192835260808b0193845260a08b01941515855260c08b0196875260e08b019788526101008b019889528b600052600e60205261121260406000209b5115158c9060ff801983541691151516179055565b518d8b01555160028a0155516003890155516004880155511515600587019060ff801983541691151516179055565b5160068501555160078401555191015561125b8188612824565b80600052600d60205260406000208360ff19825416179055847ff514c4806c74fdbf9c0a2f2da65792b2e34a9384d0285d4a211dd5dab9af9d6360206112a2600b546124c4565b80600b55604051908152a30161111d565b50505050505050505060086112d9611241926101203d8111610b4457610b2a818361197e565b97995089985095909491939190611192565b60405162461bcd60e51b815260206004820152601660248201527f546f6b656e20616c7265616479206d69677261746564000000000000000000006044820152606490fd5b346102345761033d611341366118e0565b906040519261135160208561197e565b60008452610c8d8383836119bc565b346102345760003660031901126102345760206001600160a01b0360145416604051908152f35b34610234576000366003190112610234576113a061258f565b60075460ff8116156113df5760ff19166007557f5db9ee0a495bf2e6ff9c91a7834c1ba4fdd244a5e8aa4e537bd38aeae4b073aa6020604051338152a1005b638dfc202b60e01b60005260046000fd5b3461023457602036600319011261023457610729610715600435611c64565b34610234576040366003190112610234576114286118ca565b336001600160a01b038216036114445761033d906004356126c3565b63334bd91960e11b60005260046000fd5b346102345760003660031901126102345760206001600160a01b0360165416604051908152f35b346102345760003660031901126102345760206001600160a01b03600c5416604051908152f35b346102345760403660031901126102345761033d6004356114c26118ca565b906114de61033382600052600660205260016040600020015490565b612629565b346102345760003660031901126102345760206001600160a01b0360125416604051908152f35b3461023457604036600319011261023457602435600435600052600a6020526040600020546001600160a01b0381169060a01c8115611595575b6bffffffffffffffffffffffff169182810292818404149015171561157f57612710604092046001600160a01b038351921682526020820152f35b634e487b7160e01b600052601160045260246000fd5b50506009546001600160a01b0381169060a01c611544565b346102345760203660031901126102345760206115da600435600052600660205260016040600020015490565b604051908152f35b346102345761033d6115f3366118e0565b916119bc565b34610234576040366003190112610234576116126118b4565b60243561161e81612558565b331515806116dc575b806116a5575b6116905781906001600160a01b0380851691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925600080a460005260046020526001600160a01b03604060002091166001600160a01b0319825416179055600080f35b63a9fbf51f60e01b6000523360045260246000fd5b506001600160a01b038116600052600560205260406000206001600160a01b03331660005260205260ff604060002054161561162d565b50336001600160a01b0382161415611627565b346102345760203660031901126102345760043561170c81612558565b50600052600460205260206001600160a01b0360406000205416604051908152f35b3461023457600036600319011261023457604051600080548060011c906001811680156117df575b602083108114610ea857828552908115610e84575060011461178257610729836107158185038261197e565b60008080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b8082106117c557509091508101602001610715610e14565b9192600181602092548385880101520191019092916117ad565b91607f1691611756565b3461023457602036600319011261023457600435906001600160e01b03198216808303610234578261181c6020946124eb565b918215611843575b508115611833575b5015158152f35b61183d915061252f565b8361182c565b90915063152a902d60e11b14801561185d575b9084611824565b506118678161252f565b611856565b60005b83811061187f5750506000910152565b818101518382015260200161186f565b906020916118a88151809281855285808601910161186c565b601f01601f1916010190565b600435906001600160a01b038216820361023457565b602435906001600160a01b038216820361023457565b6060906003190112610234576004356001600160a01b038116810361023457906024356001600160a01b0381168103610234579060443590565b9181601f840112156102345782359167ffffffffffffffff8311610234576020808501948460051b01011161023457565b610120810190811067ffffffffffffffff82111761196857604052565b634e487b7160e01b600052604160045260246000fd5b90601f8019910116810190811067ffffffffffffffff82111761196857604052565b67ffffffffffffffff811161196857601f01601f191660200190565b91906001600160a01b0316918215611b51576000908282526002602052826001600160a01b03604084205416948533151580611aaf575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6001600160a01b039582611a75575b8381526003602052604081206001815401905584815260026020526040812084881982541617905580a416808303611a5b57505050565b6364283d7b60e01b60005260045260245260445260646000fd5b611a9685600052600460205260406000206001600160a01b03198154169055565b8281526003602052604081208054600019019055611a24565b91939492505080611afa575b15611acb579190839085386119f3565b839085611ae457602491637e27328960e01b8252600452fd5b60449163177e802f60e01b825233600452602452fd5b503385148015611b28575b80611abb57508381526004602052336001600160a01b0360408320541614611abb565b508481526005602052604081206001600160a01b033316825260205260ff604082205416611b05565b633250574960e11b600052600060045260246000fd5b6020818303126102345780519067ffffffffffffffff8211610234570181601f820112156102345760208151910190611b9f816119a0565b92611bad604051948561197e565b8184528183011161023457611bc691602084019061186c565b90565b7f3c73766720786d6c6e733d22687474703a2f2f7777772e77332e6f72672f323081527f30302f737667222076696577426f783d2230203020393020393022207368617060208201527f652d72656e646572696e673d2263726973704564676573222077696474683d2260408201527f35313222206865696768743d22353132223e0000000000000000000000000000606082015260720190565b80600052600d60205260ff604060002054161561244457600052600e6020526040600020604051611c948161194b565b60ff8254161515808252600183015491602081019283526002840154916040820193838552600386015493606084019485526004870154906080850191825260ff6005890154169260a08601931515845260068901549460c08701958652610100600860078c01549b60e08a019c8d52015497019687526121a05750506001600160a01b03600f541696865196604051976336a3880960e11b895260048901526000886024818c5afa978815610ade57600098612181575b50600090516024604051809b81936336a3880960e11b835260048301525afa978815610ade57600098612164575b5060006001600160a01b0360115416915160246040518094819363db5cc18160e01b835260048301525afa8015610ade57611dbd916000916120d7575b50612752565b9460006001600160a01b03601254169151602460405180948193630c0a76ed60e41b835260048301525afa8015610ade57611dff916000916120d75750612752565b9151600090156120fa575060006001600160a01b03601354169151602460405180948193633d04ca4360e11b835260048301525afa8015610ade57611e4b916000916120d75750612752565b9160006001600160a01b0360155416915160246040518094819363f708887760e01b835260048301525afa8015610ade57611e8d916000916120d75750612752565b9260006001600160a01b0360165416915160246040518094819363c8e1f0e560e01b835260048301525afa8015610ade57611ecf916000916120d75750612752565b9360405196879660208801611ee390611bc9565b661e39ba3cb6329f60c91b815264737667207b60d81b60078201526b77696474683a20313030253b60a01b600c8201526c6865696768743a20313030253b60981b6018820152696d617267696e3a20303b60b01b60258201526a70616464696e673a20303b60a81b602f820152706f766572666c6f773a2068696464656e3b60781b603a8201526d646973706c61793a20666c65783b60901b604b8201527f6a7573746966792d636f6e74656e743a2063656e7465723b000000000000000060598201526a3130b1b5b3b937bab7321d60a91b6071820152815191611fd1908390607c84019060200161186c565b603b60f81b607c9290910191820152607d60f81b607d820152671e17b9ba3cb6329f60c11b607e8201527f3c726563742077696474683d22393022206865696768743d223930222066696c608682015262361e9160e91b60a682015260a9018082516020819401916120429261186c565b016211179f60e91b8152815191826003830191602001916120629261186c565b01815191826003830191602001916120799261186c565b0160030180825160208194019161208f9261186c565b018082516020819401916120a29261186c565b018082516020819401916120b59261186c565b01651e17b9bb339f60d11b81520360191981018252600601611bc6908261197e565b6120f491503d806000833e6120ec818361197e565b810190611b67565b38611db7565b90816001600160a01b0360145416915160246040518094819363093a2e0160e41b835260048301525afa918215612158579081611e4b9361213d575b5050612752565b61215192503d8091833e6120ec818361197e565b3880612136565b604051903d90823e3d90fd5b61217a9198503d806000833e6120ec818361197e565b9638611d7a565b6000919850612199903d8084833e6120ec818361197e565b9790611d4c565b95509650505050506001600160a01b03600f541691604051936336a3880960e11b85526004850152600084602481865afa938415610ade57600094612425575b50600090516024604051809581936336a3880960e11b835260048301525afa918215610ade57600092612408575b5060006001600160a01b0360105416915160246040518094819363d4c4205f60e01b835260048301525afa908115610ade57608693611bc693602061225f6006956003956000916120d75750612752565b916123cc6123bf604051998a96612277868901611bc9565b661e39ba3cb6329f60c91b815264737667207b60d81b60078201526b77696474683a20313030253b60a01b600c8201526c6865696768743a20313030253b60981b6018820152696d617267696e3a20303b60b01b60258201526a70616464696e673a20303b60a81b602f820152706f766572666c6f773a2068696464656e3b60781b603a8201526d646973706c61793a20666c65783b60901b604b8201527f6a7573746966792d636f6e74656e743a2063656e7465723b000000000000000060598201526a3130b1b5b3b937bab7321d60a91b60718201526123628251809389607c8501910161186c565b01603b60f81b607c820152607d60f81b607d820152671e17b9ba3cb6329f60c11b607e820152016023907f3c726563742077696474683d22393022206865696768743d223930222066696c815262361e9160e91b60208201520190565b918281519485920161186c565b016211179f60e91b81526123e9825180936020878501910161186c565b01651e17b9bb339f60d11b83820152030160191981018452018261197e565b61241e9192503d806000833e6120ec818361197e565b903861220e565b600091945061243d903d8084833e6120ec818361197e565b93906121e0565b6322b07ae160e11b60005260045260246000fd5b91908110156104365760051b0190565b5190811515820361023457565b90816101209103126102345761248a81612468565b916020820151916040810151916060820151916080810151916124af60a08301612468565b9160c08101519161010060e083015192015190565b600019811461157f5760010190565b67ffffffffffffffff81116119685760051b60200190565b63ffffffff60e01b166380ac58cd60e01b811490811561251e575b8115612510575090565b6301ffc9a760e01b14919050565b635b5e139f60e01b81149150612506565b6001600160e01b03198116637965db0b60e01b1490811561254e575090565b611bc691506124eb565b8060005260026020526001600160a01b036040600020541690811561257b575090565b637e27328960e01b60005260045260246000fd5b3360009081527f54cdd369e4e8a8515e52ca72ec816c2101831ad1f18bf44102ed171459c9b4f8602052604090205460ff16156125c857565b63e2517d3f60e01b60005233600452600060245260446000fd5b80600052600660205260406000206001600160a01b03331660005260205260ff60406000205416156126115750565b63e2517d3f60e01b6000523360045260245260446000fd5b80600052600660205260406000206001600160a01b03831660005260205260ff60406000205416156000146126bc5780600052600660205260406000206001600160a01b0383166000526020526040600020600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d600080a4600190565b5050600090565b80600052600660205260406000206001600160a01b03831660005260205260ff604060002054166000146126bc5780600052600660205260406000206001600160a01b038316600052602052604060002060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b600080a4600190565b9081511561280d5781515b80158015806127e4575b156127795761157f576000190161275d565b50612783816119a0565b90612791604051928361197e565b808252601f196127a0826119a0565b0136602084013760005b8181106127b8575090925050565b6001906001600160f81b03196127ce8288613376565b511660001a6127dd8286613376565b53016127aa565b50600019820182811161157f576001600160f81b0319906128059086613376565b511615612767565b905060405161281d60208261197e565b6000815290565b9060209060405190612836838361197e565b600082526001600160a01b038416938415611b51576000828152600285526001600160a01b036040822054168387827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8115159586612a0f575b83815260038b5260408082208054600101905585825260028c528120805473ffffffffffffffffffffffffffffffffffffffff19168517905580a4506129f9573b6128dc575b50505050565b9161291a91819495936040519384928392630a85bd0160e11b845233600485015260006024850152604484015260806064840152608483019061188f565b03816000885af180916000916129bb575b50906129825750503d1561297b573d612943816119a0565b90612951604051928361197e565b81523d60008383013e5b805191826129785783633250574960e11b60005260045260246000fd5b01fd5b606061295b565b909291506001600160e01b03191663757a42ff60e11b016129a75750388080806128d6565b633250574960e11b60005260045260246000fd5b8481813d83116129f2575b6129d0818361197e565b81010312610baa5751906001600160e01b031982168203610ba757503861292b565b503d6129c6565b6339e3563760e11b600052600060045260246000fd5b612a3085600052600460205260406000206001600160a01b03198154169055565b82815260038b52604081208054600019019055612890565b93909293823b612a5a575b5050505050565b612aa16001600160a01b0392836020951696846040519788968796630a85bd0160e11b8852166004870152166024850152604484015260806064840152608483019061188f565b03816000865af18091600091612b2d575b5090612b0b57503d15612b04573d612ac9816119a0565b90612ad7604051928361197e565b81523d6000602083013e5b80519081612aff5782633250574960e11b60005260045260246000fd5b602001fd5b6060612ae2565b6001600160e01b03191663757a42ff60e11b016129a757503880808080612a53565b6020813d602011612b68575b81612b466020938361197e565b81010312610baa5751906001600160e01b031982168203610ba7575038612ab2565b3d9150612b39565b60ff60075416612b7c57565b63d93c066560e01b60005260046000fd5b604051611bc691612b9f60608361197e565b604082527f4142434445464748494a4b4c4d4e4f505152535455565758595a61626364656660208301527f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f6040830152613387565b90612bfe826119a0565b612c0b604051918261197e565b8281528092612c1c601f19916119a0565b0190602036910137565b600052600e6020526040600020604051612c3f8161194b565b60ff82541615159081815260018301549283602083015260028101549260408301938452600382015494606084019586526004830154906080850191825260ff6005850154169060a08601911515825260068501549360c08701948552610100600860078801549760e08a0198895201549701968752613117575051600090156130bd575060006001600160a01b036013541691516024604051809481936280c7e960e31b835260048301525afa908115610ade576000916130a2575b505b60006001600160a01b03600f5416955160246040518098819363ae11c58960e01b835260048301525afa948515610ade57600095613085575b5060006001600160a01b036012541696516024604051809981936385a96b9560e01b835260048301525afa958615610ade57600096613068575b5060006001600160a01b036015541692516024604051809581936359c9d30b60e01b835260048301525afa918215610ade5760009261304b575b5060006001600160a01b0360115416935160246040518096819363c433cd6d60e01b835260048301525afa928315610ade5760009361302e575b5060006001600160a01b0360165416945160246040518097819363ef3b9a8b60e01b835260048301525afa938415610ade57600094613011575b50604080517f7b2274726169745f74797065223a224261636b64726f70222c202276616c7565602082015262111d1160e91b9181019190915295869560438701808251602081940191612e719261186c565b62089f4b60ea1b91019081527f7b2274726169745f74797065223a22486174222c202276616c7565223a2200006003820152815191612eb9908390602184019060200161186c565b0162089f4b60ea1b6021820152602481017f7b2274726169745f74797065223a2245796573222c202276616c7565223a2200905281519182604383019160200191612f039261186c565b0160210162089f4b60ea1b6022820152602581017f7b2274726169745f74797065223a224d6f757468222c202276616c7565223a22905281519182604583019160200191612f509261186c565b0160220162089f4b60ea1b6023820152602681017f7b2274726169745f74797065223a22426f6479222c202276616c7565223a2200905281519182604583019160200191612f9d9261186c565b0160230162089f4b60ea1b6022820152602581017f7b2274726169745f74797065223a2246656574222c202276616c7565223a2200905281519182604483019160200191612fea9261186c565b0160220161227d60f01b602282015203602201601d1981018252600201611bc6908261197e565b6130279194503d806000833e6120ec818361197e565b9238612e1f565b6130449193503d806000833e6120ec818361197e565b9138612de5565b6130619192503d806000833e6120ec818361197e565b9038612dab565b61307e9196503d806000833e6120ec818361197e565b9438612d71565b61309b9195503d806000833e6120ec818361197e565b9338612d37565b6130b791503d806000833e6120ec818361197e565b38612cfc565b90816001600160a01b03601454169151602460405180948193630ff6ff9d60e11b835260048301525afa9182156121585780926130fc575b5050612cfe565b61311092503d8091833e6120ec818361197e565b38806130f5565b959650505050505060006001600160a01b0360105416916024604051809481936374f8a20b60e01b835260048301525afa908115610ade5760009161335d575b5060006001600160a01b03600f5416925160246040518095819363ae11c58960e01b835260048301525afa908115610ade576022611bc69260029260209560009261333e575b5082906040519687936131e56123bf8387016023907f7b2274726169745f74797065223a224261636b64726f70222c202276616c7565815262111d1160e91b60208201520190565b019062089f4b60ea1b82527f7b2274726169745f74797065223a22486174222c202276616c7565223a22000060038301526106a5602384602184516020860196613232828483018a61186c565b0162089f4b60ea1b828201527f7b2274726169745f74797065223a2245796573222c202276616c7565223a2200602482015285519061327582604383018a61186c565b010162089f4b60ea1b828201527f7b2274726169745f74797065223a224d6f757468222c202276616c7565223a2260258201528451906132b982604583018961186c565b010162089f4b60ea1b828201527f7b2274726169745f74797065223a22426f6479222c202276616c7565223a220060268201528351906132fd82604583018861186c565b01019162089f4b60ea1b858401527f7b2274726169745f74797065223a2246656574222c202276616c7565223a22006025840152518093604484019061186c565b83919250613356903d806000833e6120ec818361197e565b919061319d565b613370913d8091833e6120ec818361197e565b38613157565b908151811015610436570160200190565b9190918051156134835780516002810180911161157f57600390048060021b907f3fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff81160361157f576133d890612bf4565b9060208201908081518201956020870190815192600083525b888110613435575050600393949596505251068060011461342257600214613417575090565b603d90600019015390565b50603d9081600019820153600119015390565b600360049199969901986001603f8b5182828260121c16870101518453828282600c1c16870101518385015382828260061c16870101516002850153168401015160038201530194976133f1565b50905060405161281d60208261197e56fea264697066735822122029c0225711ba3331785403e5a188971b07334d38ca68a33abb1ba91f4ef2b36364736f6c634300081c003354cdd369e4e8a8515e52ca72ec816c2101831ad1f18bf44102ed171459c9b4f80000000000000000000000004adb7665c72ccdad25ed5b0bd87c34e4ee9da3c40000000000000000000000005bb638ea28314116514daa924310e9575c3a78f80000000000000000000000009e763207b713e70cacb40f5d33142e76ed7ffb20000000000000000000000000dd541b89d4c89fe351828f698660f04dee6d6a930000000000000000000000003a95fb432520d7ab9d136958e96915479f7284bb0000000000000000000000008582aaced82ae034eeb05f869d843634450db428000000000000000000000000f315bc82cf65ec3c4e77d57f84cff1473652afa40000000000000000000000008d2489ff3c82a92bc2b2f6c717ee7316cdb13ea400000000000000000000000068160933deb55de5291dbd18016e20c18350113e

Deployed Bytecode

0x608080604052600436101561001357600080fd5b60003560e01c90816301ffc9a7146117e95750806306fdde031461172e578063081812fc146116ef578063095ea7b3146115f957806323b872dd146115e2578063248a9ca3146115ad5780632a55205a1461150a5780632c3f9afd146114e35780632f2ff15d146114a357806330503c4e1461147c57806332b7e8e61461145557806336568abe1461140f5780633e53eb28146113f05780633f4ba83a146113875780633f9d55f01461136057806342842e0e1461133057806350fadca8146110cc5780635c975abb146110a95780636352211e1461107a57806370a08231146110245780638456cb5914610fca5780638fdd2ee514610f5957806391d1485414610f0b5780639312afa114610ee457806395a0f5eb14610ec657806395d89b4114610dce578063a217fddf14610db2578063a22cb46514610d08578063a6c377ef14610ce1578063a882efd814610cba578063adb5f7e114610c93578063b88d4fde14610bfe578063bc292782146107e4578063c82cac1c146107bd578063c87b56dd1461044c578063d1ae3e2b1461033f578063d547741f146102f8578063dbe7e3bd146102c7578063e05c57bf146102395763e985e9c5146101d757600080fd5b34610234576040366003190112610234576101f06118b4565b6001600160a01b036102006118ca565b911660005260056020526001600160a01b0360406000209116600052602052602060ff604060002054166040519015158152f35b600080fd5b3461023457602036600319011261023457600435600052600e602052610120604060002060ff8154169060018101549060028101546003820154600483015460ff60058501541691600685015493600860078701549601549660405198151589526020890152604088015260608701526080860152151560a085015260c084015260e0830152610100820152f35b3461023457602036600319011261023457600435600052600d602052602060ff604060002054166040519015158152f35b346102345760403660031901126102345761033d6004356103176118ca565b9061033861033382600052600660205260016040600020015490565b6125e2565b6126c3565b005b346102345760203660031901126102345760043567ffffffffffffffff81116102345761037090369060040161191a565b9061037a826124d3565b90610388604051928361197e565b828252610394836124d3565b602083019390601f190136853760005b8181106103f3575050506040519182916020830190602084525180915260408301919060005b8181106103d8575050500390f35b825115158452859450602093840193909201916001016103ca565b610401818385969795612458565b35600052600d60205260ff6040600020541690855181101561043657600191151560208260051b8801015201939291936103a4565b634e487b7160e01b600052603260045260246000fd5b346102345760203660031901126102345760043561047161046c82611c64565b612b8d565b60009082807a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000811015610795575b806d04ee2d6d415b85acef8100000000600a92101561077a575b662386f26fc10000811015610766575b6305f5e100811015610755575b612710811015610746575b6064811015610738575b101561072d575b600a60216104fd60018601612bf4565b948501015b60001901917f30313233343536373839616263646566000000000000000000000000000000008282061a83530490811561053e57600a90610502565b6107296106c18461046c6002602689606d6105588d612c26565b9560366040519788947f7b226e616d65223a202248797065722046726f67202300000000000000000000602087015261059a815180926020868a01910161186c565b850161088b60f21b838201527f226465736372697074696f6e223a202248797065722046726f6773206172652060388201527f70757265204153434949206172742066726f677320616e64206c69766520313060588201527f3025206f6e636861696e206f6e2048797065726c69717569642e222c0000000060788201527f2261747472696275746573223a205b0000000000000000000000000000000000609482015261065282518093602060a38501910161186c565b010161174b60f21b838201527f22696d616765223a2022646174613a696d6167652f7376672b786d6c3b626173606f82015263194d8d0b60e21b608f8201526106a582518093602060938501910161186c565b010161227d60f01b838201520301601d1981018452018261197e565b610715603d60405180937f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000006020830152610704815180926020868601910161186c565b81010301601f19810183528261197e565b60405191829160208352602083019061188f565b0390f35b6001909201916104ed565b6064600291049401936104e6565b612710600491049401936104dc565b6305f5e100600891049401936104d1565b662386f26fc10000601091049401936104c4565b6d04ee2d6d415b85acef8100000000602091049401936104b4565b50604092507a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000840461049a565b346102345760003660031901126102345760206001600160a01b03600f5416604051908152f35b346102345760203660031901126102345760043567ffffffffffffffff81116102345761081590369060040161191a565b9061081e612b70565b600260085414610bed576002600855600b54918015610bdc5760148111610bcb5760005b818110610850576001600855005b61085b818385612458565b359081600052600d60205260ff60406000205416610bb6576001600160a01b03600c54166040516331a9108f60e11b8152836004820152602081602481855afa908115610ade57600091610b67575b506001600160a01b0316338103610b4b57506101206024916040519283809263e05c57bf60e01b82528760048301525afa8015610ade57600090818283848591869387958897610b03575b6008989950906109a5949392916040519a61090f8c61194b565b15158b5260208b0190815260408b0191825260608b0192835260808b0193845260a08b01941515855260c08b0196875260e08b019788526101008b019889528c600052600e60205261097560406000209b5115158c9060ff801983541691151516179055565b5160018b01555160028a0155516003890155516004880155511515600587019060ff801983541691151516179055565b516006850155516007840155519101556109bf8233612824565b81600052600d6020526040600020600160ff198254161790556109e3600b546124c4565b600b55816040518681527ff514c4806c74fdbf9c0a2f2da65792b2e34a9384d0285d4a211dd5dab9af9d6360203392a36001600160a01b03600c5416803b156102345760008091602460405180948193630852cd8d60e31b83528860048401525af19081610af2575b50610aea576001600160a01b03600c541691823b1561023457600080936064604051809681936323b872dd60e01b83523360048401528060248401528660448401525af1928315610ade57600193610acd575b505b337fe30a28750cac72ac01f8b35589582c826b166086b59d0a6ffb19965110b90a94600080a301610842565b6000610ad89161197e565b86610a9f565b6040513d6000823e3d90fd5b600191610aa1565b6000610afd9161197e565b86610a4c565b5050505050505050506008610b326109a5926101203d8111610b44575b610b2a818361197e565b810190612475565b979950899850959094919391906108f5565b503d610b20565b8363215e156760e21b6000526004526024523360445260646000fd5b6020813d8211610bae575b81610b7f6020938361197e565b81010312610baa5751906001600160a01b0382168203610ba757506001600160a01b036108aa565b80fd5b5080fd5b3d9150610b72565b50636c3903c760e11b60005260045260246000fd5b63548f213760e01b60005260046000fd5b63ceb7371d60e01b60005260046000fd5b633ee5aeb560e01b60005260046000fd5b3461023457608036600319011261023457610c176118b4565b610c1f6118ca565b906044356064359267ffffffffffffffff8411610234573660238501121561023457836004013592610c50846119a0565b93610c5e604051958661197e565b808552366024828801011161023457602081600092602461033d99018389013786010152610c8d8383836119bc565b33612a48565b346102345760003660031901126102345760206001600160a01b0360155416604051908152f35b346102345760003660031901126102345760206001600160a01b0360135416604051908152f35b346102345760003660031901126102345760206001600160a01b0360115416604051908152f35b3461023457604036600319011261023457610d216118b4565b6024359081151590818303610234576001600160a01b0316918215610d9d57610d6f9033600052600560205260406000208460005260205260406000209060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b82630b61174360e31b60005260045260246000fd5b3461023457600036600319011261023457602060405160008152f35b346102345760003660031901126102345760405160006001548060011c90600181168015610ebc575b602083108114610ea857828552908115610e845750600114610e24575b610729836107158185038261197e565b91905060016000527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6916000905b808210610e6a57509091508101602001610715610e14565b919260018160209254838588010152019101909291610e52565b60ff191660208086019190915291151560051b840190910191506107159050610e14565b634e487b7160e01b84526022600452602484fd5b91607f1691610df7565b34610234576000366003190112610234576020600b54604051908152f35b346102345760003660031901126102345760206001600160a01b0360105416604051908152f35b3461023457604036600319011261023457610f246118ca565b60043560005260066020526001600160a01b0360406000209116600052602052602060ff604060002054166040519015158152f35b346102345760203660031901126102345760043567ffffffffffffffff811161023457610f8a90369060040161191a565b610f9261258f565b60005b818110610f9e57005b80610fac6001928486612458565b35600052600d60205260406000208260ff1982541617905501610f95565b3461023457600036600319011261023457610fe361258f565b610feb612b70565b600160ff1960075416176007557f62e78cea01bee320cd4e420270b5ea74000d11b0c9f74754ebdbfc544b05a2586020604051338152a1005b34610234576020366003190112610234576001600160a01b036110456118b4565b1680156110645760005260036020526020604060002054604051908152f35b6322718ad960e21b600052600060045260246000fd5b34610234576020366003190112610234576020611098600435612558565b6001600160a01b0360405191168152f35b3461023457600036600319011261023457602060ff600754166040519015158152f35b346102345760403660031901126102345760043567ffffffffffffffff8111610234576110fd90369060040161191a565b906111066118ca565b9161110f61258f565b6001600160a01b0383169060005b81811061112657005b611131818386612458565b359081600052600d60205260ff604060002054166112eb576024916101206001600160a01b03600c54166040519485809263e05c57bf60e01b82528560048301525afa928315610ade576001936000908182838485918693879588976112b3575b600898995090611241949392916040519a6111ac8c61194b565b15158b5260208b0190815260408b0191825260608b0192835260808b0193845260a08b01941515855260c08b0196875260e08b019788526101008b019889528b600052600e60205261121260406000209b5115158c9060ff801983541691151516179055565b518d8b01555160028a0155516003890155516004880155511515600587019060ff801983541691151516179055565b5160068501555160078401555191015561125b8188612824565b80600052600d60205260406000208360ff19825416179055847ff514c4806c74fdbf9c0a2f2da65792b2e34a9384d0285d4a211dd5dab9af9d6360206112a2600b546124c4565b80600b55604051908152a30161111d565b50505050505050505060086112d9611241926101203d8111610b4457610b2a818361197e565b97995089985095909491939190611192565b60405162461bcd60e51b815260206004820152601660248201527f546f6b656e20616c7265616479206d69677261746564000000000000000000006044820152606490fd5b346102345761033d611341366118e0565b906040519261135160208561197e565b60008452610c8d8383836119bc565b346102345760003660031901126102345760206001600160a01b0360145416604051908152f35b34610234576000366003190112610234576113a061258f565b60075460ff8116156113df5760ff19166007557f5db9ee0a495bf2e6ff9c91a7834c1ba4fdd244a5e8aa4e537bd38aeae4b073aa6020604051338152a1005b638dfc202b60e01b60005260046000fd5b3461023457602036600319011261023457610729610715600435611c64565b34610234576040366003190112610234576114286118ca565b336001600160a01b038216036114445761033d906004356126c3565b63334bd91960e11b60005260046000fd5b346102345760003660031901126102345760206001600160a01b0360165416604051908152f35b346102345760003660031901126102345760206001600160a01b03600c5416604051908152f35b346102345760403660031901126102345761033d6004356114c26118ca565b906114de61033382600052600660205260016040600020015490565b612629565b346102345760003660031901126102345760206001600160a01b0360125416604051908152f35b3461023457604036600319011261023457602435600435600052600a6020526040600020546001600160a01b0381169060a01c8115611595575b6bffffffffffffffffffffffff169182810292818404149015171561157f57612710604092046001600160a01b038351921682526020820152f35b634e487b7160e01b600052601160045260246000fd5b50506009546001600160a01b0381169060a01c611544565b346102345760203660031901126102345760206115da600435600052600660205260016040600020015490565b604051908152f35b346102345761033d6115f3366118e0565b916119bc565b34610234576040366003190112610234576116126118b4565b60243561161e81612558565b331515806116dc575b806116a5575b6116905781906001600160a01b0380851691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925600080a460005260046020526001600160a01b03604060002091166001600160a01b0319825416179055600080f35b63a9fbf51f60e01b6000523360045260246000fd5b506001600160a01b038116600052600560205260406000206001600160a01b03331660005260205260ff604060002054161561162d565b50336001600160a01b0382161415611627565b346102345760203660031901126102345760043561170c81612558565b50600052600460205260206001600160a01b0360406000205416604051908152f35b3461023457600036600319011261023457604051600080548060011c906001811680156117df575b602083108114610ea857828552908115610e84575060011461178257610729836107158185038261197e565b60008080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b8082106117c557509091508101602001610715610e14565b9192600181602092548385880101520191019092916117ad565b91607f1691611756565b3461023457602036600319011261023457600435906001600160e01b03198216808303610234578261181c6020946124eb565b918215611843575b508115611833575b5015158152f35b61183d915061252f565b8361182c565b90915063152a902d60e11b14801561185d575b9084611824565b506118678161252f565b611856565b60005b83811061187f5750506000910152565b818101518382015260200161186f565b906020916118a88151809281855285808601910161186c565b601f01601f1916010190565b600435906001600160a01b038216820361023457565b602435906001600160a01b038216820361023457565b6060906003190112610234576004356001600160a01b038116810361023457906024356001600160a01b0381168103610234579060443590565b9181601f840112156102345782359167ffffffffffffffff8311610234576020808501948460051b01011161023457565b610120810190811067ffffffffffffffff82111761196857604052565b634e487b7160e01b600052604160045260246000fd5b90601f8019910116810190811067ffffffffffffffff82111761196857604052565b67ffffffffffffffff811161196857601f01601f191660200190565b91906001600160a01b0316918215611b51576000908282526002602052826001600160a01b03604084205416948533151580611aaf575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef6001600160a01b039582611a75575b8381526003602052604081206001815401905584815260026020526040812084881982541617905580a416808303611a5b57505050565b6364283d7b60e01b60005260045260245260445260646000fd5b611a9685600052600460205260406000206001600160a01b03198154169055565b8281526003602052604081208054600019019055611a24565b91939492505080611afa575b15611acb579190839085386119f3565b839085611ae457602491637e27328960e01b8252600452fd5b60449163177e802f60e01b825233600452602452fd5b503385148015611b28575b80611abb57508381526004602052336001600160a01b0360408320541614611abb565b508481526005602052604081206001600160a01b033316825260205260ff604082205416611b05565b633250574960e11b600052600060045260246000fd5b6020818303126102345780519067ffffffffffffffff8211610234570181601f820112156102345760208151910190611b9f816119a0565b92611bad604051948561197e565b8184528183011161023457611bc691602084019061186c565b90565b7f3c73766720786d6c6e733d22687474703a2f2f7777772e77332e6f72672f323081527f30302f737667222076696577426f783d2230203020393020393022207368617060208201527f652d72656e646572696e673d2263726973704564676573222077696474683d2260408201527f35313222206865696768743d22353132223e0000000000000000000000000000606082015260720190565b80600052600d60205260ff604060002054161561244457600052600e6020526040600020604051611c948161194b565b60ff8254161515808252600183015491602081019283526002840154916040820193838552600386015493606084019485526004870154906080850191825260ff6005890154169260a08601931515845260068901549460c08701958652610100600860078c01549b60e08a019c8d52015497019687526121a05750506001600160a01b03600f541696865196604051976336a3880960e11b895260048901526000886024818c5afa978815610ade57600098612181575b50600090516024604051809b81936336a3880960e11b835260048301525afa978815610ade57600098612164575b5060006001600160a01b0360115416915160246040518094819363db5cc18160e01b835260048301525afa8015610ade57611dbd916000916120d7575b50612752565b9460006001600160a01b03601254169151602460405180948193630c0a76ed60e41b835260048301525afa8015610ade57611dff916000916120d75750612752565b9151600090156120fa575060006001600160a01b03601354169151602460405180948193633d04ca4360e11b835260048301525afa8015610ade57611e4b916000916120d75750612752565b9160006001600160a01b0360155416915160246040518094819363f708887760e01b835260048301525afa8015610ade57611e8d916000916120d75750612752565b9260006001600160a01b0360165416915160246040518094819363c8e1f0e560e01b835260048301525afa8015610ade57611ecf916000916120d75750612752565b9360405196879660208801611ee390611bc9565b661e39ba3cb6329f60c91b815264737667207b60d81b60078201526b77696474683a20313030253b60a01b600c8201526c6865696768743a20313030253b60981b6018820152696d617267696e3a20303b60b01b60258201526a70616464696e673a20303b60a81b602f820152706f766572666c6f773a2068696464656e3b60781b603a8201526d646973706c61793a20666c65783b60901b604b8201527f6a7573746966792d636f6e74656e743a2063656e7465723b000000000000000060598201526a3130b1b5b3b937bab7321d60a91b6071820152815191611fd1908390607c84019060200161186c565b603b60f81b607c9290910191820152607d60f81b607d820152671e17b9ba3cb6329f60c11b607e8201527f3c726563742077696474683d22393022206865696768743d223930222066696c608682015262361e9160e91b60a682015260a9018082516020819401916120429261186c565b016211179f60e91b8152815191826003830191602001916120629261186c565b01815191826003830191602001916120799261186c565b0160030180825160208194019161208f9261186c565b018082516020819401916120a29261186c565b018082516020819401916120b59261186c565b01651e17b9bb339f60d11b81520360191981018252600601611bc6908261197e565b6120f491503d806000833e6120ec818361197e565b810190611b67565b38611db7565b90816001600160a01b0360145416915160246040518094819363093a2e0160e41b835260048301525afa918215612158579081611e4b9361213d575b5050612752565b61215192503d8091833e6120ec818361197e565b3880612136565b604051903d90823e3d90fd5b61217a9198503d806000833e6120ec818361197e565b9638611d7a565b6000919850612199903d8084833e6120ec818361197e565b9790611d4c565b95509650505050506001600160a01b03600f541691604051936336a3880960e11b85526004850152600084602481865afa938415610ade57600094612425575b50600090516024604051809581936336a3880960e11b835260048301525afa918215610ade57600092612408575b5060006001600160a01b0360105416915160246040518094819363d4c4205f60e01b835260048301525afa908115610ade57608693611bc693602061225f6006956003956000916120d75750612752565b916123cc6123bf604051998a96612277868901611bc9565b661e39ba3cb6329f60c91b815264737667207b60d81b60078201526b77696474683a20313030253b60a01b600c8201526c6865696768743a20313030253b60981b6018820152696d617267696e3a20303b60b01b60258201526a70616464696e673a20303b60a81b602f820152706f766572666c6f773a2068696464656e3b60781b603a8201526d646973706c61793a20666c65783b60901b604b8201527f6a7573746966792d636f6e74656e743a2063656e7465723b000000000000000060598201526a3130b1b5b3b937bab7321d60a91b60718201526123628251809389607c8501910161186c565b01603b60f81b607c820152607d60f81b607d820152671e17b9ba3cb6329f60c11b607e820152016023907f3c726563742077696474683d22393022206865696768743d223930222066696c815262361e9160e91b60208201520190565b918281519485920161186c565b016211179f60e91b81526123e9825180936020878501910161186c565b01651e17b9bb339f60d11b83820152030160191981018452018261197e565b61241e9192503d806000833e6120ec818361197e565b903861220e565b600091945061243d903d8084833e6120ec818361197e565b93906121e0565b6322b07ae160e11b60005260045260246000fd5b91908110156104365760051b0190565b5190811515820361023457565b90816101209103126102345761248a81612468565b916020820151916040810151916060820151916080810151916124af60a08301612468565b9160c08101519161010060e083015192015190565b600019811461157f5760010190565b67ffffffffffffffff81116119685760051b60200190565b63ffffffff60e01b166380ac58cd60e01b811490811561251e575b8115612510575090565b6301ffc9a760e01b14919050565b635b5e139f60e01b81149150612506565b6001600160e01b03198116637965db0b60e01b1490811561254e575090565b611bc691506124eb565b8060005260026020526001600160a01b036040600020541690811561257b575090565b637e27328960e01b60005260045260246000fd5b3360009081527f54cdd369e4e8a8515e52ca72ec816c2101831ad1f18bf44102ed171459c9b4f8602052604090205460ff16156125c857565b63e2517d3f60e01b60005233600452600060245260446000fd5b80600052600660205260406000206001600160a01b03331660005260205260ff60406000205416156126115750565b63e2517d3f60e01b6000523360045260245260446000fd5b80600052600660205260406000206001600160a01b03831660005260205260ff60406000205416156000146126bc5780600052600660205260406000206001600160a01b0383166000526020526040600020600160ff198254161790556001600160a01b03339216907f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d600080a4600190565b5050600090565b80600052600660205260406000206001600160a01b03831660005260205260ff604060002054166000146126bc5780600052600660205260406000206001600160a01b038316600052602052604060002060ff1981541690556001600160a01b03339216907ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b600080a4600190565b9081511561280d5781515b80158015806127e4575b156127795761157f576000190161275d565b50612783816119a0565b90612791604051928361197e565b808252601f196127a0826119a0565b0136602084013760005b8181106127b8575090925050565b6001906001600160f81b03196127ce8288613376565b511660001a6127dd8286613376565b53016127aa565b50600019820182811161157f576001600160f81b0319906128059086613376565b511615612767565b905060405161281d60208261197e565b6000815290565b9060209060405190612836838361197e565b600082526001600160a01b038416938415611b51576000828152600285526001600160a01b036040822054168387827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8115159586612a0f575b83815260038b5260408082208054600101905585825260028c528120805473ffffffffffffffffffffffffffffffffffffffff19168517905580a4506129f9573b6128dc575b50505050565b9161291a91819495936040519384928392630a85bd0160e11b845233600485015260006024850152604484015260806064840152608483019061188f565b03816000885af180916000916129bb575b50906129825750503d1561297b573d612943816119a0565b90612951604051928361197e565b81523d60008383013e5b805191826129785783633250574960e11b60005260045260246000fd5b01fd5b606061295b565b909291506001600160e01b03191663757a42ff60e11b016129a75750388080806128d6565b633250574960e11b60005260045260246000fd5b8481813d83116129f2575b6129d0818361197e565b81010312610baa5751906001600160e01b031982168203610ba757503861292b565b503d6129c6565b6339e3563760e11b600052600060045260246000fd5b612a3085600052600460205260406000206001600160a01b03198154169055565b82815260038b52604081208054600019019055612890565b93909293823b612a5a575b5050505050565b612aa16001600160a01b0392836020951696846040519788968796630a85bd0160e11b8852166004870152166024850152604484015260806064840152608483019061188f565b03816000865af18091600091612b2d575b5090612b0b57503d15612b04573d612ac9816119a0565b90612ad7604051928361197e565b81523d6000602083013e5b80519081612aff5782633250574960e11b60005260045260246000fd5b602001fd5b6060612ae2565b6001600160e01b03191663757a42ff60e11b016129a757503880808080612a53565b6020813d602011612b68575b81612b466020938361197e565b81010312610baa5751906001600160e01b031982168203610ba7575038612ab2565b3d9150612b39565b60ff60075416612b7c57565b63d93c066560e01b60005260046000fd5b604051611bc691612b9f60608361197e565b604082527f4142434445464748494a4b4c4d4e4f505152535455565758595a61626364656660208301527f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f6040830152613387565b90612bfe826119a0565b612c0b604051918261197e565b8281528092612c1c601f19916119a0565b0190602036910137565b600052600e6020526040600020604051612c3f8161194b565b60ff82541615159081815260018301549283602083015260028101549260408301938452600382015494606084019586526004830154906080850191825260ff6005850154169060a08601911515825260068501549360c08701948552610100600860078801549760e08a0198895201549701968752613117575051600090156130bd575060006001600160a01b036013541691516024604051809481936280c7e960e31b835260048301525afa908115610ade576000916130a2575b505b60006001600160a01b03600f5416955160246040518098819363ae11c58960e01b835260048301525afa948515610ade57600095613085575b5060006001600160a01b036012541696516024604051809981936385a96b9560e01b835260048301525afa958615610ade57600096613068575b5060006001600160a01b036015541692516024604051809581936359c9d30b60e01b835260048301525afa918215610ade5760009261304b575b5060006001600160a01b0360115416935160246040518096819363c433cd6d60e01b835260048301525afa928315610ade5760009361302e575b5060006001600160a01b0360165416945160246040518097819363ef3b9a8b60e01b835260048301525afa938415610ade57600094613011575b50604080517f7b2274726169745f74797065223a224261636b64726f70222c202276616c7565602082015262111d1160e91b9181019190915295869560438701808251602081940191612e719261186c565b62089f4b60ea1b91019081527f7b2274726169745f74797065223a22486174222c202276616c7565223a2200006003820152815191612eb9908390602184019060200161186c565b0162089f4b60ea1b6021820152602481017f7b2274726169745f74797065223a2245796573222c202276616c7565223a2200905281519182604383019160200191612f039261186c565b0160210162089f4b60ea1b6022820152602581017f7b2274726169745f74797065223a224d6f757468222c202276616c7565223a22905281519182604583019160200191612f509261186c565b0160220162089f4b60ea1b6023820152602681017f7b2274726169745f74797065223a22426f6479222c202276616c7565223a2200905281519182604583019160200191612f9d9261186c565b0160230162089f4b60ea1b6022820152602581017f7b2274726169745f74797065223a2246656574222c202276616c7565223a2200905281519182604483019160200191612fea9261186c565b0160220161227d60f01b602282015203602201601d1981018252600201611bc6908261197e565b6130279194503d806000833e6120ec818361197e565b9238612e1f565b6130449193503d806000833e6120ec818361197e565b9138612de5565b6130619192503d806000833e6120ec818361197e565b9038612dab565b61307e9196503d806000833e6120ec818361197e565b9438612d71565b61309b9195503d806000833e6120ec818361197e565b9338612d37565b6130b791503d806000833e6120ec818361197e565b38612cfc565b90816001600160a01b03601454169151602460405180948193630ff6ff9d60e11b835260048301525afa9182156121585780926130fc575b5050612cfe565b61311092503d8091833e6120ec818361197e565b38806130f5565b959650505050505060006001600160a01b0360105416916024604051809481936374f8a20b60e01b835260048301525afa908115610ade5760009161335d575b5060006001600160a01b03600f5416925160246040518095819363ae11c58960e01b835260048301525afa908115610ade576022611bc69260029260209560009261333e575b5082906040519687936131e56123bf8387016023907f7b2274726169745f74797065223a224261636b64726f70222c202276616c7565815262111d1160e91b60208201520190565b019062089f4b60ea1b82527f7b2274726169745f74797065223a22486174222c202276616c7565223a22000060038301526106a5602384602184516020860196613232828483018a61186c565b0162089f4b60ea1b828201527f7b2274726169745f74797065223a2245796573222c202276616c7565223a2200602482015285519061327582604383018a61186c565b010162089f4b60ea1b828201527f7b2274726169745f74797065223a224d6f757468222c202276616c7565223a2260258201528451906132b982604583018961186c565b010162089f4b60ea1b828201527f7b2274726169745f74797065223a22426f6479222c202276616c7565223a220060268201528351906132fd82604583018861186c565b01019162089f4b60ea1b858401527f7b2274726169745f74797065223a2246656574222c202276616c7565223a22006025840152518093604484019061186c565b83919250613356903d806000833e6120ec818361197e565b919061319d565b613370913d8091833e6120ec818361197e565b38613157565b908151811015610436570160200190565b9190918051156134835780516002810180911161157f57600390048060021b907f3fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff81160361157f576133d890612bf4565b9060208201908081518201956020870190815192600083525b888110613435575050600393949596505251068060011461342257600214613417575090565b603d90600019015390565b50603d9081600019820153600119015390565b600360049199969901986001603f8b5182828260121c16870101518453828282600c1c16870101518385015382828260061c16870101516002850153168401015160038201530194976133f1565b50905060405161281d60208261197e56fea264697066735822122029c0225711ba3331785403e5a188971b07334d38ca68a33abb1ba91f4ef2b36364736f6c634300081c0033

Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)

0000000000000000000000004adb7665c72ccdad25ed5b0bd87c34e4ee9da3c40000000000000000000000005bb638ea28314116514daa924310e9575c3a78f80000000000000000000000009e763207b713e70cacb40f5d33142e76ed7ffb20000000000000000000000000dd541b89d4c89fe351828f698660f04dee6d6a930000000000000000000000003a95fb432520d7ab9d136958e96915479f7284bb0000000000000000000000008582aaced82ae034eeb05f869d843634450db428000000000000000000000000f315bc82cf65ec3c4e77d57f84cff1473652afa40000000000000000000000008d2489ff3c82a92bc2b2f6c717ee7316cdb13ea400000000000000000000000068160933deb55de5291dbd18016e20c18350113e

-----Decoded View---------------
Arg [0] : _oldContract (address): 0x4Adb7665C72ccdad25eD5B0BD87c34e4Ee9Da3c4
Arg [1] : _frogsBackdrop (address): 0x5bB638Ea28314116514daa924310E9575C3a78f8
Arg [2] : _frogsOneOfOne (address): 0x9e763207b713e70cacb40f5d33142e76eD7FfB20
Arg [3] : _frogsBody (address): 0xdD541b89d4c89fe351828F698660F04deE6D6a93
Arg [4] : _frogsHats (address): 0x3A95FB432520d7AB9d136958e96915479F7284Bb
Arg [5] : _frogsEyesA (address): 0x8582aACeD82Ae034Eeb05F869d843634450dB428
Arg [6] : _frogsEyesB (address): 0xF315bc82CF65EC3c4e77d57F84CfF1473652aFa4
Arg [7] : _frogsMouth (address): 0x8D2489ff3c82A92BC2b2F6c717eE7316cDb13Ea4
Arg [8] : _frogsFeet (address): 0x68160933deB55de5291dbd18016E20C18350113E

-----Encoded View---------------
9 Constructor Arguments found :
Arg [0] : 0000000000000000000000004adb7665c72ccdad25ed5b0bd87c34e4ee9da3c4
Arg [1] : 0000000000000000000000005bb638ea28314116514daa924310e9575c3a78f8
Arg [2] : 0000000000000000000000009e763207b713e70cacb40f5d33142e76ed7ffb20
Arg [3] : 000000000000000000000000dd541b89d4c89fe351828f698660f04dee6d6a93
Arg [4] : 0000000000000000000000003a95fb432520d7ab9d136958e96915479f7284bb
Arg [5] : 0000000000000000000000008582aaced82ae034eeb05f869d843634450db428
Arg [6] : 000000000000000000000000f315bc82cf65ec3c4e77d57f84cff1473652afa4
Arg [7] : 0000000000000000000000008d2489ff3c82a92bc2b2f6c717ee7316cdb13ea4
Arg [8] : 00000000000000000000000068160933deb55de5291dbd18016e20c18350113e


[ Download: CSV Export  ]
[ Download: CSV Export  ]

A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.