Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

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

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

/**
 ____  ____   ___   ____ _____ _   _  ___  _____ ___  ____  __  __ ____  
|  _ \|  _ \ / _ \ / ___| ____| \ | |/ _ \|  ___/ _ \|  _ \|  \/  / ___| 
| |_) | |_) | | | | |  _|  _| |  \| | | | | |_ | | | | |_) | |\/| \___ \ 
|  __/|  _ <| |_| | |_| | |___| |\  | |_| |  _|| |_| |  _ <| |  | |___) |
|_|   |_| \_\\___/ \____|_____|_| \_|\___/|_|   \___/|_| \_\_|  |_|____/ 

**/

import "@openzeppelin/contracts/token/ERC721/ERC721.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/Base64.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "./animationrenderer.sol";

contract ProgenoformsCollection is ERC721, Ownable {
    using SVGRenderer for uint256;
    using Strings for uint256;
    using AnimationRenderer for uint256;
    
    uint256 public constant MAX_SUPPLY = 5000;
    
    // Mint price mechanics
    uint256 public BASE_MINT_PRICE = 0.01 ether;
    
    uint256 private _status;
    uint256 private constant _NOT_ENTERED = 1;
    uint256 private constant _ENTERED = 2;
    bool private _paused;

    // Token tracking
    uint256 private _tokenIdCounter;
    
    // Palette structure
    struct Palette {
        string name;
        int256[15] values;
    }
    
    struct Renderer {
        address prefixPtr;  // SSTORE2 pointer to prefix JavaScript
        address suffixPtr;  // SSTORE2 pointer to suffix JavaScript
        string name;        // Human-readable name for the renderer
    }

    mapping(uint256 => Renderer) public renderers;

    mapping(uint256 => Palette) public palettes;
    uint256 public paletteCount;

    modifier nonReentrant() {
    require(_status != _ENTERED, "ReentrancyGuard: reentrant call");
    _status = _ENTERED;
    _;
    _status = _NOT_ENTERED;
}
    
    struct TokenData {
        uint8[10] values;  
        bool locked;
    }
    
    mapping(uint256 => TokenData) private _tokenData;
    uint8 rendererCount;
    
    event NFTMinted(address indexed owner, uint256 indexed tokenId);
    event RendererChanged(uint256 tokenId, uint256 rendererId);
  
    constructor() ERC721("Progenoforms", "PGF") Ownable(msg.sender) {
        rendererCount = 0;
        _status = _NOT_ENTERED;
        _paused = true;
    }
    
    /**
     * @dev Returns the current mint price
     */
    function getMintPrice() public view returns (uint256) {
      uint256 priceMultiplier = 1 + (_tokenIdCounter / 500);
      return BASE_MINT_PRICE * priceMultiplier;
    }

    modifier whenNotPaused() {
      require(!_paused, "Contract is paused");
      _;
    }

    function setPaused(bool paused) external onlyOwner {
       _paused = paused;
    }

    function isPaused() public view returns (bool) {
    return _paused;
    }

    /**
     * @dev Mints a new NFT with randomly generated values
     */
    function mint() public payable whenNotPaused {
        require(_tokenIdCounter < MAX_SUPPLY, "Max supply reached");
        require(msg.value >= getMintPrice(), "Insufficient payment");
        uint256 tokenId = _tokenIdCounter;
        _tokenIdCounter++;
        _generateTokenData(tokenId);
        _safeMint(msg.sender, tokenId);
        
        emit NFTMinted(msg.sender, tokenId);
    }
    
    function mintQty(uint256 quantity) public payable whenNotPaused {
      require(_tokenIdCounter + quantity <= MAX_SUPPLY, "Would exceed max supply");
      require(quantity > 0, "Quantity must be greater than zero");
      require(quantity <= 100, "Quantity cannot be more than 100");
      uint256 totalPrice = quantity * getMintPrice();
      require(msg.value >= totalPrice, "Insufficient payment");
      for (uint256 i = 0; i < quantity; i++) {
        uint256 tokenId = _tokenIdCounter;
        _tokenIdCounter++;
        _generateTokenData(tokenId);
        _safeMint(msg.sender, tokenId);
        emit NFTMinted(msg.sender, tokenId);
      }
    }

    /**
    * @dev Locks a token so it's parameters cannot be changed
    * @param tokenId ID of the token to update
    */
    function lockToken(uint256 tokenId) public {
      require(ownerOf(tokenId) == msg.sender || msg.sender == owner(), "Not authorized");
      require(tokenId < _tokenIdCounter, "Token does not exist");
      _tokenData[tokenId].locked = true;
    }

    /**
    * @dev Unlocks a token so it's parameters can be changed
    * @param tokenId ID of the token to update
    */
    function unlockToken(uint256 tokenId) public {
      require(ownerOf(tokenId) == msg.sender, "Not authorized");
      require(tokenId < _tokenIdCounter, "Token does not exist");
      _tokenData[tokenId].locked = false;
    }

    /**
     * @dev Generate random values for a token
     * @param tokenId Token ID to generate values for
     */
    function _generateTokenData(uint256 tokenId) private {
        // Create a pseudorandom seed based on tokenId, block data, and timestamp
        uint256 seed = uint256(keccak256(abi.encodePacked(
            tokenId,
            blockhash(block.number - 1),
            block.timestamp,
            block.prevrandao
        )));
        
        TokenData memory attrs;
        
        // Generate random values within their defined bounds
        // att1 (values[0])
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(0))));
        attrs.values[0] = uint8(30 + (seed % 50));
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(1))));
        attrs.values[1] = uint8(45 + (seed % 45));
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(2))));
        attrs.values[2] = uint8(25 + (seed % 50));
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(3))));
        attrs.values[3] = uint8(20 + (seed % 70));
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(4))));
        attrs.values[4] = uint8(30 + (seed % 40));
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(5))));
        attrs.values[5] = uint8(30  + (seed % 50));
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(6))));
        attrs.values[6] = uint8(30 + (seed % 50));
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(7))));
        uint256 sym = seed % 100;
        if (sym < 60) attrs.values[7] = 0;
        else if (sym < 90) attrs.values[7] = 1;
        else attrs.values[7] = 3;
        seed = uint256(keccak256(abi.encodePacked(seed, uint256(8))));
        attrs.values[8] = uint8(seed % paletteCount);
        attrs.values[9] = 0;
        attrs.locked = false;
        _tokenData[tokenId] = attrs;
    }
    
    /**
     * @dev Get the token data for a specific NFT
     * @param tokenId Token ID to query
     * @return values Array of 10 integer values for this token
     */
    function getTokenData(uint256 tokenId) public view returns (uint8[10] memory values) {
        require(tokenId < _tokenIdCounter, "Token does not exist");
        return _tokenData[tokenId].values;
    }
        
    /**
     * @dev Add a new palette (owner only)
     * @param name Name of the palette
     * @param values Array of 15 palette values (scaled by 1000)
     */
    function addPalette(string memory name, int256[15] memory values) public onlyOwner {
        palettes[paletteCount] = Palette({
            name: name,
            values: values            
        });
        paletteCount++;
    }
    
    /**
     * @dev Edit an existing palette (owner only)
     * @param paletteId ID of the palette to edit
     * @param name New name for the palette
     * @param values New values for the palette
     */
    function editPalette(uint256 paletteId, string memory name, int256[15] memory values) public onlyOwner {
        require(paletteId < paletteCount, "Palette does not exist");
        palettes[paletteId].name = name;
        palettes[paletteId].values = values;
    }
    
    /**
     * @dev Get palette information
     * @param paletteId ID of the palette to query
     * @return values Values of the palette
     */
    function getPaletteValues(uint8 paletteId) public view returns (int256[15] memory) {
        require(paletteId < paletteCount, "Palette does not exist");
        return palettes[paletteId].values;
    }

    /**
     * @dev Get palette information
     * @param paletteId ID of the palette to query
     * @return name Name of the palette
     */
    function getPaletteName(uint8 paletteId) public view returns (string memory) {
        require(paletteId < paletteCount, "Palette does not exist");
        return palettes[paletteId].name;
    }

    /**
     * @dev Add a new renderer with JavaScript prefix and suffix.
     * @param prefix The prefix JavaScript code
     * @param suffix The suffix JavaScript code
     * @param name A human-readable name for the renderer
     * @return rendererId The ID of the newly created renderer
     */
    function addRenderer(
        string calldata prefix,
        string calldata suffix,
        string calldata name
    ) external onlyOwner returns (uint8 rendererId) {
        rendererId = rendererCount;
        
        // Store JavaScript code using SSTORE2
        address prefixPtr = SSTORE2.write(bytes(prefix));
        address suffixPtr = SSTORE2.write(bytes(suffix));
        
        // Create and store the renderer
        renderers[rendererId] = Renderer({
            prefixPtr: prefixPtr,
            suffixPtr: suffixPtr,
            name: name
        });
        
        rendererCount++;
        return rendererId;
    }
    
    /**
     * @dev Update an existing renderer.
     * @param rendererId The ID of the renderer to update
     * @param prefix The new prefix JavaScript code
     * @param suffix The new suffix JavaScript code
     * @param name The new name for the renderer
     */
    function updateRenderer(
        uint8 rendererId,
        string calldata prefix,
        string calldata suffix,
        string calldata name
    ) external onlyOwner {
        require(rendererId < rendererCount, "Renderer does not exist");
        
        // Store new JavaScript code using SSTORE2
        address prefixPtr = SSTORE2.write(bytes(prefix));
        address suffixPtr = SSTORE2.write(bytes(suffix));
        
        // Update the renderer
        renderers[rendererId] = Renderer({
            prefixPtr: prefixPtr,
            suffixPtr: suffixPtr,
            name: name
        });
    }

    /**
     * @dev Change the renderer for a token.
     * @param tokenId The token ID to change renderer for
     * @param rendererId The new renderer ID to use
     */
    function changeRenderer(uint256 tokenId, uint8 rendererId) external {
        require(ownerOf(tokenId) == msg.sender, "Not token owner");
        require(rendererId < rendererCount, "Renderer does not exist");
        _tokenData[tokenId].values[9] = rendererId;
        
        emit RendererChanged(tokenId, rendererId);
    }

    function changeTokenValues(uint256 tokenId, uint8[10] calldata vals) external onlyOwner {
      require(tokenId < _tokenIdCounter, "ID error");  
      require(!_tokenData[tokenId].locked, "Token is Locked");
      _tokenData[tokenId].values = vals;
    }

     /**
     * @dev Generate on-chain token URI as base64 encoded JSON
     * @param tokenId Token ID to generate URI for
     */
    function tokenURI(uint256 tokenId) public view override returns (string memory) {
       AnimationRenderer.TokenCompact memory compact;
       TokenData memory data = _tokenData[tokenId];
       uint8 rendererId = data.values[9];
       compact.attributes = data.values;
       compact.palette = getPaletteValues(data.values[8]);
       compact.palname = getPaletteName(data.values[8]);
       compact.rendererName = renderers[rendererId].name;
       compact.tokenId = tokenId;
       compact.prefixPtr = renderers[rendererId].prefixPtr;
       compact.suffixPtr = renderers[rendererId].suffixPtr;
       return AnimationRenderer.getTokenURI(compact);
    }        

    function numberMinted() public view returns (uint256)  {
    return _tokenIdCounter;
    }
        
    function contractURI() public pure returns (string memory) {
      return "https://mindforms.xyz/progenoforms/contract.json";
    }

    /**
     * @dev Withdraw contract balance (owner only)
     */
    function withdraw() public onlyOwner nonReentrant {
        (bool success, ) = payable(owner()).call{value: address(this).balance}("");
        require(success, "Withdrawal failed");
    }
}

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

/**
 ____  ____   ___   ____ _____ _   _  ___  _____ ___  ____  __  __ ____  
|  _ \|  _ \ / _ \ / ___| ____| \ | |/ _ \|  ___/ _ \|  _ \|  \/  / ___| 
| |_) | |_) | | | | |  _|  _| |  \| | | | | |_ | | | | |_) | |\/| \___ \ 
|  __/|  _ <| |_| | |_| | |___| |\  | |_| |  _|| |_| |  _ <| |  | |___) |
|_|   |_| \_\\___/ \____|_____|_| \_|\___/|_|   \___/|_| \_\_|  |_|____/ 

**/

import "@openzeppelin/contracts/utils/Base64.sol";
import "@openzeppelin/contracts/utils/Strings.sol";

library SVGRenderer {
    int constant SCALE = 1_000_000;
    int constant TWO_PI = 6283185; // 2π * 1e6
    uint constant TABLE_SIZE = 256;

    struct ColorParams {
        int A; // scaled by 1e6
        int B; // scaled by 1e6
        int C; // scaled by 1000 (to match t)
        int D; // scaled by 1000 (to match t)
    }

  function cosLUT(int x) internal pure returns (int) {
        uint index = uint((x * int(TABLE_SIZE)) / int(TWO_PI)) % TABLE_SIZE;
    int32[256] memory cosTable = [
    int32(1000000), int32(999698), int32(998794), int32(997290), int32(995185), int32(992480), int32(989177), int32(985278),
    int32(980785), int32(975702), int32(970031), int32(963776), int32(956940), int32(949528), int32(941544), int32(932993),
    int32(923880), int32(914210), int32(903989), int32(893224), int32(881921), int32(870087), int32(857729), int32(844853),
    int32(831469), int32(817584), int32(803208), int32(788346), int32(773010), int32(757209), int32(740951), int32(724247),
    int32(707106), int32(689540), int32(671558), int32(653172), int32(634393), int32(615231), int32(595699), int32(575808),
    int32(555570), int32(534997), int32(514102), int32(492898), int32(471396), int32(449611), int32(427555), int32(405241),
    int32(382683), int32(359895), int32(336889), int32(313681), int32(290284), int32(266712), int32(242980), int32(219101),
    int32(195090), int32(170961), int32(146730), int32(122410), int32(98078), int32(73648), int32(49242), int32(24869),
    int32(0), int32(-24869), int32(-49242), int32(-73648), int32(-98078), int32(-122410), int32(-146730), int32(-170961),
    int32(-195090), int32(-219101), int32(-242980), int32(-266712), int32(-290284), int32(-313681), int32(-336889), int32(-359895),
    int32(-382683), int32(-405241), int32(-427555), int32(-449611), int32(-471396), int32(-492898), int32(-514102), int32(-534997),
    int32(-555570), int32(-575808), int32(-595699), int32(-615231), int32(-634393), int32(-653172), int32(-671558), int32(-689540),
    int32(-707106), int32(-724247), int32(-740951), int32(-757209), int32(-773010), int32(-788346), int32(-803208), int32(-817584),
    int32(-831469), int32(-844853), int32(-857729), int32(-870087), int32(-881921), int32(-893224), int32(-903989), int32(-914210),
    int32(-923880), int32(-932993), int32(-941544), int32(-949528), int32(-956940), int32(-963776), int32(-970031), int32(-975702),
    int32(-980785), int32(-985278), int32(-989177), int32(-992480), int32(-995185), int32(-997290), int32(-998794), int32(-999698),
    int32(-1000000), int32(-999698), int32(-998794), int32(-997290), int32(-995185), int32(-992480), int32(-989177), int32(-985278),
    int32(-980785), int32(-975702), int32(-970031), int32(-963776), int32(-956940), int32(-949528), int32(-941544), int32(-932993),
    int32(-923880), int32(-914210), int32(-903989), int32(-893224), int32(-881921), int32(-870087), int32(-857729), int32(-844853),
    int32(-831469), int32(-817584), int32(-803208), int32(-788346), int32(-773010), int32(-757209), int32(-740951), int32(-724247),
    int32(-707106), int32(-689540), int32(-671558), int32(-653172), int32(-634393), int32(-615231), int32(-595699), int32(-575808),
    int32(-555570), int32(-534997), int32(-514102), int32(-492898), int32(-471396), int32(-449611), int32(-427555), int32(-405241),
    int32(-382683), int32(-359895), int32(-336889), int32(-313681), int32(-290284), int32(-266712), int32(-242980), int32(-219101),
    int32(-195090), int32(-170961), int32(-146730), int32(-122410), int32(-98078), int32(-73648), int32(-49242), int32(-24869),
    int32(0), int32(24869), int32(49242), int32(73648), int32(98078), int32(122410), int32(146730), int32(170961),
    int32(195090), int32(219101), int32(242980), int32(266712), int32(290284), int32(313681), int32(336889), int32(359895),
    int32(382683), int32(405241), int32(427555), int32(449611), int32(471396), int32(492898), int32(514102), int32(534997),
    int32(555570), int32(575808), int32(595699), int32(615231), int32(634393), int32(653172), int32(671558), int32(689540),
    int32(707106), int32(724247), int32(740951), int32(757209), int32(773010), int32(788346), int32(803208), int32(817584),
    int32(831469), int32(844853), int32(857729), int32(870087), int32(881921), int32(893224), int32(903989), int32(914210),
    int32(923880), int32(932993), int32(941544), int32(949528), int32(956940), int32(963776), int32(970031), int32(975702),
    int32(980785), int32(985278), int32(989177), int32(992480), int32(995185), int32(997290), int32(998794), int32(999698)
];
        return int(cosTable[index]);
    }

    function paletteChannel(ColorParams memory p, int t) internal pure returns (uint8) {
        int phase = (p.C * t) / 1000 + p.D; // C is scaled by 1000
        phase = phase % 1000;
        if (phase < 0) phase += 1000;

        int angle = (TWO_PI * phase) / 1000;
        int cosVal = cosLUT(angle); // in range [-1e6, 1e6]
        int result = p.A + (p.B * cosVal) / SCALE;

        // Clamp the result to [0, SCALE]
        if (result < 0) {
            result = 0;
        } else if (result > SCALE) {
            result = SCALE;
        }
        int8 scaledResult = int8((result * 255) / SCALE);
        return uint8(scaledResult);
    }

    function renderSVG(
        uint256 tokenId, 
        uint8[10] memory values, 
        int256[15] memory paletteValues
    ) internal pure returns (string memory) {
        string memory svgContent = generateSVGContent(tokenId, values, paletteValues);
        return string(abi.encodePacked(
            "data:image/svg+xml;base64,",
            Base64.encode(bytes(svgContent))
        ));
    }

    // Split generation into subfunctions to avoid stack depth issues
    function generateSVGContent(
        uint256 tokenId, 
        uint8[10] memory values, 
        int256[15] memory paletteValues 
    ) internal pure returns (string memory) {
        // Create the SVG parts
        string memory bgPart = generateBackground(paletteValues);
        string memory pathsPart = generatePaths(paletteValues);
        string memory textPart = generateText(tokenId, values, paletteValues);
        
        // Combine into final SVG
        return string(abi.encodePacked(
            '<svg xmlns="http://www.w3.org/2000/svg" width="500" height="500" viewBox="0 0 500 500" style="font-family:Verdana,sans-serif">',
            pathsPart,
            bgPart,
            textPart,
            '</svg>'
        ));
    }

    
    function generateBackground(int256[15] memory paletteValues) internal pure returns (string memory) {
        // Background color (RGB values from palette 0-2)
        string memory bgColor = string(abi.encodePacked(
            Strings.toString(uint256(paletteValues[0] * 255 / 1000)), ",",
            Strings.toString(uint256(paletteValues[1] * 255 / 1000)), ",",
            Strings.toString(uint256(paletteValues[2] * 255 / 1000))
        ));

        string memory temp = string(abi.encodePacked(
            '<rect width="80%" height="80%" x="10%" y="10%" fill="rgb(', bgColor, ')" />'
        ));

        return temp;
    }
    
    function getFill(int256[15] memory P, int t) internal pure returns (string memory) {
        ColorParams memory p0 = ColorParams(P[3] * 1000, P[6] * 1000, P[9], P[12]);
        ColorParams memory p1 = ColorParams(P[4] * 1000, P[7] * 1000, P[10], P[13]);
        ColorParams memory p2 = ColorParams(P[5] * 1000, P[8] * 1000, P[11], P[14]);

        uint8 r = paletteChannel(p0, t);
        uint8 g = paletteChannel(p1, t);
        uint8 b = paletteChannel(p2, t);

        return string.concat(
            "rgb(",
            Strings.toString(r), ",",
            Strings.toString(g), ",",
            Strings.toString(b), ")"
        );
    }

    function generatePaths(int256[15] memory P) internal pure returns (string memory) {
        
        string memory svg;
        for (uint t0 = 0; t0 < 40; t0++) {
        
            string memory fill = getFill(P, int(t0 * 25));
            
            uint xx;
            uint yy;

            if (t0 < 10) {
                yy = 0;
                xx = t0 * 50;
            } else if (t0 < 20) {
                xx = 450;
                yy = (t0 - 10) * 50;
            } else if (t0 < 30) {
                yy = 450;
                xx = 450 - (t0 - 20) * 50;
            } else {
                xx = 0;
                yy = 450 - (t0 - 30) * 50;
            }

            svg = string.concat(
                svg,
                '<rect width="51" height="51" x="',
                Strings.toString(xx),
                '" y="',
                Strings.toString(yy),
                '" fill="',
                fill,
                '" stroke="none" />\n'
            );
        }
        return svg;
    }
        
    function generateText(
        uint256 tokenId, 
        uint8[10] memory values, 
        int256[15] memory paletteValues
    ) internal pure returns (string memory) {
        
        string memory fill = getFill(paletteValues,0);
        
        // Generate text elements
        string memory txts = string(abi.encodePacked(
            '<text x="250" y="100" text-anchor="middle" font-size="28" fill="', fill, '" stroke="none">PROGENOFORM</text>',
            '<text x="250" y="130" text-anchor="middle" font-size="24" fill="', fill, '" stroke="none">#', Strings.toString(tokenId), '</text>'
        ));
        
        // Generate bars for the first 7 values
        txts = string(abi.encodePacked(txts, generateValueBars(values, paletteValues)));
        
        return txts;
    }

    
    /**
     * @dev Generate bars representing token values
     */
    function generateValueBars(
        uint8[10] memory values, 
        int256[15] memory P) internal pure returns (string memory) {
        string memory bars = "";
        
        // Split into two batches to avoid stack depth issues
        bars = string(abi.encodePacked(
            bars,
            generateValueBarsBatch(values, 0, 4, P),
            generateValueBarsBatch(values, 4, 7, P)
        ));
        
        return bars;
    }
  

    function generateValueBarsBatch(
        uint8[10] memory values,
        uint256 startIndex,
        uint256 endIndex,
        int256[15] memory P
    ) internal pure returns (string memory) {
        string memory batchBars = "";
        uint256 xx = 92 + (startIndex * 45);
        
        for (uint256 e = startIndex; e < endIndex; e++) {
            // Calculate time value for color
            uint256 t0 = uint256(e * 1000) / uint256(7); 
            
            // Get color at this time
            string memory fillColor = getFill(P,int256(t0));
            
            // Calculate bar height based on attribute value
            uint256 h = values[e] * 2;
            uint256 tp = 400 - h;
            
            // Add bar outline and fill
            batchBars = string(abi.encodePacked(
                batchBars,
                '<rect width="45" height="200" x="', Strings.toString(xx), '" y="200" fill="none" stroke="', fillColor, '" />',
                '<rect width="45" height="', Strings.toString(h), '" x="', Strings.toString(xx), '" y="', Strings.toString(tp), '" stroke="none" fill="', fillColor, '" />'
            ));
            
            xx += 45;
        }
        
        return batchBars;
    }
}

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

pragma solidity ^0.8.20;

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

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

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        return value;
    }

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

        string memory result = new string(resultLength);

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

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

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

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

            } lt(dataPtr, endPtr) {

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

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

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

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

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

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

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

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

        return result;
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

    /**
     * @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

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

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

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

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

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

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

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
            // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2²⁵⁶ + prod0.
            uint256 prod0 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

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

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

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

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

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

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

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

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

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

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 exp;
        unchecked {
            exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
            value >>= exp;
            result += exp;

            exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
            value >>= exp;
            result += exp;

            exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
            value >>= exp;
            result += exp;

            exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
            value >>= exp;
            result += exp;

            exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
            value >>= exp;
            result += exp;

            exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
            value >>= exp;
            result += exp;

            exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
            value >>= exp;
            result += exp;

            result += SafeCast.toUint(value > 1);
        }
        return result;
    }

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

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

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

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 isGt;
        unchecked {
            isGt = SafeCast.toUint(value > (1 << 128) - 1);
            value >>= isGt * 128;
            result += isGt * 16;

            isGt = SafeCast.toUint(value > (1 << 64) - 1);
            value >>= isGt * 64;
            result += isGt * 8;

            isGt = SafeCast.toUint(value > (1 << 32) - 1);
            value >>= isGt * 32;
            result += isGt * 4;

            isGt = SafeCast.toUint(value > (1 << 16) - 1);
            value >>= isGt * 16;
            result += isGt * 2;

            result += SafeCast.toUint(value > (1 << 8) - 1);
        }
        return result;
    }

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

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

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

/**
 ____  ____   ___   ____ _____ _   _  ___  _____ ___  ____  __  __ ____  
|  _ \|  _ \ / _ \ / ___| ____| \ | |/ _ \|  ___/ _ \|  _ \|  \/  / ___| 
| |_) | |_) | | | | |  _|  _| |  \| | | | | |_ | | | | |_) | |\/| \___ \ 
|  __/|  _ <| |_| | |_| | |___| |\  | |_| |  _|| |_| |  _ <| |  | |___) |
|_|   |_| \_\\___/ \____|_____|_| \_|\___/|_|   \___/|_| \_\_|  |_|____/ 

**/

import "@openzeppelin/contracts/utils/Base64.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "./svgrenderer.sol";

library Bytecode {
  error InvalidCodeAtRange(uint256 _size, uint256 _start, uint256 _end);

  /**
    @notice Generate a creation code that results on a contract with `_code` as bytecode
    @param _code The returning value of the resulting `creationCode`
    @return creationCode (constructor) for new contract
  */
  function creationCodeFor(bytes memory _code) internal pure returns (bytes memory) {
    /*
      0x00    0x63         0x63XXXXXX  PUSH4 _code.length  size
      0x01    0x80         0x80        DUP1                size size
      0x02    0x60         0x600e      PUSH1 14            14 size size
      0x03    0x60         0x6000      PUSH1 00            0 14 size size
      0x04    0x39         0x39        CODECOPY            size
      0x05    0x60         0x6000      PUSH1 00            0 size
      0x06    0xf3         0xf3        RETURN
      <CODE>
    */

    return abi.encodePacked(
      hex"63",
      uint32(_code.length),
      hex"80_60_0E_60_00_39_60_00_F3",
      _code
    );
  }

  /**
    @notice Returns the size of the code on a given address
    @param _addr Address that may or may not contain code
    @return size of the code on the given `_addr`
  */
  function codeSize(address _addr) internal view returns (uint256 size) {
    assembly { size := extcodesize(_addr) }
  }

  /**
    @notice Returns the code of a given address
    @dev It will fail if `_end < _start`
    @param _addr Address that may or may not contain code
    @param _start number of bytes of code to skip on read
    @param _end index before which to end extraction
    @return oCode read from `_addr` deployed bytecode

    Forked from: https://gist.github.com/KardanovIR/fe98661df9338c842b4a30306d507fbd
  */
  function codeAt(address _addr, uint256 _start, uint256 _end) internal view returns (bytes memory oCode) {
    uint256 csize = codeSize(_addr);
    if (csize == 0) return bytes("");

    if (_start > csize) return bytes("");
    if (_end < _start) revert InvalidCodeAtRange(csize, _start, _end); 

    unchecked {
      uint256 reqSize = _end - _start;
      uint256 maxSize = csize - _start;

      uint256 size = maxSize < reqSize ? maxSize : reqSize;

      assembly {
        // allocate output byte array - this could also be done without assembly
        // by using o_code = new bytes(size)
        oCode := mload(0x40)
        // new "memory end" including padding
        mstore(0x40, add(oCode, and(add(add(size, 0x20), 0x1f), not(0x1f))))
        // store length in memory
        mstore(oCode, size)
        // actually retrieve the code, this needs assembly
        extcodecopy(_addr, add(oCode, 0x20), _start, size)
      }
    }
  }
}

library SSTORE2 {
  error WriteError();

  /**
    @notice Stores `_data` and returns `pointer` as key for later retrieval
    @dev The pointer is a contract address with `_data` as code
    @param _data to be written
    @return pointer Pointer to the written `_data`
  */
  function write(bytes memory _data) internal returns (address pointer) {
    // Append 00 to _data so contract can't be called
    // Build init code
    bytes memory code = Bytecode.creationCodeFor(
      abi.encodePacked(
        hex'00',
        _data
      )
    );

    // Deploy contract using create
    assembly { pointer := create(0, add(code, 32), mload(code)) }

    // Address MUST be non-zero
    if (pointer == address(0)) revert WriteError();
  }

  /**
    @notice Reads the contents of the `_pointer` code as data, skips the first byte 
    @dev The function is intended for reading pointers generated by `write`
    @param _pointer to be read
    @return data read from `_pointer` contract
  */
  function read(address _pointer) internal view returns (bytes memory) {
    return Bytecode.codeAt(_pointer, 1, type(uint256).max);
  }

  /**
    @notice Reads the contents of the `_pointer` code as data, skips the first byte 
    @dev The function is intended for reading pointers generated by `write`
    @param _pointer to be read
    @param _start number of bytes to skip
    @return data read from `_pointer` contract
  */
  function read(address _pointer, uint256 _start) internal view returns (bytes memory) {
    return Bytecode.codeAt(_pointer, _start + 1, type(uint256).max);
  }

  /**
    @notice Reads the contents of the `_pointer` code as data, skips the first byte 
    @dev The function is intended for reading pointers generated by `write`
    @param _pointer to be read
    @param _start number of bytes to skip
    @param _end index before which to end extraction
    @return data read from `_pointer` contract
  */
  function read(address _pointer, uint256 _start, uint256 _end) internal view returns (bytes memory) {
    return Bytecode.codeAt(_pointer, _start + 1, _end + 1);
  }
}

library AnimationRenderer {

  using Strings for uint256;

  struct TokenCompact {
    uint8[10] attributes;
    int256[15] palette;
    string palname;
    string rendererName;
    uint256 tokenId;
    address prefixPtr;
    address suffixPtr;
  }

     /**
     * @dev Generate on-chain token URI as base64 encoded JSON
     * @param data Compacted Data Structure
     */
    function getTokenURI(TokenCompact memory data) public view returns (string memory) {
        
       
        string memory attributesJSON = _generateAttributes(data.attributes, data.rendererName, data.palname);
        string memory image = SVGRenderer.renderSVG(data.tokenId, data.attributes, data.palette);
        uint256 tokId = data.tokenId;

        string memory json = string(abi.encodePacked(
            '{"name": "Progenoform #', 
            tokId.toString(), 
            '", "description": "An art factory with personality", "attributes": [',
            attributesJSON,
            '], "image": "', 
            image,
            '", "animation_url": "',
            animationURL(data),
            '"}'
        ));
        
        // Return base64 encoded JSON
        return string(abi.encodePacked(
            "data:application/json;base64,",
            Base64.encode(bytes(json))
        ));
    }
    
        function singleAtt(string memory title, uint8 val) public pure returns (string memory) {
            string memory textValue;           
            if (val <= 34) {
                textValue = "Low";
            } else if (val <= 45) {
                textValue = "Slightly Low";
            } else if (val <= 59) {
                textValue = "Average";
            } else if (val <= 75) {
                textValue = "Slightly High";
            } else {
                textValue = "High";
            }
            
            textValue = string(abi.encodePacked(
                '{"trait_type": "',title,'", "value" : "',textValue,'"}, '));
            return textValue;
   }

    /**
     * @dev Generate attribute JSON for token metadata
     * @param values Array of token values
     */
    function _generateAttributes(uint8[10] memory values, string memory renname, string memory palname) internal pure returns (string memory) {
        string memory sym;
        if (values[7]<1) {
             sym="None";
        } else if (values[7]<3) {
            sym="Partial";
        }
        else sym = "Full";
        string memory part1 = string(abi.encodePacked(
         singleAtt("Extroversion",values[0]), singleAtt("Openness", values[1]), singleAtt("Conscienciousness",values[2])));
        string memory part2 = string(abi.encodePacked(
         singleAtt("Agreeableness",values[3]), singleAtt("Neuroticism", values[4]), singleAtt("Perseverence", values[5])));
        string memory part3 = string(abi.encodePacked(
         singleAtt("Vitality",values[6]),'{"trait_type" : "Symmetry", "value" : "',sym,'"}, {"trait_type": "Vibe","value" : "',palname,'"}, {"trait_type" : "Renderer", "value" : "', renname,'"}'));
        
        part1 = string.concat(part1,part2,part3);
        return part1;
    }

    function animationURL(TokenCompact memory data) public view returns (string memory) {
        
        string memory prefix = string(SSTORE2.read(data.prefixPtr));
        string memory suffix = string(SSTORE2.read(data.suffixPtr));
        
        string memory attributesJson = attributesToJson(data.attributes);

        string memory combined = string(abi.encodePacked(
            prefix,
            "const tId=", data.tokenId.toString(),
            "; const tDt = ",
            attributesJson,
            "; const pal = ",
            paletteToJson(data.palette),
            "; ",    
            suffix
        ));

        return string(abi.encodePacked(
            "data:text/html;base64,",
            Base64.encode(bytes(combined))
        ));
    }

    function attributesToJson(uint8[10] memory attributes) private pure returns (string memory) {
        // Build the attributes array part first
        string memory attrArray = string(abi.encodePacked(

            uint256(attributes[0]).toString(), ", ",
            uint256(attributes[1]).toString(), ", ",
            uint256(attributes[2]).toString(), ", ",
            uint256(attributes[3]).toString(), ", ",
            uint256(attributes[4]).toString(), ", ",
            uint256(attributes[5]).toString(), ", ",
            uint256(attributes[6]).toString(), ", ",
            uint256(attributes[7]).toString(), ", ",
            uint256(attributes[8]).toString(), ", ",
            uint256(attributes[9]).toString()
        ));
        
        return string.concat("[", attrArray, "]");
    }

    function paletteToJson(int256[15] memory pal) private pure returns (string memory) {
        string memory aa = "[";
        for (uint i = 0; i<15; i++) {
           if (i>0) aa = string(abi.encodePacked(aa,", "));
           aa = string(abi.encodePacked(aa,uint256(pal[i]).toString()));
        }
        aa=string(abi.encodePacked(aa,"]"));
        return aa;   
    }
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    mapping(uint256 tokenId => address) private _owners;

    mapping(address owner => uint256) private _balances;

    mapping(uint256 tokenId => address) private _tokenApprovals;

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

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

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

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

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

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

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

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

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

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

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

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

        return _getApproved(tokenId);
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        _owners[tokenId] = to;

        emit Transfer(from, to, tokenId);

        return from;
    }

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

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

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

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

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

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

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

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

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

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

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

        _tokenApprovals[tokenId] = to;
    }

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

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

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

/**
 * @dev Standard ERC20 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC20 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 ERC721 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC721 tokens.
 */
interface IERC721Errors {
    /**
     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in EIP-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 ERC1155 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC1155 tokens.
 */
interface IERC1155Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     * @param tokenId Identifier number of a token.
     */
    error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Approve or remove `operator` as an operator for the caller.
     * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.
     *
     * Requirements:
     *
     * - The `operator` cannot be the 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) (utils/introspection/IERC165.sol)

pragma solidity ^0.8.20;

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

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

pragma solidity ^0.8.20;

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

{
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "remappings": [],
  "libraries": {
    "progenoforms.sol": {
      "AnimationRenderer": "0xedf3d4f4ef692ed3b083ce8c499b45429e7811e8"
    }
  }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"WriteError","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"NFTMinted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"rendererId","type":"uint256"}],"name":"RendererChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"BASE_MINT_PRICE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"name","type":"string"},{"internalType":"int256[15]","name":"values","type":"int256[15]"}],"name":"addPalette","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"prefix","type":"string"},{"internalType":"string","name":"suffix","type":"string"},{"internalType":"string","name":"name","type":"string"}],"name":"addRenderer","outputs":[{"internalType":"uint8","name":"rendererId","type":"uint8"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint8","name":"rendererId","type":"uint8"}],"name":"changeRenderer","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint8[10]","name":"vals","type":"uint8[10]"}],"name":"changeTokenValues","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"contractURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"uint256","name":"paletteId","type":"uint256"},{"internalType":"string","name":"name","type":"string"},{"internalType":"int256[15]","name":"values","type":"int256[15]"}],"name":"editPalette","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getMintPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint8","name":"paletteId","type":"uint8"}],"name":"getPaletteName","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint8","name":"paletteId","type":"uint8"}],"name":"getPaletteValues","outputs":[{"internalType":"int256[15]","name":"","type":"int256[15]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getTokenData","outputs":[{"internalType":"uint8[10]","name":"values","type":"uint8[10]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isPaused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"lockToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"mint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"mintQty","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"numberMinted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"paletteCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"palettes","outputs":[{"internalType":"string","name":"name","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"renderers","outputs":[{"internalType":"address","name":"prefixPtr","type":"address"},{"internalType":"address","name":"suffixPtr","type":"address"},{"internalType":"string","name":"name","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"paused","type":"bool"}],"name":"setPaused","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"unlockToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint8","name":"rendererId","type":"uint8"},{"internalType":"string","name":"prefix","type":"string"},{"internalType":"string","name":"suffix","type":"string"},{"internalType":"string","name":"name","type":"string"}],"name":"updateRenderer","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"}]

6080604052662386f26fc1000060075534801561001a575f80fd5b50336040518060400160405280600c81526020016b50726f67656e6f666f726d7360a01b815250604051806040016040528060038152602001622823a360e91b815250815f908161006b91906101be565b50600161007882826101be565b5050506001600160a01b0381166100a857604051631e4fbdf760e01b81525f600482015260240160405180910390fd5b6100b1816100d5565b50600f805460ff199081169091556001600881905560098054909216179055610278565b600680546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061014e57607f821691505b60208210810361016c57634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156101b957805f5260205f20601f840160051c810160208510156101975750805b601f840160051c820191505b818110156101b6575f81556001016101a3565b50505b505050565b81516001600160401b038111156101d7576101d7610126565b6101eb816101e5845461013a565b84610172565b6020601f82116001811461021d575f83156102065750848201515b5f19600385901b1c1916600184901b1784556101b6565b5f84815260208120601f198516915b8281101561024c578785015182556020948501946001909201910161022c565b508482101561026957868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b6131d6806102855f395ff3fe608060405260043610610233575f3560e01c806395d89b4111610129578063dcf7eefe116100a8578063e985e9c51161006d578063e985e9c514610654578063eda5370714610673578063ee0fe9811461069f578063ee1ef788146106be578063f2fde38b146106dd575f80fd5b8063dcf7eefe146105c4578063dd2e0ac0146105e3578063e29f026414610602578063e49b040614610621578063e8a3d48514610640575f80fd5b8063b187bd26116100ee578063b187bd2614610547578063b88d4fde1461055e578063c87b56dd1461057d578063c8aa08811461059c578063c9e71abd146105b1575f80fd5b806395d89b41146104a35780639a5ec8d3146104b7578063a22cb465146104e8578063a7f93ebd14610507578063b09afec11461051b575f80fd5b80633b279449116101b55780636352211e1161017a5780636352211e1461041557806370a0823114610434578063715018a61461045357806380f20363146104675780638da5cb5b14610486575f80fd5b80633b279449146103905780633ccfd60b146103af57806342842e0e146103c357806349a772b5146103e25780634d58db2f146103f6575f80fd5b80631249c58b116101fb5780631249c58b1461030757806316c38b3c1461030f5780631ffbee641461032e57806323b872dd1461035c57806332cb6b0c1461037b575f80fd5b806301ffc9a714610237578063054ee7891461026b57806306fdde031461028e578063081812fc146102af578063095ea7b3146102e6575b5f80fd5b348015610242575f80fd5b506102566102513660046126ad565b6106fc565b60405190151581526020015b60405180910390f35b348015610276575f80fd5b5061028060075481565b604051908152602001610262565b348015610299575f80fd5b506102a261074d565b60405161026291906126fd565b3480156102ba575f80fd5b506102ce6102c936600461270f565b6107dc565b6040516001600160a01b039091168152602001610262565b3480156102f1575f80fd5b50610305610300366004612741565b610803565b005b610305610812565b34801561031a575f80fd5b50610305610329366004612778565b61094d565b348015610339575f80fd5b5061034d61034836600461270f565b610968565b60405161026293929190612791565b348015610367575f80fd5b506103056103763660046127bc565b610a1d565b348015610386575f80fd5b5061028061138881565b34801561039b575f80fd5b506103056103aa366004612925565b610aa6565b3480156103ba575f80fd5b50610305610b03565b3480156103ce575f80fd5b506103056103dd3660046127bc565b610c0e565b3480156103ed575f80fd5b50600a54610280565b348015610401575f80fd5b50610305610410366004612979565b610c2d565b348015610420575f80fd5b506102ce61042f36600461270f565b610cdd565b34801561043f575f80fd5b5061028061044e3660046129ab565b610ce7565b34801561045e575f80fd5b50610305610d2c565b348015610472575f80fd5b5061030561048136600461270f565b610d3f565b348015610491575f80fd5b506006546001600160a01b03166102ce565b3480156104ae575f80fd5b506102a2610de5565b3480156104c2575f80fd5b506104d66104d1366004612a08565b610df4565b60405160ff9091168152602001610262565b3480156104f3575f80fd5b50610305610502366004612aa4565b610f7d565b348015610512575f80fd5b50610280610f88565b348015610526575f80fd5b5061053a61053536600461270f565b610fbb565b6040516102629190612ad5565b348015610552575f80fd5b5060095460ff16610256565b348015610569575f80fd5b50610305610578366004612b09565b611042565b348015610588575f80fd5b506102a261059736600461270f565b61105a565b3480156105a7575f80fd5b50610280600d5481565b6103056105bf36600461270f565b61126f565b3480156105cf575f80fd5b506102a26105de36600461270f565b611485565b3480156105ee575f80fd5b506103056105fd36600461270f565b611520565b34801561060d575f80fd5b5061030561061c366004612b8f565b6115ac565b34801561062c575f80fd5b5061030561063b366004612c3b565b611750565b34801561064b575f80fd5b506102a26117bb565b34801561065f575f80fd5b5061025661066e366004612c7e565b6117db565b34801561067e575f80fd5b5061069261068d366004612ca6565b611808565b6040516102629190612cbf565b3480156106aa575f80fd5b506102a26106b9366004612ca6565b61187f565b3480156106c9575f80fd5b506103056106d8366004612ce7565b61193a565b3480156106e8575f80fd5b506103056106f73660046129ab565b611a4f565b5f6001600160e01b031982166380ac58cd60e01b148061072c57506001600160e01b03198216635b5e139f60e01b145b8061074757506301ffc9a760e01b6001600160e01b03198316145b92915050565b60605f805461075b90612d08565b80601f016020809104026020016040519081016040528092919081815260200182805461078790612d08565b80156107d25780601f106107a9576101008083540402835291602001916107d2565b820191905f5260205f20905b8154815290600101906020018083116107b557829003601f168201915b5050505050905090565b5f6107e682611a8c565b505f828152600460205260409020546001600160a01b0316610747565b61080e828233611ac4565b5050565b60095460ff161561085f5760405162461bcd60e51b815260206004820152601260248201527110dbdb9d1c9858dd081a5cc81c185d5cd95960721b60448201526064015b60405180910390fd5b611388600a54106108a75760405162461bcd60e51b815260206004820152601260248201527113585e081cdd5c1c1b1e481c995858da195960721b6044820152606401610856565b6108af610f88565b3410156108f55760405162461bcd60e51b8152602060048201526014602482015273125b9cdd59999a58da595b9d081c185e5b595b9d60621b6044820152606401610856565b600a80549081905f61090683612d4e565b919050555061091481611ad1565b61091e3382611e8f565b604051819033907f4cc0a9c4a99ddc700de1af2c9f916a7cbfdb71f14801ccff94061ad1ef8a8040905f90a350565b610955611ea8565b6009805460ff1916911515919091179055565b600b6020525f90815260409020805460018201546002830180546001600160a01b0393841694929093169261099c90612d08565b80601f01602080910402602001604051908101604052809291908181526020018280546109c890612d08565b8015610a135780601f106109ea57610100808354040283529160200191610a13565b820191905f5260205f20905b8154815290600101906020018083116109f657829003601f168201915b5050505050905083565b6001600160a01b038216610a4657604051633250574960e11b81525f6004820152602401610856565b5f610a52838333611ed5565b9050836001600160a01b0316816001600160a01b031614610aa0576040516364283d7b60e01b81526001600160a01b0380861660048301526024820184905282166044820152606401610856565b50505050565b610aae611ea8565b600d548310610acf5760405162461bcd60e51b815260040161085690612d66565b5f838152600c60205260409020610ae68382612dda565b505f838152600c60205260409020610aa09060010182600f6124b1565b610b0b611ea8565b600260085403610b5d5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610856565b60026008555f610b756006546001600160a01b031690565b6001600160a01b0316476040515f6040518083038185875af1925050503d805f8114610bbc576040519150601f19603f3d011682016040523d82523d5f602084013e610bc1565b606091505b5050905080610c065760405162461bcd60e51b815260206004820152601160248201527015da5d1a191c985dd85b0819985a5b1959607a1b6044820152606401610856565b506001600855565b610c2883838360405180602001604052805f815250611042565b505050565b610c35611ea8565b600a548210610c715760405162461bcd60e51b815260206004820152600860248201526724a21032b93937b960c11b6044820152606401610856565b5f828152600e602052604090206001015460ff1615610cc45760405162461bcd60e51b815260206004820152600f60248201526e151bdad95b881a5cc8131bd8dad959608a1b6044820152606401610856565b5f828152600e60205260409020610c289082600a6124ef565b5f61074782611a8c565b5f6001600160a01b038216610d11576040516322718ad960e21b81525f6004820152602401610856565b506001600160a01b03165f9081526003602052604090205490565b610d34611ea8565b610d3d5f611fc7565b565b33610d4982610cdd565b6001600160a01b03161480610d6857506006546001600160a01b031633145b610da55760405162461bcd60e51b815260206004820152600e60248201526d139bdd08185d5d1a1bdc9a5e995960921b6044820152606401610856565b600a548110610dc65760405162461bcd60e51b815260040161085690612e94565b5f908152600e602052604090206001908101805460ff19169091179055565b60606001805461075b90612d08565b5f610dfd611ea8565b50600f54604080516020601f890181900481028201810190925287815260ff909216915f91610e4691908a908a90819084018382808284375f9201919091525061201892505050565b90505f610e8787878080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061201892505050565b90506040518060600160405280836001600160a01b03168152602001826001600160a01b0316815260200186868080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92018290525093909452505060ff86168152600b6020908152604091829020845181546001600160a01b03199081166001600160a01b0392831617835592860151600183018054909416911617909155908301519091506002820190610f439082612dda565b5050600f805460ff1691505f610f5883612ec2565b91906101000a81548160ff021916908360ff1602179055505050509695505050505050565b61080e33838361207b565b5f806101f4600a54610f9a9190612ef4565b610fa5906001612f07565b905080600754610fb59190612f1a565b91505090565b610fc361257d565b600a548210610fe45760405162461bcd60e51b815260040161085690612e94565b5f828152600e60205260408082208151610140810192839052929091600a918390855b825461010083900a900460ff168152602060019283018181049485019490930390920291018084116110075790505b50505050509050919050565b61104d848484610a1d565b610aa03385858585612119565b606061106461259c565b5f838152600e60205260408082208151610180810180845290928391908201908390600a908288855b825461010083900a900460ff1681526020600192830181810494850194909303909202910180841161108d575050509284525050506001919091015460ff161515602090910152805161012081015190845281516101000151919250906110f390611808565b6020840152815161010001516111089061187f565b60408085019190915260ff82165f908152600b60205220600201805461112d90612d08565b80601f016020809104026020016040519081016040528092919081815260200182805461115990612d08565b80156111a45780601f1061117b576101008083540402835291602001916111a4565b820191905f5260205f20905b81548152906001019060200180831161118757829003601f168201915b505050505060608401526080830185905260ff81165f818152600b6020818152604080842080546001600160a01b0390811660a08b01529590945291905260019091015490911660c085015251635b6ba60560e11b815273edf3d4f4ef692ed3b083ce8c499b45429e7811e89063b6d74c0a90611225908690600401612f53565b5f60405180830381865af415801561123f573d5f803e3d5ffd5b505050506040513d5f823e601f3d908101601f19168201604052611266919081019061301c565b95945050505050565b60095460ff16156112b75760405162461bcd60e51b815260206004820152601260248201527110dbdb9d1c9858dd081a5cc81c185d5cd95960721b6044820152606401610856565b61138881600a546112c89190612f07565b11156113165760405162461bcd60e51b815260206004820152601760248201527f576f756c6420657863656564206d617820737570706c790000000000000000006044820152606401610856565b5f81116113705760405162461bcd60e51b815260206004820152602260248201527f5175616e74697479206d7573742062652067726561746572207468616e207a65604482015261726f60f01b6064820152608401610856565b60648111156113c15760405162461bcd60e51b815260206004820181905260248201527f5175616e746974792063616e6e6f74206265206d6f7265207468616e203130306044820152606401610856565b5f6113ca610f88565b6113d49083612f1a565b90508034101561141d5760405162461bcd60e51b8152602060048201526014602482015273125b9cdd59999a58da595b9d081c185e5b595b9d60621b6044820152606401610856565b5f5b82811015610c2857600a80549081905f61143883612d4e565b919050555061144681611ad1565b6114503382611e8f565b604051819033907f4cc0a9c4a99ddc700de1af2c9f916a7cbfdb71f14801ccff94061ad1ef8a8040905f90a35060010161141f565b600c6020525f908152604090208054819061149f90612d08565b80601f01602080910402602001604051908101604052809291908181526020018280546114cb90612d08565b80156115165780601f106114ed57610100808354040283529160200191611516565b820191905f5260205f20905b8154815290600101906020018083116114f957829003601f168201915b5050505050905081565b3361152a82610cdd565b6001600160a01b0316146115715760405162461bcd60e51b815260206004820152600e60248201526d139bdd08185d5d1a1bdc9a5e995960921b6044820152606401610856565b600a5481106115925760405162461bcd60e51b815260040161085690612e94565b5f908152600e60205260409020600101805460ff19169055565b6115b4611ea8565b600f5460ff908116908816106116065760405162461bcd60e51b815260206004820152601760248201527614995b99195c995c88191bd95cc81b9bdd08195e1a5cdd604a1b6044820152606401610856565b5f61164587878080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061201892505050565b90505f61168686868080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061201892505050565b90506040518060600160405280836001600160a01b03168152602001826001600160a01b0316815260200185858080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92018290525093909452505060ff8c168152600b6020908152604091829020845181546001600160a01b03199081166001600160a01b03928316178355928601516001830180549094169116179091559083015190915060028201906117429082612dda565b505050505050505050505050565b611758611ea8565b6040805180820182528381526020808201849052600d545f908152600c909152919091208151819061178a9082612dda565b5060208201516117a0906001830190600f6124b1565b5050600d805491505f6117b283612d4e565b91905055505050565b606060405180606001604052806030815260200161317160309139905090565b6001600160a01b039182165f90815260056020908152604080832093909416825291909152205460ff1690565b6118106125f4565b600d548260ff16106118345760405162461bcd60e51b815260040161085690612d66565b60ff82165f908152600c60205260409081902081516101e08101909252600101600f8282826020028201915b8154815260200190600101908083116118605750505050509050919050565b6060600d548260ff16106118a55760405162461bcd60e51b815260040161085690612d66565b60ff82165f908152600c6020526040902080546118c190612d08565b80601f01602080910402602001604051908101604052809291908181526020018280546118ed90612d08565b80156110365780601f1061190f57610100808354040283529160200191611036565b820191905f5260205f20905b81548152906001019060200180831161191b5750939695505050505050565b3361194483610cdd565b6001600160a01b03161461198c5760405162461bcd60e51b815260206004820152600f60248201526e2737ba103a37b5b2b71037bbb732b960891b6044820152606401610856565b600f5460ff908116908216106119de5760405162461bcd60e51b815260206004820152601760248201527614995b99195c995c88191bd95cc81b9bdd08195e1a5cdd604a1b6044820152606401610856565b5f828152600e6020908152604091829020805469ff0000000000000000001916690100000000000000000060ff8616908102919091179091558251858152918201527fcc8e4f7626134cffe231953eae910ae0ece26cd69a04fa7781bbc1ebee865781910160405180910390a15050565b611a57611ea8565b6001600160a01b038116611a8057604051631e4fbdf760e01b81525f6004820152602401610856565b611a8981611fc7565b50565b5f818152600260205260408120546001600160a01b03168061074757604051637e27328960e01b815260048101849052602401610856565b610c288383836001612241565b5f81611ade600143613090565b60408051602081019390935290409082015242606082015244608082015260a001604051602081830303815290604052805190602001205f1c9050611b21612613565b815f604051602001611b3d929190918252602082015260400190565b60408051601f1981840301815291905280516020909101209150611b626032836130a3565b611b6d90601e612f07565b815160ff919091169052604080516020810184905260019181019190915260600160408051601f1981840301815291905280516020909101209150611bb3602d836130a3565b611bbe90602d612f07565b815160ff919091166020918201526040805191820184905260029082015260600160408051601f1981840301815291905280516020909101209150611c046032836130a3565b611c0f906019612f07565b815160ff9190911660409182015280516020810184905260039181019190915260600160408051601f1981840301815291905280516020909101209150611c576046836130a3565b611c62906014612f07565b815160ff919091166060918201526040805160208082019590955260048183015281518082038301815292019052805192019190912090611ca46028836130a3565b611caf90601e612f07565b815160ff91909116608090910152604080516020810184905260059181019190915260600160408051601f1981840301815291905280516020909101209150611cf96032836130a3565b611d0490601e612f07565b815160ff9190911660a090910152604080516020810184905260069181019190915260600160408051601f1981840301815291905280516020909101209150611d4e6032836130a3565b611d5990601e612f07565b815160ff9190911660c090910152604080516020810184905260079181019190915260600160408051601f19818403018152919052805160209091012091505f611da46064846130a3565b9050603c811015611dc85781515f9060075b60ff9092166020929092020152611de8565b605a811015611ddd5781516001906007611db6565b8151600360e0909101525b826008604051602001611e05929190918252602082015260400190565b604051602081830303815290604052805190602001205f1c9250600d5483611e2d91906130a3565b825160ff919091166101009091015281515f6101209091018190526020808401829052858252600e9052604090208251839190611e6d908290600a612632565b50602091909101516001909101805460ff191691151591909117905550505050565b61080e828260405180602001604052805f815250612345565b6006546001600160a01b03163314610d3d5760405163118cdaa760e01b8152336004820152602401610856565b5f828152600260205260408120546001600160a01b0390811690831615611f0157611f0181848661235c565b6001600160a01b03811615611f3b57611f1c5f855f80612241565b6001600160a01b0381165f90815260036020526040902080545f190190555b6001600160a01b03851615611f69576001600160a01b0385165f908152600360205260409020805460010190555b5f8481526002602052604080822080546001600160a01b0319166001600160a01b0389811691821790925591518793918516917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4949350505050565b600680546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b5f806120428360405160200161202e91906130cd565b6040516020818303038152906040526123c0565b90508051602082015ff091506001600160a01b0382166120755760405163046a55db60e11b815260040160405180910390fd5b50919050565b6001600160a01b0382166120ad57604051630b61174360e31b81526001600160a01b0383166004820152602401610856565b6001600160a01b038381165f81815260056020908152604080832094871680845294825291829020805460ff191686151590811790915591519182527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a3505050565b6001600160a01b0383163b1561223a57604051630a85bd0160e11b81526001600160a01b0384169063150b7a029061215b9088908890879087906004016130de565b6020604051808303815f875af1925050508015612195575060408051601f3d908101601f191682019092526121929181019061311a565b60015b6121fc573d8080156121c2576040519150601f19603f3d011682016040523d82523d5f602084013e6121c7565b606091505b5080515f036121f457604051633250574960e11b81526001600160a01b0385166004820152602401610856565b805181602001fd5b6001600160e01b03198116630a85bd0160e11b1461223857604051633250574960e11b81526001600160a01b0385166004820152602401610856565b505b5050505050565b808061225557506001600160a01b03821615155b15612316575f61226484611a8c565b90506001600160a01b038316158015906122905750826001600160a01b0316816001600160a01b031614155b80156122a357506122a181846117db565b155b156122cc5760405163a9fbf51f60e01b81526001600160a01b0384166004820152602401610856565b81156123145783856001600160a01b0316826001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b50505f90815260046020526040902080546001600160a01b0319166001600160a01b0392909216919091179055565b61234f83836123ec565b610c28335f858585612119565b61236783838361244d565b610c28576001600160a01b03831661239557604051637e27328960e01b815260048101829052602401610856565b60405163177e802f60e01b81526001600160a01b038316600482015260248101829052604401610856565b60608151826040516020016123d6929190613135565b6040516020818303038152906040529050919050565b6001600160a01b03821661241557604051633250574960e11b81525f6004820152602401610856565b5f61242183835f611ed5565b90506001600160a01b03811615610c28576040516339e3563760e11b81525f6004820152602401610856565b5f6001600160a01b038316158015906124a95750826001600160a01b0316846001600160a01b03161480612486575061248684846117db565b806124a957505f828152600460205260409020546001600160a01b038481169116145b949350505050565b82600f81019282156124df579160200282015b828111156124df5782518255916020019190600101906124c4565b506124eb929150612684565b5090565b6001830191839082156124df579160200282015f5b8382111561254457833560ff1683826101000a81548160ff021916908360ff16021790555092602001926001016020815f01049283019260010302612504565b80156125705782816101000a81549060ff02191690556001016020815f01049283019260010302612544565b50506124eb929150612684565b604051806101400160405280600a906020820280368337509192915050565b6040518060e001604052806125af61257d565b81526020016125bc6125f4565b815260200160608152602001606081526020015f81526020015f6001600160a01b031681526020015f6001600160a01b031681525090565b604051806101e00160405280600f906020820280368337509192915050565b604051806040016040528061262661257d565b81525f60209091015290565b6001830191839082156124df579160200282015f5b8382111561254457835183826101000a81548160ff021916908360ff16021790555092602001926001016020815f01049283019260010302612647565b5b808211156124eb575f8155600101612685565b6001600160e01b031981168114611a89575f80fd5b5f602082840312156126bd575f80fd5b81356126c881612698565b9392505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6126c860208301846126cf565b5f6020828403121561271f575f80fd5b5035919050565b80356001600160a01b038116811461273c575f80fd5b919050565b5f8060408385031215612752575f80fd5b61275b83612726565b946020939093013593505050565b8035801515811461273c575f80fd5b5f60208284031215612788575f80fd5b6126c882612769565b6001600160a01b038481168252831660208201526060604082018190525f90611266908301846126cf565b5f805f606084860312156127ce575f80fd5b6127d784612726565b92506127e560208501612726565b929592945050506040919091013590565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b0381118282101715612832576128326127f6565b604052919050565b5f6001600160401b03821115612852576128526127f6565b50601f01601f191660200190565b5f61287261286d8461283a565b61280a565b9050828152838383011115612885575f80fd5b828260208301375f602084830101529392505050565b5f82601f8301126128aa575f80fd5b6126c883833560208501612860565b5f82601f8301126128c8575f80fd5b6040516101e081016001600160401b03811182821017156128eb576128eb6127f6565b604052806101e0840185811115612900575f80fd5b845b8181101561291a578035835260209283019201612902565b509195945050505050565b5f805f6102208486031215612938575f80fd5b8335925060208401356001600160401b03811115612954575f80fd5b6129608682870161289b565b92505061297085604086016128b9565b90509250925092565b5f80610160838503121561298b575f80fd5b82359150610160830184101561299f575f80fd5b50926020919091019150565b5f602082840312156129bb575f80fd5b6126c882612726565b5f8083601f8401126129d4575f80fd5b5081356001600160401b038111156129ea575f80fd5b602083019150836020828501011115612a01575f80fd5b9250929050565b5f805f805f8060608789031215612a1d575f80fd5b86356001600160401b03811115612a32575f80fd5b612a3e89828a016129c4565b90975095505060208701356001600160401b03811115612a5c575f80fd5b612a6889828a016129c4565b90955093505060408701356001600160401b03811115612a86575f80fd5b612a9289828a016129c4565b979a9699509497509295939492505050565b5f8060408385031215612ab5575f80fd5b612abe83612726565b9150612acc60208401612769565b90509250929050565b610140810181835f5b600a811015612b0057815160ff16835260209283019290910190600101612ade565b50505092915050565b5f805f8060808587031215612b1c575f80fd5b612b2585612726565b9350612b3360208601612726565b92506040850135915060608501356001600160401b03811115612b54575f80fd5b8501601f81018713612b64575f80fd5b612b7387823560208401612860565b91505092959194509250565b803560ff8116811461273c575f80fd5b5f805f805f805f6080888a031215612ba5575f80fd5b612bae88612b7f565b965060208801356001600160401b03811115612bc8575f80fd5b612bd48a828b016129c4565b90975095505060408801356001600160401b03811115612bf2575f80fd5b612bfe8a828b016129c4565b90955093505060608801356001600160401b03811115612c1c575f80fd5b612c288a828b016129c4565b989b979a50959850939692959293505050565b5f806102008385031215612c4d575f80fd5b82356001600160401b03811115612c62575f80fd5b612c6e8582860161289b565b925050612acc84602085016128b9565b5f8060408385031215612c8f575f80fd5b612c9883612726565b9150612acc60208401612726565b5f60208284031215612cb6575f80fd5b6126c882612b7f565b6101e0810181835f5b600f811015612b00578151835260209283019290910190600101612cc8565b5f8060408385031215612cf8575f80fd5b82359150612acc60208401612b7f565b600181811c90821680612d1c57607f821691505b60208210810361207557634e487b7160e01b5f52602260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b5f60018201612d5f57612d5f612d3a565b5060010190565b60208082526016908201527514185b195d1d1948191bd95cc81b9bdd08195e1a5cdd60521b604082015260600190565b601f821115610c2857805f5260205f20601f840160051c81016020851015612dbb5750805b601f840160051c820191505b8181101561223a575f8155600101612dc7565b81516001600160401b03811115612df357612df36127f6565b612e0781612e018454612d08565b84612d96565b6020601f821160018114612e39575f8315612e225750848201515b5f19600385901b1c1916600184901b17845561223a565b5f84815260208120601f198516915b82811015612e685787850151825560209485019460019092019101612e48565b5084821015612e8557868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b602080825260149082015273151bdad95b88191bd95cc81b9bdd08195e1a5cdd60621b604082015260600190565b5f60ff821660ff8103612ed757612ed7612d3a565b60010192915050565b634e487b7160e01b5f52601260045260245ffd5b5f82612f0257612f02612ee0565b500490565b8082018082111561074757610747612d3a565b808202811582820484141761074757610747612d3a565b805f5b600f811015610aa0578151845260209384019390910190600101612f34565b602080825282515f91829084015b600a821015612f8457825160ff1681526020928301926001929092019101612f61565b5050506020830151612f9a610160840182612f31565b5060408301516103c0610340840152612fb76103e08401826126cf565b90506060840151601f1984830301610360850152612fd582826126cf565b915050608084015161038084015260a0840151612ffe6103a08501826001600160a01b03169052565b5060c08401516001600160a01b0381166103c0850152509392505050565b5f6020828403121561302c575f80fd5b81516001600160401b03811115613041575f80fd5b8201601f81018413613051575f80fd5b805161305f61286d8261283a565b818152856020838501011115613073575f80fd5b8160208401602083015e5f91810160200191909152949350505050565b8181038181111561074757610747612d3a565b5f826130b1576130b1612ee0565b500690565b5f81518060208401855e5f93019283525090919050565b5f81525f6126c860018301846130b6565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90613110908301846126cf565b9695505050505050565b5f6020828403121561312a575f80fd5b81516126c881612698565b606360f81b815260e083901b6001600160e01b03191660018201526880600e6000396000f360b81b60058201525f6124a9600e8301846130b656fe68747470733a2f2f6d696e64666f726d732e78797a2f70726f67656e6f666f726d732f636f6e74726163742e6a736f6ea2646970667358221220c9704c6f40bea4ec097bea4e3c6bc14e3f83dbb431a62d5fd8adc24f36f569cf64736f6c634300081a0033

0x608060405260043610610233575f3560e01c806395d89b4111610129578063dcf7eefe116100a8578063e985e9c51161006d578063e985e9c514610654578063eda5370714610673578063ee0fe9811461069f578063ee1ef788146106be578063f2fde38b146106dd575f80fd5b8063dcf7eefe146105c4578063dd2e0ac0146105e3578063e29f026414610602578063e49b040614610621578063e8a3d48514610640575f80fd5b8063b187bd26116100ee578063b187bd2614610547578063b88d4fde1461055e578063c87b56dd1461057d578063c8aa08811461059c578063c9e71abd146105b1575f80fd5b806395d89b41146104a35780639a5ec8d3146104b7578063a22cb465146104e8578063a7f93ebd14610507578063b09afec11461051b575f80fd5b80633b279449116101b55780636352211e1161017a5780636352211e1461041557806370a0823114610434578063715018a61461045357806380f20363146104675780638da5cb5b14610486575f80fd5b80633b279449146103905780633ccfd60b146103af57806342842e0e146103c357806349a772b5146103e25780634d58db2f146103f6575f80fd5b80631249c58b116101fb5780631249c58b1461030757806316c38b3c1461030f5780631ffbee641461032e57806323b872dd1461035c57806332cb6b0c1461037b575f80fd5b806301ffc9a714610237578063054ee7891461026b57806306fdde031461028e578063081812fc146102af578063095ea7b3146102e6575b5f80fd5b348015610242575f80fd5b506102566102513660046126ad565b6106fc565b60405190151581526020015b60405180910390f35b348015610276575f80fd5b5061028060075481565b604051908152602001610262565b348015610299575f80fd5b506102a261074d565b60405161026291906126fd565b3480156102ba575f80fd5b506102ce6102c936600461270f565b6107dc565b6040516001600160a01b039091168152602001610262565b3480156102f1575f80fd5b50610305610300366004612741565b610803565b005b610305610812565b34801561031a575f80fd5b50610305610329366004612778565b61094d565b348015610339575f80fd5b5061034d61034836600461270f565b610968565b60405161026293929190612791565b348015610367575f80fd5b506103056103763660046127bc565b610a1d565b348015610386575f80fd5b5061028061138881565b34801561039b575f80fd5b506103056103aa366004612925565b610aa6565b3480156103ba575f80fd5b50610305610b03565b3480156103ce575f80fd5b506103056103dd3660046127bc565b610c0e565b3480156103ed575f80fd5b50600a54610280565b348015610401575f80fd5b50610305610410366004612979565b610c2d565b348015610420575f80fd5b506102ce61042f36600461270f565b610cdd565b34801561043f575f80fd5b5061028061044e3660046129ab565b610ce7565b34801561045e575f80fd5b50610305610d2c565b348015610472575f80fd5b5061030561048136600461270f565b610d3f565b348015610491575f80fd5b506006546001600160a01b03166102ce565b3480156104ae575f80fd5b506102a2610de5565b3480156104c2575f80fd5b506104d66104d1366004612a08565b610df4565b60405160ff9091168152602001610262565b3480156104f3575f80fd5b50610305610502366004612aa4565b610f7d565b348015610512575f80fd5b50610280610f88565b348015610526575f80fd5b5061053a61053536600461270f565b610fbb565b6040516102629190612ad5565b348015610552575f80fd5b5060095460ff16610256565b348015610569575f80fd5b50610305610578366004612b09565b611042565b348015610588575f80fd5b506102a261059736600461270f565b61105a565b3480156105a7575f80fd5b50610280600d5481565b6103056105bf36600461270f565b61126f565b3480156105cf575f80fd5b506102a26105de36600461270f565b611485565b3480156105ee575f80fd5b506103056105fd36600461270f565b611520565b34801561060d575f80fd5b5061030561061c366004612b8f565b6115ac565b34801561062c575f80fd5b5061030561063b366004612c3b565b611750565b34801561064b575f80fd5b506102a26117bb565b34801561065f575f80fd5b5061025661066e366004612c7e565b6117db565b34801561067e575f80fd5b5061069261068d366004612ca6565b611808565b6040516102629190612cbf565b3480156106aa575f80fd5b506102a26106b9366004612ca6565b61187f565b3480156106c9575f80fd5b506103056106d8366004612ce7565b61193a565b3480156106e8575f80fd5b506103056106f73660046129ab565b611a4f565b5f6001600160e01b031982166380ac58cd60e01b148061072c57506001600160e01b03198216635b5e139f60e01b145b8061074757506301ffc9a760e01b6001600160e01b03198316145b92915050565b60605f805461075b90612d08565b80601f016020809104026020016040519081016040528092919081815260200182805461078790612d08565b80156107d25780601f106107a9576101008083540402835291602001916107d2565b820191905f5260205f20905b8154815290600101906020018083116107b557829003601f168201915b5050505050905090565b5f6107e682611a8c565b505f828152600460205260409020546001600160a01b0316610747565b61080e828233611ac4565b5050565b60095460ff161561085f5760405162461bcd60e51b815260206004820152601260248201527110dbdb9d1c9858dd081a5cc81c185d5cd95960721b60448201526064015b60405180910390fd5b611388600a54106108a75760405162461bcd60e51b815260206004820152601260248201527113585e081cdd5c1c1b1e481c995858da195960721b6044820152606401610856565b6108af610f88565b3410156108f55760405162461bcd60e51b8152602060048201526014602482015273125b9cdd59999a58da595b9d081c185e5b595b9d60621b6044820152606401610856565b600a80549081905f61090683612d4e565b919050555061091481611ad1565b61091e3382611e8f565b604051819033907f4cc0a9c4a99ddc700de1af2c9f916a7cbfdb71f14801ccff94061ad1ef8a8040905f90a350565b610955611ea8565b6009805460ff1916911515919091179055565b600b6020525f90815260409020805460018201546002830180546001600160a01b0393841694929093169261099c90612d08565b80601f01602080910402602001604051908101604052809291908181526020018280546109c890612d08565b8015610a135780601f106109ea57610100808354040283529160200191610a13565b820191905f5260205f20905b8154815290600101906020018083116109f657829003601f168201915b5050505050905083565b6001600160a01b038216610a4657604051633250574960e11b81525f6004820152602401610856565b5f610a52838333611ed5565b9050836001600160a01b0316816001600160a01b031614610aa0576040516364283d7b60e01b81526001600160a01b0380861660048301526024820184905282166044820152606401610856565b50505050565b610aae611ea8565b600d548310610acf5760405162461bcd60e51b815260040161085690612d66565b5f838152600c60205260409020610ae68382612dda565b505f838152600c60205260409020610aa09060010182600f6124b1565b610b0b611ea8565b600260085403610b5d5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610856565b60026008555f610b756006546001600160a01b031690565b6001600160a01b0316476040515f6040518083038185875af1925050503d805f8114610bbc576040519150601f19603f3d011682016040523d82523d5f602084013e610bc1565b606091505b5050905080610c065760405162461bcd60e51b815260206004820152601160248201527015da5d1a191c985dd85b0819985a5b1959607a1b6044820152606401610856565b506001600855565b610c2883838360405180602001604052805f815250611042565b505050565b610c35611ea8565b600a548210610c715760405162461bcd60e51b815260206004820152600860248201526724a21032b93937b960c11b6044820152606401610856565b5f828152600e602052604090206001015460ff1615610cc45760405162461bcd60e51b815260206004820152600f60248201526e151bdad95b881a5cc8131bd8dad959608a1b6044820152606401610856565b5f828152600e60205260409020610c289082600a6124ef565b5f61074782611a8c565b5f6001600160a01b038216610d11576040516322718ad960e21b81525f6004820152602401610856565b506001600160a01b03165f9081526003602052604090205490565b610d34611ea8565b610d3d5f611fc7565b565b33610d4982610cdd565b6001600160a01b03161480610d6857506006546001600160a01b031633145b610da55760405162461bcd60e51b815260206004820152600e60248201526d139bdd08185d5d1a1bdc9a5e995960921b6044820152606401610856565b600a548110610dc65760405162461bcd60e51b815260040161085690612e94565b5f908152600e602052604090206001908101805460ff19169091179055565b60606001805461075b90612d08565b5f610dfd611ea8565b50600f54604080516020601f890181900481028201810190925287815260ff909216915f91610e4691908a908a90819084018382808284375f9201919091525061201892505050565b90505f610e8787878080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061201892505050565b90506040518060600160405280836001600160a01b03168152602001826001600160a01b0316815260200186868080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92018290525093909452505060ff86168152600b6020908152604091829020845181546001600160a01b03199081166001600160a01b0392831617835592860151600183018054909416911617909155908301519091506002820190610f439082612dda565b5050600f805460ff1691505f610f5883612ec2565b91906101000a81548160ff021916908360ff1602179055505050509695505050505050565b61080e33838361207b565b5f806101f4600a54610f9a9190612ef4565b610fa5906001612f07565b905080600754610fb59190612f1a565b91505090565b610fc361257d565b600a548210610fe45760405162461bcd60e51b815260040161085690612e94565b5f828152600e60205260408082208151610140810192839052929091600a918390855b825461010083900a900460ff168152602060019283018181049485019490930390920291018084116110075790505b50505050509050919050565b61104d848484610a1d565b610aa03385858585612119565b606061106461259c565b5f838152600e60205260408082208151610180810180845290928391908201908390600a908288855b825461010083900a900460ff1681526020600192830181810494850194909303909202910180841161108d575050509284525050506001919091015460ff161515602090910152805161012081015190845281516101000151919250906110f390611808565b6020840152815161010001516111089061187f565b60408085019190915260ff82165f908152600b60205220600201805461112d90612d08565b80601f016020809104026020016040519081016040528092919081815260200182805461115990612d08565b80156111a45780601f1061117b576101008083540402835291602001916111a4565b820191905f5260205f20905b81548152906001019060200180831161118757829003601f168201915b505050505060608401526080830185905260ff81165f818152600b6020818152604080842080546001600160a01b0390811660a08b01529590945291905260019091015490911660c085015251635b6ba60560e11b815273edf3d4f4ef692ed3b083ce8c499b45429e7811e89063b6d74c0a90611225908690600401612f53565b5f60405180830381865af415801561123f573d5f803e3d5ffd5b505050506040513d5f823e601f3d908101601f19168201604052611266919081019061301c565b95945050505050565b60095460ff16156112b75760405162461bcd60e51b815260206004820152601260248201527110dbdb9d1c9858dd081a5cc81c185d5cd95960721b6044820152606401610856565b61138881600a546112c89190612f07565b11156113165760405162461bcd60e51b815260206004820152601760248201527f576f756c6420657863656564206d617820737570706c790000000000000000006044820152606401610856565b5f81116113705760405162461bcd60e51b815260206004820152602260248201527f5175616e74697479206d7573742062652067726561746572207468616e207a65604482015261726f60f01b6064820152608401610856565b60648111156113c15760405162461bcd60e51b815260206004820181905260248201527f5175616e746974792063616e6e6f74206265206d6f7265207468616e203130306044820152606401610856565b5f6113ca610f88565b6113d49083612f1a565b90508034101561141d5760405162461bcd60e51b8152602060048201526014602482015273125b9cdd59999a58da595b9d081c185e5b595b9d60621b6044820152606401610856565b5f5b82811015610c2857600a80549081905f61143883612d4e565b919050555061144681611ad1565b6114503382611e8f565b604051819033907f4cc0a9c4a99ddc700de1af2c9f916a7cbfdb71f14801ccff94061ad1ef8a8040905f90a35060010161141f565b600c6020525f908152604090208054819061149f90612d08565b80601f01602080910402602001604051908101604052809291908181526020018280546114cb90612d08565b80156115165780601f106114ed57610100808354040283529160200191611516565b820191905f5260205f20905b8154815290600101906020018083116114f957829003601f168201915b5050505050905081565b3361152a82610cdd565b6001600160a01b0316146115715760405162461bcd60e51b815260206004820152600e60248201526d139bdd08185d5d1a1bdc9a5e995960921b6044820152606401610856565b600a5481106115925760405162461bcd60e51b815260040161085690612e94565b5f908152600e60205260409020600101805460ff19169055565b6115b4611ea8565b600f5460ff908116908816106116065760405162461bcd60e51b815260206004820152601760248201527614995b99195c995c88191bd95cc81b9bdd08195e1a5cdd604a1b6044820152606401610856565b5f61164587878080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061201892505050565b90505f61168686868080601f0160208091040260200160405190810160405280939291908181526020018383808284375f9201919091525061201892505050565b90506040518060600160405280836001600160a01b03168152602001826001600160a01b0316815260200185858080601f0160208091040260200160405190810160405280939291908181526020018383808284375f92018290525093909452505060ff8c168152600b6020908152604091829020845181546001600160a01b03199081166001600160a01b03928316178355928601516001830180549094169116179091559083015190915060028201906117429082612dda565b505050505050505050505050565b611758611ea8565b6040805180820182528381526020808201849052600d545f908152600c909152919091208151819061178a9082612dda565b5060208201516117a0906001830190600f6124b1565b5050600d805491505f6117b283612d4e565b91905055505050565b606060405180606001604052806030815260200161317160309139905090565b6001600160a01b039182165f90815260056020908152604080832093909416825291909152205460ff1690565b6118106125f4565b600d548260ff16106118345760405162461bcd60e51b815260040161085690612d66565b60ff82165f908152600c60205260409081902081516101e08101909252600101600f8282826020028201915b8154815260200190600101908083116118605750505050509050919050565b6060600d548260ff16106118a55760405162461bcd60e51b815260040161085690612d66565b60ff82165f908152600c6020526040902080546118c190612d08565b80601f01602080910402602001604051908101604052809291908181526020018280546118ed90612d08565b80156110365780601f1061190f57610100808354040283529160200191611036565b820191905f5260205f20905b81548152906001019060200180831161191b5750939695505050505050565b3361194483610cdd565b6001600160a01b03161461198c5760405162461bcd60e51b815260206004820152600f60248201526e2737ba103a37b5b2b71037bbb732b960891b6044820152606401610856565b600f5460ff908116908216106119de5760405162461bcd60e51b815260206004820152601760248201527614995b99195c995c88191bd95cc81b9bdd08195e1a5cdd604a1b6044820152606401610856565b5f828152600e6020908152604091829020805469ff0000000000000000001916690100000000000000000060ff8616908102919091179091558251858152918201527fcc8e4f7626134cffe231953eae910ae0ece26cd69a04fa7781bbc1ebee865781910160405180910390a15050565b611a57611ea8565b6001600160a01b038116611a8057604051631e4fbdf760e01b81525f6004820152602401610856565b611a8981611fc7565b50565b5f818152600260205260408120546001600160a01b03168061074757604051637e27328960e01b815260048101849052602401610856565b610c288383836001612241565b5f81611ade600143613090565b60408051602081019390935290409082015242606082015244608082015260a001604051602081830303815290604052805190602001205f1c9050611b21612613565b815f604051602001611b3d929190918252602082015260400190565b60408051601f1981840301815291905280516020909101209150611b626032836130a3565b611b6d90601e612f07565b815160ff919091169052604080516020810184905260019181019190915260600160408051601f1981840301815291905280516020909101209150611bb3602d836130a3565b611bbe90602d612f07565b815160ff919091166020918201526040805191820184905260029082015260600160408051601f1981840301815291905280516020909101209150611c046032836130a3565b611c0f906019612f07565b815160ff9190911660409182015280516020810184905260039181019190915260600160408051601f1981840301815291905280516020909101209150611c576046836130a3565b611c62906014612f07565b815160ff919091166060918201526040805160208082019590955260048183015281518082038301815292019052805192019190912090611ca46028836130a3565b611caf90601e612f07565b815160ff91909116608090910152604080516020810184905260059181019190915260600160408051601f1981840301815291905280516020909101209150611cf96032836130a3565b611d0490601e612f07565b815160ff9190911660a090910152604080516020810184905260069181019190915260600160408051601f1981840301815291905280516020909101209150611d4e6032836130a3565b611d5990601e612f07565b815160ff9190911660c090910152604080516020810184905260079181019190915260600160408051601f19818403018152919052805160209091012091505f611da46064846130a3565b9050603c811015611dc85781515f9060075b60ff9092166020929092020152611de8565b605a811015611ddd5781516001906007611db6565b8151600360e0909101525b826008604051602001611e05929190918252602082015260400190565b604051602081830303815290604052805190602001205f1c9250600d5483611e2d91906130a3565b825160ff919091166101009091015281515f6101209091018190526020808401829052858252600e9052604090208251839190611e6d908290600a612632565b50602091909101516001909101805460ff191691151591909117905550505050565b61080e828260405180602001604052805f815250612345565b6006546001600160a01b03163314610d3d5760405163118cdaa760e01b8152336004820152602401610856565b5f828152600260205260408120546001600160a01b0390811690831615611f0157611f0181848661235c565b6001600160a01b03811615611f3b57611f1c5f855f80612241565b6001600160a01b0381165f90815260036020526040902080545f190190555b6001600160a01b03851615611f69576001600160a01b0385165f908152600360205260409020805460010190555b5f8481526002602052604080822080546001600160a01b0319166001600160a01b0389811691821790925591518793918516917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4949350505050565b600680546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b5f806120428360405160200161202e91906130cd565b6040516020818303038152906040526123c0565b90508051602082015ff091506001600160a01b0382166120755760405163046a55db60e11b815260040160405180910390fd5b50919050565b6001600160a01b0382166120ad57604051630b61174360e31b81526001600160a01b0383166004820152602401610856565b6001600160a01b038381165f81815260056020908152604080832094871680845294825291829020805460ff191686151590811790915591519182527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a3505050565b6001600160a01b0383163b1561223a57604051630a85bd0160e11b81526001600160a01b0384169063150b7a029061215b9088908890879087906004016130de565b6020604051808303815f875af1925050508015612195575060408051601f3d908101601f191682019092526121929181019061311a565b60015b6121fc573d8080156121c2576040519150601f19603f3d011682016040523d82523d5f602084013e6121c7565b606091505b5080515f036121f457604051633250574960e11b81526001600160a01b0385166004820152602401610856565b805181602001fd5b6001600160e01b03198116630a85bd0160e11b1461223857604051633250574960e11b81526001600160a01b0385166004820152602401610856565b505b5050505050565b808061225557506001600160a01b03821615155b15612316575f61226484611a8c565b90506001600160a01b038316158015906122905750826001600160a01b0316816001600160a01b031614155b80156122a357506122a181846117db565b155b156122cc5760405163a9fbf51f60e01b81526001600160a01b0384166004820152602401610856565b81156123145783856001600160a01b0316826001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b50505f90815260046020526040902080546001600160a01b0319166001600160a01b0392909216919091179055565b61234f83836123ec565b610c28335f858585612119565b61236783838361244d565b610c28576001600160a01b03831661239557604051637e27328960e01b815260048101829052602401610856565b60405163177e802f60e01b81526001600160a01b038316600482015260248101829052604401610856565b60608151826040516020016123d6929190613135565b6040516020818303038152906040529050919050565b6001600160a01b03821661241557604051633250574960e11b81525f6004820152602401610856565b5f61242183835f611ed5565b90506001600160a01b03811615610c28576040516339e3563760e11b81525f6004820152602401610856565b5f6001600160a01b038316158015906124a95750826001600160a01b0316846001600160a01b03161480612486575061248684846117db565b806124a957505f828152600460205260409020546001600160a01b038481169116145b949350505050565b82600f81019282156124df579160200282015b828111156124df5782518255916020019190600101906124c4565b506124eb929150612684565b5090565b6001830191839082156124df579160200282015f5b8382111561254457833560ff1683826101000a81548160ff021916908360ff16021790555092602001926001016020815f01049283019260010302612504565b80156125705782816101000a81549060ff02191690556001016020815f01049283019260010302612544565b50506124eb929150612684565b604051806101400160405280600a906020820280368337509192915050565b6040518060e001604052806125af61257d565b81526020016125bc6125f4565b815260200160608152602001606081526020015f81526020015f6001600160a01b031681526020015f6001600160a01b031681525090565b604051806101e00160405280600f906020820280368337509192915050565b604051806040016040528061262661257d565b81525f60209091015290565b6001830191839082156124df579160200282015f5b8382111561254457835183826101000a81548160ff021916908360ff16021790555092602001926001016020815f01049283019260010302612647565b5b808211156124eb575f8155600101612685565b6001600160e01b031981168114611a89575f80fd5b5f602082840312156126bd575f80fd5b81356126c881612698565b9392505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6126c860208301846126cf565b5f6020828403121561271f575f80fd5b5035919050565b80356001600160a01b038116811461273c575f80fd5b919050565b5f8060408385031215612752575f80fd5b61275b83612726565b946020939093013593505050565b8035801515811461273c575f80fd5b5f60208284031215612788575f80fd5b6126c882612769565b6001600160a01b038481168252831660208201526060604082018190525f90611266908301846126cf565b5f805f606084860312156127ce575f80fd5b6127d784612726565b92506127e560208501612726565b929592945050506040919091013590565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b0381118282101715612832576128326127f6565b604052919050565b5f6001600160401b03821115612852576128526127f6565b50601f01601f191660200190565b5f61287261286d8461283a565b61280a565b9050828152838383011115612885575f80fd5b828260208301375f602084830101529392505050565b5f82601f8301126128aa575f80fd5b6126c883833560208501612860565b5f82601f8301126128c8575f80fd5b6040516101e081016001600160401b03811182821017156128eb576128eb6127f6565b604052806101e0840185811115612900575f80fd5b845b8181101561291a578035835260209283019201612902565b509195945050505050565b5f805f6102208486031215612938575f80fd5b8335925060208401356001600160401b03811115612954575f80fd5b6129608682870161289b565b92505061297085604086016128b9565b90509250925092565b5f80610160838503121561298b575f80fd5b82359150610160830184101561299f575f80fd5b50926020919091019150565b5f602082840312156129bb575f80fd5b6126c882612726565b5f8083601f8401126129d4575f80fd5b5081356001600160401b038111156129ea575f80fd5b602083019150836020828501011115612a01575f80fd5b9250929050565b5f805f805f8060608789031215612a1d575f80fd5b86356001600160401b03811115612a32575f80fd5b612a3e89828a016129c4565b90975095505060208701356001600160401b03811115612a5c575f80fd5b612a6889828a016129c4565b90955093505060408701356001600160401b03811115612a86575f80fd5b612a9289828a016129c4565b979a9699509497509295939492505050565b5f8060408385031215612ab5575f80fd5b612abe83612726565b9150612acc60208401612769565b90509250929050565b610140810181835f5b600a811015612b0057815160ff16835260209283019290910190600101612ade565b50505092915050565b5f805f8060808587031215612b1c575f80fd5b612b2585612726565b9350612b3360208601612726565b92506040850135915060608501356001600160401b03811115612b54575f80fd5b8501601f81018713612b64575f80fd5b612b7387823560208401612860565b91505092959194509250565b803560ff8116811461273c575f80fd5b5f805f805f805f6080888a031215612ba5575f80fd5b612bae88612b7f565b965060208801356001600160401b03811115612bc8575f80fd5b612bd48a828b016129c4565b90975095505060408801356001600160401b03811115612bf2575f80fd5b612bfe8a828b016129c4565b90955093505060608801356001600160401b03811115612c1c575f80fd5b612c288a828b016129c4565b989b979a50959850939692959293505050565b5f806102008385031215612c4d575f80fd5b82356001600160401b03811115612c62575f80fd5b612c6e8582860161289b565b925050612acc84602085016128b9565b5f8060408385031215612c8f575f80fd5b612c9883612726565b9150612acc60208401612726565b5f60208284031215612cb6575f80fd5b6126c882612b7f565b6101e0810181835f5b600f811015612b00578151835260209283019290910190600101612cc8565b5f8060408385031215612cf8575f80fd5b82359150612acc60208401612b7f565b600181811c90821680612d1c57607f821691505b60208210810361207557634e487b7160e01b5f52602260045260245ffd5b634e487b7160e01b5f52601160045260245ffd5b5f60018201612d5f57612d5f612d3a565b5060010190565b60208082526016908201527514185b195d1d1948191bd95cc81b9bdd08195e1a5cdd60521b604082015260600190565b601f821115610c2857805f5260205f20601f840160051c81016020851015612dbb5750805b601f840160051c820191505b8181101561223a575f8155600101612dc7565b81516001600160401b03811115612df357612df36127f6565b612e0781612e018454612d08565b84612d96565b6020601f821160018114612e39575f8315612e225750848201515b5f19600385901b1c1916600184901b17845561223a565b5f84815260208120601f198516915b82811015612e685787850151825560209485019460019092019101612e48565b5084821015612e8557868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b602080825260149082015273151bdad95b88191bd95cc81b9bdd08195e1a5cdd60621b604082015260600190565b5f60ff821660ff8103612ed757612ed7612d3a565b60010192915050565b634e487b7160e01b5f52601260045260245ffd5b5f82612f0257612f02612ee0565b500490565b8082018082111561074757610747612d3a565b808202811582820484141761074757610747612d3a565b805f5b600f811015610aa0578151845260209384019390910190600101612f34565b602080825282515f91829084015b600a821015612f8457825160ff1681526020928301926001929092019101612f61565b5050506020830151612f9a610160840182612f31565b5060408301516103c0610340840152612fb76103e08401826126cf565b90506060840151601f1984830301610360850152612fd582826126cf565b915050608084015161038084015260a0840151612ffe6103a08501826001600160a01b03169052565b5060c08401516001600160a01b0381166103c0850152509392505050565b5f6020828403121561302c575f80fd5b81516001600160401b03811115613041575f80fd5b8201601f81018413613051575f80fd5b805161305f61286d8261283a565b818152856020838501011115613073575f80fd5b8160208401602083015e5f91810160200191909152949350505050565b8181038181111561074757610747612d3a565b5f826130b1576130b1612ee0565b500690565b5f81518060208401855e5f93019283525090919050565b5f81525f6126c860018301846130b6565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90613110908301846126cf565b9695505050505050565b5f6020828403121561312a575f80fd5b81516126c881612698565b606360f81b815260e083901b6001600160e01b03191660018201526880600e6000396000f360b81b60058201525f6124a9600e8301846130b656fe68747470733a2f2f6d696e64666f726d732e78797a2f70726f67656e6f666f726d732f636f6e74726163742e6a736f6ea2646970667358221220c9704c6f40bea4ec097bea4e3c6bc14e3f83dbb431a62d5fd8adc24f36f569cf64736f6c634300081a0033