Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

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

import {Ownable} from "@openzeppelin/access/Ownable.sol";
import {UDUart} from "./UDUart.sol";

import './interfaces/IDirectFundingConsumer.sol';

contract UDUartFactory is Ownable {
    // Custom errors
    error CollectionNameRequired();
    error CollectionNameExists();
    error VRFCoordinatorRequired();
    error InvalidCollection();
    error NotOwner();
    error IndexOutOfBounds();

    // Array de todas las colecciones UDUart creadas
    address[] public collections;

    // Mapping de owner a sus colecciones
    mapping(address => address[]) public ownerToCollections;

    // Mapping de nombre de colección a dirección UDUart
    mapping(string => address) public collectionNameToAddress;

    // Mapping para verificar si una colección fue creada por esta factory
    mapping(address => bool) public isValidCollection;

    // address for the DirectFundingConsumer for VRF requests
    address public directFundingConsumer;

    // Events
    event CollectionCreated(address indexed collection, address indexed owner, string collectionName, uint256 index);

    event CollectionInitialized(address indexed collection, string collectionName);

    constructor(address directFundingConsumer_) Ownable(msg.sender) {
        directFundingConsumer = directFundingConsumer_;
    }

    /**
     * @dev Create a new UDUart collection and optionally initialize it
     * @param owner Owner of the new collection (if address(0), uses msg.sender)
     * @param collectionName Name of the collection
     * @param initializeNow If true, initializes the collection immediately
     */
    function createCollection(
        address owner,
        string memory collectionName,
        bool initializeNow
    ) external onlyOwner returns (address) {
        // If owner is address(0), use msg.sender
        address actualOwner = owner == address(0) ? msg.sender : owner;

        if (initializeNow) {
            if (bytes(collectionName).length == 0) revert CollectionNameRequired();
            if (collectionNameToAddress[collectionName] != address(0)) revert CollectionNameExists();
            if (directFundingConsumer == address(0)) revert VRFCoordinatorRequired();
        }

        // Create new UDUart collection
        UDUart newCollection = new UDUart(collectionName, actualOwner, address(this), directFundingConsumer);
        address collectionAddress = address(newCollection);

        // Register the collection
        collections.push(collectionAddress);
        ownerToCollections[actualOwner].push(collectionAddress);
        isValidCollection[collectionAddress] = true;
        IDirectFundingConsumer(directFundingConsumer).setAllowedNftCollection(collectionAddress, true);

        emit CollectionCreated(collectionAddress, actualOwner, collectionName, collections.length - 1);

        // Initialize collection if requested
        if (initializeNow) {
            newCollection.initializeCollection();
            collectionNameToAddress[collectionName] = collectionAddress;
            emit CollectionInitialized(collectionAddress, collectionName);
        }

        return collectionAddress;
    }

    // View functions
    function getAllCollections() external view returns (address[] memory) {
        return collections;
    }

    function getCollectionsByOwner(address owner) external view returns (address[] memory) {
        return ownerToCollections[owner];
    }

    function getCollectionCount() external view returns (uint256) {
        return collections.length;
    }

    function getCollectionInfo(address collection)
        external
        view
        returns (string memory name, address owner, bool initialized)
    {
        if (!isValidCollection[collection]) revert InvalidCollection();

        UDUart uduart = UDUart(collection);
        return (uduart.getCollectionName(), uduart.owner(), uduart.initialized());
    }

    function getCollectionByName(string memory name) external view returns (address) {
        return collectionNameToAddress[name];
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

import {IERC165} from "@openzeppelin/interfaces/IERC165.sol";
import {ERC721} from "@openzeppelin/token/ERC721/ERC721.sol";
import {Ownable} from "@openzeppelin/access/Ownable.sol";
import {ReentrancyGuard} from "@openzeppelin/utils/ReentrancyGuard.sol";
import {DirectFundingConsumer} from "./DirectFundingConsumer.sol";
import {IUDUart} from "./interfaces/IUDUart.sol";

/**
 * @title UDUart
 * @dev Simplified NFT collection contract with integrated VaultManager functionality
 */
contract UDUart is ERC721, Ownable, ReentrancyGuard, IUDUart {

    /// @dev Required override for ERC721 and interface support

    function supportsInterface(bytes4 interfaceId) public view override(ERC721, IERC165) returns (bool) {
        return super.supportsInterface(interfaceId);
    }

    // Custom errors
    error InvalidTier();
    error ActivationCodeAlreadyUsed();
    error NoNFTsAvailable();
    error NFTDoesNotExist();
    error IndexOutOfBounds();
    error NoTokensToBurn();
    error NotTokenOwner();
    error TokensMustBeSameTier();
    error TokensMustBeSameProduct();
    error CannotUpgradeTheOneTier();
    error NotAuthorizedMinter();
    error NotOwnerOrFactory();
    error NotInitialized();
    error AlreadyInitialized();
    error InvalidUserAddress();
    error CannotAuthorizeZeroAddress();
    error MustMintAtLeastOne();
    error InvalidProductType();
    error ExceedsMaxBatchSize();
    error NotEnoughGas();
    error InvalidBatchSize();
    error BatchSizeTooLarge();

    // Tier definitions - using the same as interface
    uint256 public constant TOTAL_TIERS = 7;
    uint256 public maxBatchSize = 50; // Maximum NFTs per batch to avoid gas issues (configurable)

    // Collection state
    uint256 private _collectionRandomness = 0;
    bool private _collectionRandomnessSet = false;
    bool public initialized = false;
    address public factory; // Track the factory that created this contract

    // VRF integration
    DirectFundingConsumer public directFundingConsumer;

    // Tracking for NFT tier assignments
    mapping(uint256 => IUDUart.NFTData) private _nftData;
    uint256 private _tokenIdCounter = 1;

    // Array de NFTs disponibles para claim
    uint256[] private _availableTokenIds;
    mapping(uint256 => uint256) private _tokenIdToAvailableIndex;

    // Tracking para códigos de activación usados
    mapping(string => bool) private _activationCodeUsed;

    // Access control for minting
    mapping(address => bool) public authorizedMinters;

    // New mappings for tier and product type tracking
    mapping(uint256 => IUDUart.TierType) public tokenIdToTier;
    mapping(uint256 => IUDUart.ProductType) public tokenIdToProductType;

    // Events - using the same as interface plus new ones
    // Events are imported from IUDUart
    event CollectionInitialized(string name, address uduartContract);
    event MinterAuthorized(address indexed minter);
    event MinterRevoked(address indexed minter);
    event MaxBatchSizeUpdated(uint256 oldMaxBatchSize, uint256 newMaxBatchSize);

    // Modifiers
    modifier onlyAuthorizedMinter() {
        if (!authorizedMinters[msg.sender] && msg.sender != owner()) revert NotAuthorizedMinter();
        _;
    }

    modifier onlyOwnerOrFactory() {
        if (msg.sender != owner() && msg.sender != factory) revert NotOwnerOrFactory();
        _;
    }

    modifier onlyInitialized() {
        if (!initialized) revert NotInitialized();
        _;
    }

    constructor(string memory collectionName, address _owner, address _factory, address _directFundingConsumer)
        ERC721(collectionName, "UDUART")
        Ownable(_owner)
    {
        factory = _factory;
        directFundingConsumer = DirectFundingConsumer(payable(_directFundingConsumer));
    }

    /**
     * @dev Initialize the collection with VRF integration
     */
    function initializeCollection() external onlyOwnerOrFactory {
        if (initialized) revert AlreadyInitialized();

        // Check if there's already a VRF request for this collection
        uint256 existingRequestId = directFundingConsumer.requestIdByNftCollection(address(this));

        if (existingRequestId == 0) {
            // Request VRF for this collection only if no request exists
            directFundingConsumer.requestRandomWords(address(this));
        }

        initialized = true;

        emit CollectionInitialized(name(), address(this));
    }

    /**
     * @dev Update collection randomness once VRF has responded. It is called by the owner before the first claim.
     */
    function updateCollectionRandomness() external onlyOwner() {
        if (!initialized) revert NotInitialized();

        address nftCollection = address(this);
        uint256 requestIdForCollection = directFundingConsumer.requestIdByNftCollection(nftCollection);
        // Get random words from DirectFundingConsumer
        (, bool fulfilled, uint256[] memory randomWords) = directFundingConsumer.getRequestStatus(requestIdForCollection);

        if (fulfilled && randomWords.length > 0) {
            // Use the first random word for the collection
            _collectionRandomness = randomWords[0];
            _collectionRandomnessSet = true;
        }
    }


    // Centralized claim function
    function claimRandomNFT(address user, string memory activationCode)
        external
        onlyAuthorizedMinter
        onlyInitialized
        nonReentrant
        returns (uint256)
    {
        if (user == address(0)) revert InvalidUserAddress();
        if (!_collectionRandomnessSet) revert NoNFTsAvailable();
        if (_activationCodeUsed[activationCode]) revert ActivationCodeAlreadyUsed();
        if (_availableTokenIds.length == 0) revert NoNFTsAvailable();

        _activationCodeUsed[activationCode] = true;
        uint256 randomness = uint256(keccak256(abi.encodePacked(_collectionRandomness, user, activationCode)));
        uint256 randomIndex = randomness % _availableTokenIds.length;
        uint256 selectedTokenId = _availableTokenIds[randomIndex];

        _removeTokenFromAvailable(selectedTokenId);
        _transfer(address(this), user, selectedTokenId);
        emit NFTClaimed(user, selectedTokenId, activationCode);
        return selectedTokenId;
    }

    // View functions
    function getCollectionRandomnessInfo() external view returns (bool isSet, uint256 randomness) {
        return (_collectionRandomnessSet, _collectionRandomness);
    }

    function getCollectionName() external view returns (string memory) {
        return name();
    }

    function getNFTData(uint256 tokenId) external view onlyInitialized returns (IUDUart.NFTData memory) {
        if (_ownerOf(tokenId) == address(0)) revert NFTDoesNotExist();
        return _nftData[tokenId];
    }

    function canUpgradeTier(uint256[] calldata tokenIds) external view onlyInitialized returns (bool) {
        if (tokenIds.length == 0) return false;

        // Check if all tokens belong to caller and exist
        for (uint256 i = 0; i < tokenIds.length; i++) {
            if (_ownerOf(tokenIds[i]) != msg.sender) return false;
        }

        // Allow upgrades if user owns all the tokens
        return true;
    }

    function getAvailableNFTsCount() external view onlyInitialized returns (uint256) {
        return _availableTokenIds.length;
    }

    function getAvailableNFTs() external view onlyInitialized returns (uint256[] memory) {
        return _availableTokenIds;
    }

    function isActivationCodeUsed(string memory activationCode) external view onlyInitialized returns (bool) {
        return _activationCodeUsed[activationCode];
    }

    // Helper function to remove token from available list
    function _removeTokenFromAvailable(uint256 tokenId) internal {
        uint256 indexToRemove = _tokenIdToAvailableIndex[tokenId];
        uint256 lastTokenId = _availableTokenIds[_availableTokenIds.length - 1];

        _availableTokenIds[indexToRemove] = lastTokenId;
        _tokenIdToAvailableIndex[lastTokenId] = indexToRemove;

        _availableTokenIds.pop();
        delete _tokenIdToAvailableIndex[tokenId];

        _nftData[tokenId].isAvailable = false;
    }

    function burnAndUpgrade(uint256[] calldata tokenIds) external returns (uint256) {
        if (tokenIds.length == 0) revert NoTokensToBurn();

        // Verify ownership and get the first token's data for reference
        address owner = _ownerOf(tokenIds[0]);
        if (owner != msg.sender) revert NotTokenOwner();

        IUDUart.NFTData memory firstTokenData = _nftData[tokenIds[0]];
        IUDUart.TierType currentTier = firstTokenData.tier;
        uint256 productId = firstTokenData.productId;

        // Verify all tokens belong to the same owner, tier, and product
        for (uint256 i = 0; i < tokenIds.length; i++) {
            if (_ownerOf(tokenIds[i]) != owner) revert NotTokenOwner();
            if (_nftData[tokenIds[i]].tier != currentTier) revert TokensMustBeSameTier();
            if (_nftData[tokenIds[i]].productId != productId) revert TokensMustBeSameProduct();
        }

        // Determine upgraded tier (next tier up)
        if (uint256(currentTier) >= 6) revert CannotUpgradeTheOneTier();
        IUDUart.TierType upgradedTier = IUDUart.TierType(uint256(currentTier) + 1);

        // Burn all input tokens
        for (uint256 i = 0; i < tokenIds.length; i++) {
            _burn(tokenIds[i]);
            delete _nftData[tokenIds[i]];
            // Clean up mappings
            delete tokenIdToTier[tokenIds[i]];
            delete tokenIdToProductType[tokenIds[i]];
        }

        // Create upgraded token
        uint256 newTokenId = _tokenIdCounter++;

        _nftData[newTokenId] = IUDUart.NFTData({
            productId: productId,
            tier: upgradedTier,
            productType: IUDUart.ProductType.Art,
            tokenURI: "",
            isAvailable: false
        });

        // Set tier and product type mappings for new token
        tokenIdToTier[newTokenId] = upgradedTier;
        tokenIdToProductType[newTokenId] = IUDUart.ProductType.Art;

        // Mint directly to the user (not to contract)
        _mint(owner, newTokenId);

        emit NFTMinted(owner, newTokenId, productId, upgradedTier);

        return newTokenId;
    }

    /**
     * @dev Batch mint with automatic gas-safe chunking
     * @param totalToMint Total number of NFTs to mint across multiple transactions if needed
     * @param tier The tier type for the NFTs
     * @param productType The product type for the NFTs
     * @param tokenURI The token URI for the NFTs
     * @return currentBatchSize Number of NFTs minted in this transaction
     * @return remainingToMint Number of NFTs still to be minted
     */
    function safeBatchMinting(
        uint256 totalToMint,
        IUDUart.TierType tier,
        IUDUart.ProductType productType,
        string memory tokenURI
    )
        external
        onlyAuthorizedMinter
        onlyInitialized
        returns (uint256 currentBatchSize, uint256 remainingToMint)
    {
        if (totalToMint == 0) revert MustMintAtLeastOne();
        if (uint256(tier) >= TOTAL_TIERS) revert InvalidTier();
        if (uint256(productType) >= 2) revert InvalidProductType();

        // Calculate how many to mint in this batch
        currentBatchSize = totalToMint > maxBatchSize ? maxBatchSize : totalToMint;
        remainingToMint = totalToMint - currentBatchSize;

        uint256 productIdValue = uint256(productType);

        // Mint the batch
        for (uint256 i = 0; i < currentBatchSize; i++) {
            uint256 tokenId = _tokenIdCounter++;

            // Mint to the contract itself
            _mint(address(this), tokenId);

            // Set tier and product type mappings
            tokenIdToTier[tokenId] = tier;
            tokenIdToProductType[tokenId] = productType;

            // Set NFT data for availability
            _nftData[tokenId] = IUDUart.NFTData({
                productId: productIdValue,
                tier: tier,
                productType: productType,
                tokenURI: tokenURI,
                isAvailable: true
            });

            // Add to available tokens
            _availableTokenIds.push(tokenId);
            _tokenIdToAvailableIndex[tokenId] = _availableTokenIds.length - 1;

            emit NFTMinted(address(this), tokenId, productIdValue, tier);
        }

        emit NFTsBatchMinted(currentBatchSize, tier, productType);

        return (currentBatchSize, remainingToMint);
    }

    /**
     * @dev Batch mint with custom batch size for this specific call
     * @param totalToMint Total number of NFTs to mint across multiple transactions if needed
     * @param tier The tier type for the NFTs
     * @param productType The product type for the NFTs
     * @param customBatchSize Custom batch size for this specific call (overrides default maxBatchSize)
     * @param tokenURI The token URI for the NFTs
     * @return currentBatchSize Number of NFTs minted in this transaction
     * @return remainingToMint Number of NFTs still to be minted
     */
    function safeBatchMinting(
        uint256 totalToMint,
        IUDUart.TierType tier,
        IUDUart.ProductType productType,
        uint256 customBatchSize,
        string memory tokenURI
    ) external onlyAuthorizedMinter onlyInitialized returns (uint256 currentBatchSize, uint256 remainingToMint) {
        if (totalToMint == 0) revert MustMintAtLeastOne();
        if (uint256(tier) >= TOTAL_TIERS) revert InvalidTier();
        if (uint256(productType) >= 2) revert InvalidProductType();
        if (customBatchSize == 0) revert("Custom batch size must be greater than 0");
        if (customBatchSize > 200) revert("Custom batch size too large for gas safety");

        // Calculate how many to mint in this batch using custom batch size
        currentBatchSize = totalToMint > customBatchSize ? customBatchSize : totalToMint;
        remainingToMint = totalToMint - currentBatchSize;

        uint256 productIdValue = uint256(productType);

        // Mint the batch
        for (uint256 i = 0; i < currentBatchSize; i++) {
            uint256 tokenId = _tokenIdCounter++;

            // Mint to the contract itself
            _mint(address(this), tokenId);

            // Set tier and product type mappings
            tokenIdToTier[tokenId] = tier;
            tokenIdToProductType[tokenId] = productType;

            // Set NFT data for availability
            _nftData[tokenId] = IUDUart.NFTData({
                productId: productIdValue,
                tier: tier,
                productType: productType,
                tokenURI: tokenURI,
                isAvailable: true
            });

            // Add to available tokens
            _availableTokenIds.push(tokenId);
            _tokenIdToAvailableIndex[tokenId] = _availableTokenIds.length - 1;

            emit NFTMinted(address(this), tokenId, productIdValue, tier);
        }

        emit NFTsBatchMinted(currentBatchSize, tier, productType);

        return (currentBatchSize, remainingToMint);
    }


  // Access control functions
    /**
     * @dev Authorize an address to request random NFTs
     * @param minter Address to authorize
     */
    function authorizeMinter(address minter) external onlyOwner {
        if (minter == address(0)) revert CannotAuthorizeZeroAddress();
        authorizedMinters[minter] = true;
        emit MinterAuthorized(minter);
    }

    /**
     * @dev Revoke authorization from an address
     * @param minter Address to revoke
     */
    function revokeMinter(address minter) external onlyOwner {
        authorizedMinters[minter] = false;
        emit MinterRevoked(minter);
    }

    /**
     * @dev Set the maximum batch size for minting operations
     * @param newMaxBatchSize New maximum batch size (must be > 0 and <= 200 for gas safety)
     */
    function setMaxBatchSize(uint256 newMaxBatchSize) external onlyOwner {
        if (newMaxBatchSize == 0) revert InvalidBatchSize();
        if (newMaxBatchSize > 200) revert BatchSizeTooLarge();

        uint256 oldMaxBatchSize = maxBatchSize;
        maxBatchSize = newMaxBatchSize;

        emit MaxBatchSizeUpdated(oldMaxBatchSize, newMaxBatchSize);
    }

    
    /**
     * @dev Admin function to set collection randomness - called by owner
     */
    function setCollectionRandomness(uint256 randomness) external onlyOwner {
        _collectionRandomness = randomness;
        _collectionRandomnessSet = true;
    }

    /**
     * @dev Set the DirectFundingConsumer address (for pre-initialization VRF allowlist)
     * @param _directFundingConsumer Address of the DirectFundingConsumer contract
     */
    function setDirectFundingConsumer(address _directFundingConsumer) external onlyOwner {
        if (_directFundingConsumer == address(0)) revert CannotAuthorizeZeroAddress();
        directFundingConsumer = DirectFundingConsumer(payable(_directFundingConsumer));
    }


}

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

interface IDirectFundingConsumer {
    function setAllowedNftCollection(address collection, bool allowed) external;
    function requestRandomnessForCollection(address collection) external returns (bytes32 requestId);
    function fulfillRandomness(bytes32 requestId, uint256[] memory randomWords) external;
    function requestIdByNftCollection(address nftCollection) external view returns (bytes32);
    function getRequestStatus(bytes32 requestId) external view returns (bool fulfilled, uint256[] memory randomWords);
    function setNumWords(uint32 newNumWords) external;
    function setFactory(address factory_) external;
    function requestRandomWords (address collectionNft_) external ;
}

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

pragma solidity ^0.8.20;

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

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

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

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

pragma solidity >=0.4.16;

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

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

pragma solidity ^0.8.20;

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

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

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    mapping(uint256 tokenId => address) private _owners;

    mapping(address owner => uint256) private _balances;

    mapping(uint256 tokenId => address) private _tokenApprovals;

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

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

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

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

    /// @inheritdoc IERC721
    function ownerOf(uint256 tokenId) public view virtual returns (address) {
        return _requireOwned(tokenId);
    }

    /// @inheritdoc IERC721Metadata
    function name() public view virtual returns (string memory) {
        return _name;
    }

    /// @inheritdoc IERC721Metadata
    function symbol() public view virtual returns (string memory) {
        return _symbol;
    }

    /// @inheritdoc IERC721Metadata
    function tokenURI(uint256 tokenId) public view virtual returns (string memory) {
        _requireOwned(tokenId);

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

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

    /// @inheritdoc IERC721
    function approve(address to, uint256 tokenId) public virtual {
        _approve(to, tokenId, _msgSender());
    }

    /// @inheritdoc IERC721
    function getApproved(uint256 tokenId) public view virtual returns (address) {
        _requireOwned(tokenId);

        return _getApproved(tokenId);
    }

    /// @inheritdoc IERC721
    function setApprovalForAll(address operator, bool approved) public virtual {
        _setApprovalForAll(_msgSender(), operator, approved);
    }

    /// @inheritdoc IERC721
    function isApprovedForAll(address owner, address operator) public view virtual returns (bool) {
        return _operatorApprovals[owner][operator];
    }

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

    /// @inheritdoc IERC721
    function safeTransferFrom(address from, address to, uint256 tokenId) public {
        safeTransferFrom(from, to, tokenId, "");
    }

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

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

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

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

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

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

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

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

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

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

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

        _owners[tokenId] = to;

        emit Transfer(from, to, tokenId);

        return from;
    }

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

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

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

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

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

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

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

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

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

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

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

        _tokenApprovals[tokenId] = to;
    }

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

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

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

pragma solidity ^0.8.20;

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

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

    uint256 private _status;

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

    constructor() {
        _status = NOT_ENTERED;
    }

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

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

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

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

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

/// @notice Owner can request randomness for a collection directly
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.30;

import "@chainlink/contracts/src/v0.8/vrf/dev/VRFV2PlusWrapperConsumerBase.sol";
import "@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol";
import "@chainlink/contracts/src/v0.8/shared/access/ConfirmedOwner.sol";

import './interfaces/ILink.sol';

/* * Request testnet LINK and ETH here: https://faucets.chain.link/
 * Find information on LINK Token Contracts and get the latest ETH and LINK faucets here: https://docs.chain.link/docs/link-token-contracts/
 */

contract DirectFundingConsumer is VRFV2PlusWrapperConsumerBase, ConfirmedOwner {
    event Debug(string message);
    error DebugError(string message);
    /// @notice Owner can request randomness for a collection directly

    // function ownerRequestRandomWords(address nftCollection_) public onlyOwner returns (uint256) {
    //     return requestRandomWords(nftCollection_);
    // }
    // Custom errors
    error NFTCollectionNotAllowed();
    error RequestIdAlreadyExists();
    error LastRequestNotFulfilled();
    error RequestNotFound();
    error TransferFailed();
    error WithdrawNativeFailed();

    event RequestSent(address indexed nftCollection, uint256 requestId, uint32 numWords);
    event RequestFulfilled(address indexed nftCollection, uint256 requestId, uint256[] randomWords, uint256 payment);

    struct RequestStatus {
        uint256 paid; // amount paid in link
        bool fulfilled; // whether the request has been successfully fulfilled
        uint256[] randomWords;
    }


    // Depends on the number of requested values that you want sent to the fulfillRandomWords() function. Test and adjust
    // this limit based on the network that you select, the size of the request, and the processing of the callback request in the fulfillRandomWords() function.
    uint32 public callbackGasLimit = 500000;
    // The default is 3, but you can set this higher.
    uint16 public requestConfirmations = 3;
    // For this example, retrieve 1 random values in one request.
    // Cannot exceed VRFV2Wrapper.getConfig().maxNumWords.
    uint32 public numWords = 1;

    address public factory; // address of the UDUartFactory

    mapping(address => bool) public allowedNftCollections;
    mapping(uint256 => RequestStatus) public requestStatusByRequestId;
    mapping(address => uint256) public requestIdByNftCollection;
    mapping(uint256 => address) public nftCollectionByRequestId;

    address public linkAddress; // Address LINK

    address public VRFWrapperAddress; // address VRF WRAPPER

    uint256[] public requestIds;
    uint256 public lastRequestId;

    // // Address LINK - hardcoded for Sepolia
    // address public linkAddress = 0x779877A7B0D9E8603169DdbD7836e478b4624789;

    // // address WRAPPER - hardcoded for Sepolia
    // address public wrapperAddress = 0x195f15F2d49d693cE265b4fB0fdDbE15b1850Cc1;

    modifier onlyAllowed() {
        address sender = msg.sender;
        if (sender != owner() && !allowedNftCollections[sender] && sender != factory) {
            emit Debug("DirectFundingConsumer: onlyAllowed failed");
            revert DebugError("DirectFundingConsumer: onlyAllowed failed");
        }
        _;
    }

    constructor(address vrfWrapperAddress_, address linkAddress_)
        ConfirmedOwner(msg.sender)
        VRFV2PlusWrapperConsumerBase(vrfWrapperAddress_)
    {
        VRFWrapperAddress = vrfWrapperAddress_;
        linkAddress = linkAddress_;
        emit Debug("DirectFundingConsumer: constructor called");
    }

    function requestRandomWords(address nftCollection_) public onlyAllowed {
        bytes memory extraArgs = VRFV2PlusClient._argsToBytes(VRFV2PlusClient.ExtraArgsV1({nativePayment: false}));
        (uint256 requestId, ) = requestRandomness(
            callbackGasLimit,
            requestConfirmations,
            numWords,
            extraArgs
        );
        requestIdByNftCollection[nftCollection_] = requestId;
        nftCollectionByRequestId[requestId] = nftCollection_;
        requestIds.push(requestId);
        lastRequestId = requestId;
        emit RequestSent(nftCollection_, requestId, numWords);
        // bytes memory data = abi.encode(callbackGasLimit, requestConfirmations, numWords, extraArgs);
        // uint256 fee = 0.1 ether; // Or use calculateRequestPrice if it's reliable
        // bool success = ILink(linkAddress).transferAndCall(VRFWrapperAddress, fee, data);
        //require(success, "transferAndCall failed");
    }

    // function requestRandomWords(address nftCollection_)
    //     public
    //     onlyAllowed
    //     returns (uint256)
    // {
    //     if (requestIdByNftCollection[nftCollection_] != 0) {
    //         emit Debug("REVERT: RequestIdAlreadyExists");
    //         revert RequestIdAlreadyExists();
    //     }
    //     // Only check if last request is fulfilled if there is a previous request
    //     if (lastRequestId != 0 && !requestStatusByRequestId[lastRequestId].fulfilled) {
    //         emit Debug("REVERT: LastRequestNotFulfilled");
    //         revert LastRequestNotFulfilled();
    //     }
    //     bytes memory extraArgs =
    //         VRFV2PlusClient._argsToBytes(VRFV2PlusClient.ExtraArgsV1({nativePayment: false}));
    //     uint256 requestId;
    //     uint256 reqPrice;
    //     (requestId, reqPrice) = requestRandomness(callbackGasLimit, requestConfirmations, numWords, extraArgs);
    //     requestStatusByRequestId[requestId] =
    //         RequestStatus({paid: reqPrice, randomWords: new uint256[](0), fulfilled: false});
    //     requestIdByNftCollection[nftCollection_] = requestId;
    //     nftCollectionByRequestId[requestId] = nftCollection_;
    //     requestIds.push(requestId);
    //     lastRequestId = requestId;
    //     emit RequestSent(nftCollection_, requestId, numWords);
    //     return requestId;
    // }

    function fulfillRandomWords(uint256 _requestId, uint256[] memory _randomWords) internal override {
        if (requestStatusByRequestId[_requestId].paid == 0) revert RequestNotFound();
        requestStatusByRequestId[_requestId].fulfilled = true;
        requestStatusByRequestId[_requestId].randomWords = _randomWords;
        address nftCollection = nftCollectionByRequestId[_requestId];
        emit RequestFulfilled(nftCollection, _requestId, _randomWords, requestStatusByRequestId[_requestId].paid);
    }

    function getRequestStatus(uint256 _requestId)
        external
        view
        returns (uint256 paid, bool fulfilled, uint256[] memory randomWords)
    {
        if (requestStatusByRequestId[_requestId].paid == 0) revert RequestNotFound();
        RequestStatus memory request = requestStatusByRequestId[_requestId];
        return (request.paid, request.fulfilled, request.randomWords);
    }

    /**
     * Allow withdraw of Link tokens from the contract
     */
    function withdrawLink() public onlyOwner {
        LinkTokenInterface link = LinkTokenInterface(linkAddress);
        if (!link.transfer(msg.sender, link.balanceOf(address(this)))) revert TransferFailed();
    }

    /// @notice withdrawNative withdraws the amount specified in amount to the owner
    /// @param amount the amount to withdraw, in wei
    function withdrawNative(uint256 amount) external onlyOwner {
        (bool success,) = payable(owner()).call{value: amount}("");
        // solhint-disable-next-line gas-custom-errors
        if (!success) revert WithdrawNativeFailed();
    }

    function setAllowedNftCollection(address nftCollection_, bool allowed) external onlyAllowed() {
        emit Debug("DirectFundingConsumer: setAllowedNftCollection called");
        allowedNftCollections[nftCollection_] = allowed;
    }

    function setCallbackGasLimit(uint32 newCallbackGasLimit) external onlyOwner {
        callbackGasLimit = newCallbackGasLimit;
    }

    function setRequestConfirmations(uint16 newRequestConfirmations) external onlyOwner {
        requestConfirmations = newRequestConfirmations;
    }

    function setNumWords(uint32 newNumWords) external onlyOwner {
        numWords = newNumWords;
    }

    function setFactory(address factory_) external onlyOwner {
        factory = factory_;
    }

    event Received(address, uint256);

    receive() external payable {
        emit Debug("DirectFundingConsumer: receive ETH");
        emit Received(msg.sender, msg.value);
    }
    // Debug helper to check state before initialization
    function debugState(address caller) external view returns (
        address _owner,
        address _vrfWrapper,
        address _linkToken,
        address _caller
    ) {
        return (owner(), VRFWrapperAddress, linkAddress, caller);
    }
}

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

import {IERC721} from "@openzeppelin/token/ERC721/IERC721.sol";

interface IUDUart is IERC721 {
    enum TierType {
        Normal, // Tier 0
        Twins, // Tier 1
        YellowStyle, // Tier 2
        BowieStyle, // Tier 3
        WhiteStar, // Tier 4
        WheresWally, // Tier 5
        TheOne // Tier 6 (máximo)

    }

    enum ProductType {
        Product, // Product 0
        Art // Product 1

    }

    struct NFTData {
        uint256 productId;
        TierType tier;
        ProductType productType;
        string tokenURI;
        bool isAvailable; // Si está disponible para claim
    }

    // Events
    event NFTMinted(address indexed to, uint256 indexed tokenId, uint256 indexed productId, TierType tier);
    event NFTsBurned(uint256[] tokenIds, uint256 newTokenId, TierType newTier);
    event CollectionCreated(string name, uint256 totalProducts);
    event NFTClaimed(address indexed user, uint256 indexed tokenId, string activationCode);
    event RandomnessRequested(bytes32 indexed requestId, address indexed user, string activationCode);
    event NFTsBatchMinted(uint256 count, TierType tier, ProductType productType);

    // Functions
    function burnAndUpgrade(uint256[] calldata tokenIds) external returns (uint256);
    function claimRandomNFT(address user, string memory activationCode) external returns (uint256);
    function setCollectionRandomness(uint256 randomness) external;
    function safeBatchMinting(uint256 totalToMint, TierType tier, ProductType productType, string memory tokenURI)
        external
        returns (uint256 currentBatchSize, uint256 remainingToMint);
    function safeBatchMinting(uint256 totalToMint, TierType tier, ProductType productType, uint256 customBatchSize, string memory tokenURI)
        external
        returns (uint256 currentBatchSize, uint256 remainingToMint);
    function getNFTData(uint256 tokenId) external view returns (NFTData memory);
    function canUpgradeTier(uint256[] calldata tokenIds) external view returns (bool);
    function getCollectionName() external view returns (string memory);
    function getAvailableNFTs() external view returns (uint256[] memory);
    function isActivationCodeUsed(string memory activationCode) external view returns (bool);
    function setMaxBatchSize(uint256 newMaxBatchSize) external;
    function maxBatchSize() external view returns (uint256);
}

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

pragma solidity >=0.4.16;

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

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

pragma solidity >=0.6.2;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity >=0.6.2;

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

pragma solidity ^0.8.20;

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

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

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;
    uint256 private constant SPECIAL_CHARS_LOOKUP =
        (1 << 0x08) | // backspace
            (1 << 0x09) | // tab
            (1 << 0x0a) | // newline
            (1 << 0x0c) | // form feed
            (1 << 0x0d) | // carriage return
            (1 << 0x22) | // double quote
            (1 << 0x5c); // backslash

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        return value;
    }

    /**
     * @dev Escape special characters in JSON strings. This can be useful to prevent JSON injection in NFT metadata.
     *
     * WARNING: This function should only be used in double quoted JSON strings. Single quotes are not escaped.
     *
     * NOTE: This function escapes all unicode characters, and not just the ones in ranges defined in section 2.5 of
     * RFC-4627 (U+0000 to U+001F, U+0022 and U+005C). ECMAScript's `JSON.parse` does recover escaped unicode
     * characters that are not in this range, but other tooling may provide different results.
     */
    function escapeJSON(string memory input) internal pure returns (string memory) {
        bytes memory buffer = bytes(input);
        bytes memory output = new bytes(2 * buffer.length); // worst case scenario
        uint256 outputLength = 0;

        for (uint256 i; i < buffer.length; ++i) {
            bytes1 char = bytes1(_unsafeReadBytesOffset(buffer, i));
            if (((SPECIAL_CHARS_LOOKUP & (1 << uint8(char))) != 0)) {
                output[outputLength++] = "\\";
                if (char == 0x08) output[outputLength++] = "b";
                else if (char == 0x09) output[outputLength++] = "t";
                else if (char == 0x0a) output[outputLength++] = "n";
                else if (char == 0x0c) output[outputLength++] = "f";
                else if (char == 0x0d) output[outputLength++] = "r";
                else if (char == 0x5c) output[outputLength++] = "\\";
                else if (char == 0x22) {
                    // solhint-disable-next-line quotes
                    output[outputLength++] = '"';
                }
            } else {
                output[outputLength++] = char;
            }
        }
        // write the actual length and deallocate unused memory
        assembly ("memory-safe") {
            mstore(output, outputLength)
            mstore(0x40, add(output, shl(5, shr(5, add(outputLength, 63)))))
        }

        return string(output);
    }

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

import {LinkTokenInterface} from "../../shared/interfaces/LinkTokenInterface.sol";
import {IVRFV2PlusWrapper} from "./interfaces/IVRFV2PlusWrapper.sol";

/**
 *
 * @notice Interface for contracts using VRF randomness through the VRF V2 wrapper
 * ********************************************************************************
 * @dev PURPOSE
 *
 * @dev Create VRF V2+ requests without the need for subscription management. Rather than creating
 * @dev and funding a VRF V2+ subscription, a user can use this wrapper to create one off requests,
 * @dev paying up front rather than at fulfillment.
 *
 * @dev Since the price is determined using the gas price of the request transaction rather than
 * @dev the fulfillment transaction, the wrapper charges an additional premium on callback gas
 * @dev usage, in addition to some extra overhead costs associated with the VRFV2Wrapper contract.
 * *****************************************************************************
 * @dev USAGE
 *
 * @dev Calling contracts must inherit from VRFV2PlusWrapperConsumerBase. The consumer must be funded
 * @dev with enough LINK or ether to make the request, otherwise requests will revert. To request randomness,
 * @dev call the 'requestRandomWords' function with the desired VRF parameters. This function handles
 * @dev paying for the request based on the current pricing.
 *
 * @dev Consumers must implement the fullfillRandomWords function, which will be called during
 * @dev fulfillment with the randomness result.
 */
abstract contract VRFV2PlusWrapperConsumerBase {
  error OnlyVRFWrapperCanFulfill(address have, address want);

  LinkTokenInterface internal immutable i_linkToken;
  IVRFV2PlusWrapper public immutable i_vrfV2PlusWrapper;

  /**
   * @param _vrfV2PlusWrapper is the address of the VRFV2Wrapper contract
   */
  constructor(address _vrfV2PlusWrapper) {
    IVRFV2PlusWrapper vrfV2PlusWrapper = IVRFV2PlusWrapper(_vrfV2PlusWrapper);

    i_linkToken = LinkTokenInterface(vrfV2PlusWrapper.link());
    i_vrfV2PlusWrapper = vrfV2PlusWrapper;
  }

  /**
   * @dev Requests randomness from the VRF V2+ wrapper.
   *
   * @param _callbackGasLimit is the gas limit that should be used when calling the consumer's
   *        fulfillRandomWords function.
   * @param _requestConfirmations is the number of confirmations to wait before fulfilling the
   *        request. A higher number of confirmations increases security by reducing the likelihood
   *        that a chain re-org changes a published randomness outcome.
   * @param _numWords is the number of random words to request.
   *
   * @return requestId is the VRF V2+ request ID of the newly created randomness request.
   */
  // solhint-disable-next-line chainlink-solidity/prefix-internal-functions-with-underscore
  function requestRandomness(
    uint32 _callbackGasLimit,
    uint16 _requestConfirmations,
    uint32 _numWords,
    bytes memory extraArgs
  ) internal returns (uint256 requestId, uint256 reqPrice) {
    reqPrice = i_vrfV2PlusWrapper.calculateRequestPrice(_callbackGasLimit, _numWords);
    i_linkToken.transferAndCall(
      address(i_vrfV2PlusWrapper),
      reqPrice,
      abi.encode(_callbackGasLimit, _requestConfirmations, _numWords, extraArgs)
    );
    return (i_vrfV2PlusWrapper.lastRequestId(), reqPrice);
  }

  // solhint-disable-next-line chainlink-solidity/prefix-internal-functions-with-underscore
  function requestRandomnessPayInNative(
    uint32 _callbackGasLimit,
    uint16 _requestConfirmations,
    uint32 _numWords,
    bytes memory extraArgs
  ) internal returns (uint256 requestId, uint256 requestPrice) {
    requestPrice = i_vrfV2PlusWrapper.calculateRequestPriceNative(_callbackGasLimit, _numWords);
    return (
      i_vrfV2PlusWrapper.requestRandomWordsInNative{value: requestPrice}(
        _callbackGasLimit,
        _requestConfirmations,
        _numWords,
        extraArgs
      ),
      requestPrice
    );
  }

  /**
   * @notice fulfillRandomWords handles the VRF V2 wrapper response. The consuming contract must
   * @notice implement it.
   *
   * @param _requestId is the VRF V2 request ID.
   * @param _randomWords is the randomness result.
   */
  // solhint-disable-next-line chainlink-solidity/prefix-internal-functions-with-underscore
  function fulfillRandomWords(uint256 _requestId, uint256[] memory _randomWords) internal virtual;

  function rawFulfillRandomWords(uint256 _requestId, uint256[] memory _randomWords) external {
    address vrfWrapperAddr = address(i_vrfV2PlusWrapper);
    if (msg.sender != vrfWrapperAddr) {
      revert OnlyVRFWrapperCanFulfill(msg.sender, vrfWrapperAddr);
    }
    fulfillRandomWords(_requestId, _randomWords);
  }

  /// @notice getBalance returns the native balance of the consumer contract
  function getBalance() public view returns (uint256) {
    return address(this).balance;
  }

  /// @notice getLinkToken returns the link token contract
  function getLinkToken() public view returns (LinkTokenInterface) {
    return i_linkToken;
  }
}

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

// End consumer library.
library VRFV2PlusClient {
  // extraArgs will evolve to support new features
  bytes4 public constant EXTRA_ARGS_V1_TAG = bytes4(keccak256("VRF ExtraArgsV1"));
  struct ExtraArgsV1 {
    bool nativePayment;
  }

  struct RandomWordsRequest {
    bytes32 keyHash;
    uint256 subId;
    uint16 requestConfirmations;
    uint32 callbackGasLimit;
    uint32 numWords;
    bytes extraArgs;
  }

  function _argsToBytes(ExtraArgsV1 memory extraArgs) internal pure returns (bytes memory bts) {
    return abi.encodeWithSelector(EXTRA_ARGS_V1_TAG, extraArgs);
  }
}

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

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

/// @title The ConfirmedOwner contract
/// @notice A contract with helpers for basic contract ownership.
contract ConfirmedOwner is ConfirmedOwnerWithProposal {
  constructor(address newOwner) ConfirmedOwnerWithProposal(newOwner, address(0)) {}
}

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

interface ILink {
  function transferAndCall(address to,uint256 value, bytes calldata data) external returns (bool success);
}

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

pragma solidity >=0.5.0;

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

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

pragma solidity ^0.8.20;

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

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

    /**
     * @dev Return the 512-bit addition of two uint256.
     *
     * The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
     */
    function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        assembly ("memory-safe") {
            low := add(a, b)
            high := lt(low, a)
        }
    }

    /**
     * @dev Return the 512-bit multiplication of two uint256.
     *
     * The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
     */
    function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        // 512-bit multiply [high low] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
        // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
        // variables such that product = high * 2²⁵⁶ + low.
        assembly ("memory-safe") {
            let mm := mulmod(a, b, not(0))
            low := mul(a, b)
            high := sub(sub(mm, low), lt(mm, low))
        }
    }

    /**
     * @dev Returns the addition of two unsigned integers, with a success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            success = c >= a;
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a - b;
            success = c <= a;
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a * b;
            assembly ("memory-safe") {
                // Only true when the multiplication doesn't overflow
                // (c / a == b) || (a == 0)
                success := or(eq(div(c, a), b), iszero(a))
            }
            // equivalent to: success ? c : 0
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            success = b > 0;
            assembly ("memory-safe") {
                // The `DIV` opcode returns zero when the denominator is 0.
                result := div(a, b)
            }
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            success = b > 0;
            assembly ("memory-safe") {
                // The `MOD` opcode returns zero when the denominator is 0.
                result := mod(a, b)
            }
        }
    }

    /**
     * @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.
     */
    function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {
        (bool success, uint256 result) = tryAdd(a, b);
        return ternary(success, result, type(uint256).max);
    }

    /**
     * @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.
     */
    function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {
        (, uint256 result) = trySub(a, b);
        return result;
    }

    /**
     * @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.
     */
    function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {
        (bool success, uint256 result) = tryMul(a, b);
        return ternary(success, result, type(uint256).max);
    }

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

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

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

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

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

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

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);

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

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

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

            // Make division exact by subtracting the remainder from [high low].
            uint256 remainder;
            assembly ("memory-safe") {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

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

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

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

                // Divide [high low] by twos.
                low := div(low, twos)

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

            // Shift in bits from high into low.
            low |= high * twos;

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

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

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

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

    /**
     * @dev Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
     */
    function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);
            if (high >= 1 << n) {
                Panic.panic(Panic.UNDER_OVERFLOW);
            }
            return (high << (256 - n)) | (low >> n);
        }
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // If upper 8 bits of 16-bit half set, add 8 to result
        r |= SafeCast.toUint((x >> r) > 0xff) << 3;
        // If upper 4 bits of 8-bit half set, add 4 to result
        r |= SafeCast.toUint((x >> r) > 0xf) << 2;

        // Shifts value right by the current result and use it as an index into this lookup table:
        //
        // | x (4 bits) |  index  | table[index] = MSB position |
        // |------------|---------|-----------------------------|
        // |    0000    |    0    |        table[0] = 0         |
        // |    0001    |    1    |        table[1] = 0         |
        // |    0010    |    2    |        table[2] = 1         |
        // |    0011    |    3    |        table[3] = 1         |
        // |    0100    |    4    |        table[4] = 2         |
        // |    0101    |    5    |        table[5] = 2         |
        // |    0110    |    6    |        table[6] = 2         |
        // |    0111    |    7    |        table[7] = 2         |
        // |    1000    |    8    |        table[8] = 3         |
        // |    1001    |    9    |        table[9] = 3         |
        // |    1010    |   10    |        table[10] = 3        |
        // |    1011    |   11    |        table[11] = 3        |
        // |    1100    |   12    |        table[12] = 3        |
        // |    1101    |   13    |        table[13] = 3        |
        // |    1110    |   14    |        table[14] = 3        |
        // |    1111    |   15    |        table[15] = 3        |
        //
        // The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the last 16 bytes.
        assembly ("memory-safe") {
            r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))
        }
    }

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

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

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

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
    }

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

// solhint-disable-next-line interface-starts-with-i
interface LinkTokenInterface {
  function allowance(address owner, address spender) external view returns (uint256 remaining);

  function approve(address spender, uint256 value) external returns (bool success);

  function balanceOf(address owner) external view returns (uint256 balance);

  function decimals() external view returns (uint8 decimalPlaces);

  function decreaseApproval(address spender, uint256 addedValue) external returns (bool success);

  function increaseApproval(address spender, uint256 subtractedValue) external;

  function name() external view returns (string memory tokenName);

  function symbol() external view returns (string memory tokenSymbol);

  function totalSupply() external view returns (uint256 totalTokensIssued);

  function transfer(address to, uint256 value) external returns (bool success);

  function transferAndCall(address to, uint256 value, bytes calldata data) external returns (bool success);

  function transferFrom(address from, address to, uint256 value) external returns (bool success);
}

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

interface IVRFV2PlusWrapper {
  /**
   * @return the request ID of the most recent VRF V2 request made by this wrapper. This should only
   * be relied option within the same transaction that the request was made.
   */
  function lastRequestId() external view returns (uint256);

  /**
   * @notice Calculates the price of a VRF request with the given callbackGasLimit at the current
   * @notice block.
   *
   * @dev This function relies on the transaction gas price which is not automatically set during
   * @dev simulation. To estimate the price at a specific gas price, use the estimatePrice function.
   *
   * @param _callbackGasLimit is the gas limit used to estimate the price.
   * @param _numWords is the number of words to request.
   */
  function calculateRequestPrice(uint32 _callbackGasLimit, uint32 _numWords) external view returns (uint256);

  /**
   * @notice Calculates the price of a VRF request in native with the given callbackGasLimit at the current
   * @notice block.
   *
   * @dev This function relies on the transaction gas price which is not automatically set during
   * @dev simulation. To estimate the price at a specific gas price, use the estimatePrice function.
   *
   * @param _callbackGasLimit is the gas limit used to estimate the price.
   * @param _numWords is the number of words to request.
   */
  function calculateRequestPriceNative(uint32 _callbackGasLimit, uint32 _numWords) external view returns (uint256);

  /**
   * @notice Estimates the price of a VRF request with a specific gas limit and gas price.
   *
   * @dev This is a convenience function that can be called in simulation to better understand
   * @dev pricing.
   *
   * @param _callbackGasLimit is the gas limit used to estimate the price.
   * @param _numWords is the number of words to request.
   * @param _requestGasPriceWei is the gas price in wei used for the estimation.
   */
  function estimateRequestPrice(
    uint32 _callbackGasLimit,
    uint32 _numWords,
    uint256 _requestGasPriceWei
  ) external view returns (uint256);

  /**
   * @notice Estimates the price of a VRF request in native with a specific gas limit and gas price.
   *
   * @dev This is a convenience function that can be called in simulation to better understand
   * @dev pricing.
   *
   * @param _callbackGasLimit is the gas limit used to estimate the price.
   * @param _numWords is the number of words to request.
   * @param _requestGasPriceWei is the gas price in wei used for the estimation.
   */
  function estimateRequestPriceNative(
    uint32 _callbackGasLimit,
    uint32 _numWords,
    uint256 _requestGasPriceWei
  ) external view returns (uint256);

  /**
   * @notice Requests randomness from the VRF V2 wrapper, paying in native token.
   *
   * @param _callbackGasLimit is the gas limit for the request.
   * @param _requestConfirmations number of request confirmations to wait before serving a request.
   * @param _numWords is the number of words to request.
   */
  function requestRandomWordsInNative(
    uint32 _callbackGasLimit,
    uint16 _requestConfirmations,
    uint32 _numWords,
    bytes calldata extraArgs
  ) external payable returns (uint256 requestId);

  function link() external view returns (address);
  function linkNativeFeed() external view returns (address);
}

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

import {IOwnable} from "../interfaces/IOwnable.sol";

/// @title The ConfirmedOwner contract
/// @notice A contract with helpers for basic contract ownership.
contract ConfirmedOwnerWithProposal is IOwnable {
  address private s_owner;
  address private s_pendingOwner;

  event OwnershipTransferRequested(address indexed from, address indexed to);
  event OwnershipTransferred(address indexed from, address indexed to);

  constructor(address newOwner, address pendingOwner) {
    // solhint-disable-next-line gas-custom-errors
    require(newOwner != address(0), "Cannot set owner to zero");

    s_owner = newOwner;
    if (pendingOwner != address(0)) {
      _transferOwnership(pendingOwner);
    }
  }

  /// @notice Allows an owner to begin transferring ownership to a new address.
  function transferOwnership(address to) public override onlyOwner {
    _transferOwnership(to);
  }

  /// @notice Allows an ownership transfer to be completed by the recipient.
  function acceptOwnership() external override {
    // solhint-disable-next-line gas-custom-errors
    require(msg.sender == s_pendingOwner, "Must be proposed owner");

    address oldOwner = s_owner;
    s_owner = msg.sender;
    s_pendingOwner = address(0);

    emit OwnershipTransferred(oldOwner, msg.sender);
  }

  /// @notice Get the current owner
  function owner() public view override returns (address) {
    return s_owner;
  }

  /// @notice validate, transfer ownership, and emit relevant events
  function _transferOwnership(address to) private {
    // solhint-disable-next-line gas-custom-errors
    require(to != msg.sender, "Cannot transfer to self");

    s_pendingOwner = to;

    emit OwnershipTransferRequested(s_owner, to);
  }

  /// @notice validate access
  function _validateOwnership() internal view {
    // solhint-disable-next-line gas-custom-errors
    require(msg.sender == s_owner, "Only callable by owner");
  }

  /// @notice Reverts if called by anyone other than the contract owner.
  modifier onlyOwner() {
    _validateOwnership();
    _;
  }
}

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

pragma solidity ^0.8.20;

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

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

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

interface IOwnable {
  function owner() external returns (address);

  function transferOwnership(address recipient) external;

  function acceptOwnership() external;
}

{
  "remappings": [
    "@forge-std/=lib/forge-std/src/",
    "@openzeppelin/=lib/openzeppelin-contracts/contracts/",
    "@src/=src/",
    "@chainlink/=lib/chainlink-brownie-contracts/",
    "@forge-std/=lib/forge-std/src/",
    "@src/=src/",
    "chainlink-brownie-contracts/=lib/chainlink-brownie-contracts/",
    "erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/",
    "forge-std/=lib/forge-std/src/",
    "halmos-cheatcodes/=lib/openzeppelin-contracts/lib/halmos-cheatcodes/src/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "ipfs",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "cancun",
  "viaIR": true,
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"directFundingConsumer_","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CollectionNameExists","type":"error"},{"inputs":[],"name":"CollectionNameRequired","type":"error"},{"inputs":[],"name":"IndexOutOfBounds","type":"error"},{"inputs":[],"name":"InvalidCollection","type":"error"},{"inputs":[],"name":"NotOwner","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"VRFCoordinatorRequired","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"collection","type":"address"},{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"string","name":"collectionName","type":"string"},{"indexed":false,"internalType":"uint256","name":"index","type":"uint256"}],"name":"CollectionCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"collection","type":"address"},{"indexed":false,"internalType":"string","name":"collectionName","type":"string"}],"name":"CollectionInitialized","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[{"internalType":"string","name":"","type":"string"}],"name":"collectionNameToAddress","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"collections","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"string","name":"collectionName","type":"string"},{"internalType":"bool","name":"initializeNow","type":"bool"}],"name":"createCollection","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"directFundingConsumer","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getAllCollections","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"name","type":"string"}],"name":"getCollectionByName","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCollectionCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"collection","type":"address"}],"name":"getCollectionInfo","outputs":[{"internalType":"string","name":"name","type":"string"},{"internalType":"address","name":"owner","type":"address"},{"internalType":"bool","name":"initialized","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"getCollectionsByOwner","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"isValidCollection","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"ownerToCollections","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60803460cd57601f613c3d38819003918201601f19168301916001600160401b0383118484101760d15780849260209460405283398101031260cd57516001600160a01b0381169081900360cd57331560ba575f8054336001600160a01b0319821681178355604051939290916001600160a01b0316907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09080a3600580546001600160a01b031916919091179055613b5790816100e68239f35b631e4fbdf760e01b5f525f60045260245ffd5b5f80fd5b634e487b7160e01b5f52604160045260245ffdfe6080806040526004361015610012575f80fd5b5f905f3560e01c9081631c10106f14610a1357508063227cb81f146108d257806348d79ed4146109b15780636804a9581461093457806369f652fd146108d2578063715018a61461087b57806375900e6a1461083e57806377573a41146104aa5780638da5cb5b146104835780639056a04b14610275578063a6abd3b51461024c578063e178d60c146101c1578063f2fde38b1461013b5763fdbda0ec146100b8575f80fd5b3461013857602036600319011261013857600435906001548210156101385760015482101561012457600181527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf69091015460405160039290921b1c6001600160a01b03168152602090f35b634e487b7160e01b81526032600452602490fd5b80fd5b503461013857602036600319011261013857610155610ab1565b61015d610b56565b6001600160a01b031680156101ad5781546001600160a01b03198116821783556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b631e4fbdf760e01b82526004829052602482fd5b5034610138576020366003190112610138576001600160a01b036101e3610ab1565b168152600260205260408120604051918260208354918281520192825260208220915b81811061022d576102298561021d81870382610a2d565b60405191829182610af0565b0390f35b82546001600160a01b0316845260209093019260019283019201610206565b50346101385780600319360112610138576005546040516001600160a01b039091168152602090f35b5034610138576020366003190112610138576001600160a01b03610297610ab1565b16808252600460205260ff60408320541615610474576040516332045a8560e01b8152908282600481845afa9182156104695783926103e7575b50604051638da5cb5b60e01b815290602082600481845afa9182156103975784926103a2575b50602060049160405192838092630ac77c9f60e11b82525afa908115610397578491610353575b506103389350604051938493606085526060850190610b32565b6001600160a01b039092166020840152151560408301520390f35b90506020813d60201161038f575b8161036e60209383610a2d565b8101031261038b5751801515810361038b5761033893505f61031e565b8380fd5b3d9150610361565b6040513d86823e3d90fd5b9091506020813d6020116103df575b816103be60209383610a2d565b8101031261038b57516001600160a01b038116810361038b579060206102f7565b3d91506103b1565b909150823d8082843e6103fa8184610a2d565b8201916020818403126104655780519067ffffffffffffffff8211610461570182601f8201121561046557805161043081610a4f565b9361043e6040519586610a2d565b81855260208284010111610461578060208093018386015e83010152905f6102d1565b8280fd5b5080fd5b6040513d85823e3d90fd5b63517172a160e11b8252600482fd5b5034610138578060031936011261013857546040516001600160a01b039091168152602090f35b50346107b25760603660031901126107b2576104c4610ab1565b60243567ffffffffffffffff81116107b2576104e4903690600401610a6b565b916044359182151583036107b25782906104fc610b56565b6001600160a01b038116610838575033925b6107ca575b600554604051612fa58082019591929091906001600160a01b031667ffffffffffffffff8711848810176107b6578392610b7d843960808752606061055b608089018a610b32565b6001600160a01b03909316602089018190523060408a015297015203905ff080156107a75760018060a01b031692600154600160401b8110156107b6578060016105aa92016001556001610ac7565b81546001600160a01b0360039290921b91821b19169086901b1790555f8181526002602052604090208054600160401b8110156107b6576105f091600182018155610ac7565b81546001600160a01b0360039290921b82811b199091169087901b179091555f858152600460205260409020805460ff1916600117905560055416803b156107b2575f80916044604051809481936308f6d2ed60e21b83528a6004840152600160248401525af180156107a757610792575b506001545f19810190811161077e577fa0c4f95bdd7626e7a88b342add50ddbdcb35e758aeea6469a3ea02eea7cddeda85916040518091604082526106aa604083018b610b32565b9060208301520390a36106c3575b602082604051908152f35b813b1561013857604051638eea4d7f60e01b8152818160048183875af180156107735761075e575b5050807f5b1230bdec05d66024e342c80533b0a25fb991527e9ebbd301400029b37d43616107556020946040518681835180838601835e81016003815203019020846bffffffffffffffffffffffff60a01b82541617905560405191829187835287830190610b32565b0390a25f6106b8565b610769828092610a2d565b61013857806106eb565b6040513d84823e3d90fd5b634e487b7160e01b84526011600452602484fd5b61079f9193505f90610a2d565b5f915f610662565b6040513d5f823e3d90fd5b5f80fd5b634e487b7160e01b5f52604160045260245ffd5b8351156108295760405184518060208701835e60039082019081528190036020019020546001600160a01b031661081a576005546001600160a01b031661051357636f7cdf9f60e01b5f5260045ffd5b630519244560e01b5f5260045ffd5b63d2be7ae760e01b5f5260045ffd5b9261050e565b346107b25760203660031901126107b2576001600160a01b0361085f610ab1565b165f526004602052602060ff60405f2054166040519015158152f35b346107b2575f3660031901126107b257610893610b56565b5f80546001600160a01b0319811682556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b346107b25760203660031901126107b25760043567ffffffffffffffff81116107b2576109056020913690600401610a6b565b8160405191805191829101835e600390820190815281900382019020546040516001600160a01b039091168152f35b346107b2575f3660031901126107b25760405180602060015491828152019060015f527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6905f5b818110610992576102298561021d81870382610a2d565b82546001600160a01b031684526020909301926001928301920161097b565b346107b25760403660031901126107b2576109ca610ab1565b6001600160a01b03165f908152600260205260409020805460243591908210156107b2576020916109fa91610ac7565b905460405160039290921b1c6001600160a01b03168152f35b346107b2575f3660031901126107b2576020906001548152f35b90601f8019910116810190811067ffffffffffffffff8211176107b657604052565b67ffffffffffffffff81116107b657601f01601f191660200190565b81601f820112156107b257803590610a8282610a4f565b92610a906040519485610a2d565b828452602083830101116107b257815f926020809301838601378301015290565b600435906001600160a01b03821682036107b257565b8054821015610adc575f5260205f2001905f90565b634e487b7160e01b5f52603260045260245ffd5b60206040818301928281528451809452019201905f5b818110610b135750505090565b82516001600160a01b0316845260209384019390920191600101610b06565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b5f546001600160a01b03163303610b6957565b63118cdaa760e01b5f523360045260245ffdfe60806040523461044a57612fa5803803806100198161044e565b92833981019060808183031261044a5780516001600160401b03811161044a57810182601f8201121561044a578051906001600160401b0382116103515761006a601f8301601f191660200161044e565b938285526020838301011161044a57815f9260208093018387015e8401015261009560208201610473565b6100ad60606100a660408501610473565b9301610473565b906100b8604061044e565b600681526515511550549560d21b6020820152845190946001600160401b038211610351575f5490600182811c92168015610440575b60208310146103335781601f8493116103d3575b50602090601f8311600114610370575f92610365575b50508160011b915f199060031b1c1916175f555b83516001600160401b03811161035157600154600181811c91168015610347575b602082101461033357601f81116102d0575b50602094601f821160011461026d579481929394955f92610262575b50508160011b915f199060031b1c1916176001555b6001600160a01b031691821561024f57600680546001600160a01b03198116851790915560405193906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a36001600781905560326008555f600955600a8054600d929092556001600160b01b031990911660109290921b62010000600160b01b0316919091179055600b80546001600160a01b0319166001600160a01b0392909216919091179055612b1d90816104888239f35b631e4fbdf760e01b5f525f60045260245ffd5b015190505f8061017b565b601f1982169560015f52805f20915f5b8881106102b8575083600195969798106102a0575b505050811b01600155610190565b01515f1960f88460031b161c191690555f8080610292565b9192602060018192868501518155019401920161027d565b60015f527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6601f830160051c81019160208410610329575b601f0160051c01905b81811061031e575061015f565b5f8155600101610311565b9091508190610308565b634e487b7160e01b5f52602260045260245ffd5b90607f169061014d565b634e487b7160e01b5f52604160045260245ffd5b015190505f80610118565b5f8080528281209350601f198516905b8181106103bb57509084600195949392106103a3575b505050811b015f5561012c565b01515f1960f88460031b161c191690555f8080610396565b92936020600181928786015181550195019301610380565b5f80529091507f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563601f840160051c81019160208510610436575b90601f859493920160051c01905b8181106104285750610102565b5f815584935060010161041b565b909150819061040d565b91607f16916100ee565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761035157604052565b51906001600160a01b038216820361044a5756fe6080806040526004361015610012575f80fd5b5f905f3560e01c90816301ffc9a71461219b575080630431a3251461216957806306fdde0314611d8b578063081812fc1461212d578063095ea7b3146120435780630ad4c4f414611f175780630c98483214611e9b578063158ef93e14611e765780631727fbf214611e5b57806323b872dd14611e445780632913daa014611e275780632b26a6bf14611da657806332045a8514611d8b57806332702c9514611cc75780633d8df38414611c8557806342842e0e14611c5a5780636352211e14611c2a57806370a0823114611bd9578063715018a614611b7e5780637cb8d83414611b555780637dce654a146115dd5780638da5cb5b146115b55780638eea4d7f1461142a57806395d89b4114611347578063a22cb465146112a0578063a5b3824014611274578063a6abd3b51461124b578063aa0a0b8914611217578063aa2fe91b146111d8578063b01a116814610ec9578063b88d4fde14610e66578063b90712e714610c6d578063c45a015514610c40578063c87b56dd14610be5578063cfbd488514610b7f578063d363d31f14610b29578063d8f0024d14610aaf578063ddd33d8614610640578063e985e9c5146105e8578063ee87043f146102a7578063efd87e29146102775763f2fde38b146101ec575f80fd5b3461027457602036600319011261027457610205612237565b61020d6129a4565b6001600160a01b0316801561026057600680546001600160a01b0319811683179091556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a380f35b631e4fbdf760e01b82526004829052602482fd5b80fd5b5034610274576020366003190112610274576102916129a4565b600435600955600160ff19600a541617600a5580f35b5034610274576040366003190112610274576102c1612237565b906024356001600160401b0381116105e4576102e1903690600401612389565b91338252601160205260ff60408320541615806105cf575b6105c057600a549260ff8460081c16156105b1576002600754146105a25760026007556001600160a01b0382169384156105935760ff16156105845760405160ff825191602081818601948086835e81016010815203019020541661057557600e54156105665760405160208184518085835e81016010815203019020600160ff19825416179055600954906103c760546040518093602082019586526001600160601b03198860601b166040830152865180918484015e810188838201520301601f198101835282612317565b51902091600e5492831561055257836103e091066127b3565b90549060031b1c92838552600f6020526040852054905f19810190811161053e5761040a906127b3565b90549060031b1c6104368161041e846127b3565b90919082549060031b91821b915f19901b1916179055565b8552600f6020526040852055600e54801561052a575f1901610457816127b3565b8154905f199060031b1b19169055600e55828452600f6020525f6040852055828452600c6020526003604085200160ff19815416905561049e8360018060a01b03926129cb565b16806104b857637e27328960e01b84526004839052602484fd5b92849330810361050e5760208480877f3bb111f65b6aebb51a630cbfb2249bede82fd02bc082480ef38a9a4ebf1591ae6104fe8860405191829188835288830190612213565b0390a36001600755604051908152f35b6364283d7b60e01b825230600452602484905260445260649150fd5b634e487b7160e01b85526031600452602485fd5b634e487b7160e01b86526011600452602486fd5b634e487b7160e01b85526012600452602485fd5b63b573562d60e01b8452600484fd5b63dee9dea160e01b8452600484fd5b63b573562d60e01b8352600483fd5b630702b3d960e41b8452600484fd5b633ee5aeb560e01b8352600483fd5b6321c4e35760e21b8352600483fd5b63019a5d1d60e71b8252600482fd5b506006546001600160a01b03163314156102f9565b5080fd5b5034610274576040366003190112610274576040610604612237565b9161060d61224d565b9260018060a01b031681526005602052209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b50346102745760a0366003190112610274576004356024359160078310156102745760443560028110156105e457606435916084356001600160401b0381116105e457610691903690600401612389565b92338252601160205260ff6040832054161580610a9a575b6105c05760ff600a5460081c1615610a8b578415610a7c578015610a265760c881116109ce57808511156109c3576106e29080956127a6565b92815b858110610732575050507f7ba5820de50d8c7d8e432ce6b29dfd1d996502fb255ba4414dcdfe397dfb0244906040946107238651928392878461281c565b0390a182519182526020820152f35b600d5461073e81612768565b600d5561074b8130612a8a565b80845260126020526107608860408620612776565b8084526013602052610775856040862061278e565b604051610781816122fc565b858152602081016107928a82612531565b60408201906107a1888361253d565b6060830190868252608084019260018452858952600c602052604089209451855560018501915160078110156109af576107db9083612776565b51600281101561099b57815461ff00191660089190911b61ff001617905551805160028401916001600160401b0382116109875761081983546123a7565b601f811161094c575b50602090601f83116001146108e357826108749695936003959361085b938d926108d8575b50508160011b915f199060031b1c19161790565b90555b51151591019060ff801983541691151516179055565b61087d816127cb565b600e545f1981019081116108c457818691600194938752600f60205260408720556040516108ab818c612206565b5f516020612ac85f395f51905f5260203092a4016106e5565b634e487b7160e01b85526011600452602485fd5b015190505f80610847565b838a52818a209190601f1984168b5b8181106109345750926001928592610874999896600398961061091d575b505050811b01905561085e565b01515f1983881b60f8161c191690555f8080610910565b929360206001819287860151815501950193016108f2565b61097790848b5260208b20601f850160051c8101916020861061097d575b601f0160051c0190612752565b5f610822565b909150819061096a565b634e487b7160e01b89526041600452602489fd5b634e487b7160e01b89526021600452602489fd5b634e487b7160e01b8a52602160045260248afd5b506106e284806127a6565b60405162461bcd60e51b815260206004820152602a60248201527f437573746f6d2062617463682073697a6520746f6f206c6172676520666f72206044820152696761732073616665747960b01b6064820152608490fd5b60405162461bcd60e51b815260206004820152602860248201527f437573746f6d2062617463682073697a65206d75737420626520677265617465604482015267072207468616e20360c41b6064820152608490fd5b63a8132f5d60e01b8252600482fd5b6321c4e35760e21b8252600482fd5b506006546001600160a01b03163314156106a9565b5034610274576020366003190112610274576004356001600160401b0381116105e457610ae0903690600401612389565b9060ff600a5460081c1615610b1a57602060ff818085604051928184925191829101835e8101601081520301902054166040519015158152f35b6321c4e35760e21b8152600490fd5b503461027457602036600319011261027457610b43612237565b610b4b6129a4565b6001600160a01b03168015610b70576001600160601b0360a01b600b541617600b5580f35b63a9d8d06360e01b8252600482fd5b503461027457602036600319011261027457610b99612237565b610ba16129a4565b6001600160a01b0316808252601160205260408220805460ff191690557f44f4322f8daa225d5f4877ad0f7d3dfba248a774396f3ca99405ed40a044fe818280a280f35b503461027457602036600319011261027457610c02600435612982565b5080604051610c12602082612317565b5250610c3c604051610c25602082612317565b5f8152604051918291602083526020830190612213565b0390f35b5034610274578060031936011261027457600a5460405160109190911c6001600160a01b03168152602090f35b5034610274578060031936011261027457610c866129a4565b600a5460ff8160081c1615610a8b57600b54604051633995086d60e11b81523060048201526001600160a01b03909116908390602081602481865afa908115610e5b578291610e22575b5060246040518094819363d8a4676f60e01b835260048301525afa908115610e175783908492610d46575b5080610d3c575b610d0a578280f35b805115610d28576020015160095560ff1916600117600a555f808280f35b634e487b7160e01b83526032600452602483fd5b5080511515610d02565b9150503d8084833e610d588183612317565b810190606081830312610e13576020810151908115158203610e0b576040810151906001600160401b038211610e0f57019180601f84011215610e0b578251926001600160401b038411610df7578360051b9060405194610dbc6020840187612317565b8552602080860192820101928311610df357602001905b828210610de3575050505f610cfb565b8151815260209182019101610dd3565b8680fd5b634e487b7160e01b86526041600452602486fd5b8480fd5b8580fd5b8380fd5b6040513d85823e3d90fd5b9150506020813d602011610e53575b81610e3e60209383612317565b81010312610e4f578390515f610cd0565b5f80fd5b3d9150610e31565b6040513d84823e3d90fd5b503461027457608036600319011261027457610e80612237565b610e8861224d565b606435916001600160401b038311610e135736602384011215610e1357610ebc610ec6933690602481600401359101612353565b9160443591612842565b80f35b5034610274576080366003190112610274576004356024359160078310156102745760443560028110156105e4576064356001600160401b0381116111d457610f16903690600401612389565b91338152601160205260ff60408220541615806111bf575b6111b05760ff600a5460081c1615610b1a5783156111a1576008548085111561119657610f5c9080956127a6565b92815b858110610f9d575050507f7ba5820de50d8c7d8e432ce6b29dfd1d996502fb255ba4414dcdfe397dfb0244906040946107238651928392878461281c565b600d54610fa981612768565b600d55610fb68130612a8a565b8084526012602052610fcb8860408620612776565b8084526013602052610fe0856040862061278e565b604051610fec816122fc565b85815260208101610ffd8a82612531565b604082019061100c888361253d565b6060830190868252608084019260018452858952600c602052604089209451855560018501915160078110156109af576110469083612776565b51600281101561099b57815461ff00191660089190911b61ff001617905551805160028401916001600160401b0382116109875761108483546123a7565b601f8111611166575b50602090601f831160011461111557826110c59695936003959361085b938d926108d85750508160011b915f199060031b1c19161790565b6110ce816127cb565b600e545f1981019081116108c457818691600194938752600f60205260408720556040516110fc818c612206565b5f516020612ac85f395f51905f5260203092a401610f5f565b838a52818a209190601f1984168b5b81811061114e57509260019285926110c5999896600398961061091d57505050811b01905561085e565b92936020600181928786015181550195019301611124565b61119090848b5260208b20601f850160051c8101916020861061097d57601f0160051c0190612752565b5f61108d565b50610f5c84806127a6565b63a8132f5d60e01b8152600490fd5b63019a5d1d60e71b8152600490fd5b506006546001600160a01b0316331415610f2e565b8280fd5b50346102745760203660031901126102745760209060ff906040906001600160a01b03611203612237565b168152601184522054166040519015158152f35b50346102745760203660031901126102745760ff60406020926004358152601384522054166112496040518092612263565bf35b5034610274578060031936011261027457600b546040516001600160a01b039091168152602090f35b503461027457806003193601126102745760ff600a5460081c1615610b1a576020600e54604051908152f35b5034610274576040366003190112610274576112ba612237565b6024359081151590818303610e13576001600160a01b03169182156113335761130490338552600560205260408520845f5260205260405f209060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a380f35b630b61174360e31b84526004839052602484fd5b503461027457806003193601126102745760405190806001549061136a826123a7565b808552916001811690811561140357506001146113a6575b610c3c8461139281860382612317565b604051918291602083526020830190612213565b600181527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b8082106113e95750909150810160200161139282611382565b9192600181602092548385880101520191019092916113d0565b60ff191660208087019190915292151560051b850190920192506113929150839050611382565b5034610e4f575f366003190112610e4f576006546001600160a01b03163314158061159a575b61158b5760ff600a5460081c1661157d57600b54604051633995086d60e11b81523060048201526001600160a01b0390911690602081602481855afa908115611540575f9161154b575b50156114fd575b5061010061ff0019600a541617600a557fb9c7ca2c1d7d6ac251b4b3d037f933e5f54305b9ca8ddb8047d04e4cc6172a276114f16114dd6123df565b604051918291604083526040830190612213565b3060208301520390a180f35b803b15610e4f575f809160246040518094819363203256c560e21b83523060048401525af1801561154057156114a15761153991505f90612317565b5f5f6114a1565b6040513d5f823e3d90fd5b90506020813d602011611575575b8161156660209383612317565b81010312610e4f57515f61149a565b3d9150611559565b62dc149f60e41b5f5260045ffd5b63fa49961f60e01b5f5260045ffd5b50600a543360109190911c6001600160a01b03161415611450565b34610e4f575f366003190112610e4f576006546040516001600160a01b039091168152602090f35b34610e4f576115eb366122aa565b8015611b465781355f818152600260205260409020546001600160a01b031692839291338403611b37575f52600c60205260405f20916040519261162e846122fc565b8054845260ff600360018301549261165e83602089019561165182821688612531565b60081c166040890161253d565b61166a60028201612493565b6060880152015416151560808501525191600783101593846118d45751935f5b838110611a8857506118d4576006831015611a795760018301809311611a655760078310156118d4575f5b8281106118e857505050600d54926116cc84612768565b600d55604051946116dc866122fc565b83865260208601926116ee8185612531565b604087019160018352602097604051956117088a88612317565b5f87526060820196875260808201945f8652895f52600c8b5260405f209251835560018301915160078110156118d4576117429083612776565b5160028110156118d45761ff0082549160081b169061ff001916179055600281019551938451966001600160401b0388116118c05789978b9661178583546123a7565b601f8111611892575b508790601f831160011461181f578a945f516020612ac85f395f51905f529998979461085b856117da966118099a966003965f926108d85750508160011b915f199060031b1c19161790565b815f52601285526117ee8460405f20612776565b815f526013855260405f20600160ff19825416179055612a8a565b6118166040518092612206565ba4604051908152f35b99989796959493929190601f1982169a835f52885f209b5f5b8181106118785750936001848d9e6003955f516020612ac85f395f51905f529e9f9a97956118099c9a966117da9a1061091d57505050811b01905561085e565b838301518e556001909d019c8f9c50928a01928a01611838565b6118ba90845f52895f20601f850160051c8101918b861061097d57601f0160051c0190612752565b8d61178e565b634e487b7160e01b5f52604160045260245ffd5b634e487b7160e01b5f52602160045260245ffd5b6118f38184846126e4565b355f818152600260205260409020546001600160a01b03168015908115611a32575b5f83815260026020526040812080546001600160a01b03191690558390827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8280a450611a2057508061196b60019285856126e4565b355f52600c6020525f60036040822082815582858201556002810161199081546123a7565b90816119df575b505001556119a68185856126e4565b355f52601260205260405f20805460ff191690556119c58185856126e4565b355f52601360205260405f20805460ff19169055016116b5565b81601f86931188146119f55750555b8b80611997565b81835260208320611a1091601f0160051c8101908901612752565b80825281602081209155556119ee565b637e27328960e01b5f5260045260245ffd5b5f83815260046020526040902080546001600160a01b0319169055805f52600360205260405f205f198154019055611915565b634e487b7160e01b5f52601160045260245ffd5b63677b7d5360e01b5f5260045ffd5b866001600160a01b03611aba611a9f8488886126e4565b355f908152600260205260409020546001600160a01b031690565b1603611b3757611acb8185856126e4565b355f52600c6020528160ff600160405f20015416906118d45760078110156118d4578503611b2857611afe8185856126e4565b355f52600c6020528560405f205403611b195760010161168a565b631e3bf80160e11b5f5260045ffd5b63e59c44d360e01b5f5260045ffd5b6359dc379f60e01b5f5260045ffd5b635ca8eceb60e11b5f5260045ffd5b34610e4f575f366003190112610e4f57604060ff600a5416600954825191151582526020820152f35b34610e4f575f366003190112610e4f57611b966129a4565b600680546001600160a01b031981169091555f906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b34610e4f576020366003190112610e4f576001600160a01b03611bfa612237565b168015611c17575f526003602052602060405f2054604051908152f35b6322718ad960e21b5f525f60045260245ffd5b34610e4f576020366003190112610e4f576020611c48600435612982565b6040516001600160a01b039091168152f35b34610e4f57611c83611c6b36612270565b9060405192611c7b602085612317565b5f8452612842565b005b34610e4f57611c93366122aa565b9060ff600a5460081c1615611cb857602091611cae91612708565b6040519015158152f35b6321c4e35760e21b5f5260045ffd5b34610e4f575f366003190112610e4f5760ff600a5460081c1615611cb857604051806020600e5492838152018092600e5f527fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fd905f5b818110611d755750505081611d33910382612317565b604051918291602083019060208452518091526040830191905f5b818110611d5c575050500390f35b8251845285945060209384019390920191600101611d4e565b8254845260209093019260019283019201611d1d565b34610e4f575f366003190112610e4f57610c3c6113926123df565b34610e4f576020366003190112610e4f57600435611dc26129a4565b8015611e185760c88111611e095760407f6b141d34195f1cbfa2080571bebbe19ad6d201cc0d1d53c70550795d14a4be8391600854908060085582519182526020820152a1005b631e80759560e21b5f5260045ffd5b637862e95960e01b5f5260045ffd5b34610e4f575f366003190112610e4f576020600854604051908152f35b34610e4f57611c83611e5536612270565b91612549565b34610e4f575f366003190112610e4f57602060405160078152f35b34610e4f575f366003190112610e4f57602060ff600a5460081c166040519015158152f35b34610e4f576020366003190112610e4f57611eb4612237565b611ebc6129a4565b6001600160a01b03168015611f0857805f52601160205260405f20600160ff198254161790557f83b05b6735acd4b85e3bded8e72c851d1a87718f81e3c8e6f0c9d9a2baa88e465f80a2005b63a9d8d06360e01b5f5260045ffd5b34610e4f576020366003190112610e4f576004355f6080604051611f3a816122fc565b828152826020820152826040820152606080820152015260ff600a5460081c1615611cb8575f818152600260205260409020546001600160a01b031615612034575f52600c60205260405f20604051611f92816122fc565b8154815260018201546120276020830193611fb060ff841686612531565b611fc460ff604086019460081c168461253d565b61201560ff6003611fd760028501612493565b93606088019485520154169360808601941515855261200a60405197889760208952516020890152516040880190612206565b516060860190612263565b5160a0608085015260c0840190612213565b9051151560a08301520390f35b6303dcb5bb60e01b5f5260045ffd5b34610e4f576040366003190112610e4f5761205c612237565b60243561206881612982565b3315158061211a575b806120ed575b6120da5781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f90815260046020526040902080546001600160a01b0319166001600160a01b03909216919091179055005b63a9fbf51f60e01b5f523360045260245ffd5b506001600160a01b0381165f90815260056020908152604080832033845290915290205460ff1615612077565b506001600160a01b038116331415612071565b34610e4f576020366003190112610e4f5760043561214a81612982565b505f526004602052602060018060a01b0360405f205416604051908152f35b34610e4f576020366003190112610e4f576004355f526012602052602060ff60405f2054166112496040518092612206565b34610e4f576020366003190112610e4f576004359063ffffffff60e01b8216809203610e4f576020916380ac58cd60e01b81149081156121f5575b81156121e4575b5015158152f35b6301ffc9a760e01b149050836121dd565b635b5e139f60e01b811491506121d6565b9060078210156118d45752565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b0382168203610e4f57565b602435906001600160a01b0382168203610e4f57565b9060028210156118d45752565b6060906003190112610e4f576004356001600160a01b0381168103610e4f57906024356001600160a01b0381168103610e4f579060443590565b906020600319830112610e4f576004356001600160401b038111610e4f5782602382011215610e4f578060040135926001600160401b038411610e4f5760248460051b83010111610e4f576024019190565b60a081019081106001600160401b038211176118c057604052565b90601f801991011681019081106001600160401b038211176118c057604052565b6001600160401b0381116118c057601f01601f191660200190565b92919261235f82612338565b9161236d6040519384612317565b829481845281830111610e4f578281602093845f960137010152565b9080601f83011215610e4f578160206123a493359101612353565b90565b90600182811c921680156123d5575b60208310146123c157565b634e487b7160e01b5f52602260045260245ffd5b91607f16916123b6565b604051905f825f54916123f1836123a7565b80835292600181169081156124745750600114612417575b61241592500383612317565b565b505f80805290917f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e5635b81831061245857505090602061241592820101612409565b6020919350806001915483858901015201910190918492612440565b6020925061241594915060ff191682840152151560051b820101612409565b9060405191825f8254926124a6846123a7565b808452936001811690811561250f57506001146124cb575b5061241592500383612317565b90505f9291925260205f20905f915b8183106124f3575050906020612415928201015f6124be565b60209193508060019154838589010152019101909184926124da565b90506020925061241594915060ff191682840152151560051b8201015f6124be565b60078210156118d45752565b60028210156118d45752565b6001600160a01b03909116919082156126d1575f828152600260205260409020546001600160a01b03169282903315158061263c575b5084612609575b805f52600360205260405f2060018154019055815f52600260205260405f20816001600160601b0360a01b825416179055847fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a46001600160a01b03168083036125f157505050565b6364283d7b60e01b5f5260045260245260445260645ffd5b5f82815260046020526040902080546001600160a01b0319169055845f52600360205260405f205f198154019055612586565b90915080612680575b156126525782905f61257f565b828461266a57637e27328960e01b5f5260045260245ffd5b63177e802f60e01b5f523360045260245260445ffd5b5033841480156126af575b8061264557505f838152600460205260409020546001600160a01b03163314612645565b505f84815260056020908152604080832033845290915290205460ff1661268b565b633250574960e11b5f525f60045260245ffd5b91908110156126f45760051b0190565b634e487b7160e01b5f52603260045260245ffd5b90801561274c575f5b81811061272057505050600190565b336001600160a01b03612737611a9f8486886126e4565b160361274557600101612711565b5050505f90565b50505f90565b81811061275d575050565b5f8155600101612752565b5f198114611a655760010190565b9060078110156118d45760ff80198354169116179055565b9060028110156118d45760ff80198354169116179055565b91908203918211611a6557565b600e548110156126f457600e5f5260205f2001905f90565b600e5490680100000000000000008210156118c05760018201600e55600e548210156126f457600e5f527fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fd90910155565b60409061283b6124159496959396606083019783526020830190612206565b0190612263565b929161284f818386612549565b813b61285c575b50505050565b604051630a85bd0160e11b81523360048201526001600160a01b03948516602482015260448101919091526080606482015292169190602090829081906128a7906084830190612213565b03815f865af15f918161293d575b5061290a57503d15612903573d6128cb81612338565b906128d96040519283612317565b81523d5f602083013e5b805190816128fe5782633250574960e11b5f5260045260245ffd5b602001fd5b60606128e3565b6001600160e01b03191663757a42ff60e11b0161292b57505f808080612856565b633250574960e11b5f5260045260245ffd5b9091506020813d60201161297a575b8161295960209383612317565b81010312610e4f57516001600160e01b031981168103610e4f57905f6128b5565b3d915061294c565b5f818152600260205260409020546001600160a01b0316908115611a20575090565b6006546001600160a01b031633036129b857565b63118cdaa760e01b5f523360045260245ffd5b5f828152600260205260409020546001600160a01b0316919082612a57575b6001600160a01b031680612a3f575b815f52600260205260405f20816001600160601b0360a01b825416179055827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a490565b805f52600360205260405f20600181540190556129f9565b5f82815260046020526040902080546001600160a01b0319169055825f52600360205260405f205f1981540190556129ea565b906001600160a01b038216156126d1576001600160a01b0391612aad91906129cb565b16612ab457565b6339e3563760e11b5f525f60045260245ffdfecb765117d24d44acc83ff837ed7e403da5f504948020b79556c3790fdee5a54aa2646970667358221220ad598ca8894218a1bf63cb4d1102abb0df146a657e29e1992533a94a8ee9b5fd64736f6c634300081e0033a264697066735822122083e5e67452b0d811873d570494b2a1b76932a2be45221419d8375978b18444c964736f6c634300081e0033000000000000000000000000d15d65d64ba5a43ec5036107eb4b823acc093906

0x6080806040526004361015610012575f80fd5b5f905f3560e01c9081631c10106f14610a1357508063227cb81f146108d257806348d79ed4146109b15780636804a9581461093457806369f652fd146108d2578063715018a61461087b57806375900e6a1461083e57806377573a41146104aa5780638da5cb5b146104835780639056a04b14610275578063a6abd3b51461024c578063e178d60c146101c1578063f2fde38b1461013b5763fdbda0ec146100b8575f80fd5b3461013857602036600319011261013857600435906001548210156101385760015482101561012457600181527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf69091015460405160039290921b1c6001600160a01b03168152602090f35b634e487b7160e01b81526032600452602490fd5b80fd5b503461013857602036600319011261013857610155610ab1565b61015d610b56565b6001600160a01b031680156101ad5781546001600160a01b03198116821783556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b631e4fbdf760e01b82526004829052602482fd5b5034610138576020366003190112610138576001600160a01b036101e3610ab1565b168152600260205260408120604051918260208354918281520192825260208220915b81811061022d576102298561021d81870382610a2d565b60405191829182610af0565b0390f35b82546001600160a01b0316845260209093019260019283019201610206565b50346101385780600319360112610138576005546040516001600160a01b039091168152602090f35b5034610138576020366003190112610138576001600160a01b03610297610ab1565b16808252600460205260ff60408320541615610474576040516332045a8560e01b8152908282600481845afa9182156104695783926103e7575b50604051638da5cb5b60e01b815290602082600481845afa9182156103975784926103a2575b50602060049160405192838092630ac77c9f60e11b82525afa908115610397578491610353575b506103389350604051938493606085526060850190610b32565b6001600160a01b039092166020840152151560408301520390f35b90506020813d60201161038f575b8161036e60209383610a2d565b8101031261038b5751801515810361038b5761033893505f61031e565b8380fd5b3d9150610361565b6040513d86823e3d90fd5b9091506020813d6020116103df575b816103be60209383610a2d565b8101031261038b57516001600160a01b038116810361038b579060206102f7565b3d91506103b1565b909150823d8082843e6103fa8184610a2d565b8201916020818403126104655780519067ffffffffffffffff8211610461570182601f8201121561046557805161043081610a4f565b9361043e6040519586610a2d565b81855260208284010111610461578060208093018386015e83010152905f6102d1565b8280fd5b5080fd5b6040513d85823e3d90fd5b63517172a160e11b8252600482fd5b5034610138578060031936011261013857546040516001600160a01b039091168152602090f35b50346107b25760603660031901126107b2576104c4610ab1565b60243567ffffffffffffffff81116107b2576104e4903690600401610a6b565b916044359182151583036107b25782906104fc610b56565b6001600160a01b038116610838575033925b6107ca575b600554604051612fa58082019591929091906001600160a01b031667ffffffffffffffff8711848810176107b6578392610b7d843960808752606061055b608089018a610b32565b6001600160a01b03909316602089018190523060408a015297015203905ff080156107a75760018060a01b031692600154600160401b8110156107b6578060016105aa92016001556001610ac7565b81546001600160a01b0360039290921b91821b19169086901b1790555f8181526002602052604090208054600160401b8110156107b6576105f091600182018155610ac7565b81546001600160a01b0360039290921b82811b199091169087901b179091555f858152600460205260409020805460ff1916600117905560055416803b156107b2575f80916044604051809481936308f6d2ed60e21b83528a6004840152600160248401525af180156107a757610792575b506001545f19810190811161077e577fa0c4f95bdd7626e7a88b342add50ddbdcb35e758aeea6469a3ea02eea7cddeda85916040518091604082526106aa604083018b610b32565b9060208301520390a36106c3575b602082604051908152f35b813b1561013857604051638eea4d7f60e01b8152818160048183875af180156107735761075e575b5050807f5b1230bdec05d66024e342c80533b0a25fb991527e9ebbd301400029b37d43616107556020946040518681835180838601835e81016003815203019020846bffffffffffffffffffffffff60a01b82541617905560405191829187835287830190610b32565b0390a25f6106b8565b610769828092610a2d565b61013857806106eb565b6040513d84823e3d90fd5b634e487b7160e01b84526011600452602484fd5b61079f9193505f90610a2d565b5f915f610662565b6040513d5f823e3d90fd5b5f80fd5b634e487b7160e01b5f52604160045260245ffd5b8351156108295760405184518060208701835e60039082019081528190036020019020546001600160a01b031661081a576005546001600160a01b031661051357636f7cdf9f60e01b5f5260045ffd5b630519244560e01b5f5260045ffd5b63d2be7ae760e01b5f5260045ffd5b9261050e565b346107b25760203660031901126107b2576001600160a01b0361085f610ab1565b165f526004602052602060ff60405f2054166040519015158152f35b346107b2575f3660031901126107b257610893610b56565b5f80546001600160a01b0319811682556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b346107b25760203660031901126107b25760043567ffffffffffffffff81116107b2576109056020913690600401610a6b565b8160405191805191829101835e600390820190815281900382019020546040516001600160a01b039091168152f35b346107b2575f3660031901126107b25760405180602060015491828152019060015f527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6905f5b818110610992576102298561021d81870382610a2d565b82546001600160a01b031684526020909301926001928301920161097b565b346107b25760403660031901126107b2576109ca610ab1565b6001600160a01b03165f908152600260205260409020805460243591908210156107b2576020916109fa91610ac7565b905460405160039290921b1c6001600160a01b03168152f35b346107b2575f3660031901126107b2576020906001548152f35b90601f8019910116810190811067ffffffffffffffff8211176107b657604052565b67ffffffffffffffff81116107b657601f01601f191660200190565b81601f820112156107b257803590610a8282610a4f565b92610a906040519485610a2d565b828452602083830101116107b257815f926020809301838601378301015290565b600435906001600160a01b03821682036107b257565b8054821015610adc575f5260205f2001905f90565b634e487b7160e01b5f52603260045260245ffd5b60206040818301928281528451809452019201905f5b818110610b135750505090565b82516001600160a01b0316845260209384019390920191600101610b06565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b5f546001600160a01b03163303610b6957565b63118cdaa760e01b5f523360045260245ffdfe60806040523461044a57612fa5803803806100198161044e565b92833981019060808183031261044a5780516001600160401b03811161044a57810182601f8201121561044a578051906001600160401b0382116103515761006a601f8301601f191660200161044e565b938285526020838301011161044a57815f9260208093018387015e8401015261009560208201610473565b6100ad60606100a660408501610473565b9301610473565b906100b8604061044e565b600681526515511550549560d21b6020820152845190946001600160401b038211610351575f5490600182811c92168015610440575b60208310146103335781601f8493116103d3575b50602090601f8311600114610370575f92610365575b50508160011b915f199060031b1c1916175f555b83516001600160401b03811161035157600154600181811c91168015610347575b602082101461033357601f81116102d0575b50602094601f821160011461026d579481929394955f92610262575b50508160011b915f199060031b1c1916176001555b6001600160a01b031691821561024f57600680546001600160a01b03198116851790915560405193906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a36001600781905560326008555f600955600a8054600d929092556001600160b01b031990911660109290921b62010000600160b01b0316919091179055600b80546001600160a01b0319166001600160a01b0392909216919091179055612b1d90816104888239f35b631e4fbdf760e01b5f525f60045260245ffd5b015190505f8061017b565b601f1982169560015f52805f20915f5b8881106102b8575083600195969798106102a0575b505050811b01600155610190565b01515f1960f88460031b161c191690555f8080610292565b9192602060018192868501518155019401920161027d565b60015f527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6601f830160051c81019160208410610329575b601f0160051c01905b81811061031e575061015f565b5f8155600101610311565b9091508190610308565b634e487b7160e01b5f52602260045260245ffd5b90607f169061014d565b634e487b7160e01b5f52604160045260245ffd5b015190505f80610118565b5f8080528281209350601f198516905b8181106103bb57509084600195949392106103a3575b505050811b015f5561012c565b01515f1960f88460031b161c191690555f8080610396565b92936020600181928786015181550195019301610380565b5f80529091507f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563601f840160051c81019160208510610436575b90601f859493920160051c01905b8181106104285750610102565b5f815584935060010161041b565b909150819061040d565b91607f16916100ee565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761035157604052565b51906001600160a01b038216820361044a5756fe6080806040526004361015610012575f80fd5b5f905f3560e01c90816301ffc9a71461219b575080630431a3251461216957806306fdde0314611d8b578063081812fc1461212d578063095ea7b3146120435780630ad4c4f414611f175780630c98483214611e9b578063158ef93e14611e765780631727fbf214611e5b57806323b872dd14611e445780632913daa014611e275780632b26a6bf14611da657806332045a8514611d8b57806332702c9514611cc75780633d8df38414611c8557806342842e0e14611c5a5780636352211e14611c2a57806370a0823114611bd9578063715018a614611b7e5780637cb8d83414611b555780637dce654a146115dd5780638da5cb5b146115b55780638eea4d7f1461142a57806395d89b4114611347578063a22cb465146112a0578063a5b3824014611274578063a6abd3b51461124b578063aa0a0b8914611217578063aa2fe91b146111d8578063b01a116814610ec9578063b88d4fde14610e66578063b90712e714610c6d578063c45a015514610c40578063c87b56dd14610be5578063cfbd488514610b7f578063d363d31f14610b29578063d8f0024d14610aaf578063ddd33d8614610640578063e985e9c5146105e8578063ee87043f146102a7578063efd87e29146102775763f2fde38b146101ec575f80fd5b3461027457602036600319011261027457610205612237565b61020d6129a4565b6001600160a01b0316801561026057600680546001600160a01b0319811683179091556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a380f35b631e4fbdf760e01b82526004829052602482fd5b80fd5b5034610274576020366003190112610274576102916129a4565b600435600955600160ff19600a541617600a5580f35b5034610274576040366003190112610274576102c1612237565b906024356001600160401b0381116105e4576102e1903690600401612389565b91338252601160205260ff60408320541615806105cf575b6105c057600a549260ff8460081c16156105b1576002600754146105a25760026007556001600160a01b0382169384156105935760ff16156105845760405160ff825191602081818601948086835e81016010815203019020541661057557600e54156105665760405160208184518085835e81016010815203019020600160ff19825416179055600954906103c760546040518093602082019586526001600160601b03198860601b166040830152865180918484015e810188838201520301601f198101835282612317565b51902091600e5492831561055257836103e091066127b3565b90549060031b1c92838552600f6020526040852054905f19810190811161053e5761040a906127b3565b90549060031b1c6104368161041e846127b3565b90919082549060031b91821b915f19901b1916179055565b8552600f6020526040852055600e54801561052a575f1901610457816127b3565b8154905f199060031b1b19169055600e55828452600f6020525f6040852055828452600c6020526003604085200160ff19815416905561049e8360018060a01b03926129cb565b16806104b857637e27328960e01b84526004839052602484fd5b92849330810361050e5760208480877f3bb111f65b6aebb51a630cbfb2249bede82fd02bc082480ef38a9a4ebf1591ae6104fe8860405191829188835288830190612213565b0390a36001600755604051908152f35b6364283d7b60e01b825230600452602484905260445260649150fd5b634e487b7160e01b85526031600452602485fd5b634e487b7160e01b86526011600452602486fd5b634e487b7160e01b85526012600452602485fd5b63b573562d60e01b8452600484fd5b63dee9dea160e01b8452600484fd5b63b573562d60e01b8352600483fd5b630702b3d960e41b8452600484fd5b633ee5aeb560e01b8352600483fd5b6321c4e35760e21b8352600483fd5b63019a5d1d60e71b8252600482fd5b506006546001600160a01b03163314156102f9565b5080fd5b5034610274576040366003190112610274576040610604612237565b9161060d61224d565b9260018060a01b031681526005602052209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b50346102745760a0366003190112610274576004356024359160078310156102745760443560028110156105e457606435916084356001600160401b0381116105e457610691903690600401612389565b92338252601160205260ff6040832054161580610a9a575b6105c05760ff600a5460081c1615610a8b578415610a7c578015610a265760c881116109ce57808511156109c3576106e29080956127a6565b92815b858110610732575050507f7ba5820de50d8c7d8e432ce6b29dfd1d996502fb255ba4414dcdfe397dfb0244906040946107238651928392878461281c565b0390a182519182526020820152f35b600d5461073e81612768565b600d5561074b8130612a8a565b80845260126020526107608860408620612776565b8084526013602052610775856040862061278e565b604051610781816122fc565b858152602081016107928a82612531565b60408201906107a1888361253d565b6060830190868252608084019260018452858952600c602052604089209451855560018501915160078110156109af576107db9083612776565b51600281101561099b57815461ff00191660089190911b61ff001617905551805160028401916001600160401b0382116109875761081983546123a7565b601f811161094c575b50602090601f83116001146108e357826108749695936003959361085b938d926108d8575b50508160011b915f199060031b1c19161790565b90555b51151591019060ff801983541691151516179055565b61087d816127cb565b600e545f1981019081116108c457818691600194938752600f60205260408720556040516108ab818c612206565b5f516020612ac85f395f51905f5260203092a4016106e5565b634e487b7160e01b85526011600452602485fd5b015190505f80610847565b838a52818a209190601f1984168b5b8181106109345750926001928592610874999896600398961061091d575b505050811b01905561085e565b01515f1983881b60f8161c191690555f8080610910565b929360206001819287860151815501950193016108f2565b61097790848b5260208b20601f850160051c8101916020861061097d575b601f0160051c0190612752565b5f610822565b909150819061096a565b634e487b7160e01b89526041600452602489fd5b634e487b7160e01b89526021600452602489fd5b634e487b7160e01b8a52602160045260248afd5b506106e284806127a6565b60405162461bcd60e51b815260206004820152602a60248201527f437573746f6d2062617463682073697a6520746f6f206c6172676520666f72206044820152696761732073616665747960b01b6064820152608490fd5b60405162461bcd60e51b815260206004820152602860248201527f437573746f6d2062617463682073697a65206d75737420626520677265617465604482015267072207468616e20360c41b6064820152608490fd5b63a8132f5d60e01b8252600482fd5b6321c4e35760e21b8252600482fd5b506006546001600160a01b03163314156106a9565b5034610274576020366003190112610274576004356001600160401b0381116105e457610ae0903690600401612389565b9060ff600a5460081c1615610b1a57602060ff818085604051928184925191829101835e8101601081520301902054166040519015158152f35b6321c4e35760e21b8152600490fd5b503461027457602036600319011261027457610b43612237565b610b4b6129a4565b6001600160a01b03168015610b70576001600160601b0360a01b600b541617600b5580f35b63a9d8d06360e01b8252600482fd5b503461027457602036600319011261027457610b99612237565b610ba16129a4565b6001600160a01b0316808252601160205260408220805460ff191690557f44f4322f8daa225d5f4877ad0f7d3dfba248a774396f3ca99405ed40a044fe818280a280f35b503461027457602036600319011261027457610c02600435612982565b5080604051610c12602082612317565b5250610c3c604051610c25602082612317565b5f8152604051918291602083526020830190612213565b0390f35b5034610274578060031936011261027457600a5460405160109190911c6001600160a01b03168152602090f35b5034610274578060031936011261027457610c866129a4565b600a5460ff8160081c1615610a8b57600b54604051633995086d60e11b81523060048201526001600160a01b03909116908390602081602481865afa908115610e5b578291610e22575b5060246040518094819363d8a4676f60e01b835260048301525afa908115610e175783908492610d46575b5080610d3c575b610d0a578280f35b805115610d28576020015160095560ff1916600117600a555f808280f35b634e487b7160e01b83526032600452602483fd5b5080511515610d02565b9150503d8084833e610d588183612317565b810190606081830312610e13576020810151908115158203610e0b576040810151906001600160401b038211610e0f57019180601f84011215610e0b578251926001600160401b038411610df7578360051b9060405194610dbc6020840187612317565b8552602080860192820101928311610df357602001905b828210610de3575050505f610cfb565b8151815260209182019101610dd3565b8680fd5b634e487b7160e01b86526041600452602486fd5b8480fd5b8580fd5b8380fd5b6040513d85823e3d90fd5b9150506020813d602011610e53575b81610e3e60209383612317565b81010312610e4f578390515f610cd0565b5f80fd5b3d9150610e31565b6040513d84823e3d90fd5b503461027457608036600319011261027457610e80612237565b610e8861224d565b606435916001600160401b038311610e135736602384011215610e1357610ebc610ec6933690602481600401359101612353565b9160443591612842565b80f35b5034610274576080366003190112610274576004356024359160078310156102745760443560028110156105e4576064356001600160401b0381116111d457610f16903690600401612389565b91338152601160205260ff60408220541615806111bf575b6111b05760ff600a5460081c1615610b1a5783156111a1576008548085111561119657610f5c9080956127a6565b92815b858110610f9d575050507f7ba5820de50d8c7d8e432ce6b29dfd1d996502fb255ba4414dcdfe397dfb0244906040946107238651928392878461281c565b600d54610fa981612768565b600d55610fb68130612a8a565b8084526012602052610fcb8860408620612776565b8084526013602052610fe0856040862061278e565b604051610fec816122fc565b85815260208101610ffd8a82612531565b604082019061100c888361253d565b6060830190868252608084019260018452858952600c602052604089209451855560018501915160078110156109af576110469083612776565b51600281101561099b57815461ff00191660089190911b61ff001617905551805160028401916001600160401b0382116109875761108483546123a7565b601f8111611166575b50602090601f831160011461111557826110c59695936003959361085b938d926108d85750508160011b915f199060031b1c19161790565b6110ce816127cb565b600e545f1981019081116108c457818691600194938752600f60205260408720556040516110fc818c612206565b5f516020612ac85f395f51905f5260203092a401610f5f565b838a52818a209190601f1984168b5b81811061114e57509260019285926110c5999896600398961061091d57505050811b01905561085e565b92936020600181928786015181550195019301611124565b61119090848b5260208b20601f850160051c8101916020861061097d57601f0160051c0190612752565b5f61108d565b50610f5c84806127a6565b63a8132f5d60e01b8152600490fd5b63019a5d1d60e71b8152600490fd5b506006546001600160a01b0316331415610f2e565b8280fd5b50346102745760203660031901126102745760209060ff906040906001600160a01b03611203612237565b168152601184522054166040519015158152f35b50346102745760203660031901126102745760ff60406020926004358152601384522054166112496040518092612263565bf35b5034610274578060031936011261027457600b546040516001600160a01b039091168152602090f35b503461027457806003193601126102745760ff600a5460081c1615610b1a576020600e54604051908152f35b5034610274576040366003190112610274576112ba612237565b6024359081151590818303610e13576001600160a01b03169182156113335761130490338552600560205260408520845f5260205260405f209060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a380f35b630b61174360e31b84526004839052602484fd5b503461027457806003193601126102745760405190806001549061136a826123a7565b808552916001811690811561140357506001146113a6575b610c3c8461139281860382612317565b604051918291602083526020830190612213565b600181527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b8082106113e95750909150810160200161139282611382565b9192600181602092548385880101520191019092916113d0565b60ff191660208087019190915292151560051b850190920192506113929150839050611382565b5034610e4f575f366003190112610e4f576006546001600160a01b03163314158061159a575b61158b5760ff600a5460081c1661157d57600b54604051633995086d60e11b81523060048201526001600160a01b0390911690602081602481855afa908115611540575f9161154b575b50156114fd575b5061010061ff0019600a541617600a557fb9c7ca2c1d7d6ac251b4b3d037f933e5f54305b9ca8ddb8047d04e4cc6172a276114f16114dd6123df565b604051918291604083526040830190612213565b3060208301520390a180f35b803b15610e4f575f809160246040518094819363203256c560e21b83523060048401525af1801561154057156114a15761153991505f90612317565b5f5f6114a1565b6040513d5f823e3d90fd5b90506020813d602011611575575b8161156660209383612317565b81010312610e4f57515f61149a565b3d9150611559565b62dc149f60e41b5f5260045ffd5b63fa49961f60e01b5f5260045ffd5b50600a543360109190911c6001600160a01b03161415611450565b34610e4f575f366003190112610e4f576006546040516001600160a01b039091168152602090f35b34610e4f576115eb366122aa565b8015611b465781355f818152600260205260409020546001600160a01b031692839291338403611b37575f52600c60205260405f20916040519261162e846122fc565b8054845260ff600360018301549261165e83602089019561165182821688612531565b60081c166040890161253d565b61166a60028201612493565b6060880152015416151560808501525191600783101593846118d45751935f5b838110611a8857506118d4576006831015611a795760018301809311611a655760078310156118d4575f5b8281106118e857505050600d54926116cc84612768565b600d55604051946116dc866122fc565b83865260208601926116ee8185612531565b604087019160018352602097604051956117088a88612317565b5f87526060820196875260808201945f8652895f52600c8b5260405f209251835560018301915160078110156118d4576117429083612776565b5160028110156118d45761ff0082549160081b169061ff001916179055600281019551938451966001600160401b0388116118c05789978b9661178583546123a7565b601f8111611892575b508790601f831160011461181f578a945f516020612ac85f395f51905f529998979461085b856117da966118099a966003965f926108d85750508160011b915f199060031b1c19161790565b815f52601285526117ee8460405f20612776565b815f526013855260405f20600160ff19825416179055612a8a565b6118166040518092612206565ba4604051908152f35b99989796959493929190601f1982169a835f52885f209b5f5b8181106118785750936001848d9e6003955f516020612ac85f395f51905f529e9f9a97956118099c9a966117da9a1061091d57505050811b01905561085e565b838301518e556001909d019c8f9c50928a01928a01611838565b6118ba90845f52895f20601f850160051c8101918b861061097d57601f0160051c0190612752565b8d61178e565b634e487b7160e01b5f52604160045260245ffd5b634e487b7160e01b5f52602160045260245ffd5b6118f38184846126e4565b355f818152600260205260409020546001600160a01b03168015908115611a32575b5f83815260026020526040812080546001600160a01b03191690558390827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8280a450611a2057508061196b60019285856126e4565b355f52600c6020525f60036040822082815582858201556002810161199081546123a7565b90816119df575b505001556119a68185856126e4565b355f52601260205260405f20805460ff191690556119c58185856126e4565b355f52601360205260405f20805460ff19169055016116b5565b81601f86931188146119f55750555b8b80611997565b81835260208320611a1091601f0160051c8101908901612752565b80825281602081209155556119ee565b637e27328960e01b5f5260045260245ffd5b5f83815260046020526040902080546001600160a01b0319169055805f52600360205260405f205f198154019055611915565b634e487b7160e01b5f52601160045260245ffd5b63677b7d5360e01b5f5260045ffd5b866001600160a01b03611aba611a9f8488886126e4565b355f908152600260205260409020546001600160a01b031690565b1603611b3757611acb8185856126e4565b355f52600c6020528160ff600160405f20015416906118d45760078110156118d4578503611b2857611afe8185856126e4565b355f52600c6020528560405f205403611b195760010161168a565b631e3bf80160e11b5f5260045ffd5b63e59c44d360e01b5f5260045ffd5b6359dc379f60e01b5f5260045ffd5b635ca8eceb60e11b5f5260045ffd5b34610e4f575f366003190112610e4f57604060ff600a5416600954825191151582526020820152f35b34610e4f575f366003190112610e4f57611b966129a4565b600680546001600160a01b031981169091555f906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a3005b34610e4f576020366003190112610e4f576001600160a01b03611bfa612237565b168015611c17575f526003602052602060405f2054604051908152f35b6322718ad960e21b5f525f60045260245ffd5b34610e4f576020366003190112610e4f576020611c48600435612982565b6040516001600160a01b039091168152f35b34610e4f57611c83611c6b36612270565b9060405192611c7b602085612317565b5f8452612842565b005b34610e4f57611c93366122aa565b9060ff600a5460081c1615611cb857602091611cae91612708565b6040519015158152f35b6321c4e35760e21b5f5260045ffd5b34610e4f575f366003190112610e4f5760ff600a5460081c1615611cb857604051806020600e5492838152018092600e5f527fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fd905f5b818110611d755750505081611d33910382612317565b604051918291602083019060208452518091526040830191905f5b818110611d5c575050500390f35b8251845285945060209384019390920191600101611d4e565b8254845260209093019260019283019201611d1d565b34610e4f575f366003190112610e4f57610c3c6113926123df565b34610e4f576020366003190112610e4f57600435611dc26129a4565b8015611e185760c88111611e095760407f6b141d34195f1cbfa2080571bebbe19ad6d201cc0d1d53c70550795d14a4be8391600854908060085582519182526020820152a1005b631e80759560e21b5f5260045ffd5b637862e95960e01b5f5260045ffd5b34610e4f575f366003190112610e4f576020600854604051908152f35b34610e4f57611c83611e5536612270565b91612549565b34610e4f575f366003190112610e4f57602060405160078152f35b34610e4f575f366003190112610e4f57602060ff600a5460081c166040519015158152f35b34610e4f576020366003190112610e4f57611eb4612237565b611ebc6129a4565b6001600160a01b03168015611f0857805f52601160205260405f20600160ff198254161790557f83b05b6735acd4b85e3bded8e72c851d1a87718f81e3c8e6f0c9d9a2baa88e465f80a2005b63a9d8d06360e01b5f5260045ffd5b34610e4f576020366003190112610e4f576004355f6080604051611f3a816122fc565b828152826020820152826040820152606080820152015260ff600a5460081c1615611cb8575f818152600260205260409020546001600160a01b031615612034575f52600c60205260405f20604051611f92816122fc565b8154815260018201546120276020830193611fb060ff841686612531565b611fc460ff604086019460081c168461253d565b61201560ff6003611fd760028501612493565b93606088019485520154169360808601941515855261200a60405197889760208952516020890152516040880190612206565b516060860190612263565b5160a0608085015260c0840190612213565b9051151560a08301520390f35b6303dcb5bb60e01b5f5260045ffd5b34610e4f576040366003190112610e4f5761205c612237565b60243561206881612982565b3315158061211a575b806120ed575b6120da5781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f90815260046020526040902080546001600160a01b0319166001600160a01b03909216919091179055005b63a9fbf51f60e01b5f523360045260245ffd5b506001600160a01b0381165f90815260056020908152604080832033845290915290205460ff1615612077565b506001600160a01b038116331415612071565b34610e4f576020366003190112610e4f5760043561214a81612982565b505f526004602052602060018060a01b0360405f205416604051908152f35b34610e4f576020366003190112610e4f576004355f526012602052602060ff60405f2054166112496040518092612206565b34610e4f576020366003190112610e4f576004359063ffffffff60e01b8216809203610e4f576020916380ac58cd60e01b81149081156121f5575b81156121e4575b5015158152f35b6301ffc9a760e01b149050836121dd565b635b5e139f60e01b811491506121d6565b9060078210156118d45752565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b0382168203610e4f57565b602435906001600160a01b0382168203610e4f57565b9060028210156118d45752565b6060906003190112610e4f576004356001600160a01b0381168103610e4f57906024356001600160a01b0381168103610e4f579060443590565b906020600319830112610e4f576004356001600160401b038111610e4f5782602382011215610e4f578060040135926001600160401b038411610e4f5760248460051b83010111610e4f576024019190565b60a081019081106001600160401b038211176118c057604052565b90601f801991011681019081106001600160401b038211176118c057604052565b6001600160401b0381116118c057601f01601f191660200190565b92919261235f82612338565b9161236d6040519384612317565b829481845281830111610e4f578281602093845f960137010152565b9080601f83011215610e4f578160206123a493359101612353565b90565b90600182811c921680156123d5575b60208310146123c157565b634e487b7160e01b5f52602260045260245ffd5b91607f16916123b6565b604051905f825f54916123f1836123a7565b80835292600181169081156124745750600114612417575b61241592500383612317565b565b505f80805290917f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e5635b81831061245857505090602061241592820101612409565b6020919350806001915483858901015201910190918492612440565b6020925061241594915060ff191682840152151560051b820101612409565b9060405191825f8254926124a6846123a7565b808452936001811690811561250f57506001146124cb575b5061241592500383612317565b90505f9291925260205f20905f915b8183106124f3575050906020612415928201015f6124be565b60209193508060019154838589010152019101909184926124da565b90506020925061241594915060ff191682840152151560051b8201015f6124be565b60078210156118d45752565b60028210156118d45752565b6001600160a01b03909116919082156126d1575f828152600260205260409020546001600160a01b03169282903315158061263c575b5084612609575b805f52600360205260405f2060018154019055815f52600260205260405f20816001600160601b0360a01b825416179055847fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a46001600160a01b03168083036125f157505050565b6364283d7b60e01b5f5260045260245260445260645ffd5b5f82815260046020526040902080546001600160a01b0319169055845f52600360205260405f205f198154019055612586565b90915080612680575b156126525782905f61257f565b828461266a57637e27328960e01b5f5260045260245ffd5b63177e802f60e01b5f523360045260245260445ffd5b5033841480156126af575b8061264557505f838152600460205260409020546001600160a01b03163314612645565b505f84815260056020908152604080832033845290915290205460ff1661268b565b633250574960e11b5f525f60045260245ffd5b91908110156126f45760051b0190565b634e487b7160e01b5f52603260045260245ffd5b90801561274c575f5b81811061272057505050600190565b336001600160a01b03612737611a9f8486886126e4565b160361274557600101612711565b5050505f90565b50505f90565b81811061275d575050565b5f8155600101612752565b5f198114611a655760010190565b9060078110156118d45760ff80198354169116179055565b9060028110156118d45760ff80198354169116179055565b91908203918211611a6557565b600e548110156126f457600e5f5260205f2001905f90565b600e5490680100000000000000008210156118c05760018201600e55600e548210156126f457600e5f527fbb7b4a454dc3493923482f07822329ed19e8244eff582cc204f8554c3620c3fd90910155565b60409061283b6124159496959396606083019783526020830190612206565b0190612263565b929161284f818386612549565b813b61285c575b50505050565b604051630a85bd0160e11b81523360048201526001600160a01b03948516602482015260448101919091526080606482015292169190602090829081906128a7906084830190612213565b03815f865af15f918161293d575b5061290a57503d15612903573d6128cb81612338565b906128d96040519283612317565b81523d5f602083013e5b805190816128fe5782633250574960e11b5f5260045260245ffd5b602001fd5b60606128e3565b6001600160e01b03191663757a42ff60e11b0161292b57505f808080612856565b633250574960e11b5f5260045260245ffd5b9091506020813d60201161297a575b8161295960209383612317565b81010312610e4f57516001600160e01b031981168103610e4f57905f6128b5565b3d915061294c565b5f818152600260205260409020546001600160a01b0316908115611a20575090565b6006546001600160a01b031633036129b857565b63118cdaa760e01b5f523360045260245ffd5b5f828152600260205260409020546001600160a01b0316919082612a57575b6001600160a01b031680612a3f575b815f52600260205260405f20816001600160601b0360a01b825416179055827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a490565b805f52600360205260405f20600181540190556129f9565b5f82815260046020526040902080546001600160a01b0319169055825f52600360205260405f205f1981540190556129ea565b906001600160a01b038216156126d1576001600160a01b0391612aad91906129cb565b16612ab457565b6339e3563760e11b5f525f60045260245ffdfecb765117d24d44acc83ff837ed7e403da5f504948020b79556c3790fdee5a54aa2646970667358221220ad598ca8894218a1bf63cb4d1102abb0df146a657e29e1992533a94a8ee9b5fd64736f6c634300081e0033a264697066735822122083e5e67452b0d811873d570494b2a1b76932a2be45221419d8375978b18444c964736f6c634300081e0033

000000000000000000000000d15d65d64ba5a43ec5036107eb4b823acc093906

-----Decoded View---------------
Arg [0] : directFundingConsumer_ (address): 0xd15d65D64ba5A43ec5036107eB4b823ACc093906

-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000d15d65d64ba5a43ec5036107eb4b823acc093906