// File: lib/openzeppelin-contracts/contracts/access/Ownable.sol



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

pragma solidity ^0.8.0;

import "../utils/Context.sol";

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

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

    /**
     * @dev Initializes the contract setting the deployer as the initial owner.
     */
    constructor() {
        _transferOwnership(_msgSender());
    }

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

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

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions anymore. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby removing 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 {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _transferOwnership(newOwner);
    }

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

// File: lib/openzeppelin-contracts/contracts/interfaces/IERC721.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (interfaces/IERC721.sol)

pragma solidity ^0.8.0;

import "../token/ERC721/IERC721.sol";

// File: lib/openzeppelin-contracts/contracts/token/ERC721/ERC721.sol



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

pragma solidity ^0.8.0;

import "./IERC721.sol";
import "./IERC721Receiver.sol";
import "./extensions/IERC721Metadata.sol";
import "../../utils/Address.sol";
import "../../utils/Context.sol";
import "../../utils/Strings.sol";
import "../../utils/introspection/ERC165.sol";

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

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    // Mapping from token ID to owner address
    mapping(uint256 => address) private _owners;

    // Mapping owner address to token count
    mapping(address => uint256) private _balances;

    // Mapping from token ID to approved address
    mapping(uint256 => address) private _tokenApprovals;

    // Mapping from owner to operator approvals
    mapping(address => mapping(address => bool)) private _operatorApprovals;

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

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

    /**
     * @dev See {IERC721-balanceOf}.
     */
    function balanceOf(address owner) public view virtual override returns (uint256) {
        require(owner != address(0), "ERC721: address zero is not a valid owner");
        return _balances[owner];
    }

    /**
     * @dev See {IERC721-ownerOf}.
     */
    function ownerOf(uint256 tokenId) public view virtual override returns (address) {
        address owner = _ownerOf(tokenId);
        require(owner != address(0), "ERC721: invalid token ID");
        return owner;
    }

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

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

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

        string memory baseURI = _baseURI();
        return bytes(baseURI).length > 0 ? string(abi.encodePacked(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 override {
        address owner = ERC721.ownerOf(tokenId);
        require(to != owner, "ERC721: approval to current owner");

        require(
            _msgSender() == owner || isApprovedForAll(owner, _msgSender()),
            "ERC721: approve caller is not token owner or approved for all"
        );

        _approve(to, tokenId);
    }

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

        return _tokenApprovals[tokenId];
    }

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

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

    /**
     * @dev See {IERC721-transferFrom}.
     */
    function transferFrom(address from, address to, uint256 tokenId) public virtual override {
        //solhint-disable-next-line max-line-length
        require(_isApprovedOrOwner(_msgSender(), tokenId), "ERC721: caller is not token owner or approved");

        _transfer(from, to, tokenId);
    }

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

    /**
     * @dev See {IERC721-safeTransferFrom}.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes memory data) public virtual override {
        require(_isApprovedOrOwner(_msgSender(), tokenId), "ERC721: caller is not token owner or approved");
        _safeTransfer(from, to, tokenId, data);
    }

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients
     * are aware of the ERC721 protocol 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 equivalent to {safeTransferFrom}, and can be used to e.g.
     * implement alternative mechanisms to perform token transfer, such as signature-based.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - 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, bytes memory data) internal virtual {
        _transfer(from, to, tokenId);
        require(_checkOnERC721Received(from, to, tokenId, data), "ERC721: transfer to non ERC721Receiver implementer");
    }

    /**
     * @dev Returns the owner of the `tokenId`. Does NOT revert if token doesn't exist
     */
    function _ownerOf(uint256 tokenId) internal view virtual returns (address) {
        return _owners[tokenId];
    }

    /**
     * @dev Returns whether `tokenId` exists.
     *
     * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}.
     *
     * Tokens start existing when they are minted (`_mint`),
     * and stop existing when they are burned (`_burn`).
     */
    function _exists(uint256 tokenId) internal view virtual returns (bool) {
        return _ownerOf(tokenId) != address(0);
    }

    /**
     * @dev Returns whether `spender` is allowed to manage `tokenId`.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function _isApprovedOrOwner(address spender, uint256 tokenId) internal view virtual returns (bool) {
        address owner = ERC721.ownerOf(tokenId);
        return (spender == owner || isApprovedForAll(owner, spender) || getApproved(tokenId) == spender);
    }

    /**
     * @dev Safely mints `tokenId` and transfers it to `to`.
     *
     * 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 virtual {
        _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);
        require(
            _checkOnERC721Received(address(0), to, tokenId, data),
            "ERC721: transfer to non ERC721Receiver implementer"
        );
    }

    /**
     * @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 virtual {
        require(to != address(0), "ERC721: mint to the zero address");
        require(!_exists(tokenId), "ERC721: token already minted");

        _beforeTokenTransfer(address(0), to, tokenId, 1);

        // Check that tokenId was not minted by `_beforeTokenTransfer` hook
        require(!_exists(tokenId), "ERC721: token already minted");

        unchecked {
            // Will not overflow unless all 2**256 token ids are minted to the same owner.
            // Given that tokens are minted one by one, it is impossible in practice that
            // this ever happens. Might change if we allow batch minting.
            // The ERC fails to describe this case.
            _balances[to] += 1;
        }

        _owners[tokenId] = to;

        emit Transfer(address(0), to, tokenId);

        _afterTokenTransfer(address(0), to, tokenId, 1);
    }

    /**
     * @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 virtual {
        address owner = ERC721.ownerOf(tokenId);

        _beforeTokenTransfer(owner, address(0), tokenId, 1);

        // Update ownership in case tokenId was transferred by `_beforeTokenTransfer` hook
        owner = ERC721.ownerOf(tokenId);

        // Clear approvals
        delete _tokenApprovals[tokenId];

        unchecked {
            // Cannot overflow, as that would require more tokens to be burned/transferred
            // out than the owner initially received through minting and transferring in.
            _balances[owner] -= 1;
        }
        delete _owners[tokenId];

        emit Transfer(owner, address(0), tokenId);

        _afterTokenTransfer(owner, address(0), tokenId, 1);
    }

    /**
     * @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 virtual {
        require(ERC721.ownerOf(tokenId) == from, "ERC721: transfer from incorrect owner");
        require(to != address(0), "ERC721: transfer to the zero address");

        _beforeTokenTransfer(from, to, tokenId, 1);

        // Check that tokenId was not transferred by `_beforeTokenTransfer` hook
        require(ERC721.ownerOf(tokenId) == from, "ERC721: transfer from incorrect owner");

        // Clear approvals from the previous owner
        delete _tokenApprovals[tokenId];

        unchecked {
            // `_balances[from]` cannot overflow for the same reason as described in `_burn`:
            // `from`'s balance is the number of token held, which is at least one before the current
            // transfer.
            // `_balances[to]` could overflow in the conditions described in `_mint`. That would require
            // all 2**256 token ids to be minted, which in practice is impossible.
            _balances[from] -= 1;
            _balances[to] += 1;
        }
        _owners[tokenId] = to;

        emit Transfer(from, to, tokenId);

        _afterTokenTransfer(from, to, tokenId, 1);
    }

    /**
     * @dev Approve `to` to operate on `tokenId`
     *
     * Emits an {Approval} event.
     */
    function _approve(address to, uint256 tokenId) internal virtual {
        _tokenApprovals[tokenId] = to;
        emit Approval(ERC721.ownerOf(tokenId), to, tokenId);
    }

    /**
     * @dev Approve `operator` to operate on all of `owner` tokens
     *
     * Emits an {ApprovalForAll} event.
     */
    function _setApprovalForAll(address owner, address operator, bool approved) internal virtual {
        require(owner != operator, "ERC721: approve to caller");
        _operatorApprovals[owner][operator] = approved;
        emit ApprovalForAll(owner, operator, approved);
    }

    /**
     * @dev Reverts if the `tokenId` has not been minted yet.
     */
    function _requireMinted(uint256 tokenId) internal view virtual {
        require(_exists(tokenId), "ERC721: invalid token ID");
    }

    /**
     * @dev Internal function to invoke {IERC721Receiver-onERC721Received} on a target address.
     * The call is not executed if the target address is not a contract.
     *
     * @param from address representing the previous owner of the given token ID
     * @param to target address that will receive the tokens
     * @param tokenId uint256 ID of the token to be transferred
     * @param data bytes optional data to send along with the call
     * @return bool whether the call correctly returned the expected magic value
     */
    function _checkOnERC721Received(
        address from,
        address to,
        uint256 tokenId,
        bytes memory data
    ) private returns (bool) {
        if (to.isContract()) {
            try IERC721Receiver(to).onERC721Received(_msgSender(), from, tokenId, data) returns (bytes4 retval) {
                return retval == IERC721Receiver.onERC721Received.selector;
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    revert("ERC721: transfer to non ERC721Receiver implementer");
                } else {
                    /// @solidity memory-safe-assembly
                    assembly {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        } else {
            return true;
        }
    }

    /**
     * @dev Hook that is called before any token transfer. This includes minting and burning. If {ERC721Consecutive} is
     * used, the hook may be called as part of a consecutive (batch) mint, as indicated by `batchSize` greater than 1.
     *
     * Calling conditions:
     *
     * - When `from` and `to` are both non-zero, ``from``'s tokens will be transferred to `to`.
     * - When `from` is zero, the tokens will be minted for `to`.
     * - When `to` is zero, ``from``'s tokens will be burned.
     * - `from` and `to` are never both zero.
     * - `batchSize` is non-zero.
     *
     * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
     */
    function _beforeTokenTransfer(
        address from,
        address to,
        uint256 /* firstTokenId */,
        uint256 batchSize
    ) internal virtual {
        if (batchSize > 1) {
            if (from != address(0)) {
                _balances[from] -= batchSize;
            }
            if (to != address(0)) {
                _balances[to] += batchSize;
            }
        }
    }

    /**
     * @dev Hook that is called after any token transfer. This includes minting and burning. If {ERC721Consecutive} is
     * used, the hook may be called as part of a consecutive (batch) mint, as indicated by `batchSize` greater than 1.
     *
     * Calling conditions:
     *
     * - When `from` and `to` are both non-zero, ``from``'s tokens were transferred to `to`.
     * - When `from` is zero, the tokens were minted for `to`.
     * - When `to` is zero, ``from``'s tokens were burned.
     * - `from` and `to` are never both zero.
     * - `batchSize` is non-zero.
     *
     * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
     */
    function _afterTokenTransfer(address from, address to, uint256 firstTokenId, uint256 batchSize) internal virtual {}
}

// File: lib/openzeppelin-contracts/contracts/token/ERC721/extensions/IERC721Metadata.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC721/extensions/IERC721Metadata.sol)

pragma solidity ^0.8.0;

import "../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);
}

// File: lib/openzeppelin-contracts/contracts/token/ERC721/IERC721.sol



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

pragma solidity ^0.8.0;

import "../../utils/introspection/IERC165.sol";

/**
 * @dev Required interface of an ERC721 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 ERC721 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 ERC721
     * 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 caller.
     *
     * Emits an {ApprovalForAll} event.
     */
    function setApprovalForAll(address operator, bool approved) external;

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

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

// File: lib/openzeppelin-contracts/contracts/token/ERC721/IERC721Receiver.sol



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

pragma solidity ^0.8.0;

/**
 * @title ERC721 token receiver interface
 * @dev Interface for any contract that wants to support safeTransfers
 * from ERC721 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);
}

// File: lib/openzeppelin-contracts/contracts/utils/Address.sol



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

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     *
     * Furthermore, `isContract` will also return true if the target contract within
     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,
     * which only has an effect at the end of a transaction.
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

    /**
     * @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.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        require(address(this).balance >= amount, "Address: insufficient balance");

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

    /**
     * @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, it is bubbled up by this
     * function (like regular Solidity function calls).
     *
     * 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.
     *
     * _Available since v3.1._
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, "Address: low-level call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @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`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

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

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

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

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    function _revert(bytes memory returndata, string memory errorMessage) 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
            /// @solidity memory-safe-assembly
            assembly {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert(errorMessage);
        }
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/Context.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

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

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

// File: lib/openzeppelin-contracts/contracts/utils/cryptography/MerkleProof.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates merkle trees that are safe
 * against this attack out of the box.
 */
library MerkleProof {
    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Calldata version of {verify}
     *
     * _Available since v4.7._
     */
    function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProofCalldata(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leafs & pre-images are assumed to be sorted.
     *
     * _Available since v4.4._
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Calldata version of {processProof}
     *
     * _Available since v4.7._
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Calldata version of {multiProofVerify}
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * _Available since v4.7._
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Calldata version of {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proof.length - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/introspection/ERC165.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol)

pragma solidity ^0.8.0;

import "./IERC165.sol";

/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC165 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);
 * }
 * ```
 *
 * Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation.
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/introspection/IERC165.sol



// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[EIP].
 *
 * 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[EIP 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);
}

// File: lib/openzeppelin-contracts/contracts/utils/math/Math.sol



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

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

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

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return 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 up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

    /**
     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0
     * @dev 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^256 and mod 2^256 - 1, then use
            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2^256 + prod0.
            uint256 prod0; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod0 := mul(x, y)
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1, "Math: mulDiv 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.

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            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^256 / 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^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            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^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // 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^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, 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;
        }
    }

    /**
     * @notice 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) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice 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 + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 128;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 64;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 32;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 16;
            }
            if (value >> 8 > 0) {
                value >>= 8;
                result += 8;
            }
            if (value >> 4 > 0) {
                value >>= 4;
                result += 4;
            }
            if (value >> 2 > 0) {
                value >>= 2;
                result += 2;
            }
            if (value >> 1 > 0) {
                result += 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 + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10, rounded down, of a positive value.
     * 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 + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * 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;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 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 + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0);
        }
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/math/SignedMath.sol



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

pragma solidity ^0.8.0;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return 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 {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

// File: lib/openzeppelin-contracts/contracts/utils/Strings.sol



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

pragma solidity ^0.8.0;

import "./math/Math.sol";
import "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant _SYMBOLS = "0123456789abcdef";
    uint8 private constant _ADDRESS_LENGTH = 20;

    /**
     * @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;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), _SYMBOLS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toString(int256 value) internal pure returns (string memory) {
        return string(abi.encodePacked(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) {
        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] = _SYMBOLS[value & 0xf];
            value >>= 4;
        }
        require(value == 0, "Strings: hex length insufficient");
        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 Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

// File: lib/solady/src/utils/Base64.sol



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

/// @notice Library to encode strings in Base64.
/// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/Base64.sol)
/// @author Modified from Solmate (https://github.com/transmissions11/solmate/blob/main/src/utils/Base64.sol)
/// @author Modified from (https://github.com/Brechtpd/base64/blob/main/base64.sol) by Brecht Devos - <brecht@loopring.org>.
library Base64 {
    /// @dev Encodes `data` using the base64 encoding described in RFC 4648.
    /// See: https://datatracker.ietf.org/doc/html/rfc4648
    /// @param fileSafe  Whether to replace '+' with '-' and '/' with '_'.
    /// @param noPadding Whether to strip away the padding.
    function encode(bytes memory data, bool fileSafe, bool noPadding)
        internal
        pure
        returns (string memory result)
    {
        /// @solidity memory-safe-assembly
        assembly {
            let dataLength := mload(data)

            if dataLength {
                // Multiply by 4/3 rounded up.
                // The `shl(2, ...)` is equivalent to multiplying by 4.
                let encodedLength := shl(2, div(add(dataLength, 2), 3))

                // Set `result` to point to the start of the free memory.
                result := mload(0x40)

                // Store the table into the scratch space.
                // Offsetted by -1 byte so that the `mload` will load the character.
                // We will rewrite the free memory pointer at `0x40` later with
                // the allocated size.
                // The magic constant 0x0670 will turn "-_" into "+/".
                mstore(0x1f, "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdef")
                mstore(0x3f, xor("ghijklmnopqrstuvwxyz0123456789-_", mul(iszero(fileSafe), 0x0670)))

                // Skip the first slot, which stores the length.
                let ptr := add(result, 0x20)
                let end := add(ptr, encodedLength)

                // Run over the input, 3 bytes at a time.
                for {} 1 {} {
                    data := add(data, 3) // Advance 3 bytes.
                    let input := mload(data)

                    // Write 4 bytes. Optimized for fewer stack operations.
                    mstore8(0, mload(and(shr(18, input), 0x3F)))
                    mstore8(1, mload(and(shr(12, input), 0x3F)))
                    mstore8(2, mload(and(shr(6, input), 0x3F)))
                    mstore8(3, mload(and(input, 0x3F)))
                    mstore(ptr, mload(0x00))

                    ptr := add(ptr, 4) // Advance 4 bytes.
                    if iszero(lt(ptr, end)) { break }
                }
                mstore(0x40, add(end, 0x20)) // Allocate the memory.
                // Equivalent to `o = [0, 2, 1][dataLength % 3]`.
                let o := div(2, mod(dataLength, 3))
                // Offset `ptr` and pad with '='. We can simply write over the end.
                mstore(sub(ptr, o), shl(240, 0x3d3d))
                // Set `o` to zero if there is padding.
                o := mul(iszero(iszero(noPadding)), o)
                mstore(sub(ptr, o), 0) // Zeroize the slot after the string.
                mstore(result, sub(encodedLength, o)) // Store the length.
            }
        }
    }

    /// @dev Encodes `data` using the base64 encoding described in RFC 4648.
    /// Equivalent to `encode(data, false, false)`.
    function encode(bytes memory data) internal pure returns (string memory result) {
        result = encode(data, false, false);
    }

    /// @dev Encodes `data` using the base64 encoding described in RFC 4648.
    /// Equivalent to `encode(data, fileSafe, false)`.
    function encode(bytes memory data, bool fileSafe)
        internal
        pure
        returns (string memory result)
    {
        result = encode(data, fileSafe, false);
    }

    /// @dev Decodes base64 encoded `data`.
    ///
    /// Supports:
    /// - RFC 4648 (both standard and file-safe mode).
    /// - RFC 3501 (63: ',').
    ///
    /// Does not support:
    /// - Line breaks.
    ///
    /// Note: For performance reasons,
    /// this function will NOT revert on invalid `data` inputs.
    /// Outputs for invalid inputs will simply be undefined behaviour.
    /// It is the user's responsibility to ensure that the `data`
    /// is a valid base64 encoded string.
    function decode(string memory data) internal pure returns (bytes memory result) {
        /// @solidity memory-safe-assembly
        assembly {
            let dataLength := mload(data)

            if dataLength {
                let decodedLength := mul(shr(2, dataLength), 3)

                for {} 1 {} {
                    // If padded.
                    if iszero(and(dataLength, 3)) {
                        let t := xor(mload(add(data, dataLength)), 0x3d3d)
                        // forgefmt: disable-next-item
                        decodedLength := sub(
                            decodedLength,
                            add(iszero(byte(30, t)), iszero(byte(31, t)))
                        )
                        break
                    }
                    // If non-padded.
                    decodedLength := add(decodedLength, sub(and(dataLength, 3), 1))
                    break
                }
                result := mload(0x40)

                // Write the length of the bytes.
                mstore(result, decodedLength)

                // Skip the first slot, which stores the length.
                let ptr := add(result, 0x20)
                let end := add(ptr, decodedLength)

                // Load the table into the scratch space.
                // Constants are optimized for smaller bytecode with zero gas overhead.
                // `m` also doubles as the mask of the upper 6 bits.
                let m := 0xfc000000fc00686c7074787c8084888c9094989ca0a4a8acb0b4b8bcc0c4c8cc
                mstore(0x5b, m)
                mstore(0x3b, 0x04080c1014181c2024282c3034383c4044484c5054585c6064)
                mstore(0x1a, 0xf8fcf800fcd0d4d8dce0e4e8ecf0f4)

                for {} 1 {} {
                    // Read 4 bytes.
                    data := add(data, 4)
                    let input := mload(data)

                    // Write 3 bytes.
                    // forgefmt: disable-next-item
                    mstore(ptr, or(
                        and(m, mload(byte(28, input))),
                        shr(6, or(
                            and(m, mload(byte(29, input))),
                            shr(6, or(
                                and(m, mload(byte(30, input))),
                                shr(6, mload(byte(31, input)))
                            ))
                        ))
                    ))
                    ptr := add(ptr, 3)
                    if iszero(lt(ptr, end)) { break }
                }
                mstore(0x40, add(end, 0x20)) // Allocate the memory.
                mstore(end, 0) // Zeroize the slot after the bytes.
                mstore(0x60, 0) // Restore the zero slot.
            }
        }
    }
}

// File: lib/solady/src/utils/LibZip.sol



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

/// @notice Library for compressing and decompressing bytes.
/// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/LibZip.sol)
/// @author Calldata compression by clabby (https://github.com/clabby/op-kompressor)
/// @author FastLZ by ariya (https://github.com/ariya/FastLZ)
///
/// @dev Note:
/// The accompanying solady.js library includes implementations of
/// FastLZ and calldata operations for convenience.
library LibZip {
    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                     FAST LZ OPERATIONS                     */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    // LZ77 implementation based on FastLZ.
    // Equivalent to level 1 compression and decompression at the following commit:
    // https://github.com/ariya/FastLZ/commit/344eb4025f9ae866ebf7a2ec48850f7113a97a42
    // Decompression is backwards compatible.

    /// @dev Returns the compressed `data`.
    function flzCompress(bytes memory data) internal pure returns (bytes memory result) {
        /// @solidity memory-safe-assembly
        assembly {
            function ms8(d_, v_) -> _d {
                mstore8(d_, v_)
                _d := add(d_, 1)
            }
            function u24(p_) -> _u {
                let w := mload(p_)
                _u := or(shl(16, byte(2, w)), or(shl(8, byte(1, w)), byte(0, w)))
            }
            function cmp(p_, q_, e_) -> _l {
                for { e_ := sub(e_, q_) } lt(_l, e_) { _l := add(_l, 1) } {
                    e_ := mul(iszero(byte(0, xor(mload(add(p_, _l)), mload(add(q_, _l))))), e_)
                }
            }
            function literals(runs_, src_, dest_) -> _o {
                for { _o := dest_ } iszero(lt(runs_, 0x20)) { runs_ := sub(runs_, 0x20) } {
                    mstore(ms8(_o, 31), mload(src_))
                    _o := add(_o, 0x21)
                    src_ := add(src_, 0x20)
                }
                if iszero(runs_) { leave }
                mstore(ms8(_o, sub(runs_, 1)), mload(src_))
                _o := add(1, add(_o, runs_))
            }
            function match(l_, d_, o_) -> _o {
                for { d_ := sub(d_, 1) } iszero(lt(l_, 263)) { l_ := sub(l_, 262) } {
                    o_ := ms8(ms8(ms8(o_, add(224, shr(8, d_))), 253), and(0xff, d_))
                }
                if iszero(lt(l_, 7)) {
                    _o := ms8(ms8(ms8(o_, add(224, shr(8, d_))), sub(l_, 7)), and(0xff, d_))
                    leave
                }
                _o := ms8(ms8(o_, add(shl(5, l_), shr(8, d_))), and(0xff, d_))
            }
            function setHash(i_, v_) {
                let p := add(mload(0x40), shl(2, i_))
                mstore(p, xor(mload(p), shl(224, xor(shr(224, mload(p)), v_))))
            }
            function getHash(i_) -> _h {
                _h := shr(224, mload(add(mload(0x40), shl(2, i_))))
            }
            function hash(v_) -> _r {
                _r := and(shr(19, mul(2654435769, v_)), 0x1fff)
            }
            function setNextHash(ip_, ipStart_) -> _ip {
                setHash(hash(u24(ip_)), sub(ip_, ipStart_))
                _ip := add(ip_, 1)
            }
            codecopy(mload(0x40), codesize(), 0x8000) // Zeroize the hashmap.
            let op := add(mload(0x40), 0x8000)
            let a := add(data, 0x20)
            let ipStart := a
            let ipLimit := sub(add(ipStart, mload(data)), 13)
            for { let ip := add(2, a) } lt(ip, ipLimit) {} {
                let r := 0
                let d := 0
                for {} 1 {} {
                    let s := u24(ip)
                    let h := hash(s)
                    r := add(ipStart, getHash(h))
                    setHash(h, sub(ip, ipStart))
                    d := sub(ip, r)
                    if iszero(lt(ip, ipLimit)) { break }
                    ip := add(ip, 1)
                    if iszero(gt(d, 0x1fff)) { if eq(s, u24(r)) { break } }
                }
                if iszero(lt(ip, ipLimit)) { break }
                ip := sub(ip, 1)
                if gt(ip, a) { op := literals(sub(ip, a), a, op) }
                let l := cmp(add(r, 3), add(ip, 3), add(ipLimit, 9))
                op := match(l, d, op)
                ip := setNextHash(setNextHash(add(ip, l), ipStart), ipStart)
                a := ip
            }
            op := literals(sub(add(ipStart, mload(data)), a), a, op)
            result := mload(0x40)
            let t := add(result, 0x8000)
            let n := sub(op, t)
            mstore(result, n) // Store the length.
            // Copy the result to compact the memory, overwriting the hashmap.
            let o := add(result, 0x20)
            for { let i } lt(i, n) { i := add(i, 0x20) } { mstore(add(o, i), mload(add(t, i))) }
            mstore(add(o, n), 0) // Zeroize the slot after the string.
            mstore(0x40, add(add(o, n), 0x20)) // Allocate the memory.
        }
    }

    /// @dev Returns the decompressed `data`.
    function flzDecompress(bytes memory data) internal pure returns (bytes memory result) {
        /// @solidity memory-safe-assembly
        assembly {
            let n := 0
            let end := add(add(data, 0x20), mload(data))
            result := mload(0x40)
            let op := add(result, 0x20)
            for { data := add(data, 0x20) } lt(data, end) {} {
                let w := mload(data)
                let c := byte(0, w)
                let t := shr(5, c)
                if iszero(t) {
                    mstore(add(op, n), mload(add(data, 1)))
                    data := add(data, add(2, c))
                    n := add(n, add(1, c))
                    continue
                }
                let g := eq(t, 7)
                let l := add(2, xor(t, mul(g, xor(t, add(7, byte(1, w))))))
                for {
                    let s := add(add(shl(8, and(0x1f, c)), byte(add(1, g), w)), 1)
                    let r := add(op, sub(n, s))
                    let o := add(op, n)
                    let f := xor(s, mul(gt(s, 0x20), xor(s, 0x20)))
                    let j := 0
                } 1 {} {
                    mstore(add(o, j), mload(add(r, j)))
                    j := add(j, f)
                    if iszero(lt(j, l)) { break }
                }
                data := add(data, add(2, g))
                n := add(n, l)
            }
            mstore(result, n) // Store the length.
            let o := add(add(result, 0x20), n)
            mstore(o, 0) // Zeroize the slot after the string.
            mstore(0x40, add(o, 0x20)) // Allocate the memory.
        }
    }

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                    CALLDATA OPERATIONS                     */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    // Calldata compression and decompression using selective run length encoding:
    // - Sequences of 0x00 (up to 128 consecutive).
    // - Sequences of 0xff (up to 32 consecutive).
    //
    // A run length encoded block consists of two bytes:
    // (0) 0x00
    // (1) A control byte with the following bit layout:
    //     - [7]     `0: 0x00, 1: 0xff`.
    //     - [0..6]  `runLength - 1`.
    //
    // The first 4 bytes are bitwise negated so that the compressed calldata
    // can be dispatched into the `fallback` and `receive` functions.

    /// @dev Returns the compressed `data`.
    function cdCompress(bytes memory data) internal pure returns (bytes memory result) {
        /// @solidity memory-safe-assembly
        assembly {
            function rle(v_, o_, d_) -> _o, _d {
                mstore(o_, shl(240, or(and(0xff, add(d_, 0xff)), and(0x80, v_))))
                _o := add(o_, 2)
            }
            result := mload(0x40)
            let o := add(result, 0x20)
            let z := 0 // Number of consecutive 0x00.
            let y := 0 // Number of consecutive 0xff.
            for { let end := add(data, mload(data)) } iszero(eq(data, end)) {} {
                data := add(data, 1)
                let c := byte(31, mload(data))
                if iszero(c) {
                    if y { o, y := rle(0xff, o, y) }
                    z := add(z, 1)
                    if eq(z, 0x80) { o, z := rle(0x00, o, 0x80) }
                    continue
                }
                if eq(c, 0xff) {
                    if z { o, z := rle(0x00, o, z) }
                    y := add(y, 1)
                    if eq(y, 0x20) { o, y := rle(0xff, o, 0x20) }
                    continue
                }
                if y { o, y := rle(0xff, o, y) }
                if z { o, z := rle(0x00, o, z) }
                mstore8(o, c)
                o := add(o, 1)
            }
            if y { o, y := rle(0xff, o, y) }
            if z { o, z := rle(0x00, o, z) }
            // Bitwise negate the first 4 bytes.
            mstore(add(result, 4), not(mload(add(result, 4))))
            mstore(result, sub(o, add(result, 0x20))) // Store the length.
            mstore(o, 0) // Zeroize the slot after the string.
            mstore(0x40, add(o, 0x20)) // Allocate the memory.
        }
    }

    /// @dev Returns the decompressed `data`.
    function cdDecompress(bytes memory data) internal pure returns (bytes memory result) {
        /// @solidity memory-safe-assembly
        assembly {
            if mload(data) {
                result := mload(0x40)
                let o := add(result, 0x20)
                let s := add(data, 4)
                let v := mload(s)
                let end := add(data, mload(data))
                mstore(s, not(v)) // Bitwise negate the first 4 bytes.
                for {} lt(data, end) {} {
                    data := add(data, 1)
                    let c := byte(31, mload(data))
                    if iszero(c) {
                        data := add(data, 1)
                        let d := byte(31, mload(data))
                        // Fill with either 0xff or 0x00.
                        mstore(o, not(0))
                        if iszero(gt(d, 0x7f)) { codecopy(o, codesize(), add(d, 1)) }
                        o := add(o, add(and(d, 0x7f), 1))
                        continue
                    }
                    mstore8(o, c)
                    o := add(o, 1)
                }
                mstore(s, v) // Restore the first 4 bytes.
                mstore(result, sub(o, add(result, 0x20))) // Store the length.
                mstore(o, 0) // Zeroize the slot after the string.
                mstore(0x40, add(o, 0x20)) // Allocate the memory.
            }
        }
    }

    /// @dev To be called in the `receive` and `fallback` functions.
    /// ```
    ///     receive() external payable { LibZip.cdFallback(); }
    ///     fallback() external payable { LibZip.cdFallback(); }
    /// ```
    /// For efficiency, this function will directly return the results, terminating the context.
    /// If called internally, it must be called at the end of the function.
    function cdFallback() internal {
        assembly {
            if iszero(calldatasize()) { return(calldatasize(), calldatasize()) }
            let o := 0
            let f := not(3) // For negating the first 4 bytes.
            for { let i := 0 } lt(i, calldatasize()) {} {
                let c := byte(0, xor(add(i, f), calldataload(i)))
                i := add(i, 1)
                if iszero(c) {
                    let d := byte(0, xor(add(i, f), calldataload(i)))
                    i := add(i, 1)
                    // Fill with either 0xff or 0x00.
                    mstore(o, not(0))
                    if iszero(gt(d, 0x7f)) { codecopy(o, codesize(), add(d, 1)) }
                    o := add(o, add(and(d, 0x7f), 1))
                    continue
                }
                mstore8(o, c)
                o := add(o, 1)
            }
            let success := delegatecall(gas(), address(), 0x00, o, codesize(), 0x00)
            returndatacopy(0x00, 0x00, returndatasize())
            if iszero(success) { revert(0x00, returndatasize()) }
            return(0x00, returndatasize())
        }
    }
}

// File: src/ChoreoLibrary.sol



pragma solidity ^0.8.17;

import "lib/openzeppelin-contracts/contracts/utils/Strings.sol";
import "lib/openzeppelin-contracts/contracts/access/Ownable.sol";
import "lib/solady/src/utils/Base64.sol";
import {ChoreoLibraryConfig} from "src/ChoreoLibraryConfig.sol";

contract ChoreoLibrary is Ownable, ChoreoLibraryConfig {
    using Strings for uint16;

    mapping(uint8 => MovementStruct) public movements;
    mapping(AttributesEnum => TextOverlay) public attributes;
    mapping(AttributeValuesEnum => mapping(uint8 => TextOverlay))
        public attributeValues;

    function setMovementWidth(uint8 movement, uint16 width) external onlyOwner {
        movements[movement].width = width;
    }

    function loadMovement(
        uint8 movement,
        uint16 width,
        bytes calldata svg
    ) external onlyOwner {
        movements[movement].svg = svg;
        movements[movement].width = width;
    }

    function setAttributeSize(
        AttributesEnum attr,
        uint16 width,
        uint16 height
    ) external onlyOwner {
        attributes[attr].width = width;
        attributes[attr].height = height;
    }

    function loadattributes(
        AttributesEnum attr,
        uint16 height,
        uint16 width,
        bytes calldata svg
    ) external onlyOwner {
        attributes[attr] = TextOverlay({
            svg: svg,
            width: width,
            height: height
        });
    }

    function setAttributeValueSize(
        AttributeValuesEnum attr,
        uint8 valueId,
        uint16 width,
        uint16 height
    ) external onlyOwner {
        attributeValues[attr][valueId].width = width;
        attributeValues[attr][valueId].height = height;
    }

    function loadattributeValues(
        AttributeValuesEnum attr,
        uint16 height,
        uint16 width,
        uint8[] calldata valueIds,
        bytes[] calldata svgs
    ) external onlyOwner {
        // require arrays are same length
        require(valueIds.length == svgs.length, "Arrays must be same length");
        uint16 svgsLength = uint16(svgs.length);
        for (uint16 i = 0; i < svgsLength; i++) {
            attributeValues[attr][valueIds[i]] = TextOverlay({
                svg: svgs[i],
                width: width,
                height: height
            });
        }
    }
}

// File: src/ChoreoLibraryConfig.sol



pragma solidity ^0.8.17;

interface ChoreoLibraryConfig {

    struct ChoreographyParams {
        uint8[] tokenHashArray;
        uint8[] sequence;
        uint8[] pauseFrames;
        uint8[] tempo;
        uint8[] params;
    }

    struct TextOverlay {
        bytes svg;
        uint16 width;
        uint16 height;
    }

    struct MovementStruct {
        uint16 width;
        bytes svg;
    }

    struct CanvasStruct {
        uint16 scale;
        uint16 maxWidth;
    }

    enum AttributesEnum {
        Stamp,
        Header,
        FooterTitle,
        FooterSubtitle,
        FooterStage,
        FooterSequenceLength,
        FooterPerformers,
        FooterShare,
        FooterClimate,
        FooterABHash,
        FooterSigBone,
        FooterVuln,
        FooterHeartDist,
        FooterChoreoHash,
        TempoDouble,
        TempoHalf,
        SideView,
        Pause,
        VulnerableStamp
    }
    enum AttributeValuesEnum {
        Numeric,
        Alphabetic,
        Symbolic,
        StageOptions,
        ShareOptions,
        ClimateOptions,
        SigBoneOptions,
        VulnOptions,
        NumericSmall,
        SequenceOptions,
        MovementOverlayOptions
    }
}

// File: src/ChoreoScoreV2.sol



pragma solidity ^0.8.17;

import {ERC721} from "lib/openzeppelin-contracts/contracts/token/ERC721/ERC721.sol";
import {IERC721} from "lib/openzeppelin-contracts/contracts/interfaces/IERC721.sol";
import {Strings} from "lib/openzeppelin-contracts/contracts/utils/Strings.sol";
import {Ownable} from "lib/openzeppelin-contracts/contracts/access/Ownable.sol";
import {MerkleProof} from "lib/openzeppelin-contracts/contracts/utils/cryptography/MerkleProof.sol";
import {Base64} from "lib/solady/src/utils/Base64.sol";
import {ChoreoLibrary} from "./ChoreoLibrary.sol";
import {ChoreoLibraryConfig} from "src/ChoreoLibraryConfig.sol";
import {LibZip} from "lib/solady/src/utils/LibZip.sol";
import {IChoreoScore} from "src/IChoreoScore.sol";

contract ChoreoScoreV2 is IChoreoScore, Ownable {
    using Strings for uint256;
    using Strings for uint16;
    using Strings for uint8;
    using LibZip for bytes;

    enum ChoreoParamsEnum {
        Climate,
        Stage,
        Performers,
        Share,
        SignatureBone,
        Vulnerability,
        HeartTravel,
        HeartTravelMantissa,
        Invert
    }

    address public choreoNft;

    uint256 public safeRenderGas = 350000000; // Most tokens are less but use this to default to backup

    string private _backupBaseUri;

    function setBackupBaseURI(string memory uri) external onlyOwner {
        _backupBaseUri = uri;
    }

    function setChoreoNft(address choreoNft_) external onlyOwner {
        choreoNft = choreoNft_;
    }

    function setDescriptions(string[] memory _descriptions) external onlyOwner {
        require(_descriptions.length == 2);
        descriptions[0] = _descriptions[0];
        descriptions[1] = _descriptions[1];
    }

    function setSafeRenderGas(uint256 _safeRenderGas) external onlyOwner {
        safeRenderGas = _safeRenderGas;
    }

    string[2] public descriptions = [
        "Choreographic score detailing the underlying movement sequence that created Human Unreadable #",
        unicode". The score should be read from top to bottom and left to right. The uncovering of this choreographic score is part of Act II of Human Unreadable, an experiential journey of slowly recovering within Operator’s Privacy Collection. Human Unreadable unfolds in three acts while merging performance, cryptography, blockchain, and generative art into an experience that began on Art Blocks and ends in a live performance. Lot 03 (2023). operator.la/human-unreadable"
    ];

    string[6] public climateNames = [
        "Just heard bad news",
        "Relaxed",
        "Some clouds",
        "On edge",
        "Current",
        "Your crush responded"
    ];

    string[3] public vulnerabilityNames = [
        "Guarded",
        "Door cracked open",
        "Vulnerable"
    ];

    string[5] public orientationNames = [
        "",
        "North", // Starts at 1
        "South",
        "East",
        "West"
    ];

    string[11] public boneNames = [
        "", // Don't show N/A
        "Head",
        "L_Ankle",
        "L_Elbow",
        "L_Foot",
        "L_Knee",
        "L_Shoulder",
        "L_Wrist",
        "R_Ankle",
        "R_Shoulder",
        "R_Wrist"
    ];

    uint8 constant _DECIMAL_SYMBOL = 17;
    uint8 constant _OCTOTHORPE_SYMBOL = 19;
    uint8 constant _METERS_SYMBOL = 18;
    uint8 constant _PAUSE_SYMBOL = 3;

    /** Render Constants**/
    uint256 constant _SEQUENCE_CANVAS_WIDTH_BASE = 915;
    uint256 constant _BASE_MOVEMENT_HEIGHT = 142;
    uint256 constant _MOVEMENT_CANVAS_HEIGHT = 980;

    uint256 constant _SCALE_RES = 1000;
    uint256 constant _SCALE_MIN = 700;

    /** Render Configuration**/
    ChoreoLibrary _choreoLibrary;

    constructor(ChoreoLibrary choreoLibrary_) {
        _choreoLibrary = choreoLibrary_;
    }

    function _renderBackupSvgUri(
        uint256 tokenId
    ) internal view returns (string memory) {
        return
            string(
                abi.encodePacked(_backupBaseUri, tokenId.toString(), ".svg")
            );
    }

    function renderTokenURI(
        uint256 tokenId,
        ChoreographyParams memory choreoToRender
    ) public view returns (string memory) {
        require(msg.sender == choreoNft, "Only ChoreoNFT can render");
        uint256 gasStart = gasleft();
        string memory name = string(
            abi.encodePacked(
                "Human Unreadable: Choreographic Score ",
                (tokenId % 1000).toString()
            )
        );
        string memory image;
        if (gasStart >= safeRenderGas) {
            image = string(
                abi.encodePacked(
                    "data:image/svg+xml;base64,",
                    Base64.encode(bytes(_generateSVG(tokenId, choreoToRender)))
                )
            );
        } else {
            // If caller has not supplied enough gas return external render reference
            image = _renderBackupSvgUri(tokenId);
        }

        string memory render = string(
            abi.encodePacked(
                "data:application/json;base64,",
                Base64.encode(
                    bytes(
                        abi.encodePacked(
                            '{"name":"',
                            name,
                            '", "description": "',
                            descriptions[0],
                            (tokenId % 1000).toString(),
                            descriptions[1],
                            '","external_url":"https://www.operator.la/human-unreadable", "attributes": ',
                            _getAttributes(choreoToRender),
                            ', "image": "',
                            image,
                            '"}'
                        )
                    )
                )
            )
        );
        return render;
    }

    function _formatHeartDistance(
        ChoreographyParams memory choreoToRender
    ) internal pure returns (string memory) {
        uint8 mantissa = choreoToRender.params[
            uint8(ChoreoParamsEnum.HeartTravelMantissa)
        ];
        string memory mantissaStr = mantissa < 10
            ? string(abi.encodePacked("0", mantissa.toString()))
            : mantissa.toString();

        return
            string(
                abi.encodePacked(
                    choreoToRender
                        .params[uint8(ChoreoParamsEnum.HeartTravel)]
                        .toString(),
                    ".",
                    mantissaStr
                )
            );
    }

    function _hasShare(
        ChoreographyParams memory choreoToRender
    ) internal pure returns (bool) {
        return
            choreoToRender.params[uint8(ChoreoParamsEnum.Performers)] > 0 &&
            choreoToRender.params[uint8(ChoreoParamsEnum.Share)] == 1;
    }

    function _hasPause(
        ChoreographyParams memory choreoToRender
    ) internal pure returns (bool) {
        for (uint i = 0; i < choreoToRender.pauseFrames.length; i++) {
            if (choreoToRender.pauseFrames[i] != 0) {
                return true;
            }
        }
        return false;
    }

    function _hasImprovisation(
        ChoreographyParams memory choreoToRender
    ) internal pure returns (bool) {
        for (uint i = 0; i < choreoToRender.sequence.length; i++) {
            if (choreoToRender.sequence[i] == 0) {
                return true;
            }
        }
        return false;
    }

    function _getAttributes(
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        string[] memory parts = new string[](25);

        parts[
            0
        ] = '[{"trait_type": "Sequence Length", "display_type": "number", "value": ';
        parts[1] = choreoToRender.sequence.length.toString();
        parts[2] = '},{"trait_type": "Emotional Climate", "value": "';
        parts[3] = climateNames[
            choreoToRender.params[uint8(ChoreoParamsEnum.Climate)]
        ];
        parts[4] = '"},{"trait_type": "Improv", "value": "';
        parts[5] = _hasImprovisation(choreoToRender) ? "Present" : "Absent";
        parts[6] = '"},{"trait_type": "Pause", "value": "';
        parts[7] = _hasPause(choreoToRender) ? "Yes" : "No";
        if (choreoToRender.params[uint8(ChoreoParamsEnum.SignatureBone)] != 0) {
            parts[8] = '"},{"trait_type": "Signature Bone", "value": "';
            parts[9] = boneNames[
                choreoToRender.params[uint8(ChoreoParamsEnum.SignatureBone)]
            ];
        } else {
            parts[8] = "";
            parts[9] = "";
        }
        parts[10] = '"},{"trait_type": "Vulnerability", "value": "';

        parts[11] = vulnerabilityNames[
            choreoToRender.params[uint8(ChoreoParamsEnum.Vulnerability)]
        ];
        parts[12] = '"},{"trait_type": "Stage Front", "value": "';
        parts[13] = orientationNames[
            choreoToRender.params[uint8(ChoreoParamsEnum.Stage)]
        ];
        parts[
            14
        ] = '"},{"trait_type": "Simultaneous Performers", "display_type": "number", "value": ';
        parts[15] = choreoToRender
            .params[uint8(ChoreoParamsEnum.Performers)]
            .toString();
        parts[16] = '},{"trait_type": "Share Sequence", "value": "';
        parts[17] = _hasShare(choreoToRender) ? "Yes" : "No";
        parts[
            18
        ] = '"},{"trait_type": "Distance of Heart Travel", "display_type": "number", "value": ';
        parts[19] = _formatHeartDistance(choreoToRender);
        parts[20] = '},{"trait_type": "Privacy Enabled", "value": "';
        parts[21] = choreoToRender.params[uint8(ChoreoParamsEnum.Invert)] == 1
            ? "Yes"
            : "No";
        parts[22] = '"},{"trait_type": "Choreographic Hash", "value": "';
        parts[23] = _joinSequence(choreoToRender.sequence);
        parts[24] = '"}]';
        string memory result = parts[0];
        for (uint i = 1; i < parts.length; i++) {
            result = string(abi.encodePacked(result, parts[i]));
        }

        return result;
    }

    function _joinSequence(
        uint8[] memory arr
    ) internal pure returns (string memory tmp) {
        for (uint256 index = 0; index < arr.length; index++) {
            string memory value = arr[index] == 0 ? "i" : arr[index].toString();
            tmp = index < (arr.length - 1)
                ? string(abi.encodePacked(tmp, value, "-"))
                : string(abi.encodePacked(tmp, value));
        }
    }

    function _generateSVG(
        uint256 tokenId,
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        bool invert = _isInverted(choreoToRender);
        string memory svg = string(
            abi.encodePacked(
                '<svg xmlns="http://www.w3.org/2000/svg" width="915" height="1220"> <rect width="100%" height="100%" fill=',
                invert ? '"black"/>' : '"white"/>',
                "<defs> <style> .difference { mix-blend-mode: difference; } ",
                invert // half tempo classes
                    ? '.st0{stroke:#fff;stroke-width:0.2;stroke-miterlimit:10;}.st1{fill:#000;stroke:#fff;stroke-width:0.2;stroke-miterlimit:10;} </style> </defs> <svg style="stroke:#fff;stroke-width:0;fill:#fff;">'
                    : '.st0{stroke:#000;stroke-width:0.2;stroke-miterlimit:10;}.st1{fill:#fff;stroke:#000;stroke-width:0.2;stroke-miterlimit:10;} </style> </defs> <svg style="stroke:#000;stroke-width:0;fill:#000;">',
                _renderBackground(choreoToRender),
                _renderHeader(choreoToRender),
                _renderFooters(tokenId, choreoToRender),
                _renderToken(choreoToRender),
                "</svg> </svg>"
            )
        );

        return svg;
    }

    function _renderFooters(
        uint256 tokenId,
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        return
            string(
                abi.encodePacked(
                    _renderFooterA(tokenId, choreoToRender),
                    _renderFooterB(choreoToRender),
                    _renderFooterC(choreoToRender)
                )
            );
    }

    function _isInverted(
        ChoreographyParams memory choreoToRender
    ) internal pure returns (bool) {
        bool invert = choreoToRender.params[uint8(ChoreoParamsEnum.Invert)] ==
            1;
        return invert;
    }

    function _isVulnerable(
        ChoreographyParams memory choreoToRender
    ) internal pure returns (bool) {
        uint8 vulnerability = choreoToRender.params[
            uint8(ChoreoParamsEnum.Vulnerability)
        ];
        return vulnerability == 2;
    }

    function _renderBackground(
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        return
            _isVulnerable(choreoToRender)
                ? string(
                    abi.encodePacked(
                        "<svg> <defs> <style> .stv{fill:",
                        _isInverted(choreoToRender) ? "#fff" : "#ec1e24",
                        "} </style> </defs>",
                        _renderAttribute(AttributesEnum.VulnerableStamp, 0, 0),
                        "</svg>"
                    )
                )
                : "";
    }

    function _renderHeader(
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        string memory render = _renderAttribute(AttributesEnum.Header, 20, 20);

        return
            _isInverted(choreoToRender) && _isVulnerable(choreoToRender)
                ? _withDifference(render)
                : render;
    }

    function _renderAttributeWithValue(
        AttributesEnum attributeId,
        AttributeValuesEnum attributeValueId,
        uint8[] memory attributeValueOptions,
        uint8 x,
        uint8 y
    ) internal view returns (string memory) {
        (bytes memory svg, uint256 width, uint256 height) = _choreoLibrary
            .attributes(attributeId);

        uint256 offsetX = x + width;
        uint256 offsetY = y; // Total y offset
        string memory render = _placeSvg(
            string(svg.flzDecompress()),
            x,
            y,
            width,
            height
        );
        for (uint8 index = 0; index < attributeValueOptions.length; index++) {
            (render, offsetX, offsetY) = _renderAttributeValue(
                render,
                attributeValueId,
                attributeValueOptions[index],
                offsetX,
                offsetY
            );
        }
        return render;
    }

    function _renderAttributeValues(
        AttributeValuesEnum attributeValueId,
        uint8[] memory attributeValueOptions,
        uint256 x,
        uint256 y
    ) internal view returns (string memory) {
        uint256 offsetX = x;
        uint256 offsetY = y;
        string memory render;
        for (uint8 index = 0; index < attributeValueOptions.length; index++) {
            (render, offsetX, offsetY) = _renderAttributeValue(
                render,
                attributeValueId,
                attributeValueOptions[index],
                offsetX,
                offsetY
            );
        }
        return render;
    }

    function _renderAttributeValue(
        string memory render,
        AttributeValuesEnum attributeValueId,
        uint8 attributeOption,
        uint256 offsetX,
        uint256 offsetY
    ) internal view returns (string memory, uint256, uint256) {
        (bytes memory valueSvg, uint256 width, uint256 height) = _choreoLibrary
            .attributeValues(attributeValueId, attributeOption);

        render = string(
            abi.encodePacked(
                render,
                _placeSvg(
                    string(valueSvg.flzDecompress()),
                    offsetX,
                    offsetY,
                    width,
                    height
                )
            )
        );

        offsetX += width;

        return (render, offsetX, offsetY);
    }

    function _renderMultilineAttributeValues(
        AttributeValuesEnum attributeValueId,
        uint8[] memory attributeValueOptions,
        uint256 maxWidth,
        uint256 lineHeight,
        uint256 x,
        uint256 y
    ) internal view returns (string memory) {
        uint256 offsetX = x;
        uint256 offsetY = y; // Total y offset
        string memory render;
        for (uint8 index = 0; index < attributeValueOptions.length; index++) {
            (render, offsetX, offsetY) = _renderMultilineAttributeValue(
                render,
                attributeValueId,
                attributeValueOptions[index],
                maxWidth,
                lineHeight,
                offsetX,
                offsetY
            );
        }
        return render;
    }

    function _renderMultilineAttributeValue(
        string memory render,
        AttributeValuesEnum attributeValueId,
        uint8 attributeOption,
        uint256 maxWidth,
        uint256 lineHeight,
        uint256 offsetX,
        uint256 offsetY
    ) internal view returns (string memory, uint256, uint256) {
        (bytes memory valueSvg, uint256 width, uint256 height) = _choreoLibrary
            .attributeValues(attributeValueId, attributeOption);

        if (offsetX + width > maxWidth) {
            offsetX = 0;
            offsetY += lineHeight;
        }

        render = string(
            abi.encodePacked(
                render,
                _placeSvg(
                    string(valueSvg.flzDecompress()),
                    offsetX,
                    offsetY,
                    width,
                    height
                )
            )
        );

        offsetX += width;

        return (render, offsetX, offsetY);
    }

    function _renderAttributeWithJitter(
        AttributesEnum attributeId,
        uint256[2][2] memory range,
        bytes32 seed,
        bool withDifference
    ) internal view returns (string memory) {
        // Split the seed into two halves
        bytes16 xSeed = bytes16(seed);
        bytes16 ySeed = bytes16(uint128(uint256(seed)));

        // Generate pseudo-random x and y within the provided range using the seed halves
        uint256 x = (uint256(keccak256(abi.encodePacked(xSeed))) %
            (range[0][1] - range[0][0] + 1)) + range[0][0];
        uint256 y = (uint256(keccak256(abi.encodePacked(ySeed))) %
            (range[1][1] - range[1][0] + 1)) + range[1][0];

        // Call _renderAttribute with the generated x and y
        return
            withDifference
                ? _withDifference(_renderAttribute(attributeId, x, y))
                : _renderAttribute(attributeId, x, y);
    }

    function _renderAttribute(
        AttributesEnum attributeId,
        uint256 x,
        uint256 y
    ) internal view returns (string memory) {
        (bytes memory svg, uint256 width, uint256 height) = _choreoLibrary
            .attributes(attributeId);
        return _placeSvg(string(svg.flzDecompress()), x, y, width, height);
    }

    function _optionId(uint8 optionId) internal pure returns (uint8[] memory) {
        uint8[] memory optionIds = new uint8[](1);
        optionIds[0] = optionId;
        return optionIds;
    }

    function _climateOptionIds(
        uint8 optionId
    ) internal pure returns (uint8[] memory) {
        uint8[] memory optionIds = new uint8[](2);
        optionIds[0] = optionId;

        if (optionId == 0) {
            optionIds[1] = 6;
        } else if (optionId == 5) {
            optionIds[1] = 7;
        } else {
            optionIds[1] = type(uint8).max; // Empty
        }

        return optionIds;
    }

    function _numericOptionIds(
        uint16 numericValue,
        bool withOctothorpe
    ) internal pure returns (uint8[] memory) {
        uint8 hundreds = uint8(numericValue / 100);
        uint8 tens = uint8((numericValue % 100) / 10);
        uint8 ones = uint8(numericValue % 10);

        if (hundreds != 0) {
            uint8[] memory optionIds = new uint8[](withOctothorpe ? 4 : 3);
            if (withOctothorpe) optionIds[0] = _OCTOTHORPE_SYMBOL;
            optionIds[withOctothorpe ? 1 : 0] = hundreds;
            optionIds[withOctothorpe ? 2 : 1] = tens;
            optionIds[withOctothorpe ? 3 : 2] = ones;
            return optionIds;
        } else if (tens != 0) {
            uint8[] memory optionIds = new uint8[](withOctothorpe ? 3 : 2);
            if (withOctothorpe) optionIds[0] = _OCTOTHORPE_SYMBOL;
            optionIds[withOctothorpe ? 1 : 0] = tens;
            optionIds[withOctothorpe ? 2 : 1] = ones;
            return optionIds;
        } else {
            uint8[] memory optionIds = new uint8[](withOctothorpe ? 2 : 1);
            if (withOctothorpe) optionIds[0] = _OCTOTHORPE_SYMBOL;
            optionIds[withOctothorpe ? 1 : 0] = ones;
            return optionIds;
        }
    }

    function _distanceOptionIds(
        uint8 numericValueInteger,
        uint8 numericValueMantissa
    ) internal pure returns (uint8[] memory) {
        uint8 tens = uint8((numericValueInteger % 100) / 10);
        uint8 ones = uint8(numericValueInteger % 10);
        uint8 mantissaTens = uint8((numericValueMantissa % 100) / 10);
        uint8 mantissaOnes = uint8(numericValueMantissa % 10);

        if (tens != 0) {
            uint8[] memory optionIds = new uint8[](6);
            optionIds[0] = tens;
            optionIds[1] = ones;
            optionIds[2] = _DECIMAL_SYMBOL;
            optionIds[3] = mantissaTens;
            optionIds[4] = mantissaOnes;
            optionIds[5] = _METERS_SYMBOL;
            return optionIds;
        } else {
            uint8[] memory optionIds = new uint8[](5);
            optionIds[0] = ones;
            optionIds[1] = _DECIMAL_SYMBOL;
            optionIds[2] = mantissaTens;
            optionIds[3] = mantissaOnes;
            optionIds[4] = _METERS_SYMBOL;
            return optionIds;
        }
    }

    function _renderFooterA(
        uint256 tokenId,
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        string memory render = string(
            abi.encodePacked(
                '<svg x="20" y="1050" viewBox="0 0 260 154" width="260" height="154">',
                _renderAttributeWithValue(
                    AttributesEnum.FooterTitle,
                    AttributeValuesEnum.Numeric,
                    _numericOptionIds(uint16(tokenId % 1000), true),
                    0,
                    0
                ),
                _renderAttribute(AttributesEnum.FooterSubtitle, 0, 29),
                _renderAttributeWithValue(
                    AttributesEnum.FooterVuln,
                    AttributeValuesEnum.VulnOptions,
                    _optionId(
                        choreoToRender.params[
                            uint8(ChoreoParamsEnum.Vulnerability)
                        ]
                    ),
                    0,
                    51
                ),
                _renderAttributeWithValue(
                    AttributesEnum.FooterPerformers,
                    AttributeValuesEnum.NumericSmall,
                    _numericOptionIds(
                        uint16(
                            choreoToRender.params[
                                uint8(ChoreoParamsEnum.Performers)
                            ]
                        ),
                        false
                    ),
                    0,
                    73
                ),
                _renderAttribute(AttributesEnum.FooterABHash, 0, 95),
                _renderMultilineAttributeValues(
                    AttributeValuesEnum.NumericSmall,
                    choreoToRender.tokenHashArray,
                    261,
                    22,
                    118,
                    95
                ),
                "</svg>"
            )
        );

        return render;
    }

    function _renderFooterB(
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        string memory render = string(
            abi.encodePacked(
                '<svg x="320" y="1078" viewBox="0 0 257 126" width="257" height="126">',
                _renderAttributeWithValue(
                    AttributesEnum.FooterShare,
                    AttributeValuesEnum.ShareOptions,
                    _optionId(_hasShare(choreoToRender) ? 1 : 0),
                    0,
                    0
                ),
                _renderAttributeWithValue(
                    AttributesEnum.FooterHeartDist,
                    AttributeValuesEnum.NumericSmall,
                    _distanceOptionIds(
                        choreoToRender.params[
                            uint8(ChoreoParamsEnum.HeartTravel)
                        ],
                        choreoToRender.params[
                            uint8(ChoreoParamsEnum.HeartTravelMantissa)
                        ]
                    ),
                    0,
                    22
                ),
                _renderAttributeWithValue(
                    AttributesEnum.FooterStage,
                    AttributeValuesEnum.StageOptions,
                    _optionId(
                        choreoToRender.params[uint8(ChoreoParamsEnum.Stage)]
                    ),
                    0,
                    44
                ),
                _renderAttributeWithValue(
                    AttributesEnum.FooterSigBone,
                    AttributeValuesEnum.SigBoneOptions,
                    _optionId(
                        choreoToRender.params[
                            uint8(ChoreoParamsEnum.SignatureBone)
                        ]
                    ),
                    0,
                    66
                ),
                _renderAttribute(AttributesEnum.FooterClimate, 0, 88),
                _renderMultilineAttributeValues(
                    AttributeValuesEnum.ClimateOptions,
                    _climateOptionIds(
                        choreoToRender.params[uint8(ChoreoParamsEnum.Climate)]
                    ),
                    279,
                    22,
                    145,
                    88
                ),
                "</svg>"
            )
        );

        return
            _isInverted(choreoToRender) && _isVulnerable(choreoToRender)
                ? _withDifference(render)
                : render;
    }

    function _renderFooterC(
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        string memory render = string(
            abi.encodePacked(
                '<svg x="617" y="1078" viewBox="0 0 278 126" width="278" height="126">',
                _renderAttribute(AttributesEnum.FooterChoreoHash, 0, 0),
                _renderMultilineAttributeValues(
                    AttributeValuesEnum.SequenceOptions,
                    choreoToRender.sequence,
                    297, // 278 + padding
                    35,
                    0,
                    20
                ),
                "</svg>"
            )
        );

        return
            _isInverted(choreoToRender) && _isVulnerable(choreoToRender)
                ? _withDifference(render)
                : render;
    }

    function _withDifference(
        string memory svg
    ) internal pure returns (string memory) {
        string memory render = string(
            abi.encodePacked(
                "<svg",
                ' class="difference"',
                ' style="stroke:#fff;stroke-width:0;fill:#fff;"',
                ">",
                svg,
                "</svg>"
            )
        );

        return render;
    }

    function _placeSvg(
        string memory svg,
        uint256 x,
        uint256 y,
        uint256 width,
        uint256 height
    ) internal pure returns (string memory) {
        string memory render = string(
            abi.encodePacked(
                "<svg",
                ' x="',
                x.toString(),
                '" y="',
                y.toString(),
                '" width="',
                width.toString(),
                '" height="',
                height.toString(),
                '">',
                svg,
                "</svg>"
            )
        );

        return render;
    }

    function _transformFigure(
        string memory path,
        string memory offsetX,
        string memory offsetY,
        string memory scaleX,
        string memory scaleY
    ) internal pure returns (string memory) {
        string memory render = string(
            abi.encodePacked(
                "<g ",
                'transform="translate(',
                (offsetX),
                ",",
                (offsetY),
                ") scale(",
                (scaleX),
                ",",
                (scaleY),
                ')">',
                path,
                "</g>"
            )
        );

        return render;
    }

    function _getSequenceWidth(
        uint8[] memory sequence
    ) internal view returns (uint256[] memory) {
        uint256[] memory imageWidths = new uint256[](sequence.length);
        for (uint8 index = 0; index < sequence.length; index++) {
            (uint256 width, ) = _choreoLibrary.movements(sequence[index]);
            imageWidths[index] = width;
        }
        return imageWidths;
    }

    function _renderToken(
        ChoreographyParams memory choreoToRender
    ) internal view returns (string memory) {
        uint256[] memory imageWidths = _getSequenceWidth(
            choreoToRender.sequence
        );

        (uint256 canvasScale, uint256 rows) = _calculateScale(imageWidths);
        uint256 scaledHeight = _scaleParam(_BASE_MOVEMENT_HEIGHT, canvasScale);
        string memory scaledString = _scaleString(canvasScale);

        uint256 totalHeight = rows * scaledHeight;

        uint256 offsetX; // Current x offset for this row
        uint256 offsetY; // Total y offset
        uint256 lastScaledWidth;

        string memory render;
        for (uint8 index = 0; index < choreoToRender.sequence.length; index++) {
            (render, offsetX, offsetY, lastScaledWidth) = _renderMovement(
                render,
                choreoToRender,
                index,
                offsetX,
                offsetY,
                canvasScale,
                scaledString
            );
        }

        uint256 sectionYOffset = _MOVEMENT_CANVAS_HEIGHT - totalHeight;

        render = _layoutToken(
            choreoToRender,
            render,
            canvasScale,
            sectionYOffset,
            lastScaledWidth + offsetX
        );

        return
            _isInverted(choreoToRender) && _isVulnerable(choreoToRender)
                ? _withDifference(render)
                : render;
    }

    function _calculateCanvasOffsets(
        uint256 canvasScale
    )
        internal
        pure
        returns (uint256 scaledBaseOffset, uint256 scaledCanvasWidth)
    {
        uint256 desiredMargin = 20;
        uint256 baseMargin = 33;
        uint256 scaledBaseMargin = _scaleParam(baseMargin, canvasScale);
        scaledBaseOffset = scaledBaseMargin - desiredMargin;
        scaledCanvasWidth = _SEQUENCE_CANVAS_WIDTH_BASE + scaledBaseOffset * 2;
    }

    function _layoutToken(
        ChoreographyParams memory choreoToRender,
        string memory render,
        uint256 canvasScale,
        uint256 sectionYOffset,
        uint256 lastXPosition
    ) internal view returns (string memory) {
        (
            uint256 scaledBaseOffset,
            uint256 scaledCanvasWidth
        ) = _calculateCanvasOffsets(canvasScale);
        return
            string(
                abi.encodePacked(
                    '<svg x="0" y="54" viewBox="0 0 915 980" width="915" height="980"> <svg x="-',
                    scaledBaseOffset.toString(),
                    '" y="',
                    sectionYOffset.toString(),
                    '" viewBox="0 0 ',
                    scaledCanvasWidth.toString(),
                    ' 980" width="',
                    scaledCanvasWidth.toString(),
                    '" height="980">',
                    render,
                    '</svg></svg><svg x="0" y="-50">',
                    _renderStamp(
                        choreoToRender,
                        sectionYOffset,
                        lastXPosition,
                        canvasScale
                    ),
                    "</svg>"
                )
            );
    }

    function _getRangeSettings(
        uint256 sectionYOffset,
        uint256 lastOffsetX,
        uint256 canvasScale
    ) internal pure returns (uint256[2][2] memory range) {
        (, uint256 scaledCanvasWidth) = _calculateCanvasOffsets(canvasScale);
        // Rule 1 - if small yOffset and if gap on bottom right, stamp goes in bottom right

        // Check if sectionYOffset is below a certain threshold (100?)
        if (sectionYOffset < 100) {
            // Check if last offset x is less than 2/3 of the canvas width
            if (lastOffsetX < ((scaledCanvasWidth * 2) / 3)) {
                // Stamp goes in bottom right
                range[0][0] = _SEQUENCE_CANVAS_WIDTH_BASE / 2; // Start halfway across
                range[0][1] = (_SEQUENCE_CANVAS_WIDTH_BASE * 2) / 3; // End 2/3 across
                range[1][0] = 50 + (_MOVEMENT_CANVAS_HEIGHT * 2) / 3; // Start 2/3 down movement score
                range[1][1] = 50 + (_MOVEMENT_CANVAS_HEIGHT * 3) / 4; // End 3/4 down movement score
                return range;
            }
        }

        // Rule 2 - if gap on top, stamp goes on top middle or left
        if (sectionYOffset > 100) {
            // Check if last offset x is less than 2/3 of the canvas width
            // Stamp goes in bottom right
            range[0][0] = 50; // Start 50 from left
            range[0][1] = (_SEQUENCE_CANVAS_WIDTH_BASE * 1) / 3; // End 1/3 across
            range[1][0] = 0; // Start at top
            range[1][1] = 100; // End 50 down
            return range;
        }

        // Rule 3 - if large scale and gap on bottom right, stamp goes in bottom right
        if (canvasScale > 2000) {
            // Check if last offset x is less than 3/4 of the canvas width
            if (lastOffsetX < ((scaledCanvasWidth * 3) / 4)) {
                // Stamp goes in bottom right
                range[0][0] = _SEQUENCE_CANVAS_WIDTH_BASE / 2; // Start halfway across
                range[0][1] = (_SEQUENCE_CANVAS_WIDTH_BASE * 2) / 3; // End 2/3 across
                range[1][0] = 50 + (_MOVEMENT_CANVAS_HEIGHT * 2) / 3; // Start 2/3 down movement score
                range[1][1] = 50 + (_MOVEMENT_CANVAS_HEIGHT * 3) / 4; // End 3/4 down movement score
                return range;
            }
        }

        // Otherwise random
        range[0][0] = _SEQUENCE_CANVAS_WIDTH_BASE / 2; // Start halfway across
        range[0][1] = (_SEQUENCE_CANVAS_WIDTH_BASE * 2) / 3; // End 2/3 across
        range[1][0] = 50 + (_MOVEMENT_CANVAS_HEIGHT * 1) / 3; // Start 1/3 down movement score
        range[1][1] = 50 + (_MOVEMENT_CANVAS_HEIGHT * 2) / 3; // End 2/3 down movement score
        return range;
    }

    function _renderStamp(
        ChoreographyParams memory choreoToRender,
        uint256 sectionYOffset,
        uint256 lastXOffset,
        uint256 canvasScale
    ) internal view returns (string memory) {
        bytes32 seed = keccak256(
            abi.encodePacked(
                choreoToRender.sequence,
                choreoToRender.params[uint8(ChoreoParamsEnum.HeartTravel)]
            )
        );
        return
            _renderAttributeWithJitter(
                AttributesEnum.Stamp,
                _getRangeSettings(sectionYOffset, lastXOffset, canvasScale),
                seed,
                !_isVulnerable(choreoToRender) || _isInverted(choreoToRender)
            );
    }

    function _scales(
        uint8 movementId,
        uint256 canvasScale
    ) internal view returns (string memory, uint256) {
        (uint256 width, bytes memory svg) = _choreoLibrary.movements(
            movementId
        );
        uint256 scaledWidth = _scaleParam(width, canvasScale);
        return (string(svg.flzDecompress()), scaledWidth);
    }

    function _renderMovementOverlays(
        uint8 tempo,
        uint8 pause
    ) internal view returns (string memory) {
        uint8[] memory optionIds = new uint8[](3);
        optionIds[0] = tempo; // 1 is halftime and 2 is doubletime
        optionIds[1] = pause == 0 ? 0 : _PAUSE_SYMBOL;
        return
            _renderAttributeValues(
                AttributeValuesEnum.MovementOverlayOptions,
                optionIds,
                33,
                125
            );
    }

    function _isImprov(uint8 movementId) internal pure returns (bool) {
        return movementId == 0;
    }

    function _renderMovement(
        string memory render,
        ChoreographyParams memory choreoToRender,
        uint8 index,
        uint256 offsetX,
        uint256 offsetY,
        uint256 canvasScale,
        string memory scaledString
    ) internal view returns (string memory, uint256, uint256, uint256) {
        (string memory svg, uint256 scaledWidth) = _scales(
            choreoToRender.sequence[index],
            canvasScale
        );

        svg = string(
            abi.encodePacked(
                svg,
                _isImprov(choreoToRender.sequence[index])
                    ? ""
                    : _renderMovementOverlays(
                        choreoToRender.tempo[index],
                        choreoToRender.pauseFrames[index]
                    )
            )
        );

        uint256 scaledY = _scaleParam(_BASE_MOVEMENT_HEIGHT, canvasScale);

        render = string(
            abi.encodePacked(
                render,
                _transformFigure(
                    svg,
                    offsetX.toString(),
                    offsetY.toString(),
                    scaledString,
                    scaledString
                )
            )
        );

        if (index < choreoToRender.sequence.length - 1) {
            (offsetX, offsetY) = _calculateOffsets(
                choreoToRender,
                index,
                offsetX,
                offsetY,
                scaledWidth,
                scaledY,
                canvasScale
            );
        }

        return (render, offsetX, offsetY, scaledWidth);
    }

    function _calculateOffsets(
        ChoreographyParams memory choreoToRender,
        uint8 index,
        uint256 offsetX,
        uint256 offsetY,
        uint256 scaledWidth,
        uint256 scaledY,
        uint256 canvasScale
    ) internal view returns (uint256, uint256) {
        (, uint256 scaledCanvasWidth) = _calculateCanvasOffsets(canvasScale);

        (uint256 nextWidth, ) = _choreoLibrary.movements(
            choreoToRender.sequence[index + 1]
        );
        uint256 scaledNextWidth = _scaleParam(nextWidth, canvasScale);
        if (offsetX + scaledWidth + scaledNextWidth > scaledCanvasWidth) {
            offsetY += scaledY;
            offsetX = 0;
        } else {
            offsetX += scaledWidth;
        }

        return (offsetX, offsetY);
    }

    function _calculateRowsAndAccumulator(
        uint256[] memory imageWidths,
        uint256 scale
    ) private pure returns (uint256) {
        (, uint256 scaledCanvasWidth) = _calculateCanvasOffsets(scale);
        uint256 rows = 1;
        uint256 widthAccumulator = 0;

        for (uint16 i = 0; i < imageWidths.length; i++) {
            uint256 newWidthAccumulator = widthAccumulator +
                (imageWidths[i] * scale) /
                _SCALE_RES;
            if (newWidthAccumulator > scaledCanvasWidth) {
                rows++;
                widthAccumulator = (imageWidths[i] * scale) / _SCALE_RES;
            } else {
                widthAccumulator = newWidthAccumulator;
            }
        }

        return rows;
    }

    function _maxAndMin(
        uint256[] memory imageWidths
    ) internal pure returns (uint256, uint256) {
        uint256 maxImageWidth = imageWidths[0];
        uint256 minImageWidth = imageWidths[0];

        for (uint16 i = 1; i < imageWidths.length; i++) {
            if (imageWidths[i] > maxImageWidth) {
                maxImageWidth = imageWidths[i];
            }
            if (imageWidths[i] < minImageWidth) {
                minImageWidth = imageWidths[i];
            }
        }
        return (maxImageWidth, minImageWidth);
    }

    function _maxUint(uint256 a, uint256 b) internal pure returns (uint256) {
        return a >= b ? a : b;
    }

    function _minUint(uint256 a, uint256 b) internal pure returns (uint256) {
        return a <= b ? a : b;
    }

    function _calculateMaxScale(
        uint256[] memory imageWidths
    ) internal pure returns (uint256) {
        (uint256 maxWidth, ) = _maxAndMin(imageWidths);

        uint256 maxScaleByHeight = (((_MOVEMENT_CANVAS_HEIGHT * _SCALE_RES) /
            2) / _BASE_MOVEMENT_HEIGHT) - 1; // Clamp max scale by ensuring at least 2 rows

        uint256 scale = maxScaleByHeight;
        (, uint256 scaledCanvasWidth) = _calculateCanvasOffsets(scale);
        uint256 maxScale = maxWidth == 0
            ? maxScaleByHeight
            : (((scaledCanvasWidth) * _SCALE_RES) / maxWidth) - 1; // Calculate max scale in case lower

        scale = _minUint(maxScale, maxScaleByHeight); // Clamp scale to lower of maxScale and maxScaleByHeight
        return scale;
    }

    function _calculateScale(
        uint256[] memory imageWidths
    ) internal pure returns (uint256, uint256) {
        uint256 minScale = _SCALE_MIN;
        uint256 maxScale = _calculateMaxScale(imageWidths);
        uint256 scale;
        uint256 rows;
        uint256 totalHeight;

        uint256 lastValidScale;
        uint256 lastValidRows;

        uint256 iterationCounter;

        while (minScale <= maxScale) {
            iterationCounter++;
            scale = (minScale + maxScale) / 2;
            rows = _calculateRowsAndAccumulator(imageWidths, scale);
            totalHeight = _scaleParam(_BASE_MOVEMENT_HEIGHT * rows, scale);

            if (totalHeight > _MOVEMENT_CANVAS_HEIGHT) {
                maxScale = scale - 1;
            } else {
                lastValidScale = scale;
                lastValidRows = rows;
                if (totalHeight < _MOVEMENT_CANVAS_HEIGHT) {
                    minScale = scale + 1;
                } else {
                    break;
                }
            }
        }

        if (totalHeight > _MOVEMENT_CANVAS_HEIGHT) {
            scale = lastValidScale;
            rows = lastValidRows;
        }

        return (scale, rows);
    }

    function _scaleParam(
        uint256 base,
        uint256 scale
    ) internal pure returns (uint256) {
        return (base * scale) / _SCALE_RES;
    }

    function _scaleString(uint256 scale) internal pure returns (string memory) {
        uint256 integerPart = scale / _SCALE_RES;
        uint256 mantissa = scale % _SCALE_RES;
        string memory mantissaStr;

        if (mantissa < 10) {
            mantissaStr = string(abi.encodePacked("00", mantissa.toString()));
        } else if (mantissa < 100) {
            mantissaStr = string(abi.encodePacked("0", mantissa.toString()));
        } else {
            mantissaStr = mantissa.toString();
        }

        return
            string(abi.encodePacked(integerPart.toString(), ".", mantissaStr));
    }
}

// File: src/IChoreoScore.sol



pragma solidity ^0.8.17;

import {ChoreoLibraryConfig} from "src/ChoreoLibraryConfig.sol";

interface IChoreoScore is ChoreoLibraryConfig {
    function renderTokenURI(
        uint256 tokenId,
        ChoreographyParams memory choreoToRender
    ) external view returns (string memory);
}