Source Code
Overview
POL Balance
Token Holdings
More Info
ContractCreator
Multichain Info
N/A
Latest 9 from a total of 9 transactions
Transaction Hash |
Method
|
Block
|
From
|
To
|
|||||
---|---|---|---|---|---|---|---|---|---|
Set Merkle Root | 16816201 | 26 days ago | IN | 0 POL | 0.00065465 | ||||
0x0c3a8942 | 16816199 | 26 days ago | IN | 0 POL | 0.00056862 | ||||
Set Merkle Root | 16816070 | 26 days ago | IN | 0 POL | 0.00113438 | ||||
Set Merkle Root | 16792301 | 27 days ago | IN | 0 POL | 0.013093 | ||||
Claim Airdrop | 16791647 | 27 days ago | IN | 0 POL | 0.02960517 | ||||
Set Merkle Root | 16791644 | 27 days ago | IN | 0 POL | 0.01097298 | ||||
Set Merkle Root | 16791304 | 27 days ago | IN | 0 POL | 0.01097298 | ||||
Set Merkle Root | 16791156 | 27 days ago | IN | 0 POL | 0.01214629 | ||||
Set Merkle Root | 16791130 | 27 days ago | IN | 0 POL | 0.01931187 |
Loading...
Loading
Contract Name:
TetradAirdrop
Compiler Version
v0.8.20+commit.a1b79de6
Optimization Enabled:
Yes with 200 runs
Other Settings:
paris EvmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: MIT pragma solidity ^0.8.20; import "@openzeppelin/contracts/token/ERC20/IERC20.sol"; import "@openzeppelin/contracts/access/Ownable.sol"; import "@openzeppelin/contracts/security/ReentrancyGuard.sol"; import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol"; contract TetradAirdrop is Ownable, ReentrancyGuard { IERC20 public tetradToken; bytes32 public merkleRoot; uint256 public constant AIRDROP_AMOUNT = 100 * 10**18; // 100 TETRAD uint256 public constant SOCIAL_SHARE_REWARD = 10 * 10**18; // 10 TETRAD mapping(address => bool) public hasClaimed; mapping(address => bool) public hasClaimedSocialReward; event AirdropClaimed(address indexed user, uint256 amount); event SocialRewardClaimed(address indexed user, uint256 amount); constructor(address _tetradToken) { _transferOwnership(msg.sender); tetradToken = IERC20(_tetradToken); } function setMerkleRoot(bytes32 _merkleRoot) external onlyOwner { merkleRoot = _merkleRoot; } function claimAirdrop(bytes32[] calldata merkleProof) external nonReentrant { require(!hasClaimed[msg.sender], "Already claimed airdrop"); bytes32 leaf = keccak256(abi.encodePacked(msg.sender)); require(MerkleProof.verify(merkleProof, merkleRoot, leaf), "Invalid proof"); hasClaimed[msg.sender] = true; require(tetradToken.transfer(msg.sender, AIRDROP_AMOUNT), "Transfer failed"); emit AirdropClaimed(msg.sender, AIRDROP_AMOUNT); } function claimSocialReward(address user, bytes calldata signature) external nonReentrant { require(!hasClaimedSocialReward[user], "Already claimed social reward"); require(verifySignature(user, signature), "Invalid signature"); hasClaimedSocialReward[user] = true; require(tetradToken.transfer(user, SOCIAL_SHARE_REWARD), "Transfer failed"); emit SocialRewardClaimed(user, SOCIAL_SHARE_REWARD); } function verifySignature(address user, bytes memory signature) internal view returns (bool) { bytes32 messageHash = keccak256(abi.encodePacked( "\x19Ethereum Signed Message:\n32", keccak256(abi.encodePacked(user, "SOCIAL_SHARE")) )); address signer = recoverSigner(messageHash, signature); return signer == owner(); } function recoverSigner(bytes32 messageHash, bytes memory signature) internal pure returns (address) { require(signature.length == 65, "Invalid signature length"); bytes32 r; bytes32 s; uint8 v; assembly { r := mload(add(signature, 32)) s := mload(add(signature, 64)) v := byte(0, mload(add(signature, 96))) } if (v < 27) { v += 27; } require(v == 27 || v == 28, "Invalid signature recovery value"); return ecrecover(messageHash, v, r, s); } }
// 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 (last updated v4.9.0) (security/ReentrancyGuard.sol) pragma solidity ^0.8.0; /** * @dev Contract module that helps prevent reentrant calls to a function. * * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier * available, which can be applied to functions to make sure there are no nested * (reentrant) calls to them. * * Note that because there is a single `nonReentrant` guard, functions marked as * `nonReentrant` may not call one another. This can be worked around by making * those functions `private`, and then adding `external` `nonReentrant` entry * points to them. * * TIP: If you would like to learn more about reentrancy and alternative ways * to protect against it, check out our blog post * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul]. */ abstract contract ReentrancyGuard { // Booleans are more expensive than uint256 or any type that takes up a full // word because each write operation emits an extra SLOAD to first read the // slot's contents, replace the bits taken up by the boolean, and then write // back. This is the compiler's defense against contract upgrades and // pointer aliasing, and it cannot be disabled. // The values being non-zero value makes deployment a bit more expensive, // but in exchange the refund on every call to nonReentrant will be lower in // amount. Since refunds are capped to a percentage of the total // transaction's gas, it is best to keep them low in cases like this one, to // increase the likelihood of the full refund coming into effect. uint256 private constant _NOT_ENTERED = 1; uint256 private constant _ENTERED = 2; uint256 private _status; constructor() { _status = _NOT_ENTERED; } /** * @dev Prevents a contract from calling itself, directly or indirectly. * Calling a `nonReentrant` function from another `nonReentrant` * function is not supported. It is possible to prevent this from happening * by making the `nonReentrant` function external, and making it call a * `private` function that does the actual work. */ modifier nonReentrant() { _nonReentrantBefore(); _; _nonReentrantAfter(); } function _nonReentrantBefore() private { // On the first call to nonReentrant, _status will be _NOT_ENTERED require(_status != _ENTERED, "ReentrancyGuard: reentrant call"); // Any calls to nonReentrant after this point will fail _status = _ENTERED; } function _nonReentrantAfter() private { // By storing the original value once again, a refund is triggered (see // https://eips.ethereum.org/EIPS/eip-2200) _status = _NOT_ENTERED; } /** * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a * `nonReentrant` function in the call stack. */ function _reentrancyGuardEntered() internal view returns (bool) { return _status == _ENTERED; } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/IERC20.sol) pragma solidity ^0.8.0; /** * @dev Interface of the ERC20 standard as defined in the EIP. */ interface IERC20 { /** * @dev Emitted when `value` tokens are moved from one account (`from`) to * another (`to`). * * Note that `value` may be zero. */ event Transfer(address indexed from, address indexed to, uint256 value); /** * @dev Emitted when the allowance of a `spender` for an `owner` is set by * a call to {approve}. `value` is the new allowance. */ event Approval(address indexed owner, address indexed spender, uint256 value); /** * @dev Returns the amount of tokens in existence. */ function totalSupply() external view returns (uint256); /** * @dev Returns the amount of tokens owned by `account`. */ function balanceOf(address account) external view returns (uint256); /** * @dev Moves `amount` tokens from the caller's account to `to`. * * Returns a boolean value indicating whether the operation succeeded. * * Emits a {Transfer} event. */ function transfer(address to, uint256 amount) external returns (bool); /** * @dev Returns the remaining number of tokens that `spender` will be * allowed to spend on behalf of `owner` through {transferFrom}. This is * zero by default. * * This value changes when {approve} or {transferFrom} are called. */ function allowance(address owner, address spender) external view returns (uint256); /** * @dev Sets `amount` as the allowance of `spender` over the caller's tokens. * * Returns a boolean value indicating whether the operation succeeded. * * IMPORTANT: Beware that changing an allowance with this method brings the risk * that someone may use both the old and the new allowance by unfortunate * transaction ordering. One possible solution to mitigate this race * condition is to first reduce the spender's allowance to 0 and set the * desired value afterwards: * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729 * * Emits an {Approval} event. */ function approve(address spender, uint256 amount) external returns (bool); /** * @dev Moves `amount` tokens from `from` to `to` using the * allowance mechanism. `amount` is then deducted from the caller's * allowance. * * Returns a boolean value indicating whether the operation succeeded. * * Emits a {Transfer} event. */ function transferFrom(address from, address to, uint256 amount) external returns (bool); }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.9.4) (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; } function _contextSuffixLength() internal view virtual returns (uint256) { return 0; } }
// 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) } } }
{ "optimizer": { "enabled": true, "runs": 200 }, "evmVersion": "paris", "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } }, "libraries": {} }
[{"inputs":[{"internalType":"address","name":"_tetradToken","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"AirdropClaimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"SocialRewardClaimed","type":"event"},{"inputs":[],"name":"AIRDROP_AMOUNT","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"SOCIAL_SHARE_REWARD","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"merkleProof","type":"bytes32[]"}],"name":"claimAirdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"},{"internalType":"bytes","name":"signature","type":"bytes"}],"name":"claimSocialReward","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hasClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hasClaimedSocialReward","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"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":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"tetradToken","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]
Contract Creation Code
608060405234801561001057600080fd5b50604051610d87380380610d8783398101604081905261002f916100ba565b6100383361006a565b600180556100453361006a565b600280546001600160a01b0319166001600160a01b03929092169190911790556100ea565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6000602082840312156100cc57600080fd5b81516001600160a01b03811681146100e357600080fd5b9392505050565b610c8e806100f96000396000f3fe608060405234801561001057600080fd5b50600436106100b45760003560e01c806378c14d771161007157806378c14d77146101485780637cb647591461016b5780637f3b7baa1461017e5780638da5cb5b1461018d578063d76e385e146101b2578063f2fde38b146101c557600080fd5b80632b5b6872146100b95780632eb4a7ab146100dc57806342ad1ec6146100e557806353223ab0146100fa578063715018a61461010d57806373b2e80e14610115575b600080fd5b6100c968056bc75e2d6310000081565b6040519081526020015b60405180910390f35b6100c960035481565b6100f86100f3366004610aac565b6101d8565b005b6100f8610108366004610b2f565b610400565b6100f8610641565b610138610123366004610ba4565b60046020526000908152604090205460ff1681565b60405190151581526020016100d3565b610138610156366004610ba4565b60056020526000908152604090205460ff1681565b6100f8610179366004610bbf565b610655565b6100c9678ac7230489e8000081565b6000546001600160a01b03165b6040516001600160a01b0390911681526020016100d3565b60025461019a906001600160a01b031681565b6100f86101d3366004610ba4565b610662565b6101e06106db565b6001600160a01b03831660009081526005602052604090205460ff161561024e5760405162461bcd60e51b815260206004820152601d60248201527f416c726561647920636c61696d656420736f6369616c2072657761726400000060448201526064015b60405180910390fd5b61028e8383838080601f01602080910402602001604051908101604052809392919081815260200183838082843760009201919091525061073492505050565b6102ce5760405162461bcd60e51b8152602060048201526011602482015270496e76616c6964207369676e617475726560781b6044820152606401610245565b6001600160a01b0383811660008181526005602052604090819020805460ff19166001179055600254905163a9059cbb60e01b81526004810192909252678ac7230489e8000060248301529091169063a9059cbb906044016020604051808303816000875af1158015610345573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103699190610bd8565b6103a75760405162461bcd60e51b815260206004820152600f60248201526e151c985b9cd9995c8819985a5b1959608a1b6044820152606401610245565b826001600160a01b03167f4e8c72f68e86a5559e139033eadb5185de51966b3329c8f05e8f5e161ca2c6a0678ac7230489e800006040516103ea91815260200190565b60405180910390a26103fb60018055565b505050565b6104086106db565b3360009081526004602052604090205460ff16156104685760405162461bcd60e51b815260206004820152601760248201527f416c726561647920636c61696d65642061697264726f700000000000000000006044820152606401610245565b6040516bffffffffffffffffffffffff193360601b1660208201526000906034016040516020818303038152906040528051906020012090506104e283838080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600354915084905061080c565b61051e5760405162461bcd60e51b815260206004820152600d60248201526c24b73b30b634b210383937b7b360991b6044820152606401610245565b33600081815260046020819052604091829020805460ff19166001179055600254915163a9059cbb60e01b81529081019290925268056bc75e2d6310000060248301526001600160a01b03169063a9059cbb906044016020604051808303816000875af1158015610593573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906105b79190610bd8565b6105f55760405162461bcd60e51b815260206004820152600f60248201526e151c985b9cd9995c8819985a5b1959608a1b6044820152606401610245565b60405168056bc75e2d63100000815233907f650e45f04ef8a0c267b2f78d983913f69ae3a353b2b32de5429307522be0ab559060200160405180910390a25061063d60018055565b5050565b610649610822565b610653600061087c565b565b61065d610822565b600355565b61066a610822565b6001600160a01b0381166106cf5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608401610245565b6106d88161087c565b50565b60026001540361072d5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610245565b6002600155565b604080516bffffffffffffffffffffffff19606085901b1660208201526b534f4349414c5f534841524560a01b603482015260009182910160408051601f198184030181529082905280516020918201207f19457468657265756d205369676e6564204d6573736167653a0a33320000000091830191909152603c820152605c0160405160208183030381529060405280519060200120905060006107d982856108cc565b90506107ed6000546001600160a01b031690565b6001600160a01b0316816001600160a01b031614925050505b92915050565b6000826108198584610a11565b14949350505050565b6000546001600160a01b031633146106535760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610245565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6000815160411461091f5760405162461bcd60e51b815260206004820152601860248201527f496e76616c6964207369676e6174757265206c656e67746800000000000000006044820152606401610245565b60208201516040830151606084015160001a601b81101561094857610945601b82610c10565b90505b8060ff16601b148061095d57508060ff16601c145b6109a95760405162461bcd60e51b815260206004820181905260248201527f496e76616c6964207369676e6174757265207265636f766572792076616c75656044820152606401610245565b60408051600081526020810180835288905260ff831691810191909152606081018490526080810183905260019060a0016020604051602081039080840390855afa1580156109fc573d6000803e3d6000fd5b5050604051601f190151979650505050505050565b600081815b8451811015610a5657610a4282868381518110610a3557610a35610c29565b6020026020010151610a5e565b915080610a4e81610c3f565b915050610a16565b509392505050565b6000818310610a7a576000828152602084905260409020610a89565b60008381526020839052604090205b9392505050565b80356001600160a01b0381168114610aa757600080fd5b919050565b600080600060408486031215610ac157600080fd5b610aca84610a90565b9250602084013567ffffffffffffffff80821115610ae757600080fd5b818601915086601f830112610afb57600080fd5b813581811115610b0a57600080fd5b876020828501011115610b1c57600080fd5b6020830194508093505050509250925092565b60008060208385031215610b4257600080fd5b823567ffffffffffffffff80821115610b5a57600080fd5b818501915085601f830112610b6e57600080fd5b813581811115610b7d57600080fd5b8660208260051b8501011115610b9257600080fd5b60209290920196919550909350505050565b600060208284031215610bb657600080fd5b610a8982610a90565b600060208284031215610bd157600080fd5b5035919050565b600060208284031215610bea57600080fd5b81518015158114610a8957600080fd5b634e487b7160e01b600052601160045260246000fd5b60ff818116838216019081111561080657610806610bfa565b634e487b7160e01b600052603260045260246000fd5b600060018201610c5157610c51610bfa565b506001019056fea2646970667358221220df7d3f7eec04beeb5fd00d72f8a6a44636f4366d41daa408928d1233dcd0464f64736f6c63430008140033000000000000000000000000577f0b9ce6df6a0e48879f4ef5c9734c154e1ddb
Deployed Bytecode
0x608060405234801561001057600080fd5b50600436106100b45760003560e01c806378c14d771161007157806378c14d77146101485780637cb647591461016b5780637f3b7baa1461017e5780638da5cb5b1461018d578063d76e385e146101b2578063f2fde38b146101c557600080fd5b80632b5b6872146100b95780632eb4a7ab146100dc57806342ad1ec6146100e557806353223ab0146100fa578063715018a61461010d57806373b2e80e14610115575b600080fd5b6100c968056bc75e2d6310000081565b6040519081526020015b60405180910390f35b6100c960035481565b6100f86100f3366004610aac565b6101d8565b005b6100f8610108366004610b2f565b610400565b6100f8610641565b610138610123366004610ba4565b60046020526000908152604090205460ff1681565b60405190151581526020016100d3565b610138610156366004610ba4565b60056020526000908152604090205460ff1681565b6100f8610179366004610bbf565b610655565b6100c9678ac7230489e8000081565b6000546001600160a01b03165b6040516001600160a01b0390911681526020016100d3565b60025461019a906001600160a01b031681565b6100f86101d3366004610ba4565b610662565b6101e06106db565b6001600160a01b03831660009081526005602052604090205460ff161561024e5760405162461bcd60e51b815260206004820152601d60248201527f416c726561647920636c61696d656420736f6369616c2072657761726400000060448201526064015b60405180910390fd5b61028e8383838080601f01602080910402602001604051908101604052809392919081815260200183838082843760009201919091525061073492505050565b6102ce5760405162461bcd60e51b8152602060048201526011602482015270496e76616c6964207369676e617475726560781b6044820152606401610245565b6001600160a01b0383811660008181526005602052604090819020805460ff19166001179055600254905163a9059cbb60e01b81526004810192909252678ac7230489e8000060248301529091169063a9059cbb906044016020604051808303816000875af1158015610345573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906103699190610bd8565b6103a75760405162461bcd60e51b815260206004820152600f60248201526e151c985b9cd9995c8819985a5b1959608a1b6044820152606401610245565b826001600160a01b03167f4e8c72f68e86a5559e139033eadb5185de51966b3329c8f05e8f5e161ca2c6a0678ac7230489e800006040516103ea91815260200190565b60405180910390a26103fb60018055565b505050565b6104086106db565b3360009081526004602052604090205460ff16156104685760405162461bcd60e51b815260206004820152601760248201527f416c726561647920636c61696d65642061697264726f700000000000000000006044820152606401610245565b6040516bffffffffffffffffffffffff193360601b1660208201526000906034016040516020818303038152906040528051906020012090506104e283838080602002602001604051908101604052809392919081815260200183836020028082843760009201919091525050600354915084905061080c565b61051e5760405162461bcd60e51b815260206004820152600d60248201526c24b73b30b634b210383937b7b360991b6044820152606401610245565b33600081815260046020819052604091829020805460ff19166001179055600254915163a9059cbb60e01b81529081019290925268056bc75e2d6310000060248301526001600160a01b03169063a9059cbb906044016020604051808303816000875af1158015610593573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906105b79190610bd8565b6105f55760405162461bcd60e51b815260206004820152600f60248201526e151c985b9cd9995c8819985a5b1959608a1b6044820152606401610245565b60405168056bc75e2d63100000815233907f650e45f04ef8a0c267b2f78d983913f69ae3a353b2b32de5429307522be0ab559060200160405180910390a25061063d60018055565b5050565b610649610822565b610653600061087c565b565b61065d610822565b600355565b61066a610822565b6001600160a01b0381166106cf5760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b6064820152608401610245565b6106d88161087c565b50565b60026001540361072d5760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610245565b6002600155565b604080516bffffffffffffffffffffffff19606085901b1660208201526b534f4349414c5f534841524560a01b603482015260009182910160408051601f198184030181529082905280516020918201207f19457468657265756d205369676e6564204d6573736167653a0a33320000000091830191909152603c820152605c0160405160208183030381529060405280519060200120905060006107d982856108cc565b90506107ed6000546001600160a01b031690565b6001600160a01b0316816001600160a01b031614925050505b92915050565b6000826108198584610a11565b14949350505050565b6000546001600160a01b031633146106535760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610245565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6000815160411461091f5760405162461bcd60e51b815260206004820152601860248201527f496e76616c6964207369676e6174757265206c656e67746800000000000000006044820152606401610245565b60208201516040830151606084015160001a601b81101561094857610945601b82610c10565b90505b8060ff16601b148061095d57508060ff16601c145b6109a95760405162461bcd60e51b815260206004820181905260248201527f496e76616c6964207369676e6174757265207265636f766572792076616c75656044820152606401610245565b60408051600081526020810180835288905260ff831691810191909152606081018490526080810183905260019060a0016020604051602081039080840390855afa1580156109fc573d6000803e3d6000fd5b5050604051601f190151979650505050505050565b600081815b8451811015610a5657610a4282868381518110610a3557610a35610c29565b6020026020010151610a5e565b915080610a4e81610c3f565b915050610a16565b509392505050565b6000818310610a7a576000828152602084905260409020610a89565b60008381526020839052604090205b9392505050565b80356001600160a01b0381168114610aa757600080fd5b919050565b600080600060408486031215610ac157600080fd5b610aca84610a90565b9250602084013567ffffffffffffffff80821115610ae757600080fd5b818601915086601f830112610afb57600080fd5b813581811115610b0a57600080fd5b876020828501011115610b1c57600080fd5b6020830194508093505050509250925092565b60008060208385031215610b4257600080fd5b823567ffffffffffffffff80821115610b5a57600080fd5b818501915085601f830112610b6e57600080fd5b813581811115610b7d57600080fd5b8660208260051b8501011115610b9257600080fd5b60209290920196919550909350505050565b600060208284031215610bb657600080fd5b610a8982610a90565b600060208284031215610bd157600080fd5b5035919050565b600060208284031215610bea57600080fd5b81518015158114610a8957600080fd5b634e487b7160e01b600052601160045260246000fd5b60ff818116838216019081111561080657610806610bfa565b634e487b7160e01b600052603260045260246000fd5b600060018201610c5157610c51610bfa565b506001019056fea2646970667358221220df7d3f7eec04beeb5fd00d72f8a6a44636f4366d41daa408928d1233dcd0464f64736f6c63430008140033
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
000000000000000000000000577f0b9ce6df6a0e48879f4ef5c9734c154e1ddb
-----Decoded View---------------
Arg [0] : _tetradToken (address): 0x577f0b9CE6Df6a0e48879F4ef5C9734C154e1ddB
-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 000000000000000000000000577f0b9ce6df6a0e48879f4ef5c9734c154e1ddb
Loading...
Loading
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.