Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

// SPDX-License-Identifier: GPL-3.0
pragma solidity ^0.8.24;

import "@knobs/contracts/contracts/libraries/ShuffledIds.sol";
import "@openzeppelin/contracts/token/ERC1155/extensions/ERC1155Supply.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/Context.sol";
import "@openzeppelin/contracts/utils/ReentrancyGuard.sol";
import "@openzeppelin/contracts/token/common/ERC2981.sol";
import "@openzeppelin/contracts/utils/cryptography/ECDSA.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "@openzeppelin/contracts/utils/cryptography/MessageHashUtils.sol";
import "@openzeppelin/contracts/token/ERC1155/IERC1155.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";


contract IntraverseVIPProtocol is
    Context,
    ERC1155Supply,
    ERC2981,
    Ownable,
    ReentrancyGuard
{
    using ECDSA for bytes32;
    using MessageHashUtils for bytes32;
    using ShuffledIds for ShuffledIds.Shuffler;
    using SafeERC20 for IERC20;

    uint256 private constant MIN_RARITIES = 2;
    uint256 private constant MAX_RARITIES = 20; // for preventing deploying large arrays

    error InvalidPhase();
    error InvalidRarity();
    error InvalidBurningConfig(uint256 expected, uint256 actual);
    error InvalidLimitsConfig();
    error ShufflerNotInitialized();
    error RecipientNotWhitelisted();
    error InvalidTokenId();
    error MaxMintCountReached();
    error TotalMintLimitReachedForUser(address recipient);
    error GlobalMintLimitReached();
    error InvalidRecipient(address expected, address actual);
    error NotEnoughTimePassed();
    error RarityNotYetUnlocked();
    error MaxRarityAlreadyUnlocked();
    error InvalidRaritiesConfig(uint256 expected, uint256 actual);
    error InsufficientPayment();
    error CannotMintMoreThanTotalPaidSupply();
    error TransferFailed();
    error EmergencyWithdrawalFailed();
    error SecondaryTradeNotYetEnabled();
    error MintingClosed();
    error ContractCallsNotAllowed();
    error UnexpectedNativeValue();
    error InvalidToken();


    enum Phase {
        SETUP,
        GUARANTEED,
        FCFS, // first come first serve
        PUBLIC
    }

    struct Roles {
        address initialOwner;
        address royaltiesReceiver;
        address whitelistSigner;
    }

    struct Config {
        uint256 maxRarity;
        uint256 maxMintPerWalletInGuaranteedPhase;
        uint256 maxMintPerWalletInFCFSPhase;
        uint256[] burnConfig;
        uint256[] rarities;
        uint256 mintPrice;
    }


    ShuffledIds.Shuffler private shuffler;

    Phase public currentPhase = Phase.SETUP;

    Roles public roles;
    Config public config;

    /// @notice address(0) => native currency; otherwise ERC20 contract address
    address public paymentToken;

    uint256 public mintGlobalCount;
    uint256 public totalPaidSupply;

    bool public mintingComplete = false;
    bool public secondaryTradeEnabled = false;

    /// @notice counter for each recipient's mint in guaranteed phase
    mapping(address => uint256) public mintCountInGuaranteedPhase;

    /// @notice counter for each recipient's mint in FCFS phase
    mapping(address => uint256) public mintCountInFCFSPhase;

    /// @notice counter for each recipient's mint in public phase
    mapping(address => uint256) public mintCountInPublicPhase;

    string private contractUri;

    event TokenUpgraded(
        address indexed owner,
        uint256 fromTokenId,
        uint256 toTokenId
    );
    event Purchase(
        address operator,
        address indexed buyer,
        uint256 tokenId,
        uint256 virtualId,
        uint256 paidAmount
    );
    event PaymentTokenUpdated(
        address indexed previousToken,
        address indexed newToken
    );
    event DefaultRoyaltyUpdated(address indexed receiver, uint96 feeNumerator);

    modifier onlyPhase(Phase _phase) {
        if (currentPhase != _phase) revert InvalidPhase();
        _;
    }

    modifier notInPhase(Phase _phase) {
        if (currentPhase == _phase) revert InvalidPhase();
        _;
    }

    modifier whenSecondaryTradeEnabled() {
        if (!isSecondaryTradeEnabled()) {
            revert SecondaryTradeNotYetEnabled();
        }
        _;
    }

    constructor(
        Roles memory _roles,
        Config memory _config,
        uint96 _defaultRoyalties,
        string memory _baseUri,
        string memory _contractUri,
        address _paymentToken
    ) ERC1155(_baseUri) Ownable(_roles.initialOwner) {
        roles = _roles;
        _updateContractConfig(_config);
        contractUri = _contractUri;
        paymentToken = _paymentToken;
        _setDefaultRoyalty(roles.royaltiesReceiver, _defaultRoyalties);
    }

    /// @notice Admin can update the phase
    function updatePhase(Phase _phase) public onlyOwner {
        currentPhase = _phase;
    }

    /// @notice Admin can update the mint price (in all phases?)
    function updateMintPrice(uint256 _mintPrice) public onlyOwner {
        config.mintPrice = _mintPrice;
    }

    /// @notice Set payment token; address(0) => native, else ERC20
    function updatePaymentToken(
        address _paymentToken
    ) public onlyOwner onlyPhase(Phase.SETUP) {
        address previous = paymentToken;
        paymentToken = _paymentToken;
        emit PaymentTokenUpdated(previous, _paymentToken);
    }

    /// @notice Returns the contract-level metadata URI
    function contractURI() public view returns (string memory) {
        return contractUri;
    }

    /// @notice Owner can update the contract URI
    function updateContractURI(string memory _contractUri) public onlyOwner {
        contractUri = _contractUri;
    }

    /// @notice Owner can update the base URI
    function updateMetadata(string memory _baseUri) public onlyOwner {
        _setURI(_baseUri);
    }

    /// @notice Owner can update the whitelist signer
    function updateWhitelistSigner(
        address _whitelistSigner
    ) public onlyOwner onlyPhase(Phase.SETUP) {
        roles.whitelistSigner = _whitelistSigner;
    }

    /// @notice Owner can update the royalties receiver
    function updateRoyaltiesReceiver(
        address _royaltiesReceiver
    ) public onlyOwner onlyPhase(Phase.SETUP) {
        roles.royaltiesReceiver = _royaltiesReceiver;
    }

    /// @notice Owner can update EIP-2981 default royalty (basis points over fee denominator, typically 10000)
    function updateDefaultRoyalty(
        address receiver,
        uint96 feeNumerator
    ) public onlyOwner onlyPhase(Phase.SETUP) {
        _setDefaultRoyalty(receiver, feeNumerator);
        emit DefaultRoyaltyUpdated(receiver, feeNumerator);
    }

    /// @notice Owner can update the contract config
    function _updateContractConfig(Config memory _config) internal {
        if (
            _config.maxRarity < MIN_RARITIES || _config.maxRarity > MAX_RARITIES
        ) {
            revert InvalidRarity();
        }

        if (_config.burnConfig.length != _config.maxRarity - 1) {
            revert InvalidBurningConfig(
                _config.maxRarity - 1,
                _config.burnConfig.length
            );
        }

        if (_config.rarities.length != _config.maxRarity) {
            revert InvalidRaritiesConfig(
                _config.maxRarity,
                _config.rarities.length
            );
        }

        totalPaidSupply = 0;
        for (uint256 i = 0; i < _config.rarities.length; i++) {
            totalPaidSupply += _config.rarities[i];
        }

        // Shuffler is initialized for the rarities only once
        // including the first one (rarity 0) since we dont have free mint in this contract
        // but exlcuding the last one (rarity n) since it can only be minted by upgrading
        // update: we let to setup the shuffler for the last rarity (rarity n)
        // but owner can set it in a way that the last rarity is not mintable, by setting the last rarity to 0
        if (!shuffler.initialized) {
            shuffler.initialize(
                1,
                totalPaidSupply
            );
        }

        config = _config;
    }

    /// @notice Internal function to mint a token
    /// @return
    function _randomizeTokenId() private returns (uint256, uint256) {
        if (!shuffler.initialized) {
            revert ShufflerNotInitialized();
        }

        uint256 virtualId = shuffler.popRandomId();

        uint256 tokenId = 0; // tokenId is 1-based but rarity is 0based
        uint256 lowerBound = 0;

        // Token ID N (the last one) can only be minted by upgrading
        for (uint256 i = 0; i < config.rarities.length - 1; i++) {
            if (
                lowerBound < virtualId && virtualId <= lowerBound + config.rarities[i]
            ) {
                tokenId = i + 1;
            }
            lowerBound += config.rarities[i];
        }

        if (tokenId == 0) {
            revert InvalidTokenId();
        }


        return (tokenId, virtualId);
    }

    function updateContractConfig(
        Config memory _config
    ) public onlyOwner onlyPhase(Phase.SETUP) {
        _updateContractConfig(_config);
    }

    function getConfig() public view returns (Config memory) {
        return config;
    }

    function getRoles() public view returns (Roles memory) {
        return roles;
    }

    /// @notice Function to mint initial supply for given type of mint (free or paid)
    /// @param recipient the address that will receive the minted tokens
    /// @param amount the amount of tokens to mint for the given type of mint
    function mintInitialSupply(
        address recipient,
        uint256 amount
    ) public onlyOwner onlyPhase(Phase.SETUP) {

        if (mintGlobalCount + amount > totalPaidSupply) {
            revert CannotMintMoreThanTotalPaidSupply();
        }

        for (uint256 i = 0; i < amount; i++) {
            (uint256 tokenId, ) = _randomizeTokenId();
            _mint(recipient, tokenId, 1, new bytes(0));
            mintGlobalCount += 1;
        }
    }

    /**
     * @notice Generate a hash for the given message
     * @param message The message to hash
     * @return bytes32 hash of the message
     */
    function getMessageHash(
        string memory message
    ) public pure returns (bytes32) {
        return keccak256(abi.encodePacked(message));
    }

    /**
     * @notice Verify the signature of a message
     * @param message The original message
     * @param signature The signature to verify
     * @return bool indicating whether the signature is valid
     */
    function verifySignature(
        string memory message,
        bytes memory signature
    ) public view returns (bool) {
        bytes32 messageHash = getMessageHash(message);
        address recoveredSigner = messageHash.toEthSignedMessageHash().recover(
            signature
        );
        return recoveredSigner == roles.whitelistSigner;
    }

    function messageFromAddress(
        address _address
    ) public pure returns (string memory) {
        return string.concat("address:", Strings.toHexString(_address));
    }

    /// @notice Paid mint a token
    /// @param recipient the address that will receive the minted token
    function paidMint(address recipient, bytes memory signature) public payable nonReentrant {
        if (_msgSender() != tx.origin) {
            revert ContractCallsNotAllowed();
        }

        if (mintingComplete) {
            revert MintingClosed();
        }

        address tokenAddr = paymentToken;
        if (tokenAddr == address(0)) {
            if (msg.value < config.mintPrice) {
                revert InsufficientPayment();
            }
        } else {
            if (msg.value != 0) {
                revert UnexpectedNativeValue();
            }
            IERC20 pay = IERC20(tokenAddr);
            if (pay.balanceOf(_msgSender()) < config.mintPrice) {
                revert InsufficientPayment();
            }
            if (pay.allowance(_msgSender(), address(this)) < config.mintPrice) {
                revert InsufficientPayment();
            }
        }

        if (currentPhase == Phase.SETUP) {
            revert InvalidPhase();
        } else if (currentPhase == Phase.GUARANTEED || currentPhase == Phase.FCFS) {
            string memory message = messageFromAddress(recipient);

            if (!verifySignature(message, signature)) {
                revert RecipientNotWhitelisted();
            }
        } // no whitelist check in public phase

        if (mintGlobalCount >= totalPaidSupply) {
            revert MaxMintCountReached();
        }

        // in guaranteed phase, the recipient can only mint limited number of tokens
        if (currentPhase == Phase.GUARANTEED && mintCountInGuaranteedPhase[recipient] >= config.maxMintPerWalletInGuaranteedPhase) {
            revert TotalMintLimitReachedForUser(recipient);
        }
        if (currentPhase == Phase.FCFS && mintCountInFCFSPhase[recipient] >= config.maxMintPerWalletInFCFSPhase) {
            revert TotalMintLimitReachedForUser(recipient);
        } // assuming in public phase, wallet can mint unlimited number of tokens

        (uint256 tokenId, uint256 virtualId) = _randomizeTokenId();

        if (currentPhase == Phase.GUARANTEED) {
            mintCountInGuaranteedPhase[recipient] += 1;
        } else if (currentPhase == Phase.FCFS) {
            mintCountInFCFSPhase[recipient] += 1;
        } else if (currentPhase == Phase.PUBLIC) {
            mintCountInPublicPhase[recipient] += 1;
        }

        mintGlobalCount += 1;
    
        _mint(recipient, tokenId, 1, new bytes(0));

        emit Purchase(_msgSender(), recipient, tokenId, virtualId, config.mintPrice);

        if (tokenAddr == address(0)) {
            (bool success, ) = roles.royaltiesReceiver.call{value: config.mintPrice}("");
            if (!success) revert TransferFailed();
        } else {
            IERC20(tokenAddr).safeTransferFrom(_msgSender(), roles.royaltiesReceiver, config.mintPrice);
        }
    }

    /// @notice Gets the total number of mints for a recipient across all phases
    /// @param recipient The address of the recipient to check
    /// @return Total number of tokens minted by the recipient
    function getUserTotalMintCount(address recipient) public view returns (uint256) {
        return mintCountInGuaranteedPhase[recipient] + mintCountInFCFSPhase[recipient] + mintCountInPublicPhase[recipient];
    }

    /// @notice Gets the current phase of the contract
    /// @return The current phase enum value
    function getCurrentPhase() public view returns (Phase) {
        return currentPhase;
    }

    /// @notice Gets the number of mints in the current phase for a recipient
    /// @param recipient The address of the recipient to check
    /// @return Number of tokens minted by the recipient in the current phase
    function getCurrentPhaseMintCount(address recipient) public view returns (uint256) {
        if (currentPhase == Phase.GUARANTEED) {
            return mintCountInGuaranteedPhase[recipient];
        } else if (currentPhase == Phase.FCFS) {
            return mintCountInFCFSPhase[recipient];
        } else if (currentPhase == Phase.PUBLIC) {
            return mintCountInPublicPhase[recipient];
        }
        return 0;
    }

    /// @notice Checks if a recipient can mint in the current phase
    /// @param recipient The address of the recipient to check
    /// @return Whether the recipient can mint in the current phase
    function canMint(address recipient) public view returns (bool) {
        if (mintingComplete) {
            return false;
        }

        if (currentPhase == Phase.SETUP) {
            return false;
        }
        
        if (mintGlobalCount >= totalPaidSupply) {
            return false;
        }
        
        if (currentPhase == Phase.GUARANTEED) {
            if (mintCountInGuaranteedPhase[recipient] >= config.maxMintPerWalletInGuaranteedPhase) {
                return false;
            }
        } else if (currentPhase == Phase.FCFS) {
            if (mintCountInFCFSPhase[recipient] >= config.maxMintPerWalletInFCFSPhase) {
                return false;
            }
        }
        
        return true;
    }

    /// @notice Upgrade a token to the next rarity according to the burn config
    /// @param _tokenId the token ID to upgrade to the next rarity
    function upgradeTokenTo(uint256 _tokenId) public {
        if (_tokenId <= 1 || config.maxRarity < _tokenId) { // old code: tokenId <= 0 || tokenId > config.maxRarity (since upgradeTokenTo(1) does not exist)
            revert InvalidRarity();
        }

        // Token IDs starts from 1 while rarities start from 0
        uint256 rarityIndex = _tokenId - 1;

        // Rarities are shifted by 1 since there is no config
        // for the first rarity
        uint256 configIndex = rarityIndex - 1;

        uint256 amountToBurn = config.burnConfig[configIndex];

        _burn(_msgSender(), rarityIndex, amountToBurn);
        _mint(_msgSender(), _tokenId, 1, new bytes(0));

        emit TokenUpgraded(msg.sender, rarityIndex, _tokenId);
    }

    /**
     * @notice Override ERC1155 safeTransferFrom to allow secondary transfers only after minting is complete
     * @dev Checks if mintGlobalCount has reached totalPaidSupply
     */
    function safeTransferFrom(
        address from,
        address to,
        uint256 id,
        uint256 amount,
        bytes memory data
    ) public virtual override whenSecondaryTradeEnabled {
        super.safeTransferFrom(from, to, id, amount, data);
    }

    /**
     * @notice Override ERC1155 safeBatchTransferFrom to allow secondary transfers only after minting is complete
     * @dev Checks if mintGlobalCount has reached totalPaidSupply
     */
    function safeBatchTransferFrom(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory amounts,
        bytes memory data
    ) public virtual override whenSecondaryTradeEnabled {
        super.safeBatchTransferFrom(from, to, ids, amounts, data);
    }

    /**
     * @notice Override ERC1155 setApprovalForAll to allow approvals only after minting is complete
     * @dev Checks if mintGlobalCount has reached totalPaidSupply
     */
    function setApprovalForAll(
        address operator, 
        bool approved
    ) public virtual override whenSecondaryTradeEnabled {
        super.setApprovalForAll(operator, approved);
    }

    /**
     * @notice Check if secondary trading is enabled
     * @return Whether secondary trading is currently enabled
     */
    function isSecondaryTradeEnabled() public view returns (bool) {
        return mintGlobalCount >= totalPaidSupply || _msgSender() == owner() || mintingComplete || secondaryTradeEnabled;
    }

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

    /// @notice Emergency function to recover ETH if it gets stuck
    function emergencyWithdraw() external onlyOwner {
        uint256 balance = address(this).balance;
        if (balance > 0) {
            (bool success, ) = roles.royaltiesReceiver.call{value: balance}("");
            if (!success) revert EmergencyWithdrawalFailed();
        }
    }

    /// @notice Sweep full ERC20 balance held by this contract (accidental sends)
    function emergencyWithdrawERC20(address token) external onlyOwner {
        if (token == address(0)) revert InvalidToken();
        uint256 bal = IERC20(token).balanceOf(address(this));
        if (bal > 0) {
            IERC20(token).safeTransfer(roles.royaltiesReceiver, bal);
        }
    }

    function uri(uint256 _tokenId) public view override returns (string memory) {
        return string.concat(
            super.uri(0),
            Strings.toString(_tokenId)
        );
    }

    /// @notice Owner can close minting permanently and enable secondary trading
    function completeMinting() public onlyOwner {
        mintingComplete = true;
    }

    /// @notice Owner can enable secondary trading
    function enableSecondaryTrade() public onlyOwner {
        secondaryTradeEnabled = true;
    }
}

// SPDX-License-Identifier: MIT
// Created by KNOBS Srl - www.knobs.it

pragma solidity ^0.8.10;

library ShuffledIds {
    struct Shuffler {
        uint256 remaining;
        uint256 offset;
        uint256 nonce;
        mapping(uint256 => uint256) swapMap;
        bool initialized;
    }

    modifier ifNotEmpty(Shuffler storage s) {
        require(s.remaining > 0, "No more ids left");
        _;
    }

    modifier ifInitialized(Shuffler storage s) {
        require(s.initialized == true, "Shuffler not initialized yet");
        _;
    }

    function initialize(
        Shuffler storage s,
        uint256 minIds,
        uint256 maxIds
    ) internal {
        require(minIds < maxIds && minIds > 0, "invalid lower bound");
        s.remaining = maxIds - minIds + 1;
        s.offset = minIds - 1;
        s.initialized = true;
    }

    function decrement(Shuffler storage s) internal ifInitialized(s) {
        uint256 value = s.remaining;
        require(value > 0, "Counter: decrement overflow");
        unchecked {
            s.remaining = value - 1;
        }
    }

    function swap(Shuffler storage s, uint256 index) internal ifInitialized(s) {
        decrement(s);

        if (s.swapMap[s.remaining] == 0) {
            s.swapMap[index] = s.remaining;
        } else {
            s.swapMap[index] = s.swapMap[s.remaining];
        }
    }

    function pop(Shuffler storage s, uint256 randomnumber)
        internal
        ifInitialized(s)
        returns (uint256)
    {
        uint256 temp = s.swapMap[randomnumber];

        if (temp == 0) {
            swap(s, randomnumber);
            return randomnumber + s.offset + 1;
        } else {
            swap(s, randomnumber);
            return temp + s.offset + 1;
        }
    }

    function popRandomId(Shuffler storage s)
        internal
        ifNotEmpty(s)
        ifInitialized(s)
        returns (uint256)
    {
        uint256 randomnumber = uint256(
            keccak256(
                abi.encodePacked(
                    block.timestamp,
                    msg.sender,
                    blockhash(block.number - 1),
                    s.nonce
                )
            )
        ) % s.remaining;

        s.nonce++;

        return pop(s, randomnumber);
    }

    function getRemaining(Shuffler storage s)
        internal
        view
        ifInitialized(s)
        returns (uint256)
    {
        return s.remaining;
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

    /**
     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.
     */
    constructor(address initialOwner) {
        if (initialOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(initialOwner);
    }

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

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

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

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

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

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

// 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) (interfaces/IERC1363.sol)

pragma solidity ^0.8.20;

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

/**
 * @title IERC1363
 * @dev Interface of the ERC-1363 standard as defined in the https://eips.ethereum.org/EIPS/eip-1363[ERC-1363].
 *
 * Defines an extension interface for ERC-20 tokens that supports executing code on a recipient contract
 * after `transfer` or `transferFrom`, or code on a spender contract after `approve`, in a single transaction.
 */
interface IERC1363 is IERC20, IERC165 {
    /*
     * Note: the ERC-165 identifier for this interface is 0xb0202a11.
     * 0xb0202a11 ===
     *   bytes4(keccak256('transferAndCall(address,uint256)')) ^
     *   bytes4(keccak256('transferAndCall(address,uint256,bytes)')) ^
     *   bytes4(keccak256('transferFromAndCall(address,address,uint256)')) ^
     *   bytes4(keccak256('transferFromAndCall(address,address,uint256,bytes)')) ^
     *   bytes4(keccak256('approveAndCall(address,uint256)')) ^
     *   bytes4(keccak256('approveAndCall(address,uint256,bytes)'))
     */

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferAndCall(address to, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @param data Additional data with no specified format, sent in call to `to`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param from The address which you want to send tokens from.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferFromAndCall(address from, address to, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the allowance mechanism
     * and then calls {IERC1363Receiver-onTransferReceived} on `to`.
     * @param from The address which you want to send tokens from.
     * @param to The address which you want to transfer to.
     * @param value The amount of tokens to be transferred.
     * @param data Additional data with no specified format, sent in call to `to`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function transferFromAndCall(address from, address to, uint256 value, bytes calldata data) external returns (bool);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
     * @param spender The address which will spend the funds.
     * @param value The amount of tokens to be spent.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function approveAndCall(address spender, uint256 value) external returns (bool);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens and then calls {IERC1363Spender-onApprovalReceived} on `spender`.
     * @param spender The address which will spend the funds.
     * @param value The amount of tokens to be spent.
     * @param data Additional data with no specified format, sent in call to `spender`.
     * @return A boolean value indicating whether the operation succeeded unless throwing.
     */
    function approveAndCall(address spender, uint256 value, bytes calldata data) external returns (bool);
}

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

pragma solidity ^0.8.20;

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

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

pragma solidity ^0.8.20;

import {IERC20} from "../token/ERC20/IERC20.sol";

// 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) (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) (token/ERC1155/ERC1155.sol)

pragma solidity ^0.8.20;

import {IERC1155} from "./IERC1155.sol";
import {IERC1155MetadataURI} from "./extensions/IERC1155MetadataURI.sol";
import {ERC1155Utils} from "./utils/ERC1155Utils.sol";
import {Context} from "../../utils/Context.sol";
import {IERC165, ERC165} from "../../utils/introspection/ERC165.sol";
import {Arrays} from "../../utils/Arrays.sol";
import {IERC1155Errors} from "../../interfaces/draft-IERC6093.sol";

/**
 * @dev Implementation of the basic standard multi-token.
 * See https://eips.ethereum.org/EIPS/eip-1155
 * Originally based on code by Enjin: https://github.com/enjin/erc-1155
 */
abstract contract ERC1155 is Context, ERC165, IERC1155, IERC1155MetadataURI, IERC1155Errors {
    using Arrays for uint256[];
    using Arrays for address[];

    mapping(uint256 id => mapping(address account => uint256)) private _balances;

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

    // Used as the URI for all token types by relying on ID substitution, e.g. https://token-cdn-domain/{id}.json
    string private _uri;

    /**
     * @dev See {_setURI}.
     */
    constructor(string memory uri_) {
        _setURI(uri_);
    }

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

    /**
     * @dev See {IERC1155MetadataURI-uri}.
     *
     * This implementation returns the same URI for *all* token types. It relies
     * on the token type ID substitution mechanism
     * https://eips.ethereum.org/EIPS/eip-1155#metadata[defined in the ERC].
     *
     * Clients calling this function must replace the `\{id\}` substring with the
     * actual token type ID.
     */
    function uri(uint256 /* id */) public view virtual returns (string memory) {
        return _uri;
    }

    /**
     * @dev See {IERC1155-balanceOf}.
     */
    function balanceOf(address account, uint256 id) public view virtual returns (uint256) {
        return _balances[id][account];
    }

    /**
     * @dev See {IERC1155-balanceOfBatch}.
     *
     * Requirements:
     *
     * - `accounts` and `ids` must have the same length.
     */
    function balanceOfBatch(
        address[] memory accounts,
        uint256[] memory ids
    ) public view virtual returns (uint256[] memory) {
        if (accounts.length != ids.length) {
            revert ERC1155InvalidArrayLength(ids.length, accounts.length);
        }

        uint256[] memory batchBalances = new uint256[](accounts.length);

        for (uint256 i = 0; i < accounts.length; ++i) {
            batchBalances[i] = balanceOf(accounts.unsafeMemoryAccess(i), ids.unsafeMemoryAccess(i));
        }

        return batchBalances;
    }

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

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

    /**
     * @dev See {IERC1155-safeTransferFrom}.
     */
    function safeTransferFrom(address from, address to, uint256 id, uint256 value, bytes memory data) public virtual {
        address sender = _msgSender();
        if (from != sender && !isApprovedForAll(from, sender)) {
            revert ERC1155MissingApprovalForAll(sender, from);
        }
        _safeTransferFrom(from, to, id, value, data);
    }

    /**
     * @dev See {IERC1155-safeBatchTransferFrom}.
     */
    function safeBatchTransferFrom(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) public virtual {
        address sender = _msgSender();
        if (from != sender && !isApprovedForAll(from, sender)) {
            revert ERC1155MissingApprovalForAll(sender, from);
        }
        _safeBatchTransferFrom(from, to, ids, values, data);
    }

    /**
     * @dev Transfers a `value` amount of tokens of type `id` from `from` to `to`. Will mint (or burn) if `from`
     * (or `to`) is the zero address.
     *
     * Emits a {TransferSingle} event if the arrays contain one element, and {TransferBatch} otherwise.
     *
     * Requirements:
     *
     * - If `to` refers to a smart contract, it must implement either {IERC1155Receiver-onERC1155Received}
     *   or {IERC1155Receiver-onERC1155BatchReceived} and return the acceptance magic value.
     * - `ids` and `values` must have the same length.
     *
     * NOTE: The ERC-1155 acceptance check is not performed in this function. See {_updateWithAcceptanceCheck} instead.
     */
    function _update(address from, address to, uint256[] memory ids, uint256[] memory values) internal virtual {
        if (ids.length != values.length) {
            revert ERC1155InvalidArrayLength(ids.length, values.length);
        }

        address operator = _msgSender();

        for (uint256 i = 0; i < ids.length; ++i) {
            uint256 id = ids.unsafeMemoryAccess(i);
            uint256 value = values.unsafeMemoryAccess(i);

            if (from != address(0)) {
                uint256 fromBalance = _balances[id][from];
                if (fromBalance < value) {
                    revert ERC1155InsufficientBalance(from, fromBalance, value, id);
                }
                unchecked {
                    // Overflow not possible: value <= fromBalance
                    _balances[id][from] = fromBalance - value;
                }
            }

            if (to != address(0)) {
                _balances[id][to] += value;
            }
        }

        if (ids.length == 1) {
            uint256 id = ids.unsafeMemoryAccess(0);
            uint256 value = values.unsafeMemoryAccess(0);
            emit TransferSingle(operator, from, to, id, value);
        } else {
            emit TransferBatch(operator, from, to, ids, values);
        }
    }

    /**
     * @dev Version of {_update} that performs the token acceptance check by calling
     * {IERC1155Receiver-onERC1155Received} or {IERC1155Receiver-onERC1155BatchReceived} on the receiver address if it
     * contains code (eg. is a smart contract at the moment of execution).
     *
     * IMPORTANT: Overriding this function is discouraged because it poses a reentrancy risk from the receiver. So any
     * update to the contract state after this function would break the check-effect-interaction pattern. Consider
     * overriding {_update} instead.
     */
    function _updateWithAcceptanceCheck(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) internal virtual {
        _update(from, to, ids, values);
        if (to != address(0)) {
            address operator = _msgSender();
            if (ids.length == 1) {
                uint256 id = ids.unsafeMemoryAccess(0);
                uint256 value = values.unsafeMemoryAccess(0);
                ERC1155Utils.checkOnERC1155Received(operator, from, to, id, value, data);
            } else {
                ERC1155Utils.checkOnERC1155BatchReceived(operator, from, to, ids, values, data);
            }
        }
    }

    /**
     * @dev Transfers a `value` tokens of token type `id` from `from` to `to`.
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `from` must have a balance of tokens of type `id` of at least `value` amount.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155Received} and return the
     * acceptance magic value.
     */
    function _safeTransferFrom(address from, address to, uint256 id, uint256 value, bytes memory data) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        (uint256[] memory ids, uint256[] memory values) = _asSingletonArrays(id, value);
        _updateWithAcceptanceCheck(from, to, ids, values, data);
    }

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {_safeTransferFrom}.
     *
     * Emits a {TransferBatch} event.
     *
     * Requirements:
     *
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155BatchReceived} and return the
     * acceptance magic value.
     * - `ids` and `values` must have the same length.
     */
    function _safeBatchTransferFrom(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        _updateWithAcceptanceCheck(from, to, ids, values, data);
    }

    /**
     * @dev Sets a new URI for all token types, by relying on the token type ID
     * substitution mechanism
     * https://eips.ethereum.org/EIPS/eip-1155#metadata[defined in the ERC].
     *
     * By this mechanism, any occurrence of the `\{id\}` substring in either the
     * URI or any of the values in the JSON file at said URI will be replaced by
     * clients with the token type ID.
     *
     * For example, the `https://token-cdn-domain/\{id\}.json` URI would be
     * interpreted by clients as
     * `https://token-cdn-domain/000000000000000000000000000000000000000000000000000000000004cce0.json`
     * for token type ID 0x4cce0.
     *
     * See {uri}.
     *
     * Because these URIs cannot be meaningfully represented by the {URI} event,
     * this function emits no events.
     */
    function _setURI(string memory newuri) internal virtual {
        _uri = newuri;
    }

    /**
     * @dev Creates a `value` amount of tokens of type `id`, and assigns them to `to`.
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155Received} and return the
     * acceptance magic value.
     */
    function _mint(address to, uint256 id, uint256 value, bytes memory data) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        (uint256[] memory ids, uint256[] memory values) = _asSingletonArrays(id, value);
        _updateWithAcceptanceCheck(address(0), to, ids, values, data);
    }

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {_mint}.
     *
     * Emits a {TransferBatch} event.
     *
     * Requirements:
     *
     * - `ids` and `values` must have the same length.
     * - `to` cannot be the zero address.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155BatchReceived} and return the
     * acceptance magic value.
     */
    function _mintBatch(address to, uint256[] memory ids, uint256[] memory values, bytes memory data) internal {
        if (to == address(0)) {
            revert ERC1155InvalidReceiver(address(0));
        }
        _updateWithAcceptanceCheck(address(0), to, ids, values, data);
    }

    /**
     * @dev Destroys a `value` amount of tokens of type `id` from `from`
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `from` must have at least `value` amount of tokens of type `id`.
     */
    function _burn(address from, uint256 id, uint256 value) internal {
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        (uint256[] memory ids, uint256[] memory values) = _asSingletonArrays(id, value);
        _updateWithAcceptanceCheck(from, address(0), ids, values, "");
    }

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {_burn}.
     *
     * Emits a {TransferBatch} event.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `from` must have at least `value` amount of tokens of type `id`.
     * - `ids` and `values` must have the same length.
     */
    function _burnBatch(address from, uint256[] memory ids, uint256[] memory values) internal {
        if (from == address(0)) {
            revert ERC1155InvalidSender(address(0));
        }
        _updateWithAcceptanceCheck(from, address(0), ids, values, "");
    }

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

    /**
     * @dev Creates an array in memory with only one value for each of the elements provided.
     */
    function _asSingletonArrays(
        uint256 element1,
        uint256 element2
    ) private pure returns (uint256[] memory array1, uint256[] memory array2) {
        assembly ("memory-safe") {
            // Load the free memory pointer
            array1 := mload(0x40)
            // Set array length to 1
            mstore(array1, 1)
            // Store the single element at the next word after the length (where content starts)
            mstore(add(array1, 0x20), element1)

            // Repeat for next array locating it right after the first array
            array2 := add(array1, 0x40)
            mstore(array2, 1)
            mstore(add(array2, 0x20), element2)

            // Update the free memory pointer by pointing after the second array
            mstore(0x40, add(array2, 0x40))
        }
    }
}

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

pragma solidity ^0.8.20;

import {ERC1155} from "../ERC1155.sol";
import {Arrays} from "../../../utils/Arrays.sol";

/**
 * @dev Extension of ERC-1155 that adds tracking of total supply per id.
 *
 * Useful for scenarios where Fungible and Non-fungible tokens have to be
 * clearly identified. Note: While a totalSupply of 1 might mean the
 * corresponding is an NFT, there is no guarantees that no other token with the
 * same id are not going to be minted.
 *
 * NOTE: This contract implies a global limit of 2**256 - 1 to the number of tokens
 * that can be minted.
 *
 * CAUTION: This extension should not be added in an upgrade to an already deployed contract.
 */
abstract contract ERC1155Supply is ERC1155 {
    using Arrays for uint256[];

    mapping(uint256 id => uint256) private _totalSupply;
    uint256 private _totalSupplyAll;

    /**
     * @dev Total value of tokens in with a given id.
     */
    function totalSupply(uint256 id) public view virtual returns (uint256) {
        return _totalSupply[id];
    }

    /**
     * @dev Total value of tokens.
     */
    function totalSupply() public view virtual returns (uint256) {
        return _totalSupplyAll;
    }

    /**
     * @dev Indicates whether any token exist with a given id, or not.
     */
    function exists(uint256 id) public view virtual returns (bool) {
        return totalSupply(id) > 0;
    }

    /**
     * @dev See {ERC1155-_update}.
     */
    function _update(
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values
    ) internal virtual override {
        super._update(from, to, ids, values);

        if (from == address(0)) {
            uint256 totalMintValue = 0;
            for (uint256 i = 0; i < ids.length; ++i) {
                uint256 value = values.unsafeMemoryAccess(i);
                // Overflow check required: The rest of the code assumes that totalSupply never overflows
                _totalSupply[ids.unsafeMemoryAccess(i)] += value;
                totalMintValue += value;
            }
            // Overflow check required: The rest of the code assumes that totalSupplyAll never overflows
            _totalSupplyAll += totalMintValue;
        }

        if (to == address(0)) {
            uint256 totalBurnValue = 0;
            for (uint256 i = 0; i < ids.length; ++i) {
                uint256 value = values.unsafeMemoryAccess(i);

                unchecked {
                    // Overflow not possible: values[i] <= balanceOf(from, ids[i]) <= totalSupply(ids[i])
                    _totalSupply[ids.unsafeMemoryAccess(i)] -= value;
                    // Overflow not possible: sum_i(values[i]) <= sum_i(totalSupply(ids[i])) <= totalSupplyAll
                    totalBurnValue += value;
                }
            }
            unchecked {
                // Overflow not possible: totalBurnValue = sum_i(values[i]) <= sum_i(totalSupply(ids[i])) <= totalSupplyAll
                _totalSupplyAll -= totalBurnValue;
            }
        }
    }
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev Interface of the optional ERC1155MetadataExtension interface, as defined
 * in the https://eips.ethereum.org/EIPS/eip-1155#metadata-extensions[ERC].
 */
interface IERC1155MetadataURI is IERC1155 {
    /**
     * @dev Returns the URI for token type `id`.
     *
     * If the `\{id\}` substring is present in the URI, it must be replaced by
     * clients with the actual token type ID.
     */
    function uri(uint256 id) external view returns (string memory);
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev Required interface of an ERC-1155 compliant contract, as defined in the
 * https://eips.ethereum.org/EIPS/eip-1155[ERC].
 */
interface IERC1155 is IERC165 {
    /**
     * @dev Emitted when `value` amount of tokens of type `id` are transferred from `from` to `to` by `operator`.
     */
    event TransferSingle(address indexed operator, address indexed from, address indexed to, uint256 id, uint256 value);

    /**
     * @dev Equivalent to multiple {TransferSingle} events, where `operator`, `from` and `to` are the same for all
     * transfers.
     */
    event TransferBatch(
        address indexed operator,
        address indexed from,
        address indexed to,
        uint256[] ids,
        uint256[] values
    );

    /**
     * @dev Emitted when `account` grants or revokes permission to `operator` to transfer their tokens, according to
     * `approved`.
     */
    event ApprovalForAll(address indexed account, address indexed operator, bool approved);

    /**
     * @dev Emitted when the URI for token type `id` changes to `value`, if it is a non-programmatic URI.
     *
     * If an {URI} event was emitted for `id`, the standard
     * https://eips.ethereum.org/EIPS/eip-1155#metadata-extensions[guarantees] that `value` will equal the value
     * returned by {IERC1155MetadataURI-uri}.
     */
    event URI(string value, uint256 indexed id);

    /**
     * @dev Returns the value of tokens of token type `id` owned by `account`.
     */
    function balanceOf(address account, uint256 id) external view returns (uint256);

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {balanceOf}.
     *
     * Requirements:
     *
     * - `accounts` and `ids` must have the same length.
     */
    function balanceOfBatch(
        address[] calldata accounts,
        uint256[] calldata ids
    ) external view returns (uint256[] memory);

    /**
     * @dev Grants or revokes permission to `operator` to transfer the caller's tokens, according to `approved`,
     *
     * Emits an {ApprovalForAll} event.
     *
     * Requirements:
     *
     * - `operator` cannot be the zero address.
     */
    function setApprovalForAll(address operator, bool approved) external;

    /**
     * @dev Returns true if `operator` is approved to transfer ``account``'s tokens.
     *
     * See {setApprovalForAll}.
     */
    function isApprovedForAll(address account, address operator) external view returns (bool);

    /**
     * @dev Transfers a `value` amount of tokens of type `id` from `from` to `to`.
     *
     * WARNING: This function can potentially allow a reentrancy attack when transferring tokens
     * to an untrusted contract, when invoking {onERC1155Received} on the receiver.
     * Ensure to follow the checks-effects-interactions pattern and consider employing
     * reentrancy guards when interacting with untrusted contracts.
     *
     * Emits a {TransferSingle} event.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - If the caller is not `from`, it must have been approved to spend ``from``'s tokens via {setApprovalForAll}.
     * - `from` must have a balance of tokens of type `id` of at least `value` amount.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155Received} and return the
     * acceptance magic value.
     */
    function safeTransferFrom(address from, address to, uint256 id, uint256 value, bytes calldata data) external;

    /**
     * @dev xref:ROOT:erc1155.adoc#batch-operations[Batched] version of {safeTransferFrom}.
     *
     * WARNING: This function can potentially allow a reentrancy attack when transferring tokens
     * to an untrusted contract, when invoking {onERC1155BatchReceived} on the receiver.
     * Ensure to follow the checks-effects-interactions pattern and consider employing
     * reentrancy guards when interacting with untrusted contracts.
     *
     * Emits either a {TransferSingle} or a {TransferBatch} event, depending on the length of the array arguments.
     *
     * Requirements:
     *
     * - `ids` and `values` must have the same length.
     * - If `to` refers to a smart contract, it must implement {IERC1155Receiver-onERC1155BatchReceived} and return the
     * acceptance magic value.
     */
    function safeBatchTransferFrom(
        address from,
        address to,
        uint256[] calldata ids,
        uint256[] calldata values,
        bytes calldata data
    ) external;
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev Interface that must be implemented by smart contracts in order to receive
 * ERC-1155 token transfers.
 */
interface IERC1155Receiver is IERC165 {
    /**
     * @dev Handles the receipt of a single ERC-1155 token type. This function is
     * called at the end of a `safeTransferFrom` after the balance has been updated.
     *
     * NOTE: To accept the transfer, this must return
     * `bytes4(keccak256("onERC1155Received(address,address,uint256,uint256,bytes)"))`
     * (i.e. 0xf23a6e61, or its own function selector).
     *
     * @param operator The address which initiated the transfer (i.e. msg.sender)
     * @param from The address which previously owned the token
     * @param id The ID of the token being transferred
     * @param value The amount of tokens being transferred
     * @param data Additional data with no specified format
     * @return `bytes4(keccak256("onERC1155Received(address,address,uint256,uint256,bytes)"))` if transfer is allowed
     */
    function onERC1155Received(
        address operator,
        address from,
        uint256 id,
        uint256 value,
        bytes calldata data
    ) external returns (bytes4);

    /**
     * @dev Handles the receipt of a multiple ERC-1155 token types. This function
     * is called at the end of a `safeBatchTransferFrom` after the balances have
     * been updated.
     *
     * NOTE: To accept the transfer(s), this must return
     * `bytes4(keccak256("onERC1155BatchReceived(address,address,uint256[],uint256[],bytes)"))`
     * (i.e. 0xbc197c81, or its own function selector).
     *
     * @param operator The address which initiated the batch transfer (i.e. msg.sender)
     * @param from The address which previously owned the token
     * @param ids An array containing ids of each token being transferred (order and length must match values array)
     * @param values An array containing amounts of each token being transferred (order and length must match ids array)
     * @param data Additional data with no specified format
     * @return `bytes4(keccak256("onERC1155BatchReceived(address,address,uint256[],uint256[],bytes)"))` if transfer is allowed
     */
    function onERC1155BatchReceived(
        address operator,
        address from,
        uint256[] calldata ids,
        uint256[] calldata values,
        bytes calldata data
    ) external returns (bytes4);
}

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

pragma solidity ^0.8.20;

import {IERC1155Receiver} from "../IERC1155Receiver.sol";
import {IERC1155Errors} from "../../../interfaces/draft-IERC6093.sol";

/**
 * @dev Library that provide common ERC-1155 utility functions.
 *
 * See https://eips.ethereum.org/EIPS/eip-1155[ERC-1155].
 *
 * _Available since v5.1._
 */
library ERC1155Utils {
    /**
     * @dev Performs an acceptance check for the provided `operator` by calling {IERC1155-onERC1155Received}
     * 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 {IERC1155Receiver-onERC1155Received} and return the acceptance magic value to accept
     * the transfer.
     */
    function checkOnERC1155Received(
        address operator,
        address from,
        address to,
        uint256 id,
        uint256 value,
        bytes memory data
    ) internal {
        if (to.code.length > 0) {
            try IERC1155Receiver(to).onERC1155Received(operator, from, id, value, data) returns (bytes4 response) {
                if (response != IERC1155Receiver.onERC1155Received.selector) {
                    // Tokens rejected
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                }
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    // non-IERC1155Receiver implementer
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                } else {
                    assembly ("memory-safe") {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        }
    }

    /**
     * @dev Performs a batch acceptance check for the provided `operator` by calling {IERC1155-onERC1155BatchReceived}
     * 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 {IERC1155Receiver-onERC1155Received} and return the acceptance magic value to accept
     * the transfer.
     */
    function checkOnERC1155BatchReceived(
        address operator,
        address from,
        address to,
        uint256[] memory ids,
        uint256[] memory values,
        bytes memory data
    ) internal {
        if (to.code.length > 0) {
            try IERC1155Receiver(to).onERC1155BatchReceived(operator, from, ids, values, data) returns (
                bytes4 response
            ) {
                if (response != IERC1155Receiver.onERC1155BatchReceived.selector) {
                    // Tokens rejected
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                }
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    // non-IERC1155Receiver implementer
                    revert IERC1155Errors.ERC1155InvalidReceiver(to);
                } else {
                    assembly ("memory-safe") {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-20 standard as defined in the ERC.
 */
interface IERC20 {
    /**
     * @dev Emitted when `value` tokens are moved from one account (`from`) to
     * another (`to`).
     *
     * Note that `value` may be zero.
     */
    event Transfer(address indexed from, address indexed to, uint256 value);

    /**
     * @dev Emitted when the allowance of a `spender` for an `owner` is set by
     * a call to {approve}. `value` is the new allowance.
     */
    event Approval(address indexed owner, address indexed spender, uint256 value);

    /**
     * @dev Returns the value of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns the value of tokens owned by `account`.
     */
    function balanceOf(address account) external view returns (uint256);

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transfer(address to, uint256 value) external returns (bool);

    /**
     * @dev Returns the remaining number of tokens that `spender` will be
     * allowed to spend on behalf of `owner` through {transferFrom}. This is
     * zero by default.
     *
     * This value changes when {approve} or {transferFrom} are called.
     */
    function allowance(address owner, address spender) external view returns (uint256);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * IMPORTANT: Beware that changing an allowance with this method brings the risk
     * that someone may use both the old and the new allowance by unfortunate
     * transaction ordering. One possible solution to mitigate this race
     * condition is to first reduce the spender's allowance to 0 and set the
     * desired value afterwards:
     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
     *
     * Emits an {Approval} event.
     */
    function approve(address spender, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the
     * allowance mechanism. `value` is then deducted from the caller's
     * allowance.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 value) external returns (bool);
}

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

pragma solidity ^0.8.20;

import {IERC20} from "../IERC20.sol";
import {IERC1363} from "../../../interfaces/IERC1363.sol";

/**
 * @title SafeERC20
 * @dev Wrappers around ERC-20 operations that throw on failure (when the token
 * contract returns false). Tokens that return no value (and instead revert or
 * throw on failure) are also supported, non-reverting calls are assumed to be
 * successful.
 * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
 * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
 */
library SafeERC20 {
    /**
     * @dev An operation with an ERC-20 token failed.
     */
    error SafeERC20FailedOperation(address token);

    /**
     * @dev Indicates a failed `decreaseAllowance` request.
     */
    error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);

    /**
     * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     */
    function safeTransfer(IERC20 token, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeCall(token.transfer, (to, value)));
    }

    /**
     * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
     * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
     */
    function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
        _callOptionalReturn(token, abi.encodeCall(token.transferFrom, (from, to, value)));
    }

    /**
     * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful.
     *
     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
     * smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
     */
    function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
        uint256 oldAllowance = token.allowance(address(this), spender);
        forceApprove(token, spender, oldAllowance + value);
    }

    /**
     * @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no
     * value, non-reverting calls are assumed to be successful.
     *
     * IMPORTANT: If the token implements ERC-7674 (ERC-20 with temporary allowance), and if the "client"
     * smart contract uses ERC-7674 to set temporary allowances, then the "client" smart contract should avoid using
     * this function. Performing a {safeIncreaseAllowance} or {safeDecreaseAllowance} operation on a token contract
     * that has a non-zero temporary allowance (for that particular owner-spender) will result in unexpected behavior.
     */
    function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {
        unchecked {
            uint256 currentAllowance = token.allowance(address(this), spender);
            if (currentAllowance < requestedDecrease) {
                revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);
            }
            forceApprove(token, spender, currentAllowance - requestedDecrease);
        }
    }

    /**
     * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
     * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
     * to be set to zero before setting it to a non-zero value, such as USDT.
     *
     * NOTE: If the token implements ERC-7674, this function will not modify any temporary allowance. This function
     * only sets the "standard" allowance. Any temporary allowance will remain active, in addition to the value being
     * set here.
     */
    function forceApprove(IERC20 token, address spender, uint256 value) internal {
        bytes memory approvalCall = abi.encodeCall(token.approve, (spender, value));

        if (!_callOptionalReturnBool(token, approvalCall)) {
            _callOptionalReturn(token, abi.encodeCall(token.approve, (spender, 0)));
            _callOptionalReturn(token, approvalCall);
        }
    }

    /**
     * @dev Performs an {ERC1363} transferAndCall, with a fallback to the simple {ERC20} transfer if the target has no
     * code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
     * targeting contracts.
     *
     * Reverts if the returned value is other than `true`.
     */
    function transferAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
        if (to.code.length == 0) {
            safeTransfer(token, to, value);
        } else if (!token.transferAndCall(to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Performs an {ERC1363} transferFromAndCall, with a fallback to the simple {ERC20} transferFrom if the target
     * has no code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
     * targeting contracts.
     *
     * Reverts if the returned value is other than `true`.
     */
    function transferFromAndCallRelaxed(
        IERC1363 token,
        address from,
        address to,
        uint256 value,
        bytes memory data
    ) internal {
        if (to.code.length == 0) {
            safeTransferFrom(token, from, to, value);
        } else if (!token.transferFromAndCall(from, to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Performs an {ERC1363} approveAndCall, with a fallback to the simple {ERC20} approve if the target has no
     * code. This can be used to implement an {ERC721}-like safe transfer that rely on {ERC1363} checks when
     * targeting contracts.
     *
     * NOTE: When the recipient address (`to`) has no code (i.e. is an EOA), this function behaves as {forceApprove}.
     * Opposedly, when the recipient address (`to`) has code, this function only attempts to call {ERC1363-approveAndCall}
     * once without retrying, and relies on the returned value to be true.
     *
     * Reverts if the returned value is other than `true`.
     */
    function approveAndCallRelaxed(IERC1363 token, address to, uint256 value, bytes memory data) internal {
        if (to.code.length == 0) {
            forceApprove(token, to, value);
        } else if (!token.approveAndCall(to, value, data)) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     *
     * This is a variant of {_callOptionalReturnBool} that reverts if call fails to meet the requirements.
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        uint256 returnSize;
        uint256 returnValue;
        assembly ("memory-safe") {
            let success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
            // bubble errors
            if iszero(success) {
                let ptr := mload(0x40)
                returndatacopy(ptr, 0, returndatasize())
                revert(ptr, returndatasize())
            }
            returnSize := returndatasize()
            returnValue := mload(0)
        }

        if (returnSize == 0 ? address(token).code.length == 0 : returnValue != 1) {
            revert SafeERC20FailedOperation(address(token));
        }
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     *
     * This is a variant of {_callOptionalReturn} that silently catches all reverts and returns a bool instead.
     */
    function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
        bool success;
        uint256 returnSize;
        uint256 returnValue;
        assembly ("memory-safe") {
            success := call(gas(), token, 0, add(data, 0x20), mload(data), 0, 0x20)
            returnSize := returndatasize()
            returnValue := mload(0)
        }
        return success && (returnSize == 0 ? address(token).code.length > 0 : returnValue == 1);
    }
}

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

pragma solidity ^0.8.20;

import {Comparators} from "./Comparators.sol";
import {SlotDerivation} from "./SlotDerivation.sol";
import {StorageSlot} from "./StorageSlot.sol";
import {Math} from "./math/Math.sol";

/**
 * @dev Collection of functions related to array types.
 */
library Arrays {
    using SlotDerivation for bytes32;
    using StorageSlot for bytes32;

    /**
     * @dev Sort an array of uint256 (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        uint256[] memory array,
        function(uint256, uint256) pure returns (bool) comp
    ) internal pure returns (uint256[] memory) {
        _quickSort(_begin(array), _end(array), comp);
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of uint256 in increasing order.
     */
    function sort(uint256[] memory array) internal pure returns (uint256[] memory) {
        sort(array, Comparators.lt);
        return array;
    }

    /**
     * @dev Sort an array of address (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        address[] memory array,
        function(address, address) pure returns (bool) comp
    ) internal pure returns (address[] memory) {
        sort(_castToUint256Array(array), _castToUint256Comp(comp));
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of address in increasing order.
     */
    function sort(address[] memory array) internal pure returns (address[] memory) {
        sort(_castToUint256Array(array), Comparators.lt);
        return array;
    }

    /**
     * @dev Sort an array of bytes32 (in memory) following the provided comparator function.
     *
     * This function does the sorting "in place", meaning that it overrides the input. The object is returned for
     * convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
     *
     * NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
     * array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
     * when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
     * consume more gas than is available in a block, leading to potential DoS.
     *
     * IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
     */
    function sort(
        bytes32[] memory array,
        function(bytes32, bytes32) pure returns (bool) comp
    ) internal pure returns (bytes32[] memory) {
        sort(_castToUint256Array(array), _castToUint256Comp(comp));
        return array;
    }

    /**
     * @dev Variant of {sort} that sorts an array of bytes32 in increasing order.
     */
    function sort(bytes32[] memory array) internal pure returns (bytes32[] memory) {
        sort(_castToUint256Array(array), Comparators.lt);
        return array;
    }

    /**
     * @dev Performs a quick sort of a segment of memory. The segment sorted starts at `begin` (inclusive), and stops
     * at end (exclusive). Sorting follows the `comp` comparator.
     *
     * Invariant: `begin <= end`. This is the case when initially called by {sort} and is preserved in subcalls.
     *
     * IMPORTANT: Memory locations between `begin` and `end` are not validated/zeroed. This function should
     * be used only if the limits are within a memory array.
     */
    function _quickSort(uint256 begin, uint256 end, function(uint256, uint256) pure returns (bool) comp) private pure {
        unchecked {
            if (end - begin < 0x40) return;

            // Use first element as pivot
            uint256 pivot = _mload(begin);
            // Position where the pivot should be at the end of the loop
            uint256 pos = begin;

            for (uint256 it = begin + 0x20; it < end; it += 0x20) {
                if (comp(_mload(it), pivot)) {
                    // If the value stored at the iterator's position comes before the pivot, we increment the
                    // position of the pivot and move the value there.
                    pos += 0x20;
                    _swap(pos, it);
                }
            }

            _swap(begin, pos); // Swap pivot into place
            _quickSort(begin, pos, comp); // Sort the left side of the pivot
            _quickSort(pos + 0x20, end, comp); // Sort the right side of the pivot
        }
    }

    /**
     * @dev Pointer to the memory location of the first element of `array`.
     */
    function _begin(uint256[] memory array) private pure returns (uint256 ptr) {
        assembly ("memory-safe") {
            ptr := add(array, 0x20)
        }
    }

    /**
     * @dev Pointer to the memory location of the first memory word (32bytes) after `array`. This is the memory word
     * that comes just after the last element of the array.
     */
    function _end(uint256[] memory array) private pure returns (uint256 ptr) {
        unchecked {
            return _begin(array) + array.length * 0x20;
        }
    }

    /**
     * @dev Load memory word (as a uint256) at location `ptr`.
     */
    function _mload(uint256 ptr) private pure returns (uint256 value) {
        assembly {
            value := mload(ptr)
        }
    }

    /**
     * @dev Swaps the elements memory location `ptr1` and `ptr2`.
     */
    function _swap(uint256 ptr1, uint256 ptr2) private pure {
        assembly {
            let value1 := mload(ptr1)
            let value2 := mload(ptr2)
            mstore(ptr1, value2)
            mstore(ptr2, value1)
        }
    }

    /// @dev Helper: low level cast address memory array to uint256 memory array
    function _castToUint256Array(address[] memory input) private pure returns (uint256[] memory output) {
        assembly {
            output := input
        }
    }

    /// @dev Helper: low level cast bytes32 memory array to uint256 memory array
    function _castToUint256Array(bytes32[] memory input) private pure returns (uint256[] memory output) {
        assembly {
            output := input
        }
    }

    /// @dev Helper: low level cast address comp function to uint256 comp function
    function _castToUint256Comp(
        function(address, address) pure returns (bool) input
    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {
        assembly {
            output := input
        }
    }

    /// @dev Helper: low level cast bytes32 comp function to uint256 comp function
    function _castToUint256Comp(
        function(bytes32, bytes32) pure returns (bool) input
    ) private pure returns (function(uint256, uint256) pure returns (bool) output) {
        assembly {
            output := input
        }
    }

    /**
     * @dev Searches a sorted `array` and returns the first index that contains
     * a value greater or equal to `element`. If no such index exists (i.e. all
     * values in the array are strictly less than `element`), the array length is
     * returned. Time complexity O(log n).
     *
     * NOTE: The `array` is expected to be sorted in ascending order, and to
     * contain no repeated elements.
     *
     * IMPORTANT: Deprecated. This implementation behaves as {lowerBound} but lacks
     * support for repeated elements in the array. The {lowerBound} function should
     * be used instead.
     */
    function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value > element) {
                high = mid;
            } else {
                low = mid + 1;
            }
        }

        // At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.
        if (low > 0 && unsafeAccess(array, low - 1).value == element) {
            return low - 1;
        } else {
            return low;
        }
    }

    /**
     * @dev Searches an `array` sorted in ascending order and returns the first
     * index that contains a value greater or equal than `element`. If no such index
     * exists (i.e. all values in the array are strictly less than `element`), the array
     * length is returned. Time complexity O(log n).
     *
     * See C++'s https://en.cppreference.com/w/cpp/algorithm/lower_bound[lower_bound].
     */
    function lowerBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value < element) {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            } else {
                high = mid;
            }
        }

        return low;
    }

    /**
     * @dev Searches an `array` sorted in ascending order and returns the first
     * index that contains a value strictly greater than `element`. If no such index
     * exists (i.e. all values in the array are strictly less than `element`), the array
     * length is returned. Time complexity O(log n).
     *
     * See C++'s https://en.cppreference.com/w/cpp/algorithm/upper_bound[upper_bound].
     */
    function upperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeAccess(array, mid).value > element) {
                high = mid;
            } else {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            }
        }

        return low;
    }

    /**
     * @dev Same as {lowerBound}, but with an array in memory.
     */
    function lowerBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeMemoryAccess(array, mid) < element) {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            } else {
                high = mid;
            }
        }

        return low;
    }

    /**
     * @dev Same as {upperBound}, but with an array in memory.
     */
    function upperBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
        uint256 low = 0;
        uint256 high = array.length;

        if (high == 0) {
            return 0;
        }

        while (low < high) {
            uint256 mid = Math.average(low, high);

            // Note that mid will always be strictly less than high (i.e. it will be a valid array index)
            // because Math.average rounds towards zero (it does integer division with truncation).
            if (unsafeMemoryAccess(array, mid) > element) {
                high = mid;
            } else {
                // this cannot overflow because mid < high
                unchecked {
                    low = mid + 1;
                }
            }
        }

        return low;
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getAddressSlot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getBytes32Slot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {
        bytes32 slot;
        assembly ("memory-safe") {
            slot := arr.slot
        }
        return slot.deriveArray().offset(pos).getUint256Slot();
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(address[] memory arr, uint256 pos) internal pure returns (address res) {
        assembly {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(bytes32[] memory arr, uint256 pos) internal pure returns (bytes32 res) {
        assembly {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
     *
     * WARNING: Only use if you are certain `pos` is lower than the array length.
     */
    function unsafeMemoryAccess(uint256[] memory arr, uint256 pos) internal pure returns (uint256 res) {
        assembly {
            res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
        }
    }

    /**
     * @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(address[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }

    /**
     * @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(bytes32[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }

    /**
     * @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
     *
     * WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
     */
    function unsafeSetLength(uint256[] storage array, uint256 len) internal {
        assembly ("memory-safe") {
            sstore(array.slot, len)
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Provides a set of functions to compare values.
 *
 * _Available since v5.1._
 */
library Comparators {
    function lt(uint256 a, uint256 b) internal pure returns (bool) {
        return a < b;
    }

    function gt(uint256 a, uint256 b) internal pure returns (bool) {
        return a > b;
    }
}

// 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/cryptography/ECDSA.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/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;
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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.1.0) (utils/SlotDerivation.sol)
// This file was procedurally generated from scripts/generate/templates/SlotDerivation.js.

pragma solidity ^0.8.20;

/**
 * @dev Library for computing storage (and transient storage) locations from namespaces and deriving slots
 * corresponding to standard patterns. The derivation method for array and mapping matches the storage layout used by
 * the solidity language / compiler.
 *
 * See https://docs.soliditylang.org/en/v0.8.20/internals/layout_in_storage.html#mappings-and-dynamic-arrays[Solidity docs for mappings and dynamic arrays.].
 *
 * Example usage:
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using StorageSlot for bytes32;
 *     using SlotDerivation for bytes32;
 *
 *     // Declare a namespace
 *     string private constant _NAMESPACE = "<namespace>" // eg. OpenZeppelin.Slot
 *
 *     function setValueInNamespace(uint256 key, address newValue) internal {
 *         _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value = newValue;
 *     }
 *
 *     function getValueInNamespace(uint256 key) internal view returns (address) {
 *         return _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value;
 *     }
 * }
 * ```
 *
 * TIP: Consider using this library along with {StorageSlot}.
 *
 * NOTE: This library provides a way to manipulate storage locations in a non-standard way. Tooling for checking
 * upgrade safety will ignore the slots accessed through this library.
 *
 * _Available since v5.1._
 */
library SlotDerivation {
    /**
     * @dev Derive an ERC-7201 slot from a string (namespace).
     */
    function erc7201Slot(string memory namespace) internal pure returns (bytes32 slot) {
        assembly ("memory-safe") {
            mstore(0x00, sub(keccak256(add(namespace, 0x20), mload(namespace)), 1))
            slot := and(keccak256(0x00, 0x20), not(0xff))
        }
    }

    /**
     * @dev Add an offset to a slot to get the n-th element of a structure or an array.
     */
    function offset(bytes32 slot, uint256 pos) internal pure returns (bytes32 result) {
        unchecked {
            return bytes32(uint256(slot) + pos);
        }
    }

    /**
     * @dev Derive the location of the first element in an array from the slot where the length is stored.
     */
    function deriveArray(bytes32 slot) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, slot)
            result := keccak256(0x00, 0x20)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, address key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, and(key, shr(96, not(0))))
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bool key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, iszero(iszero(key)))
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bytes32 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, uint256 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, int256 key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            mstore(0x00, key)
            mstore(0x20, slot)
            result := keccak256(0x00, 0x40)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, string memory key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            let length := mload(key)
            let begin := add(key, 0x20)
            let end := add(begin, length)
            let cache := mload(end)
            mstore(end, slot)
            result := keccak256(begin, add(length, 0x20))
            mstore(end, cache)
        }
    }

    /**
     * @dev Derive the location of a mapping element from the key.
     */
    function deriveMapping(bytes32 slot, bytes memory key) internal pure returns (bytes32 result) {
        assembly ("memory-safe") {
            let length := mload(key)
            let begin := add(key, 0x20)
            let end := add(begin, length)
            let cache := mload(end)
            mstore(end, slot)
            result := keccak256(begin, add(length, 0x20))
            mstore(end, cache)
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Library for reading and writing primitive types to specific storage slots.
 *
 * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
 * This library helps with reading and writing to such slots without the need for inline assembly.
 *
 * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
 *
 * Example usage to set ERC-1967 implementation slot:
 * ```solidity
 * contract ERC1967 {
 *     // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.
 *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
 *
 *     function _getImplementation() internal view returns (address) {
 *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
 *     }
 *
 *     function _setImplementation(address newImplementation) internal {
 *         require(newImplementation.code.length > 0);
 *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
 *     }
 * }
 * ```
 *
 * TIP: Consider using this library along with {SlotDerivation}.
 */
library StorageSlot {
    struct AddressSlot {
        address value;
    }

    struct BooleanSlot {
        bool value;
    }

    struct Bytes32Slot {
        bytes32 value;
    }

    struct Uint256Slot {
        uint256 value;
    }

    struct Int256Slot {
        int256 value;
    }

    struct StringSlot {
        string value;
    }

    struct BytesSlot {
        bytes value;
    }

    /**
     * @dev Returns an `AddressSlot` with member `value` located at `slot`.
     */
    function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `BooleanSlot` with member `value` located at `slot`.
     */
    function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Bytes32Slot` with member `value` located at `slot`.
     */
    function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Uint256Slot` with member `value` located at `slot`.
     */
    function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Int256Slot` with member `value` located at `slot`.
     */
    function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `StringSlot` with member `value` located at `slot`.
     */
    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `StringSlot` representation of the string storage pointer `store`.
     */
    function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }

    /**
     * @dev Returns a `BytesSlot` with member `value` located at `slot`.
     */
    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
     */
    function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }
}

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

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"components":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"address","name":"royaltiesReceiver","type":"address"},{"internalType":"address","name":"whitelistSigner","type":"address"}],"internalType":"struct IntraverseVIPProtocol.Roles","name":"_roles","type":"tuple"},{"components":[{"internalType":"uint256","name":"maxRarity","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInGuaranteedPhase","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInFCFSPhase","type":"uint256"},{"internalType":"uint256[]","name":"burnConfig","type":"uint256[]"},{"internalType":"uint256[]","name":"rarities","type":"uint256[]"},{"internalType":"uint256","name":"mintPrice","type":"uint256"}],"internalType":"struct IntraverseVIPProtocol.Config","name":"_config","type":"tuple"},{"internalType":"uint96","name":"_defaultRoyalties","type":"uint96"},{"internalType":"string","name":"_baseUri","type":"string"},{"internalType":"string","name":"_contractUri","type":"string"},{"internalType":"address","name":"_paymentToken","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CannotMintMoreThanTotalPaidSupply","type":"error"},{"inputs":[],"name":"ContractCallsNotAllowed","type":"error"},{"inputs":[],"name":"ECDSAInvalidSignature","type":"error"},{"inputs":[{"internalType":"uint256","name":"length","type":"uint256"}],"name":"ECDSAInvalidSignatureLength","type":"error"},{"inputs":[{"internalType":"bytes32","name":"s","type":"bytes32"}],"name":"ECDSAInvalidSignatureS","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"balance","type":"uint256"},{"internalType":"uint256","name":"needed","type":"uint256"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC1155InsufficientBalance","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC1155InvalidApprover","type":"error"},{"inputs":[{"internalType":"uint256","name":"idsLength","type":"uint256"},{"internalType":"uint256","name":"valuesLength","type":"uint256"}],"name":"ERC1155InvalidArrayLength","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC1155InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC1155InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC1155InvalidSender","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC1155MissingApprovalForAll","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":[],"name":"EmergencyWithdrawalFailed","type":"error"},{"inputs":[],"name":"GlobalMintLimitReached","type":"error"},{"inputs":[],"name":"InsufficientPayment","type":"error"},{"inputs":[{"internalType":"uint256","name":"expected","type":"uint256"},{"internalType":"uint256","name":"actual","type":"uint256"}],"name":"InvalidBurningConfig","type":"error"},{"inputs":[],"name":"InvalidLimitsConfig","type":"error"},{"inputs":[],"name":"InvalidPhase","type":"error"},{"inputs":[{"internalType":"uint256","name":"expected","type":"uint256"},{"internalType":"uint256","name":"actual","type":"uint256"}],"name":"InvalidRaritiesConfig","type":"error"},{"inputs":[],"name":"InvalidRarity","type":"error"},{"inputs":[{"internalType":"address","name":"expected","type":"address"},{"internalType":"address","name":"actual","type":"address"}],"name":"InvalidRecipient","type":"error"},{"inputs":[],"name":"InvalidToken","type":"error"},{"inputs":[],"name":"InvalidTokenId","type":"error"},{"inputs":[],"name":"MaxMintCountReached","type":"error"},{"inputs":[],"name":"MaxRarityAlreadyUnlocked","type":"error"},{"inputs":[],"name":"MintingClosed","type":"error"},{"inputs":[],"name":"NotEnoughTimePassed","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"RarityNotYetUnlocked","type":"error"},{"inputs":[],"name":"RecipientNotWhitelisted","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[],"name":"SecondaryTradeNotYetEnabled","type":"error"},{"inputs":[],"name":"ShufflerNotInitialized","type":"error"},{"inputs":[{"internalType":"uint256","name":"value","type":"uint256"},{"internalType":"uint256","name":"length","type":"uint256"}],"name":"StringsInsufficientHexLength","type":"error"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"}],"name":"TotalMintLimitReachedForUser","type":"error"},{"inputs":[],"name":"TransferFailed","type":"error"},{"inputs":[],"name":"UnexpectedNativeValue","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"account","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":true,"internalType":"address","name":"receiver","type":"address"},{"indexed":false,"internalType":"uint96","name":"feeNumerator","type":"uint96"}],"name":"DefaultRoyaltyUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousToken","type":"address"},{"indexed":true,"internalType":"address","name":"newToken","type":"address"}],"name":"PaymentTokenUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"operator","type":"address"},{"indexed":true,"internalType":"address","name":"buyer","type":"address"},{"indexed":false,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"virtualId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"paidAmount","type":"uint256"}],"name":"Purchase","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"uint256","name":"fromTokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"toTokenId","type":"uint256"}],"name":"TokenUpgraded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"indexed":false,"internalType":"uint256[]","name":"values","type":"uint256[]"}],"name":"TransferBatch","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"id","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"TransferSingle","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"string","name":"value","type":"string"},{"indexed":true,"internalType":"uint256","name":"id","type":"uint256"}],"name":"URI","type":"event"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"uint256","name":"id","type":"uint256"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address[]","name":"accounts","type":"address[]"},{"internalType":"uint256[]","name":"ids","type":"uint256[]"}],"name":"balanceOfBatch","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"}],"name":"canMint","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"completeMinting","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"config","outputs":[{"internalType":"uint256","name":"maxRarity","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInGuaranteedPhase","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInFCFSPhase","type":"uint256"},{"internalType":"uint256","name":"mintPrice","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"contractURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"currentPhase","outputs":[{"internalType":"enum IntraverseVIPProtocol.Phase","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"emergencyWithdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"emergencyWithdrawERC20","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"enableSecondaryTrade","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"id","type":"uint256"}],"name":"exists","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getConfig","outputs":[{"components":[{"internalType":"uint256","name":"maxRarity","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInGuaranteedPhase","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInFCFSPhase","type":"uint256"},{"internalType":"uint256[]","name":"burnConfig","type":"uint256[]"},{"internalType":"uint256[]","name":"rarities","type":"uint256[]"},{"internalType":"uint256","name":"mintPrice","type":"uint256"}],"internalType":"struct IntraverseVIPProtocol.Config","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCurrentPhase","outputs":[{"internalType":"enum IntraverseVIPProtocol.Phase","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"}],"name":"getCurrentPhaseMintCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"message","type":"string"}],"name":"getMessageHash","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"getRoles","outputs":[{"components":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"address","name":"royaltiesReceiver","type":"address"},{"internalType":"address","name":"whitelistSigner","type":"address"}],"internalType":"struct IntraverseVIPProtocol.Roles","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"}],"name":"getUserTotalMintCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isSecondaryTradeEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_address","type":"address"}],"name":"messageFromAddress","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"mintCountInFCFSPhase","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"mintCountInGuaranteedPhase","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"mintCountInPublicPhase","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"mintGlobalCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"mintInitialSupply","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"mintingComplete","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"paidMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"paymentToken","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"roles","outputs":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"address","name":"royaltiesReceiver","type":"address"},{"internalType":"address","name":"whitelistSigner","type":"address"}],"stateMutability":"view","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":"ids","type":"uint256[]"},{"internalType":"uint256[]","name":"amounts","type":"uint256[]"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeBatchTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"id","type":"uint256"},{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"secondaryTradeEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","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":"totalPaidSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"id","type":"uint256"}],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"uint256","name":"maxRarity","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInGuaranteedPhase","type":"uint256"},{"internalType":"uint256","name":"maxMintPerWalletInFCFSPhase","type":"uint256"},{"internalType":"uint256[]","name":"burnConfig","type":"uint256[]"},{"internalType":"uint256[]","name":"rarities","type":"uint256[]"},{"internalType":"uint256","name":"mintPrice","type":"uint256"}],"internalType":"struct IntraverseVIPProtocol.Config","name":"_config","type":"tuple"}],"name":"updateContractConfig","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"_contractUri","type":"string"}],"name":"updateContractURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint96","name":"feeNumerator","type":"uint96"}],"name":"updateDefaultRoyalty","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"_baseUri","type":"string"}],"name":"updateMetadata","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_mintPrice","type":"uint256"}],"name":"updateMintPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_paymentToken","type":"address"}],"name":"updatePaymentToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"enum IntraverseVIPProtocol.Phase","name":"_phase","type":"uint8"}],"name":"updatePhase","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_royaltiesReceiver","type":"address"}],"name":"updateRoyaltiesReceiver","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_whitelistSigner","type":"address"}],"name":"updateWhitelistSigner","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_tokenId","type":"uint256"}],"name":"upgradeTokenTo","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_tokenId","type":"uint256"}],"name":"uri","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"message","type":"string"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"verifySignature","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"}]

608060405234620008cb5762004c2e803803806200001d81620008d0565b92833981818101036101008112620008cb57606013620008cb5760405191606083016001600160401b0381118482101762000545576040526200006081620008f6565b83526200007060208201620008f6565b60208401526200008360408201620008f6565b604084015260608101516001600160401b038111620008cb5781019160c0838284010312620008cb576040519260c084016001600160401b03811185821017620005455760409081528151855260208083015190860152818101519085015260608101516001600160401b038111620008cb5762000107908385019083016200090b565b60608501526080810151906001600160401b038211620008cb576200013460a0928486019083016200090b565b6080860152015160a084015260808201519060018060601b0382168203620008cb5760a08301516001600160401b038111620008cb576200017b9082850190850162000974565b60c08401519091906001600160401b038111620008cb57620001a960e091620001b193870190870162000974565b9401620008f6565b8551825191966001600160a01b03909116929091906001600160401b038211620005455760025490600182811c92168015620008c0575b60208310146200065a5781601f8493116200087e575b50602090601f83116001146200080057600092620007f4575b50508160011b916000199060031b1c1916176002555b8115620007db57600780546001600160a01b03198116841790915560405192906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a36001600855600e805460ff19169055601b805461ffff191690558051600f80546001600160a01b03199081166001600160a01b03938416179091556020830151601080548316918416919091179055604090920151601180549093169116179055835160028110908115620007cf575b50620007c0575060608301515183516000198101919082116200035f57036200078e57608083015151835190818103620007705750506000601a5560005b6080840151805182101562000375576020908260051b01015190601a549180830183116200035f5760019201601a550162000329565b634e487b7160e01b600052601160045260246000fd5b50508383600d5460ff811615620006e7575b5080516012556020810151601355604081015160145560608101518051906001600160401b0382116200054557680100000000000000008211620005455760209060155483601555808410620006c6575b50016015600052602060002060005b838110620006b1575050505060808101518051906001600160401b038211620005455768010000000000000000821162000545576020906016548360165580841062000690575b50016016600052602060002060005b8381106200067b575050505060a0015160175582516001600160401b0381116200054557601f54600181811c9116801562000670575b60208210146200065a57601f811162000617575b506020601f8211600114620005a857819293946000926200059c575b50508160011b916000199060031b1c191617601f555b601880546001600160a01b0319166001600160a01b0392831617905560105416906127106001600160601b038216811062000574575081156200055b57604080519081016001600160401b038111828210176200054557604052828152602060018060601b03831691015260018060a01b03199060a01b161760055560405161420e908162000a008239f35b634e487b7160e01b600052604160045260246000fd5b604051635b6cc80560e11b815260006004820152602490fd5b604051636f483d0960e01b81526001600160601b039092166004830152602482015260449150fd5b015190508480620004a3565b601f60005260206000209060005b601f1984168110620005fe5750600193949583601f19811610620005e4575b505050811b01601f55620004b9565b015160001960f88460031b161c19169055848080620005d5565b9091602060018192858a015181550193019101620005b6565b6200064890601f6000526020600020601f840160051c810191602085106200064f575b601f0160051c0190620009e6565b8462000487565b90915081906200063a565b634e487b7160e01b600052602260045260246000fd5b90607f169062000473565b6001906020845194019381840155016200043d565b620006aa90601660005284846000209182019101620009e6565b876200042e565b600190602084519401938184015501620003e7565b620006e090601560005284846000209182019101620009e6565b87620003d8565b601a5490816001108062000767575b156200072257816000198101116200035f576001916009556000600a5560ff191617600d558462000387565b60405162461bcd60e51b815260206004820152601360248201527f696e76616c6964206c6f77657220626f756e64000000000000000000000000006044820152606490fd5b506001620006f6565b604492506040519163560546dd60e11b835260048301526024820152fd5b82805160001981019081116200035f5760606044920151516040519163060339b960e41b835260048301526024820152fd5b63013ebdc960e51b8152600490fd5b601491501138620002eb565b604051631e4fbdf760e01b815260006004820152602490fd5b01519050388062000217565b60026000908152935060008051602062004c0e83398151915291905b601f198416851062000862576001945083601f1981161062000848575b505050811b016002556200022d565b015160001960f88460031b161c1916905538808062000839565b818101518355602094850194600190930192909101906200081c565b6002600052620008b99060008051602062004c0e833981519152601f850160051c810191602086106200064f57601f0160051c0190620009e6565b38620001fe565b91607f1691620001e8565b600080fd5b6040519190601f01601f191682016001600160401b038111838210176200054557604052565b51906001600160a01b0382168203620008cb57565b81601f82011215620008cb578051916020916001600160401b03841162000545578360051b90838062000940818501620008d0565b809781520192820101928311620008cb578301905b82821062000964575050505090565b8151815290830190830162000955565b919080601f84011215620008cb5782516001600160401b0381116200054557602090620009aa601f8201601f19168301620008d0565b92818452828287010111620008cb5760005b818110620009d257508260009394955001015290565b8581018301518482018401528201620009bc565b818110620009f2575050565b60008155600101620009e656fe6080604052600436101561001257600080fd5b60003560e01c8062728e4614610360578062fdd58e1461035b57806301ffc9a714610356578063055ad42e146102ca578063098d2bb3146103515780630e89341c1461034c57806312aea4c51461034757806318160ddd146103425780632a55205a1461033d5780632ab00129146103385780632eb2c2d6146103335780633013ce291461032e5780633634791e14610329578063392f5f641461032457806340ba5d831461031f57806340c442de1461031a578063415013c1146103155780634ccf1b34146103105780634e1273f41461030b5780634f558e7914610306578063535f56b4146103015780635f94df0b146102fc57806371061398146102f7578063715018a6146102f257806374689fdf146102ed57806379502c55146102e85780637e5b1e24146102e35780638da5cb5b146102de578063918b5be1146102d95780639a6265df146102d4578063a22cb465146102cf578063a3a40ea5146102ca578063a844545d146102c5578063ad09a0f8146102c0578063b446f3b2146102bb578063b4bc4dcb146102b6578063b5163843146102b1578063bd85b039146102ac578063c2ba4744146102a7578063c3f909d4146102a2578063cf3d8e531461029d578063cfcf3cfb14610298578063d691e43c14610293578063d94ac2e41461028e578063db2e21bc14610289578063dd6cbf8d14610284578063e8a3d4851461027f578063e8eef90c1461027a578063e985e9c514610275578063f242432a14610270578063f2fde38b1461026b578063fd5df1f5146102665763ff4ba4e21461026157600080fd5b611ef6565b611e14565b611d75565b611c3b565b611bd9565b611b99565b611ac3565b611a89565b611a18565b6119c5565b611854565b611836565b6117f5565b611765565b6116e6565b6116ba565b611690565b611672565b61165a565b6115af565b611587565b61058e565b611493565b61142b565b611333565b61130c565b611208565b6111a6565b611183565b611127565b6110ac565b611072565b610fb9565b610f8b565b610ed0565b610e0f565b610df4565b610d17565b610cec565b610cae565b610c4d565b610c26565b610acf565b6108de565b61083d565b61081f565b6107f9565b610678565b6105b8565b610426565b6103c6565b3461038157602036600319011261038157610379612daf565b600435601755005b600080fd5b600435906001600160a01b038216820361038157565b602435906001600160a01b038216820361038157565b35906001600160a01b038216820361038157565b3461038157604036600319011261038157602061040b6103e4610386565b602435600052600083526040600020906001600160a01b0316600052602052604060002090565b54604051908152f35b6001600160e01b031981160361038157565b346103815760203660031901126103815761049b6001600160e01b031960043561044f81610414565b167fd9b67a2600000000000000000000000000000000000000000000000000000000811490819082159081610544575b831561049f575b50506040519115158252509081906020820190565b0390f35b7f2a55205a0000000000000000000000000000000000000000000000000000000081149350909183156104d8575b505050388080610486565b92509061051a575b81156104f0575b503880806104cd565b7f01ffc9a700000000000000000000000000000000000000000000000000000000915014386104e7565b7f0e89341c00000000000000000000000000000000000000000000000000000000811491506104e0565b7f2baae9fd000000000000000000000000000000000000000000000000000000008114935061047f565b6004111561057857565b634e487b7160e01b600052602160045260246000fd5b3461038157600036600319011261038157602060ff600e5416604051906105b48161056e565b8152f35b34610381576020366003190112610381576105d1610386565b6105d9612daf565b60ff600e54166105e88161056e565b61060b576001600160a01b03166001600160a01b03196011541617601155600080f35b600460405163268dbf6760e21b8152fd5b60005b83811061062f5750506000910152565b818101518382015260200161061f565b906020916106588151809281855285808601910161061c565b601f01601f1916010190565b90602061067592818152019061063f565b90565b3461038157602036600319011261038157600435610694612c1a565b600091807a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000081818110156107eb575b50506d04ee2d6d415b85acef8100000000808310156107dc575b50662386f26fc10000808310156107cd575b506305f5e100808310156107be575b50612710808310156107af575b50606482101561079f575b600a80921015610795575b60019081602161072e60018801612795565b96870101905b610752575b61049b61074687876124a7565b60405191829182610664565b600019019083907f30313233343536373839616263646566000000000000000000000000000000008282061a83530491821561079057919082610734565b610739565b926001019261071c565b9290606460029104910192610711565b60049194920491019238610706565b600891949204910192386106f9565b601091949204910192386106ea565b602091949204910192386106d8565b6040955004915038806106be565b3461038157600036600319011261038157602060ff601b5460081c166040519015158152f35b34610381576000366003190112610381576020600454604051908152f35b34610381576040366003190112610381576024356004356000526006602052604060002054906001600160a01b038083169260a01c9083156108bf575b506bffffffffffffffffffffffff16908181029181830414901517156108ba57604080516001600160a01b03939093168352612710909104602083015290f35b6124e8565b600554908116935060a01c90506bffffffffffffffffffffffff61087a565b34610381576020366003190112610381576001600160a01b036108ff610386565b16600052601e6020526020604060002054604051908152f35b634e487b7160e01b600052604160045260246000fd5b6060810190811067ffffffffffffffff82111761094a57604052565b610918565b60c0810190811067ffffffffffffffff82111761094a57604052565b6020810190811067ffffffffffffffff82111761094a57604052565b60a0810190811067ffffffffffffffff82111761094a57604052565b90601f8019910116810190811067ffffffffffffffff82111761094a57604052565b604051906109d28261094f565b565b604051906040820182811067ffffffffffffffff82111761094a57604052565b67ffffffffffffffff811161094a5760051b60200190565b9080601f83011215610381576020908235610a26816109f4565b93610a3460405195866109a3565b81855260208086019260051b82010192831161038157602001905b828210610a5d575050505090565b81358152908301908301610a4f565b67ffffffffffffffff811161094a57601f01601f191660200190565b81601f8201121561038157803590610a9f82610a6c565b92610aad60405194856109a3565b8284526020838301011161038157816000926020809301838601378301015290565b346103815760a036600319011261038157610ae8610386565b610af061039c565b906044359167ffffffffffffffff9081841161038157610b1560049436908601610a0c565b9060643583811161038157610b2d9036908701610a0c565b9260843590811161038157610b459036908701610a88565b93610b4e61260e565b15610c16576001600160a01b03808216903382141580610be1575b610bb457831615610b9c5715610b8557610b839550613666565b005b602486600060405191626a0d4560e21b8352820152fd5b602487600060405191632bfa23e760e11b8352820152fd5b6040805163711bec9160e11b815233818b019081526001600160a01b038616602082015290918291010390fd5b5081600052600160205260ff610c0e336040600020906001600160a01b0316600052602052604060002090565b541615610b69565b856040516324fec39160e11b8152fd5b346103815760003660031901126103815760206001600160a01b0360185416604051908152f35b346103815760403660031901126103815767ffffffffffffffff60043581811161038157610c7f903690600401610a88565b9060243590811161038157602091610c9e610ca4923690600401610a88565b906124fe565b6040519015158152f35b346103815760003660031901126103815760606001600160a01b0380600f541690806010541690601154169060405192835260208301526040820152f35b34610381576020366003190112610381576020610d0f610d0a610386565b61255b565b604051908152f35b34610381576020366003190112610381576001600160a01b03610d38610386565b610d40612daf565b168015610dca576040516370a0823160e01b8152306004820152602081602481855afa908115610dc557600091610d96575b5080610d7a57005b610b8391610d906010546001600160a01b031690565b90612df3565b610db8915060203d602011610dbe575b610db081836109a3565b8101906125f3565b38610d72565b503d610da6565b612602565b60046040517fc1ab6dc1000000000000000000000000000000000000000000000000000000008152fd5b34610381576000366003190112610381576020610ca461260e565b3461038157602036600319011261038157610e28610386565b610e30612daf565b60ff600e5416610e3f8161056e565b61060b57601854906001600160a01b0380911691826001600160a01b0319821617601855167f5efdfedf5aef119c431263f0656093045dffdf44b3d8f1b0f158dc295c3a0f8e600080a3005b90815180825260208080930193019160005b828110610eab575050505090565b835185529381019392810192600101610e9d565b906020610675928181520190610e8b565b346103815760403660031901126103815760043567ffffffffffffffff8082116103815736602383011215610381578160040135610f0d816109f4565b92610f1b60405194856109a3565b8184526020916024602086019160051b8301019136831161038157602401905b828210610f7457856024358681116103815761049b91610f62610f68923690600401610a0c565b90612689565b60405191829182610ebf565b838091610f80846103b2565b815201910190610f3b565b3461038157602036600319011261038157600435600052600360205260206040600020541515604051908152f35b3461038157604036600319011261038157610fd2610386565b602435610fdd612daf565b60ff600e5416610fec8161056e565b61060b576019916019548281018091116108ba57601a54106110485760005b82811061101457005b61102f61101f612e4d565b50611028612762565b9084612f54565b835490600182018092116108ba5760019185550161100b565b60046040517f2059b7c0000000000000000000000000000000000000000000000000000000008152fd5b34610381576020366003190112610381576001600160a01b03611093610386565b16600052601c6020526020604060002054604051908152f35b3461038157600080600319360112611124576060906040908180516110d08161092e565b82815282602082015201528051906110e78261092e565b6001600160a01b0380600f541692838152818060105416602083019081528482601154169301928352845195865251166020850152511690820152f35b80fd5b346103815760008060031936011261112457611141612daf565b806001600160a01b036007546001600160a01b03198116600755167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b3461038157600036600319011261038157602060ff601b54166040519015158152f35b3461038157600036600319011261038157608060125460135460145460175491604051938452602084015260408301526060820152f35b6020600319820112610381576004359067ffffffffffffffff82116103815761067591600401610a88565b3461038157611216366111dd565b61121e612daf565b805167ffffffffffffffff811161094a576112438161123e601f546127c7565b612818565b602080601f8311600114611285575081906112759360009261127a575b50508160011b916000199060031b1c19161790565b601f55005b015190503880611260565b90601f198316936112b8601f6000527fa03837a25210ee280c2113ff4b77ca23440b19d4866cca721c801278fd08d80790565b926000905b8682106112f457505083600195106112db575b505050811b01601f55005b015160001960f88460031b161c191690553880806112d0565b806001859682949686015181550195019301906112bd565b346103815760003660031901126103815760206001600160a01b0360075416604051908152f35b3461038157611341366111dd565b611349612daf565b805167ffffffffffffffff811161094a5761136e816113696002546127c7565b612879565b602080601f83116001146113a45750819061139f9360009261127a5750508160011b916000199060031b1c19161790565b600255005b90601f198316936113d760026000527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace90565b926000905b86821061141357505083600195106113fa575b505050811b01600255005b015160001960f88460031b161c191690553880806113ef565b806001859682949686015181550195019301906113dc565b34610381576020366003190112610381576001600160a01b0361144c610386565b1680600052601c60205260406000205490601d60205260406000205482018092116108ba57600052601e60205260406000205481018091116108ba57602090604051908152f35b34610381576040366003190112610381576114ac610386565b6024359081151590818303610381576114c361260e565b15611576576001600160a01b03811692831561154557611506611517923360005260016020526040600020906001600160a01b0316600052602052604060002090565b9060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b60246040517fced3e10000000000000000000000000000000000000000000000000000000000815260006004820152fd5b60046040516324fec39160e11b8152fd5b34610381576000366003190112610381576115a0612daf565b601b805460ff19166001179055005b3461038157600319602036820112610381576004359067ffffffffffffffff908183116103815760c0908336030112610381576115ea6109c5565b908260040135825260248301356020830152604483013560408301526064830135818111610381576116229060043691860101610a0c565b6060830152608483013590811161038157610b839261164960a49260043691840101610a0c565b6080840152013560a08201526128cf565b34610381576020610d0f61166d366111dd565b612a1e565b34610381576000366003190112610381576020601954604051908152f35b34610381576000366003190112610381576116a9612daf565b601b805461ff001916610100179055005b346103815760203660031901126103815760043560005260036020526020604060002054604051908152f35b34610381576020366003190112610381576020610ca4611704610386565b612a4e565b6020815281516020820152602082015160408201526040820151606082015260c060a061175c611747606086015184608087015260e0860190610e8b565b6080860151858203601f190184870152610e8b565b93015191015290565b34610381576000806003193601126111245760a06040516117858161094f565b82815282602082015282604082015260608082015260606080820152015261049b6040516117b28161094f565b6012548152601354602082015260145460408201526117cf612b0e565b60608201526117dc612b7c565b608082015260175460a082015260405191829182611709565b346103815760203660031901126103815760043560048110156103815761181a612daf565b6118238161056e565b60ff8019600e5416911617600e55600080f35b34610381576000366003190112610381576020601a54604051908152f35b346103815760403660031901126103815761186d610386565b6024356bffffffffffffffffffffffff81168082036103815761188e612daf565b60ff600e541661189d8161056e565b61060b5761271080821161198e5750506001600160a01b03821691821561195c577fe12d7d5bdb8218a22277dca8f854dd4573a1cea3d3e4808dc567df9eb1c14bf491611938611957926119016118f26109d4565b6001600160a01b039092168252565b6bffffffffffffffffffffffff831660208201526001600160a01b031960206001600160a01b0383511692015160a01b1617600555565b6040516bffffffffffffffffffffffff90911681529081906020820190565b0390a2005b6040517fb6d9900a00000000000000000000000000000000000000000000000000000000815260006004820152602490fd5b60449250604051917f6f483d0900000000000000000000000000000000000000000000000000000000835260048301526024820152fd5b34610381576020366003190112610381576119de610386565b6119e6612daf565b60ff600e54166119f58161056e565b61060b576001600160a01b03166001600160a01b03196010541617601055600080f35b346103815760008060031936011261112457611a32612daf565b804780611a3c5750f35b818080926001600160a01b03601054165af1611a56612bea565b5015611a5f5780f35b60046040517f7c77b170000000000000000000000000000000000000000000000000000000008152fd5b34610381576020366003190112610381576001600160a01b03611aaa610386565b16600052601d6020526020604060002054604051908152f35b3461038157600080600319360112611124576040519080601f5490611ae7826127c7565b80855291602091600191828116908115611b6c5750600114611b14575b61049b86610746818803826109a3565b9350601f84527fa03837a25210ee280c2113ff4b77ca23440b19d4866cca721c801278fd08d8075b838510611b59575050505081016020016107468261049b38611b04565b8054868601840152938201938101611b3c565b905086955061049b9693506020925061074694915060ff191682840152151560051b820101929338611b04565b346103815760203660031901126103815761049b611bc5611bc0611bbb610386565b6131dc565b612cde565b60405191829160208352602083019061063f565b3461038157604036600319011261038157602060ff611c2f611bf9610386565b6001600160a01b03611c0961039c565b9116600052600184526040600020906001600160a01b0316600052602052604060002090565b54166040519015158152f35b346103815760a036600319011261038157611c54610386565b611c5c61039c565b60843567ffffffffffffffff811161038157611c7c903690600401610a88565b90611c8561260e565b15611576576001600160a01b03808416903382141580611d40575b611d1957821615611d015715611cea57610b8392611ce26064356044359160405192600184526020840152604083019160018352606084015260808301604052565b929091613666565b6024604051626a0d4560e21b815260006004820152fd5b6024604051632bfa23e760e11b815260006004820152fd5b60405163711bec9160e11b81523360048201526001600160a01b0386166024820152604490fd5b5081600052600160205260ff611d6d336040600020906001600160a01b0316600052602052604060002090565b541615611ca0565b3461038157602036600319011261038157611d8e610386565b611d96612daf565b6001600160a01b03809116908115611de357600754826001600160a01b0319821617600755167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60246040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260006004820152fd5b346103815760203660031901126103815760043560018111801590611eeb575b611ec1576000198101908082116108ba5760011981018281116108ba577fe50f460bb8097767005c57264090f55dbadd10aa720924784840d4092ddd1ce191611e96611e8f611e8561195794612d41565b90549060031b1c90565b85336132a3565b611ea8611ea1612762565b8233612f54565b6040805194855260208501919091523393918291820190565b60046040517f27d7b920000000000000000000000000000000000000000000000000000000008152fd5b508060125410611e34565b60408060031936011261038157611f0b610386565b906024359167ffffffffffffffff831161038157611f2e60049336908501610a88565b9060026008541461245257600260085532330361242a57601b5460ff16612402576001600160a01b039182611f6b6018546001600160a01b031690565b169182159182156122e75760175434106122d8575b600e5460ff1690611f908261056e565b81611fa45787875163268dbf6760e21b8152fd5b611fad8261056e565b6001821480156122c5575b612277575b50601954601a54111561224f57611fd38161056e565b6001811480612226575b6121ff5780611fed60029261056e565b14806121d6575b6121b0577f8f7a55179307cea51948432d653dbd53a23fedc388bcb3e04e311f8220d87864612021612e4d565b959092612030600e5460ff1690565b6120398161056e565b60018103612142575061205f816001600160a01b0316600052601c602052604060002090565b6120698154612747565b90555b61207f61207a601954612747565b601955565b61209161208a612762565b8583612f54565b601754885133815260208101959095526040850197909752606084018790521691608090a21561211b57505060008080806120d46010546001600160a01b031690565b601754905af16120e2612bea565b50156120f55750505b610b836001600855565b517f90b8ec18000000000000000000000000000000000000000000000000000000008152fd5b90915061213d92506121356010546001600160a01b031690565b903390613350565b6120eb565b61214b8161056e565b600281036121825750612171816001600160a01b0316600052601d602052604060002090565b61217b8154612747565b905561206c565b8061218e60039261056e565b0361206c57612171816001600160a01b0316600052601e602052604060002090565b8451630a735fb560e31b81526001600160a01b0390911681870190815281906020010390fd5b506121f4816001600160a01b0316600052601d602052604060002090565b546014541115611ff4565b508451630a735fb560e31b81526001600160a01b0390911681870190815281906020010390fd5b50612244826001600160a01b0316600052601c602052604060002090565b546013541115611fdd565b8686517feabfeec8000000000000000000000000000000000000000000000000000000008152fd5b61228f6122939161228a611bc0866131dc565b6124fe565b1590565b61229d5738611fbd565b8686517f5ed3324c000000000000000000000000000000000000000000000000000000008152fd5b506122cf8261056e565b60028214611fb8565b86865163cd1c886760e01b8152fd5b346123da5785516370a0823160e01b81523388820190815260209081908390819083010381895afa918215610dc5576000926123bb575b506017548092106123ac5787517fdd62ed3e000000000000000000000000000000000000000000000000000000008152338a820190815230602082015282908290819060400103818a5afa918215610dc55760009261238f575b50501015611f805786865163cd1c886760e01b8152fd5b6123a59250803d10610dbe57610db081836109a3565b3880612378565b88885163cd1c886760e01b8152fd5b816123d39293503d8411610dbe57610db081836109a3565b903861231e565b8686517fe0aeda7d000000000000000000000000000000000000000000000000000000008152fd5b5050517fa7e4d9bd000000000000000000000000000000000000000000000000000000008152fd5b5050517ff238fbed000000000000000000000000000000000000000000000000000000008152fd5b5050517f3ee5aeb5000000000000000000000000000000000000000000000000000000008152fd5b6124a39160005260006020526040600020906001600160a01b0316600052602052604060002090565b5490565b60206109d29193929360405194816124c8879351809286808701910161061c565b82016124dc8251809386808501910161061c565b010380855201836109a3565b634e487b7160e01b600052601160045260246000fd5b6125489161250e61253f92612a1e565b7f19457468657265756d205369676e6564204d6573736167653a0a333200000000600052601c52603c6000206133a8565b909291926133e4565b6001600160a01b03806011541691161490565b60ff600e541661256a8161056e565b6001810361259057506124a3906001600160a01b0316600052601c602052604060002090565b6125998161056e565b600281036125bf57506124a3906001600160a01b0316600052601d602052604060002090565b806125cb60039261056e565b146125d65750600090565b6124a3906001600160a01b0316600052601e602052604060002090565b90816020910312610381575190565b6040513d6000823e3d90fd5b601954601a5411801590612646575b801561263a575b801561262d5790565b5060ff601b5460081c1690565b5060ff601b5416612624565b506001600160a01b0360075416331461261d565b634e487b7160e01b600052603260045260246000fd5b80518210156126845760209160051b010190565b61265a565b9190918051835180820361270c5750508051906126be6126a8836109f4565b926126b660405194856109a3565b8084526109f4565b60209190601f1901368484013760005b815181101561270457806126f360019260051b85808287010151918a0101519061247a565b6126fd8287612670565b52016126ce565b509193505050565b6040517f5b05999100000000000000000000000000000000000000000000000000000000815260048101919091526024810191909152604490fd5b90600182018092116108ba57565b919082018092116108ba57565b60405161276e8161096b565b60008152906000368137565b604051906127878261092e565b602a82526040366020840137565b9061279f82610a6c565b6127ac60405191826109a3565b82815280926127bd601f1991610a6c565b0190602036910137565b90600182811c921680156127f7575b60208310146127e157565b634e487b7160e01b600052602260045260246000fd5b91607f16916127d6565b81811061280c575050565b60008155600101612801565b90601f8211612825575050565b6109d291601f6000527fa03837a25210ee280c2113ff4b77ca23440b19d4866cca721c801278fd08d807906020601f840160051c8301931061286f575b601f0160051c0190612801565b9091508190612862565b90601f8211612886575050565b6109d29160026000527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace906020601f840160051c8301931061286f57601f0160051c0190612801565b906128d8612daf565b60ff600e54166128e78161056e565b61060b57815160028110908115612a13575b50611ec1576060820180515161290f8451612d32565b036129ce5750608082019081515183518082036129935750506129326000601a55565b60005b82518051821015612967579061296161295c61295383600195612670565b51601a54612755565b601a55565b01612935565b5050916109d2915061297e61228f600d5460ff1690565b156130f75761298e601a54613799565b6130f7565b6040517fac0a8dba00000000000000000000000000000000000000000000000000000000815260048101919091526024810191909152604490fd5b6129d88351612d32565b9051516040517f60339b9000000000000000000000000000000000000000000000000000000000815260048101929092526024820152604490fd5b6014915011386128f9565b604051612a4860208281612a3b818301968781519384920161061c565b81010380845201826109a3565b51902090565b601b5460ff16612b0857600e5460ff16612a678161056e565b8015612b0157601954601a541115612b0157612a828161056e565b60018103612abc5750612aa8906001600160a01b0316600052601c602052604060002090565b546013541115612ab757600190565b600090565b80612ac860029261056e565b14612ad4575b50600190565b612af1906001600160a01b0316600052601d602052604060002090565b546014541115612ab75738612ace565b5050600090565b50600090565b6040519060155480835282602091602082019060156000527f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec475936000905b828210612b62575050506109d2925003836109a3565b855484526001958601958895509381019390910190612b4c565b6040519060165480835282602091602082019060166000527fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b5124289936000905b828210612bd0575050506109d2925003836109a3565b855484526001958601958895509381019390910190612bba565b3d15612c15573d90612bfb82610a6c565b91612c0960405193846109a3565b82523d6000602084013e565b606090565b6040519060008260025491612c2e836127c7565b80835292602090600190818116908115612cba5750600114612c59575b50506109d2925003836109a3565b91509260026000527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace936000925b828410612ca257506109d29450505081016020013880612c4b565b85548885018301529485019487945092810192612c87565b915050602092506109d294915060ff191682840152151560051b8201013880612c4b565b906109d2602860405180947f616464726573733a0000000000000000000000000000000000000000000000006020830152612d22815180926020868601910161061c565b81010360088101855201836109a3565b6000198101919082116108ba57565b6015548110156126845760156000527f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec4750190600090565b6016548110156126845760166000527fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b51242890190600090565b6001600160a01b03600754163303612dc357565b60246040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152fd5b6040517fa9059cbb0000000000000000000000000000000000000000000000000000000060208201526001600160a01b039290921660248301526044808301939093529181526109d291612e486064836109a3565b6134bb565b612e5c61228f600d5460ff1690565b612f2a57612e6861352f565b601654909160009081805b612e7c85612d32565b841015612ef15785811080612ed3575b612eb6575b6001612eac612e7c92612ea6611e8588612d78565b90612755565b9401939050612e73565b9050612e7c6001612eac612ec986612747565b9392505050612e91565b50612ee9612ee3611e8586612d78565b82612755565b861115612e8c565b50915091508015612f00579190565b60046040517f3f6cc768000000000000000000000000000000000000000000000000000000008152fd5b60046040517f8cc827cd000000000000000000000000000000000000000000000000000000008152fd5b9190916001600160a01b03811615611d015760405160018082526020916020810195865260408101918083526060938180606085019681885260808601604052612f9f87878b613f1b565b6000936000935b612fe8575b50505050612fbe612fc391600454612755565b600455565b815103612fda5750506109d2935190519133613c99565b9150916109d2945033613a9b565b9091929386518510156130395761302e84918660051b89019061301c85878401519301516000526003602052604060002090565b613027838254612755565b9055612755565b940192919082612fa6565b93839250612fab565b80519067ffffffffffffffff821161094a5768010000000000000000821161094a57601654826016558083106130c1575b50602080910190601660005260005b83811061308f5750505050565b82517fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b512428982015591810191600101613082565b6130f190837fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b51242899182019101612801565b38613073565b8051601255602080820151601355604082015160145560608201519081519167ffffffffffffffff831161094a5768010000000000000000831161094a57602090601554846015558085106131a6575b500190601560005260005b83811061317457505050508061316d608060a0930151613042565b0151601755565b82517f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec47582015591810191600101613152565b6131d690857f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec4759182019101612801565b38613147565b6001600160a01b0316806131ee61277a565b9160306131fa84613816565b53607861320684613823565b5360295b60018111613255575061321b575090565b6040517fe22e27eb000000000000000000000000000000000000000000000000000000008152600481019190915260146024820152604490fd5b90600f8116906010821015612684577f303132333435363738396162636465660000000000000000000000000000000061329e921a6132948487613833565b5360041c91613844565b61320a565b909291926001600160a01b03821615611cea576132fa936132e160405192600184526020840152604083019160018352606084015260808301604052565b818195929360006040516132f48161096b565b52613d9d565b6000805b825182101561333e576001908260051b9061332f602080848a01015193870101516000526003602052604060002090565b828154039055019101906132fe565b9150506109d291925060045403600455565b90926109d293604051937f23b872dd0000000000000000000000000000000000000000000000000000000060208601526001600160a01b038092166024860152166044840152606483015260648252612e4882610987565b81519190604183036133d9576133d292506020820151906060604084015193015160001a90613851565b9192909190565b505060009160029190565b6133ed8161056e565b806133f6575050565b6133ff8161056e565b600181036134315760046040517ff645eedf000000000000000000000000000000000000000000000000000000008152fd5b61343a8161056e565b60028103613474576040517ffce698f700000000000000000000000000000000000000000000000000000000815260048101839052602490fd5b8061348060039261056e565b146134885750565b6040517fd78bce0c0000000000000000000000000000000000000000000000000000000081526004810191909152602490fd5b906000602091828151910182855af115612602576000513d61352657506001600160a01b0381163b155b6134ec5750565b6024906001600160a01b03604051917f5274afe7000000000000000000000000000000000000000000000000000000008352166004820152fd5b600114156134e5565b60095480156135a85761354b600160ff600d54161515146135ec565b60001943014381116108ba576135a061359a61067593600b549360405160208101914283523360601b60408301524060548201528560748201526074815261359281610987565b519020613637565b91613657565b600b556138d5565b606460405162461bcd60e51b815260206004820152601060248201527f4e6f206d6f726520696473206c656674000000000000000000000000000000006044820152fd5b156135f357565b606460405162461bcd60e51b815260206004820152601c60248201527f53687566666c6572206e6f7420696e697469616c697a656420796574000000006044820152fd5b8115613641570690565b634e487b7160e01b600052601260045260246000fd5b60001981146108ba5760010190565b9193929061367682868386614034565b6001600160a01b0380841615613735575b811615806136d4575b1561369d575b5050505050565b84516001036136c3576020806136b99601519201519233613cce565b3880808080613696565b6136cf94919233613b96565b6136b9565b94936000939091845b865186101561371d576001908660051b9061370e602080848a010151938b0101516000526003602052604060002090565b828154039055019501946136dd565b6137309193969792955060045403600455565b613690565b959192600094916000955b875187101561377c576137746001918860051b9061301c602080848c010151938d0101516000526003602052604060002090565b960195613740565b61379491939650612fbe909892959498600454612755565b613687565b806001108061380e575b156137ca57806000198101116108ba576009556000600a55600160ff19600d541617600d55565b606460405162461bcd60e51b815260206004820152601360248201527f696e76616c6964206c6f77657220626f756e64000000000000000000000000006044820152fd5b5060016137a3565b8051156126845760200190565b8051600110156126845760210190565b908151811015612684570160200190565b80156108ba576000190190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084116138c957926020929160ff608095604051948552168484015260408301526060820152600092839182805260015afa15610dc55780516001600160a01b038116156138c057918190565b50809160019190565b50505060009160039190565b610675906138ec600160ff600d54161515146135ec565b80600052600c6020526040600020548015600014613923575061391e8161391561067593613d05565b600a5490612755565b612747565b61393f600160ff600d541615151461393a816135ec565b6135ec565b6009549081156139c3576106759261391e92600019018060095561396d81600052600c602052604060002090565b54613994575061398a60095491600052600c602052604060002090565b55600a5490612755565b6139ab6139bd91600052600c602052604060002090565b5491600052600c602052604060002090565b55613915565b606460405162461bcd60e51b815260206004820152601b60248201527f436f756e7465723a2064656372656d656e74206f766572666c6f7700000000006044820152fd5b90816020910312610381575161067581610414565b92613a4c61067595936001600160a01b03613a5a941686526000602087015260a0604087015260a0860190610e8b565b908482036060860152610e8b565b91608081840391015261063f565b93906106759593613a4c91613a5a946001600160a01b03809216885216602087015260a0604087015260a0860190610e8b565b9293919093843b613aad575050505050565b602091613ad0604051948593849363bc197c8160e01b9889865260048601613a1c565b038160006001600160a01b0388165af160009181613b65575b50613b285782613af7612bea565b8051919082613b2157604051632bfa23e760e11b81526001600160a01b0383166004820152602490fd5b9050602001fd5b6001600160e01b03191603613b4257503880808080613696565b604051632bfa23e760e11b81526001600160a01b03919091166004820152602490fd5b613b8891925060203d602011613b8f575b613b8081836109a3565b810190613a07565b9038613ae9565b503d613b76565b939290949194853b613bab575b505050505050565b613bce602093604051958694859463bc197c8160e01b998a875260048701613a68565b038160006001600160a01b0388165af160009181613c10575b50613bf55782613af7612bea565b6001600160e01b03191603613b425750388080808080613ba3565b613c2a91925060203d602011613b8f57613b8081836109a3565b9038613be7565b909260a0926001600160a01b0361067596951683526000602084015260408301526060820152816080820152019061063f565b919261067595949160a0946001600160a01b03809216855216602084015260408301526060820152816080820152019061063f565b9293919093843b613cab575050505050565b602091613ad0604051948593849363f23a6e6160e01b9889865260048601613c31565b939290949194853b613ce257505050505050565b613bce602093604051958694859463f23a6e6160e01b998a875260048701613c64565b613d1c600160ff600d541615151461393a816135ec565b60095480156139c3576000190180600955613d4181600052600c602052604060002090565b54613d615750613d5e60095491600052600c602052604060002090565b55565b6139ab613d5e91600052600c602052604060002090565b9091613d8f61067593604084526040840190610e8b565b916020818403910152610e8b565b929190805182519081810361270c57505060005b8151811015613e7a578060051b602080828501015191850101516001600160a01b038716613de4575b5050600101613db1565b613e1487613dfc846000526000602052604060002090565b906001600160a01b0316600052602052604060002090565b54818110613e435787613dfc6001959493613e3b9303936000526000602052604060002090565b559038613dda565b6040516303dee4c560e01b81526001600160a01b038916600482015260248101919091526044810182905260648101839052608490fd5b5090600092939160018151148414613edc576020908101519181015160408051938452918301526001600160a01b03929092169133917fc3d58168c5ae7397731d063d5bbf3d657854427343f4c083240f7aacaa2d0f6291819081015b0390a4565b90916001600160a01b037f4a39dc06d4c0dbc64b70af90fd698a233a518aa5d07e595d983b8c0526c8f7fb91613ed76040519283921695339583613d78565b919091825182519081810361270c57505060005b8351811015613f93578060019160051b8360208083890101519287010151916001600160a01b038216613f66575b50505001613f2f565b613f8991613dfc613f81926000526000602052604060002090565b918254612755565b9055388381613f5d565b50916001815114600014613ff4576020908101519181015160408051938452918301526001600160a01b03929092169160009133917fc3d58168c5ae7397731d063d5bbf3d657854427343f4c083240f7aacaa2d0f62919081908101613ed7565b7f4a39dc06d4c0dbc64b70af90fd698a233a518aa5d07e595d983b8c0526c8f7fb6001600160a01b0360009394613ed76040519283921696339583613d78565b939291805183519081810361270c57505060005b8151811015614133578060051b9060208083850101519286010151846001600160a01b0393848a166140ad575b6001948216614088575b50505001614048565b6140a391613dfc613f81926000526000602052604060002090565b905538848161407f565b91929390506140ca89613dfc846000526000602052604060002090565b548381106140fc57918691846001969594036140f48c613dfc856000526000602052604060002090565b559450614075565b6040516303dee4c560e01b81526001600160a01b038b16600482015260248101919091526044810184905260648101839052608490fd5b508051939493919291600103614195576020908101519181015160408051938452918301526001600160a01b03928316939092169133917fc3d58168c5ae7397731d063d5bbf3d657854427343f4c083240f7aacaa2d0f629181908101613ed7565b90917f4a39dc06d4c0dbc64b70af90fd698a233a518aa5d07e595d983b8c0526c8f7fb906001600160a01b0390613ed78260405193849316971695339583613d7856fea2646970667358221220a499397e67031149b64aba851f07837cdc8e7ff15d2b0c972a2a33e03d2515e664736f6c63430008180033405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace000000000000000000000000ec7954abc86e58a2eb9157a2fb20262c2842e9fe000000000000000000000000755d2594d1f73ec0cfef655f44e445b1d901bf55000000000000000000000000589e148cb0bec7dfe6cd6181833912ef30130a7f00000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000258000000000000000000000000000000000000000000000000000000000000036000000000000000000000000000000000000000000000000000000000000003e0000000000000000000000000a9d23408b9ba935c230493c40c73824df71a097500000000000000000000000000000000000000000000000000000000000000060000000000000000000000000000000000000000000000000000000000000014000000000000000000000000000000000000000000000000000000000000001400000000000000000000000000000000000000000000000000000000000000c00000000000000000000000000000000000000000000000000000000000000180000000000000000000000000000000000000000000000000ebec21ee1da40000000000000000000000000000000000000000000000000000000000000000000500000000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000000600000000000000000000000000000000000000000000000000000000000001e0000000000000000000000000000000000000000000000000000000000000012c00000000000000000000000000000000000000000000000000000000000000960000000000000000000000000000000000000000000000000000000000000032000000000000000000000000000000000000000000000000000000000000001400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000043697066733a2f2f62616679626569687675726a64336b6f6b65326c6e32323375337870327263656368753765366c766969646a6f34676a35696565356968776d32692f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042697066733a2f2f6261666b7265696869776c37707179636b7a6964633236657670356467686a757366776b66636d6b69656c6f3272757a646b686870717663706565000000000000000000000000000000000000000000000000000000000000

0x6080604052600436101561001257600080fd5b60003560e01c8062728e4614610360578062fdd58e1461035b57806301ffc9a714610356578063055ad42e146102ca578063098d2bb3146103515780630e89341c1461034c57806312aea4c51461034757806318160ddd146103425780632a55205a1461033d5780632ab00129146103385780632eb2c2d6146103335780633013ce291461032e5780633634791e14610329578063392f5f641461032457806340ba5d831461031f57806340c442de1461031a578063415013c1146103155780634ccf1b34146103105780634e1273f41461030b5780634f558e7914610306578063535f56b4146103015780635f94df0b146102fc57806371061398146102f7578063715018a6146102f257806374689fdf146102ed57806379502c55146102e85780637e5b1e24146102e35780638da5cb5b146102de578063918b5be1146102d95780639a6265df146102d4578063a22cb465146102cf578063a3a40ea5146102ca578063a844545d146102c5578063ad09a0f8146102c0578063b446f3b2146102bb578063b4bc4dcb146102b6578063b5163843146102b1578063bd85b039146102ac578063c2ba4744146102a7578063c3f909d4146102a2578063cf3d8e531461029d578063cfcf3cfb14610298578063d691e43c14610293578063d94ac2e41461028e578063db2e21bc14610289578063dd6cbf8d14610284578063e8a3d4851461027f578063e8eef90c1461027a578063e985e9c514610275578063f242432a14610270578063f2fde38b1461026b578063fd5df1f5146102665763ff4ba4e21461026157600080fd5b611ef6565b611e14565b611d75565b611c3b565b611bd9565b611b99565b611ac3565b611a89565b611a18565b6119c5565b611854565b611836565b6117f5565b611765565b6116e6565b6116ba565b611690565b611672565b61165a565b6115af565b611587565b61058e565b611493565b61142b565b611333565b61130c565b611208565b6111a6565b611183565b611127565b6110ac565b611072565b610fb9565b610f8b565b610ed0565b610e0f565b610df4565b610d17565b610cec565b610cae565b610c4d565b610c26565b610acf565b6108de565b61083d565b61081f565b6107f9565b610678565b6105b8565b610426565b6103c6565b3461038157602036600319011261038157610379612daf565b600435601755005b600080fd5b600435906001600160a01b038216820361038157565b602435906001600160a01b038216820361038157565b35906001600160a01b038216820361038157565b3461038157604036600319011261038157602061040b6103e4610386565b602435600052600083526040600020906001600160a01b0316600052602052604060002090565b54604051908152f35b6001600160e01b031981160361038157565b346103815760203660031901126103815761049b6001600160e01b031960043561044f81610414565b167fd9b67a2600000000000000000000000000000000000000000000000000000000811490819082159081610544575b831561049f575b50506040519115158252509081906020820190565b0390f35b7f2a55205a0000000000000000000000000000000000000000000000000000000081149350909183156104d8575b505050388080610486565b92509061051a575b81156104f0575b503880806104cd565b7f01ffc9a700000000000000000000000000000000000000000000000000000000915014386104e7565b7f0e89341c00000000000000000000000000000000000000000000000000000000811491506104e0565b7f2baae9fd000000000000000000000000000000000000000000000000000000008114935061047f565b6004111561057857565b634e487b7160e01b600052602160045260246000fd5b3461038157600036600319011261038157602060ff600e5416604051906105b48161056e565b8152f35b34610381576020366003190112610381576105d1610386565b6105d9612daf565b60ff600e54166105e88161056e565b61060b576001600160a01b03166001600160a01b03196011541617601155600080f35b600460405163268dbf6760e21b8152fd5b60005b83811061062f5750506000910152565b818101518382015260200161061f565b906020916106588151809281855285808601910161061c565b601f01601f1916010190565b90602061067592818152019061063f565b90565b3461038157602036600319011261038157600435610694612c1a565b600091807a184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000081818110156107eb575b50506d04ee2d6d415b85acef8100000000808310156107dc575b50662386f26fc10000808310156107cd575b506305f5e100808310156107be575b50612710808310156107af575b50606482101561079f575b600a80921015610795575b60019081602161072e60018801612795565b96870101905b610752575b61049b61074687876124a7565b60405191829182610664565b600019019083907f30313233343536373839616263646566000000000000000000000000000000008282061a83530491821561079057919082610734565b610739565b926001019261071c565b9290606460029104910192610711565b60049194920491019238610706565b600891949204910192386106f9565b601091949204910192386106ea565b602091949204910192386106d8565b6040955004915038806106be565b3461038157600036600319011261038157602060ff601b5460081c166040519015158152f35b34610381576000366003190112610381576020600454604051908152f35b34610381576040366003190112610381576024356004356000526006602052604060002054906001600160a01b038083169260a01c9083156108bf575b506bffffffffffffffffffffffff16908181029181830414901517156108ba57604080516001600160a01b03939093168352612710909104602083015290f35b6124e8565b600554908116935060a01c90506bffffffffffffffffffffffff61087a565b34610381576020366003190112610381576001600160a01b036108ff610386565b16600052601e6020526020604060002054604051908152f35b634e487b7160e01b600052604160045260246000fd5b6060810190811067ffffffffffffffff82111761094a57604052565b610918565b60c0810190811067ffffffffffffffff82111761094a57604052565b6020810190811067ffffffffffffffff82111761094a57604052565b60a0810190811067ffffffffffffffff82111761094a57604052565b90601f8019910116810190811067ffffffffffffffff82111761094a57604052565b604051906109d28261094f565b565b604051906040820182811067ffffffffffffffff82111761094a57604052565b67ffffffffffffffff811161094a5760051b60200190565b9080601f83011215610381576020908235610a26816109f4565b93610a3460405195866109a3565b81855260208086019260051b82010192831161038157602001905b828210610a5d575050505090565b81358152908301908301610a4f565b67ffffffffffffffff811161094a57601f01601f191660200190565b81601f8201121561038157803590610a9f82610a6c565b92610aad60405194856109a3565b8284526020838301011161038157816000926020809301838601378301015290565b346103815760a036600319011261038157610ae8610386565b610af061039c565b906044359167ffffffffffffffff9081841161038157610b1560049436908601610a0c565b9060643583811161038157610b2d9036908701610a0c565b9260843590811161038157610b459036908701610a88565b93610b4e61260e565b15610c16576001600160a01b03808216903382141580610be1575b610bb457831615610b9c5715610b8557610b839550613666565b005b602486600060405191626a0d4560e21b8352820152fd5b602487600060405191632bfa23e760e11b8352820152fd5b6040805163711bec9160e11b815233818b019081526001600160a01b038616602082015290918291010390fd5b5081600052600160205260ff610c0e336040600020906001600160a01b0316600052602052604060002090565b541615610b69565b856040516324fec39160e11b8152fd5b346103815760003660031901126103815760206001600160a01b0360185416604051908152f35b346103815760403660031901126103815767ffffffffffffffff60043581811161038157610c7f903690600401610a88565b9060243590811161038157602091610c9e610ca4923690600401610a88565b906124fe565b6040519015158152f35b346103815760003660031901126103815760606001600160a01b0380600f541690806010541690601154169060405192835260208301526040820152f35b34610381576020366003190112610381576020610d0f610d0a610386565b61255b565b604051908152f35b34610381576020366003190112610381576001600160a01b03610d38610386565b610d40612daf565b168015610dca576040516370a0823160e01b8152306004820152602081602481855afa908115610dc557600091610d96575b5080610d7a57005b610b8391610d906010546001600160a01b031690565b90612df3565b610db8915060203d602011610dbe575b610db081836109a3565b8101906125f3565b38610d72565b503d610da6565b612602565b60046040517fc1ab6dc1000000000000000000000000000000000000000000000000000000008152fd5b34610381576000366003190112610381576020610ca461260e565b3461038157602036600319011261038157610e28610386565b610e30612daf565b60ff600e5416610e3f8161056e565b61060b57601854906001600160a01b0380911691826001600160a01b0319821617601855167f5efdfedf5aef119c431263f0656093045dffdf44b3d8f1b0f158dc295c3a0f8e600080a3005b90815180825260208080930193019160005b828110610eab575050505090565b835185529381019392810192600101610e9d565b906020610675928181520190610e8b565b346103815760403660031901126103815760043567ffffffffffffffff8082116103815736602383011215610381578160040135610f0d816109f4565b92610f1b60405194856109a3565b8184526020916024602086019160051b8301019136831161038157602401905b828210610f7457856024358681116103815761049b91610f62610f68923690600401610a0c565b90612689565b60405191829182610ebf565b838091610f80846103b2565b815201910190610f3b565b3461038157602036600319011261038157600435600052600360205260206040600020541515604051908152f35b3461038157604036600319011261038157610fd2610386565b602435610fdd612daf565b60ff600e5416610fec8161056e565b61060b576019916019548281018091116108ba57601a54106110485760005b82811061101457005b61102f61101f612e4d565b50611028612762565b9084612f54565b835490600182018092116108ba5760019185550161100b565b60046040517f2059b7c0000000000000000000000000000000000000000000000000000000008152fd5b34610381576020366003190112610381576001600160a01b03611093610386565b16600052601c6020526020604060002054604051908152f35b3461038157600080600319360112611124576060906040908180516110d08161092e565b82815282602082015201528051906110e78261092e565b6001600160a01b0380600f541692838152818060105416602083019081528482601154169301928352845195865251166020850152511690820152f35b80fd5b346103815760008060031936011261112457611141612daf565b806001600160a01b036007546001600160a01b03198116600755167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b3461038157600036600319011261038157602060ff601b54166040519015158152f35b3461038157600036600319011261038157608060125460135460145460175491604051938452602084015260408301526060820152f35b6020600319820112610381576004359067ffffffffffffffff82116103815761067591600401610a88565b3461038157611216366111dd565b61121e612daf565b805167ffffffffffffffff811161094a576112438161123e601f546127c7565b612818565b602080601f8311600114611285575081906112759360009261127a575b50508160011b916000199060031b1c19161790565b601f55005b015190503880611260565b90601f198316936112b8601f6000527fa03837a25210ee280c2113ff4b77ca23440b19d4866cca721c801278fd08d80790565b926000905b8682106112f457505083600195106112db575b505050811b01601f55005b015160001960f88460031b161c191690553880806112d0565b806001859682949686015181550195019301906112bd565b346103815760003660031901126103815760206001600160a01b0360075416604051908152f35b3461038157611341366111dd565b611349612daf565b805167ffffffffffffffff811161094a5761136e816113696002546127c7565b612879565b602080601f83116001146113a45750819061139f9360009261127a5750508160011b916000199060031b1c19161790565b600255005b90601f198316936113d760026000527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace90565b926000905b86821061141357505083600195106113fa575b505050811b01600255005b015160001960f88460031b161c191690553880806113ef565b806001859682949686015181550195019301906113dc565b34610381576020366003190112610381576001600160a01b0361144c610386565b1680600052601c60205260406000205490601d60205260406000205482018092116108ba57600052601e60205260406000205481018091116108ba57602090604051908152f35b34610381576040366003190112610381576114ac610386565b6024359081151590818303610381576114c361260e565b15611576576001600160a01b03811692831561154557611506611517923360005260016020526040600020906001600160a01b0316600052602052604060002090565b9060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b60246040517fced3e10000000000000000000000000000000000000000000000000000000000815260006004820152fd5b60046040516324fec39160e11b8152fd5b34610381576000366003190112610381576115a0612daf565b601b805460ff19166001179055005b3461038157600319602036820112610381576004359067ffffffffffffffff908183116103815760c0908336030112610381576115ea6109c5565b908260040135825260248301356020830152604483013560408301526064830135818111610381576116229060043691860101610a0c565b6060830152608483013590811161038157610b839261164960a49260043691840101610a0c565b6080840152013560a08201526128cf565b34610381576020610d0f61166d366111dd565b612a1e565b34610381576000366003190112610381576020601954604051908152f35b34610381576000366003190112610381576116a9612daf565b601b805461ff001916610100179055005b346103815760203660031901126103815760043560005260036020526020604060002054604051908152f35b34610381576020366003190112610381576020610ca4611704610386565b612a4e565b6020815281516020820152602082015160408201526040820151606082015260c060a061175c611747606086015184608087015260e0860190610e8b565b6080860151858203601f190184870152610e8b565b93015191015290565b34610381576000806003193601126111245760a06040516117858161094f565b82815282602082015282604082015260608082015260606080820152015261049b6040516117b28161094f565b6012548152601354602082015260145460408201526117cf612b0e565b60608201526117dc612b7c565b608082015260175460a082015260405191829182611709565b346103815760203660031901126103815760043560048110156103815761181a612daf565b6118238161056e565b60ff8019600e5416911617600e55600080f35b34610381576000366003190112610381576020601a54604051908152f35b346103815760403660031901126103815761186d610386565b6024356bffffffffffffffffffffffff81168082036103815761188e612daf565b60ff600e541661189d8161056e565b61060b5761271080821161198e5750506001600160a01b03821691821561195c577fe12d7d5bdb8218a22277dca8f854dd4573a1cea3d3e4808dc567df9eb1c14bf491611938611957926119016118f26109d4565b6001600160a01b039092168252565b6bffffffffffffffffffffffff831660208201526001600160a01b031960206001600160a01b0383511692015160a01b1617600555565b6040516bffffffffffffffffffffffff90911681529081906020820190565b0390a2005b6040517fb6d9900a00000000000000000000000000000000000000000000000000000000815260006004820152602490fd5b60449250604051917f6f483d0900000000000000000000000000000000000000000000000000000000835260048301526024820152fd5b34610381576020366003190112610381576119de610386565b6119e6612daf565b60ff600e54166119f58161056e565b61060b576001600160a01b03166001600160a01b03196010541617601055600080f35b346103815760008060031936011261112457611a32612daf565b804780611a3c5750f35b818080926001600160a01b03601054165af1611a56612bea565b5015611a5f5780f35b60046040517f7c77b170000000000000000000000000000000000000000000000000000000008152fd5b34610381576020366003190112610381576001600160a01b03611aaa610386565b16600052601d6020526020604060002054604051908152f35b3461038157600080600319360112611124576040519080601f5490611ae7826127c7565b80855291602091600191828116908115611b6c5750600114611b14575b61049b86610746818803826109a3565b9350601f84527fa03837a25210ee280c2113ff4b77ca23440b19d4866cca721c801278fd08d8075b838510611b59575050505081016020016107468261049b38611b04565b8054868601840152938201938101611b3c565b905086955061049b9693506020925061074694915060ff191682840152151560051b820101929338611b04565b346103815760203660031901126103815761049b611bc5611bc0611bbb610386565b6131dc565b612cde565b60405191829160208352602083019061063f565b3461038157604036600319011261038157602060ff611c2f611bf9610386565b6001600160a01b03611c0961039c565b9116600052600184526040600020906001600160a01b0316600052602052604060002090565b54166040519015158152f35b346103815760a036600319011261038157611c54610386565b611c5c61039c565b60843567ffffffffffffffff811161038157611c7c903690600401610a88565b90611c8561260e565b15611576576001600160a01b03808416903382141580611d40575b611d1957821615611d015715611cea57610b8392611ce26064356044359160405192600184526020840152604083019160018352606084015260808301604052565b929091613666565b6024604051626a0d4560e21b815260006004820152fd5b6024604051632bfa23e760e11b815260006004820152fd5b60405163711bec9160e11b81523360048201526001600160a01b0386166024820152604490fd5b5081600052600160205260ff611d6d336040600020906001600160a01b0316600052602052604060002090565b541615611ca0565b3461038157602036600319011261038157611d8e610386565b611d96612daf565b6001600160a01b03809116908115611de357600754826001600160a01b0319821617600755167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a3005b60246040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260006004820152fd5b346103815760203660031901126103815760043560018111801590611eeb575b611ec1576000198101908082116108ba5760011981018281116108ba577fe50f460bb8097767005c57264090f55dbadd10aa720924784840d4092ddd1ce191611e96611e8f611e8561195794612d41565b90549060031b1c90565b85336132a3565b611ea8611ea1612762565b8233612f54565b6040805194855260208501919091523393918291820190565b60046040517f27d7b920000000000000000000000000000000000000000000000000000000008152fd5b508060125410611e34565b60408060031936011261038157611f0b610386565b906024359167ffffffffffffffff831161038157611f2e60049336908501610a88565b9060026008541461245257600260085532330361242a57601b5460ff16612402576001600160a01b039182611f6b6018546001600160a01b031690565b169182159182156122e75760175434106122d8575b600e5460ff1690611f908261056e565b81611fa45787875163268dbf6760e21b8152fd5b611fad8261056e565b6001821480156122c5575b612277575b50601954601a54111561224f57611fd38161056e565b6001811480612226575b6121ff5780611fed60029261056e565b14806121d6575b6121b0577f8f7a55179307cea51948432d653dbd53a23fedc388bcb3e04e311f8220d87864612021612e4d565b959092612030600e5460ff1690565b6120398161056e565b60018103612142575061205f816001600160a01b0316600052601c602052604060002090565b6120698154612747565b90555b61207f61207a601954612747565b601955565b61209161208a612762565b8583612f54565b601754885133815260208101959095526040850197909752606084018790521691608090a21561211b57505060008080806120d46010546001600160a01b031690565b601754905af16120e2612bea565b50156120f55750505b610b836001600855565b517f90b8ec18000000000000000000000000000000000000000000000000000000008152fd5b90915061213d92506121356010546001600160a01b031690565b903390613350565b6120eb565b61214b8161056e565b600281036121825750612171816001600160a01b0316600052601d602052604060002090565b61217b8154612747565b905561206c565b8061218e60039261056e565b0361206c57612171816001600160a01b0316600052601e602052604060002090565b8451630a735fb560e31b81526001600160a01b0390911681870190815281906020010390fd5b506121f4816001600160a01b0316600052601d602052604060002090565b546014541115611ff4565b508451630a735fb560e31b81526001600160a01b0390911681870190815281906020010390fd5b50612244826001600160a01b0316600052601c602052604060002090565b546013541115611fdd565b8686517feabfeec8000000000000000000000000000000000000000000000000000000008152fd5b61228f6122939161228a611bc0866131dc565b6124fe565b1590565b61229d5738611fbd565b8686517f5ed3324c000000000000000000000000000000000000000000000000000000008152fd5b506122cf8261056e565b60028214611fb8565b86865163cd1c886760e01b8152fd5b346123da5785516370a0823160e01b81523388820190815260209081908390819083010381895afa918215610dc5576000926123bb575b506017548092106123ac5787517fdd62ed3e000000000000000000000000000000000000000000000000000000008152338a820190815230602082015282908290819060400103818a5afa918215610dc55760009261238f575b50501015611f805786865163cd1c886760e01b8152fd5b6123a59250803d10610dbe57610db081836109a3565b3880612378565b88885163cd1c886760e01b8152fd5b816123d39293503d8411610dbe57610db081836109a3565b903861231e565b8686517fe0aeda7d000000000000000000000000000000000000000000000000000000008152fd5b5050517fa7e4d9bd000000000000000000000000000000000000000000000000000000008152fd5b5050517ff238fbed000000000000000000000000000000000000000000000000000000008152fd5b5050517f3ee5aeb5000000000000000000000000000000000000000000000000000000008152fd5b6124a39160005260006020526040600020906001600160a01b0316600052602052604060002090565b5490565b60206109d29193929360405194816124c8879351809286808701910161061c565b82016124dc8251809386808501910161061c565b010380855201836109a3565b634e487b7160e01b600052601160045260246000fd5b6125489161250e61253f92612a1e565b7f19457468657265756d205369676e6564204d6573736167653a0a333200000000600052601c52603c6000206133a8565b909291926133e4565b6001600160a01b03806011541691161490565b60ff600e541661256a8161056e565b6001810361259057506124a3906001600160a01b0316600052601c602052604060002090565b6125998161056e565b600281036125bf57506124a3906001600160a01b0316600052601d602052604060002090565b806125cb60039261056e565b146125d65750600090565b6124a3906001600160a01b0316600052601e602052604060002090565b90816020910312610381575190565b6040513d6000823e3d90fd5b601954601a5411801590612646575b801561263a575b801561262d5790565b5060ff601b5460081c1690565b5060ff601b5416612624565b506001600160a01b0360075416331461261d565b634e487b7160e01b600052603260045260246000fd5b80518210156126845760209160051b010190565b61265a565b9190918051835180820361270c5750508051906126be6126a8836109f4565b926126b660405194856109a3565b8084526109f4565b60209190601f1901368484013760005b815181101561270457806126f360019260051b85808287010151918a0101519061247a565b6126fd8287612670565b52016126ce565b509193505050565b6040517f5b05999100000000000000000000000000000000000000000000000000000000815260048101919091526024810191909152604490fd5b90600182018092116108ba57565b919082018092116108ba57565b60405161276e8161096b565b60008152906000368137565b604051906127878261092e565b602a82526040366020840137565b9061279f82610a6c565b6127ac60405191826109a3565b82815280926127bd601f1991610a6c565b0190602036910137565b90600182811c921680156127f7575b60208310146127e157565b634e487b7160e01b600052602260045260246000fd5b91607f16916127d6565b81811061280c575050565b60008155600101612801565b90601f8211612825575050565b6109d291601f6000527fa03837a25210ee280c2113ff4b77ca23440b19d4866cca721c801278fd08d807906020601f840160051c8301931061286f575b601f0160051c0190612801565b9091508190612862565b90601f8211612886575050565b6109d29160026000527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace906020601f840160051c8301931061286f57601f0160051c0190612801565b906128d8612daf565b60ff600e54166128e78161056e565b61060b57815160028110908115612a13575b50611ec1576060820180515161290f8451612d32565b036129ce5750608082019081515183518082036129935750506129326000601a55565b60005b82518051821015612967579061296161295c61295383600195612670565b51601a54612755565b601a55565b01612935565b5050916109d2915061297e61228f600d5460ff1690565b156130f75761298e601a54613799565b6130f7565b6040517fac0a8dba00000000000000000000000000000000000000000000000000000000815260048101919091526024810191909152604490fd5b6129d88351612d32565b9051516040517f60339b9000000000000000000000000000000000000000000000000000000000815260048101929092526024820152604490fd5b6014915011386128f9565b604051612a4860208281612a3b818301968781519384920161061c565b81010380845201826109a3565b51902090565b601b5460ff16612b0857600e5460ff16612a678161056e565b8015612b0157601954601a541115612b0157612a828161056e565b60018103612abc5750612aa8906001600160a01b0316600052601c602052604060002090565b546013541115612ab757600190565b600090565b80612ac860029261056e565b14612ad4575b50600190565b612af1906001600160a01b0316600052601d602052604060002090565b546014541115612ab75738612ace565b5050600090565b50600090565b6040519060155480835282602091602082019060156000527f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec475936000905b828210612b62575050506109d2925003836109a3565b855484526001958601958895509381019390910190612b4c565b6040519060165480835282602091602082019060166000527fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b5124289936000905b828210612bd0575050506109d2925003836109a3565b855484526001958601958895509381019390910190612bba565b3d15612c15573d90612bfb82610a6c565b91612c0960405193846109a3565b82523d6000602084013e565b606090565b6040519060008260025491612c2e836127c7565b80835292602090600190818116908115612cba5750600114612c59575b50506109d2925003836109a3565b91509260026000527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace936000925b828410612ca257506109d29450505081016020013880612c4b565b85548885018301529485019487945092810192612c87565b915050602092506109d294915060ff191682840152151560051b8201013880612c4b565b906109d2602860405180947f616464726573733a0000000000000000000000000000000000000000000000006020830152612d22815180926020868601910161061c565b81010360088101855201836109a3565b6000198101919082116108ba57565b6015548110156126845760156000527f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec4750190600090565b6016548110156126845760166000527fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b51242890190600090565b6001600160a01b03600754163303612dc357565b60246040517f118cdaa7000000000000000000000000000000000000000000000000000000008152336004820152fd5b6040517fa9059cbb0000000000000000000000000000000000000000000000000000000060208201526001600160a01b039290921660248301526044808301939093529181526109d291612e486064836109a3565b6134bb565b612e5c61228f600d5460ff1690565b612f2a57612e6861352f565b601654909160009081805b612e7c85612d32565b841015612ef15785811080612ed3575b612eb6575b6001612eac612e7c92612ea6611e8588612d78565b90612755565b9401939050612e73565b9050612e7c6001612eac612ec986612747565b9392505050612e91565b50612ee9612ee3611e8586612d78565b82612755565b861115612e8c565b50915091508015612f00579190565b60046040517f3f6cc768000000000000000000000000000000000000000000000000000000008152fd5b60046040517f8cc827cd000000000000000000000000000000000000000000000000000000008152fd5b9190916001600160a01b03811615611d015760405160018082526020916020810195865260408101918083526060938180606085019681885260808601604052612f9f87878b613f1b565b6000936000935b612fe8575b50505050612fbe612fc391600454612755565b600455565b815103612fda5750506109d2935190519133613c99565b9150916109d2945033613a9b565b9091929386518510156130395761302e84918660051b89019061301c85878401519301516000526003602052604060002090565b613027838254612755565b9055612755565b940192919082612fa6565b93839250612fab565b80519067ffffffffffffffff821161094a5768010000000000000000821161094a57601654826016558083106130c1575b50602080910190601660005260005b83811061308f5750505050565b82517fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b512428982015591810191600101613082565b6130f190837fd833147d7dc355ba459fc788f669e58cfaf9dc25ddcd0702e87d69c7b51242899182019101612801565b38613073565b8051601255602080820151601355604082015160145560608201519081519167ffffffffffffffff831161094a5768010000000000000000831161094a57602090601554846015558085106131a6575b500190601560005260005b83811061317457505050508061316d608060a0930151613042565b0151601755565b82517f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec47582015591810191600101613152565b6131d690857f55f448fdea98c4d29eb340757ef0a66cd03dbb9538908a6a81d96026b71ec4759182019101612801565b38613147565b6001600160a01b0316806131ee61277a565b9160306131fa84613816565b53607861320684613823565b5360295b60018111613255575061321b575090565b6040517fe22e27eb000000000000000000000000000000000000000000000000000000008152600481019190915260146024820152604490fd5b90600f8116906010821015612684577f303132333435363738396162636465660000000000000000000000000000000061329e921a6132948487613833565b5360041c91613844565b61320a565b909291926001600160a01b03821615611cea576132fa936132e160405192600184526020840152604083019160018352606084015260808301604052565b818195929360006040516132f48161096b565b52613d9d565b6000805b825182101561333e576001908260051b9061332f602080848a01015193870101516000526003602052604060002090565b828154039055019101906132fe565b9150506109d291925060045403600455565b90926109d293604051937f23b872dd0000000000000000000000000000000000000000000000000000000060208601526001600160a01b038092166024860152166044840152606483015260648252612e4882610987565b81519190604183036133d9576133d292506020820151906060604084015193015160001a90613851565b9192909190565b505060009160029190565b6133ed8161056e565b806133f6575050565b6133ff8161056e565b600181036134315760046040517ff645eedf000000000000000000000000000000000000000000000000000000008152fd5b61343a8161056e565b60028103613474576040517ffce698f700000000000000000000000000000000000000000000000000000000815260048101839052602490fd5b8061348060039261056e565b146134885750565b6040517fd78bce0c0000000000000000000000000000000000000000000000000000000081526004810191909152602490fd5b906000602091828151910182855af115612602576000513d61352657506001600160a01b0381163b155b6134ec5750565b6024906001600160a01b03604051917f5274afe7000000000000000000000000000000000000000000000000000000008352166004820152fd5b600114156134e5565b60095480156135a85761354b600160ff600d54161515146135ec565b60001943014381116108ba576135a061359a61067593600b549360405160208101914283523360601b60408301524060548201528560748201526074815261359281610987565b519020613637565b91613657565b600b556138d5565b606460405162461bcd60e51b815260206004820152601060248201527f4e6f206d6f726520696473206c656674000000000000000000000000000000006044820152fd5b156135f357565b606460405162461bcd60e51b815260206004820152601c60248201527f53687566666c6572206e6f7420696e697469616c697a656420796574000000006044820152fd5b8115613641570690565b634e487b7160e01b600052601260045260246000fd5b60001981146108ba5760010190565b9193929061367682868386614034565b6001600160a01b0380841615613735575b811615806136d4575b1561369d575b5050505050565b84516001036136c3576020806136b99601519201519233613cce565b3880808080613696565b6136cf94919233613b96565b6136b9565b94936000939091845b865186101561371d576001908660051b9061370e602080848a010151938b0101516000526003602052604060002090565b828154039055019501946136dd565b6137309193969792955060045403600455565b613690565b959192600094916000955b875187101561377c576137746001918860051b9061301c602080848c010151938d0101516000526003602052604060002090565b960195613740565b61379491939650612fbe909892959498600454612755565b613687565b806001108061380e575b156137ca57806000198101116108ba576009556000600a55600160ff19600d541617600d55565b606460405162461bcd60e51b815260206004820152601360248201527f696e76616c6964206c6f77657220626f756e64000000000000000000000000006044820152fd5b5060016137a3565b8051156126845760200190565b8051600110156126845760210190565b908151811015612684570160200190565b80156108ba576000190190565b91907f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a084116138c957926020929160ff608095604051948552168484015260408301526060820152600092839182805260015afa15610dc55780516001600160a01b038116156138c057918190565b50809160019190565b50505060009160039190565b610675906138ec600160ff600d54161515146135ec565b80600052600c6020526040600020548015600014613923575061391e8161391561067593613d05565b600a5490612755565b612747565b61393f600160ff600d541615151461393a816135ec565b6135ec565b6009549081156139c3576106759261391e92600019018060095561396d81600052600c602052604060002090565b54613994575061398a60095491600052600c602052604060002090565b55600a5490612755565b6139ab6139bd91600052600c602052604060002090565b5491600052600c602052604060002090565b55613915565b606460405162461bcd60e51b815260206004820152601b60248201527f436f756e7465723a2064656372656d656e74206f766572666c6f7700000000006044820152fd5b90816020910312610381575161067581610414565b92613a4c61067595936001600160a01b03613a5a941686526000602087015260a0604087015260a0860190610e8b565b908482036060860152610e8b565b91608081840391015261063f565b93906106759593613a4c91613a5a946001600160a01b03809216885216602087015260a0604087015260a0860190610e8b565b9293919093843b613aad575050505050565b602091613ad0604051948593849363bc197c8160e01b9889865260048601613a1c565b038160006001600160a01b0388165af160009181613b65575b50613b285782613af7612bea565b8051919082613b2157604051632bfa23e760e11b81526001600160a01b0383166004820152602490fd5b9050602001fd5b6001600160e01b03191603613b4257503880808080613696565b604051632bfa23e760e11b81526001600160a01b03919091166004820152602490fd5b613b8891925060203d602011613b8f575b613b8081836109a3565b810190613a07565b9038613ae9565b503d613b76565b939290949194853b613bab575b505050505050565b613bce602093604051958694859463bc197c8160e01b998a875260048701613a68565b038160006001600160a01b0388165af160009181613c10575b50613bf55782613af7612bea565b6001600160e01b03191603613b425750388080808080613ba3565b613c2a91925060203d602011613b8f57613b8081836109a3565b9038613be7565b909260a0926001600160a01b0361067596951683526000602084015260408301526060820152816080820152019061063f565b919261067595949160a0946001600160a01b03809216855216602084015260408301526060820152816080820152019061063f565b9293919093843b613cab575050505050565b602091613ad0604051948593849363f23a6e6160e01b9889865260048601613c31565b939290949194853b613ce257505050505050565b613bce602093604051958694859463f23a6e6160e01b998a875260048701613c64565b613d1c600160ff600d541615151461393a816135ec565b60095480156139c3576000190180600955613d4181600052600c602052604060002090565b54613d615750613d5e60095491600052600c602052604060002090565b55565b6139ab613d5e91600052600c602052604060002090565b9091613d8f61067593604084526040840190610e8b565b916020818403910152610e8b565b929190805182519081810361270c57505060005b8151811015613e7a578060051b602080828501015191850101516001600160a01b038716613de4575b5050600101613db1565b613e1487613dfc846000526000602052604060002090565b906001600160a01b0316600052602052604060002090565b54818110613e435787613dfc6001959493613e3b9303936000526000602052604060002090565b559038613dda565b6040516303dee4c560e01b81526001600160a01b038916600482015260248101919091526044810182905260648101839052608490fd5b5090600092939160018151148414613edc576020908101519181015160408051938452918301526001600160a01b03929092169133917fc3d58168c5ae7397731d063d5bbf3d657854427343f4c083240f7aacaa2d0f6291819081015b0390a4565b90916001600160a01b037f4a39dc06d4c0dbc64b70af90fd698a233a518aa5d07e595d983b8c0526c8f7fb91613ed76040519283921695339583613d78565b919091825182519081810361270c57505060005b8351811015613f93578060019160051b8360208083890101519287010151916001600160a01b038216613f66575b50505001613f2f565b613f8991613dfc613f81926000526000602052604060002090565b918254612755565b9055388381613f5d565b50916001815114600014613ff4576020908101519181015160408051938452918301526001600160a01b03929092169160009133917fc3d58168c5ae7397731d063d5bbf3d657854427343f4c083240f7aacaa2d0f62919081908101613ed7565b7f4a39dc06d4c0dbc64b70af90fd698a233a518aa5d07e595d983b8c0526c8f7fb6001600160a01b0360009394613ed76040519283921696339583613d78565b939291805183519081810361270c57505060005b8151811015614133578060051b9060208083850101519286010151846001600160a01b0393848a166140ad575b6001948216614088575b50505001614048565b6140a391613dfc613f81926000526000602052604060002090565b905538848161407f565b91929390506140ca89613dfc846000526000602052604060002090565b548381106140fc57918691846001969594036140f48c613dfc856000526000602052604060002090565b559450614075565b6040516303dee4c560e01b81526001600160a01b038b16600482015260248101919091526044810184905260648101839052608490fd5b508051939493919291600103614195576020908101519181015160408051938452918301526001600160a01b03928316939092169133917fc3d58168c5ae7397731d063d5bbf3d657854427343f4c083240f7aacaa2d0f629181908101613ed7565b90917f4a39dc06d4c0dbc64b70af90fd698a233a518aa5d07e595d983b8c0526c8f7fb906001600160a01b0390613ed78260405193849316971695339583613d7856fea2646970667358221220a499397e67031149b64aba851f07837cdc8e7ff15d2b0c972a2a33e03d2515e664736f6c63430008180033

000000000000000000000000ec7954abc86e58a2eb9157a2fb20262c2842e9fe000000000000000000000000755d2594d1f73ec0cfef655f44e445b1d901bf55000000000000000000000000589e148cb0bec7dfe6cd6181833912ef30130a7f00000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000258000000000000000000000000000000000000000000000000000000000000036000000000000000000000000000000000000000000000000000000000000003e0000000000000000000000000a9d23408b9ba935c230493c40c73824df71a097500000000000000000000000000000000000000000000000000000000000000060000000000000000000000000000000000000000000000000000000000000014000000000000000000000000000000000000000000000000000000000000001400000000000000000000000000000000000000000000000000000000000000c00000000000000000000000000000000000000000000000000000000000000180000000000000000000000000000000000000000000000000ebec21ee1da40000000000000000000000000000000000000000000000000000000000000000000500000000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000000600000000000000000000000000000000000000000000000000000000000001e0000000000000000000000000000000000000000000000000000000000000012c00000000000000000000000000000000000000000000000000000000000000960000000000000000000000000000000000000000000000000000000000000032000000000000000000000000000000000000000000000000000000000000001400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000043697066733a2f2f62616679626569687675726a64336b6f6b65326c6e32323375337870327263656368753765366c766969646a6f34676a35696565356968776d32692f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042697066733a2f2f6261666b7265696869776c37707179636b7a6964633236657670356467686a757366776b66636d6b69656c6f3272757a646b686870717663706565000000000000000000000000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : _roles (tuple): 
     Arg [1] : initialOwner (address): 0xEC7954abc86E58a2eB9157a2Fb20262c2842E9fE
     Arg [2] : royaltiesReceiver (address): 0x755d2594D1F73EC0CfeF655F44E445b1d901BF55
     Arg [3] : whitelistSigner (address): 0x589E148Cb0bEc7dfe6cd6181833912Ef30130a7f

Arg [1] : _config (tuple): 
     Arg [1] : maxRarity (uint256): 6
     Arg [2] : maxMintPerWalletInGuaranteedPhase (uint256): 20
     Arg [3] : maxMintPerWalletInFCFSPhase (uint256): 20
     Arg [4] : burnConfig (uint256[]): 2,2,2,2,2
     Arg [5] : rarities (uint256[]): 480,300,150,50,20,0
     Arg [6] : mintPrice (uint256): 17000000000000000000

Arg [2] : _defaultRoyalties (uint96): 600
Arg [3] : _baseUri (string): ipfs://bafybeihvurjd3koke2ln223u3xp2rcechu7e6lviidjo4gj5iee5ihwm2i/
Arg [4] : _contractUri (string): ipfs://bafkreihiwl7pqyckzidc26evp5dghjusfwkfcmkielo2ruzdkhhpqvcpee
Arg [5] : _paymentToken (address): 0xA9d23408b9bA935c230493c40C73824Df71A0975

-----Encoded View---------------
35 Constructor Arguments found :
Arg [0] : 000000000000000000000000ec7954abc86e58a2eb9157a2fb20262c2842e9fe
Arg [1] : 000000000000000000000000755d2594d1f73ec0cfef655f44e445b1d901bf55
Arg [2] : 000000000000000000000000589e148cb0bec7dfe6cd6181833912ef30130a7f
Arg [3] : 0000000000000000000000000000000000000000000000000000000000000100
Arg [4] : 0000000000000000000000000000000000000000000000000000000000000258
Arg [5] : 0000000000000000000000000000000000000000000000000000000000000360
Arg [6] : 00000000000000000000000000000000000000000000000000000000000003e0
Arg [7] : 000000000000000000000000a9d23408b9ba935c230493c40c73824df71a0975
Arg [8] : 0000000000000000000000000000000000000000000000000000000000000006
Arg [9] : 0000000000000000000000000000000000000000000000000000000000000014
Arg [10] : 0000000000000000000000000000000000000000000000000000000000000014
Arg [11] : 00000000000000000000000000000000000000000000000000000000000000c0
Arg [12] : 0000000000000000000000000000000000000000000000000000000000000180
Arg [13] : 000000000000000000000000000000000000000000000000ebec21ee1da40000
Arg [14] : 0000000000000000000000000000000000000000000000000000000000000005
Arg [15] : 0000000000000000000000000000000000000000000000000000000000000002
Arg [16] : 0000000000000000000000000000000000000000000000000000000000000002
Arg [17] : 0000000000000000000000000000000000000000000000000000000000000002
Arg [18] : 0000000000000000000000000000000000000000000000000000000000000002
Arg [19] : 0000000000000000000000000000000000000000000000000000000000000002
Arg [20] : 0000000000000000000000000000000000000000000000000000000000000006
Arg [21] : 00000000000000000000000000000000000000000000000000000000000001e0
Arg [22] : 000000000000000000000000000000000000000000000000000000000000012c
Arg [23] : 0000000000000000000000000000000000000000000000000000000000000096
Arg [24] : 0000000000000000000000000000000000000000000000000000000000000032
Arg [25] : 0000000000000000000000000000000000000000000000000000000000000014
Arg [26] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [27] : 0000000000000000000000000000000000000000000000000000000000000043
Arg [28] : 697066733a2f2f62616679626569687675726a64336b6f6b65326c6e32323375
Arg [29] : 337870327263656368753765366c766969646a6f34676a35696565356968776d
Arg [30] : 32692f0000000000000000000000000000000000000000000000000000000000
Arg [31] : 0000000000000000000000000000000000000000000000000000000000000042
Arg [32] : 697066733a2f2f6261666b7265696869776c37707179636b7a69646332366576
Arg [33] : 70356467686a757366776b66636d6b69656c6f3272757a646b68687071766370
Arg [34] : 6565000000000000000000000000000000000000000000000000000000000000