Feature Tip: Add private address tag to any address under My Name Tag !
Overview
ETH Balance
0 ETH
Eth Value
$0.00More Info
Private Name Tags
ContractCreator
Latest 19 from a total of 19 transactions
Transaction Hash |
Method
|
Block
|
From
|
To
|
|||||
---|---|---|---|---|---|---|---|---|---|
Add Blocked Cont... | 17588808 | 542 days ago | IN | 0 ETH | 0.0008471 | ||||
Add Blocked Cont... | 17394742 | 569 days ago | IN | 0 ETH | 0.00159604 | ||||
Add Blocked Cont... | 17381687 | 571 days ago | IN | 0 ETH | 0.00128501 | ||||
Add Blocked Code... | 17036224 | 620 days ago | IN | 0 ETH | 0.00119032 | ||||
Remove Blocked C... | 17033896 | 620 days ago | IN | 0 ETH | 0.00084741 | ||||
Add Blocked Code... | 17021096 | 622 days ago | IN | 0 ETH | 0.00094453 | ||||
Remove Blocked C... | 17021037 | 622 days ago | IN | 0 ETH | 0.00057531 | ||||
Add Blocked Code... | 16992892 | 626 days ago | IN | 0 ETH | 0.00102588 | ||||
Remove Blocked C... | 16807401 | 652 days ago | IN | 0 ETH | 0.00110529 | ||||
Add Blocked Cont... | 16382279 | 711 days ago | IN | 0 ETH | 0.00067839 | ||||
Add Blocked Cont... | 16382279 | 711 days ago | IN | 0 ETH | 0.00071273 | ||||
Add Blocked Cont... | 16382279 | 711 days ago | IN | 0 ETH | 0.00071273 | ||||
Add Blocked Cont... | 16382279 | 711 days ago | IN | 0 ETH | 0.00071273 | ||||
Add Blocked Cont... | 16382279 | 711 days ago | IN | 0 ETH | 0.00071273 | ||||
Add Blocked Cont... | 16382279 | 711 days ago | IN | 0 ETH | 0.00071273 | ||||
Add Blocked Cont... | 16382279 | 711 days ago | IN | 0 ETH | 0.00071273 | ||||
Add Blocked Cont... | 16382278 | 711 days ago | IN | 0 ETH | 0.0007263 | ||||
Add Blocked Cont... | 16382277 | 711 days ago | IN | 0 ETH | 0.00072539 | ||||
Set Is Allowlist... | 16382262 | 711 days ago | IN | 0 ETH | 0.00066594 |
View more zero value Internal Transactions in Advanced View mode
Advanced mode:
Loading...
Loading
Contract Name:
Registry
Compiler Version
v0.8.16+commit.07a7930e
Optimization Enabled:
Yes with 200 runs
Other Settings:
default evmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: MIT pragma solidity ^0.8.9; import {AccessControlEnumerable} from "@openzeppelin/contracts/access/AccessControlEnumerable.sol"; import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol"; import {Allowlist} from "./Allowlist.sol"; import {Blocklist} from "./Blocklist.sol"; import {IRegistry} from "./IRegistry.sol"; /** * A registry of allowlisted and blocklisted addresses and code hashes. This is intended to * be deployed as a shared oracle, and it would be wise to set the `adminAddress` to an entity * that's responsible (e.g. a smart contract that lets creators vote on which addresses/code * hashes to add/remove, and then calls the related functions on this contract). */ contract Registry is AccessControlEnumerable, Allowlist, Blocklist, IRegistry { constructor() { _grantRole(DEFAULT_ADMIN_ROLE, _msgSender()); } /** * @notice Checks against the allowlist and blocklist (depending if either is enabled * or disabled) to see if the operator is allowed. * @dev This function checks the blocklist before checking the allowlist, causing the * blocklist to take precedent over the allowlist. Be aware that if an operator is on * the blocklist and allowlist, it will still be blocked. * @param operator Address of operator */ function isAllowedOperator( address operator ) external view virtual returns (bool) { if (isBlocklistDisabled == false) { bool blocked = _isBlocked(operator); if (blocked) { return false; } } if (isAllowlistDisabled == false) { bool allowed = _isAllowed(operator); return allowed; } return true; } /** * @notice Global killswitch for the allowlist * @param disabled Enables or disables the allowlist */ function setIsAllowlistDisabled( bool disabled ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._setIsAllowlistDisabled(disabled); } /** * @notice Global killswitch for the blocklist * @param disabled Enables or disables the blocklist */ function setIsBlocklistDisabled( bool disabled ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._setIsBlocklistDisabled(disabled); } /** * @notice Checks if the operator is on the blocklist * @param operator Address of operator */ function isBlocked(address operator) external view override(IRegistry, Blocklist) returns (bool) { return _isBlocked(operator); } /** * @notice Checks if the operator is on the allowlist * @param operator Address of operator */ function isAllowed(address operator) external view override(IRegistry, Allowlist) returns (bool) { return _isAllowed(operator); } /** * @notice Adds a contract address to the allowlist * @param contractAddress Address of allowed operator */ function addAllowedContractAddress( address contractAddress ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._addAllowedContractAddress(contractAddress); } /** * @notice Removes a contract address from the allowlist * @param contractAddress Address of allowed operator */ function removeAllowedContractAddress( address contractAddress ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._removeAllowedContractAddress(contractAddress); } /** * @notice Adds a codehash to the allowlist * @param codeHash Code hash of allowed contract */ function addAllowedCodeHash( bytes32 codeHash ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._addAllowedCodeHash(codeHash); } /** * @notice Removes a codehash from the allowlist * @param codeHash Code hash of allowed contract */ function removeAllowedCodeHash( bytes32 codeHash ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._removeAllowedCodeHash(codeHash); } /** * @notice Adds a contract address to the blocklist * @param contractAddress Address of blocked operator */ function addBlockedContractAddress( address contractAddress ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._addBlockedContractAddress(contractAddress); } /** * @notice Removes a contract address from the blocklist * @param contractAddress Address of blocked operator */ function removeBlockedContractAddress( address contractAddress ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._removeBlockedContractAddress(contractAddress); } /** * @notice Adds a codehash to the blocklist * @param codeHash Code hash of blocked contract */ function addBlockedCodeHash( bytes32 codeHash ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._addBlockedCodeHash(codeHash); } /** * @notice Removes a codehash from the blocklist * @param codeHash Code hash of blocked contract */ function removeBlockedCodeHash( bytes32 codeHash ) external virtual onlyRole(DEFAULT_ADMIN_ROLE) { super._removeBlockedCodeHash(codeHash); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.8.0) (access/AccessControl.sol) pragma solidity ^0.8.0; import "./IAccessControl.sol"; import "../utils/Context.sol"; import "../utils/Strings.sol"; import "../utils/introspection/ERC165.sol"; /** * @dev Contract module that allows children to implement role-based access * control mechanisms. This is a lightweight version that doesn't allow enumerating role * members except through off-chain means by accessing the contract event logs. Some * applications may benefit from on-chain enumerability, for those cases see * {AccessControlEnumerable}. * * Roles are referred to by their `bytes32` identifier. These should be exposed * in the external API and be unique. The best way to achieve this is by * using `public constant` hash digests: * * ``` * bytes32 public constant MY_ROLE = keccak256("MY_ROLE"); * ``` * * Roles can be used to represent a set of permissions. To restrict access to a * function call, use {hasRole}: * * ``` * function foo() public { * require(hasRole(MY_ROLE, msg.sender)); * ... * } * ``` * * Roles can be granted and revoked dynamically via the {grantRole} and * {revokeRole} functions. Each role has an associated admin role, and only * accounts that have a role's admin role can call {grantRole} and {revokeRole}. * * By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means * that only accounts with this role will be able to grant or revoke other * roles. More complex role relationships can be created by using * {_setRoleAdmin}. * * WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to * grant and revoke this role. Extra precautions should be taken to secure * accounts that have been granted it. */ abstract contract AccessControl is Context, IAccessControl, ERC165 { struct RoleData { mapping(address => bool) members; bytes32 adminRole; } mapping(bytes32 => RoleData) private _roles; bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00; /** * @dev Modifier that checks that an account has a specific role. Reverts * with a standardized message including the required role. * * The format of the revert reason is given by the following regular expression: * * /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/ * * _Available since v4.1._ */ modifier onlyRole(bytes32 role) { _checkRole(role); _; } /** * @dev See {IERC165-supportsInterface}. */ function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) { return interfaceId == type(IAccessControl).interfaceId || super.supportsInterface(interfaceId); } /** * @dev Returns `true` if `account` has been granted `role`. */ function hasRole(bytes32 role, address account) public view virtual override returns (bool) { return _roles[role].members[account]; } /** * @dev Revert with a standard message if `_msgSender()` is missing `role`. * Overriding this function changes the behavior of the {onlyRole} modifier. * * Format of the revert message is described in {_checkRole}. * * _Available since v4.6._ */ function _checkRole(bytes32 role) internal view virtual { _checkRole(role, _msgSender()); } /** * @dev Revert with a standard message if `account` is missing `role`. * * The format of the revert reason is given by the following regular expression: * * /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/ */ function _checkRole(bytes32 role, address account) internal view virtual { if (!hasRole(role, account)) { revert( string( abi.encodePacked( "AccessControl: account ", Strings.toHexString(account), " is missing role ", Strings.toHexString(uint256(role), 32) ) ) ); } } /** * @dev Returns the admin role that controls `role`. See {grantRole} and * {revokeRole}. * * To change a role's admin, use {_setRoleAdmin}. */ function getRoleAdmin(bytes32 role) public view virtual override returns (bytes32) { return _roles[role].adminRole; } /** * @dev Grants `role` to `account`. * * If `account` had not been already granted `role`, emits a {RoleGranted} * event. * * Requirements: * * - the caller must have ``role``'s admin role. * * May emit a {RoleGranted} event. */ function grantRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) { _grantRole(role, account); } /** * @dev Revokes `role` from `account`. * * If `account` had been granted `role`, emits a {RoleRevoked} event. * * Requirements: * * - the caller must have ``role``'s admin role. * * May emit a {RoleRevoked} event. */ function revokeRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) { _revokeRole(role, account); } /** * @dev Revokes `role` from the calling account. * * Roles are often managed via {grantRole} and {revokeRole}: this function's * purpose is to provide a mechanism for accounts to lose their privileges * if they are compromised (such as when a trusted device is misplaced). * * If the calling account had been revoked `role`, emits a {RoleRevoked} * event. * * Requirements: * * - the caller must be `account`. * * May emit a {RoleRevoked} event. */ function renounceRole(bytes32 role, address account) public virtual override { require(account == _msgSender(), "AccessControl: can only renounce roles for self"); _revokeRole(role, account); } /** * @dev Grants `role` to `account`. * * If `account` had not been already granted `role`, emits a {RoleGranted} * event. Note that unlike {grantRole}, this function doesn't perform any * checks on the calling account. * * May emit a {RoleGranted} event. * * [WARNING] * ==== * This function should only be called from the constructor when setting * up the initial roles for the system. * * Using this function in any other way is effectively circumventing the admin * system imposed by {AccessControl}. * ==== * * NOTE: This function is deprecated in favor of {_grantRole}. */ function _setupRole(bytes32 role, address account) internal virtual { _grantRole(role, account); } /** * @dev Sets `adminRole` as ``role``'s admin role. * * Emits a {RoleAdminChanged} event. */ function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual { bytes32 previousAdminRole = getRoleAdmin(role); _roles[role].adminRole = adminRole; emit RoleAdminChanged(role, previousAdminRole, adminRole); } /** * @dev Grants `role` to `account`. * * Internal function without access restriction. * * May emit a {RoleGranted} event. */ function _grantRole(bytes32 role, address account) internal virtual { if (!hasRole(role, account)) { _roles[role].members[account] = true; emit RoleGranted(role, account, _msgSender()); } } /** * @dev Revokes `role` from `account`. * * Internal function without access restriction. * * May emit a {RoleRevoked} event. */ function _revokeRole(bytes32 role, address account) internal virtual { if (hasRole(role, account)) { _roles[role].members[account] = false; emit RoleRevoked(role, account, _msgSender()); } } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.5.0) (access/AccessControlEnumerable.sol) pragma solidity ^0.8.0; import "./IAccessControlEnumerable.sol"; import "./AccessControl.sol"; import "../utils/structs/EnumerableSet.sol"; /** * @dev Extension of {AccessControl} that allows enumerating the members of each role. */ abstract contract AccessControlEnumerable is IAccessControlEnumerable, AccessControl { using EnumerableSet for EnumerableSet.AddressSet; mapping(bytes32 => EnumerableSet.AddressSet) private _roleMembers; /** * @dev See {IERC165-supportsInterface}. */ function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) { return interfaceId == type(IAccessControlEnumerable).interfaceId || super.supportsInterface(interfaceId); } /** * @dev Returns one of the accounts that have `role`. `index` must be a * value between 0 and {getRoleMemberCount}, non-inclusive. * * Role bearers are not sorted in any particular way, and their ordering may * change at any point. * * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure * you perform all queries on the same block. See the following * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post] * for more information. */ function getRoleMember(bytes32 role, uint256 index) public view virtual override returns (address) { return _roleMembers[role].at(index); } /** * @dev Returns the number of accounts that have `role`. Can be used * together with {getRoleMember} to enumerate all bearers of a role. */ function getRoleMemberCount(bytes32 role) public view virtual override returns (uint256) { return _roleMembers[role].length(); } /** * @dev Overload {_grantRole} to track enumerable memberships */ function _grantRole(bytes32 role, address account) internal virtual override { super._grantRole(role, account); _roleMembers[role].add(account); } /** * @dev Overload {_revokeRole} to track enumerable memberships */ function _revokeRole(bytes32 role, address account) internal virtual override { super._revokeRole(role, account); _roleMembers[role].remove(account); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts v4.4.1 (access/IAccessControl.sol) pragma solidity ^0.8.0; /** * @dev External interface of AccessControl declared to support ERC165 detection. */ interface IAccessControl { /** * @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole` * * `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite * {RoleAdminChanged} not being emitted signaling this. * * _Available since v3.1._ */ event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole); /** * @dev Emitted when `account` is granted `role`. * * `sender` is the account that originated the contract call, an admin role * bearer except when using {AccessControl-_setupRole}. */ event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender); /** * @dev Emitted when `account` is revoked `role`. * * `sender` is the account that originated the contract call: * - if using `revokeRole`, it is the admin role bearer * - if using `renounceRole`, it is the role bearer (i.e. `account`) */ event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender); /** * @dev Returns `true` if `account` has been granted `role`. */ function hasRole(bytes32 role, address account) external view returns (bool); /** * @dev Returns the admin role that controls `role`. See {grantRole} and * {revokeRole}. * * To change a role's admin, use {AccessControl-_setRoleAdmin}. */ function getRoleAdmin(bytes32 role) external view returns (bytes32); /** * @dev Grants `role` to `account`. * * If `account` had not been already granted `role`, emits a {RoleGranted} * event. * * Requirements: * * - the caller must have ``role``'s admin role. */ function grantRole(bytes32 role, address account) external; /** * @dev Revokes `role` from `account`. * * If `account` had been granted `role`, emits a {RoleRevoked} event. * * Requirements: * * - the caller must have ``role``'s admin role. */ function revokeRole(bytes32 role, address account) external; /** * @dev Revokes `role` from the calling account. * * Roles are often managed via {grantRole} and {revokeRole}: this function's * purpose is to provide a mechanism for accounts to lose their privileges * if they are compromised (such as when a trusted device is misplaced). * * If the calling account had been granted `role`, emits a {RoleRevoked} * event. * * Requirements: * * - the caller must be `account`. */ function renounceRole(bytes32 role, address account) external; }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts v4.4.1 (access/IAccessControlEnumerable.sol) pragma solidity ^0.8.0; import "./IAccessControl.sol"; /** * @dev External interface of AccessControlEnumerable declared to support ERC165 detection. */ interface IAccessControlEnumerable is IAccessControl { /** * @dev Returns one of the accounts that have `role`. `index` must be a * value between 0 and {getRoleMemberCount}, non-inclusive. * * Role bearers are not sorted in any particular way, and their ordering may * change at any point. * * WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure * you perform all queries on the same block. See the following * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post] * for more information. */ function getRoleMember(bytes32 role, uint256 index) external view returns (address); /** * @dev Returns the number of accounts that have `role`. Can be used * together with {getRoleMember} to enumerate all bearers of a role. */ function getRoleMemberCount(bytes32 role) external view returns (uint256); }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.7.0) (access/Ownable.sol) pragma solidity ^0.8.0; import "../utils/Context.sol"; /** * @dev Contract module which provides a basic access control mechanism, where * there is an account (an owner) that can be granted exclusive access to * specific functions. * * By default, the owner account will be the one that deploys the contract. This * can later be changed with {transferOwnership}. * * This module is used through inheritance. It will make available the modifier * `onlyOwner`, which can be applied to your functions to restrict their use to * the owner. */ abstract contract Ownable is Context { address private _owner; event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); /** * @dev Initializes the contract setting the deployer as the initial owner. */ constructor() { _transferOwnership(_msgSender()); } /** * @dev Throws if called by any account other than the owner. */ modifier onlyOwner() { _checkOwner(); _; } /** * @dev Returns the address of the current owner. */ function owner() public view virtual returns (address) { return _owner; } /** * @dev Throws if the sender is not the owner. */ function _checkOwner() internal view virtual { require(owner() == _msgSender(), "Ownable: caller is not the owner"); } /** * @dev Leaves the contract without owner. It will not be possible to call * `onlyOwner` functions anymore. Can only be called by the current owner. * * NOTE: Renouncing ownership will leave the contract without an owner, * thereby removing any functionality that is only available to the owner. */ function renounceOwnership() public virtual onlyOwner { _transferOwnership(address(0)); } /** * @dev Transfers ownership of the contract to a new account (`newOwner`). * Can only be called by the current owner. */ function transferOwnership(address newOwner) public virtual onlyOwner { require(newOwner != address(0), "Ownable: new owner is the zero address"); _transferOwnership(newOwner); } /** * @dev Transfers ownership of the contract to a new account (`newOwner`). * Internal function without access restriction. */ function _transferOwnership(address newOwner) internal virtual { address oldOwner = _owner; _owner = newOwner; emit OwnershipTransferred(oldOwner, newOwner); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts v4.4.1 (utils/Context.sol) pragma solidity ^0.8.0; /** * @dev Provides information about the current execution context, including the * sender of the transaction and its data. While these are generally available * via msg.sender and msg.data, they should not be accessed in such a direct * manner, since when dealing with meta-transactions the account sending and * paying for execution may not be the actual sender (as far as an application * is concerned). * * This contract is only required for intermediate, library-like contracts. */ abstract contract Context { function _msgSender() internal view virtual returns (address) { return msg.sender; } function _msgData() internal view virtual returns (bytes calldata) { return msg.data; } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol) pragma solidity ^0.8.0; import "./IERC165.sol"; /** * @dev Implementation of the {IERC165} interface. * * Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check * for the additional interface id that will be supported. For example: * * ```solidity * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) { * return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId); * } * ``` * * Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation. */ abstract contract ERC165 is IERC165 { /** * @dev See {IERC165-supportsInterface}. */ function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) { return interfaceId == type(IERC165).interfaceId; } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol) pragma solidity ^0.8.0; /** * @dev Interface of the ERC165 standard, as defined in the * https://eips.ethereum.org/EIPS/eip-165[EIP]. * * Implementers can declare support of contract interfaces, which can then be * queried by others ({ERC165Checker}). * * For an implementation, see {ERC165}. */ interface IERC165 { /** * @dev Returns true if this contract implements the interface defined by * `interfaceId`. See the corresponding * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section] * to learn more about how these ids are created. * * This function call must use less than 30 000 gas. */ function supportsInterface(bytes4 interfaceId) external view returns (bool); }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.8.0) (utils/math/Math.sol) pragma solidity ^0.8.0; /** * @dev Standard math utilities missing in the Solidity language. */ library Math { enum Rounding { Down, // Toward negative infinity Up, // Toward infinity Zero // Toward zero } /** * @dev Returns the largest of two numbers. */ function max(uint256 a, uint256 b) internal pure returns (uint256) { return a > b ? a : b; } /** * @dev Returns the smallest of two numbers. */ function min(uint256 a, uint256 b) internal pure returns (uint256) { return a < b ? a : b; } /** * @dev Returns the average of two numbers. The result is rounded towards * zero. */ function average(uint256 a, uint256 b) internal pure returns (uint256) { // (a + b) / 2 can overflow. return (a & b) + (a ^ b) / 2; } /** * @dev Returns the ceiling of the division of two numbers. * * This differs from standard division with `/` in that it rounds up instead * of rounding down. */ function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) { // (a + b - 1) / b can overflow on addition, so we distribute. return a == 0 ? 0 : (a - 1) / b + 1; } /** * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0 * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) * with further edits by Uniswap Labs also under MIT license. */ function mulDiv( uint256 x, uint256 y, uint256 denominator ) internal pure returns (uint256 result) { unchecked { // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256 // variables such that product = prod1 * 2^256 + prod0. uint256 prod0; // Least significant 256 bits of the product uint256 prod1; // Most significant 256 bits of the product assembly { let mm := mulmod(x, y, not(0)) prod0 := mul(x, y) prod1 := sub(sub(mm, prod0), lt(mm, prod0)) } // Handle non-overflow cases, 256 by 256 division. if (prod1 == 0) { return prod0 / denominator; } // Make sure the result is less than 2^256. Also prevents denominator == 0. require(denominator > prod1); /////////////////////////////////////////////// // 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/Math.sol"; /** * @dev String operations. */ library Strings { bytes16 private constant _SYMBOLS = "0123456789abcdef"; uint8 private constant _ADDRESS_LENGTH = 20; /** * @dev Converts a `uint256` to its ASCII `string` decimal representation. */ function toString(uint256 value) internal pure returns (string memory) { unchecked { uint256 length = Math.log10(value) + 1; string memory buffer = new string(length); uint256 ptr; /// @solidity memory-safe-assembly assembly { ptr := add(buffer, add(32, length)) } while (true) { ptr--; /// @solidity memory-safe-assembly assembly { mstore8(ptr, byte(mod(value, 10), _SYMBOLS)) } value /= 10; if (value == 0) break; } return buffer; } } /** * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation. */ function toHexString(uint256 value) internal pure returns (string memory) { unchecked { return toHexString(value, Math.log256(value) + 1); } } /** * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length. */ function toHexString(uint256 value, uint256 length) internal pure returns (string memory) { bytes memory buffer = new bytes(2 * length + 2); buffer[0] = "0"; buffer[1] = "x"; for (uint256 i = 2 * length + 1; i > 1; --i) { buffer[i] = _SYMBOLS[value & 0xf]; value >>= 4; } require(value == 0, "Strings: hex length insufficient"); return string(buffer); } /** * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation. */ function toHexString(address addr) internal pure returns (string memory) { return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH); } }
// 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 EnumerableSet { // 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.9; import {IAllowlist} from "./IAllowlist.sol"; /** * A contract that keeps track of a list of allowed addresses and code hashes. This is * intended to be inherited by the Registry contract. */ contract Allowlist is IAllowlist { mapping(address => bool) public allowedContractAddresses; mapping(bytes32 => bool) public allowedCodeHashes; bool public isAllowlistDisabled; event AllowlistDisabled(bool indexed disabled); event AllowedContractAddressAdded(address indexed contractAddress); event AllowedContractAddressRemoved(address indexed contractAddress); event AllowedCodeHashAdded(bytes32 indexed codeHash); event AllowedCodeHashRemoved(bytes32 indexed codeHash); /** * @notice A global killswitch to either enable or disable the allowlist. By default * it is not disabled. * @param disabled Status of the allowlist */ function _setIsAllowlistDisabled( bool disabled ) internal virtual { isAllowlistDisabled = disabled; emit AllowlistDisabled(disabled); } /** * @notice Checks if operator is on the allowlist. If the operator is a contract * it also checks whether or not the codehash is on the allowlist. * Returns true if operator is an externally owned account. * * @param operator Address of operator */ function _isAllowed( address operator ) internal virtual view returns (bool) { if (_isEOA(operator)) { return true; } else if (_isContract(operator)) { if (_isAllowedContractAddress(operator)) { return true; } else { return _isAllowedCodeHash(operator.codehash); } } return false; } modifier onlyAllowlistAllowed(address operator) { if (_isAllowed(operator)) { _; } else { revert IAllowlist.NotAllowlisted(); } } /** * @notice Checks if operator is an externally owned account and not a contract * @param operator Address of operator */ function _isEOA(address operator) internal view returns (bool) { return tx.origin == operator; } /** * Returns true if the operator is a contract. * * NB: This can only positively identify a contract, i.e. if it returns true, * then the caller is definitely a contract. If it returns false, you should * not draw any conclusions, since e.g. code is length 0 if the caller is a * contract's caller (in which case this method returns false, despite the * caller being a contract). * * @param operator Address of operator */ function _isContract(address operator) internal view returns (bool) { return (operator.code.length > 0); } /** * @notice Calls the internal function _isAllowed that checks if operator is on the allowlist. * @param operator - Address of operator */ function isAllowed( address operator ) external view virtual returns (bool) { return _isAllowed(operator); } /** * @notice Add a contract to the allowed registry * @param contractAddress - Contract address */ function _addAllowedContractAddress( address contractAddress ) internal virtual { allowedContractAddresses[contractAddress] = true; emit AllowedContractAddressAdded( contractAddress ); } /** * @notice If the allowlist functionality has been disabled via the global killswitch, * always return true to let all requests through. * @param contractAddress - Contract address */ function _isAllowedContractAddress( address contractAddress ) internal view virtual returns (bool) { if (isAllowlistDisabled) { return true; } return allowedContractAddresses[contractAddress]; } /** * @notice External function that checks if contract address is on the allowlist * @param contractAddress - Contract address */ function isAllowedContractAddress( address contractAddress ) external view virtual returns (bool) { return _isAllowedContractAddress(contractAddress); } /** * @notice Removes a contract from the allowlist * @param contractAddress - Contract address */ function _removeAllowedContractAddress( address contractAddress ) internal virtual { delete allowedContractAddresses[contractAddress]; emit AllowedContractAddressRemoved( contractAddress ); } /** * @notice Adds a codehash to the allowlist * @param codeHash - Contract address */ function _addAllowedCodeHash( bytes32 codeHash ) internal virtual { allowedCodeHashes[codeHash] = true; emit AllowedCodeHashAdded( codeHash ); } /** * @notice If the allowlist functionality has been disabled via the global killswitch, * always return true to let all requests through. * @param codeHash - Code hash */ function _isAllowedCodeHash( bytes32 codeHash ) internal view virtual returns (bool) { if (isAllowlistDisabled) { return true; } return allowedCodeHashes[codeHash]; } /** * @notice External function that checks if the codehash is on the allowlist * @param contractAddress - Contract address */ function isAllowedCodeHash( address contractAddress ) external view virtual returns (bool) { return _isAllowedCodeHash(contractAddress.codehash); } /** * @notice Removes a codehash from the allowlist * @param codeHash - Code hash */ function _removeAllowedCodeHash( bytes32 codeHash ) internal virtual { delete allowedCodeHashes[codeHash]; emit AllowedCodeHashRemoved( codeHash ); } }
// SPDX-License-Identifier: MIT pragma solidity ^0.8.9; import {IBlocklist} from "./IBlocklist.sol"; /** * A contract that keeps track of a list of blocked addresses and code hashes. This is * intended to be inherited by the Registry contract. */ contract Blocklist is IBlocklist { mapping(address => bool) public blockedContractAddresses; mapping(bytes32 => bool) public blockedCodeHashes; bool public isBlocklistDisabled; event BlocklistDisabled(bool indexed disabled); event BlockedContractAddressAdded(address indexed contractAddress); event BlockedContractAddressRemoved(address indexed contractAddress); event BlockedCodeHashAdded(bytes32 indexed codeHash); event BlockedCodeHashRemoved(bytes32 indexed codeHash); /** * @notice A global killswitch to either enable or disable the blocklist. By default * it is not disabled. * @param disabled Status of the blocklist */ function _setIsBlocklistDisabled( bool disabled ) internal virtual { isBlocklistDisabled = disabled; emit BlocklistDisabled(disabled); } /** * @notice External function that Checks if operator is on the blocklist. * @param operator Address of operator */ function isBlocked( address operator ) external virtual view returns (bool) { return _isBlocked(operator); } /** * @notice Checks if operator is on the blocklist. First checks to see if blocklist * is enabled, then checks against the address and code hash. * @param operator Address of operator */ function _isBlocked( address operator ) internal view returns (bool) { if (_isBlockedContractAddress(operator)) { return true; } if (operator.code.length > 0) { if (_isBlockedCodeHash(operator.codehash)) { return true; } } return false; } /** * @notice External function that checks if operator is on the blocklist * @param operator - Contract address */ function isBlockedContractAddress( address operator ) external view returns (bool) { return _isBlockedContractAddress(operator); } /** * @notice Checks if operator is on the blocklist * @param operator - Contract address */ function _isBlockedContractAddress( address operator ) internal view returns (bool) { return blockedContractAddresses[operator]; } /** * @notice External function that checks if codehash is on the blocklist * @param contractAddress - Contract address */ function isBlockedCodeHash( address contractAddress ) external view returns (bool) { return _isBlockedCodeHash(contractAddress.codehash); } /** * @notice Checks if codehash is on the blocklist * @param codeHash - Codehash */ function _isBlockedCodeHash( bytes32 codeHash ) internal view returns (bool) { return blockedCodeHashes[codeHash]; } /** * @notice Add a contract to a registry * @param contractAddress - Contract address */ function _addBlockedContractAddress( address contractAddress ) internal virtual { blockedContractAddresses[contractAddress] = true; emit BlockedContractAddressAdded(contractAddress); } /** * @notice Remove a contract from a registry * @param contractAddress - Contract address */ function _removeBlockedContractAddress( address contractAddress ) internal virtual { delete blockedContractAddresses[contractAddress]; emit BlockedContractAddressRemoved(contractAddress); } /** * @notice Add a codehash to a registry * @param codeHash - Codehash */ function _addBlockedCodeHash( bytes32 codeHash ) internal virtual { blockedCodeHashes[codeHash] = true; emit BlockedCodeHashAdded(codeHash); } /** * @notice Remove a codehash from a registry * @param codeHash - Codehash */ function _removeBlockedCodeHash( bytes32 codeHash ) internal virtual { delete blockedCodeHashes[codeHash]; emit BlockedCodeHashRemoved(codeHash); } }
// SPDX-License-Identifier: MIT pragma solidity ^0.8.9; /** * @dev Interface for the allowlist contract */ interface IAllowlist { /** * @dev Emitted when address trying to transfer is not on the allowlist */ error NotAllowlisted(); /** * @dev Checks whether `operator` is allowed. If operator is a contract * it will also check if the codehash is allowed. */ function isAllowed(address operator) external view returns (bool); /** * @dev Checks whether `operator` is on the allowlist */ function isAllowedContractAddress(address operator) external view returns (bool); /** * @dev Checks whether `contractAddress` codehash is on the allowlist */ function isAllowedCodeHash(address contractAddress) external view returns (bool); }
// SPDX-License-Identifier: MIT pragma solidity ^0.8.9; /** * @dev Interface for the blocklist contract */ interface IBlocklist { /** * @dev Checks whether `operator` is blocked. Checks against both the operator address * along with the operator codehash */ function isBlocked(address operator) external view returns (bool); /** * @dev Checks whether `operator` is blocked. */ function isBlockedContractAddress(address operator) external view returns (bool); /** * @dev Checks whether `contractAddress` codehash is blocked. */ function isBlockedCodeHash(address contractAddress) external view returns (bool); }
// SPDX-License-Identifier: MIT pragma solidity ^0.8.9; /** * @dev Required interface of an Registry compliant contract. */ interface IRegistry { /** * @dev Emitted when address trying to transfer is not allowed on the registry */ error NotAllowed(); /** * @dev Checks whether `operator` is valid on the registry; let the registry * decide across both allow and blocklists. */ function isAllowedOperator(address operator) external view returns (bool); /** * @dev Checks whether `operator` is allowed on the registry */ function isAllowed(address operator) external view returns (bool); /** * @dev Checks whether `operator` is blocked on the registry */ function isBlocked(address operator) external view returns (bool); }
{ "optimizer": { "enabled": true, "runs": 200 }, "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } }, "libraries": {} }
Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"NotAllowed","type":"error"},{"inputs":[],"name":"NotAllowlisted","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"AllowedCodeHashAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"AllowedCodeHashRemoved","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"contractAddress","type":"address"}],"name":"AllowedContractAddressAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"contractAddress","type":"address"}],"name":"AllowedContractAddressRemoved","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bool","name":"disabled","type":"bool"}],"name":"AllowlistDisabled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"BlockedCodeHashAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"BlockedCodeHashRemoved","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"contractAddress","type":"address"}],"name":"BlockedContractAddressAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"contractAddress","type":"address"}],"name":"BlockedContractAddressRemoved","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bool","name":"disabled","type":"bool"}],"name":"BlocklistDisabled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"previousAdminRole","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"newAdminRole","type":"bytes32"}],"name":"RoleAdminChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleGranted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"role","type":"bytes32"},{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"sender","type":"address"}],"name":"RoleRevoked","type":"event"},{"inputs":[],"name":"DEFAULT_ADMIN_ROLE","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"addAllowedCodeHash","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"addAllowedContractAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"addBlockedCodeHash","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"addBlockedContractAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"allowedCodeHashes","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"allowedContractAddresses","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"name":"blockedCodeHashes","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"blockedContractAddresses","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleAdmin","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"getRoleMember","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"}],"name":"getRoleMemberCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"grantRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"hasRole","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"isAllowed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"isAllowedCodeHash","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"isAllowedContractAddress","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"isAllowedOperator","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isAllowlistDisabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"isBlocked","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"isBlockedCodeHash","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"isBlockedContractAddress","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isBlocklistDisabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"removeAllowedCodeHash","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"removeAllowedContractAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"codeHash","type":"bytes32"}],"name":"removeBlockedCodeHash","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"removeBlockedContractAddress","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"renounceRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"role","type":"bytes32"},{"internalType":"address","name":"account","type":"address"}],"name":"revokeRole","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"disabled","type":"bool"}],"name":"setIsAllowlistDisabled","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"disabled","type":"bool"}],"name":"setIsBlocklistDisabled","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"}]
Contract Creation Code
60806040523480156200001157600080fd5b506200001f60003362000025565b6200017b565b6200003c82826200006860201b620007b91760201c565b6000828152600160209081526040909120620000639183906200083d62000109821b17901c565b505050565b6000828152602081815260408083206001600160a01b038516845290915290205460ff1662000105576000828152602081815260408083206001600160a01b03851684529091529020805460ff19166001179055620000c43390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45b5050565b600062000120836001600160a01b03841662000129565b90505b92915050565b6000818152600183016020526040812054620001725750815460018181018455600084815260208082209093018490558454848252828601909352604090209190915562000123565b50600062000123565b611344806200018b6000396000f3fe608060405234801561001057600080fd5b50600436106101f05760003560e01c806389a7eda31161010f578063ca15c873116100a2578063ed78d50f11610071578063ed78d50f1461046f578063efaa372414610482578063f5f9c65f14610495578063fbac3951146104b857600080fd5b8063ca15c87314610423578063d024090314610436578063d547741f14610449578063e18bc08a1461045c57600080fd5b8063a1806b67116100de578063a1806b67146103e2578063a217fddf146103f5578063babcc539146103fd578063c0ff4a691461041057600080fd5b806389a7eda31461036e5780639010d07c1461039157806391d14854146103bc5780639a2496e5146103cf57600080fd5b80634988714611610187578063687e44fd11610156578063687e44fd1461031257806370f3b1c814610335578063843ca23f14610348578063897b0b2e1461035b57600080fd5b806349887146146102b65780635356a70a146102c95780635eec76d0146102dc578063687a0557146102ef57600080fd5b80632f2ff15d116101c35780632f2ff15d1461027057806336568abe1461028357806336d9a3e214610296578063426462f9146102a957600080fd5b806301ffc9a7146101f557806310921f121461021d5780632206ef371461022a578063248a9ca31461023f575b600080fd5b6102086102033660046110a4565b6104cb565b60405190151581526020015b60405180910390f35b6007546102089060ff1681565b61023d6102383660046110ea565b6104f6565b005b61026261024d366004611105565b60009081526020819052604090206001015490565b604051908152602001610214565b61023d61027e36600461111e565b61050e565b61023d61029136600461111e565b610538565b61023d6102a4366004611105565b6105b7565b6004546102089060ff1681565b6102086102c43660046110ea565b6105cb565b61023d6102d736600461114a565b6105ec565b6102086102ea3660046110ea565b610600565b6102086102fd3660046110ea565b60026020526000908152604090205460ff1681565b610208610320366004611105565b60066020526000908152604090205460ff1681565b61023d610343366004611105565b610622565b61023d610356366004611105565b610636565b61023d61036936600461114a565b61064a565b61020861037c366004611105565b60036020526000908152604090205460ff1681565b6103a461039f36600461116c565b61065e565b6040516001600160a01b039091168152602001610214565b6102086103ca36600461111e565b61067d565b6102086103dd3660046110ea565b6106a6565b6102086103f03660046110ea565b6106bb565b610262600081565b61020861040b3660046110ea565b6106c6565b61023d61041e3660046110ea565b6106d1565b610262610431366004611105565b6106e5565b61023d6104443660046110ea565b6106fc565b61023d61045736600461111e565b610710565b61020861046a3660046110ea565b610735565b61023d61047d366004611105565b610786565b61023d6104903660046110ea565b61079a565b6102086104a33660046110ea565b60056020526000908152604090205460ff1681565b6102086104c63660046110ea565b6107ae565b60006001600160e01b03198216635a05180f60e01b14806104f057506104f082610852565b92915050565b600061050181610887565b61050a82610894565b5050565b60008281526020819052604090206001015461052981610887565b61053383836108e0565b505050565b6001600160a01b03811633146105ad5760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084015b60405180910390fd5b61050a8282610902565b60006105c281610887565b61050a82610924565b6001600160a01b03811660009081526005602052604081205460ff166104f0565b60006105f781610887565b61050a82610964565b6001600160a01b0381163f60009081526006602052604081205460ff166104f0565b600061062d81610887565b61050a826109a1565b600061064181610887565b61050a826109e4565b600061065581610887565b61050a82610a24565b60008281526001602052604081206106769083610a61565b9392505050565b6000918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b60006104f0826001600160a01b03163f610a6d565b60006104f082610a99565b60006104f082610ace565b60006106dc81610887565b61050a82610b29565b60008181526001602052604081206104f090610b75565b600061070781610887565b61050a82610b7f565b60008281526020819052604090206001015461072b81610887565b6105338383610902565b60075460009060ff161515810361076457600061075183610bc8565b905080156107625750600092915050565b505b60045460ff16151560000361077e57600061067683610ace565b506001919050565b600061079181610887565b61050a82610c2b565b60006107a581610887565b61050a82610c6e565b60006104f082610bc8565b6107c3828261067d565b61050a576000828152602081815260408083206001600160a01b03851684529091529020805460ff191660011790556107f93390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b6000610676836001600160a01b038416610cb7565b60006001600160e01b03198216637965db0b60e01b14806104f057506301ffc9a760e01b6001600160e01b03198316146104f0565b6108918133610d06565b50565b6001600160a01b038116600081815260026020526040808220805460ff19166001179055517f4e39b933e21853d159392774c02373f2c181dca21651e668d73ce312eeed0d689190a250565b6108ea82826107b9565b6000828152600160205260409020610533908261083d565b61090c8282610d5f565b60008281526001602052604090206105339082610dc4565b600081815260066020526040808220805460ff191690555182917fdad3cf677faf6bc8dad3a52dfdbe15d34e8536bab96cd645b7e337a3c5190c7991a250565b6004805460ff19168215159081179091556040517f43433567237bbb8eb8d0158caa4c9b69b97e8d451adac8a4dd378b11ed327a5790600090a250565b600081815260036020526040808220805460ff191660011790555182917f8b06bb23c5e3b589a3f84814cf6bdc4d8d8702d9abd0796bd8161b3f74cc9bda91a250565b600081815260036020526040808220805460ff191690555182917f686e629df5c948449884774ecadc1012ef67b104e1fcb8c7eb30ca85d5ac483c91a250565b6007805460ff19168215159081179091556040517f12df2e4227585a44fe90a55655585b0ea85a1fe50ef23b533178618358a5563e90600090a250565b60006106768383610dd9565b60045460009060ff1615610a8357506001919050565b5060009081526003602052604090205460ff1690565b60045460009060ff1615610aaf57506001919050565b506001600160a01b031660009081526002602052604090205460ff1690565b60006001600160a01b0382163203610ae857506001919050565b6001600160a01b0382163b15610b2157610b0182610a99565b15610b0e57506001919050565b6104f0826001600160a01b03163f610a6d565b506000919050565b6001600160a01b038116600081815260056020526040808220805460ff19166001179055517f23382e7641c21ea4190ff8d45471a342678a259f0501282e5572711ea3e4b72c9190a250565b60006104f0825490565b6001600160a01b038116600081815260056020526040808220805460ff19169055517fad7e64d41ca834624b79d1548c56f673c19cae45e4b70565fefd0938a63e81299190a250565b6001600160a01b03811660009081526005602052604081205460ff1615610bf157506001919050565b6001600160a01b0382163b15610b21576001600160a01b0382163f60009081526006602052604090205460ff1615610b2157506001919050565b600081815260066020526040808220805460ff191660011790555182917fa99f4e2266779c30a7ad8c04d0cd419d826e9294c982cf0d6cefaa9d7bf0e5fe91a250565b6001600160a01b038116600081815260026020526040808220805460ff19169055517f90cf8018f9a90763638ab70f23b6f0181e810878e828fbbd7a6b8453932f97889190a250565b6000818152600183016020526040812054610cfe575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556104f0565b5060006104f0565b610d10828261067d565b61050a57610d1d81610e03565b610d28836020610e15565b604051602001610d399291906111b2565b60408051601f198184030181529082905262461bcd60e51b82526105a491600401611227565b610d69828261067d565b1561050a576000828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b6000610676836001600160a01b038416610fb1565b6000826000018281548110610df057610df061125a565b9060005260206000200154905092915050565b60606104f06001600160a01b03831660145b60606000610e24836002611286565b610e2f9060026112a5565b67ffffffffffffffff811115610e4757610e476112b8565b6040519080825280601f01601f191660200182016040528015610e71576020820181803683370190505b509050600360fc1b81600081518110610e8c57610e8c61125a565b60200101906001600160f81b031916908160001a905350600f60fb1b81600181518110610ebb57610ebb61125a565b60200101906001600160f81b031916908160001a9053506000610edf846002611286565b610eea9060016112a5565b90505b6001811115610f62576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110610f1e57610f1e61125a565b1a60f81b828281518110610f3457610f3461125a565b60200101906001600160f81b031916908160001a90535060049490941c93610f5b816112ce565b9050610eed565b5083156106765760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e7460448201526064016105a4565b6000818152600183016020526040812054801561109a576000610fd56001836112e5565b8554909150600090610fe9906001906112e5565b905081811461104e5760008660000182815481106110095761100961125a565b906000526020600020015490508087600001848154811061102c5761102c61125a565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061105f5761105f6112f8565b6001900381819060005260206000200160009055905585600101600086815260200190815260200160002060009055600193505050506104f0565b60009150506104f0565b6000602082840312156110b657600080fd5b81356001600160e01b03198116811461067657600080fd5b80356001600160a01b03811681146110e557600080fd5b919050565b6000602082840312156110fc57600080fd5b610676826110ce565b60006020828403121561111757600080fd5b5035919050565b6000806040838503121561113157600080fd5b82359150611141602084016110ce565b90509250929050565b60006020828403121561115c57600080fd5b8135801515811461067657600080fd5b6000806040838503121561117f57600080fd5b50508035926020909101359150565b60005b838110156111a9578181015183820152602001611191565b50506000910152565b7f416363657373436f6e74726f6c3a206163636f756e74200000000000000000008152600083516111ea81601785016020880161118e565b7001034b99036b4b9b9b4b733903937b6329607d1b601791840191820152835161121b81602884016020880161118e565b01602801949350505050565b602081526000825180602084015261124681604085016020870161118e565b601f01601f19169190910160400192915050565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b60008160001904831182151516156112a0576112a0611270565b500290565b808201808211156104f0576104f0611270565b634e487b7160e01b600052604160045260246000fd5b6000816112dd576112dd611270565b506000190190565b818103818111156104f0576104f0611270565b634e487b7160e01b600052603160045260246000fdfea2646970667358221220f5bb5774ee5820ef31f1ac92ee914bb5a6c48346d90b2a1e66c40e72dad23c4c64736f6c63430008100033
Deployed Bytecode
0x608060405234801561001057600080fd5b50600436106101f05760003560e01c806389a7eda31161010f578063ca15c873116100a2578063ed78d50f11610071578063ed78d50f1461046f578063efaa372414610482578063f5f9c65f14610495578063fbac3951146104b857600080fd5b8063ca15c87314610423578063d024090314610436578063d547741f14610449578063e18bc08a1461045c57600080fd5b8063a1806b67116100de578063a1806b67146103e2578063a217fddf146103f5578063babcc539146103fd578063c0ff4a691461041057600080fd5b806389a7eda31461036e5780639010d07c1461039157806391d14854146103bc5780639a2496e5146103cf57600080fd5b80634988714611610187578063687e44fd11610156578063687e44fd1461031257806370f3b1c814610335578063843ca23f14610348578063897b0b2e1461035b57600080fd5b806349887146146102b65780635356a70a146102c95780635eec76d0146102dc578063687a0557146102ef57600080fd5b80632f2ff15d116101c35780632f2ff15d1461027057806336568abe1461028357806336d9a3e214610296578063426462f9146102a957600080fd5b806301ffc9a7146101f557806310921f121461021d5780632206ef371461022a578063248a9ca31461023f575b600080fd5b6102086102033660046110a4565b6104cb565b60405190151581526020015b60405180910390f35b6007546102089060ff1681565b61023d6102383660046110ea565b6104f6565b005b61026261024d366004611105565b60009081526020819052604090206001015490565b604051908152602001610214565b61023d61027e36600461111e565b61050e565b61023d61029136600461111e565b610538565b61023d6102a4366004611105565b6105b7565b6004546102089060ff1681565b6102086102c43660046110ea565b6105cb565b61023d6102d736600461114a565b6105ec565b6102086102ea3660046110ea565b610600565b6102086102fd3660046110ea565b60026020526000908152604090205460ff1681565b610208610320366004611105565b60066020526000908152604090205460ff1681565b61023d610343366004611105565b610622565b61023d610356366004611105565b610636565b61023d61036936600461114a565b61064a565b61020861037c366004611105565b60036020526000908152604090205460ff1681565b6103a461039f36600461116c565b61065e565b6040516001600160a01b039091168152602001610214565b6102086103ca36600461111e565b61067d565b6102086103dd3660046110ea565b6106a6565b6102086103f03660046110ea565b6106bb565b610262600081565b61020861040b3660046110ea565b6106c6565b61023d61041e3660046110ea565b6106d1565b610262610431366004611105565b6106e5565b61023d6104443660046110ea565b6106fc565b61023d61045736600461111e565b610710565b61020861046a3660046110ea565b610735565b61023d61047d366004611105565b610786565b61023d6104903660046110ea565b61079a565b6102086104a33660046110ea565b60056020526000908152604090205460ff1681565b6102086104c63660046110ea565b6107ae565b60006001600160e01b03198216635a05180f60e01b14806104f057506104f082610852565b92915050565b600061050181610887565b61050a82610894565b5050565b60008281526020819052604090206001015461052981610887565b61053383836108e0565b505050565b6001600160a01b03811633146105ad5760405162461bcd60e51b815260206004820152602f60248201527f416363657373436f6e74726f6c3a2063616e206f6e6c792072656e6f756e636560448201526e103937b632b9903337b91039b2b63360891b60648201526084015b60405180910390fd5b61050a8282610902565b60006105c281610887565b61050a82610924565b6001600160a01b03811660009081526005602052604081205460ff166104f0565b60006105f781610887565b61050a82610964565b6001600160a01b0381163f60009081526006602052604081205460ff166104f0565b600061062d81610887565b61050a826109a1565b600061064181610887565b61050a826109e4565b600061065581610887565b61050a82610a24565b60008281526001602052604081206106769083610a61565b9392505050565b6000918252602082815260408084206001600160a01b0393909316845291905290205460ff1690565b60006104f0826001600160a01b03163f610a6d565b60006104f082610a99565b60006104f082610ace565b60006106dc81610887565b61050a82610b29565b60008181526001602052604081206104f090610b75565b600061070781610887565b61050a82610b7f565b60008281526020819052604090206001015461072b81610887565b6105338383610902565b60075460009060ff161515810361076457600061075183610bc8565b905080156107625750600092915050565b505b60045460ff16151560000361077e57600061067683610ace565b506001919050565b600061079181610887565b61050a82610c2b565b60006107a581610887565b61050a82610c6e565b60006104f082610bc8565b6107c3828261067d565b61050a576000828152602081815260408083206001600160a01b03851684529091529020805460ff191660011790556107f93390565b6001600160a01b0316816001600160a01b0316837f2f8788117e7eff1d82e926ec794901d17c78024a50270940304540a733656f0d60405160405180910390a45050565b6000610676836001600160a01b038416610cb7565b60006001600160e01b03198216637965db0b60e01b14806104f057506301ffc9a760e01b6001600160e01b03198316146104f0565b6108918133610d06565b50565b6001600160a01b038116600081815260026020526040808220805460ff19166001179055517f4e39b933e21853d159392774c02373f2c181dca21651e668d73ce312eeed0d689190a250565b6108ea82826107b9565b6000828152600160205260409020610533908261083d565b61090c8282610d5f565b60008281526001602052604090206105339082610dc4565b600081815260066020526040808220805460ff191690555182917fdad3cf677faf6bc8dad3a52dfdbe15d34e8536bab96cd645b7e337a3c5190c7991a250565b6004805460ff19168215159081179091556040517f43433567237bbb8eb8d0158caa4c9b69b97e8d451adac8a4dd378b11ed327a5790600090a250565b600081815260036020526040808220805460ff191660011790555182917f8b06bb23c5e3b589a3f84814cf6bdc4d8d8702d9abd0796bd8161b3f74cc9bda91a250565b600081815260036020526040808220805460ff191690555182917f686e629df5c948449884774ecadc1012ef67b104e1fcb8c7eb30ca85d5ac483c91a250565b6007805460ff19168215159081179091556040517f12df2e4227585a44fe90a55655585b0ea85a1fe50ef23b533178618358a5563e90600090a250565b60006106768383610dd9565b60045460009060ff1615610a8357506001919050565b5060009081526003602052604090205460ff1690565b60045460009060ff1615610aaf57506001919050565b506001600160a01b031660009081526002602052604090205460ff1690565b60006001600160a01b0382163203610ae857506001919050565b6001600160a01b0382163b15610b2157610b0182610a99565b15610b0e57506001919050565b6104f0826001600160a01b03163f610a6d565b506000919050565b6001600160a01b038116600081815260056020526040808220805460ff19166001179055517f23382e7641c21ea4190ff8d45471a342678a259f0501282e5572711ea3e4b72c9190a250565b60006104f0825490565b6001600160a01b038116600081815260056020526040808220805460ff19169055517fad7e64d41ca834624b79d1548c56f673c19cae45e4b70565fefd0938a63e81299190a250565b6001600160a01b03811660009081526005602052604081205460ff1615610bf157506001919050565b6001600160a01b0382163b15610b21576001600160a01b0382163f60009081526006602052604090205460ff1615610b2157506001919050565b600081815260066020526040808220805460ff191660011790555182917fa99f4e2266779c30a7ad8c04d0cd419d826e9294c982cf0d6cefaa9d7bf0e5fe91a250565b6001600160a01b038116600081815260026020526040808220805460ff19169055517f90cf8018f9a90763638ab70f23b6f0181e810878e828fbbd7a6b8453932f97889190a250565b6000818152600183016020526040812054610cfe575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556104f0565b5060006104f0565b610d10828261067d565b61050a57610d1d81610e03565b610d28836020610e15565b604051602001610d399291906111b2565b60408051601f198184030181529082905262461bcd60e51b82526105a491600401611227565b610d69828261067d565b1561050a576000828152602081815260408083206001600160a01b0385168085529252808320805460ff1916905551339285917ff6391f5c32d9c69d2a47ea670b442974b53935d1edc7fd64eb21e047a839171b9190a45050565b6000610676836001600160a01b038416610fb1565b6000826000018281548110610df057610df061125a565b9060005260206000200154905092915050565b60606104f06001600160a01b03831660145b60606000610e24836002611286565b610e2f9060026112a5565b67ffffffffffffffff811115610e4757610e476112b8565b6040519080825280601f01601f191660200182016040528015610e71576020820181803683370190505b509050600360fc1b81600081518110610e8c57610e8c61125a565b60200101906001600160f81b031916908160001a905350600f60fb1b81600181518110610ebb57610ebb61125a565b60200101906001600160f81b031916908160001a9053506000610edf846002611286565b610eea9060016112a5565b90505b6001811115610f62576f181899199a1a9b1b9c1cb0b131b232b360811b85600f1660108110610f1e57610f1e61125a565b1a60f81b828281518110610f3457610f3461125a565b60200101906001600160f81b031916908160001a90535060049490941c93610f5b816112ce565b9050610eed565b5083156106765760405162461bcd60e51b815260206004820181905260248201527f537472696e67733a20686578206c656e67746820696e73756666696369656e7460448201526064016105a4565b6000818152600183016020526040812054801561109a576000610fd56001836112e5565b8554909150600090610fe9906001906112e5565b905081811461104e5760008660000182815481106110095761100961125a565b906000526020600020015490508087600001848154811061102c5761102c61125a565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061105f5761105f6112f8565b6001900381819060005260206000200160009055905585600101600086815260200190815260200160002060009055600193505050506104f0565b60009150506104f0565b6000602082840312156110b657600080fd5b81356001600160e01b03198116811461067657600080fd5b80356001600160a01b03811681146110e557600080fd5b919050565b6000602082840312156110fc57600080fd5b610676826110ce565b60006020828403121561111757600080fd5b5035919050565b6000806040838503121561113157600080fd5b82359150611141602084016110ce565b90509250929050565b60006020828403121561115c57600080fd5b8135801515811461067657600080fd5b6000806040838503121561117f57600080fd5b50508035926020909101359150565b60005b838110156111a9578181015183820152602001611191565b50506000910152565b7f416363657373436f6e74726f6c3a206163636f756e74200000000000000000008152600083516111ea81601785016020880161118e565b7001034b99036b4b9b9b4b733903937b6329607d1b601791840191820152835161121b81602884016020880161118e565b01602801949350505050565b602081526000825180602084015261124681604085016020870161118e565b601f01601f19169190910160400192915050565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b60008160001904831182151516156112a0576112a0611270565b500290565b808201808211156104f0576104f0611270565b634e487b7160e01b600052604160045260246000fd5b6000816112dd576112dd611270565b506000190190565b818103818111156104f0576104f0611270565b634e487b7160e01b600052603160045260246000fdfea2646970667358221220f5bb5774ee5820ef31f1ac92ee914bb5a6c48346d90b2a1e66c40e72dad23c4c64736f6c63430008100033
Loading...
Loading
Loading...
Loading
Multichain Portfolio | 30 Chains
Chain | Token | Portfolio % | Price | Amount | Value |
---|
Loading...
Loading
[ Download: CSV Export ]
A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.