Contract

Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

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

import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";
import "../UnikuraCollectibles/IUnikuraCollectibles.sol";
import "../UnikuraLegacyCollection/IUnikuraLegacyCollection.sol";
import "../UnikuraErrors/UnikuraErrors.sol";
import "./IUnikuraMigration.sol";

contract UnikuraMigration is IUnikuraMigration, Ownable {
    IUnikuraCollectibles public collection;
    bytes32 public merkleRoot = "";
    mapping(address => bool) public minted;

    constructor() {}

    function setCollection(address token) external override onlyOwner {
        if (token == address(0)) {
            revert UnikuraErrors.ZeroAddress();
        }
        emit CollectionChanged(address(collection), token);
        collection = IUnikuraCollectibles(token);
    }

    function setMerkleRoot(bytes32 _merkleRoot) external override onlyOwner {
        emit MerkleRootChanged(merkleRoot, _merkleRoot);
        merkleRoot = _merkleRoot;
    }

    function migrate(address oldToken, uint256 tokenId, bytes32[] memory proof) external override {
        if (minted[oldToken]) {
            revert UnikuraErrors.TokenMinted(1);
        }
        bytes32 leaf = keccak256(abi.encodePacked(oldToken));
        if (!MerkleProof.verify(proof, merkleRoot, leaf)) {
            revert UnikuraErrors.InvalidProof(oldToken);
        }
        IUnikuraLegacyCollection(oldToken).burn(1);
        minted[oldToken] = true;
        collection.mint(msg.sender, tokenId);
        emit Migrate(msg.sender, oldToken, tokenId);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.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. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby disabling any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        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 (last updated v4.9.2) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates merkle trees that are safe
 * against this attack out of the box.
 */
library MerkleProof {
    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Calldata version of {verify}
     *
     * _Available since v4.7._
     */
    function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProofCalldata(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leafs & pre-images are assumed to be sorted.
     *
     * _Available since v4.4._
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Calldata version of {processProof}
     *
     * _Available since v4.7._
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Calldata version of {multiProofVerify}
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * _Available since v4.7._
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Calldata version of {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](totalHashes);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

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

interface IUnikuraCollectibles {
    event BaseURIChanged(string oldBaseURI, string newBaseURI);

    event LogUpdateMinter(address account, bool status);

    event LogUpdateBurner(address account, bool status);

    function initialize(string memory name_, string memory symbol_) external;

    /// @notice onlyOwner
    function setBaseURI(string calldata baseURI_) external;

    function baseURI() external view returns (string memory);

    /// @notice onlyOwner
    function updateMinterRole(address account, bool status) external;

    /// @notice onlyOwner
    function updateBurnerRole(address account, bool status) external;

    /// @notice onlyMinter
    function mint(address to, uint256 tokenId) external;

    /// @notice onlyBurner
    function burn(uint256 tokenId) external;
}

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

interface UnikuraErrors {
    error ZeroAddress();
    error ZeroAmount();
    error EmptyString();
    error CannotRenounceOwnership();
    error NotMinter(address account);
    error NotBurner(address account);
    error NotAdmin(address account);
    error WrongPercentage(uint256 percent);
    error WrongAmount(uint256 amount);
    error TokenMinted(uint256 tokenId);
    error TokenNotMinted(uint256 tokenId);
    error NoOrder(uint256 tokenId, address account);
    error OrderPlaced(uint256 tokenId, address account);
    error InvalidProof(address token);
}

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

interface IUnikuraLegacyCollection {
    function burn(uint256 tokenId) external;
}

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

interface IUnikuraMigration {
    event CollectionChanged(address indexed oldToken, address indexed token);

    event MerkleRootChanged(bytes32 indexed oldMerkleRoot, bytes32 indexed merkleRoot);

    event Migrate(address indexed account, address indexed oldCollection, uint256 indexed tokenId);

    function setCollection(address token) external;

    function setMerkleRoot(bytes32 _merkleRoot) external;

    function migrate(address oldToken, uint256 tokenId, bytes32[] memory proof) external;
}

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"InvalidProof","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"TokenMinted","type":"error"},{"inputs":[],"name":"ZeroAddress","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"oldToken","type":"address"},{"indexed":true,"internalType":"address","name":"token","type":"address"}],"name":"CollectionChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"bytes32","name":"oldMerkleRoot","type":"bytes32"},{"indexed":true,"internalType":"bytes32","name":"merkleRoot","type":"bytes32"}],"name":"MerkleRootChanged","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":true,"internalType":"address","name":"oldCollection","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Migrate","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[],"name":"collection","outputs":[{"internalType":"contract IUnikuraCollectibles","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"oldToken","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"migrate","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"minted","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"setCollection","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

6080604052600060025534801561001557600080fd5b5061001f33610024565b610074565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b610789806100836000396000f3fe608060405234801561001057600080fd5b50600436106100935760003560e01c80637cb64759116100665780637cb64759146101045780637de1e536146101175780638da5cb5b14610142578063d1959f4814610153578063f2fde38b1461016657600080fd5b80631e7269c5146100985780632eb4a7ab146100d0578063715018a6146100e7578063768b5fd5146100f1575b600080fd5b6100bb6100a63660046105f2565b60036020526000908152604090205460ff1681565b60405190151581526020015b60405180910390f35b6100d960025481565b6040519081526020016100c7565b6100ef610179565b005b6100ef6100ff3660046105f2565b61018d565b6100ef61011236600461060d565b610218565b60015461012a906001600160a01b031681565b6040516001600160a01b0390911681526020016100c7565b6000546001600160a01b031661012a565b6100ef61016136600461063c565b610254565b6100ef6101743660046105f2565b61041e565b610181610497565b61018b60006104f1565b565b610195610497565b6001600160a01b0381166101bc5760405163d92e233d60e01b815260040160405180910390fd5b6001546040516001600160a01b038084169216907f2b6ca4cbda96534ab1e865e0e9686ed13f63f1ad6e54185bde7686f0ed726a5e90600090a3600180546001600160a01b0319166001600160a01b0392909216919091179055565b610220610497565b6002546040518291907f123d88ba82600dfc3f219f8885c691b0ff020caa535666874b3f5174973757fe90600090a3600255565b6001600160a01b03831660009081526003602052604090205460ff16156102965760405163f00d282360e01b8152600160048201526024015b60405180910390fd5b6040516bffffffffffffffffffffffff19606085901b1660208201526000906034016040516020818303038152906040528051906020012090506102dd8260025483610541565b61030557604051639a06a13f60e01b81526001600160a01b038516600482015260240161028d565b604051630852cd8d60e31b8152600160048201526001600160a01b038516906342966c6890602401600060405180830381600087803b15801561034757600080fd5b505af115801561035b573d6000803e3d6000fd5b505050506001600160a01b0384811660009081526003602052604090819020805460ff191660019081179091555490516340c10f1960e01b8152336004820152602481018690529116906340c10f1990604401600060405180830381600087803b1580156103c857600080fd5b505af11580156103dc573d6000803e3d6000fd5b50506040518592506001600160a01b038716915033907f18df02dcc52b9c494f391df09661519c0069bd8540141946280399408205ca1a90600090a450505050565b610426610497565b6001600160a01b03811661048b5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b606482015260840161028d565b610494816104f1565b50565b6000546001600160a01b0316331461018b5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161028d565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b60008261054e8584610557565b14949350505050565b600081815b845181101561059c576105888286838151811061057b5761057b610716565b60200260200101516105a4565b9150806105948161072c565b91505061055c565b509392505050565b60008183106105c05760008281526020849052604090206105cf565b60008381526020839052604090205b9392505050565b80356001600160a01b03811681146105ed57600080fd5b919050565b60006020828403121561060457600080fd5b6105cf826105d6565b60006020828403121561061f57600080fd5b5035919050565b634e487b7160e01b600052604160045260246000fd5b60008060006060848603121561065157600080fd5b61065a846105d6565b92506020808501359250604085013567ffffffffffffffff8082111561067f57600080fd5b818701915087601f83011261069357600080fd5b8135818111156106a5576106a5610626565b8060051b604051601f19603f830116810181811085821117156106ca576106ca610626565b60405291825284820192508381018501918a8311156106e857600080fd5b938501935b82851015610706578435845293850193928501926106ed565b8096505050505050509250925092565b634e487b7160e01b600052603260045260246000fd5b60006001820161074c57634e487b7160e01b600052601160045260246000fd5b506001019056fea2646970667358221220104792e2300d528e92c25d9fcea9d3efe5fc84ed0725915f3a8389f013a12d8264736f6c63430008120033

0x608060405234801561001057600080fd5b50600436106100935760003560e01c80637cb64759116100665780637cb64759146101045780637de1e536146101175780638da5cb5b14610142578063d1959f4814610153578063f2fde38b1461016657600080fd5b80631e7269c5146100985780632eb4a7ab146100d0578063715018a6146100e7578063768b5fd5146100f1575b600080fd5b6100bb6100a63660046105f2565b60036020526000908152604090205460ff1681565b60405190151581526020015b60405180910390f35b6100d960025481565b6040519081526020016100c7565b6100ef610179565b005b6100ef6100ff3660046105f2565b61018d565b6100ef61011236600461060d565b610218565b60015461012a906001600160a01b031681565b6040516001600160a01b0390911681526020016100c7565b6000546001600160a01b031661012a565b6100ef61016136600461063c565b610254565b6100ef6101743660046105f2565b61041e565b610181610497565b61018b60006104f1565b565b610195610497565b6001600160a01b0381166101bc5760405163d92e233d60e01b815260040160405180910390fd5b6001546040516001600160a01b038084169216907f2b6ca4cbda96534ab1e865e0e9686ed13f63f1ad6e54185bde7686f0ed726a5e90600090a3600180546001600160a01b0319166001600160a01b0392909216919091179055565b610220610497565b6002546040518291907f123d88ba82600dfc3f219f8885c691b0ff020caa535666874b3f5174973757fe90600090a3600255565b6001600160a01b03831660009081526003602052604090205460ff16156102965760405163f00d282360e01b8152600160048201526024015b60405180910390fd5b6040516bffffffffffffffffffffffff19606085901b1660208201526000906034016040516020818303038152906040528051906020012090506102dd8260025483610541565b61030557604051639a06a13f60e01b81526001600160a01b038516600482015260240161028d565b604051630852cd8d60e31b8152600160048201526001600160a01b038516906342966c6890602401600060405180830381600087803b15801561034757600080fd5b505af115801561035b573d6000803e3d6000fd5b505050506001600160a01b0384811660009081526003602052604090819020805460ff191660019081179091555490516340c10f1960e01b8152336004820152602481018690529116906340c10f1990604401600060405180830381600087803b1580156103c857600080fd5b505af11580156103dc573d6000803e3d6000fd5b50506040518592506001600160a01b038716915033907f18df02dcc52b9c494f391df09661519c0069bd8540141946280399408205ca1a90600090a450505050565b610426610497565b6001600160a01b03811661048b5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b606482015260840161028d565b610494816104f1565b50565b6000546001600160a01b0316331461018b5760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e6572604482015260640161028d565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b60008261054e8584610557565b14949350505050565b600081815b845181101561059c576105888286838151811061057b5761057b610716565b60200260200101516105a4565b9150806105948161072c565b91505061055c565b509392505050565b60008183106105c05760008281526020849052604090206105cf565b60008381526020839052604090205b9392505050565b80356001600160a01b03811681146105ed57600080fd5b919050565b60006020828403121561060457600080fd5b6105cf826105d6565b60006020828403121561061f57600080fd5b5035919050565b634e487b7160e01b600052604160045260246000fd5b60008060006060848603121561065157600080fd5b61065a846105d6565b92506020808501359250604085013567ffffffffffffffff8082111561067f57600080fd5b818701915087601f83011261069357600080fd5b8135818111156106a5576106a5610626565b8060051b604051601f19603f830116810181811085821117156106ca576106ca610626565b60405291825284820192508381018501918a8311156106e857600080fd5b938501935b82851015610706578435845293850193928501926106ed565b8096505050505050509250925092565b634e487b7160e01b600052603260045260246000fd5b60006001820161074c57634e487b7160e01b600052601160045260246000fd5b506001019056fea2646970667358221220104792e2300d528e92c25d9fcea9d3efe5fc84ed0725915f3a8389f013a12d8264736f6c63430008120033