Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Is this a proxy?
• Similar
• Sol2Uml
• Submit Audit
• Compare

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

import {IERC20} from "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import {IERC721} from "@openzeppelin/contracts/token/ERC721/IERC721.sol";
import {IERC1155} from "@openzeppelin/contracts/token/ERC1155/IERC1155.sol";
import {SafeERC20} from "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";
import {EnumerableMap} from "@openzeppelin/contracts/utils/structs/EnumerableMap.sol";
import {OwnableUpgradeable} from "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";
import {UUPSUpgradeable} from "@openzeppelin/contracts-upgradeable/proxy/utils/UUPSUpgradeable.sol";
import {ERC721Upgradeable} from "@openzeppelin/contracts-upgradeable/token/ERC721/ERC721Upgradeable.sol";
import {IVaultOperations} from "../../interfaces/dataobject-interfaces/IVaultOperations.sol";
import {DataPoint} from "../../utils/DataPoints.sol";
import {IDataIndex} from "../../interfaces/dataIndex/IDataIndex.sol";
import {IDataObject} from "../../interfaces/dataIndex/IDataObject.sol";
import {IVault} from "../../interfaces/IVault.sol";
import {IWrapper} from "../../interfaces/dataManagers/IWrapper.sol";

/*
 * @title Wrapper
 * @notice Contract for wrapping and unwrapping assets on an ERC721 token
 * @dev This contract is used to wrap and unwrap assets on a generic vault contract by a vault data object
 *      that is represented by an ERC721 token.
 *
 *      NOTE: This contract MUST be approved in the Data Index contract to interact with the given Data Point.
 */
contract Wrapper is ERC721Upgradeable, OwnableUpgradeable, UUPSUpgradeable, IWrapper {
    using SafeERC20 for IERC20;
    using EnumerableSet for EnumerableSet.UintSet;
    using EnumerableMap for EnumerableMap.AddressToUintMap;

    /// @notice The Vault Data Object
    IDataObject public vaultDO;

    /// @dev The Data Point identifier for the Vault Data Object
    DataPoint internal _datapoint;

    /// @notice The Data Index implementation
    IDataIndex public dataIndex;

    /// @notice The address of the Vault Factory
    address public vaultFactory;

    /// @dev Counter for the Wrapper NFTs
    uint256 private _nftCounter;

    /// @dev Counter for the Wrapped Objects
    uint256 private _wrappedObjectsCounter;

    /// @notice Mapping of nftId to the vault address
    mapping(uint256 nftId => address) public vaults;

    /// @dev Mapping of wrapped object index to Wrapped Object
    mapping(uint256 wrappedObjectIndex => WrappedObject) internal _wrappedObjects;

    /// @dev Mapping of nftId to enumerable map of token address to wrapped object index
    mapping(uint256 nftId => EnumerableMap.AddressToUintMap) internal _nftTokens;

    /**
     * @dev mapping of owner address to mapping of spender address to boolean
     *      NOTE: If address1 approves address2 then address2 can spend the approved tokens of address1 (by calling providerWrapAssets or providerWrapAssetsOnExistingNft)
     */
    mapping(address => mapping(address => bool)) internal _isApprovedForSpendingApprovedAssets;

    constructor() {
        _disableInitializers();
    }

    function initialize(
        bytes32 dp,
        address dataIndex_,
        address vaultDO_,
        address vaultFactory_,
        string memory name_,
        string memory symbol_
    ) external initializer {
        __Ownable_init_unchained(msg.sender);
        __Wrapper_init(dp, dataIndex_, vaultDO_, vaultFactory_, name_, symbol_);
    }

    function __Wrapper_init(
        bytes32 dp,
        address dataIndex_,
        address vaultDO_,
        address vaultFactory_,
        string memory name_,
        string memory symbol_
    ) internal onlyInitializing {
        __ERC721_init_unchained(name_, symbol_);
        __Wrapper_init_unchained(dp, dataIndex_, vaultDO_, vaultFactory_);
    }

    function __Wrapper_init_unchained(bytes32 dp, address dataIndex_, address vaultDO_, address vaultFactory_) internal onlyInitializing {
        if (dp == bytes32(0) || dataIndex_ == address(0) || vaultDO_ == address(0) || vaultFactory_ == address(0)) {
            revert WrongParameters();
        }

        dataIndex = IDataIndex(dataIndex_);
        vaultDO = IDataObject(vaultDO_);
        _datapoint = DataPoint.wrap(dp);
        vaultFactory = vaultFactory_;
    }

    function _authorizeUpgrade(address newImplementation) internal override onlyOwner {
        // No extra verification needed
    }

    /// @inheritdoc IWrapper
    function approveSpenderOfApprovedAssets(address spender) external {
        mapping(address => bool) storage isApproved = _isApprovedForSpendingApprovedAssets[_msgSender()];
        if (isApproved[spender]) revert SpenderAlreadyApprovedOrUnapproved(spender);

        isApproved[spender] = true;

        emit SpenderApprovedOrUnapproved(spender, _msgSender(), true);
    }

    /// @inheritdoc IWrapper
    function removeSpenderOfApprovedAssets(address spender) external {
        mapping(address => bool) storage isApproved = _isApprovedForSpendingApprovedAssets[_msgSender()];
        if (!isApproved[spender]) revert SpenderAlreadyApprovedOrUnapproved(spender);

        isApproved[spender] = false;

        emit SpenderApprovedOrUnapproved(spender, _msgSender(), false);
    }

    /// @inheritdoc IWrapper
    function wrapAssets(
        WrappedObjectType[] calldata wtypes,
        address[] calldata tokens,
        uint256[] calldata ids,
        uint256[] calldata values
    ) external returns (uint256) {
        return
            providerWrapAssets(
                ProviderWrapAssetsInput({wtypes: wtypes, tokens: tokens, ids: ids, values: values, provider: _msgSender(), beneficiary: _msgSender()})
            );
    }

    /// @inheritdoc IWrapper
    function wrapAssetsOnExistingNft(
        uint256 nftId,
        WrappedObjectType[] calldata wtypes,
        address[] calldata tokens,
        uint256[] calldata ids,
        uint256[] calldata values
    ) external {
        providerWrapAssetsOnExistingNft(
            ProviderWrapAssetsOnExistingNftInput({nftId: nftId, wtypes: wtypes, tokens: tokens, ids: ids, values: values, provider: _msgSender()})
        );
    }

    /// @inheritdoc IWrapper
    function providerWrapAssets(ProviderWrapAssetsInput memory input) public returns (uint256) {
        address provider = input.provider;
        address beneficiary = input.beneficiary;

        if (beneficiary == address(0)) revert WrongParameters();
        if (provider != _msgSender() && !_isApprovedForSpendingApprovedAssets[provider][_msgSender()]) revert WrongSpender(_msgSender());

        uint256 nftId;
        unchecked {
            nftId = ++_nftCounter;
        }
        _mint(beneficiary, nftId);

        vaults[nftId] = address(_deployVault(vaultFactory, bytes32(nftId)));

        uint256 length = input.wtypes.length;
        if (length == 0 || length != input.tokens.length || length != input.ids.length || length != input.values.length) {
            revert InvalidArrayLength();
        }

        // TO_CHECK SHOULD WE REQUIRE EVERYTHING TO BE CORRECT?
        for (uint256 i; i < length; i++) {
            WrappedObjectType wtype = input.wtypes[i];
            address token = input.tokens[i];
            uint256 id = input.ids[i];
            uint256 value = input.values[i];

            if (wtype == WrappedObjectType.ERC20) {
                if (_nftTokens[nftId].contains(token)) revert CannotDoubleWrapSameERC20Token(token);

                _wrapERC20(nftId, IERC20(token), value, provider);

                (WrappedObject storage wrappedObject, uint256 wrappedObjectIndex) = _createWrappedObject();
                _nftTokens[nftId].set(token, wrappedObjectIndex);
                wrappedObject.wtype = WrappedObjectType.ERC20;
                wrappedObject.values[0] = value;
            } else if (wtype == WrappedObjectType.ERC721) {
                _wrapERC721(nftId, IERC721(token), id, provider);

                (bool contained, uint256 wrappedObjectExistingIndex) = _nftTokens[nftId].tryGet(token);

                if (!contained) {
                    (WrappedObject storage wrappedObject, uint256 wrappedObjectIndex) = _createWrappedObject();
                    _nftTokens[nftId].set(token, wrappedObjectIndex);
                    wrappedObject.wtype = WrappedObjectType.ERC721;
                    wrappedObject.ids.add(id);
                } else {
                    WrappedObject storage wrappedObject = _wrappedObjects[wrappedObjectExistingIndex];
                    wrappedObject.ids.add(id);
                }
            } else {
                _wrapERC1155(nftId, IERC1155(token), id, value, provider);

                (bool contained, uint256 wrappedObjectExistingIndex) = _nftTokens[nftId].tryGet(token);

                if (!contained) {
                    (WrappedObject storage wrappedObject, uint256 wrappedObjectIndex) = _createWrappedObject();
                    _nftTokens[nftId].set(token, wrappedObjectIndex);
                    wrappedObject.wtype = WrappedObjectType.ERC1155;
                    wrappedObject.ids.add(id);
                    wrappedObject.values[id] = value;
                } else {
                    WrappedObject storage wrappedObject = _wrappedObjects[wrappedObjectExistingIndex];
                    if (wrappedObject.values[id] != 0) revert CannotDoubleWrapSameERC1155TokenId(token, id);

                    wrappedObject.ids.add(id);
                    wrappedObject.values[id] = value;
                }
            }

            emit ObjectWrapped(nftId, provider, beneficiary, token, id, value);
        }

        return nftId;
    }

    /// @inheritdoc IWrapper
    function providerWrapAssetsOnExistingNft(ProviderWrapAssetsOnExistingNftInput memory input) public {
        uint256 nftId = input.nftId;
        if (_msgSender() != _ownerOf(nftId)) revert OnlyNFTOwnerCanUnwrapOrExecute();

        address provider = input.provider;
        if (provider != _msgSender() && !_isApprovedForSpendingApprovedAssets[provider][_msgSender()]) revert WrongSpender(_msgSender());

        uint256 length = input.wtypes.length;
        if (length == 0 || length != input.tokens.length || length != input.ids.length || length != input.values.length) {
            revert InvalidArrayLength();
        }

        for (uint256 i; i < length; i++) {
            address token = input.tokens[i];
            uint256 id = input.ids[i];
            uint256 value = input.values[i];

            (bool contained, uint256 wrappedObjectIndex) = _nftTokens[nftId].tryGet(token);

            if (!contained) {
                (WrappedObject storage wrappedObject, uint256 newWrappedObjectIndex) = _createWrappedObject();
                _nftTokens[nftId].set(token, newWrappedObjectIndex);

                if (input.wtypes[i] == WrappedObjectType.ERC20) {
                    _wrapERC20(nftId, IERC20(token), value, provider);

                    wrappedObject.wtype = WrappedObjectType.ERC20;
                    wrappedObject.values[0] = value;
                } else if (input.wtypes[i] == WrappedObjectType.ERC721) {
                    _wrapERC721(nftId, IERC721(token), id, provider);

                    wrappedObject.wtype = WrappedObjectType.ERC721;
                    wrappedObject.ids.add(id);
                } else {
                    _wrapERC1155(nftId, IERC1155(token), id, value, provider);

                    wrappedObject.wtype = WrappedObjectType.ERC1155;
                    wrappedObject.ids.add(id);
                    wrappedObject.values[id] = value;
                }
            } else {
                WrappedObject storage wrappedObject = _wrappedObjects[wrappedObjectIndex];

                if (wrappedObject.wtype == WrappedObjectType.ERC20) {
                    _wrapERC20(nftId, IERC20(token), value, provider);

                    wrappedObject.values[0] += value;
                } else if (wrappedObject.wtype == WrappedObjectType.ERC721) {
                    _wrapERC721(nftId, IERC721(token), id, provider);

                    wrappedObject.ids.add(id);
                } else {
                    _wrapERC1155(nftId, IERC1155(token), id, value, provider);

                    if (wrappedObject.values[id] == 0) {
                        wrappedObject.ids.add(id);
                    }
                    wrappedObject.values[id] += value;
                }
            }

            emit ObjectWrapped(nftId, provider, address(0), token, id, value);
        }
    }

    /// @inheritdoc IWrapper
    function partiallyUnwrapAssets(uint256 nftId, address[] calldata tokens, uint256[] calldata ids, uint256[] calldata values) external {
        beneficiaryPartiallyUnwrapAssets(
            BeneficiaryPartiallyUnwrapAssetsInput({nftId: nftId, tokens: tokens, ids: ids, values: values, beneficiary: _msgSender()})
        );
    }

    /// @inheritdoc IWrapper
    function fullyUnwrapAssets(uint256 nftId) external {
        beneficiaryFullyUnwrapAssets(nftId, _msgSender());
    }

    /// @inheritdoc IWrapper
    function percentageBeneficiaryPartiallyUnwrapAssets(uint256 nftId, uint256 percentage, bool skipNonPercentageWtypes, address beneficiary) external {
        EnumerableMap.AddressToUintMap storage nftTokens = _nftTokens[nftId];
        address[] memory tokens = nftTokens.keys();

        uint256 length = tokens.length;
        if (length == 0) revert InvalidArrayLength();

        BeneficiaryPartiallyUnwrapAssetsInput memory assetsInput = BeneficiaryPartiallyUnwrapAssetsInput({
            nftId: nftId,
            tokens: new address[](length),
            ids: new uint256[](length),
            values: new uint256[](length),
            beneficiary: beneficiary
        });

        uint256 counterOfValidTokens;
        bool invalidTokensExist;

        for (uint256 i; i < length; i++) {
            address token = tokens[i];
            uint256 wrappedObjectIndex = nftTokens.get(token);

            WrappedObject storage wrappedObject = _wrappedObjects[wrappedObjectIndex];

            if (_checkIfSupportedPercentageType(wrappedObject.wtype)) {
                assetsInput.tokens[counterOfValidTokens] = token;
                // @notice If semi-fungible assets are supported in this operation IDS should be added
                assetsInput.values[counterOfValidTokens] = (wrappedObject.values[0] * percentage) / 1 ether;
                unchecked {
                    counterOfValidTokens++;
                }
            } else if (!skipNonPercentageWtypes) {
                revert PercentageUnwrapNotSupported();
            } else {
                invalidTokensExist = true;
            }
        }

        // Avoiding stack too deep
        {
            address[] memory tokensToUse = assetsInput.tokens;
            uint256[] memory idsToUse = assetsInput.ids;
            uint256[] memory valuesToUse = assetsInput.values;

            // Making the length of arrays the correct one if skipNonPercentageWtypes is supported (if invalidTokensExist)
            if (invalidTokensExist) {
                assembly {
                    mstore(tokensToUse, counterOfValidTokens)
                }
                assembly {
                    mstore(idsToUse, counterOfValidTokens)
                }
                assembly {
                    mstore(valuesToUse, counterOfValidTokens)
                }
            }

            assetsInput.tokens = tokensToUse;
            assetsInput.ids = idsToUse;
            assetsInput.values = valuesToUse;
        }

        beneficiaryPartiallyUnwrapAssets(assetsInput);
    }

    /// @inheritdoc IWrapper
    function beneficiaryPartiallyUnwrapAssets(BeneficiaryPartiallyUnwrapAssetsInput memory input) public {
        uint256 nftId = input.nftId;
        if (_msgSender() != _ownerOf(nftId)) revert OnlyNFTOwnerCanUnwrapOrExecute();

        address beneficiary = input.beneficiary;
        if (beneficiary == address(0)) revert WrongParameters();

        uint256 length = input.tokens.length;
        if (length == 0 || length != input.ids.length || length != input.values.length) {
            revert InvalidArrayLength();
        }

        for (uint256 i; i < length; i++) {
            address token = input.tokens[i];

            (bool contained, uint256 wrappedObjectExistingIndex) = _nftTokens[nftId].tryGet(token);
            if (!contained) revert WrongAssetToUnwrapOrExecute();

            WrappedObject storage wrappedObject = _wrappedObjects[wrappedObjectExistingIndex];

            if (wrappedObject.wtype == WrappedObjectType.ERC20) {
                uint256 value = input.values[i];
                if (value > wrappedObject.values[0]) revert WrongValueToUnwrap();

                unchecked {
                    wrappedObject.values[0] -= value;
                }

                if (wrappedObject.values[0] == 0) {
                    _nftTokens[nftId].remove(token);
                }

                _unwrapERC20(nftId, token, beneficiary, value);
            } else if (wrappedObject.wtype == WrappedObjectType.ERC721) {
                uint256 id = input.ids[i];

                // Remove id from the wrapped object
                bool idRemoved = wrappedObject.ids.remove(id);
                if (!idRemoved) revert NonexistentId();

                // Remove token from the nftTokens mapping if the wrapped object is empty
                if (wrappedObject.ids.length() == 0) {
                    _nftTokens[nftId].remove(token);
                }

                _unwrapERC721(nftId, token, beneficiary, id);
            } else {
                uint256 id = input.ids[i];
                uint256 value = input.values[i];
                if (value > wrappedObject.values[id]) revert WrongValueToUnwrap();

                unchecked {
                    wrappedObject.values[id] -= value;
                }

                if (wrappedObject.values[id] == 0) {
                    bool idRemoved = wrappedObject.ids.remove(id);
                    if (!idRemoved) revert NonexistentId();
                }

                // Remove token from the nftTokens mapping if the wrapped object is empty
                if (wrappedObject.ids.length() == 0) {
                    _nftTokens[nftId].remove(token);
                }

                _unwrapERC1155(nftId, token, beneficiary, id, value);
            }

            // We can't delete the wrapped object and loop through all items would be expensive, so we'll just ignore it
            // delete _wrappedObjects[wrappedObjectExistingIndex];

            emit ObjectUnwrapped(nftId, beneficiary, token, input.ids[i], input.values[i]);
        }
    }

    /// @inheritdoc IWrapper
    function beneficiaryFullyUnwrapAssets(uint256 nftId, address beneficiary) public {
        if (_msgSender() != _ownerOf(nftId)) revert OnlyNFTOwnerCanUnwrapOrExecute();

        if (beneficiary == address(0)) revert WrongParameters();

        address[] memory tokens = _nftTokens[nftId].keys();

        uint256 length = tokens.length;
        if (length == 0) revert InvalidArrayLength();

        for (uint256 i; i < length; i++) {
            address token = tokens[i];
            uint256 wrappedObjectIndex = _nftTokens[nftId].get(token);

            WrappedObject storage wrappedObject = _wrappedObjects[wrappedObjectIndex];

            if (wrappedObject.wtype == WrappedObjectType.ERC20) {
                uint256 value = wrappedObject.values[0];
                _nftTokens[nftId].remove(token);

                _unwrapERC20(nftId, token, beneficiary, value);
            } else if (wrappedObject.wtype == WrappedObjectType.ERC721) {
                _nftTokens[nftId].remove(token);

                uint256[] memory ids = wrappedObject.ids.values();

                uint256 idsLength = ids.length;
                for (uint256 idsIndex; idsIndex < idsLength; idsIndex++) {
                    uint256 id = ids[idsIndex];

                    _unwrapERC721(nftId, token, beneficiary, id);
                }
            } else {
                _nftTokens[nftId].remove(token);

                uint256[] memory ids = wrappedObject.ids.values();
                uint256 idsLength = ids.length;
                uint256[] memory values = new uint256[](idsLength);

                for (uint256 idsIndex; idsIndex < idsLength; idsIndex++) {
                    values[idsIndex] = wrappedObject.values[ids[idsIndex]];
                }

                _unwrapERC1155Batch(nftId, token, beneficiary, ids, values);
            }

            // We can't delete the wrapped object and loop through all items would be expensive, so we'll just ignore it
            // delete _wrappedObjects[wrappedObjectIndex];

            emit ObjectUnwrapped(nftId, beneficiary, token, 0, 0);
        }

        // We can't delete the vaults and loop through all items would be expensive, so we'll just ignore it
        // delete _nftTokens[nftId];
        _burn(nftId);
    }

    /// @inheritdoc IWrapper
    function execute(uint256 nftId, address token, bytes calldata input) external payable {
        if (_msgSender() != _ownerOf(nftId)) revert OnlyNFTOwnerCanUnwrapOrExecute();
        if (!_nftTokens[nftId].contains(token)) revert WrongAssetToUnwrapOrExecute();

        dataIndex.write(vaultDO, _datapoint, IVaultOperations.vaultExecute.selector, abi.encode(vaults[nftId], token, input, msg.value));

        emit Executed(nftId, token, input);
    }

    /**
     * @notice Wrap ERC20 tokens.
     * @param token Token to wrap.
     * @param value Amount of token to wrap.
     * @param beneficiary The address to acquire the tokens from.
     */
    function _wrapERC20(uint256 nftId, IERC20 token, uint256 value, address beneficiary) internal {
        token.safeTransferFrom(beneficiary, address(vaults[nftId]), value);
    }

    function _wrapERC721(uint256 nftId, IERC721 token, uint256 id, address beneficiary) internal {
        token.safeTransferFrom(beneficiary, address(vaults[nftId]), id);
    }

    function _wrapERC1155(uint256 nftId, IERC1155 token, uint256 id, uint256 value, address beneficiary) internal {
        token.safeTransferFrom(beneficiary, address(vaults[nftId]), id, value, "");
    }

    /**
     * @dev Unwrap previously wrapped ERC20 tokens
     */
    function _unwrapERC20(uint256 nftId, address token, address beneficiary, uint256 value) internal {
        _vaultTransferERC20(nftId, token, beneficiary, value);
    }

    function _unwrapERC721(uint256 nftId, address token, address beneficiary, uint256 id) internal {
        _vaultTransferERC721(nftId, token, beneficiary, id);
    }

    function _unwrapERC1155(uint256 nftId, address token, address beneficiary, uint256 id, uint256 value) internal {
        _vaultTransferERC1155(nftId, token, beneficiary, id, value);
    }

    function _unwrapERC1155Batch(uint256 nftId, address token, address beneficiary, uint256[] memory ids, uint256[] memory values) internal {
        _vaultBatchTransferERC1155(nftId, token, beneficiary, ids, values);
    }

    function _deployVault(address _vaultFactory, bytes32 salt) internal returns (IVault) {
        IVault vault_ = IVault(
            abi.decode(dataIndex.write(vaultDO, _datapoint, IVaultOperations.deployDeterministicVault.selector, abi.encode(_vaultFactory, salt, "")), (address))
        );
        return vault_;
    }

    function _vaultTransferERC20(uint256 nftId, address token, address to, uint256 value) internal {
        dataIndex.write(
            vaultDO,
            _datapoint,
            IVaultOperations.vaultExecute.selector,
            abi.encode(address(vaults[nftId]), token, abi.encodeWithSelector(IERC20.transfer.selector, to, value), 0)
        );
    }

    function _vaultTransferERC721(uint256 nftId, address token, address to, uint256 id) internal {
        bytes4 selector = bytes4(keccak256("safeTransferFrom(address,address,uint256)")); //IERC721.safeTransferFrom.selector can not be used because function is overloaded
        address vault = vaults[nftId];

        dataIndex.write(
            vaultDO,
            _datapoint,
            IVaultOperations.vaultExecute.selector,
            abi.encode(vault, token, abi.encodeWithSelector(selector, vault, to, id), 0)
        );
    }

    function _vaultTransferERC1155(uint256 nftId, address token, address to, uint256 id, uint256 value) internal {
        address vault = vaults[nftId];

        dataIndex.write(
            vaultDO,
            _datapoint,
            IVaultOperations.vaultExecute.selector,
            abi.encode(vault, token, abi.encodeWithSelector(IERC1155.safeTransferFrom.selector, vault, to, id, value, ""), 0)
        );
    }

    function _vaultBatchTransferERC1155(uint256 nftId, address token, address to, uint256[] memory ids, uint256[] memory values) internal {
        address vault = vaults[nftId];

        dataIndex.write(
            vaultDO,
            _datapoint,
            IVaultOperations.vaultExecute.selector,
            abi.encode(vault, token, abi.encodeWithSelector(IERC1155.safeBatchTransferFrom.selector, vault, to, ids, values, ""), 0)
        );
    }

    function _checkIfSupportedPercentageType(WrappedObjectType wrappedObjectType) internal pure returns (bool) {
        return (wrappedObjectType == WrappedObjectType.ERC20);
    }

    function _createWrappedObject() internal returns (WrappedObject storage wrappedObject, uint256 wrappedObjectIndex) {
        unchecked {
            wrappedObjectIndex = ++_wrappedObjectsCounter;
        }
        wrappedObject = _wrappedObjects[_wrappedObjectsCounter];
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.22;

import {IERC1822Proxiable} from "@openzeppelin/contracts/interfaces/draft-IERC1822.sol";
import {ERC1967Utils} from "@openzeppelin/contracts/proxy/ERC1967/ERC1967Utils.sol";
import {Initializable} from "./Initializable.sol";

/**
 * @dev An upgradeability mechanism designed for UUPS proxies. The functions included here can perform an upgrade of an
 * {ERC1967Proxy}, when this contract is set as the implementation behind such a proxy.
 *
 * A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is
 * reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing
 * `UUPSUpgradeable` with a custom implementation of upgrades.
 *
 * The {_authorizeUpgrade} function must be overridden to include access restriction to the upgrade mechanism.
 */
abstract contract UUPSUpgradeable is Initializable, IERC1822Proxiable {
    /// @custom:oz-upgrades-unsafe-allow state-variable-immutable
    address private immutable __self = address(this);

    /**
     * @dev The version of the upgrade interface of the contract. If this getter is missing, both `upgradeTo(address)`
     * and `upgradeToAndCall(address,bytes)` are present, and `upgradeTo` must be used if no function should be called,
     * while `upgradeToAndCall` will invoke the `receive` function if the second argument is the empty byte string.
     * If the getter returns `"5.0.0"`, only `upgradeToAndCall(address,bytes)` is present, and the second argument must
     * be the empty byte string if no function should be called, making it impossible to invoke the `receive` function
     * during an upgrade.
     */
    string public constant UPGRADE_INTERFACE_VERSION = "5.0.0";

    /**
     * @dev The call is from an unauthorized context.
     */
    error UUPSUnauthorizedCallContext();

    /**
     * @dev The storage `slot` is unsupported as a UUID.
     */
    error UUPSUnsupportedProxiableUUID(bytes32 slot);

    /**
     * @dev Check that the execution is being performed through a delegatecall call and that the execution context is
     * a proxy contract with an implementation (as defined in ERC-1967) pointing to self. This should only be the case
     * for UUPS and transparent proxies that are using the current contract as their implementation. Execution of a
     * function through ERC-1167 minimal proxies (clones) would not normally pass this test, but is not guaranteed to
     * fail.
     */
    modifier onlyProxy() {
        _checkProxy();
        _;
    }

    /**
     * @dev Check that the execution is not being performed through a delegate call. This allows a function to be
     * callable on the implementing contract but not through proxies.
     */
    modifier notDelegated() {
        _checkNotDelegated();
        _;
    }

    function __UUPSUpgradeable_init() internal onlyInitializing {
    }

    function __UUPSUpgradeable_init_unchained() internal onlyInitializing {
    }
    /**
     * @dev Implementation of the ERC-1822 {proxiableUUID} function. This returns the storage slot used by the
     * implementation. It is used to validate the implementation's compatibility when performing an upgrade.
     *
     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks
     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this
     * function revert if invoked through a proxy. This is guaranteed by the `notDelegated` modifier.
     */
    function proxiableUUID() external view virtual notDelegated returns (bytes32) {
        return ERC1967Utils.IMPLEMENTATION_SLOT;
    }

    /**
     * @dev Upgrade the implementation of the proxy to `newImplementation`, and subsequently execute the function call
     * encoded in `data`.
     *
     * Calls {_authorizeUpgrade}.
     *
     * Emits an {Upgraded} event.
     *
     * @custom:oz-upgrades-unsafe-allow-reachable delegatecall
     */
    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual onlyProxy {
        _authorizeUpgrade(newImplementation);
        _upgradeToAndCallUUPS(newImplementation, data);
    }

    /**
     * @dev Reverts if the execution is not performed via delegatecall or the execution
     * context is not of a proxy with an ERC-1967 compliant implementation pointing to self.
     * See {_onlyProxy}.
     */
    function _checkProxy() internal view virtual {
        if (
            address(this) == __self || // Must be called through delegatecall
            ERC1967Utils.getImplementation() != __self // Must be called through an active proxy
        ) {
            revert UUPSUnauthorizedCallContext();
        }
    }

    /**
     * @dev Reverts if the execution is performed via delegatecall.
     * See {notDelegated}.
     */
    function _checkNotDelegated() internal view virtual {
        if (address(this) != __self) {
            // Must not be called through delegatecall
            revert UUPSUnauthorizedCallContext();
        }
    }

    /**
     * @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract. Called by
     * {upgradeToAndCall}.
     *
     * Normally, this function will use an xref:access.adoc[access control] modifier such as {Ownable-onlyOwner}.
     *
     * ```solidity
     * function _authorizeUpgrade(address) internal onlyOwner {}
     * ```
     */
    function _authorizeUpgrade(address newImplementation) internal virtual;

    /**
     * @dev Performs an implementation upgrade with a security check for UUPS proxies, and additional setup call.
     *
     * As a security check, {proxiableUUID} is invoked in the new implementation, and the return value
     * is expected to be the implementation slot in ERC-1967.
     *
     * Emits an {IERC1967-Upgraded} event.
     */
    function _upgradeToAndCallUUPS(address newImplementation, bytes memory data) private {
        try IERC1822Proxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {
            if (slot != ERC1967Utils.IMPLEMENTATION_SLOT) {
                revert UUPSUnsupportedProxiableUUID(slot);
            }
            ERC1967Utils.upgradeToAndCall(newImplementation, data);
        } catch {
            // The implementation is not UUPS
            revert ERC1967Utils.ERC1967InvalidImplementation(newImplementation);
        }
    }
}

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

pragma solidity ^0.8.20;

import {IERC721} from "@openzeppelin/contracts/token/ERC721/IERC721.sol";
import {IERC721Metadata} from "@openzeppelin/contracts/token/ERC721/extensions/IERC721Metadata.sol";
import {ERC721Utils} from "@openzeppelin/contracts/token/ERC721/utils/ERC721Utils.sol";
import {ContextUpgradeable} from "../../utils/ContextUpgradeable.sol";
import {Strings} from "@openzeppelin/contracts/utils/Strings.sol";
import {IERC165} from "@openzeppelin/contracts/utils/introspection/IERC165.sol";
import {ERC165Upgradeable} from "../../utils/introspection/ERC165Upgradeable.sol";
import {IERC721Errors} from "@openzeppelin/contracts/interfaces/draft-IERC6093.sol";
import {Initializable} from "../../proxy/utils/Initializable.sol";

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

    /// @custom:storage-location erc7201:openzeppelin.storage.ERC721
    struct ERC721Storage {
        // Token name
        string _name;

        // Token symbol
        string _symbol;

        mapping(uint256 tokenId => address) _owners;

        mapping(address owner => uint256) _balances;

        mapping(uint256 tokenId => address) _tokenApprovals;

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

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ERC721")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant ERC721StorageLocation = 0x80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab0079300;

    function _getERC721Storage() private pure returns (ERC721Storage storage $) {
        assembly {
            $.slot := ERC721StorageLocation
        }
    }

    /**
     * @dev Initializes the contract by setting a `name` and a `symbol` to the token collection.
     */
    function __ERC721_init(string memory name_, string memory symbol_) internal onlyInitializing {
        __ERC721_init_unchained(name_, symbol_);
    }

    function __ERC721_init_unchained(string memory name_, string memory symbol_) internal onlyInitializing {
        ERC721Storage storage $ = _getERC721Storage();
        $._name = name_;
        $._symbol = symbol_;
    }

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

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

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

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

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

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

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

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

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

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

        return _getApproved(tokenId);
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        $._owners[tokenId] = to;

        emit Transfer(from, to, tokenId);

        return from;
    }

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

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

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

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

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

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

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

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

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

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

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

        $._tokenApprovals[tokenId] = to;
    }

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

import {IERC165} from "@openzeppelin/contracts/utils/introspection/IERC165.sol";
import {Initializable} from "../../proxy/utils/Initializable.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 ERC165Upgradeable is Initializable, IERC165 {
    function __ERC165_init() internal onlyInitializing {
    }

    function __ERC165_init_unchained() internal onlyInitializing {
    }
    /**
     * @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) (interfaces/draft-IERC1822.sol)

pragma solidity ^0.8.20;

/**
 * @dev ERC-1822: Universal Upgradeable Proxy Standard (UUPS) documents a method for upgradeability through a simplified
 * proxy whose upgrades are fully controlled by the current implementation.
 */
interface IERC1822Proxiable {
    /**
     * @dev Returns the storage slot that the proxiable contract assumes is being used to store the implementation
     * address.
     *
     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks
     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this
     * function revert if invoked through a proxy.
     */
    function proxiableUUID() external view returns (bytes32);
}

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

pragma solidity ^0.8.20;

/**
 * @dev ERC-1967: Proxy Storage Slots. This interface contains the events defined in the ERC.
 */
interface IERC1967 {
    /**
     * @dev Emitted when the implementation is upgraded.
     */
    event Upgraded(address indexed implementation);

    /**
     * @dev Emitted when the admin account has changed.
     */
    event AdminChanged(address previousAdmin, address newAdmin);

    /**
     * @dev Emitted when the beacon is changed.
     */
    event BeaconUpgraded(address indexed beacon);
}

// 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.0.0) (proxy/beacon/IBeacon.sol)

pragma solidity ^0.8.20;

/**
 * @dev This is the interface that {BeaconProxy} expects of its beacon.
 */
interface IBeacon {
    /**
     * @dev Must return an address that can be used as a delegate call target.
     *
     * {UpgradeableBeacon} will check that this address is a contract.
     */
    function implementation() external view returns (address);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.2.0) (proxy/ERC1967/ERC1967Utils.sol)

pragma solidity ^0.8.22;

import {IBeacon} from "../beacon/IBeacon.sol";
import {IERC1967} from "../../interfaces/IERC1967.sol";
import {Address} from "../../utils/Address.sol";
import {StorageSlot} from "../../utils/StorageSlot.sol";

/**
 * @dev This library provides getters and event emitting update functions for
 * https://eips.ethereum.org/EIPS/eip-1967[ERC-1967] slots.
 */
library ERC1967Utils {
    /**
     * @dev Storage slot with the address of the current implementation.
     * This is the keccak-256 hash of "eip1967.proxy.implementation" subtracted by 1.
     */
    // solhint-disable-next-line private-vars-leading-underscore
    bytes32 internal constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;

    /**
     * @dev The `implementation` of the proxy is invalid.
     */
    error ERC1967InvalidImplementation(address implementation);

    /**
     * @dev The `admin` of the proxy is invalid.
     */
    error ERC1967InvalidAdmin(address admin);

    /**
     * @dev The `beacon` of the proxy is invalid.
     */
    error ERC1967InvalidBeacon(address beacon);

    /**
     * @dev An upgrade function sees `msg.value > 0` that may be lost.
     */
    error ERC1967NonPayable();

    /**
     * @dev Returns the current implementation address.
     */
    function getImplementation() internal view returns (address) {
        return StorageSlot.getAddressSlot(IMPLEMENTATION_SLOT).value;
    }

    /**
     * @dev Stores a new address in the ERC-1967 implementation slot.
     */
    function _setImplementation(address newImplementation) private {
        if (newImplementation.code.length == 0) {
            revert ERC1967InvalidImplementation(newImplementation);
        }
        StorageSlot.getAddressSlot(IMPLEMENTATION_SLOT).value = newImplementation;
    }

    /**
     * @dev Performs implementation upgrade with additional setup call if data is nonempty.
     * This function is payable only if the setup call is performed, otherwise `msg.value` is rejected
     * to avoid stuck value in the contract.
     *
     * Emits an {IERC1967-Upgraded} event.
     */
    function upgradeToAndCall(address newImplementation, bytes memory data) internal {
        _setImplementation(newImplementation);
        emit IERC1967.Upgraded(newImplementation);

        if (data.length > 0) {
            Address.functionDelegateCall(newImplementation, data);
        } else {
            _checkNonPayable();
        }
    }

    /**
     * @dev Storage slot with the admin of the contract.
     * This is the keccak-256 hash of "eip1967.proxy.admin" subtracted by 1.
     */
    // solhint-disable-next-line private-vars-leading-underscore
    bytes32 internal constant ADMIN_SLOT = 0xb53127684a568b3173ae13b9f8a6016e243e63b6e8ee1178d6a717850b5d6103;

    /**
     * @dev Returns the current admin.
     *
     * TIP: To get this value clients can read directly from the storage slot shown below (specified by ERC-1967) using
     * the https://eth.wiki/json-rpc/API#eth_getstorageat[`eth_getStorageAt`] RPC call.
     * `0xb53127684a568b3173ae13b9f8a6016e243e63b6e8ee1178d6a717850b5d6103`
     */
    function getAdmin() internal view returns (address) {
        return StorageSlot.getAddressSlot(ADMIN_SLOT).value;
    }

    /**
     * @dev Stores a new address in the ERC-1967 admin slot.
     */
    function _setAdmin(address newAdmin) private {
        if (newAdmin == address(0)) {
            revert ERC1967InvalidAdmin(address(0));
        }
        StorageSlot.getAddressSlot(ADMIN_SLOT).value = newAdmin;
    }

    /**
     * @dev Changes the admin of the proxy.
     *
     * Emits an {IERC1967-AdminChanged} event.
     */
    function changeAdmin(address newAdmin) internal {
        emit IERC1967.AdminChanged(getAdmin(), newAdmin);
        _setAdmin(newAdmin);
    }

    /**
     * @dev The storage slot of the UpgradeableBeacon contract which defines the implementation for this proxy.
     * This is the keccak-256 hash of "eip1967.proxy.beacon" subtracted by 1.
     */
    // solhint-disable-next-line private-vars-leading-underscore
    bytes32 internal constant BEACON_SLOT = 0xa3f0ad74e5423aebfd80d3ef4346578335a9a72aeaee59ff6cb3582b35133d50;

    /**
     * @dev Returns the current beacon.
     */
    function getBeacon() internal view returns (address) {
        return StorageSlot.getAddressSlot(BEACON_SLOT).value;
    }

    /**
     * @dev Stores a new beacon in the ERC-1967 beacon slot.
     */
    function _setBeacon(address newBeacon) private {
        if (newBeacon.code.length == 0) {
            revert ERC1967InvalidBeacon(newBeacon);
        }

        StorageSlot.getAddressSlot(BEACON_SLOT).value = newBeacon;

        address beaconImplementation = IBeacon(newBeacon).implementation();
        if (beaconImplementation.code.length == 0) {
            revert ERC1967InvalidImplementation(beaconImplementation);
        }
    }

    /**
     * @dev Change the beacon and trigger a setup call if data is nonempty.
     * This function is payable only if the setup call is performed, otherwise `msg.value` is rejected
     * to avoid stuck value in the contract.
     *
     * Emits an {IERC1967-BeaconUpgraded} event.
     *
     * CAUTION: Invoking this function has no effect on an instance of {BeaconProxy} since v5, since
     * it uses an immutable beacon without looking at the value of the ERC-1967 beacon slot for
     * efficiency.
     */
    function upgradeBeaconToAndCall(address newBeacon, bytes memory data) internal {
        _setBeacon(newBeacon);
        emit IERC1967.BeaconUpgraded(newBeacon);

        if (data.length > 0) {
            Address.functionDelegateCall(IBeacon(newBeacon).implementation(), data);
        } else {
            _checkNonPayable();
        }
    }

    /**
     * @dev Reverts if `msg.value` is not zero. It can be used to avoid `msg.value` stuck in the contract
     * if an upgrade doesn't perform an initialization call.
     */
    function _checkNonPayable() private {
        if (msg.value > 0) {
            revert ERC1967NonPayable();
        }
    }
}

// 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/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.0.0) (token/ERC721/extensions/IERC721Metadata.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

pragma solidity ^0.8.20;

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

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

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

pragma solidity ^0.8.20;

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

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev There's no code at `target` (it is not a contract).
     */
    error AddressEmptyCode(address target);

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.8.20/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        if (address(this).balance < amount) {
            revert Errors.InsufficientBalance(address(this).balance, amount);
        }

        (bool success, bytes memory returndata) = recipient.call{value: amount}("");
        if (!success) {
            _revert(returndata);
        }
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason or custom error, it is bubbled
     * up by this function (like regular Solidity function calls). However, if
     * the call reverted with no returned reason, this function reverts with a
     * {Errors.FailedCall} error.
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        if (address(this).balance < value) {
            revert Errors.InsufficientBalance(address(this).balance, value);
        }
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and reverts if the target
     * was not a contract or bubbling up the revert reason (falling back to {Errors.FailedCall}) in case
     * of an unsuccessful call.
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata
    ) internal view returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            // only check if target is a contract if the call was successful and the return data is empty
            // otherwise we already know that it was a contract
            if (returndata.length == 0 && target.code.length == 0) {
                revert AddressEmptyCode(target);
            }
            return returndata;
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and reverts if it wasn't, either by bubbling the
     * revert reason or with a default {Errors.FailedCall} error.
     */
    function verifyCallResult(bool success, bytes memory returndata) internal pure returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            return returndata;
        }
    }

    /**
     * @dev Reverts with returndata if present. Otherwise reverts with {Errors.FailedCall}.
     */
    function _revert(bytes memory returndata) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            assembly ("memory-safe") {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert Errors.FailedCall();
        }
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Collection of common custom errors used in multiple contracts
 *
 * IMPORTANT: Backwards compatibility is not guaranteed in future versions of the library.
 * It is recommended to avoid relying on the error API for critical functionality.
 *
 * _Available since v5.1._
 */
library Errors {
    /**
     * @dev The ETH balance of the account is not enough to perform the operation.
     */
    error InsufficientBalance(uint256 balance, uint256 needed);

    /**
     * @dev A call to an address target failed. The target may have reverted.
     */
    error FailedCall();

    /**
     * @dev The deployment failed.
     */
    error FailedDeployment();

    /**
     * @dev A necessary precompile is missing.
     */
    error MissingPrecompile(address);
}

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

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

pragma solidity ^0.8.20;

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

/**
 * @dev Library for managing an enumerable variant of Solidity's
 * https://solidity.readthedocs.io/en/latest/types.html#mapping-types[`mapping`]
 * type.
 *
 * Maps have the following properties:
 *
 * - Entries are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Entries are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableMap for EnumerableMap.UintToAddressMap;
 *
 *     // Declare a set state variable
 *     EnumerableMap.UintToAddressMap private myMap;
 * }
 * ```
 *
 * The following map types are supported:
 *
 * - `uint256 -> address` (`UintToAddressMap`) since v3.0.0
 * - `address -> uint256` (`AddressToUintMap`) since v4.6.0
 * - `bytes32 -> bytes32` (`Bytes32ToBytes32Map`) since v4.6.0
 * - `uint256 -> uint256` (`UintToUintMap`) since v4.7.0
 * - `bytes32 -> uint256` (`Bytes32ToUintMap`) since v4.7.0
 * - `uint256 -> bytes32` (`UintToBytes32Map`) since v5.1.0
 * - `address -> address` (`AddressToAddressMap`) since v5.1.0
 * - `address -> bytes32` (`AddressToBytes32Map`) since v5.1.0
 * - `bytes32 -> address` (`Bytes32ToAddressMap`) since v5.1.0
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableMap, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableMap.
 * ====
 */
library EnumerableMap {
    using EnumerableSet for EnumerableSet.Bytes32Set;

    // To implement this library for multiple types with as little code repetition as possible, we write it in
    // terms of a generic Map type with bytes32 keys and values. The Map implementation uses private functions,
    // and user-facing implementations such as `UintToAddressMap` are just wrappers around the underlying Map.
    // This means that we can only create new EnumerableMaps for types that fit in bytes32.

    /**
     * @dev Query for a nonexistent map key.
     */
    error EnumerableMapNonexistentKey(bytes32 key);

    struct Bytes32ToBytes32Map {
        // Storage of keys
        EnumerableSet.Bytes32Set _keys;
        mapping(bytes32 key => bytes32) _values;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToBytes32Map storage map, bytes32 key, bytes32 value) internal returns (bool) {
        map._values[key] = value;
        return map._keys.add(key);
    }

    /**
     * @dev Removes a key-value pair from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(Bytes32ToBytes32Map storage map, bytes32 key) internal returns (bool) {
        delete map._values[key];
        return map._keys.remove(key);
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool) {
        return map._keys.contains(key);
    }

    /**
     * @dev Returns the number of key-value pairs in the map. O(1).
     */
    function length(Bytes32ToBytes32Map storage map) internal view returns (uint256) {
        return map._keys.length();
    }

    /**
     * @dev Returns the key-value pair stored at position `index` in the map. O(1).
     *
     * Note that there are no guarantees on the ordering of entries inside the
     * array, and it may change when more entries are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32ToBytes32Map storage map, uint256 index) internal view returns (bytes32 key, bytes32 value) {
        bytes32 atKey = map._keys.at(index);
        return (atKey, map._values[atKey]);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bool exists, bytes32 value) {
        bytes32 val = map._values[key];
        if (val == bytes32(0)) {
            return (contains(map, key), bytes32(0));
        } else {
            return (true, val);
        }
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToBytes32Map storage map, bytes32 key) internal view returns (bytes32) {
        bytes32 value = map._values[key];
        if (value == 0 && !contains(map, key)) {
            revert EnumerableMapNonexistentKey(key);
        }
        return value;
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToBytes32Map storage map) internal view returns (bytes32[] memory) {
        return map._keys.values();
    }

    // UintToUintMap

    struct UintToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToUintMap storage map, uint256 key, uint256 value) internal returns (bool) {
        return set(map._inner, bytes32(key), bytes32(value));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(UintToUintMap storage map, uint256 key) internal returns (bool) {
        return remove(map._inner, bytes32(key));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(UintToUintMap storage map, uint256 key) internal view returns (bool) {
        return contains(map._inner, bytes32(key));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintToUintMap storage map, uint256 index) internal view returns (uint256 key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToUintMap storage map, uint256 key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToUintMap storage map, uint256 key) internal view returns (uint256) {
        return uint256(get(map._inner, bytes32(key)));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToUintMap storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintToAddressMap

    struct UintToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToAddressMap storage map, uint256 key, address value) internal returns (bool) {
        return set(map._inner, bytes32(key), bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(UintToAddressMap storage map, uint256 key) internal returns (bool) {
        return remove(map._inner, bytes32(key));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(UintToAddressMap storage map, uint256 key) internal view returns (bool) {
        return contains(map._inner, bytes32(key));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintToAddressMap storage map, uint256 index) internal view returns (uint256 key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToAddressMap storage map, uint256 key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToAddressMap storage map, uint256 key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, bytes32(key)))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToAddressMap storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintToBytes32Map

    struct UintToBytes32Map {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(UintToBytes32Map storage map, uint256 key, bytes32 value) internal returns (bool) {
        return set(map._inner, bytes32(key), value);
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(UintToBytes32Map storage map, uint256 key) internal returns (bool) {
        return remove(map._inner, bytes32(key));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(UintToBytes32Map storage map, uint256 key) internal view returns (bool) {
        return contains(map._inner, bytes32(key));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(UintToBytes32Map storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintToBytes32Map storage map, uint256 index) internal view returns (uint256 key, bytes32 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (uint256(atKey), val);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(UintToBytes32Map storage map, uint256 key) internal view returns (bool exists, bytes32 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(key));
        return (success, val);
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(UintToBytes32Map storage map, uint256 key) internal view returns (bytes32) {
        return get(map._inner, bytes32(key));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(UintToBytes32Map storage map) internal view returns (uint256[] memory) {
        bytes32[] memory store = keys(map._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToUintMap

    struct AddressToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToUintMap storage map, address key, uint256 value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), bytes32(value));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(AddressToUintMap storage map, address key) internal returns (bool) {
        return remove(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(AddressToUintMap storage map, address key) internal view returns (bool) {
        return contains(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressToUintMap storage map, uint256 index) internal view returns (address key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToUintMap storage map, address key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToUintMap storage map, address key) internal view returns (uint256) {
        return uint256(get(map._inner, bytes32(uint256(uint160(key)))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToUintMap storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToAddressMap

    struct AddressToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToAddressMap storage map, address key, address value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(AddressToAddressMap storage map, address key) internal returns (bool) {
        return remove(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(AddressToAddressMap storage map, address key) internal view returns (bool) {
        return contains(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressToAddressMap storage map, uint256 index) internal view returns (address key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToAddressMap storage map, address key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToAddressMap storage map, address key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, bytes32(uint256(uint160(key)))))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToAddressMap storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressToBytes32Map

    struct AddressToBytes32Map {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(AddressToBytes32Map storage map, address key, bytes32 value) internal returns (bool) {
        return set(map._inner, bytes32(uint256(uint160(key))), value);
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(AddressToBytes32Map storage map, address key) internal returns (bool) {
        return remove(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(AddressToBytes32Map storage map, address key) internal view returns (bool) {
        return contains(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(AddressToBytes32Map storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressToBytes32Map storage map, uint256 index) internal view returns (address key, bytes32 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (address(uint160(uint256(atKey))), val);
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(AddressToBytes32Map storage map, address key) internal view returns (bool exists, bytes32 value) {
        (bool success, bytes32 val) = tryGet(map._inner, bytes32(uint256(uint160(key))));
        return (success, val);
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(AddressToBytes32Map storage map, address key) internal view returns (bytes32) {
        return get(map._inner, bytes32(uint256(uint160(key))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(AddressToBytes32Map storage map) internal view returns (address[] memory) {
        bytes32[] memory store = keys(map._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // Bytes32ToUintMap

    struct Bytes32ToUintMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToUintMap storage map, bytes32 key, uint256 value) internal returns (bool) {
        return set(map._inner, key, bytes32(value));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(Bytes32ToUintMap storage map, bytes32 key) internal returns (bool) {
        return remove(map._inner, key);
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(Bytes32ToUintMap storage map, bytes32 key) internal view returns (bool) {
        return contains(map._inner, key);
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(Bytes32ToUintMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32ToUintMap storage map, uint256 index) internal view returns (bytes32 key, uint256 value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (atKey, uint256(val));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToUintMap storage map, bytes32 key) internal view returns (bool exists, uint256 value) {
        (bool success, bytes32 val) = tryGet(map._inner, key);
        return (success, uint256(val));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToUintMap storage map, bytes32 key) internal view returns (uint256) {
        return uint256(get(map._inner, key));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToUintMap storage map) internal view returns (bytes32[] memory) {
        bytes32[] memory store = keys(map._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // Bytes32ToAddressMap

    struct Bytes32ToAddressMap {
        Bytes32ToBytes32Map _inner;
    }

    /**
     * @dev Adds a key-value pair to a map, or updates the value for an existing
     * key. O(1).
     *
     * Returns true if the key was added to the map, that is if it was not
     * already present.
     */
    function set(Bytes32ToAddressMap storage map, bytes32 key, address value) internal returns (bool) {
        return set(map._inner, key, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a map. O(1).
     *
     * Returns true if the key was removed from the map, that is if it was present.
     */
    function remove(Bytes32ToAddressMap storage map, bytes32 key) internal returns (bool) {
        return remove(map._inner, key);
    }

    /**
     * @dev Returns true if the key is in the map. O(1).
     */
    function contains(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (bool) {
        return contains(map._inner, key);
    }

    /**
     * @dev Returns the number of elements in the map. O(1).
     */
    function length(Bytes32ToAddressMap storage map) internal view returns (uint256) {
        return length(map._inner);
    }

    /**
     * @dev Returns the element stored at position `index` in the map. O(1).
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32ToAddressMap storage map, uint256 index) internal view returns (bytes32 key, address value) {
        (bytes32 atKey, bytes32 val) = at(map._inner, index);
        return (atKey, address(uint160(uint256(val))));
    }

    /**
     * @dev Tries to returns the value associated with `key`. O(1).
     * Does not revert if `key` is not in the map.
     */
    function tryGet(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (bool exists, address value) {
        (bool success, bytes32 val) = tryGet(map._inner, key);
        return (success, address(uint160(uint256(val))));
    }

    /**
     * @dev Returns the value associated with `key`. O(1).
     *
     * Requirements:
     *
     * - `key` must be in the map.
     */
    function get(Bytes32ToAddressMap storage map, bytes32 key) internal view returns (address) {
        return address(uint160(uint256(get(map._inner, key))));
    }

    /**
     * @dev Return the an array containing all the keys
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the map grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function keys(Bytes32ToAddressMap storage map) internal view returns (bytes32[] memory) {
        bytes32[] memory store = keys(map._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }
}

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

pragma solidity ^0.8.20;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```solidity
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableSet.
 * ====
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position is the index of the value in the `values` array plus 1.
        // Position 0 is used to mean a value is not in the set.
        mapping(bytes32 value => uint256) _positions;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._positions[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We cache the value's position to prevent multiple reads from the same storage slot
        uint256 position = set._positions[value];

        if (position != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 valueIndex = position - 1;
            uint256 lastIndex = set._values.length - 1;

            if (valueIndex != lastIndex) {
                bytes32 lastValue = set._values[lastIndex];

                // Move the lastValue to the index where the value to delete is
                set._values[valueIndex] = lastValue;
                // Update the tracked position of the lastValue (that was just moved)
                set._positions[lastValue] = position;
            }

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the tracked position for the deleted slot
            delete set._positions[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value) private view returns (bool) {
        return set._positions[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index) private view returns (bytes32) {
        return set._values[index];
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function _values(Set storage set) private view returns (bytes32[] memory) {
        return set._values;
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
        return _at(set._inner, index);
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
        bytes32[] memory store = _values(set._inner);
        bytes32[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value) internal returns (bool) {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value) internal returns (bool) {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value) internal view returns (bool) {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index) internal view returns (address) {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(AddressSet storage set) internal view returns (address[] memory) {
        bytes32[] memory store = _values(set._inner);
        address[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value) internal returns (bool) {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value) internal view returns (bool) {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index) internal view returns (uint256) {
        return uint256(_at(set._inner, index));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(UintSet storage set) internal view returns (uint256[] memory) {
        bytes32[] memory store = _values(set._inner);
        uint256[] memory result;

        assembly ("memory-safe") {
            result := store
        }

        return result;
    }
}

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

import {DataPoint} from "../../utils/DataPoints.sol";

/**
 * @title Access Manager Interface
 * @notice Interface defines functions used to manage access control of DataManagers to
 *         DataObjects data related to specified DataPoint
 */
interface IAccessManager {
    /**
     * @notice Event emitted when DataObject is approved for DataPoint
     * @param dp Identifier of the DataPoint
     * @param dobj Address of DataObject
     * @param approved if DataObject is approved
     */
    event DataPointDOApprovalChanged(DataPoint dp, address dobj, bool approved);

    /**
     * @notice Verifies if DataManager is allowed to write in specific DataPoint
     * @param dp Identifier of the DataPoint
     * @param dm Address of DataManager
     * @return if write access is allowed
     */
    function approvedDataManager(DataPoint dp, address dm) external view returns (bool);

    /**
     * @notice Defines if DataManager is allowed to write in specific DataPoint
     * @param dp Identifier of the DataPoint
     * @param dm Address of DataManager
     * @param approved if DataManager should be approved for the DataPoint
     * @dev Function SHOULD be restricted to DataPoint maintainer only
     */
    function approveDataManager(DataPoint dp, address dm, bool approved) external;
}

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

import {DataPoint} from "../../utils/DataPoints.sol";
import {IDataObject} from "./IDataObject.sol";
/**
 * @title Data Interface
 * @notice Interface defines functions to interact with stored data in DataObjects for DataPoints
 */
interface IData {
    /**
     * @notice Reads stored data
     * @param dobj Identifier of DataObject
     * @param dp Identifier of the DataPoint
     * @param operation Read operation to execute on the data
     * @param data Operation-specific data
     * @return Operation-specific data
     */
    function read(IDataObject dobj, DataPoint dp, bytes4 operation, bytes calldata data) external view returns (bytes memory);

    /**
     * @notice Stores data
     * @param dobj Identifier of DataObject
     * @param dp Identifier of the DataPoint
     * @param operation Write operation to execute on the data
     * @param data Operation-specific data
     * @return Operation-specific data (can be empty)
     * @dev Function SHOULD be restricted to allowed DMs only
     */
    function write(IDataObject dobj, DataPoint dp, bytes4 operation, bytes calldata data) external payable returns (bytes memory);
}

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

import {IERC165} from "@openzeppelin/contracts/interfaces/IERC165.sol";
import {IData} from "./IData.sol";
import {IIDManager} from "./IIDManager.sol";
import {IAccessManager} from "./IAccessManager.sol";
import {IPortabilityManager} from "./IPortabilityManager.sol";

/**
 * @title Data Index Interface
 * @notice Combines all interfaces required for this Data Index implementation
 */
interface IDataIndex is IERC165, IAccessManager, IData, IIDManager, IPortabilityManager {}

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

import {IDOData} from "./IDOData.sol";
import {IDOPortability} from "./IDOPortability.sol";

/**
 * @title Data Object Interface
 * @notice Combines Data Object Data and Portability Interfaces to build a Data Object Interface
 */
interface IDataObject is IDOData, IDOPortability {}

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

import {DataPoint} from "../../utils/DataPoints.sol";

/**
 * @title Data Object Data Interface
 * @notice Interface defines functions to interact with data stored in DataObjects and
 *         associated with DataPoints
 */
interface IDOData {
    /**
     * @notice Reads stored data
     * @param dp Identifier of the DataPoint
     * @param operation Read operation to execute on the data
     * @param data Operation-specific data
     * @return Operation-specific data
     */
    function read(DataPoint dp, bytes4 operation, bytes calldata data) external view returns (bytes memory);

    /**
     * @notice Stores data
     * @param dp Identifier of the DataPoint
     * @param operation Write operation to execute on the data
     * @param data Operation-specific data
     * @return Operation-specific data (can be empty)
     * @dev Access to this function MUST be protected and allowed only for Data Index Implementation registered for this DataPoint
     */
    function write(DataPoint dp, bytes4 operation, bytes calldata data) external payable returns (bytes memory);
}

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

import {DataPoint} from "../../utils/DataPoints.sol";

/**
 * @title Data Object Portability Interface
 * @notice Interface defines functions to manage the Data Index implementation of DataObjects
 */
interface IDOPortability {
    /**
     * @notice This function SHOULD be called by the Data Index Implementation OR DataPoint Admin
     * @param dp DataPoint to work with
     * @param newImpl New Data Index Implementation
     * @dev Initializes DataPoint with provided Data Index implementation or changes current implementation to another one
     */
    function setDataIndexImplementation(DataPoint dp, address newImpl) external;
}

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

import {DataPoint} from "../../utils/DataPoints.sol";

/**
 * @title ID Manager Interface
 * @notice Interface defines functions to build Data Index user identifiers and get information about them
 */
interface IIDManager {
    /**
     * @notice Provides Data Index id for a specific account for a specific DataPoint
     * @param account Address of the user
     * @param dp DataPoint the id should be linked with
     * @return Data Index token id
     * @dev Can be also understood as user Id within the DataIndex
     */
    function diid(address account, DataPoint dp) external view returns (bytes32);

    /**
     * @notice Provides information about owner of specific Data Index id
     * @param diid_ Data Index id to get info for
     * @return chainid of owner's address
     * @return owner's address
     */
    function ownerOf(bytes32 diid_) external view returns (uint32, address);
}

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

import {DataPoint} from "../../utils/DataPoints.sol";
import {IDataObject} from "./IDataObject.sol";

/**
 * @title Portability Manager Interface
 * @notice Interface defines functions used to change Data Index implementation used for a DataPoint to another one
 */
interface IPortabilityManager {
    /**
     * @dev Error thrown when incorrect Data Index implementation address is provided
     * @param dataIndexImpl Incorrect Data Index Implementation address
     */
    error IncorrectDataIndexImplementationAddress(address dataIndexImpl);

    /**
     * @notice Emitted when Data Index implementation is set
     * @param dp DataPoint to work with
     * @param dataIndexImpl New Data Index Implementation
     * @param dataObjects DataObjects switched to a new implementation
     */
    event DataIndexImplementationSet(DataPoint dp, address dataIndexImpl, IDataObject[] dataObjects);

    /**
     * @notice This function MUST be called by DataPoint owner
     * @param dp DataPoint to work with
     * @param newImpl New Data Index Implementation
     * @param dataObjects DataObjects switched to a new implementation
     * @dev After this call current implementation will not be able to work with this DataPoint on specified DataObjects
     *      Great care should be taken to not make DataObject unusable because of this change
     */
    function setDataIndexImplementation(DataPoint dp, address newImpl, IDataObject[] calldata dataObjects) external;
}

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

import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol";

interface IWrapper {
    /// @dev Error thrown when the parameters are wrong
    error WrongParameters();

    /// @dev Error thrown when the params length mismatch or are 0
    error InvalidArrayLength();

    error CannotDoubleWrapSameERC20Token(address token);

    error CannotDoubleWrapSameERC1155TokenId(address token, uint256 id);

    error WrongWrappedType();

    error PercentageUnwrapNotSupported();

    error OnlyNFTOwnerCanUnwrapOrExecute();

    error WrongAssetToUnwrapOrExecute();

    error WrongValueToUnwrap();

    error NonexistentId();

    error SpenderAlreadyApprovedOrUnapproved(address spender);

    error WrongSpender(address spender);

    event ObjectWrapped(uint256 wid, address from, address beneficiary, address token, uint256 id, uint256 value);

    event ObjectUnwrapped(uint256 wid, address beneficiary, address token, uint256 id, uint256 value);

    event SpenderApprovedOrUnapproved(address spender, address owner, bool approved);

    event Executed(uint256 indexed nftId, address indexed token, bytes input);

    enum WrappedObjectType {
        ERC20,
        ERC721,
        ERC1155
    }

    /**
     * @notice The input of the providerWrapAssets function
     * @param wtypes Array of the types of the assets (ERCs)
     * @param tokens Array of the addresses of the tokens
     * @param ids Array of the ids of the tokens (not needed for fungible assets)
     * @param values Array of the values of the tokens (not needed for non-fungible assets)
     * @param provider The address that provides the assets to be wrapped
     * @param beneficiary The address that receives the ownership of the newly created ERC721
     */
    struct ProviderWrapAssetsInput {
        WrappedObjectType[] wtypes;
        address[] tokens;
        uint256[] ids;
        uint256[] values;
        address provider;
        address beneficiary;
    }

    /**
     * @notice The input of the providerWrapAssetsOnExistingNft function
     * @param nftId The ERC721 id to be used
     * @param wtypes Array of the types of the assets (ERCs)
     * @param tokens Array of the addresses of the tokens
     * @param ids Array of the ids of the tokens (not needed for fungible assets)
     * @param values Array of the values of the tokens (not needed for non-fungible assets)
     * @param provider The address that provides the assets to be wrapped
     */
    struct ProviderWrapAssetsOnExistingNftInput {
        uint256 nftId;
        WrappedObjectType[] wtypes;
        address[] tokens;
        uint256[] ids;
        uint256[] values;
        address provider;
    }

    /**
     * @notice The input of the beneficiaryPartiallyUnwrapAssets function
     * @param nftId The ERC721 id to be used
     * @param tokens Array of the addresses of the tokens
     * @param ids Array of the ids of the tokens (not needed for fungible assets)
     * @param values Array of the values of the tokens (not needed for non-fungible assets)
     * @param beneficiary The address that will receive the unwrapped assets
     */
    struct BeneficiaryPartiallyUnwrapAssetsInput {
        uint256 nftId;
        address[] tokens;
        uint256[] ids;
        uint256[] values;
        address beneficiary;
    }

    struct WrappedObject {
        WrappedObjectType wtype;
        EnumerableSet.UintSet ids;
        // For fungible tokens the id is always 0
        mapping(uint256 id => uint256 value) values;
    }

    function approveSpenderOfApprovedAssets(address spender) external;

    function removeSpenderOfApprovedAssets(address spender) external;

    /**
     * @notice Wrap assets on a newly created ERC721 token
     * @param wtypes Array of the types of the assets (ERCs)
     * @param tokens Array of the addresses of the tokens
     * @param ids Array of the ids of the tokens (not needed for fungible assets)
     * @param values Array of the values of the tokens (not needed for non-fungible assets)
     */
    function wrapAssets(
        WrappedObjectType[] calldata wtypes,
        address[] calldata tokens,
        uint256[] calldata ids,
        uint256[] calldata values
    ) external returns (uint256);

    /**
     * @notice Wrap assets on an already existing ERC721 token
     * @param nftId The id of the existing ERC721 token
     * @param wtypes Array of the types of the assets (ERCs)
     * @param tokens Array of the addresses of the tokens
     * @param ids Array of the ids of the tokens (not needed for fungible assets)
     * @param values Array of the values of the tokens (not needed for non-fungible assets)
     */
    function wrapAssetsOnExistingNft(
        uint256 nftId,
        WrappedObjectType[] calldata wtypes,
        address[] calldata tokens,
        uint256[] calldata ids,
        uint256[] calldata values
    ) external;

    /**
     * @notice Wrap assets on a newly created ERC721 token, where tokens are acquired from provider and the new ERC721 is provided to the beneficiary
     * @param input The input of the function. (Struct is described above)
     */
    function providerWrapAssets(ProviderWrapAssetsInput memory input) external returns (uint256);

    /**
     * @notice Wrap assets on an already existing ERC721 token, where tokens are acquired from provider
     * @param input The input of the function. (Struct is described above)
     */
    function providerWrapAssetsOnExistingNft(ProviderWrapAssetsOnExistingNftInput memory input) external;

    /**
     * @notice Partially unwrap assets from an already existing ERC721 token
     * @param nftId The id of the existing ERC721 token
     * @param tokens Array of the addresses of the tokens
     * @param ids Array of the ids of the tokens (not needed for fungible assets)
     * @param values Array of the values of the tokens (not needed for non-fungible assets)
     */
    function partiallyUnwrapAssets(uint256 nftId, address[] calldata tokens, uint256[] calldata ids, uint256[] calldata values) external;

    /**
     * @notice Fully unwrap assets from an already existing ERC721 token
     * @param nftId The id of the existing ERC721 token
     */
    function fullyUnwrapAssets(uint256 nftId) external;

    /**
     * @notice Partially unwrap assets from an already existing ERC721 token, where from each asset a percentage of value is unwrapped, and the receiver is beneficiary
     * @param nftId The id of the existing ERC721 token
     * @param percentage The percentage of each token's value to be unwrapped
     * @param skipNonPercentageWtypes True if not percentage types should be skipped (NON-FUNGIBLE ASSETS) and false if not
     * @param beneficiary The address that receives the unwrapped assets
     */
    function percentageBeneficiaryPartiallyUnwrapAssets(uint256 nftId, uint256 percentage, bool skipNonPercentageWtypes, address beneficiary) external;

    /**
     * @notice Partially unwrap assets from an already existing ERC721 token, where tokens unwrapped are provided to beneficiary
     * @param input The input of the function. (Struct is described above)
     */
    function beneficiaryPartiallyUnwrapAssets(BeneficiaryPartiallyUnwrapAssetsInput memory input) external;

    /**
     * @notice Fully unwrap assets from an already existing ERC721 token, where beneficiary receives the unwrapped assets
     * @param nftId The id of the existing ERC721 token
     * @param beneficiary The address that receives the unwrapped assets
     */
    function beneficiaryFullyUnwrapAssets(uint256 nftId, address beneficiary) external;

    /**
     * @notice Function for executing transactions on wrapped assets
     * @param nftId The id of the ERC721 token
     * @param token The address of the token to execute transactions for
     * @param input Input needed for the transaction execution
     */
    function execute(uint256 nftId, address token, bytes calldata input) external payable;
}

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

/**
 * @title Vault Operations Interface
 * @notice Provides the operations of the VaultDataObject to interact with vaults factories,
 *         generic vaults and the data associated to them
 */
interface IVaultOperations {
    /**
     * @notice Operation used to get the deterministic vault address for a given salt
     * @param salt The salt used to deploy the deterministic vault
     * @return The vault address
     */
    function vaultForSalt(bytes32 salt) external view returns (address);

    /**
     * @notice Operation used to get all vaults associated to given data point
     * @return The list of vault addresses
     */
    function allVaults() external view returns (address[] memory);

    /**
     * @notice Operation used to deploy a new vault
     * @param factory The factory address
     * @param factoryData Data for any additional initialization
     * @return The vault address
     */
    function deployVault(address factory, bytes calldata factoryData) external returns (address);

    /**
     * @notice Operation used to deploy a new deterministic vault
     * @param factory The factory address
     * @param salt A unique value to ensure the deterministic address is unique
     * @param factoryData Data for any additional initialization
     * @return The vault address
     */
    function deployDeterministicVault(address factory, bytes32 salt, bytes calldata factoryData) external returns (address);

    /**
     * @notice Operation used to add a valid signer for a vault for a specific hash
     * @param vault The vault address to add the signer to
     * @param hash The hash to add the signer to
     * @param signer The signer address
     */
    function addSignatureValidationData(address vault, bytes32 hash, address signer) external;

    /**
     * @notice Operation used to revoke a valid signer for a vault for a specific hash
     * @param vault The vault address to revoke the signer from
     * @param hash The hash to revoke the signer from
     * @param signer The signer address
     */
    function revokeSignatureValidationData(address vault, bytes32 hash, address signer) external;

    /**
     * @notice Operation used to execute a call on a vault
     * @param vault The vault address
     * @param target The target address
     * @param vaultCallData The call data
     * @param value The call value
     */
    function vaultExecute(address vault, address target, bytes calldata vaultCallData, uint256 value) external;
}

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

/**
 * @title Vault interface
 * @notice Interface for a generic vault contract that can hold any type of assets and execute arbitrary transactions
 */
interface IVault {
    /**
     * @notice Emitted when native coin is received
     * @param from The sender of the native coin
     * @param value The amount of native coin received
     */
    event NativeCoinReceived(address from, uint256 value);

    /**
     * @notice Executes a state-changing call on a target
     * @param target Contract to call
     * @param data Data sent to the target, including function selector
     * @param value Native coin value sent with the call
     * @dev Access to this function SHOULD be protected
     */
    function execute(address target, bytes calldata data, uint256 value) external returns (bytes memory);

    /**
     * @notice Executes a static call (non state-changing) on a target
     * @param target Contract to call
     * @param data Data sent to the target, including function selector
     */
    function executeStatic(address target, bytes calldata data) external view returns (bytes memory);
}

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

/**
 * @title ChainidTools library
 * @notice This library provides helper to convert uint256 chainid provided by block.chainid to uint32 chainid used across this Data Index implementation
 */
library ChainidTools {
    /// @dev Error thrown when chainid is not supported
    error UnsupportedChain(uint256 chainId);

    /// @dev Error thrown when chainid is not the current chain
    error UnexpectedChain(uint32 expected, uint32 requested);

    /// @dev Error thrown when chainid is not the expected chain
    error DifferentChainExpected(uint256 chainId);

    /**
     * @dev Converts block.chainid to uint32 chainid
     * @return uint32 chainid
     */
    function chainid() internal view returns (uint32) {
        if (block.chainid <= type(uint32).max) {
            return uint32(block.chainid);
        }
        revert UnsupportedChain(block.chainid);
    }

    /**
     * @dev Requires current chain to be the same as requested
     * @param chainId Requested chain ID
     */
    function requireCurrentChain(uint32 chainId) internal view {
        uint32 currentChain = chainid();
        if (currentChain != chainId) revert UnexpectedChain(currentChain, chainId);
    }

    /**
     * @dev Requires current chain to be different than requested
     * @param chainId Requested chain ID
     */
    function requireNotCurrentChain(uint32 chainId) internal view {
        if (block.chainid == 31337) return; // Allow LayerZero Endpoint Mock to be used on Hardhat testnet
        uint32 currentChain = chainid();
        if (currentChain == chainId) revert DifferentChainExpected(chainId);
    }
}

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

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

/// @dev DataPoint is a 32 bytes structure which contains information about data point
type DataPoint is bytes32;

/**
 * DataPoint structure:
 * 0xPPPPVVRRIIIIIIIIHHHHHHHHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
 * - Prefix (bytes4)
 * -- PPPP - Type prefix (0x4450) - ASCII representation of letters "DP"
 * -- VV   - Version of DataPoint specification, currently 0x00
 * -- RR   - Reserved byte (should be 0x00 in current specification)
 * - Registry-local identifier
 * -- IIIIIIII - 32 bit implementation-specific id of the DataPoint
 * - Chain ID (bytes4)
 * -- HHHHHHHH - 32 bit of chain identifier
 * - Registry Address (bytes20)
 * -- AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA - Address of Registry which allocated the DataPoint
 *
 * !!! COMPATIBILITY REQUIREMENTS !!!
 * - Registry address MUST be located in last 20 bytes of the DataPoint in ALL DataPoint implementations
 * - PREFIX 0x44500000 SHOULD be used only by implementations with same DataPoint structure
 */

/**
 * @title DataPoints library
 * @notice Library with utility functions to encode and decode DataPoint
 */
library DataPoints {
    /// @dev Represents PPPPVVRR prefix
    bytes4 internal constant PREFIX = 0x44500000;

    /// @dev Offset of the DataPoint prefix
    uint256 internal constant PREFIX_BIT_OFFSET = 224;

    /// @dev Offset of the DataPoint id
    uint256 internal constant ID_BIT_OFFSET = 192;

    /// @dev Offset of the DataPoint chainid
    uint256 internal constant CHAINID_BIT_OFFSET = 160;

    /// @dev Error thrown when DataPoint structure is not supported
    error UnsupportedDataPointStructure();

    /**
     * @dev Encode DataPoint
     * @param registry Address of the registry which allocated the DataPoint
     * @param id 32 bit implementation-specific id of the DataPoint
     * @return Encoded DataPoint
     */
    function encode(address registry, uint32 id) internal view returns (DataPoint) {
        return
            DataPoint.wrap(
                bytes32(
                    (uint256(uint32(PREFIX)) << PREFIX_BIT_OFFSET) |
                        (uint256(id) << ID_BIT_OFFSET) |
                        (uint256(ChainidTools.chainid()) << CHAINID_BIT_OFFSET) |
                        uint256(uint160(registry))
                )
            );
    }

    /**
     * @dev Decode DataPoint
     * @param dp DataPoint to decode
     * @return chainid Chain ID of the DataPoint
     * @return registry Address of the registry which allocated the DataPoint
     * @return id 32 bit implementation-specific id of the DataPoint
     */
    function decode(DataPoint dp) internal pure returns (uint32 chainid, address registry, uint32 id) {
        uint256 dpu = uint256(DataPoint.unwrap(dp));
        bytes4 prefix = bytes4(uint32(dpu >> PREFIX_BIT_OFFSET));
        if (prefix != PREFIX) revert UnsupportedDataPointStructure();
        registry = address(uint160(dpu));
        chainid = uint32(dpu >> CHAINID_BIT_OFFSET);
        id = uint32(dpu >> ID_BIT_OFFSET);
    }
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"target","type":"address"}],"name":"AddressEmptyCode","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"},{"internalType":"uint256","name":"id","type":"uint256"}],"name":"CannotDoubleWrapSameERC1155TokenId","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"CannotDoubleWrapSameERC20Token","type":"error"},{"inputs":[{"internalType":"address","name":"implementation","type":"address"}],"name":"ERC1967InvalidImplementation","type":"error"},{"inputs":[],"name":"ERC1967NonPayable","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"bytes32","name":"key","type":"bytes32"}],"name":"EnumerableMapNonexistentKey","type":"error"},{"inputs":[],"name":"FailedCall","type":"error"},{"inputs":[],"name":"InvalidArrayLength","type":"error"},{"inputs":[],"name":"InvalidInitialization","type":"error"},{"inputs":[],"name":"NonexistentId","type":"error"},{"inputs":[],"name":"NotInitializing","type":"error"},{"inputs":[],"name":"OnlyNFTOwnerCanUnwrapOrExecute","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":"PercentageUnwrapNotSupported","type":"error"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"SafeERC20FailedOperation","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"SpenderAlreadyApprovedOrUnapproved","type":"error"},{"inputs":[],"name":"UUPSUnauthorizedCallContext","type":"error"},{"inputs":[{"internalType":"bytes32","name":"slot","type":"bytes32"}],"name":"UUPSUnsupportedProxiableUUID","type":"error"},{"inputs":[],"name":"WrongAssetToUnwrapOrExecute","type":"error"},{"inputs":[],"name":"WrongParameters","type":"error"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"WrongSpender","type":"error"},{"inputs":[],"name":"WrongValueToUnwrap","type":"error"},{"inputs":[],"name":"WrongWrappedType","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"nftId","type":"uint256"},{"indexed":true,"internalType":"address","name":"token","type":"address"},{"indexed":false,"internalType":"bytes","name":"input","type":"bytes"}],"name":"Executed","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint64","name":"version","type":"uint64"}],"name":"Initialized","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"wid","type":"uint256"},{"indexed":false,"internalType":"address","name":"beneficiary","type":"address"},{"indexed":false,"internalType":"address","name":"token","type":"address"},{"indexed":false,"internalType":"uint256","name":"id","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"ObjectUnwrapped","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"wid","type":"uint256"},{"indexed":false,"internalType":"address","name":"from","type":"address"},{"indexed":false,"internalType":"address","name":"beneficiary","type":"address"},{"indexed":false,"internalType":"address","name":"token","type":"address"},{"indexed":false,"internalType":"uint256","name":"id","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"ObjectWrapped","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":false,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"SpenderApprovedOrUnapproved","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"implementation","type":"address"}],"name":"Upgraded","type":"event"},{"inputs":[],"name":"UPGRADE_INTERFACE_VERSION","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"approveSpenderOfApprovedAssets","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"nftId","type":"uint256"},{"internalType":"address","name":"beneficiary","type":"address"}],"name":"beneficiaryFullyUnwrapAssets","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"uint256","name":"nftId","type":"uint256"},{"internalType":"address[]","name":"tokens","type":"address[]"},{"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"internalType":"uint256[]","name":"values","type":"uint256[]"},{"internalType":"address","name":"beneficiary","type":"address"}],"internalType":"struct IWrapper.BeneficiaryPartiallyUnwrapAssetsInput","name":"input","type":"tuple"}],"name":"beneficiaryPartiallyUnwrapAssets","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"dataIndex","outputs":[{"internalType":"contract IDataIndex","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"nftId","type":"uint256"},{"internalType":"address","name":"token","type":"address"},{"internalType":"bytes","name":"input","type":"bytes"}],"name":"execute","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"nftId","type":"uint256"}],"name":"fullyUnwrapAssets","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"dp","type":"bytes32"},{"internalType":"address","name":"dataIndex_","type":"address"},{"internalType":"address","name":"vaultDO_","type":"address"},{"internalType":"address","name":"vaultFactory_","type":"address"},{"internalType":"string","name":"name_","type":"string"},{"internalType":"string","name":"symbol_","type":"string"}],"name":"initialize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"nftId","type":"uint256"},{"internalType":"address[]","name":"tokens","type":"address[]"},{"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"internalType":"uint256[]","name":"values","type":"uint256[]"}],"name":"partiallyUnwrapAssets","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"nftId","type":"uint256"},{"internalType":"uint256","name":"percentage","type":"uint256"},{"internalType":"bool","name":"skipNonPercentageWtypes","type":"bool"},{"internalType":"address","name":"beneficiary","type":"address"}],"name":"percentageBeneficiaryPartiallyUnwrapAssets","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"enum IWrapper.WrappedObjectType[]","name":"wtypes","type":"uint8[]"},{"internalType":"address[]","name":"tokens","type":"address[]"},{"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"internalType":"uint256[]","name":"values","type":"uint256[]"},{"internalType":"address","name":"provider","type":"address"},{"internalType":"address","name":"beneficiary","type":"address"}],"internalType":"struct IWrapper.ProviderWrapAssetsInput","name":"input","type":"tuple"}],"name":"providerWrapAssets","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"uint256","name":"nftId","type":"uint256"},{"internalType":"enum IWrapper.WrappedObjectType[]","name":"wtypes","type":"uint8[]"},{"internalType":"address[]","name":"tokens","type":"address[]"},{"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"internalType":"uint256[]","name":"values","type":"uint256[]"},{"internalType":"address","name":"provider","type":"address"}],"internalType":"struct IWrapper.ProviderWrapAssetsOnExistingNftInput","name":"input","type":"tuple"}],"name":"providerWrapAssetsOnExistingNft","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"proxiableUUID","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"}],"name":"removeSpenderOfApprovedAssets","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newImplementation","type":"address"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"upgradeToAndCall","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"vaultDO","outputs":[{"internalType":"contract IDataObject","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"vaultFactory","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"nftId","type":"uint256"}],"name":"vaults","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"enum IWrapper.WrappedObjectType[]","name":"wtypes","type":"uint8[]"},{"internalType":"address[]","name":"tokens","type":"address[]"},{"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"internalType":"uint256[]","name":"values","type":"uint256[]"}],"name":"wrapAssets","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"nftId","type":"uint256"},{"internalType":"enum IWrapper.WrappedObjectType[]","name":"wtypes","type":"uint8[]"},{"internalType":"address[]","name":"tokens","type":"address[]"},{"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"internalType":"uint256[]","name":"values","type":"uint256[]"}],"name":"wrapAssetsOnExistingNft","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60a08060405234620000d157306080527ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a009081549060ff8260401c16620000c257506001600160401b036002600160401b0319828216016200007c575b604051613feb9081620000d68239608051818181610c0e0152610d430152f35b6001600160401b031990911681179091556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f80806200005c565b63f92ee8a960e01b8152600490fd5b5f80fdfe60806040526004361015610011575f80fd5b5f3560e01c806301ffc9a71461025457806306fdde031461024f578063081812fc1461024a578063095ea7b3146102455780631765908c1461024057806323b872dd1461023b5780632564fbc6146102365780632567b99f1461023157806335aa8ef41461022c57806342842e0e146102275780634f1ef2861461022257806352d1902d1461021d5780636352211e1461021857806370a0823114610213578063710a9f681461020e5780637126581014610209578063715018a6146102045780637b29e30c146101ff5780638c64ea4a146101fa5780638da5cb5b146101f557806395d89b41146101f0578063a22cb465146101eb578063aa28fd95146101e6578063ad3cb1cc146101e1578063b88d4fde146101dc578063c7036629146101d7578063c87b56dd146101d2578063d8a06f73146101cd578063d91c4780146101c8578063d97f10cf146101c3578063e26b9ecf146101be578063e6c8e756146101b9578063e985e9c5146101b4578063f0c30dc9146101af578063f2fde38b146101aa5763f70bd6dd146101a5575f80fd5b611aa9565b611a7c565b611a55565b611a10565b611814565b611766565b6116da565b6115fe565b6115d6565b611585565b611568565b611512565b6114bb565b6113fe565b611362565b6112a1565b61126d565b61123b565b611134565b6110cd565b61100d565b610e22565b610dca565b610d9a565b610d31565b610bcc565b610ba5565b610b7d565b610ade565b61092c565b6108b4565b6107ac565b61048d565b610427565b610337565b61026f565b6001600160e01b031981160361026b57565b5f80fd5b3461026b57602036600319011261026b57602060043561028e81610259565b63ffffffff60e01b166380ac58cd60e01b81149081156102cc575b81156102bb575b506040519015158152f35b6301ffc9a760e01b1490505f6102b0565b635b5e139f60e01b811491506102a9565b5f5b8381106102ee5750505f910152565b81810151838201526020016102df565b90602091610317815180928185528580860191016102dd565b601f01601f1916010190565b9060206103349281815201906102fe565b90565b3461026b575f36600319011261026b576040515f5f80516020613eb683398151915280549061036582611ad1565b808552916020916001918281169081156103fa57506001146103a2575b61039e86610392818803826105fa565b60405191829182610323565b0390f35b5f90815293507f37c58c799b6609234b945e882912ee9ad34948a1dfaa20a97485e1a7752bbf815b8385106103e7575050505081016020016103928261039e5f610382565b80548686018401529382019381016103ca565b905086955061039e9693506020925061039294915060ff191682840152151560051b82010192935f610382565b3461026b57602036600319011261026b576004356104448161300b565b505f525f80516020613f56833981519152602052602060018060a01b0360405f205416604051908152f35b6001600160a01b0381160361026b57565b359061048b8261046f565b565b3461026b57604036600319011261026b576004356104aa8161046f565b602435906104b78261300b565b33151580610585575b80610558575b6105405761053e9261051f9181906001600160a01b0385811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f525f80516020613f5683398151915260205260405f2090565b80546001600160a01b0319166001600160a01b03909216919091179055565b005b60405163a9fbf51f60e01b8152336004820152602490fd5b5060ff61057d3361056884611b41565b9060018060a01b03165f5260205260405f2090565b5416156104c6565b506001600160a01b0381163314156104c0565b634e487b7160e01b5f52604160045260245ffd5b60c081019081106001600160401b038211176105c757604052565b610598565b6001600160401b0381116105c757604052565b602081019081106001600160401b038211176105c757604052565b90601f801991011681019081106001600160401b038211176105c757604052565b6040519061048b826105ac565b6040519060a082018281106001600160401b038211176105c757604052565b6001600160401b0381116105c75760051b60200190565b929161066982610647565b9161067760405193846105fa565b829481845260208094019160051b810192831161026b57905b82821061069d5750505050565b8135600381101561026b578152908301908301610690565b9080601f8301121561026b578160206103349335910161065e565b92916106db82610647565b916106e960405193846105fa565b829481845260208094019160051b810192831161026b57905b82821061070f5750505050565b838091833561071d8161046f565b815201910190610702565b9080601f8301121561026b57816020610334933591016106d0565b929161074e82610647565b9161075c60405193846105fa565b829481845260208094019160051b810192831161026b57905b8282106107825750505050565b81358152908301908301610775565b9080601f8301121561026b5781602061033493359101610743565b3461026b5760031960203682011261026b576004908135916001600160401b039182841161026b5760c090843603011261026b576107e861061b565b91838201358352602484013581811161026b5761080a908336918701016106b5565b6020840152604484013581811161026b5761082a90833691870101610728565b6040840152606484013581811161026b5761084a90833691870101610791565b6060840152608484013590811161026b5761053e9361087360a49261087e943691840101610791565b608085015201610480565b60a0820152611bf7565b606090600319011261026b576004356108a08161046f565b906024356108ad8161046f565b9060443590565b3461026b5761053e6108c536610888565b91611f90565b6001600160401b0381116105c757601f01601f191660200190565b81601f8201121561026b578035906108fd826108cb565b9261090b60405194856105fa565b8284526020838301011161026b57815f926020809301838601378301015290565b3461026b5760c036600319011261026b576024356109498161046f565b604435906109568261046f565b606435916109638361046f565b6001600160401b039260843584811161026b576109849036906004016108e6565b9060a43585811161026b5761099d9036906004016108e6565b925f80516020613f76833981519152549560ff8760401c1615961680159081610aa6575b6001149081610a9c575b159081610a93575b50610a81575f80516020613f76833981519152805467ffffffffffffffff19166001179055610a0a9486610a5d575b60043561210c565b610a1057005b5f80516020613f76833981519152805460ff60401b19169055604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29080602081015b0390a1005b5f80516020613f76833981519152805460ff60401b1916600160401b179055610a02565b60405163f92ee8a960e01b8152600490fd5b9050155f6109d3565b303b1591506109cb565b8791506109c1565b9181601f8401121561026b578235916001600160401b03831161026b576020808501948460051b01011161026b57565b3461026b57608036600319011261026b576001600160401b0360043581811161026b57610b0f903690600401610aae565b60249291923582811161026b57610b2a903690600401610aae565b60449491943584811161026b57610b45903690600401610aae565b9160643595861161026b5761039e96610b65610b6d973690600401610aae565b969095612251565b6040519081529081906020820190565b3461026b57604036600319011261026b5761053e602435610b9d8161046f565b6004356122ce565b3461026b5761053e610bb636610888565b9060405192610bc4846105df565b5f8452612e21565b604036600319011261026b576004803590610be68261046f565b6024356001600160401b03811161026b57610c0490369083016108e6565b6001600160a01b037f00000000000000000000000000000000000000000000000000000000000000008116308114908115610d16575b50610d05579060208392610c4c61330c565b6040516352d1902d60e01b8152938491829088165afa5f9281610cd4575b50610c98575050604051634c9c8ce360e01b81526001600160a01b0390921690820190815281906020010390fd5b83835f80516020613f368339815191528403610cb85761053e8383613c1b565b604051632a87526960e21b815290810184815281906020010390fd5b610cf791935060203d602011610cfe575b610cef81836105fa565b8101906132fd565b915f610c6a565b503d610ce5565b60405163703e46dd60e11b81528390fd5b9050815f80516020613f36833981519152541614155f610c3a565b3461026b575f36600319011261026b577f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03163003610d885760206040515f80516020613f368339815191528152f35b60405163703e46dd60e11b8152600490fd5b3461026b57602036600319011261026b576020610db860043561300b565b6040516001600160a01b039091168152f35b3461026b57602036600319011261026b57600435610de78161046f565b6001600160a01b03811615610e0a57610e01602091611b09565b54604051908152f35b6040516322718ad960e21b81525f6004820152602490fd5b606036600319011261026b57602435600435610e3d8261046f565b604435916001600160401b0380841161026b573660238501121561026b57836004013590811161026b576024840193602482369201011161026b57610ea0610e94610e878561120e565b546001600160a01b031690565b6001600160a01b031690565b3303610ffb57610ee5610ee183610ebf865f52600860205260405f2090565b6001600160a01b039091165f9081526001919091016020526040902054151590565b1590565b610fe957600254610f7292905f908390610f07906001600160a01b0316610e94565b8254879084906001600160a01b0316610f558b610f47610f35610e87600154975f52600660205260405f2090565b6040519889938c349360208701612542565b03601f1981018752866105fa565b604051632dd0b82b60e01b815298899586948593600485016125d6565b03925af1928315610fe4577f687656bcdc248e32bf17a5e7f71e8ad6f00fe0671f9414acaeccc0ed017f90f193610fc2575b50610fbd60405192839260018060a01b0316968361264f565b0390a3005b610fdd903d805f833e610fd581836105fa565b810190612578565b505f610fa4565b612644565b604051630d37d89f60e21b8152600490fd5b60405163144390cb60e21b8152600490fd5b3461026b57608036600319011261026b576001600160401b0360243581811161026b5761103e903690600401610aae565b9060443583811161026b57611057903690600401610aae565b9260643585811161026b57611070903690600401610aae565b9190926040519560a0870197878910908911176105c7576110a56110bd966110b19461053e9a6040526004358a5236916106d0565b60208801523691610743565b60408501523691610743565b6060820152336080820152612ac5565b3461026b575f36600319011261026b576110e561330c565b5f80516020613ed683398151915280546001600160a01b031981169091555f906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b3461026b5760031960203682011261026b5760048035906001600160401b039283831161026b5760c090833603011261026b5761116f61061b565b908281013584811161026b5761118a908236918601016106b5565b8252602483013584811161026b576111a790823691860101610728565b6020830152604483013584811161026b576111c790823691860101610791565b6040830152606483013593841161026b5760a4610b6d936111f361039e96611204943691840101610791565b606085015261087360848201610480565b60a0820152612660565b5f527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab007930260205260405f2090565b3461026b57602036600319011261026b576004355f526006602052602060018060a01b0360405f205416604051908152f35b3461026b575f36600319011261026b575f80516020613ed6833981519152546040516001600160a01b039091168152602090f35b3461026b575f36600319011261026b576040515f5f80516020613f968339815191528054906112cf82611ad1565b808552916020916001918281169081156103fa57506001146112fb5761039e86610392818803826105fa565b5f90815293507ff4bad0a69248f59680a4f2b3000328cec71a413447c96781cfe5996daa8c456e5b838510611340575050505081016020016103928261039e5f610382565b8054868601840152938201938101611323565b60443590811515820361026b57565b3461026b57604036600319011261026b5760043561137f8161046f565b60243580151580910361026b576001600160a01b0382169182156113e5576113aa9061056833611b41565b60ff1981541660ff83161790556040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b604051630b61174360e31b815260048101849052602490fd5b3461026b5760031960203682011261026b576004356001600160401b039182821161026b5760a090823603011261026b57611437610628565b9080600401358252602481013583811161026b5761145b9060043691840101610728565b6020830152604481013583811161026b5761147c9060043691840101610791565b6040830152606481013592831161026b5760846114b1916114a661053e9560043691840101610791565b606085015201610480565b6080820152612ac5565b3461026b575f36600319011261026b5760405160408101908082106001600160401b038311176105c75761039e9160405260058152640352e302e360dc1b60208201526040519182916020835260208301906102fe565b3461026b57608036600319011261026b5760043561152f8161046f565b60243561153b8161046f565b606435916001600160401b03831161026b5761155e61053e9336906004016108e6565b9160443591612e21565b3461026b57602036600319011261026b5761053e336004356122ce565b3461026b57602036600319011261026b576115a160043561300b565b505f6040516115af816105df565b5261039e6040516115bf816105df565b5f81526040519182916020835260208301906102fe565b3461026b575f36600319011261026b576003546040516001600160a01b039091168152602090f35b3461026b57602036600319011261026b5760043561161b8161046f565b335f52600960205260405f2060ff61164383839060018060a01b03165f5260205260405f2090565b54166116b9576001600160a01b0382165f908152602091909152604090207f88a0e868b628b6ffa05ecd3d19ee5edbecda74126c3e9c072d23366e1f6c655191610a5891805460ff19166001908117909155604080516001600160a01b0390931683523360208401528201529081906060820190565b604051637afff29560e11b81526001600160a01b0383166004820152602490fd5b3461026b5760a036600319011261026b576001600160401b0360243581811161026b5761170b903690600401610aae565b9060443583811161026b57611724903690600401610aae565b9060643585811161026b5761173d903690600401610aae565b92909160843596871161026b5761175b61053e973690600401610aae565b969095600435612f25565b3461026b57602036600319011261026b576004356117838161046f565b335f52600960205260405f2060ff6117ab83839060018060a01b03165f5260205260405f2090565b5416156116b9576001600160a01b03919091165f81815260209283526040808220805460ff1916905580519283523393830193909352918101919091527f88a0e868b628b6ffa05ecd3d19ee5edbecda74126c3e9c072d23366e1f6c6551908060608101610a58565b3461026b57608036600319011261026b5760048035602435611834611353565b6064356118408161046f565b611852845f52600860205260405f2090565b9161185c8361393e565b93845180156119fe5790919392946118738261229c565b9161187d8161229c565b936118878261229c565b96611890610628565b998a5260208a019485526040808b0196875260608b019889526001600160a01b0390991660808b01525f965f995f955b8587106118f55761053e8d8d8d8d8d8d8051908251938551966118e7575b50525252612ac5565b8083528085528652886118de565b909192939495986119166119098b84611b8d565b516001600160a01b031690565b61193a61192c6001600160a01b038316876138e1565b5f52600760205260405f2090565b9061194e611949835460ff1690565b613521565b156119c257918c6119b2826119ab61199d8c8f600360019a996119898c9b61197a896119979651611b8d565b6001600160a01b039091169052565b015f805260205260405f2090565b54612f87565b670de0b6b3a7640000900490565b9251611b8d565b5201995b019594939291906118c0565b505097969594938093929c9b50999899155f146119e9578b5163244109df60e21b81528d90fd5b6001809c92939495969798999a9b9c9b6119b6565b604051634ec4810560e11b8152600490fd5b3461026b57604036600319011261026b57602060ff611a49600435611a348161046f565b61056860243591611a448361046f565b611b41565b54166040519015158152f35b3461026b575f36600319011261026b575f546040516001600160a01b039091168152602090f35b3461026b57602036600319011261026b5761053e600435611a9c8161046f565b611aa461330c565b612f9a565b3461026b575f36600319011261026b576002546040516001600160a01b039091168152602090f35b90600182811c92168015611aff575b6020831014611aeb57565b634e487b7160e01b5f52602260045260245ffd5b91607f1691611ae0565b6001600160a01b03165f9081527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab00793036020526040902090565b6001600160a01b03165f9081527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab00793056020526040902090565b634e487b7160e01b5f52603260045260245ffd5b8051821015611ba15760209160051b010190565b611b79565b60031115611bb057565b634e487b7160e01b5f52602160045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b91908201809211611be557565b611bc4565b516003811015611bb05790565b8051611c08610e94610e878361120e565b3303610ffb5760a08201516001600160a01b039290831691903383141580611f5f575b611f475760208101938451519485158015611f38575b8015611f29575b8015611f1a575b6119fe575f5b868110611c655750505050505050565b6001905f80516020613f16833981519152856040611d968a611c8d6119098785870151611b8d565b92888c611cad896080611ca48260608c0151611b8d565b51990151611b8d565b5193818d898c611ccf8b611cca8b985f52600860205260405f2090565b613064565b9790611e3c57611d12969750611cf760016005540180600555805f52600760205260405f2091565b8d611d0d889a939a5f52600860205260405f2090565b613202565b50611d26611d21838351611b8d565b611bea565b611d2f81611ba6565b611d9f5750505060039285611d589593611d4b938c1690613168565b805460ff19168155611989565b555b518b81526001600160a01b03808e1660208301525f60408301529093166060840152608083019390935260a082019290925290819060c0820190565b0390a101611c55565b611db49296949395975090611d219151611b8d565b92611dbe84611ba6565b878a8f8096145f14611df65786915092611df09792611dde941690613109565b805460ff191660011781555b016135ce565b50611d5a565b94611e1482988897938860039897611e2797611e369c97169061307b565b835460ff191660021784555b83016135ce565b5001905f5260205260405f2090565b55611d5a565b50505050919092611e55905f52600760205260405f2090565b918d89611e63855460ff1690565b611e6c81611ba6565b80611e9a575050936003939261198992611e88968b1690613168565b611e93838254611bd8565b9055611d5a565b9350939190611ea884611ba6565b878e8095145f14611ec657509484611dea92611df0978c1690613109565b85611ed893611e8898938d169061307b565b826003820192611ef08285905f5260205260405f2090565b5415611f07575b505050905f5260205260405f2090565b611f1192016135ce565b505f8281611ef7565b50608083015151861415611c4f565b50606083015151861415611c48565b50604083015151861415611c41565b6040516319fb741b60e21b8152336004820152602490fd5b50611f8b610ee1611f84336105688760018060a01b03165f52600960205260405f2090565b5460ff1690565b611c2b565b6001600160a01b039082821680156120f457849083611fae8361120e565b54169433151580612052575b50611fde9086612034575b611fce81611b09565b6001815401905561051f8461120e565b847fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4169182820361201157505050565b60649350604051926364283d7b60e01b8452600484015260248301526044820152fd5b61203d8461352e565b61204687611b09565b80545f19019055611fc5565b91925090806120aa575b1561206a579085915f611fba565b858561208a57604051637e27328960e01b81526004810191909152602490fd5b60405163177e802f60e01b81523360048201526024810191909152604490fd5b5033851480156120dd575b8061205c5750855f525f80516020613f56833981519152602052338460405f2054161461205c565b5060ff6120ed3361056888611b41565b54166120b5565b604051633250574960e11b81525f6004820152602490fd5b9091929395949561211b613637565b61212433612f9a565b61212c613637565b612134613637565b80516001600160401b0381116105c7575f80516020613eb683398151915291612166826121618554611ad1565b613665565b602090816001601f8511146121b857508261048b999a936121a895936121a1935f926121ad575b50508160011b915f199060031b1c19161790565b9055613757565b61384c565b015190505f8061218d565b5f80516020613eb68339815191525f529190601f1984167f37c58c799b6609234b945e882912ee9ad34948a1dfaa20a97485e1a7752bbf81935f905b82821061223957505092600192859261048b9c9d966121a8989610612221575b505050811b019055613757565b01515f1960f88460031b161c191690555f8080612214565b806001869782949787015181550196019401906121f4565b946110a56110b193610334999561227d612286999a98959a6040519b6122768d6105ac565b369161065e565b8a5236916106d0565b60608201523360808201523360a0820152612660565b906122a682610647565b6122b360405191826105fa565b82815280926122c4601f1991610647565b0190602036910137565b906122de610e94610e878461120e565b3303610ffb576001600160a01b038116156125105761230d612308835f52600860205260405f2090565b61393e565b9081519182156119fe575f5b83811061232d575050505061048b9061325b565b61233a6119098284611b8d565b61235861192c82612353895f52600860205260405f2090565b613224565b805460ff1661236681611ba6565b806123fb57506123f2600193926123bd61239860035f80516020613ef683398151915295015f805260205260405f2090565b546123b4836123af8d5f52600860205260405f2090565b613237565b5088838c613b9d565b604080518a81526001600160a01b03808a166020830152909216908201525f60608201819052608082015290819060a0820190565b0390a101612319565b9061240582611ba6565b6001918203612479578161243091612429856123af8c5f52600860205260405f2090565b500161393e565b8051905f5b82811061245a5750505050905f80516020613ef68339815191526123f26001936123bd565b806124738b8a8861246c899688611b8d565b5192613b20565b01612435565b90612490836123af8a5f52600860205260405f2090565b5061249c81830161393e565b9081516124a88161229c565b936003015f5b8281106124e05750505050826124db5f80516020613ef6833981519152936123f29389600198978d613a3d565b6123bd565b806124fe6124ef869388611b8d565b5184905f5260205260405f2090565b546125098289611b8d565b52016124ae565b60405163bd28cf5f60e01b8152600490fd5b908060209392818452848401375f828201840152601f01601f1916010190565b6001600160a01b03918216815291166020820152608060408201819052909493926060926125739287019190612522565b930152565b60208183031261026b578051906001600160401b03821161026b570181601f8201121561026b5780516125aa816108cb565b926125b860405194856105fa565b8184526020828401011161026b5761033491602080850191016102dd565b6001600160a01b03909116815260208101919091526348d4e6d760e01b6040820152608060608201819052610334929101906102fe565b6001600160a01b0390911681526020810191909152635d6c45e760e01b6040820152608060608201819052610334929101906102fe565b6040513d5f823e3d90fd5b916020610334938181520191612522565b60808101516001600160a01b031660a08201516001600160a01b03166001600160a01b0391818316156125105733838216141580612a9b575b611f47576004916126ac60045460010190565b946126b686600455565b6126c08683613344565b6003916126f56126e3610e94896126de60035460018060a01b031690565b6133fd565b61051f895f52600660205260405f2090565b8151519485158015612a8c575b8015612a7d575b8015612a6e575b6119fe575f5b86811061272857505050505050505090565b8784612738611d21848351611b8d565b612749611909856020850151611b8d565b908c8a88604093612763896060611ca482898c0151611b8d565b519761276e82611ba6565b81612873575050505082610ebf61278d925f52600860205260405f2090565b61284e57612845845f80516020613f16833981519152948f93948f8e96848f612806908f948b60019f9e6127c39289168d613168565b896127f8611d0d886127e760016005540180600555805f52600760205260405f2091565b9290945f52600860205260405f2090565b50805460ff19168155611989565b555b519586526001600160a01b039687166020870152861660408601529094166060840152608083019390935260a082019290925290819060c0820190565b0390a101612716565b516321ffeae760e11b81526001600160a01b0390911681860190815281906020010390fd5b612885829a999693949895979a611ba6565b8d60018093145f1461292d57509284928a926128bb8a612845985f80516020613f168339815191529c9b9a9860019f168b613109565b846128d285611cca8b5f52600860205260405f2090565b929061291857612912925089612901611d0d886127e760016005540180600555805f52600760205260405f2091565b50805460ff19166001178155611dea565b50612808565b611dea612912935f52600760205260405f2090565b919088878761293e938e168b61307b565b6129548a611cca895f52600860205260405f2090565b906129cc5750928492866129c6858d958b60019f6128459b5f80516020613f168339815191529f9e9d9b6129b5611d0d611e27946129a460016005540180600555805f52600760205260405f2091565b9290975f52600860205260405f2090565b50835460ff19166002178455611e20565b55612808565b929598999650939650506129e991505f52600760205260405f2090565b908a820191612a008684905f5260205260405f2090565b54612a4257948f93948a8e96896129c68561284598612a3460019f9e9983905f80516020613f168339815191529f016135ce565b50905f5260205260405f2090565b8351630cd2552960e41b81526001600160a01b038616818b019081526020810188905281906040010390fd5b50606083015151861415612710565b50604083015151861415612709565b50602083015151861415612702565b50612ac0610ee1611f84336105688560018060a01b03165f52600960205260405f2090565b612699565b8051612ad6610e94610e878361120e565b3303610ffb5760808201516001600160a01b03169081156125105760208301918251519283158015612e12575b8015612e03575b6119fe575f5b848110612b1f57505050505050565b612b2d611909828451611b8d565b90612b4482611cca875f52600860205260405f2090565b9015610fe957612b5c905f52600760205260405f2090565b805460ff16612b6a81611ba6565b80612c7957506003612b808360608b0151611b8d565b51910190612b95825f805260205260405f2090565b548111612c6757600193612be98a92612bda85612bc75f80516020613ef6833981519152975f805260205260405f2090565b8381540390555f805260205260405f2090565b5415612c4b575b88838b613b9d565b612c426040612c0a866060612c018285890151611b8d565b51960151611b8d565b5190518a81526001600160a01b03808b16602083015290931660408401526060830193909352608082019290925290819060a0820190565b0390a101612b10565b612c61836123af8c5f52600860205260405f2090565b50612be1565b604051631df4d38160e01b8152600490fd5b612c8581949394611ba6565b6001908103612d0c57604090612c9e85838c0151611b8d565b51920190612caf610ee18484613cfa565b612cfc575060019392612cdb5f80516020613ef6833981519152938b935415612ce0575b88838b613b20565b612be9565b612cf6836123af8c5f52600860205260405f2090565b50612cd3565b5163fdb30af560e01b8152600490fd5b90604091612d1d85848c0151611b8d565b5191612d2d8660608d0151611b8d565b519360038201612d458582905f5260205260405f2090565b548611612df25790612d7e85838f99989796959482612d6b91905f5260205260405f2090565b888154039055905f5260205260405f2090565b5415612dcc575b50925f80516020613ef68339815191529492612cdb926001989795015415612db0575b89848c613da5565b612dc6846123af8d5f52600860205260405f2090565b50612da8565b90919293949550612de2610ee185858501613cfa565b612cfc57908b9594939291612d85565b8151631df4d38160e01b8152600490fd5b50606085015151841415612b0a565b50604085015151841415612b03565b91929092612e30818585611f90565b833b612e3d575b50505050565b612e62916020916040519384928392630a85bd0160e11b9788855233600486016134c1565b03815f6001600160a01b0388165af15f9181612ef4575b50612eb85782612e876134f2565b8051919082612eb157604051633250574960e11b81526001600160a01b0383166004820152602490fd5b9050602001fd5b6001600160e01b03191603612ed157505f808080612e37565b604051633250574960e11b81526001600160a01b03919091166004820152602490fd5b612f1791925060203d602011612f1e575b612f0f81836105fa565b8101906134ac565b905f612e79565b503d612f05565b612f6b9361048b9995612f53612f779994612f4a9b9996612f5f956040519d8e6105ac565b8d52369161065e565b60208b015236916106d0565b60408801523691610743565b60608501523691610743565b60808201523360a0820152611bf7565b81810292918115918404141715611be557565b6001600160a01b03908116908115612ff3575f80516020613ed683398151915280546001600160a01b031981168417909155167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3565b604051631e4fbdf760e01b81525f6004820152602490fd5b5f8181527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab007930260205260409020546001600160a01b031690811561304c575090565b60249060405190637e27328960e01b82526004820152fd5b613077916001600160a01b03169061355c565b9091565b5f908152600660205260409020549293926001600160a01b039182169116813b1561026b57604051637921219560e11b81526001600160a01b039485166004820152931660248401526044830191909152606482019290925260a060848201525f60a482018190529091829081838160c481015b03925af18015610fe4576131005750565b61048b906105cc565b5f908152600660205260409020546001600160a01b0390811693929116803b1561026b57604051632142170760e11b81526001600160a01b03938416600482015293909216602484015260448301525f908290818381606481016130ef565b5f9081526006602090815260408083205490516323b872dd60e01b8184019081526001600160a01b03978816602483015291871660448201526064808201969096529485529294939092906131be6084826105fa565b519082865af115612644575f513d6131f957508082163b155b6131df575050565b604051635274afe760e01b81529116600482015260249150fd5b600114156131d7565b610334929160018060a01b031691825f526002820160205260405f20556135ce565b610334916001600160a01b0316906138e1565b6001600160a01b039091165f81815260028301602052604081205561033491613cfa565b6001600160a01b0361326c8261120e565b5416815f82159283156132bc575b6132838361120e565b80546001600160a01b03191690557fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8280a461304c5750565b6132da835f525f80516020613f5683398151915260205260405f2090565b80546001600160a01b03191690556132f181611b09565b8219815401905561327a565b9081602091031261026b575190565b5f80516020613ed6833981519152546001600160a01b0316330361332c57565b60405163118cdaa760e01b8152336004820152602490fd5b906001600160a01b038083169081156120f4576133608361120e565b541661338881151594856133ca575b61337881611b09565b6001815401905561051f8561120e565b7fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a46133b257565b6040516339e3563760e11b81525f6004820152602490fd5b6133d38561352e565b6133dc83611b09565b80545f1901905561336f565b9081602091031261026b57516103348161046f565b6002545f8054600154604080516001600160a01b03968716602082015290810196909652606080870152608086018390526134689592949293831692909185911661344b8560a08101610f47565b604051632dd0b82b60e01b8152968795869485936004850161260d565b03925af1908115610fe45761033491610e94915f91613492575b50602080825183010191016133e8565b6134a691503d805f833e610fd581836105fa565b5f613482565b9081602091031261026b575161033481610259565b6001600160a01b039182168152911660208201526040810191909152608060608201819052610334929101906102fe565b3d1561351c573d90613503826108cb565b9161351160405193846105fa565b82523d5f602084013e565b606090565b6003811015611bb0571590565b61354c905f525f80516020613f5683398151915260205260405f2090565b80546001600160a01b0319169055565b9190805f526002830160205260405f20549283155f146135945761358f9293506001915f520160205260405f2054151590565b905f90565b505060019190565b8054821015611ba1575f5260205f2001905f90565b916135ca9183549060031b91821b915f19901b19161790565b9055565b5f82815260018201602052604090205461363157805490600160401b8210156105c7578261361c61360684600180960185558461359c565b819391549060031b91821b915f19901b19161790565b90558054925f520160205260405f2055600190565b50505f90565b60ff5f80516020613f768339815191525460401c161561365357565b604051631afcd79f60e31b8152600490fd5b601f8111613671575050565b5f80516020613eb68339815191525f527f37c58c799b6609234b945e882912ee9ad34948a1dfaa20a97485e1a7752bbf81906020601f840160051c830193106136d4575b601f0160051c01905b8181106136c9575050565b5f81556001016136be565b90915081906136b5565b601f81116136ea575050565b5f80516020613f968339815191525f527ff4bad0a69248f59680a4f2b3000328cec71a413447c96781cfe5996daa8c456e906020601f840160051c8301931061374d575b601f0160051c01905b818110613742575050565b5f8155600101613737565b909150819061372e565b9081516001600160401b0381116105c7575f80516020613f968339815191529061378a816137858454611ad1565b6136de565b602080601f83116001146137bb575081906135ca9394955f926121ad5750508160011b915f199060031b1c19161790565b90601f198316956137f95f80516020613f968339815191525f527ff4bad0a69248f59680a4f2b3000328cec71a413447c96781cfe5996daa8c456e90565b925f905b8882106138345750508360019596971061381c575b505050811b019055565b01515f1960f88460031b161c191690555f8080613812565b806001859682949686015181550195019301906137fd565b929092613857613637565b801580156138d0575b80156138bf575b80156138ae575b6125105760018060a01b038093816bffffffffffffffffffffffff60a01b961686600254161760025516845f5416175f5560015516906003541617600355565b506001600160a01b0382161561386e565b506001600160a01b03831615613867565b506001600160a01b03841615613860565b90805f526002820160205260405f205491818315918261391e575b5050613906575090565b6024906040519063015ab34360e11b82526004820152fd5b61393692506001915f520160205260405f2054151590565b15815f6138fc565b90604051918281549182825260209260208301915f5260205f20935f905b8282106139725750505061048b925003836105fa565b85548452600195860195889550938101939091019061395c565b9081518082526020808093019301915f5b8281106139ab575050505090565b83518552938101939281019260010161399d565b926139ee90602095926139fc9460018060a01b038092168752168686015260a0604086015260a085019061398c565b90838203606085015261398c565b9060808183039101525f81520190565b6001600160a01b039182168152911660208201526080604082018190529092915f91606091612573918601906102fe565b935f80949293613adc613a5e610e87613af9995f52600660205260405f2090565b600254909590613a76906001600160a01b0316610e94565b8454909690613ad0906001600160a01b031694613aad60015498604051958693631759616b60e11b602086015286602486016139bf565b0392613ac1601f19948581018352826105fa565b604051998a9360208501613a0c565b039081018752866105fa565b604051632dd0b82b60e01b815296879586948593600485016125d6565b03925af18015610fe457613b0a5750565b613b1d903d805f833e610fd581836105fa565b50565b925f9283613b3c610e87613af9975f52600660205260405f2090565b600254613adc90613b55906001600160a01b0316610e94565b8354600154604051632142170760e11b60208201526001600160a01b03868116602483015297881660448201526064810198909852919691951692613ad08260848101613aad565b92613af9935f8094613adc613bbc610e9460025460018060a01b031690565b83549095906001600160a01b031692613ad0613be6610e87600154985f52600660205260405f2090565b60405163a9059cbb60e01b60208201526001600160a01b03909316602484015260448301939093529091908260648101613aad565b90813b15613c9c575f80516020613f3683398151915280546001600160a01b0319166001600160a01b0384169081179091557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a2805115613c8157613b1d91613e3a565b505034613c8a57565b60405163b398979f60e01b8152600490fd5b604051634c9c8ce360e01b81526001600160a01b0383166004820152602490fd5b8054908115613ce6575f1991820191613cd6838361359c565b909182549160031b1b1916905555565b634e487b7160e01b5f52603160045260245ffd5b6001810191805f528260205260405f2054928315155f14613d9d575f199284840190858211611be5578054948501948511611be5575f958583613d5697613d499503613d5c575b505050613cbd565b905f5260205260405f2090565b55600190565b613d86613d8091613d70613d94948761359c565b90549060031b1c9283918761359c565b906135b1565b85905f5260205260405f2090565b555f8080613d41565b505050505f90565b935f80949293613adc613dc6610e87613af9995f52600660205260405f2090565b600254909590613dde906001600160a01b0316610e94565b8454600154604051637921219560e11b60208201526001600160a01b03808b16602483015296871660448201526064810194909452608484019790975260a060a48401525f60c48401529096931692613ad08260e48101613aad565b5f8061033493602081519101845af4613e516134f2565b9190613e795750805115613e6757805190602001fd5b60405163d6bda27560e01b8152600490fd5b81511580613eac575b613e8a575090565b604051639996b31560e01b81526001600160a01b039091166004820152602490fd5b50803b15613e8256fe80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab00793009016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c1993002b94cffad4d29b2c78fd738680ac969cac33a6bb64c5a932ca3b5f9e8bbbb28291b56cb67f018f242f3f7e29c0df2359def7f095072b5d2d1620993673c1796f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab0079304f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0080bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab0079301a26469706673582212204c8d26b647603f857ae5014296ceebffd1f14e4b125be5acd400db6bd3dcdb0e64736f6c63430008180033

0x60806040526004361015610011575f80fd5b5f3560e01c806301ffc9a71461025457806306fdde031461024f578063081812fc1461024a578063095ea7b3146102455780631765908c1461024057806323b872dd1461023b5780632564fbc6146102365780632567b99f1461023157806335aa8ef41461022c57806342842e0e146102275780634f1ef2861461022257806352d1902d1461021d5780636352211e1461021857806370a0823114610213578063710a9f681461020e5780637126581014610209578063715018a6146102045780637b29e30c146101ff5780638c64ea4a146101fa5780638da5cb5b146101f557806395d89b41146101f0578063a22cb465146101eb578063aa28fd95146101e6578063ad3cb1cc146101e1578063b88d4fde146101dc578063c7036629146101d7578063c87b56dd146101d2578063d8a06f73146101cd578063d91c4780146101c8578063d97f10cf146101c3578063e26b9ecf146101be578063e6c8e756146101b9578063e985e9c5146101b4578063f0c30dc9146101af578063f2fde38b146101aa5763f70bd6dd146101a5575f80fd5b611aa9565b611a7c565b611a55565b611a10565b611814565b611766565b6116da565b6115fe565b6115d6565b611585565b611568565b611512565b6114bb565b6113fe565b611362565b6112a1565b61126d565b61123b565b611134565b6110cd565b61100d565b610e22565b610dca565b610d9a565b610d31565b610bcc565b610ba5565b610b7d565b610ade565b61092c565b6108b4565b6107ac565b61048d565b610427565b610337565b61026f565b6001600160e01b031981160361026b57565b5f80fd5b3461026b57602036600319011261026b57602060043561028e81610259565b63ffffffff60e01b166380ac58cd60e01b81149081156102cc575b81156102bb575b506040519015158152f35b6301ffc9a760e01b1490505f6102b0565b635b5e139f60e01b811491506102a9565b5f5b8381106102ee5750505f910152565b81810151838201526020016102df565b90602091610317815180928185528580860191016102dd565b601f01601f1916010190565b9060206103349281815201906102fe565b90565b3461026b575f36600319011261026b576040515f5f80516020613eb683398151915280549061036582611ad1565b808552916020916001918281169081156103fa57506001146103a2575b61039e86610392818803826105fa565b60405191829182610323565b0390f35b5f90815293507f37c58c799b6609234b945e882912ee9ad34948a1dfaa20a97485e1a7752bbf815b8385106103e7575050505081016020016103928261039e5f610382565b80548686018401529382019381016103ca565b905086955061039e9693506020925061039294915060ff191682840152151560051b82010192935f610382565b3461026b57602036600319011261026b576004356104448161300b565b505f525f80516020613f56833981519152602052602060018060a01b0360405f205416604051908152f35b6001600160a01b0381160361026b57565b359061048b8261046f565b565b3461026b57604036600319011261026b576004356104aa8161046f565b602435906104b78261300b565b33151580610585575b80610558575b6105405761053e9261051f9181906001600160a01b0385811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f525f80516020613f5683398151915260205260405f2090565b80546001600160a01b0319166001600160a01b03909216919091179055565b005b60405163a9fbf51f60e01b8152336004820152602490fd5b5060ff61057d3361056884611b41565b9060018060a01b03165f5260205260405f2090565b5416156104c6565b506001600160a01b0381163314156104c0565b634e487b7160e01b5f52604160045260245ffd5b60c081019081106001600160401b038211176105c757604052565b610598565b6001600160401b0381116105c757604052565b602081019081106001600160401b038211176105c757604052565b90601f801991011681019081106001600160401b038211176105c757604052565b6040519061048b826105ac565b6040519060a082018281106001600160401b038211176105c757604052565b6001600160401b0381116105c75760051b60200190565b929161066982610647565b9161067760405193846105fa565b829481845260208094019160051b810192831161026b57905b82821061069d5750505050565b8135600381101561026b578152908301908301610690565b9080601f8301121561026b578160206103349335910161065e565b92916106db82610647565b916106e960405193846105fa565b829481845260208094019160051b810192831161026b57905b82821061070f5750505050565b838091833561071d8161046f565b815201910190610702565b9080601f8301121561026b57816020610334933591016106d0565b929161074e82610647565b9161075c60405193846105fa565b829481845260208094019160051b810192831161026b57905b8282106107825750505050565b81358152908301908301610775565b9080601f8301121561026b5781602061033493359101610743565b3461026b5760031960203682011261026b576004908135916001600160401b039182841161026b5760c090843603011261026b576107e861061b565b91838201358352602484013581811161026b5761080a908336918701016106b5565b6020840152604484013581811161026b5761082a90833691870101610728565b6040840152606484013581811161026b5761084a90833691870101610791565b6060840152608484013590811161026b5761053e9361087360a49261087e943691840101610791565b608085015201610480565b60a0820152611bf7565b606090600319011261026b576004356108a08161046f565b906024356108ad8161046f565b9060443590565b3461026b5761053e6108c536610888565b91611f90565b6001600160401b0381116105c757601f01601f191660200190565b81601f8201121561026b578035906108fd826108cb565b9261090b60405194856105fa565b8284526020838301011161026b57815f926020809301838601378301015290565b3461026b5760c036600319011261026b576024356109498161046f565b604435906109568261046f565b606435916109638361046f565b6001600160401b039260843584811161026b576109849036906004016108e6565b9060a43585811161026b5761099d9036906004016108e6565b925f80516020613f76833981519152549560ff8760401c1615961680159081610aa6575b6001149081610a9c575b159081610a93575b50610a81575f80516020613f76833981519152805467ffffffffffffffff19166001179055610a0a9486610a5d575b60043561210c565b610a1057005b5f80516020613f76833981519152805460ff60401b19169055604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29080602081015b0390a1005b5f80516020613f76833981519152805460ff60401b1916600160401b179055610a02565b60405163f92ee8a960e01b8152600490fd5b9050155f6109d3565b303b1591506109cb565b8791506109c1565b9181601f8401121561026b578235916001600160401b03831161026b576020808501948460051b01011161026b57565b3461026b57608036600319011261026b576001600160401b0360043581811161026b57610b0f903690600401610aae565b60249291923582811161026b57610b2a903690600401610aae565b60449491943584811161026b57610b45903690600401610aae565b9160643595861161026b5761039e96610b65610b6d973690600401610aae565b969095612251565b6040519081529081906020820190565b3461026b57604036600319011261026b5761053e602435610b9d8161046f565b6004356122ce565b3461026b5761053e610bb636610888565b9060405192610bc4846105df565b5f8452612e21565b604036600319011261026b576004803590610be68261046f565b6024356001600160401b03811161026b57610c0490369083016108e6565b6001600160a01b037f0000000000000000000000004d25a4b05cbbb19b00a1e69322b5156975e543fe8116308114908115610d16575b50610d05579060208392610c4c61330c565b6040516352d1902d60e01b8152938491829088165afa5f9281610cd4575b50610c98575050604051634c9c8ce360e01b81526001600160a01b0390921690820190815281906020010390fd5b83835f80516020613f368339815191528403610cb85761053e8383613c1b565b604051632a87526960e21b815290810184815281906020010390fd5b610cf791935060203d602011610cfe575b610cef81836105fa565b8101906132fd565b915f610c6a565b503d610ce5565b60405163703e46dd60e11b81528390fd5b9050815f80516020613f36833981519152541614155f610c3a565b3461026b575f36600319011261026b577f0000000000000000000000004d25a4b05cbbb19b00a1e69322b5156975e543fe6001600160a01b03163003610d885760206040515f80516020613f368339815191528152f35b60405163703e46dd60e11b8152600490fd5b3461026b57602036600319011261026b576020610db860043561300b565b6040516001600160a01b039091168152f35b3461026b57602036600319011261026b57600435610de78161046f565b6001600160a01b03811615610e0a57610e01602091611b09565b54604051908152f35b6040516322718ad960e21b81525f6004820152602490fd5b606036600319011261026b57602435600435610e3d8261046f565b604435916001600160401b0380841161026b573660238501121561026b57836004013590811161026b576024840193602482369201011161026b57610ea0610e94610e878561120e565b546001600160a01b031690565b6001600160a01b031690565b3303610ffb57610ee5610ee183610ebf865f52600860205260405f2090565b6001600160a01b039091165f9081526001919091016020526040902054151590565b1590565b610fe957600254610f7292905f908390610f07906001600160a01b0316610e94565b8254879084906001600160a01b0316610f558b610f47610f35610e87600154975f52600660205260405f2090565b6040519889938c349360208701612542565b03601f1981018752866105fa565b604051632dd0b82b60e01b815298899586948593600485016125d6565b03925af1928315610fe4577f687656bcdc248e32bf17a5e7f71e8ad6f00fe0671f9414acaeccc0ed017f90f193610fc2575b50610fbd60405192839260018060a01b0316968361264f565b0390a3005b610fdd903d805f833e610fd581836105fa565b810190612578565b505f610fa4565b612644565b604051630d37d89f60e21b8152600490fd5b60405163144390cb60e21b8152600490fd5b3461026b57608036600319011261026b576001600160401b0360243581811161026b5761103e903690600401610aae565b9060443583811161026b57611057903690600401610aae565b9260643585811161026b57611070903690600401610aae565b9190926040519560a0870197878910908911176105c7576110a56110bd966110b19461053e9a6040526004358a5236916106d0565b60208801523691610743565b60408501523691610743565b6060820152336080820152612ac5565b3461026b575f36600319011261026b576110e561330c565b5f80516020613ed683398151915280546001600160a01b031981169091555f906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b3461026b5760031960203682011261026b5760048035906001600160401b039283831161026b5760c090833603011261026b5761116f61061b565b908281013584811161026b5761118a908236918601016106b5565b8252602483013584811161026b576111a790823691860101610728565b6020830152604483013584811161026b576111c790823691860101610791565b6040830152606483013593841161026b5760a4610b6d936111f361039e96611204943691840101610791565b606085015261087360848201610480565b60a0820152612660565b5f527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab007930260205260405f2090565b3461026b57602036600319011261026b576004355f526006602052602060018060a01b0360405f205416604051908152f35b3461026b575f36600319011261026b575f80516020613ed6833981519152546040516001600160a01b039091168152602090f35b3461026b575f36600319011261026b576040515f5f80516020613f968339815191528054906112cf82611ad1565b808552916020916001918281169081156103fa57506001146112fb5761039e86610392818803826105fa565b5f90815293507ff4bad0a69248f59680a4f2b3000328cec71a413447c96781cfe5996daa8c456e5b838510611340575050505081016020016103928261039e5f610382565b8054868601840152938201938101611323565b60443590811515820361026b57565b3461026b57604036600319011261026b5760043561137f8161046f565b60243580151580910361026b576001600160a01b0382169182156113e5576113aa9061056833611b41565b60ff1981541660ff83161790556040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b604051630b61174360e31b815260048101849052602490fd5b3461026b5760031960203682011261026b576004356001600160401b039182821161026b5760a090823603011261026b57611437610628565b9080600401358252602481013583811161026b5761145b9060043691840101610728565b6020830152604481013583811161026b5761147c9060043691840101610791565b6040830152606481013592831161026b5760846114b1916114a661053e9560043691840101610791565b606085015201610480565b6080820152612ac5565b3461026b575f36600319011261026b5760405160408101908082106001600160401b038311176105c75761039e9160405260058152640352e302e360dc1b60208201526040519182916020835260208301906102fe565b3461026b57608036600319011261026b5760043561152f8161046f565b60243561153b8161046f565b606435916001600160401b03831161026b5761155e61053e9336906004016108e6565b9160443591612e21565b3461026b57602036600319011261026b5761053e336004356122ce565b3461026b57602036600319011261026b576115a160043561300b565b505f6040516115af816105df565b5261039e6040516115bf816105df565b5f81526040519182916020835260208301906102fe565b3461026b575f36600319011261026b576003546040516001600160a01b039091168152602090f35b3461026b57602036600319011261026b5760043561161b8161046f565b335f52600960205260405f2060ff61164383839060018060a01b03165f5260205260405f2090565b54166116b9576001600160a01b0382165f908152602091909152604090207f88a0e868b628b6ffa05ecd3d19ee5edbecda74126c3e9c072d23366e1f6c655191610a5891805460ff19166001908117909155604080516001600160a01b0390931683523360208401528201529081906060820190565b604051637afff29560e11b81526001600160a01b0383166004820152602490fd5b3461026b5760a036600319011261026b576001600160401b0360243581811161026b5761170b903690600401610aae565b9060443583811161026b57611724903690600401610aae565b9060643585811161026b5761173d903690600401610aae565b92909160843596871161026b5761175b61053e973690600401610aae565b969095600435612f25565b3461026b57602036600319011261026b576004356117838161046f565b335f52600960205260405f2060ff6117ab83839060018060a01b03165f5260205260405f2090565b5416156116b9576001600160a01b03919091165f81815260209283526040808220805460ff1916905580519283523393830193909352918101919091527f88a0e868b628b6ffa05ecd3d19ee5edbecda74126c3e9c072d23366e1f6c6551908060608101610a58565b3461026b57608036600319011261026b5760048035602435611834611353565b6064356118408161046f565b611852845f52600860205260405f2090565b9161185c8361393e565b93845180156119fe5790919392946118738261229c565b9161187d8161229c565b936118878261229c565b96611890610628565b998a5260208a019485526040808b0196875260608b019889526001600160a01b0390991660808b01525f965f995f955b8587106118f55761053e8d8d8d8d8d8d8051908251938551966118e7575b50525252612ac5565b8083528085528652886118de565b909192939495986119166119098b84611b8d565b516001600160a01b031690565b61193a61192c6001600160a01b038316876138e1565b5f52600760205260405f2090565b9061194e611949835460ff1690565b613521565b156119c257918c6119b2826119ab61199d8c8f600360019a996119898c9b61197a896119979651611b8d565b6001600160a01b039091169052565b015f805260205260405f2090565b54612f87565b670de0b6b3a7640000900490565b9251611b8d565b5201995b019594939291906118c0565b505097969594938093929c9b50999899155f146119e9578b5163244109df60e21b81528d90fd5b6001809c92939495969798999a9b9c9b6119b6565b604051634ec4810560e11b8152600490fd5b3461026b57604036600319011261026b57602060ff611a49600435611a348161046f565b61056860243591611a448361046f565b611b41565b54166040519015158152f35b3461026b575f36600319011261026b575f546040516001600160a01b039091168152602090f35b3461026b57602036600319011261026b5761053e600435611a9c8161046f565b611aa461330c565b612f9a565b3461026b575f36600319011261026b576002546040516001600160a01b039091168152602090f35b90600182811c92168015611aff575b6020831014611aeb57565b634e487b7160e01b5f52602260045260245ffd5b91607f1691611ae0565b6001600160a01b03165f9081527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab00793036020526040902090565b6001600160a01b03165f9081527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab00793056020526040902090565b634e487b7160e01b5f52603260045260245ffd5b8051821015611ba15760209160051b010190565b611b79565b60031115611bb057565b634e487b7160e01b5f52602160045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b91908201809211611be557565b611bc4565b516003811015611bb05790565b8051611c08610e94610e878361120e565b3303610ffb5760a08201516001600160a01b039290831691903383141580611f5f575b611f475760208101938451519485158015611f38575b8015611f29575b8015611f1a575b6119fe575f5b868110611c655750505050505050565b6001905f80516020613f16833981519152856040611d968a611c8d6119098785870151611b8d565b92888c611cad896080611ca48260608c0151611b8d565b51990151611b8d565b5193818d898c611ccf8b611cca8b985f52600860205260405f2090565b613064565b9790611e3c57611d12969750611cf760016005540180600555805f52600760205260405f2091565b8d611d0d889a939a5f52600860205260405f2090565b613202565b50611d26611d21838351611b8d565b611bea565b611d2f81611ba6565b611d9f5750505060039285611d589593611d4b938c1690613168565b805460ff19168155611989565b555b518b81526001600160a01b03808e1660208301525f60408301529093166060840152608083019390935260a082019290925290819060c0820190565b0390a101611c55565b611db49296949395975090611d219151611b8d565b92611dbe84611ba6565b878a8f8096145f14611df65786915092611df09792611dde941690613109565b805460ff191660011781555b016135ce565b50611d5a565b94611e1482988897938860039897611e2797611e369c97169061307b565b835460ff191660021784555b83016135ce565b5001905f5260205260405f2090565b55611d5a565b50505050919092611e55905f52600760205260405f2090565b918d89611e63855460ff1690565b611e6c81611ba6565b80611e9a575050936003939261198992611e88968b1690613168565b611e93838254611bd8565b9055611d5a565b9350939190611ea884611ba6565b878e8095145f14611ec657509484611dea92611df0978c1690613109565b85611ed893611e8898938d169061307b565b826003820192611ef08285905f5260205260405f2090565b5415611f07575b505050905f5260205260405f2090565b611f1192016135ce565b505f8281611ef7565b50608083015151861415611c4f565b50606083015151861415611c48565b50604083015151861415611c41565b6040516319fb741b60e21b8152336004820152602490fd5b50611f8b610ee1611f84336105688760018060a01b03165f52600960205260405f2090565b5460ff1690565b611c2b565b6001600160a01b039082821680156120f457849083611fae8361120e565b54169433151580612052575b50611fde9086612034575b611fce81611b09565b6001815401905561051f8461120e565b847fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4169182820361201157505050565b60649350604051926364283d7b60e01b8452600484015260248301526044820152fd5b61203d8461352e565b61204687611b09565b80545f19019055611fc5565b91925090806120aa575b1561206a579085915f611fba565b858561208a57604051637e27328960e01b81526004810191909152602490fd5b60405163177e802f60e01b81523360048201526024810191909152604490fd5b5033851480156120dd575b8061205c5750855f525f80516020613f56833981519152602052338460405f2054161461205c565b5060ff6120ed3361056888611b41565b54166120b5565b604051633250574960e11b81525f6004820152602490fd5b9091929395949561211b613637565b61212433612f9a565b61212c613637565b612134613637565b80516001600160401b0381116105c7575f80516020613eb683398151915291612166826121618554611ad1565b613665565b602090816001601f8511146121b857508261048b999a936121a895936121a1935f926121ad575b50508160011b915f199060031b1c19161790565b9055613757565b61384c565b015190505f8061218d565b5f80516020613eb68339815191525f529190601f1984167f37c58c799b6609234b945e882912ee9ad34948a1dfaa20a97485e1a7752bbf81935f905b82821061223957505092600192859261048b9c9d966121a8989610612221575b505050811b019055613757565b01515f1960f88460031b161c191690555f8080612214565b806001869782949787015181550196019401906121f4565b946110a56110b193610334999561227d612286999a98959a6040519b6122768d6105ac565b369161065e565b8a5236916106d0565b60608201523360808201523360a0820152612660565b906122a682610647565b6122b360405191826105fa565b82815280926122c4601f1991610647565b0190602036910137565b906122de610e94610e878461120e565b3303610ffb576001600160a01b038116156125105761230d612308835f52600860205260405f2090565b61393e565b9081519182156119fe575f5b83811061232d575050505061048b9061325b565b61233a6119098284611b8d565b61235861192c82612353895f52600860205260405f2090565b613224565b805460ff1661236681611ba6565b806123fb57506123f2600193926123bd61239860035f80516020613ef683398151915295015f805260205260405f2090565b546123b4836123af8d5f52600860205260405f2090565b613237565b5088838c613b9d565b604080518a81526001600160a01b03808a166020830152909216908201525f60608201819052608082015290819060a0820190565b0390a101612319565b9061240582611ba6565b6001918203612479578161243091612429856123af8c5f52600860205260405f2090565b500161393e565b8051905f5b82811061245a5750505050905f80516020613ef68339815191526123f26001936123bd565b806124738b8a8861246c899688611b8d565b5192613b20565b01612435565b90612490836123af8a5f52600860205260405f2090565b5061249c81830161393e565b9081516124a88161229c565b936003015f5b8281106124e05750505050826124db5f80516020613ef6833981519152936123f29389600198978d613a3d565b6123bd565b806124fe6124ef869388611b8d565b5184905f5260205260405f2090565b546125098289611b8d565b52016124ae565b60405163bd28cf5f60e01b8152600490fd5b908060209392818452848401375f828201840152601f01601f1916010190565b6001600160a01b03918216815291166020820152608060408201819052909493926060926125739287019190612522565b930152565b60208183031261026b578051906001600160401b03821161026b570181601f8201121561026b5780516125aa816108cb565b926125b860405194856105fa565b8184526020828401011161026b5761033491602080850191016102dd565b6001600160a01b03909116815260208101919091526348d4e6d760e01b6040820152608060608201819052610334929101906102fe565b6001600160a01b0390911681526020810191909152635d6c45e760e01b6040820152608060608201819052610334929101906102fe565b6040513d5f823e3d90fd5b916020610334938181520191612522565b60808101516001600160a01b031660a08201516001600160a01b03166001600160a01b0391818316156125105733838216141580612a9b575b611f47576004916126ac60045460010190565b946126b686600455565b6126c08683613344565b6003916126f56126e3610e94896126de60035460018060a01b031690565b6133fd565b61051f895f52600660205260405f2090565b8151519485158015612a8c575b8015612a7d575b8015612a6e575b6119fe575f5b86811061272857505050505050505090565b8784612738611d21848351611b8d565b612749611909856020850151611b8d565b908c8a88604093612763896060611ca482898c0151611b8d565b519761276e82611ba6565b81612873575050505082610ebf61278d925f52600860205260405f2090565b61284e57612845845f80516020613f16833981519152948f93948f8e96848f612806908f948b60019f9e6127c39289168d613168565b896127f8611d0d886127e760016005540180600555805f52600760205260405f2091565b9290945f52600860205260405f2090565b50805460ff19168155611989565b555b519586526001600160a01b039687166020870152861660408601529094166060840152608083019390935260a082019290925290819060c0820190565b0390a101612716565b516321ffeae760e11b81526001600160a01b0390911681860190815281906020010390fd5b612885829a999693949895979a611ba6565b8d60018093145f1461292d57509284928a926128bb8a612845985f80516020613f168339815191529c9b9a9860019f168b613109565b846128d285611cca8b5f52600860205260405f2090565b929061291857612912925089612901611d0d886127e760016005540180600555805f52600760205260405f2091565b50805460ff19166001178155611dea565b50612808565b611dea612912935f52600760205260405f2090565b919088878761293e938e168b61307b565b6129548a611cca895f52600860205260405f2090565b906129cc5750928492866129c6858d958b60019f6128459b5f80516020613f168339815191529f9e9d9b6129b5611d0d611e27946129a460016005540180600555805f52600760205260405f2091565b9290975f52600860205260405f2090565b50835460ff19166002178455611e20565b55612808565b929598999650939650506129e991505f52600760205260405f2090565b908a820191612a008684905f5260205260405f2090565b54612a4257948f93948a8e96896129c68561284598612a3460019f9e9983905f80516020613f168339815191529f016135ce565b50905f5260205260405f2090565b8351630cd2552960e41b81526001600160a01b038616818b019081526020810188905281906040010390fd5b50606083015151861415612710565b50604083015151861415612709565b50602083015151861415612702565b50612ac0610ee1611f84336105688560018060a01b03165f52600960205260405f2090565b612699565b8051612ad6610e94610e878361120e565b3303610ffb5760808201516001600160a01b03169081156125105760208301918251519283158015612e12575b8015612e03575b6119fe575f5b848110612b1f57505050505050565b612b2d611909828451611b8d565b90612b4482611cca875f52600860205260405f2090565b9015610fe957612b5c905f52600760205260405f2090565b805460ff16612b6a81611ba6565b80612c7957506003612b808360608b0151611b8d565b51910190612b95825f805260205260405f2090565b548111612c6757600193612be98a92612bda85612bc75f80516020613ef6833981519152975f805260205260405f2090565b8381540390555f805260205260405f2090565b5415612c4b575b88838b613b9d565b612c426040612c0a866060612c018285890151611b8d565b51960151611b8d565b5190518a81526001600160a01b03808b16602083015290931660408401526060830193909352608082019290925290819060a0820190565b0390a101612b10565b612c61836123af8c5f52600860205260405f2090565b50612be1565b604051631df4d38160e01b8152600490fd5b612c8581949394611ba6565b6001908103612d0c57604090612c9e85838c0151611b8d565b51920190612caf610ee18484613cfa565b612cfc575060019392612cdb5f80516020613ef6833981519152938b935415612ce0575b88838b613b20565b612be9565b612cf6836123af8c5f52600860205260405f2090565b50612cd3565b5163fdb30af560e01b8152600490fd5b90604091612d1d85848c0151611b8d565b5191612d2d8660608d0151611b8d565b519360038201612d458582905f5260205260405f2090565b548611612df25790612d7e85838f99989796959482612d6b91905f5260205260405f2090565b888154039055905f5260205260405f2090565b5415612dcc575b50925f80516020613ef68339815191529492612cdb926001989795015415612db0575b89848c613da5565b612dc6846123af8d5f52600860205260405f2090565b50612da8565b90919293949550612de2610ee185858501613cfa565b612cfc57908b9594939291612d85565b8151631df4d38160e01b8152600490fd5b50606085015151841415612b0a565b50604085015151841415612b03565b91929092612e30818585611f90565b833b612e3d575b50505050565b612e62916020916040519384928392630a85bd0160e11b9788855233600486016134c1565b03815f6001600160a01b0388165af15f9181612ef4575b50612eb85782612e876134f2565b8051919082612eb157604051633250574960e11b81526001600160a01b0383166004820152602490fd5b9050602001fd5b6001600160e01b03191603612ed157505f808080612e37565b604051633250574960e11b81526001600160a01b03919091166004820152602490fd5b612f1791925060203d602011612f1e575b612f0f81836105fa565b8101906134ac565b905f612e79565b503d612f05565b612f6b9361048b9995612f53612f779994612f4a9b9996612f5f956040519d8e6105ac565b8d52369161065e565b60208b015236916106d0565b60408801523691610743565b60608501523691610743565b60808201523360a0820152611bf7565b81810292918115918404141715611be557565b6001600160a01b03908116908115612ff3575f80516020613ed683398151915280546001600160a01b031981168417909155167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3565b604051631e4fbdf760e01b81525f6004820152602490fd5b5f8181527f80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab007930260205260409020546001600160a01b031690811561304c575090565b60249060405190637e27328960e01b82526004820152fd5b613077916001600160a01b03169061355c565b9091565b5f908152600660205260409020549293926001600160a01b039182169116813b1561026b57604051637921219560e11b81526001600160a01b039485166004820152931660248401526044830191909152606482019290925260a060848201525f60a482018190529091829081838160c481015b03925af18015610fe4576131005750565b61048b906105cc565b5f908152600660205260409020546001600160a01b0390811693929116803b1561026b57604051632142170760e11b81526001600160a01b03938416600482015293909216602484015260448301525f908290818381606481016130ef565b5f9081526006602090815260408083205490516323b872dd60e01b8184019081526001600160a01b03978816602483015291871660448201526064808201969096529485529294939092906131be6084826105fa565b519082865af115612644575f513d6131f957508082163b155b6131df575050565b604051635274afe760e01b81529116600482015260249150fd5b600114156131d7565b610334929160018060a01b031691825f526002820160205260405f20556135ce565b610334916001600160a01b0316906138e1565b6001600160a01b039091165f81815260028301602052604081205561033491613cfa565b6001600160a01b0361326c8261120e565b5416815f82159283156132bc575b6132838361120e565b80546001600160a01b03191690557fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8280a461304c5750565b6132da835f525f80516020613f5683398151915260205260405f2090565b80546001600160a01b03191690556132f181611b09565b8219815401905561327a565b9081602091031261026b575190565b5f80516020613ed6833981519152546001600160a01b0316330361332c57565b60405163118cdaa760e01b8152336004820152602490fd5b906001600160a01b038083169081156120f4576133608361120e565b541661338881151594856133ca575b61337881611b09565b6001815401905561051f8561120e565b7fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a46133b257565b6040516339e3563760e11b81525f6004820152602490fd5b6133d38561352e565b6133dc83611b09565b80545f1901905561336f565b9081602091031261026b57516103348161046f565b6002545f8054600154604080516001600160a01b03968716602082015290810196909652606080870152608086018390526134689592949293831692909185911661344b8560a08101610f47565b604051632dd0b82b60e01b8152968795869485936004850161260d565b03925af1908115610fe45761033491610e94915f91613492575b50602080825183010191016133e8565b6134a691503d805f833e610fd581836105fa565b5f613482565b9081602091031261026b575161033481610259565b6001600160a01b039182168152911660208201526040810191909152608060608201819052610334929101906102fe565b3d1561351c573d90613503826108cb565b9161351160405193846105fa565b82523d5f602084013e565b606090565b6003811015611bb0571590565b61354c905f525f80516020613f5683398151915260205260405f2090565b80546001600160a01b0319169055565b9190805f526002830160205260405f20549283155f146135945761358f9293506001915f520160205260405f2054151590565b905f90565b505060019190565b8054821015611ba1575f5260205f2001905f90565b916135ca9183549060031b91821b915f19901b19161790565b9055565b5f82815260018201602052604090205461363157805490600160401b8210156105c7578261361c61360684600180960185558461359c565b819391549060031b91821b915f19901b19161790565b90558054925f520160205260405f2055600190565b50505f90565b60ff5f80516020613f768339815191525460401c161561365357565b604051631afcd79f60e31b8152600490fd5b601f8111613671575050565b5f80516020613eb68339815191525f527f37c58c799b6609234b945e882912ee9ad34948a1dfaa20a97485e1a7752bbf81906020601f840160051c830193106136d4575b601f0160051c01905b8181106136c9575050565b5f81556001016136be565b90915081906136b5565b601f81116136ea575050565b5f80516020613f968339815191525f527ff4bad0a69248f59680a4f2b3000328cec71a413447c96781cfe5996daa8c456e906020601f840160051c8301931061374d575b601f0160051c01905b818110613742575050565b5f8155600101613737565b909150819061372e565b9081516001600160401b0381116105c7575f80516020613f968339815191529061378a816137858454611ad1565b6136de565b602080601f83116001146137bb575081906135ca9394955f926121ad5750508160011b915f199060031b1c19161790565b90601f198316956137f95f80516020613f968339815191525f527ff4bad0a69248f59680a4f2b3000328cec71a413447c96781cfe5996daa8c456e90565b925f905b8882106138345750508360019596971061381c575b505050811b019055565b01515f1960f88460031b161c191690555f8080613812565b806001859682949686015181550195019301906137fd565b929092613857613637565b801580156138d0575b80156138bf575b80156138ae575b6125105760018060a01b038093816bffffffffffffffffffffffff60a01b961686600254161760025516845f5416175f5560015516906003541617600355565b506001600160a01b0382161561386e565b506001600160a01b03831615613867565b506001600160a01b03841615613860565b90805f526002820160205260405f205491818315918261391e575b5050613906575090565b6024906040519063015ab34360e11b82526004820152fd5b61393692506001915f520160205260405f2054151590565b15815f6138fc565b90604051918281549182825260209260208301915f5260205f20935f905b8282106139725750505061048b925003836105fa565b85548452600195860195889550938101939091019061395c565b9081518082526020808093019301915f5b8281106139ab575050505090565b83518552938101939281019260010161399d565b926139ee90602095926139fc9460018060a01b038092168752168686015260a0604086015260a085019061398c565b90838203606085015261398c565b9060808183039101525f81520190565b6001600160a01b039182168152911660208201526080604082018190529092915f91606091612573918601906102fe565b935f80949293613adc613a5e610e87613af9995f52600660205260405f2090565b600254909590613a76906001600160a01b0316610e94565b8454909690613ad0906001600160a01b031694613aad60015498604051958693631759616b60e11b602086015286602486016139bf565b0392613ac1601f19948581018352826105fa565b604051998a9360208501613a0c565b039081018752866105fa565b604051632dd0b82b60e01b815296879586948593600485016125d6565b03925af18015610fe457613b0a5750565b613b1d903d805f833e610fd581836105fa565b50565b925f9283613b3c610e87613af9975f52600660205260405f2090565b600254613adc90613b55906001600160a01b0316610e94565b8354600154604051632142170760e11b60208201526001600160a01b03868116602483015297881660448201526064810198909852919691951692613ad08260848101613aad565b92613af9935f8094613adc613bbc610e9460025460018060a01b031690565b83549095906001600160a01b031692613ad0613be6610e87600154985f52600660205260405f2090565b60405163a9059cbb60e01b60208201526001600160a01b03909316602484015260448301939093529091908260648101613aad565b90813b15613c9c575f80516020613f3683398151915280546001600160a01b0319166001600160a01b0384169081179091557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a2805115613c8157613b1d91613e3a565b505034613c8a57565b60405163b398979f60e01b8152600490fd5b604051634c9c8ce360e01b81526001600160a01b0383166004820152602490fd5b8054908115613ce6575f1991820191613cd6838361359c565b909182549160031b1b1916905555565b634e487b7160e01b5f52603160045260245ffd5b6001810191805f528260205260405f2054928315155f14613d9d575f199284840190858211611be5578054948501948511611be5575f958583613d5697613d499503613d5c575b505050613cbd565b905f5260205260405f2090565b55600190565b613d86613d8091613d70613d94948761359c565b90549060031b1c9283918761359c565b906135b1565b85905f5260205260405f2090565b555f8080613d41565b505050505f90565b935f80949293613adc613dc6610e87613af9995f52600660205260405f2090565b600254909590613dde906001600160a01b0316610e94565b8454600154604051637921219560e11b60208201526001600160a01b03808b16602483015296871660448201526064810194909452608484019790975260a060a48401525f60c48401529096931692613ad08260e48101613aad565b5f8061033493602081519101845af4613e516134f2565b9190613e795750805115613e6757805190602001fd5b60405163d6bda27560e01b8152600490fd5b81511580613eac575b613e8a575090565b604051639996b31560e01b81526001600160a01b039091166004820152602490fd5b50803b15613e8256fe80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab00793009016d09d72d40fdae2fd8ceac6b6234c7706214fd39c1cd1e609a0528c1993002b94cffad4d29b2c78fd738680ac969cac33a6bb64c5a932ca3b5f9e8bbbb28291b56cb67f018f242f3f7e29c0df2359def7f095072b5d2d1620993673c1796f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc80bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab0079304f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0080bb2b638cc20bc4d0a60d66940f3ab4a00c1d7b313497ca82fb0b4ab0079301a26469706673582212204c8d26b647603f857ae5014296ceebffd1f14e4b125be5acd400db6bd3dcdb0e64736f6c63430008180033