Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE

More Options

• Similar
• Compare

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

import "solady/src/auth/Ownable.sol";
import "@openzeppelin/contracts/token/ERC721/ERC721.sol";
import "@openzeppelin/contracts/token/ERC721/extensions/ERC721Enumerable.sol";
import "./interfaces/IChannelManager.sol";
import "./interfaces/IProtocolFees.sol";
import "./ProtocolFees.sol";
import "./types/Comments.sol";
import "./types/Channels.sol";
import "./types/Metadata.sol";
import "./interfaces/IHook.sol";

/// @title ChannelManager - A contract for managing comment channels and their hooks as NFTs
/// @notice This contract allows creation and management of channels with configurable hooks, where each channel is an NFT
/// @dev Implements channel management with the following security features:
contract ChannelManager is IChannelManager, ProtocolFees, ERC721Enumerable {
  /// @notice Base URI for NFT metadata
  string internal baseURIValue;

  // Mapping from channel ID to channel configuration
  mapping(uint256 => Channels.Channel) internal channels;

  // Channel metadata storage mappings
  /// @notice Mapping of channel ID to metadata key to metadata value
  mapping(uint256 => mapping(bytes32 => bytes)) public channelMetadata;
  /// @notice Mapping of channel ID to array of metadata keys
  mapping(uint256 => bytes32[]) public channelMetadataKeys;

  /// @notice Constructor sets the contract owner and initializes ERC721
  /// @param initialOwner The address that will own the contract
  constructor(
    address initialOwner
  ) ProtocolFees(initialOwner) ERC721("ECP Channel", "ECPC") {
    if (initialOwner == address(0)) revert ZeroAddress();

    // Create default channel with ID 0
    _safeMint(initialOwner, 0);

    Channels.Channel storage channelZero = channels[0];

    channelZero.name = "Home";
    channelZero.description = "Any kind of content";

    emit ChannelCreated(
      0,
      channelZero.name,
      channelZero.description,
      new Metadata.MetadataEntry[](0),
      channelZero.hook,
      initialOwner
    );
  }

  /// @inheritdoc IChannelManager
  function getChannel(
    uint256 channelId
  ) external view returns (Channels.Channel memory) {
    if (!_channelExists(channelId)) revert ChannelDoesNotExist();
    return channels[channelId];
  }

  /// @notice Calculates a unique hash for a channel
  /// @param creator The address of the channel creator
  /// @param name The name of the channel
  /// @param description The description of the channel
  /// @param metadata The channel metadata entries
  /// @return bytes32 The computed hash
  function _getChannelId(
    address creator,
    string memory name,
    string memory description,
    Metadata.MetadataEntry[] memory metadata
  ) internal view returns (uint256) {
    return
      uint256(
        keccak256(
          abi.encodePacked(
            creator,
            keccak256(bytes(name)),
            keccak256(bytes(description)),
            _hashMetadataArray(metadata),
            block.timestamp,
            block.chainid
          )
        )
      );
  }

  /// @notice Internal function to check if a channel exists
  /// @param channelId The channel ID to check
  /// @return bool Whether the channel exists
  function _channelExists(
    uint256 channelId
  ) internal view virtual returns (bool) {
    return _ownerOf(channelId) != address(0);
  }

  /// @notice Internal function to hash metadata array for deterministic channel ID generation
  /// @param metadata The metadata array to hash
  /// @return The hash of the metadata array
  function _hashMetadataArray(
    Metadata.MetadataEntry[] memory metadata
  ) internal pure returns (bytes32) {
    bytes32[] memory hashedEntries = new bytes32[](metadata.length);

    for (uint i = 0; i < metadata.length; i++) {
      hashedEntries[i] = keccak256(
        abi.encode(
          keccak256("MetadataEntry(bytes32 key,bytes value)"),
          metadata[i].key,
          keccak256(metadata[i].value)
        )
      );
    }

    return keccak256(abi.encodePacked(hashedEntries));
  }

  /// @inheritdoc IChannelManager
  function createChannel(
    string calldata name,
    string calldata description,
    Metadata.MetadataEntry[] calldata metadata,
    address hook
  ) external payable returns (uint256 channelId) {
    if (bytes(name).length == 0) revert EmptyChannelName();

    // Generate channel ID using the internal function
    channelId = _getChannelId(msg.sender, name, description, metadata);

    // Ensure channel ID doesn't already exist
    if (_channelExists(channelId)) revert ChannelAlreadyExists();

    _collectChannelCreationFee();

    _safeMint(msg.sender, channelId);

    Channels.Channel storage channel = channels[channelId];

    channel.name = name;
    channel.description = description;
    _createChannelMetadata(channelId, metadata);

    emit ChannelCreated(
      channelId,
      name,
      description,
      metadata,
      hook,
      msg.sender
    );

    // Add hook if provided
    if (hook != address(0)) {
      _setHook(channelId, hook);
    }

    return channelId;
  }

  /// @inheritdoc IChannelManager
  function updateChannel(
    uint256 channelId,
    string calldata name,
    string calldata description,
    Metadata.MetadataEntryOp[] calldata metadataOperations
  ) external {
    if (bytes(name).length == 0) revert EmptyChannelName();
    if (!_channelExists(channelId)) revert ChannelDoesNotExist();
    if (ownerOf(channelId) != msg.sender) revert UnauthorizedCaller();

    Channels.Channel storage channel = channels[channelId];

    channel.name = name;
    channel.description = description;
    _setChannelMetadata(channelId, metadataOperations);

    Metadata.MetadataEntry[] memory metadata = getChannelMetadata(channelId);

    emit ChannelUpdated(channelId, name, description, metadata);

    if (channel.hook != address(0)) {
      IHook hook = IHook(channel.hook);
      Hooks.Permissions memory permissions = hook.getHookPermissions();

      if (permissions.onChannelUpdate) {
        hook.onChannelUpdate(address(this), channelId, channel, metadata);
      }
    }
  }

  /// @inheritdoc IChannelManager
  function setHook(uint256 channelId, address hook) external {
    if (!_channelExists(channelId)) revert ChannelDoesNotExist();
    if (ownerOf(channelId) != msg.sender) revert UnauthorizedCaller();
    if (hook == channels[channelId].hook) revert HookAlreadySet();

    return _setHook(channelId, hook);
  }

  /// @notice Internal function to set the hook for a channel
  /// @param channelId The unique identifier of the channel
  /// @param hook The address of the hook contract
  function _setHook(uint256 channelId, address hook) internal nonReentrant {
    // Emit events before calling the`onInitialize` hook to ensure the order of events is correct in the case of reentrancy
    emit HookSet(channelId, hook);
    emit HookStatusUpdated(channelId, hook, hook != address(0));

    if (hook != address(0)) {
      // Validate that the hook implements IHook interface
      try IERC165(hook).supportsInterface(type(IHook).interfaceId) returns (
        bool result
      ) {
        if (!result) revert InvalidHookInterface();
      } catch {
        revert InvalidHookInterface();
      }
      // Get hook permissions and store them on the channel
      Hooks.Permissions memory permissions = IHook(hook).getHookPermissions();

      channels[channelId].hook = hook;
      channels[channelId].permissions = permissions;

      // Call afterInitialize hook if permitted
      if (permissions.onInitialize) {
        IHook(hook).onInitialize(
          address(this),
          channels[channelId],
          channelId,
          getChannelMetadata(channelId)
        );
      }
    } else {
      delete channels[channelId].hook; // Properly reset to default value
      delete channels[channelId].permissions;
    }
  }

  /// @inheritdoc IChannelManager
  function channelExists(uint256 channelId) external view returns (bool) {
    return _channelExists(channelId);
  }

  /// @inheritdoc IChannelManager
  function setBaseURI(string calldata baseURI_) external onlyOwner {
    if (bytes(baseURI_).length == 0) revert IChannelManager.InvalidBaseURI();
    baseURIValue = baseURI_;
    emit IChannelManager.BaseURIUpdated(baseURI_);
  }

  /// @notice Returns the base URI for token metadata
  /// @dev Internal function that overrides ERC721's _baseURI()
  function _baseURI() internal view virtual override returns (string memory) {
    return baseURIValue;
  }

  /// @notice Internal function to create channel metadata
  /// @param channelId The unique identifier of the channel
  /// @param metadata The metadata entries to create
  function _createChannelMetadata(
    uint256 channelId,
    Metadata.MetadataEntry[] calldata metadata
  ) internal {
    mapping(bytes32 => bytes) storage channelMetadataForId = channelMetadata[
      channelId
    ];
    bytes32[] storage channelMetadataKeysForId = channelMetadataKeys[channelId];
    for (uint i = 0; i < metadata.length; i++) {
      bytes32 key = metadata[i].key;
      bytes memory val = metadata[i].value;
      if (key == bytes32(0)) revert InvalidKey();
      channelMetadataForId[key] = val;
      channelMetadataKeysForId.push(key);
    }
  }

  /// @notice Sets metadata for a channel
  /// @param channelId The unique identifier of the channel
  /// @param operations Array of metadata operations to perform
  function _setChannelMetadata(
    uint256 channelId,
    Metadata.MetadataEntryOp[] calldata operations
  ) internal {
    if (!_channelExists(channelId)) revert ChannelDoesNotExist();
    if (ownerOf(channelId) != msg.sender) revert UnauthorizedCaller();

    mapping(bytes32 => bytes) storage channelMetadataForId = channelMetadata[
      channelId
    ];
    bytes32[] storage channelMetadataKeysForId = channelMetadataKeys[channelId];
    // Apply metadata operations
    for (uint i = 0; i < operations.length; i++) {
      Metadata.MetadataEntryOp memory op = operations[i];

      // Ensure the key is not empty
      if (op.key == bytes32(0)) revert InvalidKey();

      if (op.operation == Metadata.MetadataOperation.DELETE) {
        _deleteChannelMetadataKey(channelId, op.key);
        emit ChannelMetadataSet(channelId, op.key, ""); // Emit empty value for deletion
      } else if (op.operation == Metadata.MetadataOperation.SET) {
        // Check if this is a new key for gas optimization
        bool isNewKey = !_channelMetadataKeyExists(channelId, op.key);

        channelMetadataForId[op.key] = op.value;

        // Only add to keys array if it's a new key
        if (isNewKey) {
          channelMetadataKeysForId.push(op.key);
        }

        emit ChannelMetadataSet(channelId, op.key, op.value);
      }
    }
  }

  /// @notice Internal function to delete a specific channel metadata key
  /// @param channelId The unique identifier of the channel
  /// @param keyToDelete The key to delete
  function _deleteChannelMetadataKey(
    uint256 channelId,
    bytes32 keyToDelete
  ) internal {
    // Delete the value
    delete channelMetadata[channelId][keyToDelete];

    // Remove from keys array
    bytes32[] storage keys = channelMetadataKeys[channelId];
    for (uint i = 0; i < keys.length; i++) {
      if (keys[i] == keyToDelete) {
        // Move last element to current position and pop
        keys[i] = keys[keys.length - 1];
        keys.pop();
        break;
      }
    }
  }

  /// @notice Internal function to check if a channel metadata key exists
  /// @param channelId The unique identifier of the channel
  /// @param targetKey The key to check for existence
  /// @return exists Whether the key exists in the metadata
  function _channelMetadataKeyExists(
    uint256 channelId,
    bytes32 targetKey
  ) internal view returns (bool) {
    bytes32[] storage keys = channelMetadataKeys[channelId];
    for (uint i = 0; i < keys.length; i++) {
      if (keys[i] == targetKey) {
        return true;
      }
    }
    return false;
  }

  /// @inheritdoc IChannelManager
  function getChannelMetadata(
    uint256 channelId
  ) public view returns (Metadata.MetadataEntry[] memory) {
    bytes32[] memory keys = channelMetadataKeys[channelId];
    Metadata.MetadataEntry[] memory metadata = new Metadata.MetadataEntry[](
      keys.length
    );

    for (uint i = 0; i < keys.length; i++) {
      metadata[i] = Metadata.MetadataEntry({
        key: keys[i],
        value: channelMetadata[channelId][keys[i]]
      });
    }

    return metadata;
  }

  /// @inheritdoc IChannelManager
  function getChannelMetadataValue(
    uint256 channelId,
    bytes32 key
  ) external view returns (bytes memory) {
    return channelMetadata[channelId][key];
  }

  /// @inheritdoc IChannelManager
  function getChannelMetadataKeys(
    uint256 channelId
  ) external view returns (bytes32[] memory) {
    return channelMetadataKeys[channelId];
  }
}

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

/// @notice Simple single owner authorization mixin.
/// @author Solady (https://github.com/vectorized/solady/blob/main/src/auth/Ownable.sol)
///
/// @dev Note:
/// This implementation does NOT auto-initialize the owner to `msg.sender`.
/// You MUST call the `_initializeOwner` in the constructor / initializer.
///
/// While the ownable portion follows
/// [EIP-173](https://eips.ethereum.org/EIPS/eip-173) for compatibility,
/// the nomenclature for the 2-step ownership handover may be unique to this codebase.
abstract contract Ownable {
    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                       CUSTOM ERRORS                        */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev The caller is not authorized to call the function.
    error Unauthorized();

    /// @dev The `newOwner` cannot be the zero address.
    error NewOwnerIsZeroAddress();

    /// @dev The `pendingOwner` does not have a valid handover request.
    error NoHandoverRequest();

    /// @dev Cannot double-initialize.
    error AlreadyInitialized();

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                           EVENTS                           */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev The ownership is transferred from `oldOwner` to `newOwner`.
    /// This event is intentionally kept the same as OpenZeppelin's Ownable to be
    /// compatible with indexers and [EIP-173](https://eips.ethereum.org/EIPS/eip-173),
    /// despite it not being as lightweight as a single argument event.
    event OwnershipTransferred(address indexed oldOwner, address indexed newOwner);

    /// @dev An ownership handover to `pendingOwner` has been requested.
    event OwnershipHandoverRequested(address indexed pendingOwner);

    /// @dev The ownership handover to `pendingOwner` has been canceled.
    event OwnershipHandoverCanceled(address indexed pendingOwner);

    /// @dev `keccak256(bytes("OwnershipTransferred(address,address)"))`.
    uint256 private constant _OWNERSHIP_TRANSFERRED_EVENT_SIGNATURE =
        0x8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0;

    /// @dev `keccak256(bytes("OwnershipHandoverRequested(address)"))`.
    uint256 private constant _OWNERSHIP_HANDOVER_REQUESTED_EVENT_SIGNATURE =
        0xdbf36a107da19e49527a7176a1babf963b4b0ff8cde35ee35d6cd8f1f9ac7e1d;

    /// @dev `keccak256(bytes("OwnershipHandoverCanceled(address)"))`.
    uint256 private constant _OWNERSHIP_HANDOVER_CANCELED_EVENT_SIGNATURE =
        0xfa7b8eab7da67f412cc9575ed43464468f9bfbae89d1675917346ca6d8fe3c92;

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                          STORAGE                           */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev The owner slot is given by:
    /// `bytes32(~uint256(uint32(bytes4(keccak256("_OWNER_SLOT_NOT")))))`.
    /// It is intentionally chosen to be a high value
    /// to avoid collision with lower slots.
    /// The choice of manual storage layout is to enable compatibility
    /// with both regular and upgradeable contracts.
    bytes32 internal constant _OWNER_SLOT =
        0xffffffffffffffffffffffffffffffffffffffffffffffffffffffff74873927;

    /// The ownership handover slot of `newOwner` is given by:
    /// ```
    ///     mstore(0x00, or(shl(96, user), _HANDOVER_SLOT_SEED))
    ///     let handoverSlot := keccak256(0x00, 0x20)
    /// ```
    /// It stores the expiry timestamp of the two-step ownership handover.
    uint256 private constant _HANDOVER_SLOT_SEED = 0x389a75e1;

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                     INTERNAL FUNCTIONS                     */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Override to return true to make `_initializeOwner` prevent double-initialization.
    function _guardInitializeOwner() internal pure virtual returns (bool guard) {}

    /// @dev Initializes the owner directly without authorization guard.
    /// This function must be called upon initialization,
    /// regardless of whether the contract is upgradeable or not.
    /// This is to enable generalization to both regular and upgradeable contracts,
    /// and to save gas in case the initial owner is not the caller.
    /// For performance reasons, this function will not check if there
    /// is an existing owner.
    function _initializeOwner(address newOwner) internal virtual {
        if (_guardInitializeOwner()) {
            /// @solidity memory-safe-assembly
            assembly {
                let ownerSlot := _OWNER_SLOT
                if sload(ownerSlot) {
                    mstore(0x00, 0x0dc149f0) // `AlreadyInitialized()`.
                    revert(0x1c, 0x04)
                }
                // Clean the upper 96 bits.
                newOwner := shr(96, shl(96, newOwner))
                // Store the new value.
                sstore(ownerSlot, or(newOwner, shl(255, iszero(newOwner))))
                // Emit the {OwnershipTransferred} event.
                log3(0, 0, _OWNERSHIP_TRANSFERRED_EVENT_SIGNATURE, 0, newOwner)
            }
        } else {
            /// @solidity memory-safe-assembly
            assembly {
                // Clean the upper 96 bits.
                newOwner := shr(96, shl(96, newOwner))
                // Store the new value.
                sstore(_OWNER_SLOT, newOwner)
                // Emit the {OwnershipTransferred} event.
                log3(0, 0, _OWNERSHIP_TRANSFERRED_EVENT_SIGNATURE, 0, newOwner)
            }
        }
    }

    /// @dev Sets the owner directly without authorization guard.
    function _setOwner(address newOwner) internal virtual {
        if (_guardInitializeOwner()) {
            /// @solidity memory-safe-assembly
            assembly {
                let ownerSlot := _OWNER_SLOT
                // Clean the upper 96 bits.
                newOwner := shr(96, shl(96, newOwner))
                // Emit the {OwnershipTransferred} event.
                log3(0, 0, _OWNERSHIP_TRANSFERRED_EVENT_SIGNATURE, sload(ownerSlot), newOwner)
                // Store the new value.
                sstore(ownerSlot, or(newOwner, shl(255, iszero(newOwner))))
            }
        } else {
            /// @solidity memory-safe-assembly
            assembly {
                let ownerSlot := _OWNER_SLOT
                // Clean the upper 96 bits.
                newOwner := shr(96, shl(96, newOwner))
                // Emit the {OwnershipTransferred} event.
                log3(0, 0, _OWNERSHIP_TRANSFERRED_EVENT_SIGNATURE, sload(ownerSlot), newOwner)
                // Store the new value.
                sstore(ownerSlot, newOwner)
            }
        }
    }

    /// @dev Throws if the sender is not the owner.
    function _checkOwner() internal view virtual {
        /// @solidity memory-safe-assembly
        assembly {
            // If the caller is not the stored owner, revert.
            if iszero(eq(caller(), sload(_OWNER_SLOT))) {
                mstore(0x00, 0x82b42900) // `Unauthorized()`.
                revert(0x1c, 0x04)
            }
        }
    }

    /// @dev Returns how long a two-step ownership handover is valid for in seconds.
    /// Override to return a different value if needed.
    /// Made internal to conserve bytecode. Wrap it in a public function if needed.
    function _ownershipHandoverValidFor() internal view virtual returns (uint64) {
        return 48 * 3600;
    }

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                  PUBLIC UPDATE FUNCTIONS                   */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Allows the owner to transfer the ownership to `newOwner`.
    function transferOwnership(address newOwner) public payable virtual onlyOwner {
        /// @solidity memory-safe-assembly
        assembly {
            if iszero(shl(96, newOwner)) {
                mstore(0x00, 0x7448fbae) // `NewOwnerIsZeroAddress()`.
                revert(0x1c, 0x04)
            }
        }
        _setOwner(newOwner);
    }

    /// @dev Allows the owner to renounce their ownership.
    function renounceOwnership() public payable virtual onlyOwner {
        _setOwner(address(0));
    }

    /// @dev Request a two-step ownership handover to the caller.
    /// The request will automatically expire in 48 hours (172800 seconds) by default.
    function requestOwnershipHandover() public payable virtual {
        unchecked {
            uint256 expires = block.timestamp + _ownershipHandoverValidFor();
            /// @solidity memory-safe-assembly
            assembly {
                // Compute and set the handover slot to `expires`.
                mstore(0x0c, _HANDOVER_SLOT_SEED)
                mstore(0x00, caller())
                sstore(keccak256(0x0c, 0x20), expires)
                // Emit the {OwnershipHandoverRequested} event.
                log2(0, 0, _OWNERSHIP_HANDOVER_REQUESTED_EVENT_SIGNATURE, caller())
            }
        }
    }

    /// @dev Cancels the two-step ownership handover to the caller, if any.
    function cancelOwnershipHandover() public payable virtual {
        /// @solidity memory-safe-assembly
        assembly {
            // Compute and set the handover slot to 0.
            mstore(0x0c, _HANDOVER_SLOT_SEED)
            mstore(0x00, caller())
            sstore(keccak256(0x0c, 0x20), 0)
            // Emit the {OwnershipHandoverCanceled} event.
            log2(0, 0, _OWNERSHIP_HANDOVER_CANCELED_EVENT_SIGNATURE, caller())
        }
    }

    /// @dev Allows the owner to complete the two-step ownership handover to `pendingOwner`.
    /// Reverts if there is no existing ownership handover requested by `pendingOwner`.
    function completeOwnershipHandover(address pendingOwner) public payable virtual onlyOwner {
        /// @solidity memory-safe-assembly
        assembly {
            // Compute and set the handover slot to 0.
            mstore(0x0c, _HANDOVER_SLOT_SEED)
            mstore(0x00, pendingOwner)
            let handoverSlot := keccak256(0x0c, 0x20)
            // If the handover does not exist, or has expired.
            if gt(timestamp(), sload(handoverSlot)) {
                mstore(0x00, 0x6f5e8818) // `NoHandoverRequest()`.
                revert(0x1c, 0x04)
            }
            // Set the handover slot to 0.
            sstore(handoverSlot, 0)
        }
        _setOwner(pendingOwner);
    }

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                   PUBLIC READ FUNCTIONS                    */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Returns the owner of the contract.
    function owner() public view virtual returns (address result) {
        /// @solidity memory-safe-assembly
        assembly {
            result := sload(_OWNER_SLOT)
        }
    }

    /// @dev Returns the expiry timestamp for the two-step ownership handover to `pendingOwner`.
    function ownershipHandoverExpiresAt(address pendingOwner)
        public
        view
        virtual
        returns (uint256 result)
    {
        /// @solidity memory-safe-assembly
        assembly {
            // Compute the handover slot.
            mstore(0x0c, _HANDOVER_SLOT_SEED)
            mstore(0x00, pendingOwner)
            // Load the handover slot.
            result := sload(keccak256(0x0c, 0x20))
        }
    }

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                         MODIFIERS                          */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Marks a function as only callable by the owner.
    modifier onlyOwner() virtual {
        _checkOwner();
        _;
    }
}

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

pragma solidity ^0.8.20;

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

/**
 * @dev This implements an optional extension of {ERC721} defined in the ERC that adds enumerability
 * of all the token ids in the contract as well as all token ids owned by each account.
 *
 * CAUTION: {ERC721} extensions that implement custom `balanceOf` logic, such as {ERC721Consecutive},
 * interfere with enumerability and should not be used together with {ERC721Enumerable}.
 */
abstract contract ERC721Enumerable is ERC721, IERC721Enumerable {
    mapping(address owner => mapping(uint256 index => uint256)) private _ownedTokens;
    mapping(uint256 tokenId => uint256) private _ownedTokensIndex;

    uint256[] private _allTokens;
    mapping(uint256 tokenId => uint256) private _allTokensIndex;

    /**
     * @dev An `owner`'s token query was out of bounds for `index`.
     *
     * NOTE: The owner being `address(0)` indicates a global out of bounds index.
     */
    error ERC721OutOfBoundsIndex(address owner, uint256 index);

    /**
     * @dev Batch mint is not allowed.
     */
    error ERC721EnumerableForbiddenBatchMint();

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

    /**
     * @dev See {IERC721Enumerable-tokenOfOwnerByIndex}.
     */
    function tokenOfOwnerByIndex(address owner, uint256 index) public view virtual returns (uint256) {
        if (index >= balanceOf(owner)) {
            revert ERC721OutOfBoundsIndex(owner, index);
        }
        return _ownedTokens[owner][index];
    }

    /**
     * @dev See {IERC721Enumerable-totalSupply}.
     */
    function totalSupply() public view virtual returns (uint256) {
        return _allTokens.length;
    }

    /**
     * @dev See {IERC721Enumerable-tokenByIndex}.
     */
    function tokenByIndex(uint256 index) public view virtual returns (uint256) {
        if (index >= totalSupply()) {
            revert ERC721OutOfBoundsIndex(address(0), index);
        }
        return _allTokens[index];
    }

    /**
     * @dev See {ERC721-_update}.
     */
    function _update(address to, uint256 tokenId, address auth) internal virtual override returns (address) {
        address previousOwner = super._update(to, tokenId, auth);

        if (previousOwner == address(0)) {
            _addTokenToAllTokensEnumeration(tokenId);
        } else if (previousOwner != to) {
            _removeTokenFromOwnerEnumeration(previousOwner, tokenId);
        }
        if (to == address(0)) {
            _removeTokenFromAllTokensEnumeration(tokenId);
        } else if (previousOwner != to) {
            _addTokenToOwnerEnumeration(to, tokenId);
        }

        return previousOwner;
    }

    /**
     * @dev Private function to add a token to this extension's ownership-tracking data structures.
     * @param to address representing the new owner of the given token ID
     * @param tokenId uint256 ID of the token to be added to the tokens list of the given address
     */
    function _addTokenToOwnerEnumeration(address to, uint256 tokenId) private {
        uint256 length = balanceOf(to) - 1;
        _ownedTokens[to][length] = tokenId;
        _ownedTokensIndex[tokenId] = length;
    }

    /**
     * @dev Private function to add a token to this extension's token tracking data structures.
     * @param tokenId uint256 ID of the token to be added to the tokens list
     */
    function _addTokenToAllTokensEnumeration(uint256 tokenId) private {
        _allTokensIndex[tokenId] = _allTokens.length;
        _allTokens.push(tokenId);
    }

    /**
     * @dev Private function to remove a token from this extension's ownership-tracking data structures. Note that
     * while the token is not assigned a new owner, the `_ownedTokensIndex` mapping is _not_ updated: this allows for
     * gas optimizations e.g. when performing a transfer operation (avoiding double writes).
     * This has O(1) time complexity, but alters the order of the _ownedTokens array.
     * @param from address representing the previous owner of the given token ID
     * @param tokenId uint256 ID of the token to be removed from the tokens list of the given address
     */
    function _removeTokenFromOwnerEnumeration(address from, uint256 tokenId) private {
        // To prevent a gap in from's tokens array, we store the last token in the index of the token to delete, and
        // then delete the last slot (swap and pop).

        uint256 lastTokenIndex = balanceOf(from);
        uint256 tokenIndex = _ownedTokensIndex[tokenId];

        mapping(uint256 index => uint256) storage _ownedTokensByOwner = _ownedTokens[from];

        // When the token to delete is the last token, the swap operation is unnecessary
        if (tokenIndex != lastTokenIndex) {
            uint256 lastTokenId = _ownedTokensByOwner[lastTokenIndex];

            _ownedTokensByOwner[tokenIndex] = lastTokenId; // Move the last token to the slot of the to-delete token
            _ownedTokensIndex[lastTokenId] = tokenIndex; // Update the moved token's index
        }

        // This also deletes the contents at the last position of the array
        delete _ownedTokensIndex[tokenId];
        delete _ownedTokensByOwner[lastTokenIndex];
    }

    /**
     * @dev Private function to remove a token from this extension's token tracking data structures.
     * This has O(1) time complexity, but alters the order of the _allTokens array.
     * @param tokenId uint256 ID of the token to be removed from the tokens list
     */
    function _removeTokenFromAllTokensEnumeration(uint256 tokenId) private {
        // To prevent a gap in the tokens array, we store the last token in the index of the token to delete, and
        // then delete the last slot (swap and pop).

        uint256 lastTokenIndex = _allTokens.length - 1;
        uint256 tokenIndex = _allTokensIndex[tokenId];

        // When the token to delete is the last token, the swap operation is unnecessary. However, since this occurs so
        // rarely (when the last minted token is burnt) that we still do the swap here to avoid the gas cost of adding
        // an 'if' statement (like in _removeTokenFromOwnerEnumeration)
        uint256 lastTokenId = _allTokens[lastTokenIndex];

        _allTokens[tokenIndex] = lastTokenId; // Move the last token to the slot of the to-delete token
        _allTokensIndex[lastTokenId] = tokenIndex; // Update the moved token's index

        // This also deletes the contents at the last position of the array
        delete _allTokensIndex[tokenId];
        _allTokens.pop();
    }

    /**
     * See {ERC721-_increaseBalance}. We need that to account tokens that were minted in batch
     */
    function _increaseBalance(address account, uint128 amount) internal virtual override {
        if (amount > 0) {
            revert ERC721EnumerableForbiddenBatchMint();
        }
        super._increaseBalance(account, amount);
    }
}

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

import "@openzeppelin/contracts/token/ERC721/extensions/IERC721Enumerable.sol";
import "../types/Channels.sol";
import "../types/Metadata.sol";
import "./IHook.sol";
import "./IProtocolFees.sol";

/// @title IChannelManager - Interface for managing comment channels and their hooks
/// @notice This interface defines the core functionality for managing channels and their associated hooks
interface IChannelManager is IProtocolFees, IERC721Enumerable {
  /// @notice Error thrown when channel does not exist
  error ChannelDoesNotExist();
  /// @notice Error thrown when hook does not implement required interface
  error InvalidHookInterface();
  /// @notice Error thrown when channel already exists
  error ChannelAlreadyExists();
  /// @notice Error thrown when base URI is invalid
  error InvalidBaseURI();
  /// @notice Error thrown when address is zero
  error ZeroAddress();
  /// @notice Error thrown when unauthorized caller tries to access function
  error UnauthorizedCaller();
  /// @notice Error thrown when metadata key is empty
  error InvalidKey();
  /// @notice Error thrown when channel name is empty
  error EmptyChannelName();
  /// @notice Error thrown when hook is already set
  error HookAlreadySet();

  /// @notice Emitted when the base URI for NFT metadata is updated
  /// @param baseURI The new base URI
  event BaseURIUpdated(string baseURI);

  /// @notice Emitted when a new channel is created
  /// @param channelId The unique identifier of the channel
  /// @param name The name of the channel
  /// @param metadata The channel metadata entries
  event ChannelCreated(
    uint256 indexed channelId,
    string name,
    string description,
    Metadata.MetadataEntry[] metadata,
    address hook,
    address owner
  );

  /// @notice Emitted when a channel's configuration is updated
  /// @param channelId The unique identifier of the channel
  /// @param name The new name of the channel
  /// @param description The new description of the channel
  /// @param metadata The new metadata entries
  event ChannelUpdated(
    uint256 indexed channelId,
    string name,
    string description,
    Metadata.MetadataEntry[] metadata
  );

  /// @notice Emitted when a hook is set for a channel
  /// @param channelId The unique identifier of the channel
  /// @param hook The address of the hook contract
  event HookSet(uint256 indexed channelId, address indexed hook);

  /// @notice Emitted when a hook's enabled status is updated
  /// @param channelId The unique identifier of the channel
  /// @param hook The address of the hook contract
  /// @param enabled Whether the hook is enabled
  event HookStatusUpdated(
    uint256 indexed channelId,
    address indexed hook,
    bool enabled
  );

  /// @notice Emitted when channel metadata is set
  /// @param channelId The unique identifier of the channel
  /// @param key The metadata key
  /// @param value The metadata value
  event ChannelMetadataSet(
    uint256 indexed channelId,
    bytes32 indexed key,
    bytes value
  );

  /// @notice Creates a new channel
  /// @param name The name of the channel
  /// @param description The description of the channel
  /// @param metadata The channel metadata entries
  /// @param hook Address of the hook to add to the channel
  /// @return channelId The unique identifier of the created channel
  function createChannel(
    string calldata name,
    string calldata description,
    Metadata.MetadataEntry[] calldata metadata,
    address hook
  ) external payable returns (uint256 channelId);

  /// @notice Get a channel by its ID
  /// @param channelId The ID of the channel to get
  /// @return The channel configuration
  function getChannel(
    uint256 channelId
  ) external view returns (Channels.Channel memory);

  /// @notice Updates an existing channel's configuration
  /// @param channelId The unique identifier of the channel
  /// @param name The new name of the channel
  /// @param description The new description of the channel
  /// @param metadataOperations The new metadata entries as operations
  function updateChannel(
    uint256 channelId,
    string calldata name,
    string calldata description,
    Metadata.MetadataEntryOp[] calldata metadataOperations
  ) external;

  /// @notice Sets the hook for a channel
  /// @param channelId The unique identifier of the channel
  /// @param hook The address of the hook contract
  function setHook(uint256 channelId, address hook) external;

  /// @notice Sets the base URI for NFT metadata
  /// @param baseURI_ The new base URI
  function setBaseURI(string calldata baseURI_) external;

  /// @notice Checks if a channel exists
  /// @param channelId Unique identifier of the channel
  /// @return exists Whether the channel exists
  function channelExists(uint256 channelId) external view returns (bool);

  /// @notice Get all metadata for a channel
  /// @param channelId The unique identifier of the channel
  /// @return The metadata entries for the channel
  function getChannelMetadata(
    uint256 channelId
  ) external view returns (Metadata.MetadataEntry[] memory);

  /// @notice Get metadata value for a specific key
  /// @param channelId The unique identifier of the channel
  /// @param key The metadata key
  /// @return The metadata value
  function getChannelMetadataValue(
    uint256 channelId,
    bytes32 key
  ) external view returns (bytes memory);

  /// @notice Get all metadata keys for a channel
  /// @param channelId The unique identifier of the channel
  /// @return The metadata keys for the channel
  function getChannelMetadataKeys(
    uint256 channelId
  ) external view returns (bytes32[] memory);
}

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

/// @title IProtocolFees - Interface for managing protocol fees
/// @notice This interface defines functions for managing various protocol fees
interface IProtocolFees {
  /// @notice Error thrown when fee percentage is invalid (>100%)
  error InvalidFee();
  /// @notice Error thrown when insufficient fee is provided
  error InsufficientFee();

  /// @notice Emitted when channel creation fee is updated
  /// @param newFee The new fee amount in wei
  event ChannelCreationFeeUpdated(uint96 newFee);

  /// @notice Emitted when comment creation fee is updated
  /// @param newFee The new fee amount in wei
  event CommentCreationFeeUpdated(uint96 newFee);

  /// @notice Emitted when hook transaction fee percentage is updated
  /// @param newBasisPoints The new fee basis points (1 basis points = 0.01%)
  event HookTransactionFeeUpdated(uint16 newBasisPoints);

  /// @notice Emitted when fees are withdrawn
  /// @param recipient The address receiving the fees
  /// @param amount The amount withdrawn
  event FeesWithdrawn(address indexed recipient, uint256 amount);

  /// @notice Sets the fee for creating a new channel
  /// @param fee The fee amount in wei
  function setChannelCreationFee(uint96 fee) external;

  /// @notice Gets the current channel creation fee
  /// @return fee The current fee in wei
  function getChannelCreationFee() external view returns (uint96 fee);

  /// @notice Sets the fee for creating a new comment
  /// @param fee The fee amount in wei
  function setCommentCreationFee(uint96 fee) external;

  /// @notice Gets the current comment creation fee
  /// @return fee The current fee in wei
  function getCommentCreationFee() external view returns (uint96 fee);

  /// @notice Sets the fee percentage taken from hook transactions
  /// @param feeBasisPoints The fee percentage in basis points (1 basis point = 0.01%)
  function setHookTransactionFee(uint16 feeBasisPoints) external;

  /// @notice Gets the current hook transaction fee percentage
  /// @return feeBasisPoints The current fee percentage in basis points (1 basis points = 0.01%)
  function getHookTransactionFee()
    external
    view
    returns (uint16 feeBasisPoints);

  /// @notice Withdraws accumulated fees to a specified address
  /// @param recipient The address to receive the fees
  /// @return amount The amount withdrawn
  function withdrawFees(address recipient) external returns (uint256 amount);

  /// @notice Collects the protocol fee for comment creation
  /// @return The amount of fees collected
  function collectCommentCreationFee() external payable returns (uint96);

  /// @notice Calculates the hook transaction fee by deducting the protocol fee
  /// @param value The total value sent with the transaction
  /// @return hookValue The amount that should be passed to the hook
  function deductProtocolHookTransactionFee(
    uint256 value
  ) external view returns (uint256 hookValue);

  /// @notice Calculates the required input value to achieve a desired output after protocol fee deduction
  /// @param postFeeAmountForwardedToHook The desired amount to receive after fee deduction
  /// @return The required input value to send
  function calculateMsgValueWithHookFee(
    uint256 postFeeAmountForwardedToHook
  ) external view returns (uint256);
}

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

import "solady/src/auth/Ownable.sol";
import "solady/src/utils/ReentrancyGuard.sol";
import "./interfaces/IProtocolFees.sol";
import "./interfaces/IChannelManager.sol";

/// @title ProtocolFees - Abstract contract for managing protocol fees
/// @notice This contract handles all fee-related functionality including channel creation, hook registration, and transaction fees
/// @dev Implements fee management with the following features:
/// 1. Fee Configuration:
///    - Channel creation fee
///    - Hook registration fee
///    - Hook transaction fee percentage
/// 2. Fee Collection:
///    - Accumulates fees from various operations
///    - Allows withdrawal of accumulated fees
/// 3. Fee Updates:
///    - Only owner can update fee amounts
///    - Fee percentage capped at 100%
abstract contract ProtocolFees is IProtocolFees, ReentrancyGuard, Ownable {
  // Fee configuration
  uint96 internal channelCreationFee;
  uint96 internal commentCreationFee;
  uint16 internal hookTransactionFeeBasisPoints; // (1 basis point = 0.01%)

  /// @notice Constructor sets the initial owner
  /// @param initialOwner The address that will own the contract
  constructor(address initialOwner) {
    if (initialOwner == address(0)) revert IChannelManager.ZeroAddress();

    _initializeOwner(initialOwner);

    // Initialize fees with safe defaults
    // Initialize channel creation fees to reduce initial spammy channels
    channelCreationFee = 0.02 ether;
    // Make a future implementation of comment creation fees at subcent levels to be enabled, in the case of hooks monetizing via ERC20s that bypass hookTransactionFeeBasisPoints
    commentCreationFee = 0;
    // 2% fee on hook ETH revenue
    hookTransactionFeeBasisPoints = 200;
  }

  /// @inheritdoc IProtocolFees
  function setChannelCreationFee(uint96 fee) external onlyOwner {
    channelCreationFee = fee;
    emit IProtocolFees.ChannelCreationFeeUpdated(fee);
  }

  /// @inheritdoc IProtocolFees
  function setCommentCreationFee(uint96 fee) external onlyOwner {
    commentCreationFee = fee;
    emit IProtocolFees.CommentCreationFeeUpdated(fee);
  }

  /// @inheritdoc IProtocolFees
  function setHookTransactionFee(uint16 feeBasisPoints) external onlyOwner {
    if (feeBasisPoints > 10000) revert InvalidFee(); // Max 100%
    hookTransactionFeeBasisPoints = feeBasisPoints;
    emit IProtocolFees.HookTransactionFeeUpdated(feeBasisPoints);
  }

  /// @inheritdoc IProtocolFees
  function getChannelCreationFee() external view returns (uint96) {
    return channelCreationFee;
  }

  /// @inheritdoc IProtocolFees
  function getCommentCreationFee() external view returns (uint96) {
    return commentCreationFee;
  }

  /// @inheritdoc IProtocolFees
  function getHookTransactionFee() external view returns (uint16) {
    return hookTransactionFeeBasisPoints;
  }

  /// @inheritdoc IProtocolFees
  function withdrawFees(
    address recipient
  ) external onlyOwner nonReentrant returns (uint256 amount) {
    if (recipient == address(0)) revert IChannelManager.ZeroAddress();

    amount = address(this).balance;

    (bool success, ) = recipient.call{ value: amount }("");
    require(success, "Fee withdrawal failed");

    emit IProtocolFees.FeesWithdrawn(recipient, amount);
    return amount;
  }

  /// @notice Collects the protocol fee for channel creation
  /// @return The amount of fees collected
  function _collectChannelCreationFee() internal returns (uint96) {
    return _collectFeeWithRefund(channelCreationFee);
  }

  /// @inheritdoc IProtocolFees
  function collectCommentCreationFee() external payable returns (uint96) {
    return _collectFeeWithRefund(commentCreationFee);
  }

  /// @notice Internal function to guard against insufficient fee with refund of excess
  /// @param requiredFee The fee amount required for the operation
  /// @return The amount of fees collected
  function _collectFeeWithRefund(
    uint96 requiredFee
  ) internal virtual returns (uint96) {
    if (msg.value < requiredFee) revert InsufficientFee();

    if (msg.value > requiredFee) {
      // Refund excess payment using transfer for safety
      payable(msg.sender).transfer(msg.value - requiredFee);
    }

    return requiredFee;
  }

  /// @inheritdoc IProtocolFees
  function deductProtocolHookTransactionFee(
    uint256 value
  ) external view returns (uint256 hookValue) {
    // Cache storage variable
    uint16 fee = hookTransactionFeeBasisPoints;
    if (value <= 0 || fee <= 0) {
      return value;
    }
    uint256 protocolFee = (value * fee) / 10000;
    return value - protocolFee;
  }

  /// @inheritdoc IProtocolFees
  function calculateMsgValueWithHookFee(
    uint256 postFeeAmountForwardedToHook
  ) external view returns (uint256) {
    if (hookTransactionFeeBasisPoints == 0) return postFeeAmountForwardedToHook;
    // invalid fee basis points
    if (hookTransactionFeeBasisPoints >= 10000) return 0;

    // Formula: postFeeAmountForwardedToHook = input - (input * feeBasisPoints / 10000)
    // Solving for input: input = postFeeAmountForwardedToHook / (1 - feeBasisPoints/10000)
    return
      (postFeeAmountForwardedToHook * 10000) /
      (10000 - hookTransactionFeeBasisPoints);
  }

  /// @notice Allows the contract to receive ETH
  receive() external payable {}
}

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

import "./Metadata.sol";

/// @title Comments - Type definitions for comment-related structs and enums
library Comments {
  /// @notice Comment type constants
  /// @dev Type 0: Standard comment
  /// @dev Type 1: Reaction (with reaction type in content field, e.g. "like", "dislike", "heart")
  /// more types can be added in the future, please check the docs for more information.
  uint8 public constant COMMENT_TYPE_COMMENT = 0;
  uint8 public constant COMMENT_TYPE_REACTION = 1;

  /// @notice Author Authentication method used to create the comment
  /// @dev DIRECT_TX: User signed transaction directly (msg.sender == author).
  /// @dev APP_APPROVAL: User has pre-approved the app that signed the comment (approvals[author][app] == true)
  /// @dev AUTHOR_SIGNATURE: User signed the comment hash, the app submitted the comment on their behalf (gas-sponsored)
  enum AuthorAuthMethod {
    DIRECT_TX, // 0
    APP_APPROVAL, // 1
    AUTHOR_SIGNATURE // 2
  }

  /// @notice Struct containing all comment data
  /// @param author The address of the comment author
  /// @param createdAt The timestamp when the comment was created
  /// @param app The address of the application signer that authorized this comment
  /// @param updatedAt The timestamp when the comment was last updated
  /// @param commentType The type of the comment (0=comment, 1=reaction)
  /// @param authMethod The authentication method used to create this comment
  /// @param channelId The channel ID associated with the comment
  /// @param parentId The ID of the parent comment if this is a reply, otherwise bytes32(0)
  /// @param content The text content of the comment - may contain urls, images and mentions
  /// @param targetUri the URI about which the comment is being made
  struct Comment {
    // Pack these fields together (saves 1 storage slot)
    address author; // 20 bytes   --┬-- 32 bytes
    uint88 createdAt; // 11 bytes --┘
    AuthorAuthMethod authMethod; // 1 byte --┘
    address app; // 20 bytes      --┬-- 32 bytes
    uint88 updatedAt; // 11 bytes --┘
    uint8 commentType; // 1 byte --┘
    // 32-byte types
    uint256 channelId;
    bytes32 parentId;
    // Dynamic types last (conventional pattern)
    string content;
    string targetUri;
  }

  /// @notice Struct containing all comment data for creating a comment
  /// @param author The address of the comment author
  /// @param app The address of the application signer that authorized this comment
  /// @param channelId The channel ID associated with the comment
  /// @param deadline Timestamp after which the signatures for this comment become invalid
  /// @param parentId The ID of the parent comment if this is a reply, otherwise bytes32(0)
  /// @param content The actual text content of the comment. If the commentType is COMMENT_TYPE_REACTION, the content should be the reaction type, such as "like", "downvote", "repost" etc.
  /// @param metadata Array of key-value pairs for additional data
  /// @param targetUri the URI about which the comment is being made
  /// @param commentType The type of the comment (0=comment, 1=reaction)
  struct CreateComment {
    address author;
    address app;
    uint256 channelId;
    uint256 deadline;
    bytes32 parentId;
    uint8 commentType;
    // Dynamic types last (conventional pattern)
    string content;
    Metadata.MetadataEntry[] metadata;
    string targetUri;
  }

  /// @notice Struct containing all comment data for editing a comment
  /// @param app The address of the application signer that authorized this comment
  /// @param nonce The nonce for the comment
  /// @param deadline Timestamp after which the signatures for this comment become invalid
  /// @param content The actual text content of the comment
  /// @param metadata Array of key-value pairs for additional data
  struct EditComment {
    address app;
    uint256 nonce;
    uint256 deadline;
    string content;
    Metadata.MetadataEntry[] metadata;
  }

  // Batch operation structures

  /// @notice Enum for different operation types in batch calls
  enum BatchOperationType {
    POST_COMMENT, // 0
    POST_COMMENT_WITH_SIG, // 1
    EDIT_COMMENT, // 2
    EDIT_COMMENT_WITH_SIG, // 3
    DELETE_COMMENT, // 4
    DELETE_COMMENT_WITH_SIG // 5
  }

  /// @notice Struct for batch delete operation data
  /// @param commentId The unique identifier of the comment to delete
  /// @param app The address of the app signer (only for deleteCommentWithSig)
  /// @param deadline Timestamp after which the signature becomes invalid (only for deleteCommentWithSig)
  struct BatchDeleteData {
    bytes32 commentId;
    address app;
    uint256 deadline;
  }

  /// @notice Struct containing a single batch operation
  /// @param operationType The type of operation to perform
  /// @param value The amount of ETH to send with this operation
  /// @param data Encoded operation-specific data
  /// @param signatures Array of signatures required for this operation
  struct BatchOperation {
    BatchOperationType operationType;
    uint256 value;
    bytes data;
    bytes[] signatures;
  }
}

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

import "./Metadata.sol";
import "./Hooks.sol";

/// @title Channels - Type definitions for channel-related structs
library Channels {
  /// @notice Struct containing channel configuration
  /// @param name The name of the channel
  /// @param description The description of the channel
  /// @param hook The hook of the channel. Hook must implement IHook interface.
  /// @param permissions The hook permissions of the channel
  struct Channel {
    string name;
    string description;
    address hook;
    Hooks.Permissions permissions;
  }
}

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

/// @title Metadata - Type definitions for metadata-related structs and enums
library Metadata {
  /// @notice Struct containing metadata key-value pair
  /// @param key UTF-8 encoded string of format "type key". Must fit in 32 bytes.
  /// @param value The metadata value as bytes
  struct MetadataEntry {
    bytes32 key;
    bytes value;
  }

  /// @notice Enum for metadata operations in hook updates
  enum MetadataOperation {
    SET, // Set or update the metadata value
    DELETE // Delete the metadata key
  }

  /// @notice Struct for hook metadata operations with explicit operation type
  /// @param operation The operation to perform (SET or DELETE)
  /// @param key The metadata key
  /// @param value The metadata value (ignored for DELETE operations)
  struct MetadataEntryOp {
    MetadataOperation operation;
    bytes32 key;
    bytes value;
  }
}

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

import "@openzeppelin/contracts/utils/introspection/IERC165.sol";
import "../types/Hooks.sol";
import "../types/Comments.sol";
import "../types/Channels.sol";
import "../types/Metadata.sol";

interface IHook is IERC165 {
  function getHookPermissions()
    external
    pure
    returns (Hooks.Permissions memory);

  /// @notice Execute after a hook is initialized on a channel
  /// @param channelManager The address of the channel the hook was added to
  /// @param channelData The channel data that was used to initialize the hook
  /// @param channelId The unique identifier of the channel that was initialized
  /// @param metadata The metadata entries for the channel that was initialized
  /// @return success Whether the hook initialization was successful
  function onInitialize(
    address channelManager,
    Channels.Channel memory channelData,
    uint256 channelId,
    Metadata.MetadataEntry[] calldata metadata
  ) external returns (bool success);

  /// @notice Execute after a comment is processed
  /// @param commentData The comment data that was processed
  /// @param metadata The metadata entries for the comment
  /// @param msgSender The original msg.sender that initiated the transaction
  /// @param commentId The unique identifier of the processed comment
  /// @return hookMetadata The hook metadata entries that were generated
  function onCommentAdd(
    Comments.Comment calldata commentData,
    Metadata.MetadataEntry[] calldata metadata,
    address msgSender,
    bytes32 commentId
  ) external payable returns (Metadata.MetadataEntry[] memory hookMetadata);

  /// @notice Execute after a comment is deleted
  /// @param commentData The comment data that was deleted
  /// @param metadata The metadata entries for the comment
  /// @param hookMetadata The hook metadata entries for the comment
  /// @param msgSender The original msg.sender that initiated the transaction
  /// @param commentId The unique identifier of the deleted comment
  /// @return success Whether the hook execution was successful
  function onCommentDelete(
    Comments.Comment calldata commentData,
    Metadata.MetadataEntry[] calldata metadata,
    Metadata.MetadataEntry[] calldata hookMetadata,
    address msgSender,
    bytes32 commentId
  ) external returns (bool success);

  /// @notice Execute after a comment is edited
  /// @param commentData The comment data that was edited
  /// @param metadata The metadata entries for the comment
  /// @param msgSender The original msg.sender that initiated the transaction
  /// @param commentId The unique identifier of the edited comment
  /// @return hookMetadata The hook metadata entries that were generated
  function onCommentEdit(
    Comments.Comment calldata commentData,
    Metadata.MetadataEntry[] calldata metadata,
    address msgSender,
    bytes32 commentId
  ) external payable returns (Metadata.MetadataEntry[] memory hookMetadata);

  /// @notice Execute after a channel is updated
  /// @param channel The address of the channel that was updated
  /// @param channelId The unique identifier of the channel that was updated
  /// @param channelData The data of the channel that was updated
  /// @return success Whether the channel update was successful
  function onChannelUpdate(
    address channel,
    uint256 channelId,
    Channels.Channel calldata channelData,
    Metadata.MetadataEntry[] calldata metadata
  ) external returns (bool success);

  /// @notice Execute to update hook data for an existing comment
  /// @param commentData The comment data to update
  /// @param metadata The current metadata entries for the comment
  /// @param hookMetadata The current hook metadata entries for the comment
  /// @param msgSender The original msg.sender that initiated the transaction
  /// @param commentId The unique identifier of the comment to update
  /// @return operations The explicit metadata operations to perform (SET or DELETE)
  function onCommentHookDataUpdate(
    Comments.Comment calldata commentData,
    Metadata.MetadataEntry[] calldata metadata,
    Metadata.MetadataEntry[] calldata hookMetadata,
    address msgSender,
    bytes32 commentId
  ) external returns (Metadata.MetadataEntryOp[] memory operations);
}

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

// 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.3.0) (utils/Strings.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

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

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            assembly ("memory-safe") {
                ptr := add(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-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

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

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

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

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

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

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

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

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        return value;
    }

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

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

        return string(output);
    }

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

/**
 * @title ERC-721 Non-Fungible Token Standard, optional enumeration extension
 * @dev See https://eips.ethereum.org/EIPS/eip-721
 */
interface IERC721Enumerable is IERC721 {
    /**
     * @dev Returns the total amount of tokens stored by the contract.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns a token ID owned by `owner` at a given `index` of its token list.
     * Use along with {balanceOf} to enumerate all of ``owner``'s tokens.
     */
    function tokenOfOwnerByIndex(address owner, uint256 index) external view returns (uint256);

    /**
     * @dev Returns a token ID at a given `index` of all the tokens stored by the contract.
     * Use along with {totalSupply} to enumerate all tokens.
     */
    function tokenByIndex(uint256 index) external view returns (uint256);
}

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

/// @notice Reentrancy guard mixin.
/// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/ReentrancyGuard.sol)
abstract contract ReentrancyGuard {
    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                       CUSTOM ERRORS                        */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Unauthorized reentrant call.
    error Reentrancy();

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                          STORAGE                           */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Equivalent to: `uint72(bytes9(keccak256("_REENTRANCY_GUARD_SLOT")))`.
    /// 9 bytes is large enough to avoid collisions with lower slots,
    /// but not too large to result in excessive bytecode bloat.
    uint256 private constant _REENTRANCY_GUARD_SLOT = 0x929eee149b4bd21268;

    /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/
    /*                      REENTRANCY GUARD                      */
    /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/

    /// @dev Guards a function from reentrancy.
    modifier nonReentrant() virtual {
        /// @solidity memory-safe-assembly
        assembly {
            if eq(sload(_REENTRANCY_GUARD_SLOT), address()) {
                mstore(0x00, 0xab143c06) // `Reentrancy()`.
                revert(0x1c, 0x04)
            }
            sstore(_REENTRANCY_GUARD_SLOT, address())
        }
        _;
        /// @solidity memory-safe-assembly
        assembly {
            sstore(_REENTRANCY_GUARD_SLOT, codesize())
        }
    }

    /// @dev Guards a view function from read-only reentrancy.
    modifier nonReadReentrant() virtual {
        /// @solidity memory-safe-assembly
        assembly {
            if eq(sload(_REENTRANCY_GUARD_SLOT), address()) {
                mstore(0x00, 0xab143c06) // `Reentrancy()`.
                revert(0x1c, 0x04)
            }
        }
        _;
    }
}

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

/**
 * @title Hooks
 * @notice Type definitions for hook-related structs
 */
library Hooks {
  /**
   * @notice Struct defining which hook functions are enabled
   * @dev Each boolean indicates whether the corresponding hook function is enabled
   */
  struct Permissions {
    bool onInitialize;
    bool onCommentAdd;
    bool onCommentDelete;
    bool onCommentEdit;
    bool onChannelUpdate;
    bool onCommentHookDataUpdate;
  }
}

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

pragma solidity ^0.8.20;

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

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

pragma solidity ^0.8.20;

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// 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)
        }
    }
}

{
  "remappings": [
    "@account-abstraction/contracts/=node_modules/@account-abstraction/contracts/",
    "@openzeppelin/contracts/=node_modules/@openzeppelin/contracts/",
    "forge-std/=node_modules/forge-std/src/",
    "solady/=node_modules/solady/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "ipfs",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "cancun",
  "viaIR": true,
  "libraries": {}
}

[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AlreadyInitialized","type":"error"},{"inputs":[],"name":"ChannelAlreadyExists","type":"error"},{"inputs":[],"name":"ChannelDoesNotExist","type":"error"},{"inputs":[],"name":"ERC721EnumerableForbiddenBatchMint","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"ERC721OutOfBoundsIndex","type":"error"},{"inputs":[],"name":"EmptyChannelName","type":"error"},{"inputs":[],"name":"HookAlreadySet","type":"error"},{"inputs":[],"name":"InsufficientFee","type":"error"},{"inputs":[],"name":"InvalidBaseURI","type":"error"},{"inputs":[],"name":"InvalidFee","type":"error"},{"inputs":[],"name":"InvalidHookInterface","type":"error"},{"inputs":[],"name":"InvalidKey","type":"error"},{"inputs":[],"name":"NewOwnerIsZeroAddress","type":"error"},{"inputs":[],"name":"NoHandoverRequest","type":"error"},{"inputs":[],"name":"Reentrancy","type":"error"},{"inputs":[],"name":"Unauthorized","type":"error"},{"inputs":[],"name":"UnauthorizedCaller","type":"error"},{"inputs":[],"name":"ZeroAddress","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":false,"internalType":"string","name":"baseURI","type":"string"}],"name":"BaseURIUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"channelId","type":"uint256"},{"indexed":false,"internalType":"string","name":"name","type":"string"},{"indexed":false,"internalType":"string","name":"description","type":"string"},{"components":[{"internalType":"bytes32","name":"key","type":"bytes32"},{"internalType":"bytes","name":"value","type":"bytes"}],"indexed":false,"internalType":"struct Metadata.MetadataEntry[]","name":"metadata","type":"tuple[]"},{"indexed":false,"internalType":"address","name":"hook","type":"address"},{"indexed":false,"internalType":"address","name":"owner","type":"address"}],"name":"ChannelCreated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint96","name":"newFee","type":"uint96"}],"name":"ChannelCreationFeeUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"channelId","type":"uint256"},{"indexed":true,"internalType":"bytes32","name":"key","type":"bytes32"},{"indexed":false,"internalType":"bytes","name":"value","type":"bytes"}],"name":"ChannelMetadataSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"channelId","type":"uint256"},{"indexed":false,"internalType":"string","name":"name","type":"string"},{"indexed":false,"internalType":"string","name":"description","type":"string"},{"components":[{"internalType":"bytes32","name":"key","type":"bytes32"},{"internalType":"bytes","name":"value","type":"bytes"}],"indexed":false,"internalType":"struct Metadata.MetadataEntry[]","name":"metadata","type":"tuple[]"}],"name":"ChannelUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint96","name":"newFee","type":"uint96"}],"name":"CommentCreationFeeUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"recipient","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"FeesWithdrawn","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"channelId","type":"uint256"},{"indexed":true,"internalType":"address","name":"hook","type":"address"}],"name":"HookSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"channelId","type":"uint256"},{"indexed":true,"internalType":"address","name":"hook","type":"address"},{"indexed":false,"internalType":"bool","name":"enabled","type":"bool"}],"name":"HookStatusUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint16","name":"newBasisPoints","type":"uint16"}],"name":"HookTransactionFeeUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"pendingOwner","type":"address"}],"name":"OwnershipHandoverCanceled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"pendingOwner","type":"address"}],"name":"OwnershipHandoverRequested","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"oldOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","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":[{"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":"postFeeAmountForwardedToHook","type":"uint256"}],"name":"calculateMsgValueWithHookFee","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"cancelOwnershipHandover","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"channelId","type":"uint256"}],"name":"channelExists","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"channelMetadata","outputs":[{"internalType":"bytes","name":"","type":"bytes"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"channelMetadataKeys","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"collectCommentCreationFee","outputs":[{"internalType":"uint96","name":"","type":"uint96"}],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"address","name":"pendingOwner","type":"address"}],"name":"completeOwnershipHandover","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"description","type":"string"},{"components":[{"internalType":"bytes32","name":"key","type":"bytes32"},{"internalType":"bytes","name":"value","type":"bytes"}],"internalType":"struct Metadata.MetadataEntry[]","name":"metadata","type":"tuple[]"},{"internalType":"address","name":"hook","type":"address"}],"name":"createChannel","outputs":[{"internalType":"uint256","name":"channelId","type":"uint256"}],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"value","type":"uint256"}],"name":"deductProtocolHookTransactionFee","outputs":[{"internalType":"uint256","name":"hookValue","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"channelId","type":"uint256"}],"name":"getChannel","outputs":[{"components":[{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"description","type":"string"},{"internalType":"address","name":"hook","type":"address"},{"components":[{"internalType":"bool","name":"onInitialize","type":"bool"},{"internalType":"bool","name":"onCommentAdd","type":"bool"},{"internalType":"bool","name":"onCommentDelete","type":"bool"},{"internalType":"bool","name":"onCommentEdit","type":"bool"},{"internalType":"bool","name":"onChannelUpdate","type":"bool"},{"internalType":"bool","name":"onCommentHookDataUpdate","type":"bool"}],"internalType":"struct Hooks.Permissions","name":"permissions","type":"tuple"}],"internalType":"struct Channels.Channel","name":"","type":"tuple"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getChannelCreationFee","outputs":[{"internalType":"uint96","name":"","type":"uint96"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"channelId","type":"uint256"}],"name":"getChannelMetadata","outputs":[{"components":[{"internalType":"bytes32","name":"key","type":"bytes32"},{"internalType":"bytes","name":"value","type":"bytes"}],"internalType":"struct Metadata.MetadataEntry[]","name":"","type":"tuple[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"channelId","type":"uint256"}],"name":"getChannelMetadataKeys","outputs":[{"internalType":"bytes32[]","name":"","type":"bytes32[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"channelId","type":"uint256"},{"internalType":"bytes32","name":"key","type":"bytes32"}],"name":"getChannelMetadataValue","outputs":[{"internalType":"bytes","name":"","type":"bytes"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCommentCreationFee","outputs":[{"internalType":"uint96","name":"","type":"uint96"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getHookTransactionFee","outputs":[{"internalType":"uint16","name":"","type":"uint16"}],"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":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"result","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"pendingOwner","type":"address"}],"name":"ownershipHandoverExpiresAt","outputs":[{"internalType":"uint256","name":"result","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"requestOwnershipHandover","outputs":[],"stateMutability":"payable","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":"string","name":"baseURI_","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint96","name":"fee","type":"uint96"}],"name":"setChannelCreationFee","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint96","name":"fee","type":"uint96"}],"name":"setCommentCreationFee","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"channelId","type":"uint256"},{"internalType":"address","name":"hook","type":"address"}],"name":"setHook","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint16","name":"feeBasisPoints","type":"uint16"}],"name":"setHookTransactionFee","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":"index","type":"uint256"}],"name":"tokenByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"tokenOfOwnerByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"channelId","type":"uint256"},{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"description","type":"string"},{"components":[{"internalType":"enum Metadata.MetadataOperation","name":"operation","type":"uint8"},{"internalType":"bytes32","name":"key","type":"bytes32"},{"internalType":"bytes","name":"value","type":"bytes"}],"internalType":"struct Metadata.MetadataEntryOp[]","name":"metadataOperations","type":"tuple[]"}],"name":"updateChannel","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"recipient","type":"address"}],"name":"withdrawFees","outputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

6080806040523461051957602081614438803803809161001f82856107c7565b83398101031261051957516001600160a01b0381168082036105195760409081519261004b83856107c7565b600b84526a1150d40810da185b9b995b60aa1b602085015282519361007084866107c7565b60048552634543504360e01b60208601528051906001600160401b03821161049357819061009e5f546107ea565b601f811161077a575b50602090601f8311600114610717575f9261070c575b50508160011b915f199060031b1c1916175f555b83516001600160401b038111610493576100ec6001546107ea565b601f81116106b3575b50602094601f8211600114610650579481929394955f92610645575b50508160011b915f199060031b1c1916176001555b81156106365781638b78c6d81955815f7f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08180a3600680546001600160d01b03191678c80000000000000000000000000000000000470de4df820000179055825160209161019483836107c7565b5f80835280805260028452859020546001600160a01b0316801580159190869083610607575b5f82815260038852898120805460010190558080526002885289812080546001600160a01b0319168417905582847fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8380a4156105975750600954905f8052600a865281885f2055680100000000000000008210156104935760018201600955600954821015610583575f87926009825287822001555b03610537575b6105245782903b6103f5575b50505f8052600c8152825f209161027a83546107ea565b601f81116103d6575b50600863486f6d6560e01b0183556001830180546102a0906107ea565b601f81116103b7575b507f416e79206b696e64206f6620636f6e74656e740000000000000000000000002681558451926102da81856107c7565b5f845261030f60018060a01b036002870154169261030288519760a0895260a0890190610838565b9087820384890152610838565b90858203878701528451908183528083019281808460051b8301019701935f915b8a858410610379575f7f87fdbcd771cc4dafcc71f8a8b72bd28aea7a4dc930eeb01383da4cfacecf03998c808d8d8d606084015260808301520390a251613b29908161090f8239f35b93806103a7889b60019495969783809a9b601f19898503018a525180518452015191818582015201906108b9565b9a01930193019194939290610330565b6103d090825f52601f855f20910160051c810190610822565b5f6102a9565b6103ef90845f52601f845f20910160051c810190610822565b5f610283565b61042c91855180938192630a85bd0160e11b83523360048401525f60248401525f60448401526080606484015260848301906108b9565b03815f875af15f91816104e0575b506104af5750823d156104a7573d6001600160401b0381116104935790519061046c601f8201601f19168401836107c7565b81523d5f8383013e5b805191826104905783633250574960e11b5f5260045260245ffd5b01fd5b634e487b7160e01b5f52604160045260245ffd5b506060610475565b6001600160e01b03191663757a42ff60e11b016104cd575f81610263565b50633250574960e11b5f5260045260245ffd5b9091508281813d831161051d575b6104f881836107c7565b8101031261051957516001600160e01b03198116810361051957905f61043a565b5f80fd5b503d6104ee565b6339e3563760e11b5f525f60045260245ffd5b610540826108dd565b5f19810190811161056f57855f5260078552865f20815f5285525f878120555f805260088552865f2055610257565b634e487b7160e01b5f52601160045260245ffd5b634e487b7160e01b5f52603260045260245ffd5b90808214610251576105a8816108dd565b5f805260088752885f205490825f5260078852895f20918181036105e2575b505f8052600888525f8a8120555f5286525f88812055610251565b815f528289528a5f2054815f52838a52808c5f20555f52600889528a5f20555f6105c7565b5f8080526004885289812080546001600160a01b03191690558381526003885289902080545f190190556101ba565b63d92e233d60e01b5f5260045ffd5b015190505f80610111565b601f1982169560015f52805f20915f5b88811061069b57508360019596979810610683575b505050811b01600155610126565b01515f1960f88460031b161c191690555f8080610675565b91926020600181928685015181550194019201610660565b60015f526106fc907fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6601f840160051c81019160208510610702575b601f0160051c0190610822565b5f6100f5565b90915081906106ef565b015190505f806100bd565b5f8080528281209350601f198516905b818110610762575090846001959493921061074a575b505050811b015f556100d1565b01515f1960f88460031b161c191690555f808061073d565b92936020600181928786015181550195019301610727565b5f80526107c1907f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563601f850160051c8101916020861061070257601f0160051c0190610822565b5f6100a7565b601f909101601f19168101906001600160401b0382119082101761049357604052565b90600182811c92168015610818575b602083101461080457565b634e487b7160e01b5f52602260045260245ffd5b91607f16916107f9565b81811061082d575050565b5f8155600101610822565b5f9291815491610847836107ea565b808352926001811690811561089c575060011461086357505050565b5f9081526020812093945091925b838310610882575060209250010190565b600181602092949394548385870101520191019190610871565b915050602093945060ff929192191683830152151560051b010190565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b6001600160a01b031680156108fb575f52600360205260405f205490565b6322718ad960e21b5f525f60045260245ffdfe60e080604052600436101561001c575b50361561001a575f80fd5b005b5f3560e01c9081630125096414612e7f5750806301ffc9a714612df757806306fdde0314612d55578063081812fc14612d19578063095ea7b314612c2f57806310df54a014612a5a578063164e68de1461296857806318160ddd1461294b5780631fa368ad1461218457806320279bed1461215b57806323b872dd1461214457806325692962146120fb5780632b33f75a146120d55780632c4c518e146120b15780632f745c591461203f57806342842e0e146120105780634f55099c146112385780634f6ccce7146111f957806354d1f13d146111b557806355f804b314610fbe5780636352211e14610f8e57806370a0823114610f6b578063715018a614610f225780637e60e35214610eed578063807b989a14610eba5780638da5cb5b14610e8e578063900e633714610ad757806395d89b4114610a0d578063a22cb46514610969578063a55a8b46146108fd578063a9f25876146108b7578063b1237c8614610899578063b842ba7a14610859578063b88d4fde146107ff578063c083405714610771578063c13aceb71461074b578063c87b56dd14610490578063d34736ee14610401578063e985e9c5146103aa578063f04e283e1461035d578063f132f56a146102b7578063f2fde38b1461027c578063f6ca7614146102425763fee81cf41461020c575f61000f565b3461023e57602036600319011261023e57610225612eee565b63389a75e1600c525f52602080600c2054604051908152f35b5f80fd5b3461023e57602036600319011261023e576004355f908152600260209081526040909120546001600160a01b031615156040519015158152f35b602036600319011261023e57610290612eee565b6102986138a6565b8060601b156102aa5761001a9061390a565b637448fbae5f526004601cfd5b3461023e57602036600319011261023e576004355f52600e60205260405f20604051806020835491828152019081935f5260205f20905f5b8181106103475750505081610305910382613165565b604051918291602083019060208452518091526040830191905f5b81811061032e575050500390f35b8251845285945060209384019390920191600101610320565b82548452602090930192600192830192016102ef565b602036600319011261023e57610371612eee565b6103796138a6565b63389a75e1600c52805f526020600c20908154421161039d575f61001a925561390a565b636f5e88185f526004601cfd5b3461023e57604036600319011261023e576103c3612eee565b6103cb612f04565b9060018060a01b03165f52600560205260405f209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b3461023e57602036600319011261023e576004356001600160601b0381169081810361023e577f59ca0bfd8d8a79d1fdf44988b2113eeab493697c134d480e5dba7169117d26c2916020916104546138a6565b600680546bffffffffffffffffffffffff60601b191660609290921b6bffffffffffffffffffffffff60601b16919091179055604051908152a1005b3461023e57602036600319011261023e576004356104ad81613872565b50604051600b5490915f836104c18461305b565b9182825260208201946001811690815f1461072f57506001146106d0575b6104eb92500384613165565b8251156106b4578092815f9272184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b81101561068e575b50806d04ee2d6d415b85acef8100000000600a921015610673575b662386f26fc1000081101561065f575b6305f5e10081101561064e575b61271081101561063f575b6064811015610631575b1015610627575b6001820193600a602161059561057f88613186565b9761058d604051998a613165565b808952613186565b602088019590601f19013687378701015b5f1901916f181899199a1a9b1b9c1cb0b131b232b360811b8282061a8353049081156105d457600a906105a6565b5050602061060f92610623956040519586945180918587015e840190838201905f8252519283915e01015f815203601f198101835282613165565b604051918291602083526020830190612eca565b0390f35b906001019061056a565b606460029104930192610563565b61271060049104930192610559565b6305f5e1006008910493019261054e565b662386f26fc1000060109104930192610541565b6d04ee2d6d415b85acef810000000060209104930192610531565b6040935072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b90049050600a610516565b5050506106236040516106c8602082613165565b5f815261060f565b50600b5f90815290917f0175b7a638427703f0dbe7bb9bbf987a2551717b34e79f33b5b1008d1fa01db95b8183106107135750509060206104eb928201016104df565b6020919350806001915483858a010152019101909185926106fb565b60ff19168652506104eb92151560051b820160200190506104df565b3461023e57602036600319011261023e57602061076960043561382f565b604051908152f35b3461023e57602036600319011261023e5760043561ffff81169081810361023e5761079a6138a6565b61271082116107f0576006805461ffff60c01b191660c09290921b61ffff60c01b169190911790556040519081527faf01cfd9851d193cafb5496118d544ff7b59d828f99ec2a66d8d37981f52454290602090a1005b6358d620b360e01b5f5260045ffd5b3461023e57608036600319011261023e57610818612eee565b610820612f04565b90604435606435926001600160401b03841161023e5761084761001a9436906004016131d7565b926108538383836133a9565b3361399b565b3461023e5761086736612eb4565b905f52600d60205260405f20905f5260205261062361089261060f60405f2060405192838092613093565b0382613165565b3461023e57602036600319011261023e5760206107696004356137b9565b3461023e57604036600319011261023e576024356004355f52600e60205260405f20805482101561023e576020916108ee91613046565b90549060031b1c604051908152f35b3461023e57602036600319011261023e576004356001600160601b03811680910361023e5760207fccfe364e1732c45824ed762219be91b4528122920beab818cb699009a4fe53ed9161094e6138a6565b806001600160601b03196006541617600655604051908152a1005b3461023e57604036600319011261023e57610982612eee565b602435908115159081830361023e576001600160a01b03169182156109fa576109cc90335f52600560205260405f20845f5260205260405f209060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b82630b61174360e31b5f5260045260245ffd5b3461023e575f36600319011261023e576040515f600154610a2d8161305b565b8084529060018116908115610ab35750600114610a55575b6106238361060f81850382613165565b60015f9081527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b808210610a995750909150810160200161060f610a45565b919260018160209254838588010152019101909291610a81565b60ff191660208086019190915291151560051b8401909101915061060f9050610a45565b3461023e57604036600319011261023e57600435610af3612f04565b5f828152600260205260409020546001600160a01b031615610e7f57610b1882613872565b336001600160a01b0390911603610e70575f828152600c60205260409020600201546001600160a01b0391821691168114610e61573068929eee149b4bd212685414610e54573068929eee149b4bd212685560405181837f21b0a09b8bf795bec0bf5f51bed97694c5e71ef5a81f33e3c20cac32b4558d8d5f80a381837f3e931422de6d757d4fc9efd866870398275ac459ef7ff0cdd425d1e58012eb50602083151594858152a315610e2b576040516301ffc9a760e01b8152631695e67f60e11b6004820152602081602481855afa5f9181610def575b50610c0457638f23dad360e01b5f5260045ffd5b15610de05760405163627419e760e11b815260c081600481855afa908115610da6575f91610db1575b505f838152600c602052604090206002810180546001600160a01b0319168417905581516003909101805460ff191691151560ff81169290921781559091602081015115159064ff00000000835463ff00000062ff00006040850151151560101b16916060850151151560181b9265ff000000000060a06080880151151560201b970151151560281b169665ff0000000000199261ff0087199260081b169063ffffff00191617161716911617911617179055610cf6575b50505b3868929eee149b4bd2126855005b602090825f52600c825260405f2090610d415f610d128661368b565b93610d58604051978896879586946320e3df8960e11b865230600487015260806024870152608486019061331b565b916044850152600319848303016064850152612fb1565b03925af18015610da657610d6d575b80610ce5565b6020813d602011610d9e575b81610d8660209383613165565b8101031261023e57610d9790613294565b5080610d67565b3d9150610d79565b6040513d5f823e3d90fd5b610dd3915060c03d60c011610dd9575b610dcb8183613165565b8101906132a1565b83610c2d565b503d610dc1565b638f23dad360e01b5f5260045ffd5b9091506020813d602011610e23575b81610e0b60209383613165565b8101031261023e57610e1c90613294565b9084610bf0565b3d9150610dfe565b505f908152600c602052604081206002810180546001600160a01b031916905560030155610ce8565b63ab143c065f526004601cfd5b635f7c8ab560e11b5f5260045ffd5b635c427cd960e01b5f5260045ffd5b636ddd9da960e01b5f5260045ffd5b3461023e575f36600319011261023e57638b78c6d819546040516001600160a01b039091168152602090f35b3461023e57602036600319011261023e57610623610ed960043561368b565b604051918291602083526020830190612fb1565b5f36600319011261023e576020610f116001600160601b0360065460601c16613947565b6001600160601b0360405191168152f35b5f36600319011261023e57610f356138a6565b5f638b78c6d819547f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a35f638b78c6d81955005b3461023e57602036600319011261023e576020610769610f89612eee565b613646565b3461023e57602036600319011261023e576020610fac600435613872565b6040516001600160a01b039091168152f35b3461023e57602036600319011261023e576004356001600160401b03811161023e57610fee903690600401612f1a565b90610ff76138a6565b81156111a6576001600160401b03821161119257611016600b5461305b565b601f8111611139575b505f91601f81116001146110995761106e81807f6741b2fc379fad678116fe3d4d4b9a1a184ab53ba36b86ad0fa66340b1ab41ad955f9161108e575b508160011b915f199060031b1c19161790565b600b555b611089604051928392602084526020840191613274565b0390a1005b90508401358661105b565b601f19811692600b5f527f0175b7a638427703f0dbe7bb9bbf987a2551717b34e79f33b5b1008d1fa01db9905f5b8581106111215750827f6741b2fc379fad678116fe3d4d4b9a1a184ab53ba36b86ad0fa66340b1ab41ad9510611108575b5050600181811b01600b55611072565b8301355f19600384901b60f8161c1916905583806110f8565b909160206001819285880135815501930191016110c7565b600b5f52611182907f0175b7a638427703f0dbe7bb9bbf987a2551717b34e79f33b5b1008d1fa01db9601f850160051c81019160208610611188575b601f0160051c0190613224565b8261101f565b9091508190611175565b634e487b7160e01b5f52604160045260245ffd5b63cc52148360e01b5f5260045ffd5b5f36600319011261023e5763389a75e1600c52335f525f6020600c2055337ffa7b8eab7da67f412cc9575ed43464468f9bfbae89d1675917346ca6d8fe3c925f80a2005b3461023e57602036600319011261023e57600435600954811015611222576108ee60209161301a565b63295f44f760e21b5f525f60045260245260445ffd5b608036600319011261023e576004356001600160401b03811161023e57611263903690600401612f1a565b906024356001600160401b03811161023e57611283903690600401612f1a565b926044356001600160401b03811161023e576112a3903690600401612f47565b6064356080819052919290916001600160a01b038116900361023e578015612001576112d03682876131a1565b936112dc3688836131a1565b966112e68461362f565b956112f46040519788613165565b848752602087018560051b870136811161023e5787915b818310611fa0575050506020815191012097602081519101209686519861134a6113348b61362f565b9a6113426040519c8d613165565b808c5261362f565b60208b019990601f1901368b375f5b89518110156113e257808c6113db828d60206113838361137b60019985613677565b515193613677565b510151602081519101206040519060208201927fac744b2be3b7f8d6f7d637db76586a27ab36aba301ab536c7226a6a344ab514f845260408301526060820152606081526113d2608082613165565b51902092613677565b5201611359565b506040518b516020820191908c90829084905f5b818110611f87575050611412925003601f198101835282613165565b5190206040519160208301933360601b85526034840152605483015260748201524260948201524660b482015260b4815261144e60d482613165565b51902060a08190525f908152600260205260409020546001600160a01b0316611f78576114856001600160601b0360065416613947565b50602060c08190526040519061149b9082613165565b5f81523315611f655760a0515f90815260c0516002905260409020546001600160a01b031680158015919082611f29575b335f81815260c080516003905260408083208054600101905560a080518452915160029052822080546001600160a01b0319168417905551919084907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef9080a415611ea15760095460a0515f52600a60c051528060405f2055600160401b8110156111925761156481600161157f930160095561301a565b60a0929192519083549060031b91821b915f19901b19161790565b90555b338103611e48575b50611e3557333b611d46575b5060a0515f52600c60c0515260405f206001600160401b038511611192576115c8856115c2835461305b565b8361323a565b5f9085601f8111600114611cdc57806115f7916001945f91611cd157508160011b915f199060031b1c19161790565b81555b016001600160401b03831161119257611617836115c2835461305b565b5f83601f8111600114611c6c5780611642925f91611c6157508160011b915f199060031b1c19161790565b90555b60a0515f52600d60c0515260405f2060a0515f52600e60c0515260405f205f5b878110611b01575050509061168a61169993926040519560a0875260a0870191613274565b9184830360c051860152613274565b91818303604083015280835260c05183019260c0518260051b82010193855f92603e1982360301905b858510611a7f57608080516001600160a01b03166060890152339088015260a0517f87fdbcd771cc4dafcc71f8a8b72bd28aea7a4dc930eeb01383da4cfacecf0399888a0389a26080516001600160a01b031615158061172b575b60405160a051815260c05190f35b3068929eee149b4bd212685414610e54573068929eee149b4bd212685560405160018060a01b036080511660a0517f21b0a09b8bf795bec0bf5f51bed97694c5e71ef5a81f33e3c20cac32b4558d8d5f80a381815260018060a01b0360805116907f3e931422de6d757d4fc9efd866870398275ac459ef7ff0cdd425d1e58012eb5060a0519160c05190a315611a44576040516301ffc9a760e01b8152631695e67f60e11b600482015260c051608051829060249082906001600160a01b03165afa5f9181611a06575b5061180957638f23dad360e01b5f5260045ffd5b15610de05760405163627419e760e11b815260805160c090829060049082906001600160a01b03165afa908115610da6575f916119e7575b5060a0515f52600c60c05152600260405f200160018060a01b03608051166001600160601b0360a01b82541617905560a0515f52600c60c05152600360405f2001815115159161189d83839060ff801983541691151516179055565b60c05181810151835460408401516060850151608086015160a09096015195151590941b64ff000000001693151560181b63ff0000001665ffffffffff001990921692151560081b61ff00169290921791151560101b62ff00001691909117171790151560281b65ff000000000016179055611926575b3868929eee149b4bd21268558061171d565b60a0515f52600c60c0515261198d60405f2061197061194660a05161368b565b9160405193849283926320e3df8960e11b845230600485015260806024850152608484019061331b565b60a051604484015282810360031901606484015260c05194612fb1565b03815f60018060a01b03608051165af18015610da6576119ae575b50611914565b60c0513d81116119e0575b6119c38183613165565b8160c051918101031261023e576119d990613294565b50806119a8565b503d6119b9565b611a00915060c03d60c011610dd957610dcb8183613165565b81611841565b90915060c0513d60c05111611a3d575b611a208183613165565b8160c051918101031261023e57611a3690613294565b90826117f5565b503d611a16565b60a0515f52600c60c05152600260405f20016001600160601b0360a01b815416905560a0515f52600c60c051525f6003604082200155611914565b909192939496601f1982820301855288358381121561023e5784018035825260c051810135601e198236030181121561023e57019081359160c051016001600160401b03831161023e57823603811361023e576001926040611ae9938160c0518201520191613274565b9860c051019460c051019501939796949291906116c2565b611b0c81898b6138e8565b35611b18828a8c6138e8565b60c05181013590601e198136030182121561023e57018035906001600160401b03821161023e5760c05101813603811361023e57611b579136916131a1565b8115611c5257815f528460c0515260405f20908051906001600160401b03821161119257611b8f82611b89855461305b565b8561323a565b60c05190601f8311600114611be257826001969593611bd19593611bc8935f92611bd7575b50508160011b915f199060031b1c19161790565b90555b846138c2565b01611665565b015190505f80611bb4565b90835f5260c0515f20915f5b601f1985168110611c39575092611bd19492600197969492889383601f19811610611c21575b505050811b019055611bcb565b01515f1960f88460031b161c191690558f8080611c14565b81830151845560c0516001909401939283019201611bee565b630eda9c3d60e31b5f5260045ffd5b90508601358a61105b565b50601f19841690825f528460c0515f20925f5b818110611cb5575010611c9c575b5050600183811b019055611645565b8501355f19600386901b60f8161c191690558780611c8d565b88840135855560c0516001909501949384019388935001611c7f565b90508501358b61105b565b505f81815260c0518120909287601f1981165b808610611d27576001955010611d0e575b50508186811b0181556115fa565b8401355f19600389901b60f8161c191690558880611d00565b86830135845560c0519586019560019094019390920191899150611cef565b60405190630a85bd0160e11b82523360048301525f602483015260a0516044830152608060648301528180611d8260c051936084830190612eca565b03815f335af15f9181611dee575b50611dbe57611d9d6131f5565b80519081611db857633250574960e11b5f523360045260245ffd5b60c05101fd5b6001600160e01b03191663757a42ff60e11b01611ddb5786611596565b633250574960e11b5f523360045260245ffd5b90915060c0513d60c05111611e2e575b611e088183613165565b8160c051918101031261023e57516001600160e01b03198116810361023e579088611d90565b503d611dfe565b6339e3563760e11b5f525f60045260245ffd5b611e5133613646565b5f198101908111611e8d57335f52600760c0515260405f20815f5260c0515260a05160405f205560a0515f52600860c0515260405f205561158a565b634e487b7160e01b5f52601160045260245ffd5b33811461158257611eb181613646565b60a0515f52600860c0515260405f205490825f52600760c0515260405f2091818103611efb575b5060a0515f52600860c051525f60408120555f5260c051525f6040812055611582565b815f528260c0515260405f2054815f528360c051528060405f20555f52600860c0515260405f20558b611ed8565b611f4c60a0515f52600460205260405f206001600160601b0360a01b8154169055565b815f52600360c0515260405f205f1981540190556114cc565b633250574960e11b5f525f60045260245ffd5b630ec0f14960e01b5f5260045ffd5b84518352602094850194869450909201916001016113f6565b82356001600160401b03811161023e57890160408136031261023e5760405191611fc98361314a565b813583526020820135926001600160401b03841161023e57611ff26020949385943691016131d7565b8382015281520192019161130b565b63a082172760e01b5f5260045ffd5b3461023e5761001a61202136612f77565b9060405192612031602085613165565b5f84526108538383836133a9565b3461023e57604036600319011261023e57612058612eee565b6024359061206581613646565b8210156120945760018060a01b03165f52600760205260405f20905f52602052602060405f2054604051908152f35b63295f44f760e21b5f5260018060a01b031660045260245260445ffd5b3461023e575f36600319011261023e57602061ffff60065460c01c16604051908152f35b3461023e575f36600319011261023e5760206001600160601b0360065416604051908152f35b5f36600319011261023e5763389a75e1600c52335f526202a30042016020600c2055337fdbf36a107da19e49527a7176a1babf963b4b0ff8cde35ee35d6cd8f1f9ac7e1d5f80a2005b3461023e5761001a61215536612f77565b916133a9565b3461023e575f36600319011261023e5760206001600160601b0360065460601c16604051908152f35b3461023e57608036600319011261023e576024356001600160401b03811161023e576121b4903690600401612f1a565b906044356001600160401b03811161023e576121d4903690600401612f1a565b926064356001600160401b03811161023e576121f4903690600401612f47565b9390918015612001576004355f908152600260205260409020546001600160a01b031615610e7f57612227600435613872565b336001600160a01b0390911603610e70576004355f52600c60205260405f20906001600160401b0381116111925761226981612263845461305b565b8461323a565b5f81601f81116001146128e85780612294925f916128dd57508160011b915f199060031b1c19161790565b82555b600182016001600160401b038811611192576122b7886115c2835461305b565b5f88601f811160011461287a57806122e2925f9161286f57508160011b915f199060031b1c19161790565b90555b6004355f908152600260205260409020546001600160a01b031615610e7f57336001600160a01b03612318600435613872565b1603610e7057928690866004355f52600d60205260405f206004355f52600e60205260405f20925f965b83881015612708578760051b820135605e198336030181121561023e5782019660608836031261023e5760405197606089018981106001600160401b03821117611192576040528035600281101561023e578952602081013560208a01526040810135906001600160401b03821161023e576123c0913691016131d7565b6040890152602088015115611c5257875160028110156126f457600103612582576020880151996004355f52600d60205260405f208b5f5260205260405f20612409815461305b565b908161253f575b50506004355f52600e60205260405f209b5f5b8d5480821015612527578d8f8361243991613046565b90549060031b1c1461244e5750600101612423565b9091969b93989d9499959a92979c505f198101908111611e8d5761248661247861249c9287613046565b90549060031b1c9286613046565b819391549060031b91821b915f19901b19161790565b90558254908115612513576001936020925f1901906124bb8282613046565b8154905f199060031b1b19169055555b0151604051602081525f60208201527f175fcc19dbc24c7654912639c5d54032dff6aa5d1d5538d53cf7ffa820ebba31604060043592a35b0196919893959094979297612342565b634e487b7160e01b5f52603160045260245ffd5b5050949991969b5094995060206001929793986124cb565b81601f5f93116001146125565750555b8c80612410565b8183526020832061257291601f0160051c810190600101613224565b808252816020812091555561254f565b9499929790959196809994995160028110156126f457156125a7575b50600190612503565b6125b76020820151600435613aaa565b15604082015160208301515f528a60205260405f20908051906001600160401b038211611192576125ec82611b89855461305b565b602090601f831160011461268957918061262192600198979695945f92611bd75750508160011b915f199060031b1c19161790565b90555b612676575b604060208201519101517f175fcc19dbc24c7654912639c5d54032dff6aa5d1d5538d53cf7ffa820ebba31604051602081528061266d600435946020830190612eca565b0390a39061259e565b61268460208201518d6138c2565b612629565b90835f52805f20915f5b601f19851681106126dc575091839160019897969594938994601f198116106126c4575b505050811b019055612624565b01515f1960f88460031b161c191690555f80806126b7565b91926020600181928685015181550194019201612693565b634e487b7160e01b5f52602160045260245ffd5b86897fcca018f97928a2be0da57b6757662e5cda180293f30a8dfcf0e05b1fcbf2473761275f8d8a61275161273e60043561368b565b9760405196606088526060880191613274565b918583036020870152613274565b918083036040820152806127766004359487612fb1565b0390a260028101546001600160a01b0316918261278f57005b60405163627419e760e11b815260c081600481875afa8015610da6576080915f91612850575b5001516127be57005b61280e926127fc5f60209460405196879586948593637f241ed360e11b8552306004860152600435602486015260806044860152608485019061331b565b83810360031901606485015290612fb1565b03925af18015610da65761281e57005b6020813d602011612848575b8161283760209383613165565b8101031261023e5761001a90613294565b3d915061282a565b612869915060c03d60c011610dd957610dcb8183613165565b856127b5565b90508801358b61105b565b50601f19891690825f528960205f20925f5b8181106128c25750106128a9575b5050600188811b0190556122e5565b8701355f1960038b901b60f8161c19169055888061289a565b8a84013585556001909401936020938401938d93500161288c565b90508501358a61105b565b50601f19821690835f528260205f20925f5b818110612930575010612917575b5050600181811b018255612297565b8401355f19600384901b60f8161c191690558780612908565b878401358555600190940193602093840193869350016128fa565b3461023e575f36600319011261023e576020600954604051908152f35b3461023e57602036600319011261023e57612981612eee565b6129896138a6565b3068929eee149b4bd212685414610e54573068929eee149b4bd21268556001600160a01b038116908115612a4b575f8080804780955af16129c86131f5565b5015612a0e576020917fc0819c13be868895eb93e40eaceb96de976442fa1d404e5c55f14bb65a8c489a83604051848152a23868929eee149b4bd2126855604051908152f35b60405162461bcd60e51b8152602060048201526015602482015274119959481dda5d1a191c985dd85b0819985a5b1959605a1b6044820152606490fd5b63d92e233d60e01b5f5260045ffd5b3461023e57602036600319011261023e57600435604051612a7a81613114565b60608152606060208201525f6040820152606060405191612a9a8361312f565b5f83525f60208401525f60408401525f828401525f60808401525f60a08401520152612ad9815f52600260205260018060a01b0360405f205416151590565b15610e7f575f52600c602052612bc560405f2060405190612af982613114565b604051612b0a816108928185613093565b825260a060405191612b2a83612b238160018501613093565b0384613165565b60208401928352612bd8600180841b03600283015416936040860194855260ff600360405194612b598661312f565b015481811615158552818160081c1615156020860152818160101c1615156040860152818160181c1615156060860152818160201c161515608086015260281c161515848401526060860192835260405196879660208852516101206020890152610140880190612eca565b9051868203601f19016040880152612eca565b92600180841b0390511660608501525180511515608085015260208101511515828501526040810151151560c08501526060810151151560e085015260808101511515610100850152015115156101208301520390f35b3461023e57604036600319011261023e57612c48612eee565b602435612c5481613872565b33151580612d06575b80612cd9575b612cc65781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f90815260046020526040902080546001600160a01b0319166001600160a01b03909216919091179055005b63a9fbf51f60e01b5f523360045260245ffd5b506001600160a01b0381165f90815260056020908152604080832033845290915290205460ff1615612c63565b506001600160a01b038116331415612c5d565b3461023e57602036600319011261023e57600435612d3681613872565b505f526004602052602060018060a01b0360405f205416604051908152f35b3461023e575f36600319011261023e576040515f5f54612d748161305b565b8084529060018116908115610ab35750600114612d9b576106238361060f81850382613165565b5f8080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b808210612ddd5750909150810160200161060f610a45565b919260018160209254838588010152019101909291612dc5565b3461023e57602036600319011261023e5760043563ffffffff60e01b811680910361023e5760209063780e9d6360e01b8114908115612e3c575b506040519015158152f35b6380ac58cd60e01b811491508115612e6e575b8115612e5d575b5082612e31565b6301ffc9a760e01b14905082612e56565b635b5e139f60e01b81149150612e4f565b3461023e5761062390612e9136612eb4565b905f52600d60205260405f20905f5260205261060f816108928160405f20613093565b604090600319011261023e576004359060243590565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b038216820361023e57565b602435906001600160a01b038216820361023e57565b9181601f8401121561023e578235916001600160401b03831161023e576020838186019501011161023e57565b9181601f8401121561023e578235916001600160401b03831161023e576020808501948460051b01011161023e57565b606090600319011261023e576004356001600160a01b038116810361023e57906024356001600160a01b038116810361023e579060443590565b9080602083519182815201916020808360051b8301019401925f915b838310612fdc57505050505090565b909192939460208061300b600193601f198682030187526040838b518051845201519181858201520190612eca565b97019301930191939290612fcd565b6009548110156130325760095f5260205f2001905f90565b634e487b7160e01b5f52603260045260245ffd5b8054821015613032575f5260205f2001905f90565b90600182811c92168015613089575b602083101461307557565b634e487b7160e01b5f52602260045260245ffd5b91607f169161306a565b5f92918154916130a28361305b565b80835292600181169081156130f757506001146130be57505050565b5f9081526020812093945091925b8383106130dd575060209250010190565b6001816020929493945483858701015201910191906130cc565b915050602093945060ff929192191683830152151560051b010190565b608081019081106001600160401b0382111761119257604052565b60c081019081106001600160401b0382111761119257604052565b604081019081106001600160401b0382111761119257604052565b90601f801991011681019081106001600160401b0382111761119257604052565b6001600160401b03811161119257601f01601f191660200190565b9291926131ad82613186565b916131bb6040519384613165565b82948184528183011161023e578281602093845f960137010152565b9080601f8301121561023e578160206131f2933591016131a1565b90565b3d1561321f573d9061320682613186565b916132146040519384613165565b82523d5f602084013e565b606090565b81811061322f575050565b5f8155600101613224565b9190601f811161324957505050565b613272925f5260205f20906020601f840160051c8301931061118857601f0160051c0190613224565b565b908060209392818452848401375f828201840152601f01601f1916010190565b5190811515820361023e57565b908160c091031261023e5761331360a0604051926132be8461312f565b6132c781613294565b84526132d560208201613294565b60208501526132e660408201613294565b60408501526132f760608201613294565b606085015261330860808201613294565b608085015201613294565b60a082015290565b90610120815261010060ff600361334a613339610120860187613093565b858103602087015260018701613093565b9460018060a01b036002820154166040860152015481811615156060850152818160081c1615156080850152818160101c16151560a0850152818160181c16151560c0850152818160201c16151560e085015260281c16151591015290565b9091906001600160a01b0383168015611f65575f838152600260205260409020546001600160a01b0316933315158061359f575b508415801561356c575b825f52600360205260405f2060018154019055845f52600260205260405f20836001600160601b0360a01b8254161790558483877fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4156134ef57600954845f52600a6020528060405f2055600160401b8110156111925761347561248682600188940160095561301a565b90555b8185036134af575b50506001600160a01b031680830361349757505050565b6364283d7b60e01b5f5260045260245260445260645ffd5b6134b890613646565b5f19810191908211611e8d575f52600760205260405f20815f526020528260405f2055825f52600860205260405f20555f80613480565b848214613478576134ff85613646565b845f52600860205260405f205490865f52600760205260405f2091818103613541575b50855f5260086020525f60408120555f526020525f6040812055613478565b815f528260205260405f2054815f52836020528060405f20555f52600860205260405f20555f613522565b5f85815260046020526040902080546001600160a01b0319169055855f52600360205260405f205f1981540190556133e7565b806135de575b156135b0575f6133dd565b83856135c857637e27328960e01b5f5260045260245ffd5b63177e802f60e01b5f523360045260245260445ffd5b50338514801561360d575b806135a557505f848152600460205260409020546001600160a01b031633146135a5565b505f85815260056020908152604080832033845290915290205460ff166135e9565b6001600160401b0381116111925760051b60200190565b6001600160a01b03168015613664575f52600360205260405f205490565b6322718ad960e21b5f525f60045260245ffd5b80518210156130325760209160051b010190565b805f52600e60205260405f2090604051808360208295549384815201905f5260205f20925f5b8181106137a05750506136c692500383613165565b8151916136d28361362f565b926136e06040519485613165565b8084526136ef601f199161362f565b015f5b81811061377c5750505f5b8151811015613776578061371360019284613677565b51845f52600d60205260405f2061372a8386613677565b515f5260205261089261375560405f20604051936137478561314a565b845260405192838092613093565b60208201526137648287613677565b5261376f8186613677565b50016136fd565b50505090565b60209060405161378b8161314a565b5f8152606083820152828288010152016136f2565b84548352600194850194879450602090930192016136b1565b61ffff60065460c01c16801561381e57612710811015613818576127108202918083046127101490151715611e8d576127100361ffff8111611e8d5761ffff16908115613804570490565b634e487b7160e01b5f52601260045260245ffd5b50505f90565b5090565b91908203918211611e8d57565b61ffff60065460c01c1690801580801561386a575b6138645782820292828404141715611e8d576127106131f2920490613822565b50905090565b508215613844565b5f818152600260205260409020546001600160a01b0316908115613894575090565b637e27328960e01b5f5260045260245ffd5b638b78c6d8195433036138b557565b6382b429005f526004601cfd5b805490600160401b82101561119257816124869160016138e494018155613046565b9055565b91908110156130325760051b81013590603e198136030182121561023e570190565b60018060a01b031680638b78c6d819547f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3638b78c6d81955565b6001600160601b03811680341061398d57803411613963575090565b5f8080613971819434613822565b818115613984575b3390f115610da65790565b506108fc613979565b62976f7560e21b5f5260045ffd5b823b6139a9575b5050505050565b604051630a85bd0160e11b81526001600160a01b0391821660048201529181166024830152604482019390935260806064820152911691602090829081906139f5906084830190612eca565b03815f865af15f9181613a65575b50613a315750613a116131f5565b80519081613a2c5782633250574960e11b5f5260045260245ffd5b602001fd5b6001600160e01b03191663757a42ff60e11b01613a5357505f808080806139a2565b633250574960e11b5f5260045260245ffd5b9091506020813d602011613aa2575b81613a8160209383613165565b8101031261023e57516001600160e01b03198116810361023e57905f613a03565b3d9150613a74565b5f52600e60205260405f20905f918054925b838110613acb57505050505f90565b82613ad68284613046565b90549060031b1c14613aea57600101613abc565b5050505060019056fea2646970667358221220cdde40aa67f6ee93975fa9c226f6160eb7a42a1de0a00a364b2b1c72c55d0d8064736f6c634300081c0033000000000000000000000000d1177f978a5535eba843bdd817e730df1c42c476

0x60e080604052600436101561001c575b50361561001a575f80fd5b005b5f3560e01c9081630125096414612e7f5750806301ffc9a714612df757806306fdde0314612d55578063081812fc14612d19578063095ea7b314612c2f57806310df54a014612a5a578063164e68de1461296857806318160ddd1461294b5780631fa368ad1461218457806320279bed1461215b57806323b872dd1461214457806325692962146120fb5780632b33f75a146120d55780632c4c518e146120b15780632f745c591461203f57806342842e0e146120105780634f55099c146112385780634f6ccce7146111f957806354d1f13d146111b557806355f804b314610fbe5780636352211e14610f8e57806370a0823114610f6b578063715018a614610f225780637e60e35214610eed578063807b989a14610eba5780638da5cb5b14610e8e578063900e633714610ad757806395d89b4114610a0d578063a22cb46514610969578063a55a8b46146108fd578063a9f25876146108b7578063b1237c8614610899578063b842ba7a14610859578063b88d4fde146107ff578063c083405714610771578063c13aceb71461074b578063c87b56dd14610490578063d34736ee14610401578063e985e9c5146103aa578063f04e283e1461035d578063f132f56a146102b7578063f2fde38b1461027c578063f6ca7614146102425763fee81cf41461020c575f61000f565b3461023e57602036600319011261023e57610225612eee565b63389a75e1600c525f52602080600c2054604051908152f35b5f80fd5b3461023e57602036600319011261023e576004355f908152600260209081526040909120546001600160a01b031615156040519015158152f35b602036600319011261023e57610290612eee565b6102986138a6565b8060601b156102aa5761001a9061390a565b637448fbae5f526004601cfd5b3461023e57602036600319011261023e576004355f52600e60205260405f20604051806020835491828152019081935f5260205f20905f5b8181106103475750505081610305910382613165565b604051918291602083019060208452518091526040830191905f5b81811061032e575050500390f35b8251845285945060209384019390920191600101610320565b82548452602090930192600192830192016102ef565b602036600319011261023e57610371612eee565b6103796138a6565b63389a75e1600c52805f526020600c20908154421161039d575f61001a925561390a565b636f5e88185f526004601cfd5b3461023e57604036600319011261023e576103c3612eee565b6103cb612f04565b9060018060a01b03165f52600560205260405f209060018060a01b03165f52602052602060ff60405f2054166040519015158152f35b3461023e57602036600319011261023e576004356001600160601b0381169081810361023e577f59ca0bfd8d8a79d1fdf44988b2113eeab493697c134d480e5dba7169117d26c2916020916104546138a6565b600680546bffffffffffffffffffffffff60601b191660609290921b6bffffffffffffffffffffffff60601b16919091179055604051908152a1005b3461023e57602036600319011261023e576004356104ad81613872565b50604051600b5490915f836104c18461305b565b9182825260208201946001811690815f1461072f57506001146106d0575b6104eb92500384613165565b8251156106b4578092815f9272184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b81101561068e575b50806d04ee2d6d415b85acef8100000000600a921015610673575b662386f26fc1000081101561065f575b6305f5e10081101561064e575b61271081101561063f575b6064811015610631575b1015610627575b6001820193600a602161059561057f88613186565b9761058d604051998a613165565b808952613186565b602088019590601f19013687378701015b5f1901916f181899199a1a9b1b9c1cb0b131b232b360811b8282061a8353049081156105d457600a906105a6565b5050602061060f92610623956040519586945180918587015e840190838201905f8252519283915e01015f815203601f198101835282613165565b604051918291602083526020830190612eca565b0390f35b906001019061056a565b606460029104930192610563565b61271060049104930192610559565b6305f5e1006008910493019261054e565b662386f26fc1000060109104930192610541565b6d04ee2d6d415b85acef810000000060209104930192610531565b6040935072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b90049050600a610516565b5050506106236040516106c8602082613165565b5f815261060f565b50600b5f90815290917f0175b7a638427703f0dbe7bb9bbf987a2551717b34e79f33b5b1008d1fa01db95b8183106107135750509060206104eb928201016104df565b6020919350806001915483858a010152019101909185926106fb565b60ff19168652506104eb92151560051b820160200190506104df565b3461023e57602036600319011261023e57602061076960043561382f565b604051908152f35b3461023e57602036600319011261023e5760043561ffff81169081810361023e5761079a6138a6565b61271082116107f0576006805461ffff60c01b191660c09290921b61ffff60c01b169190911790556040519081527faf01cfd9851d193cafb5496118d544ff7b59d828f99ec2a66d8d37981f52454290602090a1005b6358d620b360e01b5f5260045ffd5b3461023e57608036600319011261023e57610818612eee565b610820612f04565b90604435606435926001600160401b03841161023e5761084761001a9436906004016131d7565b926108538383836133a9565b3361399b565b3461023e5761086736612eb4565b905f52600d60205260405f20905f5260205261062361089261060f60405f2060405192838092613093565b0382613165565b3461023e57602036600319011261023e5760206107696004356137b9565b3461023e57604036600319011261023e576024356004355f52600e60205260405f20805482101561023e576020916108ee91613046565b90549060031b1c604051908152f35b3461023e57602036600319011261023e576004356001600160601b03811680910361023e5760207fccfe364e1732c45824ed762219be91b4528122920beab818cb699009a4fe53ed9161094e6138a6565b806001600160601b03196006541617600655604051908152a1005b3461023e57604036600319011261023e57610982612eee565b602435908115159081830361023e576001600160a01b03169182156109fa576109cc90335f52600560205260405f20845f5260205260405f209060ff801983541691151516179055565b6040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a3005b82630b61174360e31b5f5260045260245ffd5b3461023e575f36600319011261023e576040515f600154610a2d8161305b565b8084529060018116908115610ab35750600114610a55575b6106238361060f81850382613165565b60015f9081527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b808210610a995750909150810160200161060f610a45565b919260018160209254838588010152019101909291610a81565b60ff191660208086019190915291151560051b8401909101915061060f9050610a45565b3461023e57604036600319011261023e57600435610af3612f04565b5f828152600260205260409020546001600160a01b031615610e7f57610b1882613872565b336001600160a01b0390911603610e70575f828152600c60205260409020600201546001600160a01b0391821691168114610e61573068929eee149b4bd212685414610e54573068929eee149b4bd212685560405181837f21b0a09b8bf795bec0bf5f51bed97694c5e71ef5a81f33e3c20cac32b4558d8d5f80a381837f3e931422de6d757d4fc9efd866870398275ac459ef7ff0cdd425d1e58012eb50602083151594858152a315610e2b576040516301ffc9a760e01b8152631695e67f60e11b6004820152602081602481855afa5f9181610def575b50610c0457638f23dad360e01b5f5260045ffd5b15610de05760405163627419e760e11b815260c081600481855afa908115610da6575f91610db1575b505f838152600c602052604090206002810180546001600160a01b0319168417905581516003909101805460ff191691151560ff81169290921781559091602081015115159064ff00000000835463ff00000062ff00006040850151151560101b16916060850151151560181b9265ff000000000060a06080880151151560201b970151151560281b169665ff0000000000199261ff0087199260081b169063ffffff00191617161716911617911617179055610cf6575b50505b3868929eee149b4bd2126855005b602090825f52600c825260405f2090610d415f610d128661368b565b93610d58604051978896879586946320e3df8960e11b865230600487015260806024870152608486019061331b565b916044850152600319848303016064850152612fb1565b03925af18015610da657610d6d575b80610ce5565b6020813d602011610d9e575b81610d8660209383613165565b8101031261023e57610d9790613294565b5080610d67565b3d9150610d79565b6040513d5f823e3d90fd5b610dd3915060c03d60c011610dd9575b610dcb8183613165565b8101906132a1565b83610c2d565b503d610dc1565b638f23dad360e01b5f5260045ffd5b9091506020813d602011610e23575b81610e0b60209383613165565b8101031261023e57610e1c90613294565b9084610bf0565b3d9150610dfe565b505f908152600c602052604081206002810180546001600160a01b031916905560030155610ce8565b63ab143c065f526004601cfd5b635f7c8ab560e11b5f5260045ffd5b635c427cd960e01b5f5260045ffd5b636ddd9da960e01b5f5260045ffd5b3461023e575f36600319011261023e57638b78c6d819546040516001600160a01b039091168152602090f35b3461023e57602036600319011261023e57610623610ed960043561368b565b604051918291602083526020830190612fb1565b5f36600319011261023e576020610f116001600160601b0360065460601c16613947565b6001600160601b0360405191168152f35b5f36600319011261023e57610f356138a6565b5f638b78c6d819547f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a35f638b78c6d81955005b3461023e57602036600319011261023e576020610769610f89612eee565b613646565b3461023e57602036600319011261023e576020610fac600435613872565b6040516001600160a01b039091168152f35b3461023e57602036600319011261023e576004356001600160401b03811161023e57610fee903690600401612f1a565b90610ff76138a6565b81156111a6576001600160401b03821161119257611016600b5461305b565b601f8111611139575b505f91601f81116001146110995761106e81807f6741b2fc379fad678116fe3d4d4b9a1a184ab53ba36b86ad0fa66340b1ab41ad955f9161108e575b508160011b915f199060031b1c19161790565b600b555b611089604051928392602084526020840191613274565b0390a1005b90508401358661105b565b601f19811692600b5f527f0175b7a638427703f0dbe7bb9bbf987a2551717b34e79f33b5b1008d1fa01db9905f5b8581106111215750827f6741b2fc379fad678116fe3d4d4b9a1a184ab53ba36b86ad0fa66340b1ab41ad9510611108575b5050600181811b01600b55611072565b8301355f19600384901b60f8161c1916905583806110f8565b909160206001819285880135815501930191016110c7565b600b5f52611182907f0175b7a638427703f0dbe7bb9bbf987a2551717b34e79f33b5b1008d1fa01db9601f850160051c81019160208610611188575b601f0160051c0190613224565b8261101f565b9091508190611175565b634e487b7160e01b5f52604160045260245ffd5b63cc52148360e01b5f5260045ffd5b5f36600319011261023e5763389a75e1600c52335f525f6020600c2055337ffa7b8eab7da67f412cc9575ed43464468f9bfbae89d1675917346ca6d8fe3c925f80a2005b3461023e57602036600319011261023e57600435600954811015611222576108ee60209161301a565b63295f44f760e21b5f525f60045260245260445ffd5b608036600319011261023e576004356001600160401b03811161023e57611263903690600401612f1a565b906024356001600160401b03811161023e57611283903690600401612f1a565b926044356001600160401b03811161023e576112a3903690600401612f47565b6064356080819052919290916001600160a01b038116900361023e578015612001576112d03682876131a1565b936112dc3688836131a1565b966112e68461362f565b956112f46040519788613165565b848752602087018560051b870136811161023e5787915b818310611fa0575050506020815191012097602081519101209686519861134a6113348b61362f565b9a6113426040519c8d613165565b808c5261362f565b60208b019990601f1901368b375f5b89518110156113e257808c6113db828d60206113838361137b60019985613677565b515193613677565b510151602081519101206040519060208201927fac744b2be3b7f8d6f7d637db76586a27ab36aba301ab536c7226a6a344ab514f845260408301526060820152606081526113d2608082613165565b51902092613677565b5201611359565b506040518b516020820191908c90829084905f5b818110611f87575050611412925003601f198101835282613165565b5190206040519160208301933360601b85526034840152605483015260748201524260948201524660b482015260b4815261144e60d482613165565b51902060a08190525f908152600260205260409020546001600160a01b0316611f78576114856001600160601b0360065416613947565b50602060c08190526040519061149b9082613165565b5f81523315611f655760a0515f90815260c0516002905260409020546001600160a01b031680158015919082611f29575b335f81815260c080516003905260408083208054600101905560a080518452915160029052822080546001600160a01b0319168417905551919084907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef9080a415611ea15760095460a0515f52600a60c051528060405f2055600160401b8110156111925761156481600161157f930160095561301a565b60a0929192519083549060031b91821b915f19901b19161790565b90555b338103611e48575b50611e3557333b611d46575b5060a0515f52600c60c0515260405f206001600160401b038511611192576115c8856115c2835461305b565b8361323a565b5f9085601f8111600114611cdc57806115f7916001945f91611cd157508160011b915f199060031b1c19161790565b81555b016001600160401b03831161119257611617836115c2835461305b565b5f83601f8111600114611c6c5780611642925f91611c6157508160011b915f199060031b1c19161790565b90555b60a0515f52600d60c0515260405f2060a0515f52600e60c0515260405f205f5b878110611b01575050509061168a61169993926040519560a0875260a0870191613274565b9184830360c051860152613274565b91818303604083015280835260c05183019260c0518260051b82010193855f92603e1982360301905b858510611a7f57608080516001600160a01b03166060890152339088015260a0517f87fdbcd771cc4dafcc71f8a8b72bd28aea7a4dc930eeb01383da4cfacecf0399888a0389a26080516001600160a01b031615158061172b575b60405160a051815260c05190f35b3068929eee149b4bd212685414610e54573068929eee149b4bd212685560405160018060a01b036080511660a0517f21b0a09b8bf795bec0bf5f51bed97694c5e71ef5a81f33e3c20cac32b4558d8d5f80a381815260018060a01b0360805116907f3e931422de6d757d4fc9efd866870398275ac459ef7ff0cdd425d1e58012eb5060a0519160c05190a315611a44576040516301ffc9a760e01b8152631695e67f60e11b600482015260c051608051829060249082906001600160a01b03165afa5f9181611a06575b5061180957638f23dad360e01b5f5260045ffd5b15610de05760405163627419e760e11b815260805160c090829060049082906001600160a01b03165afa908115610da6575f916119e7575b5060a0515f52600c60c05152600260405f200160018060a01b03608051166001600160601b0360a01b82541617905560a0515f52600c60c05152600360405f2001815115159161189d83839060ff801983541691151516179055565b60c05181810151835460408401516060850151608086015160a09096015195151590941b64ff000000001693151560181b63ff0000001665ffffffffff001990921692151560081b61ff00169290921791151560101b62ff00001691909117171790151560281b65ff000000000016179055611926575b3868929eee149b4bd21268558061171d565b60a0515f52600c60c0515261198d60405f2061197061194660a05161368b565b9160405193849283926320e3df8960e11b845230600485015260806024850152608484019061331b565b60a051604484015282810360031901606484015260c05194612fb1565b03815f60018060a01b03608051165af18015610da6576119ae575b50611914565b60c0513d81116119e0575b6119c38183613165565b8160c051918101031261023e576119d990613294565b50806119a8565b503d6119b9565b611a00915060c03d60c011610dd957610dcb8183613165565b81611841565b90915060c0513d60c05111611a3d575b611a208183613165565b8160c051918101031261023e57611a3690613294565b90826117f5565b503d611a16565b60a0515f52600c60c05152600260405f20016001600160601b0360a01b815416905560a0515f52600c60c051525f6003604082200155611914565b909192939496601f1982820301855288358381121561023e5784018035825260c051810135601e198236030181121561023e57019081359160c051016001600160401b03831161023e57823603811361023e576001926040611ae9938160c0518201520191613274565b9860c051019460c051019501939796949291906116c2565b611b0c81898b6138e8565b35611b18828a8c6138e8565b60c05181013590601e198136030182121561023e57018035906001600160401b03821161023e5760c05101813603811361023e57611b579136916131a1565b8115611c5257815f528460c0515260405f20908051906001600160401b03821161119257611b8f82611b89855461305b565b8561323a565b60c05190601f8311600114611be257826001969593611bd19593611bc8935f92611bd7575b50508160011b915f199060031b1c19161790565b90555b846138c2565b01611665565b015190505f80611bb4565b90835f5260c0515f20915f5b601f1985168110611c39575092611bd19492600197969492889383601f19811610611c21575b505050811b019055611bcb565b01515f1960f88460031b161c191690558f8080611c14565b81830151845560c0516001909401939283019201611bee565b630eda9c3d60e31b5f5260045ffd5b90508601358a61105b565b50601f19841690825f528460c0515f20925f5b818110611cb5575010611c9c575b5050600183811b019055611645565b8501355f19600386901b60f8161c191690558780611c8d565b88840135855560c0516001909501949384019388935001611c7f565b90508501358b61105b565b505f81815260c0518120909287601f1981165b808610611d27576001955010611d0e575b50508186811b0181556115fa565b8401355f19600389901b60f8161c191690558880611d00565b86830135845560c0519586019560019094019390920191899150611cef565b60405190630a85bd0160e11b82523360048301525f602483015260a0516044830152608060648301528180611d8260c051936084830190612eca565b03815f335af15f9181611dee575b50611dbe57611d9d6131f5565b80519081611db857633250574960e11b5f523360045260245ffd5b60c05101fd5b6001600160e01b03191663757a42ff60e11b01611ddb5786611596565b633250574960e11b5f523360045260245ffd5b90915060c0513d60c05111611e2e575b611e088183613165565b8160c051918101031261023e57516001600160e01b03198116810361023e579088611d90565b503d611dfe565b6339e3563760e11b5f525f60045260245ffd5b611e5133613646565b5f198101908111611e8d57335f52600760c0515260405f20815f5260c0515260a05160405f205560a0515f52600860c0515260405f205561158a565b634e487b7160e01b5f52601160045260245ffd5b33811461158257611eb181613646565b60a0515f52600860c0515260405f205490825f52600760c0515260405f2091818103611efb575b5060a0515f52600860c051525f60408120555f5260c051525f6040812055611582565b815f528260c0515260405f2054815f528360c051528060405f20555f52600860c0515260405f20558b611ed8565b611f4c60a0515f52600460205260405f206001600160601b0360a01b8154169055565b815f52600360c0515260405f205f1981540190556114cc565b633250574960e11b5f525f60045260245ffd5b630ec0f14960e01b5f5260045ffd5b84518352602094850194869450909201916001016113f6565b82356001600160401b03811161023e57890160408136031261023e5760405191611fc98361314a565b813583526020820135926001600160401b03841161023e57611ff26020949385943691016131d7565b8382015281520192019161130b565b63a082172760e01b5f5260045ffd5b3461023e5761001a61202136612f77565b9060405192612031602085613165565b5f84526108538383836133a9565b3461023e57604036600319011261023e57612058612eee565b6024359061206581613646565b8210156120945760018060a01b03165f52600760205260405f20905f52602052602060405f2054604051908152f35b63295f44f760e21b5f5260018060a01b031660045260245260445ffd5b3461023e575f36600319011261023e57602061ffff60065460c01c16604051908152f35b3461023e575f36600319011261023e5760206001600160601b0360065416604051908152f35b5f36600319011261023e5763389a75e1600c52335f526202a30042016020600c2055337fdbf36a107da19e49527a7176a1babf963b4b0ff8cde35ee35d6cd8f1f9ac7e1d5f80a2005b3461023e5761001a61215536612f77565b916133a9565b3461023e575f36600319011261023e5760206001600160601b0360065460601c16604051908152f35b3461023e57608036600319011261023e576024356001600160401b03811161023e576121b4903690600401612f1a565b906044356001600160401b03811161023e576121d4903690600401612f1a565b926064356001600160401b03811161023e576121f4903690600401612f47565b9390918015612001576004355f908152600260205260409020546001600160a01b031615610e7f57612227600435613872565b336001600160a01b0390911603610e70576004355f52600c60205260405f20906001600160401b0381116111925761226981612263845461305b565b8461323a565b5f81601f81116001146128e85780612294925f916128dd57508160011b915f199060031b1c19161790565b82555b600182016001600160401b038811611192576122b7886115c2835461305b565b5f88601f811160011461287a57806122e2925f9161286f57508160011b915f199060031b1c19161790565b90555b6004355f908152600260205260409020546001600160a01b031615610e7f57336001600160a01b03612318600435613872565b1603610e7057928690866004355f52600d60205260405f206004355f52600e60205260405f20925f965b83881015612708578760051b820135605e198336030181121561023e5782019660608836031261023e5760405197606089018981106001600160401b03821117611192576040528035600281101561023e578952602081013560208a01526040810135906001600160401b03821161023e576123c0913691016131d7565b6040890152602088015115611c5257875160028110156126f457600103612582576020880151996004355f52600d60205260405f208b5f5260205260405f20612409815461305b565b908161253f575b50506004355f52600e60205260405f209b5f5b8d5480821015612527578d8f8361243991613046565b90549060031b1c1461244e5750600101612423565b9091969b93989d9499959a92979c505f198101908111611e8d5761248661247861249c9287613046565b90549060031b1c9286613046565b819391549060031b91821b915f19901b19161790565b90558254908115612513576001936020925f1901906124bb8282613046565b8154905f199060031b1b19169055555b0151604051602081525f60208201527f175fcc19dbc24c7654912639c5d54032dff6aa5d1d5538d53cf7ffa820ebba31604060043592a35b0196919893959094979297612342565b634e487b7160e01b5f52603160045260245ffd5b5050949991969b5094995060206001929793986124cb565b81601f5f93116001146125565750555b8c80612410565b8183526020832061257291601f0160051c810190600101613224565b808252816020812091555561254f565b9499929790959196809994995160028110156126f457156125a7575b50600190612503565b6125b76020820151600435613aaa565b15604082015160208301515f528a60205260405f20908051906001600160401b038211611192576125ec82611b89855461305b565b602090601f831160011461268957918061262192600198979695945f92611bd75750508160011b915f199060031b1c19161790565b90555b612676575b604060208201519101517f175fcc19dbc24c7654912639c5d54032dff6aa5d1d5538d53cf7ffa820ebba31604051602081528061266d600435946020830190612eca565b0390a39061259e565b61268460208201518d6138c2565b612629565b90835f52805f20915f5b601f19851681106126dc575091839160019897969594938994601f198116106126c4575b505050811b019055612624565b01515f1960f88460031b161c191690555f80806126b7565b91926020600181928685015181550194019201612693565b634e487b7160e01b5f52602160045260245ffd5b86897fcca018f97928a2be0da57b6757662e5cda180293f30a8dfcf0e05b1fcbf2473761275f8d8a61275161273e60043561368b565b9760405196606088526060880191613274565b918583036020870152613274565b918083036040820152806127766004359487612fb1565b0390a260028101546001600160a01b0316918261278f57005b60405163627419e760e11b815260c081600481875afa8015610da6576080915f91612850575b5001516127be57005b61280e926127fc5f60209460405196879586948593637f241ed360e11b8552306004860152600435602486015260806044860152608485019061331b565b83810360031901606485015290612fb1565b03925af18015610da65761281e57005b6020813d602011612848575b8161283760209383613165565b8101031261023e5761001a90613294565b3d915061282a565b612869915060c03d60c011610dd957610dcb8183613165565b856127b5565b90508801358b61105b565b50601f19891690825f528960205f20925f5b8181106128c25750106128a9575b5050600188811b0190556122e5565b8701355f1960038b901b60f8161c19169055888061289a565b8a84013585556001909401936020938401938d93500161288c565b90508501358a61105b565b50601f19821690835f528260205f20925f5b818110612930575010612917575b5050600181811b018255612297565b8401355f19600384901b60f8161c191690558780612908565b878401358555600190940193602093840193869350016128fa565b3461023e575f36600319011261023e576020600954604051908152f35b3461023e57602036600319011261023e57612981612eee565b6129896138a6565b3068929eee149b4bd212685414610e54573068929eee149b4bd21268556001600160a01b038116908115612a4b575f8080804780955af16129c86131f5565b5015612a0e576020917fc0819c13be868895eb93e40eaceb96de976442fa1d404e5c55f14bb65a8c489a83604051848152a23868929eee149b4bd2126855604051908152f35b60405162461bcd60e51b8152602060048201526015602482015274119959481dda5d1a191c985dd85b0819985a5b1959605a1b6044820152606490fd5b63d92e233d60e01b5f5260045ffd5b3461023e57602036600319011261023e57600435604051612a7a81613114565b60608152606060208201525f6040820152606060405191612a9a8361312f565b5f83525f60208401525f60408401525f828401525f60808401525f60a08401520152612ad9815f52600260205260018060a01b0360405f205416151590565b15610e7f575f52600c602052612bc560405f2060405190612af982613114565b604051612b0a816108928185613093565b825260a060405191612b2a83612b238160018501613093565b0384613165565b60208401928352612bd8600180841b03600283015416936040860194855260ff600360405194612b598661312f565b015481811615158552818160081c1615156020860152818160101c1615156040860152818160181c1615156060860152818160201c161515608086015260281c161515848401526060860192835260405196879660208852516101206020890152610140880190612eca565b9051868203601f19016040880152612eca565b92600180841b0390511660608501525180511515608085015260208101511515828501526040810151151560c08501526060810151151560e085015260808101511515610100850152015115156101208301520390f35b3461023e57604036600319011261023e57612c48612eee565b602435612c5481613872565b33151580612d06575b80612cd9575b612cc65781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9255f80a45f90815260046020526040902080546001600160a01b0319166001600160a01b03909216919091179055005b63a9fbf51f60e01b5f523360045260245ffd5b506001600160a01b0381165f90815260056020908152604080832033845290915290205460ff1615612c63565b506001600160a01b038116331415612c5d565b3461023e57602036600319011261023e57600435612d3681613872565b505f526004602052602060018060a01b0360405f205416604051908152f35b3461023e575f36600319011261023e576040515f5f54612d748161305b565b8084529060018116908115610ab35750600114612d9b576106238361060f81850382613165565b5f8080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b808210612ddd5750909150810160200161060f610a45565b919260018160209254838588010152019101909291612dc5565b3461023e57602036600319011261023e5760043563ffffffff60e01b811680910361023e5760209063780e9d6360e01b8114908115612e3c575b506040519015158152f35b6380ac58cd60e01b811491508115612e6e575b8115612e5d575b5082612e31565b6301ffc9a760e01b14905082612e56565b635b5e139f60e01b81149150612e4f565b3461023e5761062390612e9136612eb4565b905f52600d60205260405f20905f5260205261060f816108928160405f20613093565b604090600319011261023e576004359060243590565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600435906001600160a01b038216820361023e57565b602435906001600160a01b038216820361023e57565b9181601f8401121561023e578235916001600160401b03831161023e576020838186019501011161023e57565b9181601f8401121561023e578235916001600160401b03831161023e576020808501948460051b01011161023e57565b606090600319011261023e576004356001600160a01b038116810361023e57906024356001600160a01b038116810361023e579060443590565b9080602083519182815201916020808360051b8301019401925f915b838310612fdc57505050505090565b909192939460208061300b600193601f198682030187526040838b518051845201519181858201520190612eca565b97019301930191939290612fcd565b6009548110156130325760095f5260205f2001905f90565b634e487b7160e01b5f52603260045260245ffd5b8054821015613032575f5260205f2001905f90565b90600182811c92168015613089575b602083101461307557565b634e487b7160e01b5f52602260045260245ffd5b91607f169161306a565b5f92918154916130a28361305b565b80835292600181169081156130f757506001146130be57505050565b5f9081526020812093945091925b8383106130dd575060209250010190565b6001816020929493945483858701015201910191906130cc565b915050602093945060ff929192191683830152151560051b010190565b608081019081106001600160401b0382111761119257604052565b60c081019081106001600160401b0382111761119257604052565b604081019081106001600160401b0382111761119257604052565b90601f801991011681019081106001600160401b0382111761119257604052565b6001600160401b03811161119257601f01601f191660200190565b9291926131ad82613186565b916131bb6040519384613165565b82948184528183011161023e578281602093845f960137010152565b9080601f8301121561023e578160206131f2933591016131a1565b90565b3d1561321f573d9061320682613186565b916132146040519384613165565b82523d5f602084013e565b606090565b81811061322f575050565b5f8155600101613224565b9190601f811161324957505050565b613272925f5260205f20906020601f840160051c8301931061118857601f0160051c0190613224565b565b908060209392818452848401375f828201840152601f01601f1916010190565b5190811515820361023e57565b908160c091031261023e5761331360a0604051926132be8461312f565b6132c781613294565b84526132d560208201613294565b60208501526132e660408201613294565b60408501526132f760608201613294565b606085015261330860808201613294565b608085015201613294565b60a082015290565b90610120815261010060ff600361334a613339610120860187613093565b858103602087015260018701613093565b9460018060a01b036002820154166040860152015481811615156060850152818160081c1615156080850152818160101c16151560a0850152818160181c16151560c0850152818160201c16151560e085015260281c16151591015290565b9091906001600160a01b0383168015611f65575f838152600260205260409020546001600160a01b0316933315158061359f575b508415801561356c575b825f52600360205260405f2060018154019055845f52600260205260405f20836001600160601b0360a01b8254161790558483877fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5f80a4156134ef57600954845f52600a6020528060405f2055600160401b8110156111925761347561248682600188940160095561301a565b90555b8185036134af575b50506001600160a01b031680830361349757505050565b6364283d7b60e01b5f5260045260245260445260645ffd5b6134b890613646565b5f19810191908211611e8d575f52600760205260405f20815f526020528260405f2055825f52600860205260405f20555f80613480565b848214613478576134ff85613646565b845f52600860205260405f205490865f52600760205260405f2091818103613541575b50855f5260086020525f60408120555f526020525f6040812055613478565b815f528260205260405f2054815f52836020528060405f20555f52600860205260405f20555f613522565b5f85815260046020526040902080546001600160a01b0319169055855f52600360205260405f205f1981540190556133e7565b806135de575b156135b0575f6133dd565b83856135c857637e27328960e01b5f5260045260245ffd5b63177e802f60e01b5f523360045260245260445ffd5b50338514801561360d575b806135a557505f848152600460205260409020546001600160a01b031633146135a5565b505f85815260056020908152604080832033845290915290205460ff166135e9565b6001600160401b0381116111925760051b60200190565b6001600160a01b03168015613664575f52600360205260405f205490565b6322718ad960e21b5f525f60045260245ffd5b80518210156130325760209160051b010190565b805f52600e60205260405f2090604051808360208295549384815201905f5260205f20925f5b8181106137a05750506136c692500383613165565b8151916136d28361362f565b926136e06040519485613165565b8084526136ef601f199161362f565b015f5b81811061377c5750505f5b8151811015613776578061371360019284613677565b51845f52600d60205260405f2061372a8386613677565b515f5260205261089261375560405f20604051936137478561314a565b845260405192838092613093565b60208201526137648287613677565b5261376f8186613677565b50016136fd565b50505090565b60209060405161378b8161314a565b5f8152606083820152828288010152016136f2565b84548352600194850194879450602090930192016136b1565b61ffff60065460c01c16801561381e57612710811015613818576127108202918083046127101490151715611e8d576127100361ffff8111611e8d5761ffff16908115613804570490565b634e487b7160e01b5f52601260045260245ffd5b50505f90565b5090565b91908203918211611e8d57565b61ffff60065460c01c1690801580801561386a575b6138645782820292828404141715611e8d576127106131f2920490613822565b50905090565b508215613844565b5f818152600260205260409020546001600160a01b0316908115613894575090565b637e27328960e01b5f5260045260245ffd5b638b78c6d8195433036138b557565b6382b429005f526004601cfd5b805490600160401b82101561119257816124869160016138e494018155613046565b9055565b91908110156130325760051b81013590603e198136030182121561023e570190565b60018060a01b031680638b78c6d819547f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e05f80a3638b78c6d81955565b6001600160601b03811680341061398d57803411613963575090565b5f8080613971819434613822565b818115613984575b3390f115610da65790565b506108fc613979565b62976f7560e21b5f5260045ffd5b823b6139a9575b5050505050565b604051630a85bd0160e11b81526001600160a01b0391821660048201529181166024830152604482019390935260806064820152911691602090829081906139f5906084830190612eca565b03815f865af15f9181613a65575b50613a315750613a116131f5565b80519081613a2c5782633250574960e11b5f5260045260245ffd5b602001fd5b6001600160e01b03191663757a42ff60e11b01613a5357505f808080806139a2565b633250574960e11b5f5260045260245ffd5b9091506020813d602011613aa2575b81613a8160209383613165565b8101031261023e57516001600160e01b03198116810361023e57905f613a03565b3d9150613a74565b5f52600e60205260405f20905f918054925b838110613acb57505050505f90565b82613ad68284613046565b90549060031b1c14613aea57600101613abc565b5050505060019056fea2646970667358221220cdde40aa67f6ee93975fa9c226f6160eb7a42a1de0a00a364b2b1c72c55d0d8064736f6c634300081c0033

000000000000000000000000d1177f978a5535eba843bdd817e730df1c42c476

-----Decoded View---------------
Arg [0] : initialOwner (address): 0xD1177f978A5535eBa843bDd817E730DF1c42c476

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