Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE

More Options

• Similar
• Submit Audit
• Compare

/* SPDX-License-Identifier: MIT */
pragma solidity ^0.8.18;

import "./VeridaDIDRegistry.sol";

/** @title VeridaDIDRegistry */
contract VeridaDIDRegistryV2 is VeridaDIDRegistry {
  using EnumerableSetUpgradeable for EnumerableSetUpgradeable.AddressSet;

  function getVersion() external pure virtual returns(string memory) {
    return "2.0";
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function getDIDs(uint startIndex, uint count) external view virtual override returns(address[] memory) {
    if (count == 0 || (startIndex + count ) > _registeredDIDs.length()) {
      revert OutOfRange();
    }

    address[] memory ret = new address[](count);

    for (uint i; i < count;) {
      ret[i] = _registeredDIDs.at(startIndex + i);
      unchecked { ++i; }
    }

    return ret;
  }
}

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

pragma solidity ^0.8.0;

import "../utils/ContextUpgradeable.sol";
import "../proxy/utils/Initializable.sol";

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

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

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

    function __Ownable_init_unchained() internal onlyInitializing {
        _transferOwnership(_msgSender());
    }

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

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

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

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

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _transferOwnership(newOwner);
    }

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

    /**
     * @dev This empty reserved space is put in place to allow future versions to add new
     * variables without shifting down storage in the inheritance chain.
     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps
     */
    uint256[49] private __gap;
}

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

pragma solidity ^0.8.2;

import "../../utils/AddressUpgradeable.sol";

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

    /**
     * @dev Indicates that the contract is in the process of being initialized.
     */
    bool private _initializing;

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

    /**
     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,
     * `onlyInitializing` functions can be used to initialize parent contracts.
     *
     * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a
     * constructor.
     *
     * Emits an {Initialized} event.
     */
    modifier initializer() {
        bool isTopLevelCall = !_initializing;
        require(
            (isTopLevelCall && _initialized < 1) || (!AddressUpgradeable.isContract(address(this)) && _initialized == 1),
            "Initializable: contract is already initialized"
        );
        _initialized = 1;
        if (isTopLevelCall) {
            _initializing = true;
        }
        _;
        if (isTopLevelCall) {
            _initializing = false;
            emit Initialized(1);
        }
    }

    /**
     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the
     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be
     * used to initialize parent contracts.
     *
     * A reinitializer may be used after the original initialization step. This is essential to configure modules that
     * are added through upgrades and that require initialization.
     *
     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`
     * cannot be nested. If one is invoked in the context of another, execution will revert.
     *
     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in
     * a contract, executing them in the right order is up to the developer or operator.
     *
     * WARNING: setting the version to 255 will prevent any future reinitialization.
     *
     * Emits an {Initialized} event.
     */
    modifier reinitializer(uint8 version) {
        require(!_initializing && _initialized < version, "Initializable: contract is already initialized");
        _initialized = version;
        _initializing = true;
        _;
        _initializing = false;
        emit Initialized(version);
    }

    /**
     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the
     * {initializer} and {reinitializer} modifiers, directly or indirectly.
     */
    modifier onlyInitializing() {
        require(_initializing, "Initializable: contract is not initializing");
        _;
    }

    /**
     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.
     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized
     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called
     * through proxies.
     *
     * Emits an {Initialized} event the first time it is successfully executed.
     */
    function _disableInitializers() internal virtual {
        require(!_initializing, "Initializable: contract is initializing");
        if (_initialized < type(uint8).max) {
            _initialized = type(uint8).max;
            emit Initialized(type(uint8).max);
        }
    }

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

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

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

pragma solidity ^0.8.1;

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

        return account.code.length > 0;
    }

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

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

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

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

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

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

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

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

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

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

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

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

pragma solidity ^0.8.0;
import "../proxy/utils/Initializable.sol";

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

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

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

    /**
     * @dev This empty reserved space is put in place to allow future versions to add new
     * variables without shifting down storage in the inheritance chain.
     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps
     */
    uint256[50] private __gap;
}

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

pragma solidity ^0.8.0;

import "../StringsUpgradeable.sol";

/**
 * @dev Elliptic Curve Digital Signature Algorithm (ECDSA) operations.
 *
 * These functions can be used to verify that a message was signed by the holder
 * of the private keys of a given address.
 */
library ECDSAUpgradeable {
    enum RecoverError {
        NoError,
        InvalidSignature,
        InvalidSignatureLength,
        InvalidSignatureS,
        InvalidSignatureV // Deprecated in v4.8
    }

    function _throwError(RecoverError error) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert("ECDSA: invalid signature");
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert("ECDSA: invalid signature length");
        } else if (error == RecoverError.InvalidSignatureS) {
            revert("ECDSA: invalid signature 's' value");
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature` or error string. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     *
     * Documentation for signature generation:
     * - with https://web3js.readthedocs.io/en/v1.3.4/web3-eth-accounts.html#sign[Web3.js]
     * - with https://docs.ethers.io/v5/api/signer/#Signer-signMessage[ethers]
     *
     * _Available since v4.3._
     */
    function tryRecover(bytes32 hash, bytes memory signature) internal pure returns (address, RecoverError) {
        if (signature.length == 65) {
            bytes32 r;
            bytes32 s;
            uint8 v;
            // ecrecover takes the signature parameters, and the only way to get them
            // currently is to use assembly.
            /// @solidity memory-safe-assembly
            assembly {
                r := mload(add(signature, 0x20))
                s := mload(add(signature, 0x40))
                v := byte(0, mload(add(signature, 0x60)))
            }
            return tryRecover(hash, v, r, s);
        } else {
            return (address(0), RecoverError.InvalidSignatureLength);
        }
    }

    /**
     * @dev Returns the address that signed a hashed message (`hash`) with
     * `signature`. This address can then be used for verification purposes.
     *
     * The `ecrecover` EVM opcode allows for malleable (non-unique) signatures:
     * this function rejects them by requiring the `s` value to be in the lower
     * half order, and the `v` value to be either 27 or 28.
     *
     * IMPORTANT: `hash` _must_ be the result of a hash operation for the
     * verification to be secure: it is possible to craft signatures that
     * recover to arbitrary addresses for non-hashed data. A safe way to ensure
     * this is by receiving a hash of the original message (which may otherwise
     * be too long), and then calling {toEthSignedMessageHash} on it.
     */
    function recover(bytes32 hash, bytes memory signature) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, signature);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
     *
     * _Available since v4.3._
     */
    function tryRecover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address, RecoverError) {
        bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
        uint8 v = uint8((uint256(vs) >> 255) + 27);
        return tryRecover(hash, v, r, s);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `r and `vs` short-signature fields separately.
     *
     * _Available since v4.2._
     */
    function recover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, r, vs);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `v`,
     * `r` and `s` signature fields separately.
     *
     * _Available since v4.3._
     */
    function tryRecover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address, RecoverError) {
        // EIP-2 still allows signature malleability for ecrecover(). Remove this possibility and make the signature
        // unique. Appendix F in the Ethereum Yellow paper (https://ethereum.github.io/yellowpaper/paper.pdf), defines
        // the valid range for s in (301): 0 < s < secp256k1n ÷ 2 + 1, and for v in (302): v ∈ {27, 28}. Most
        // signatures from current libraries generate a unique signature with an s-value in the lower half order.
        //
        // If your library generates malleable signatures, such as s-values in the upper range, calculate a new s-value
        // with 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - s1 and flip v from 27 to 28 or
        // vice versa. If your library also generates signatures with 0/1 for v instead 27/28, add 27 to v to accept
        // these malleable signatures as well.
        if (uint256(s) > 0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0) {
            return (address(0), RecoverError.InvalidSignatureS);
        }

        // If the signature is valid (and not malleable), return the signer address
        address signer = ecrecover(hash, v, r, s);
        if (signer == address(0)) {
            return (address(0), RecoverError.InvalidSignature);
        }

        return (signer, RecoverError.NoError);
    }

    /**
     * @dev Overload of {ECDSA-recover} that receives the `v`,
     * `r` and `s` signature fields separately.
     */
    function recover(
        bytes32 hash,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal pure returns (address) {
        (address recovered, RecoverError error) = tryRecover(hash, v, r, s);
        _throwError(error);
        return recovered;
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from a `hash`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32) {
        // 32 is the length in bytes of hash,
        // enforced by the type signature above
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n32", hash));
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from `s`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes memory s) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n", StringsUpgradeable.toString(s.length), s));
    }

    /**
     * @dev Returns an Ethereum Signed Typed Data, created from a
     * `domainSeparator` and a `structHash`. This produces hash corresponding
     * to the one signed with the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]
     * JSON-RPC method as part of EIP-712.
     *
     * See {recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19\x01", domainSeparator, structHash));
    }
}

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

pragma solidity ^0.8.0;

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

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

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

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

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

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

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

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1);

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

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

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

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

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

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

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

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

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

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works
            // in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

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

    /**
     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(
        uint256 x,
        uint256 y,
        uint256 denominator,
        Rounding rounding
    ) internal pure returns (uint256) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

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

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

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

    /**
     * @notice Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

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

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

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

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

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 1;
            }
        }
        return result;
    }

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

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

pragma solidity ^0.8.0;

import "./math/MathUpgradeable.sol";

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

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

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

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

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

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

                // Move the last value to the index where the value to delete is
                set._values[toDeleteIndex] = lastValue;
                // Update the index for the moved value
                set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
            }

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

            // Delete the index for the deleted slot
            delete set._indexes[value];

            return true;
        } else {
            return false;
        }
    }

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

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

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

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

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

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

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

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

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

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

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

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

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

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

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

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

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

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

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

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

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

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

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

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

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

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }
}

// SPDX-License-Identifier: MIT

pragma solidity ^0.8.18;

library EnumerableSet {
    struct StringSet {
        string[] _values;
        mapping(string => uint256) _indexes;
    }

    function add(StringSet storage set, string memory value) internal returns (bool) {
        if (!contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._indexes[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    function remove(StringSet storage set, string memory value) internal returns (bool) {
        // We read and store the value's index to prevent multiple reads from the same storage slot
        uint256 valueIndex = set._indexes[value];

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

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

            if (lastIndex != toDeleteIndex) {
                string memory lastValue = set._values[lastIndex];

                // Move the last value to the index where the value to delete is
                set._values[toDeleteIndex] = lastValue;
                // Update the index for the moved value
                set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
            }

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

            // Delete the index for the deleted slot
            delete set._indexes[value];

            return true;
        } else {
            return false;
        }
    }

    function clear(StringSet storage set) internal {
        uint len = set._values.length;
        if (len > 0) {
            string memory value;
            for (uint i; i < len;) {
                value = set._values[i];
                delete set._indexes[value];
                unchecked { ++i; }
            }
            delete set._values;
        }
    }

    function contains(StringSet storage set, string memory value) internal view returns (bool) {
        return set._indexes[value] != 0;
    }

    function length(StringSet storage set) internal view returns (uint256) {
        return set._values.length;
    }

    function at(StringSet storage set, uint256 index) internal view returns (string memory) {
        return set._values[index];
    }

    function values(StringSet storage set) internal view returns (string[] memory) {
        return set._values;
    }

}

/* SPDX-License-Identifier: MIT */
pragma solidity ^0.8.18;

interface IVeridaDIDRegistry {
    /**
     * @notice Emitted when a user register endpoints
     * @param didAddress DID
     * @param endponits A list of registered endpoint
     */
    event Register(address didAddress, string[] endponits);

    /**
     * @notice Emittted when a DID address is revoked
     * @dev Only controller can revoke
     * @param didAddress DID address to be revoked
     */
    event Revoke(address didAddress);

    /**
     * @notice Emitted when controller is set for a DID address
     * @param didAddress DID address
     * @param controller Updated controller address
     */
    event SetController(address didAddress, address controller);

    /**
     * @notice Register a list of endpoints for a did
     * @dev Update the list if already registered
     * @param didAddress DID address, ex : 0xb794f5ea0ba39494ce839613fffba74279579268
     * @param endpoints List of endpoints
     * @param signature Signature is generated by : sign(${did}/${nonce}/${endpoints[0]}/${endpoints[1]}/...)
     */
    function register(address didAddress, string[] calldata endpoints, bytes calldata signature ) external;

    /**
     * @notice Revoke a DID address
     * @dev Only controller can do this
     * @param didAddress DID address to be revoked
     * @param signature Signature signed by controller of DID
     */
    function revoke(address didAddress, bytes calldata signature) external;

    /**
     * @notice Get a controller of a DID address
     * @param didAddress DID address
     * @return address Controller address
     */
    function getController(address didAddress) external view returns(address);

    /**
     * @notice Set a controller of a DID address
     * @dev Only previous controller can call this function. After register a DID by register(...) function, the did itself is a controller.
     * @param didAddress DID address to change the controller
     * @param controller New controller address to be set
     * @param signature Signature signed by previous controller
     */
    function setController(address didAddress, address controller, bytes calldata signature) external;
    
    /**
     * @notice Lookup the endpoints for a given DID address
     * @param didAddress : DID address.
     * @return address Address of controller
     * @return string[] Array of endpoints for a given DID address
     */
    function lookup(address didAddress) external view returns(address, string[] memory);

    /**
     * @notice Obtain the nonce for a DID address
     * @param didAddress DID address
     */
    function nonce(address didAddress) external view returns(uint);

    /**
     * @notice Return the number of active DIDs
     * @dev Active DIDs doesn't include revoked ones.
     * @return uint Number of active DIDs
     */
    function activeDIDCount() external view returns(uint);

    /**
     * @notice Get the registered did list by starting index & count
     * @dev Only owner can see it
     * @param startIndex Start index in the registered DID array. Index started from 0
     * @param count Number of DIDs to be retrieved
     * @return address[] Address list of Registered DIDs
     */
    function getDIDs(uint startIndex, uint count) external view returns(address[] memory);
}

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

import "@openzeppelin/contracts-upgradeable/utils/cryptography/ECDSAUpgradeable.sol";

library VeridaDataVerificationLib {
  function getSignerAddress(
    bytes memory _unsignedData,
    bytes calldata _signature
  ) internal pure returns (address) {
    bytes32 unsignedDataHash = keccak256(_unsignedData);
    return ECDSAUpgradeable.recover(unsignedDataHash, _signature);
  }

  function validateSignature(
    bytes memory _unsignedData,
    bytes calldata _signature,
    address _signerAddress
  ) internal pure returns (bool result) {
    address signerAddress = getSignerAddress(_unsignedData, _signature);
    result = signerAddress == _signerAddress;
    assembly {
      if iszero(signerAddress) {
        result := false
      }
    }
  }
}

/* SPDX-License-Identifier: MIT */
pragma solidity ^0.8.18;

import { VeridaDataVerificationLib } from "./VeridaDataVerificationLib.sol";
import "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol";
import "@openzeppelin/contracts-upgradeable/utils/structs/EnumerableSetUpgradeable.sol";

// Verida contract dependencies
import { EnumerableSet } from "@verida/common-contract/contracts/EnumerableSet.sol";
import "./IVeridaDIDRegistry.sol";

// import "hardhat/console.sol";

/** @title VeridaDIDRegistry */
contract VeridaDIDRegistry is OwnableUpgradeable, IVeridaDIDRegistry {

  using EnumerableSet for EnumerableSet.StringSet;
  using EnumerableSetUpgradeable for EnumerableSetUpgradeable.AddressSet;

  /**
   * @notice List of registered DIDs
   */
  EnumerableSetUpgradeable.AddressSet internal _registeredDIDs;

  /**
   * @notice Map of registered DID info
   * @dev DID address => DIDInfo
   */
  mapping(address => DIDInfo) internal _DIDInfo;

  /**
   * @notice Next nonce of DID
   * @dev DID address => nonce
   */
  mapping(address => uint) internal _nonce;

  /**
     * @notice Gap for later use
     */
  uint256[20] private __gap;

  /**
   * @notice Struct representing the DID info
   */
  struct DIDInfo {
    address controller;
    EnumerableSet.StringSet endpoints;
  }

  // Custom errors
  error RevokedDID();
  error InvalidSignature();
  error UnregisteredDID();
  error OutOfRange();

  /**
   * @notice Initialize
   */
  function initialize() public initializer {
    __Ownable_init();
  }

  /**
   * @notice Check whether the DID is registered
   * @dev Revoked DIDs are not registered ones
   */
  function isRegistered(address didAddress) internal view virtual returns(bool) {
    return _registeredDIDs.contains(didAddress);
  }
  
  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function register(address didAddress, string[] calldata endpoints, bytes calldata signature ) external virtual override {
    if (_nonce[didAddress] != 0 && !isRegistered(didAddress)) {
      revert RevokedDID();
    }

    {
      bytes memory rawMsg = abi.encodePacked(didAddress, "/");
      for (uint i; i < endpoints.length;) {
        rawMsg = abi.encodePacked(rawMsg, endpoints[i], "/");
        unchecked { ++i; }
      }

      rawMsg = abi.encodePacked(rawMsg, _nonce[didAddress]);

      if (!VeridaDataVerificationLib.validateSignature(rawMsg, signature, didAddress)) {
        revert InvalidSignature();
      }
      _nonce[didAddress]++;
    }

    EnumerableSet.StringSet storage list = _DIDInfo[didAddress].endpoints;
    list.clear();
    
    for (uint i; i < endpoints.length;) {
      list.add(endpoints[i]);
      unchecked { ++i; }
    }

    // Add didAddress for only new registers
    if (!isRegistered(didAddress)) {
      _registeredDIDs.add(didAddress);
    }

    emit Register(didAddress, endpoints);
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function revoke(address didAddress, bytes calldata signature) external virtual override {
    if (!isRegistered(didAddress)) {
      revert UnregisteredDID();
    }
    {
      address controller = _getController(didAddress);
      bytes memory rawMsg = abi.encodePacked(
        didAddress, 
        "/revoke/",
        _nonce[didAddress]);
      
      if (!VeridaDataVerificationLib.validateSignature(rawMsg, signature, controller)) {
        revert InvalidSignature();
      }
      _nonce[didAddress]++;
    }

    delete _DIDInfo[didAddress];
    _registeredDIDs.remove(didAddress);

    emit Revoke(didAddress);
  }

  /**
   * @notice Internal function to get a controller of DID address
   * @dev This is internal function to be used in another functions. Gas efficient than external function
   * @param didAddress DID address
   * @return result Controller of DID address
   */
  function _getController(address didAddress) internal virtual view returns(address result) {
    result = _DIDInfo[didAddress].controller;
    assembly {
      if iszero(result) {
        result := didAddress
      }
    }
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function getController(address didAddress) external virtual view override returns(address) {
    return _getController(didAddress);
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function setController(address didAddress, address controller, bytes calldata signature) external virtual override {
    if (!isRegistered(didAddress)) {
      revert UnregisteredDID();
    }
    {
      address oldController = _getController(didAddress);
      bytes memory rawMsg = abi.encodePacked(
        didAddress, 
        "/setController/",
        controller,
        "/",
        _nonce[didAddress]);
      
      if (!VeridaDataVerificationLib.validateSignature(rawMsg, signature, oldController)) {
        revert InvalidSignature();
      }
      _nonce[didAddress]++;
    }

    _DIDInfo[didAddress].controller = controller;

    emit SetController(didAddress, controller);
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function lookup(address didAddress) external view virtual override returns(address, string[] memory) {
    if (!isRegistered(didAddress)) {
      revert UnregisteredDID();
    }

    EnumerableSet.StringSet storage list = _DIDInfo[didAddress].endpoints;
    uint length = list.length();

    string[] memory ret = new string[](length);

    for (uint i; i < length;) {
      ret[i] = list.at(i);
      unchecked { ++i; }
    }

    return (_getController(didAddress), ret);
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function nonce(address didAddress) external view virtual override returns(uint) {
    return _nonce[didAddress];
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function activeDIDCount() external view virtual override returns(uint) {
    return _registeredDIDs.length();
  }

  /**
   * @dev See {IVeridaDIDRegistry}
   */
  function getDIDs(uint startIndex, uint count) external view virtual override onlyOwner returns(address[] memory) {
    if (count == 0 || (startIndex + count ) > _registeredDIDs.length()) {
      revert OutOfRange();
    }

    address[] memory ret = new address[](count);

    for (uint i; i < count;) {
      ret[i] = _registeredDIDs.at(startIndex + i);
      unchecked { ++i; }
    }

    return ret;
  }
}

{
  "optimizer": {
    "enabled": true,
    "runs": 1000
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "libraries": {}
}

[{"inputs":[],"name":"InvalidSignature","type":"error"},{"inputs":[],"name":"OutOfRange","type":"error"},{"inputs":[],"name":"RevokedDID","type":"error"},{"inputs":[],"name":"UnregisteredDID","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint8","name":"version","type":"uint8"}],"name":"Initialized","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"didAddress","type":"address"},{"indexed":false,"internalType":"string[]","name":"endponits","type":"string[]"}],"name":"Register","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"didAddress","type":"address"}],"name":"Revoke","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"didAddress","type":"address"},{"indexed":false,"internalType":"address","name":"controller","type":"address"}],"name":"SetController","type":"event"},{"inputs":[],"name":"activeDIDCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"didAddress","type":"address"}],"name":"getController","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"startIndex","type":"uint256"},{"internalType":"uint256","name":"count","type":"uint256"}],"name":"getDIDs","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getVersion","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"initialize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"didAddress","type":"address"}],"name":"lookup","outputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"string[]","name":"","type":"string[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"didAddress","type":"address"}],"name":"nonce","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"didAddress","type":"address"},{"internalType":"string[]","name":"endpoints","type":"string[]"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"register","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"didAddress","type":"address"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"revoke","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"didAddress","type":"address"},{"internalType":"address","name":"controller","type":"address"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"setController","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561001057600080fd5b50611c1d806100206000396000f3fe608060405234801561001057600080fd5b50600436106100df5760003560e01c806388c662aa1161008c578063a327643711610066578063a3276437146101f7578063a6ac970b146101ff578063d4b6b5da14610212578063f2fde38b1461023357600080fd5b806388c662aa146101a85780638da5cb5b146101d35780639a973844146101e457600080fd5b8063715018a6116100bd578063715018a6146101835780638129fc1c1461018d57806385ef65741461019557600080fd5b80630d8e6e2c146100e457806331ca52e31461012c57806370ae92d21461014c575b600080fd5b604080518082018252600381527f322e300000000000000000000000000000000000000000000000000000000000602082015290516101239190611597565b60405180910390f35b61013f61013a3660046115aa565b610246565b60405161012391906115cc565b61017561015a366004611630565b6001600160a01b031660009081526068602052604090205490565b604051908152602001610123565b61018b610340565b005b61018b610354565b61018b6101a336600461168d565b610479565b6101bb6101b6366004611630565b61060b565b6040516001600160a01b039091168152602001610123565b6033546001600160a01b03166101bb565b61018b6101f23660046116ee565b610616565b6101756107b4565b61018b61020d366004611741565b6107c5565b610225610220366004611630565b610a4a565b6040516101239291906117f3565b61018b610241366004611630565b610b3a565b6060811580610266575061025a6065610bc7565b610264838561187c565b115b1561029d576040517f7db3aba700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60008267ffffffffffffffff8111156102b8576102b861188f565b6040519080825280602002602001820160405280156102e1578160200160208202803683370190505b50905060005b83811015610336576103046102fc828761187c565b606590610bd1565b828281518110610316576103166118a5565b6001600160a01b03909216602092830291909101909101526001016102e7565b5090505b92915050565b610348610be4565b6103526000610c3e565b565b600054610100900460ff16158080156103745750600054600160ff909116105b8061038e5750303b15801561038e575060005460ff166001145b6104055760405162461bcd60e51b815260206004820152602e60248201527f496e697469616c697a61626c653a20636f6e747261637420697320616c72656160448201527f647920696e697469616c697a656400000000000000000000000000000000000060648201526084015b60405180910390fd5b6000805460ff191660011790558015610428576000805461ff0019166101001790555b610430610c9d565b8015610476576000805461ff0019169055604051600181527f7f26b83ff96e1f2b6a682f133852f6798a09c465da95921460cefb38474024989060200160405180910390a15b50565b61048284610d10565b61049f5760405163edabc40b60e01b815260040160405180910390fd5b60006104aa85610d1d565b6001600160a01b03861660009081526068602090815260408083205490516bffffffffffffffffffffffff1960608b811b8216948301949094527f2f736574436f6e74726f6c6c65722f000000000000000000000000000000000060348301529289901b9092166043830152602f60f81b6057830152605882015291925090607801604051602081830303815290604052905061054981858585610d45565b61056657604051638baa579f60e01b815260040160405180910390fd5b6001600160a01b038616600090815260686020526040812080549161058a836118bb565b909155505050506001600160a01b03848116600081815260676020908152604091829020805473ffffffffffffffffffffffffffffffffffffffff1916948816948517905581519283528201929092527f9fdb07212c6f92fd298affc4000712177664bc3c4cae5f61098d42da6d05be1e910160405180910390a150505050565b600061033a82610d1d565b61061f83610d10565b61063c5760405163edabc40b60e01b815260040160405180910390fd5b600061064784610d1d565b6001600160a01b03851660009081526068602090815260408083205490516bffffffffffffffffffffffff1960608a901b16928101929092527f2f7265766f6b652f0000000000000000000000000000000000000000000000006034830152603c82015291925090605c0160405160208183030381529060405290506106cf81858585610d45565b6106ec57604051638baa579f60e01b815260040160405180910390fd5b6001600160a01b0385166000908152606860205260408120805491610710836118bb565b9091555050506001600160a01b0384166000908152606760205260408120805473ffffffffffffffffffffffffffffffffffffffff191681559150600182018161075a82826114c2565b50505050610772836065610d7f90919063ffffffff16565b506040516001600160a01b03841681527f9f77920c3de8baaa98d273e8aa75fae382aaa9f7f60f38979137853e5b73ea2c9060200160405180910390a1505050565b60006107c06065610bc7565b905090565b6001600160a01b038516600090815260686020526040902054158015906107f257506107f085610d10565b155b15610829576040517fc1260d5400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60408051606087901b6bffffffffffffffffffffffff19166020820152602f60f81b603482015281516015818303018152603590910190915260005b848110156108be5781868683818110610880576108806118a5565b905060200281019061089291906118d4565b6040516020016108a49392919061191b565b60408051601f198184030181529190529150600101610865565b506001600160a01b0386166000908152606860209081526040918290205491516108ec928492909101611948565b604051602081830303815290604052905061090981848489610d45565b61092657604051638baa579f60e01b815260040160405180910390fd5b6001600160a01b038616600090815260686020526040812080549161094a836118bb565b9091555050506001600160a01b038516600090815260676020526040902060010161097481610d94565b60005b848110156109ec576109e3868683818110610994576109946118a5565b90506020028101906109a691906118d4565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508693925050610e929050565b50600101610977565b506109f686610d10565b610a0757610a05606587610ef4565b505b7fff581cdbc960e17331068dde5ed7aa9097996cee631affe706697292dc33680a868686604051610a3a93929190611993565b60405180910390a1505050505050565b60006060610a5783610d10565b610a745760405163edabc40b60e01b815260040160405180910390fd5b6001600160a01b038316600090815260676020526040812060010190610a98825490565b905060008167ffffffffffffffff811115610ab557610ab561188f565b604051908082528060200260200182016040528015610ae857816020015b6060815260200190600190039081610ad35790505b50905060005b82811015610b2557610b008482610f09565b828281518110610b1257610b126118a5565b6020908102919091010152600101610aee565b50610b2f86610d1d565b969095509350505050565b610b42610be4565b6001600160a01b038116610bbe5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f646472657373000000000000000000000000000000000000000000000000000060648201526084016103fc565b61047681610c3e565b600061033a825490565b6000610bdd8383610fbb565b9392505050565b6033546001600160a01b031633146103525760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e657260448201526064016103fc565b603380546001600160a01b0383811673ffffffffffffffffffffffffffffffffffffffff19831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e090600090a35050565b600054610100900460ff16610d085760405162461bcd60e51b815260206004820152602b60248201527f496e697469616c697a61626c653a20636f6e7472616374206973206e6f74206960448201526a6e697469616c697a696e6760a81b60648201526084016103fc565b610352610fe5565b600061033a606583611059565b6001600160a01b038082166000908152606760205260409020541680610d405750805b919050565b600080610d5386868661107b565b9050826001600160a01b0316816001600160a01b031614915080610d7657600091505b50949350505050565b6000610bdd836001600160a01b0384166110d1565b80548015610e8e57606060005b82811015610e8057836000018181548110610dbe57610dbe6118a5565b906000526020600020018054610dd390611a44565b80601f0160208091040260200160405190810160405280929190818152602001828054610dff90611a44565b8015610e4c5780601f10610e2157610100808354040283529160200191610e4c565b820191906000526020600020905b815481529060010190602001808311610e2f57829003601f168201915b505050505091508360010182604051610e659190611a7e565b90815260405190819003602001902060009055600101610da1565b50610e8c8360006114c2565b505b5050565b6000610e9e83836111c4565b610eec57825460018101845560008481526020902001610ebe8382611ae8565b5082546040516001850190610ed4908590611a7e565b9081526040519081900360200190205550600161033a565b50600061033a565b6000610bdd836001600160a01b0384166111f1565b6060826000018281548110610f2057610f206118a5565b906000526020600020018054610f3590611a44565b80601f0160208091040260200160405190810160405280929190818152602001828054610f6190611a44565b8015610fae5780601f10610f8357610100808354040283529160200191610fae565b820191906000526020600020905b815481529060010190602001808311610f9157829003601f168201915b5050505050905092915050565b6000826000018281548110610fd257610fd26118a5565b9060005260206000200154905092915050565b600054610100900460ff166110505760405162461bcd60e51b815260206004820152602b60248201527f496e697469616c697a61626c653a20636f6e7472616374206973206e6f74206960448201526a6e697469616c697a696e6760a81b60648201526084016103fc565b61035233610c3e565b6001600160a01b03811660009081526001830160205260408120541515610bdd565b600080848051906020012090506110c88185858080601f01602080910402602001604051908101604052809392919081815260200183838082843760009201919091525061123892505050565b95945050505050565b600081815260018301602052604081205480156111ba5760006110f5600183611ba8565b855490915060009061110990600190611ba8565b905081811461116e576000866000018281548110611129576111296118a5565b906000526020600020015490508087600001848154811061114c5761114c6118a5565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061117f5761117f611bbb565b60019003818190600052602060002001600090559055856001016000868152602001908152602001600020600090556001935050505061033a565b600091505061033a565b600082600101826040516111d89190611a7e565b9081526040519081900360200190205415159392505050565b6000818152600183016020526040812054610eec5750815460018181018455600084815260208082209093018490558454848252828601909352604090209190915561033a565b60008060006112478585611254565b9150915061033681611299565b600080825160410361128a5760208301516040840151606085015160001a61127e878285856113fe565b94509450505050611292565b506000905060025b9250929050565b60008160048111156112ad576112ad611bd1565b036112b55750565b60018160048111156112c9576112c9611bd1565b036113165760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e6174757265000000000000000060448201526064016103fc565b600281600481111561132a5761132a611bd1565b036113775760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e6774680060448201526064016103fc565b600381600481111561138b5761138b611bd1565b036104765760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c60448201527f756500000000000000000000000000000000000000000000000000000000000060648201526084016103fc565b6000807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a083111561143557506000905060036114b9565b6040805160008082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa158015611489573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b0381166114b2576000600192509250506114b9565b9150600090505b94509492505050565b508054600082559060005260206000209081019061047691905b808211156114f95760006114f082826114fd565b506001016114dc565b5090565b50805461150990611a44565b6000825580601f10611519575050565b601f01602090049060005260206000209081019061047691905b808211156114f95760008155600101611533565b60005b8381101561156257818101518382015260200161154a565b50506000910152565b60008151808452611583816020860160208601611547565b601f01601f19169290920160200192915050565b602081526000610bdd602083018461156b565b600080604083850312156115bd57600080fd5b50508035926020909101359150565b6020808252825182820181905260009190848201906040850190845b8181101561160d5783516001600160a01b0316835292840192918401916001016115e8565b50909695505050505050565b80356001600160a01b0381168114610d4057600080fd5b60006020828403121561164257600080fd5b610bdd82611619565b60008083601f84011261165d57600080fd5b50813567ffffffffffffffff81111561167557600080fd5b60208301915083602082850101111561129257600080fd5b600080600080606085870312156116a357600080fd5b6116ac85611619565b93506116ba60208601611619565b9250604085013567ffffffffffffffff8111156116d657600080fd5b6116e28782880161164b565b95989497509550505050565b60008060006040848603121561170357600080fd5b61170c84611619565b9250602084013567ffffffffffffffff81111561172857600080fd5b6117348682870161164b565b9497909650939450505050565b60008060008060006060868803121561175957600080fd5b61176286611619565b9450602086013567ffffffffffffffff8082111561177f57600080fd5b818801915088601f83011261179357600080fd5b8135818111156117a257600080fd5b8960208260051b85010111156117b757600080fd5b6020830196508095505060408801359150808211156117d557600080fd5b506117e28882890161164b565b969995985093965092949392505050565b6000604082016001600160a01b0385168352602060408185015281855180845260608601915060608160051b870101935082870160005b8281101561185857605f1988870301845261184686835161156b565b9550928401929084019060010161182a565b509398975050505050505050565b634e487b7160e01b600052601160045260246000fd5b8082018082111561033a5761033a611866565b634e487b7160e01b600052604160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b6000600182016118cd576118cd611866565b5060010190565b6000808335601e198436030181126118eb57600080fd5b83018035915067ffffffffffffffff82111561190657600080fd5b60200191503681900382131561129257600080fd5b6000845161192d818460208901611547565b820183858237602f60f81b9301928352505060010192915050565b6000835161195a818460208801611547565b9190910191825250602001919050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b6000604082016001600160a01b038616835260206040818501528185835260608501905060608660051b86010192508660005b87811015611a3657868503605f190183528135368a9003601e190181126119ec57600080fd5b8901848101903567ffffffffffffffff811115611a0857600080fd5b803603821315611a1757600080fd5b611a2287828461196a565b9650505091830191908301906001016119c6565b509298975050505050505050565b600181811c90821680611a5857607f821691505b602082108103611a7857634e487b7160e01b600052602260045260246000fd5b50919050565b60008251611a90818460208701611547565b9190910192915050565b601f821115610e8c57600081815260208120601f850160051c81016020861015611ac15750805b601f850160051c820191505b81811015611ae057828155600101611acd565b505050505050565b815167ffffffffffffffff811115611b0257611b0261188f565b611b1681611b108454611a44565b84611a9a565b602080601f831160018114611b4b5760008415611b335750858301515b600019600386901b1c1916600185901b178555611ae0565b600085815260208120601f198616915b82811015611b7a57888601518255948401946001909101908401611b5b565b5085821015611b985787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b8181038181111561033a5761033a611866565b634e487b7160e01b600052603160045260246000fd5b634e487b7160e01b600052602160045260246000fdfea26469706673582212200c2b36786fcb56d921bcb6da209dfa42bf64f97a38a7272ff79ec838cbe3b22b64736f6c63430008120033

0x608060405234801561001057600080fd5b50600436106100df5760003560e01c806388c662aa1161008c578063a327643711610066578063a3276437146101f7578063a6ac970b146101ff578063d4b6b5da14610212578063f2fde38b1461023357600080fd5b806388c662aa146101a85780638da5cb5b146101d35780639a973844146101e457600080fd5b8063715018a6116100bd578063715018a6146101835780638129fc1c1461018d57806385ef65741461019557600080fd5b80630d8e6e2c146100e457806331ca52e31461012c57806370ae92d21461014c575b600080fd5b604080518082018252600381527f322e300000000000000000000000000000000000000000000000000000000000602082015290516101239190611597565b60405180910390f35b61013f61013a3660046115aa565b610246565b60405161012391906115cc565b61017561015a366004611630565b6001600160a01b031660009081526068602052604090205490565b604051908152602001610123565b61018b610340565b005b61018b610354565b61018b6101a336600461168d565b610479565b6101bb6101b6366004611630565b61060b565b6040516001600160a01b039091168152602001610123565b6033546001600160a01b03166101bb565b61018b6101f23660046116ee565b610616565b6101756107b4565b61018b61020d366004611741565b6107c5565b610225610220366004611630565b610a4a565b6040516101239291906117f3565b61018b610241366004611630565b610b3a565b6060811580610266575061025a6065610bc7565b610264838561187c565b115b1561029d576040517f7db3aba700000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60008267ffffffffffffffff8111156102b8576102b861188f565b6040519080825280602002602001820160405280156102e1578160200160208202803683370190505b50905060005b83811015610336576103046102fc828761187c565b606590610bd1565b828281518110610316576103166118a5565b6001600160a01b03909216602092830291909101909101526001016102e7565b5090505b92915050565b610348610be4565b6103526000610c3e565b565b600054610100900460ff16158080156103745750600054600160ff909116105b8061038e5750303b15801561038e575060005460ff166001145b6104055760405162461bcd60e51b815260206004820152602e60248201527f496e697469616c697a61626c653a20636f6e747261637420697320616c72656160448201527f647920696e697469616c697a656400000000000000000000000000000000000060648201526084015b60405180910390fd5b6000805460ff191660011790558015610428576000805461ff0019166101001790555b610430610c9d565b8015610476576000805461ff0019169055604051600181527f7f26b83ff96e1f2b6a682f133852f6798a09c465da95921460cefb38474024989060200160405180910390a15b50565b61048284610d10565b61049f5760405163edabc40b60e01b815260040160405180910390fd5b60006104aa85610d1d565b6001600160a01b03861660009081526068602090815260408083205490516bffffffffffffffffffffffff1960608b811b8216948301949094527f2f736574436f6e74726f6c6c65722f000000000000000000000000000000000060348301529289901b9092166043830152602f60f81b6057830152605882015291925090607801604051602081830303815290604052905061054981858585610d45565b61056657604051638baa579f60e01b815260040160405180910390fd5b6001600160a01b038616600090815260686020526040812080549161058a836118bb565b909155505050506001600160a01b03848116600081815260676020908152604091829020805473ffffffffffffffffffffffffffffffffffffffff1916948816948517905581519283528201929092527f9fdb07212c6f92fd298affc4000712177664bc3c4cae5f61098d42da6d05be1e910160405180910390a150505050565b600061033a82610d1d565b61061f83610d10565b61063c5760405163edabc40b60e01b815260040160405180910390fd5b600061064784610d1d565b6001600160a01b03851660009081526068602090815260408083205490516bffffffffffffffffffffffff1960608a901b16928101929092527f2f7265766f6b652f0000000000000000000000000000000000000000000000006034830152603c82015291925090605c0160405160208183030381529060405290506106cf81858585610d45565b6106ec57604051638baa579f60e01b815260040160405180910390fd5b6001600160a01b0385166000908152606860205260408120805491610710836118bb565b9091555050506001600160a01b0384166000908152606760205260408120805473ffffffffffffffffffffffffffffffffffffffff191681559150600182018161075a82826114c2565b50505050610772836065610d7f90919063ffffffff16565b506040516001600160a01b03841681527f9f77920c3de8baaa98d273e8aa75fae382aaa9f7f60f38979137853e5b73ea2c9060200160405180910390a1505050565b60006107c06065610bc7565b905090565b6001600160a01b038516600090815260686020526040902054158015906107f257506107f085610d10565b155b15610829576040517fc1260d5400000000000000000000000000000000000000000000000000000000815260040160405180910390fd5b60408051606087901b6bffffffffffffffffffffffff19166020820152602f60f81b603482015281516015818303018152603590910190915260005b848110156108be5781868683818110610880576108806118a5565b905060200281019061089291906118d4565b6040516020016108a49392919061191b565b60408051601f198184030181529190529150600101610865565b506001600160a01b0386166000908152606860209081526040918290205491516108ec928492909101611948565b604051602081830303815290604052905061090981848489610d45565b61092657604051638baa579f60e01b815260040160405180910390fd5b6001600160a01b038616600090815260686020526040812080549161094a836118bb565b9091555050506001600160a01b038516600090815260676020526040902060010161097481610d94565b60005b848110156109ec576109e3868683818110610994576109946118a5565b90506020028101906109a691906118d4565b8080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508693925050610e929050565b50600101610977565b506109f686610d10565b610a0757610a05606587610ef4565b505b7fff581cdbc960e17331068dde5ed7aa9097996cee631affe706697292dc33680a868686604051610a3a93929190611993565b60405180910390a1505050505050565b60006060610a5783610d10565b610a745760405163edabc40b60e01b815260040160405180910390fd5b6001600160a01b038316600090815260676020526040812060010190610a98825490565b905060008167ffffffffffffffff811115610ab557610ab561188f565b604051908082528060200260200182016040528015610ae857816020015b6060815260200190600190039081610ad35790505b50905060005b82811015610b2557610b008482610f09565b828281518110610b1257610b126118a5565b6020908102919091010152600101610aee565b50610b2f86610d1d565b969095509350505050565b610b42610be4565b6001600160a01b038116610bbe5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f646472657373000000000000000000000000000000000000000000000000000060648201526084016103fc565b61047681610c3e565b600061033a825490565b6000610bdd8383610fbb565b9392505050565b6033546001600160a01b031633146103525760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e657260448201526064016103fc565b603380546001600160a01b0383811673ffffffffffffffffffffffffffffffffffffffff19831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e090600090a35050565b600054610100900460ff16610d085760405162461bcd60e51b815260206004820152602b60248201527f496e697469616c697a61626c653a20636f6e7472616374206973206e6f74206960448201526a6e697469616c697a696e6760a81b60648201526084016103fc565b610352610fe5565b600061033a606583611059565b6001600160a01b038082166000908152606760205260409020541680610d405750805b919050565b600080610d5386868661107b565b9050826001600160a01b0316816001600160a01b031614915080610d7657600091505b50949350505050565b6000610bdd836001600160a01b0384166110d1565b80548015610e8e57606060005b82811015610e8057836000018181548110610dbe57610dbe6118a5565b906000526020600020018054610dd390611a44565b80601f0160208091040260200160405190810160405280929190818152602001828054610dff90611a44565b8015610e4c5780601f10610e2157610100808354040283529160200191610e4c565b820191906000526020600020905b815481529060010190602001808311610e2f57829003601f168201915b505050505091508360010182604051610e659190611a7e565b90815260405190819003602001902060009055600101610da1565b50610e8c8360006114c2565b505b5050565b6000610e9e83836111c4565b610eec57825460018101845560008481526020902001610ebe8382611ae8565b5082546040516001850190610ed4908590611a7e565b9081526040519081900360200190205550600161033a565b50600061033a565b6000610bdd836001600160a01b0384166111f1565b6060826000018281548110610f2057610f206118a5565b906000526020600020018054610f3590611a44565b80601f0160208091040260200160405190810160405280929190818152602001828054610f6190611a44565b8015610fae5780601f10610f8357610100808354040283529160200191610fae565b820191906000526020600020905b815481529060010190602001808311610f9157829003601f168201915b5050505050905092915050565b6000826000018281548110610fd257610fd26118a5565b9060005260206000200154905092915050565b600054610100900460ff166110505760405162461bcd60e51b815260206004820152602b60248201527f496e697469616c697a61626c653a20636f6e7472616374206973206e6f74206960448201526a6e697469616c697a696e6760a81b60648201526084016103fc565b61035233610c3e565b6001600160a01b03811660009081526001830160205260408120541515610bdd565b600080848051906020012090506110c88185858080601f01602080910402602001604051908101604052809392919081815260200183838082843760009201919091525061123892505050565b95945050505050565b600081815260018301602052604081205480156111ba5760006110f5600183611ba8565b855490915060009061110990600190611ba8565b905081811461116e576000866000018281548110611129576111296118a5565b906000526020600020015490508087600001848154811061114c5761114c6118a5565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061117f5761117f611bbb565b60019003818190600052602060002001600090559055856001016000868152602001908152602001600020600090556001935050505061033a565b600091505061033a565b600082600101826040516111d89190611a7e565b9081526040519081900360200190205415159392505050565b6000818152600183016020526040812054610eec5750815460018181018455600084815260208082209093018490558454848252828601909352604090209190915561033a565b60008060006112478585611254565b9150915061033681611299565b600080825160410361128a5760208301516040840151606085015160001a61127e878285856113fe565b94509450505050611292565b506000905060025b9250929050565b60008160048111156112ad576112ad611bd1565b036112b55750565b60018160048111156112c9576112c9611bd1565b036113165760405162461bcd60e51b815260206004820152601860248201527f45434453413a20696e76616c6964207369676e6174757265000000000000000060448201526064016103fc565b600281600481111561132a5761132a611bd1565b036113775760405162461bcd60e51b815260206004820152601f60248201527f45434453413a20696e76616c6964207369676e6174757265206c656e6774680060448201526064016103fc565b600381600481111561138b5761138b611bd1565b036104765760405162461bcd60e51b815260206004820152602260248201527f45434453413a20696e76616c6964207369676e6174757265202773272076616c60448201527f756500000000000000000000000000000000000000000000000000000000000060648201526084016103fc565b6000807f7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a083111561143557506000905060036114b9565b6040805160008082526020820180845289905260ff881692820192909252606081018690526080810185905260019060a0016020604051602081039080840390855afa158015611489573d6000803e3d6000fd5b5050604051601f1901519150506001600160a01b0381166114b2576000600192509250506114b9565b9150600090505b94509492505050565b508054600082559060005260206000209081019061047691905b808211156114f95760006114f082826114fd565b506001016114dc565b5090565b50805461150990611a44565b6000825580601f10611519575050565b601f01602090049060005260206000209081019061047691905b808211156114f95760008155600101611533565b60005b8381101561156257818101518382015260200161154a565b50506000910152565b60008151808452611583816020860160208601611547565b601f01601f19169290920160200192915050565b602081526000610bdd602083018461156b565b600080604083850312156115bd57600080fd5b50508035926020909101359150565b6020808252825182820181905260009190848201906040850190845b8181101561160d5783516001600160a01b0316835292840192918401916001016115e8565b50909695505050505050565b80356001600160a01b0381168114610d4057600080fd5b60006020828403121561164257600080fd5b610bdd82611619565b60008083601f84011261165d57600080fd5b50813567ffffffffffffffff81111561167557600080fd5b60208301915083602082850101111561129257600080fd5b600080600080606085870312156116a357600080fd5b6116ac85611619565b93506116ba60208601611619565b9250604085013567ffffffffffffffff8111156116d657600080fd5b6116e28782880161164b565b95989497509550505050565b60008060006040848603121561170357600080fd5b61170c84611619565b9250602084013567ffffffffffffffff81111561172857600080fd5b6117348682870161164b565b9497909650939450505050565b60008060008060006060868803121561175957600080fd5b61176286611619565b9450602086013567ffffffffffffffff8082111561177f57600080fd5b818801915088601f83011261179357600080fd5b8135818111156117a257600080fd5b8960208260051b85010111156117b757600080fd5b6020830196508095505060408801359150808211156117d557600080fd5b506117e28882890161164b565b969995985093965092949392505050565b6000604082016001600160a01b0385168352602060408185015281855180845260608601915060608160051b870101935082870160005b8281101561185857605f1988870301845261184686835161156b565b9550928401929084019060010161182a565b509398975050505050505050565b634e487b7160e01b600052601160045260246000fd5b8082018082111561033a5761033a611866565b634e487b7160e01b600052604160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b6000600182016118cd576118cd611866565b5060010190565b6000808335601e198436030181126118eb57600080fd5b83018035915067ffffffffffffffff82111561190657600080fd5b60200191503681900382131561129257600080fd5b6000845161192d818460208901611547565b820183858237602f60f81b9301928352505060010192915050565b6000835161195a818460208801611547565b9190910191825250602001919050565b81835281816020850137506000828201602090810191909152601f909101601f19169091010190565b6000604082016001600160a01b038616835260206040818501528185835260608501905060608660051b86010192508660005b87811015611a3657868503605f190183528135368a9003601e190181126119ec57600080fd5b8901848101903567ffffffffffffffff811115611a0857600080fd5b803603821315611a1757600080fd5b611a2287828461196a565b9650505091830191908301906001016119c6565b509298975050505050505050565b600181811c90821680611a5857607f821691505b602082108103611a7857634e487b7160e01b600052602260045260246000fd5b50919050565b60008251611a90818460208701611547565b9190910192915050565b601f821115610e8c57600081815260208120601f850160051c81016020861015611ac15750805b601f850160051c820191505b81811015611ae057828155600101611acd565b505050505050565b815167ffffffffffffffff811115611b0257611b0261188f565b611b1681611b108454611a44565b84611a9a565b602080601f831160018114611b4b5760008415611b335750858301515b600019600386901b1c1916600185901b178555611ae0565b600085815260208120601f198616915b82811015611b7a57888601518255948401946001909101908401611b5b565b5085821015611b985787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b8181038181111561033a5761033a611866565b634e487b7160e01b600052603160045260246000fd5b634e487b7160e01b600052602160045260246000fdfea26469706673582212200c2b36786fcb56d921bcb6da209dfa42bf64f97a38a7272ff79ec838cbe3b22b64736f6c63430008120033