Source Code
Latest 25 from a total of 21,652 transactions
| Transaction Hash |
|
Block
|
From
|
To
|
|||||
|---|---|---|---|---|---|---|---|---|---|
| Claim | 419495805 | 15 days ago | IN | 0 ETH | 0.00000221 | ||||
| Claim | 419486962 | 15 days ago | IN | 0 ETH | 0.00000221 | ||||
| Claim | 419385971 | 15 days ago | IN | 0 ETH | 0.00000221 | ||||
| Claim | 419257583 | 16 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 419256769 | 16 days ago | IN | 0 ETH | 0.00000137 | ||||
| Claim | 419244151 | 16 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 419243350 | 16 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 419242799 | 16 days ago | IN | 0 ETH | 0.00000133 | ||||
| Claim | 419242057 | 16 days ago | IN | 0 ETH | 0.00000187 | ||||
| Claim | 419240893 | 16 days ago | IN | 0 ETH | 0.00000112 | ||||
| Claim | 418839351 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418804107 | 17 days ago | IN | 0 ETH | 0.0000011 | ||||
| Claim | 418797236 | 17 days ago | IN | 0 ETH | 0.0000011 | ||||
| Claim | 418751143 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418751115 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418750466 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418750012 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418749161 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418748424 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418742881 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418741311 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418740316 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418739796 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418739628 | 17 days ago | IN | 0 ETH | 0.00000109 | ||||
| Claim | 418739369 | 17 days ago | IN | 0 ETH | 0.00000109 |
Latest 1 internal transaction
| Parent Transaction Hash | Block | From | To | |||
|---|---|---|---|---|---|---|
| 413648094 | 32 days ago | Contract Creation | 0 ETH |
Cross-Chain Transactions
Loading...
Loading
Similar Match Source Code This contract matches the deployed Bytecode of the Source Code for Contract 0x92111f49...0a268eC5B in Base Mainnet The constructor portion of the code might be different and could alter the actual behaviour of the contract
Contract Name:
TokenDistributor
Compiler Version
v0.8.19+commit.7dd6d404
Optimization Enabled:
Yes with 10000 runs
Other Settings:
paris EvmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: MIT
pragma solidity 0.8.19;
import "@openzeppelin/contracts/security/ReentrancyGuard.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
/**
* @title TokenDistributor - Merkle tree based token distribution contract
* @notice This contract allows users to claim tokens based on merkle proofs
* @dev The contract uses merkle trees to efficiently distribute tokens to a large number of recipients
* Operator sets merkle root, start time and duration, owner withdraws remaining tokens when distribution ends or hasn't started
* Supports both ERC20 tokens and native tokens for distribution
*/
contract TokenDistributor is ReentrancyGuard {
using SafeERC20 for IERC20;
// ============ Constant Variables ============
/// @notice Maximum allowed distribution period duration (365 days)
uint256 public constant MAX_DURATION = 365 days;
/// @notice Maximum allowed start time offset from current time (90 days)
uint256 public constant MAX_START_TIME = 90 days;
/// @notice Native token identifier address
address constant ETH_ADDRESS = 0xEeeeeEeeeEeEeeEeEeEeeEEEeeeeEeeeeeeeEEeE;
// ============ Immutable Variables ============
/// @notice Address of the token being distributed
address public immutable token;
/// @notice Address authorized to set merkle root and start time
address public immutable operator;
/// @notice Address authorized to withdraw remaining tokens
address public immutable owner;
// ============ Mutable State Variables ============
/// @notice Merkle root hash for validating claims
bytes32 public merkleRoot;
/// @notice Total amount of tokens claimed
uint256 public totalClaimed;
/// @notice Timestamp when the distribution starts and ends
/// @dev Packed together to save storage slot and reduce gas cost
uint64 public startTime;
uint64 public endTime;
/// @notice Mapping of addresses to their claimed amounts
mapping(address => uint256) public claimedAmounts;
// ============ Custom Errors ============
// Custom errors for gas-efficient error handling
error AlreadyStarted(); // It has already started
error InvalidAmount(); // Amount cannot be zero
error InvalidDuration(); // Invalid duration
error InvalidProof(); // Invalid merkle proof
error InvalidRoot(); // Invalid merkle root
error InvalidTime(); // Invalid timestamp
error NativeSendFailed(); // Native token send failed
error NativeNotAccepted(); // Native token not accepted
error NoRoot(); // Merkle root not set
error NoTokens(); // No tokens available
error OnlyOperator(); // Only operator can call this function
error OnlyOwner(); // Only owner can call this function
error StartTimeNotSet(); // Start time not set
error TooEarly(); // Distribution hasn't started yet
error TooLate(); // Distribution has ended
// ============ Events ============
/// @notice Emitted when start time and end time are set
event TimeSet(uint64 startTime, uint64 endTime);
/// @notice Emitted when merkle root is set
event MerkleRootSet(bytes32 merkleRoot);
/// @notice Emitted when tokens are claimed
event Claimed(address indexed account, uint256 amount);
/// @notice Emitted when remaining tokens are withdrawn
event Withdrawn(address to, uint256 amount);
// ============ Modifiers ============
/// @notice Restricts access to operator only
modifier onlyOperator() {
if (msg.sender != operator) revert OnlyOperator();
_;
}
/// @notice Restricts access to owner only
modifier onlyOwner() {
if (msg.sender != owner) revert OnlyOwner();
_;
}
// ============ Constructor ============
/// @notice Initialize distributor contract
/// @param _owner Owner address who can withdraw remaining tokens
/// @param _operator Operator address who can set merkle root, start time and duration
/// @param _token Token address to be distributed
constructor(address _owner, address _operator, address _token) {
owner = _owner;
operator = _operator;
token = _token;
}
// ============ Operator Functions ============
/// @notice Set airdrop start time and duration
/// @dev Can be called multiple times by the operator with the following restrictions:
/// 1. Cannot be set if distribution is currently active (between startTime and endTime)
/// 2. Start time must be greater than current block timestamp and not greater than 90 days from current time
/// 3. Duration must be greater than 0 and not greater than MAX_DURATION (365 days)
/// 4. Can be set multiple times before distribution starts or after it ends
/// @param _startTime Start timestamp (must be in the future)
/// @param _duration Distribution period duration in seconds (must be ≤ MAX_DURATION)
function setTime(uint256 _startTime, uint256 _duration) external onlyOperator {
if (_duration == 0 || _duration > MAX_DURATION) revert InvalidDuration();
if (_startTime <= block.timestamp) revert InvalidTime();
if (_startTime > block.timestamp + MAX_START_TIME) revert InvalidTime();
if (block.timestamp >= startTime && block.timestamp <= endTime) revert AlreadyStarted();
startTime = uint64(_startTime);
endTime = uint64(_startTime + _duration);
emit TimeSet(startTime, endTime);
}
/// @notice Set merkle root for claim validation
/// @dev Can be called multiple times by the operator to update the merkle root
/// @param _merkleRoot Merkle root hash
function setMerkleRoot(bytes32 _merkleRoot) external onlyOperator {
if (_merkleRoot == bytes32(0)) revert InvalidRoot();
merkleRoot = _merkleRoot;
emit MerkleRootSet(_merkleRoot);
}
// ============ Owner Functions ============
/// @notice Withdraw remaining tokens after distribution ends
/// @dev Can only be called by owner after the distribution period ends or before any distribution has started
function withdraw() external onlyOwner {
// Check if distribution has ended or not set the startTime
if (block.timestamp <= endTime) revert InvalidTime();
uint256 balance = getBalance();
if (balance == 0) revert NoTokens();
transfer(msg.sender, balance);
emit Withdrawn(msg.sender, balance);
}
// ============ User Functions ============
/// @notice Claim reward tokens using merkle proof
/// @dev Supports single claim (when root set once) or incremental distributions
/// by adjusting maxAmount without resetting previous claims
/// @param maxAmount Maximum claimable amount for this address (from merkle tree)
/// @param proof Merkle proof to validate the claim
function claim(uint256 maxAmount, bytes32[] calldata proof) external nonReentrant {
// Validate distribution state
if (startTime == 0) revert StartTimeNotSet();
if (block.timestamp < startTime) revert TooEarly();
if (block.timestamp > endTime) revert TooLate();
if (merkleRoot == bytes32(0)) revert NoRoot();
// Check if user has already claimed the maximum amount
uint256 claimedAmount = claimedAmounts[msg.sender];
if (maxAmount <= claimedAmount) revert InvalidAmount();
// Verify merkle proof
bytes32 leaf = keccak256(abi.encodePacked(msg.sender, maxAmount));
if (!MerkleProof.verify(proof, merkleRoot, leaf)) revert InvalidProof();
// Calculate pending amount to claim
uint256 pendingAmount;
unchecked {
pendingAmount = maxAmount - claimedAmount; // Safe: maxAmount > claimedAmount verified above
}
// Update claimed amount before transfer (CEI pattern)
claimedAmounts[msg.sender] = maxAmount;
// Update total claimed amount
totalClaimed += pendingAmount;
// Transfer tokens to claimant
transfer(msg.sender, pendingAmount);
emit Claimed(msg.sender, pendingAmount);
}
// ============ Internal Functions ============
/// @notice Get the balance of the contract
function getBalance() internal view returns (uint256) {
if (token == ETH_ADDRESS) {
return address(this).balance;
} else {
return IERC20(token).balanceOf(address(this));
}
}
/// @notice Transfer tokens to a given address
function transfer(address to, uint256 amount) internal {
if (token == ETH_ADDRESS) {
(bool success, ) = payable(to).call{value: amount}("");
if (!success) revert NativeSendFailed();
} else {
IERC20(token).safeTransfer(to, amount);
}
}
// ============ Receive Function ============
/// @dev Accept Native Token
receive() external payable {
if(token != ETH_ADDRESS) revert NativeNotAccepted();
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.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;
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (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 rebuild 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 totalHashes = proofFlags.length;
// Check proof validity.
require(leavesLen + proof.length - 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 for 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) {
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 rebuild 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 totalHashes = proofFlags.length;
// Check proof validity.
require(leavesLen + proof.length - 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 for 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) {
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
// OpenZeppelin Contracts (last updated v4.8.0) (token/ERC20/utils/SafeERC20.sol)
pragma solidity ^0.8.0;
import "../IERC20.sol";
import "../extensions/draft-IERC20Permit.sol";
import "../../../utils/Address.sol";
/**
* @title SafeERC20
* @dev Wrappers around ERC20 operations that throw on failure (when the token
* contract returns false). Tokens that return no value (and instead revert or
* throw on failure) are also supported, non-reverting calls are assumed to be
* successful.
* To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
* which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
*/
library SafeERC20 {
using Address for address;
function safeTransfer(
IERC20 token,
address to,
uint256 value
) internal {
_callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));
}
function safeTransferFrom(
IERC20 token,
address from,
address to,
uint256 value
) internal {
_callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));
}
/**
* @dev Deprecated. This function has issues similar to the ones found in
* {IERC20-approve}, and its usage is discouraged.
*
* Whenever possible, use {safeIncreaseAllowance} and
* {safeDecreaseAllowance} instead.
*/
function safeApprove(
IERC20 token,
address spender,
uint256 value
) internal {
// safeApprove should only be called when setting an initial allowance,
// or when resetting it to zero. To increase and decrease it, use
// 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
require(
(value == 0) || (token.allowance(address(this), spender) == 0),
"SafeERC20: approve from non-zero to non-zero allowance"
);
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));
}
function safeIncreaseAllowance(
IERC20 token,
address spender,
uint256 value
) internal {
uint256 newAllowance = token.allowance(address(this), spender) + value;
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
}
function safeDecreaseAllowance(
IERC20 token,
address spender,
uint256 value
) internal {
unchecked {
uint256 oldAllowance = token.allowance(address(this), spender);
require(oldAllowance >= value, "SafeERC20: decreased allowance below zero");
uint256 newAllowance = oldAllowance - value;
_callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
}
}
function safePermit(
IERC20Permit token,
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) internal {
uint256 nonceBefore = token.nonces(owner);
token.permit(owner, spender, value, deadline, v, r, s);
uint256 nonceAfter = token.nonces(owner);
require(nonceAfter == nonceBefore + 1, "SafeERC20: permit did not succeed");
}
/**
* @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
* on the return value: the return value is optional (but if data is returned, it must not be false).
* @param token The token targeted by the call.
* @param data The call data (encoded using abi.encode or one of its variants).
*/
function _callOptionalReturn(IERC20 token, bytes memory data) private {
// We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
// we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
// the target address contains contract code and also asserts for success in the low-level call.
bytes memory returndata = address(token).functionCall(data, "SafeERC20: low-level call failed");
if (returndata.length > 0) {
// Return data is optional
require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
}
}
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.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 v4.4.1 (token/ERC20/extensions/draft-IERC20Permit.sol)
pragma solidity ^0.8.0;
/**
* @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
* https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
*
* Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
* presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
* need to send a transaction, and thus is not required to hold Ether at all.
*/
interface IERC20Permit {
/**
* @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
* given ``owner``'s signed approval.
*
* IMPORTANT: The same issues {IERC20-approve} has related to transaction
* ordering also apply here.
*
* Emits an {Approval} event.
*
* Requirements:
*
* - `spender` cannot be the zero address.
* - `deadline` must be a timestamp in the future.
* - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
* over the EIP712-formatted function arguments.
* - the signature must use ``owner``'s current nonce (see {nonces}).
*
* For more information on the signature format, see the
* https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
* section].
*/
function permit(
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) external;
/**
* @dev Returns the current nonce for `owner`. This value must be
* included whenever a signature is generated for {permit}.
*
* Every successful call to {permit} increases ``owner``'s nonce by one. This
* prevents a signature from being used multiple times.
*/
function nonces(address owner) external view returns (uint256);
/**
* @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
*/
// solhint-disable-next-line func-name-mixedcase
function DOMAIN_SEPARATOR() external view returns (bytes32);
}// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/Address.sol)
pragma solidity ^0.8.1;
/**
* @dev Collection of functions related to the address type
*/
library Address {
/**
* @dev Returns true if `account` is a contract.
*
* [IMPORTANT]
* ====
* It is unsafe to assume that an address for which this function returns
* false is an externally-owned account (EOA) and not a contract.
*
* Among others, `isContract` will return false for the following
* types of addresses:
*
* - an externally-owned account
* - a contract in construction
* - an address where a contract will be created
* - an address where a contract lived, but was destroyed
* ====
*
* [IMPORTANT]
* ====
* You shouldn't rely on `isContract` to protect against flash loan attacks!
*
* Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
* like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
* constructor.
* ====
*/
function isContract(address account) internal view returns (bool) {
// This method relies on extcodesize/address.code.length, which returns 0
// for contracts in construction, since the code is only stored at the end
// of the constructor execution.
return account.code.length > 0;
}
/**
* @dev Replacement for Solidity's `transfer`: sends `amount` wei to
* `recipient`, forwarding all available gas and reverting on errors.
*
* https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
* of certain opcodes, possibly making contracts go over the 2300 gas limit
* imposed by `transfer`, making them unable to receive funds via
* `transfer`. {sendValue} removes this limitation.
*
* https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more].
*
* IMPORTANT: because control is transferred to `recipient`, care must be
* taken to not create reentrancy vulnerabilities. Consider using
* {ReentrancyGuard} or the
* https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
*/
function sendValue(address payable recipient, uint256 amount) internal {
require(address(this).balance >= amount, "Address: insufficient balance");
(bool success, ) = recipient.call{value: amount}("");
require(success, "Address: unable to send value, recipient may have reverted");
}
/**
* @dev Performs a Solidity function call using a low level `call`. A
* plain `call` is an unsafe replacement for a function call: use this
* function instead.
*
* If `target` reverts with a revert reason, it is bubbled up by this
* function (like regular Solidity function calls).
*
* Returns the raw returned data. To convert to the expected return value,
* use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
*
* Requirements:
*
* - `target` must be a contract.
* - calling `target` with `data` must not revert.
*
* _Available since v3.1._
*/
function functionCall(address target, bytes memory data) internal returns (bytes memory) {
return functionCallWithValue(target, data, 0, "Address: low-level call failed");
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
* `errorMessage` as a fallback revert reason when `target` reverts.
*
* _Available since v3.1._
*/
function functionCall(
address target,
bytes memory data,
string memory errorMessage
) internal returns (bytes memory) {
return functionCallWithValue(target, data, 0, errorMessage);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but also transferring `value` wei to `target`.
*
* Requirements:
*
* - the calling contract must have an ETH balance of at least `value`.
* - the called Solidity function must be `payable`.
*
* _Available since v3.1._
*/
function functionCallWithValue(
address target,
bytes memory data,
uint256 value
) internal returns (bytes memory) {
return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
}
/**
* @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
* with `errorMessage` as a fallback revert reason when `target` reverts.
*
* _Available since v3.1._
*/
function functionCallWithValue(
address target,
bytes memory data,
uint256 value,
string memory errorMessage
) internal returns (bytes memory) {
require(address(this).balance >= value, "Address: insufficient balance for call");
(bool success, bytes memory returndata) = target.call{value: value}(data);
return verifyCallResultFromTarget(target, success, returndata, errorMessage);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but performing a static call.
*
* _Available since v3.3._
*/
function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
return functionStaticCall(target, data, "Address: low-level static call failed");
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
* but performing a static call.
*
* _Available since v3.3._
*/
function functionStaticCall(
address target,
bytes memory data,
string memory errorMessage
) internal view returns (bytes memory) {
(bool success, bytes memory returndata) = target.staticcall(data);
return verifyCallResultFromTarget(target, success, returndata, errorMessage);
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
* but performing a delegate call.
*
* _Available since v3.4._
*/
function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
return functionDelegateCall(target, data, "Address: low-level delegate call failed");
}
/**
* @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
* but performing a delegate call.
*
* _Available since v3.4._
*/
function functionDelegateCall(
address target,
bytes memory data,
string memory errorMessage
) internal returns (bytes memory) {
(bool success, bytes memory returndata) = target.delegatecall(data);
return verifyCallResultFromTarget(target, success, returndata, errorMessage);
}
/**
* @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
* the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
*
* _Available since v4.8._
*/
function verifyCallResultFromTarget(
address target,
bool success,
bytes memory returndata,
string memory errorMessage
) internal view returns (bytes memory) {
if (success) {
if (returndata.length == 0) {
// only check isContract if the call was successful and the return data is empty
// otherwise we already know that it was a contract
require(isContract(target), "Address: call to non-contract");
}
return returndata;
} else {
_revert(returndata, errorMessage);
}
}
/**
* @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
* revert reason or using the provided one.
*
* _Available since v4.3._
*/
function verifyCallResult(
bool success,
bytes memory returndata,
string memory errorMessage
) internal pure returns (bytes memory) {
if (success) {
return returndata;
} else {
_revert(returndata, errorMessage);
}
}
function _revert(bytes memory returndata, string memory errorMessage) private pure {
// Look for revert reason and bubble it up if present
if (returndata.length > 0) {
// The easiest way to bubble the revert reason is using memory via assembly
/// @solidity memory-safe-assembly
assembly {
let returndata_size := mload(returndata)
revert(add(32, returndata), returndata_size)
}
} else {
revert(errorMessage);
}
}
}{
"remappings": [
"@openzeppelin/=lib/openzeppelin-contracts/",
"ds-test/=lib/forge-std/lib/ds-test/src/",
"@forge-std/=lib/forge-std/src/",
"forge-gas-snapshot/=lib/forge-gas-snapshot/src/",
"forge-std/=lib/forge-std/src/",
"openzeppelin-contracts/=lib/openzeppelin-contracts/"
],
"optimizer": {
"enabled": true,
"runs": 10000
},
"metadata": {
"useLiteralContent": true,
"bytecodeHash": "ipfs",
"appendCBOR": true
},
"outputSelection": {
"*": {
"*": [
"evm.bytecode",
"evm.deployedBytecode",
"devdoc",
"userdoc",
"metadata",
"abi"
]
}
},
"evmVersion": "paris",
"viaIR": true
}Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
Contract ABI
API[{"inputs":[{"internalType":"address","name":"_owner","type":"address"},{"internalType":"address","name":"_operator","type":"address"},{"internalType":"address","name":"_token","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AlreadyStarted","type":"error"},{"inputs":[],"name":"InvalidAmount","type":"error"},{"inputs":[],"name":"InvalidDuration","type":"error"},{"inputs":[],"name":"InvalidProof","type":"error"},{"inputs":[],"name":"InvalidRoot","type":"error"},{"inputs":[],"name":"InvalidTime","type":"error"},{"inputs":[],"name":"NativeNotAccepted","type":"error"},{"inputs":[],"name":"NativeSendFailed","type":"error"},{"inputs":[],"name":"NoRoot","type":"error"},{"inputs":[],"name":"NoTokens","type":"error"},{"inputs":[],"name":"OnlyOperator","type":"error"},{"inputs":[],"name":"OnlyOwner","type":"error"},{"inputs":[],"name":"StartTimeNotSet","type":"error"},{"inputs":[],"name":"TooEarly","type":"error"},{"inputs":[],"name":"TooLate","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Claimed","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bytes32","name":"merkleRoot","type":"bytes32"}],"name":"MerkleRootSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint64","name":"startTime","type":"uint64"},{"indexed":false,"internalType":"uint64","name":"endTime","type":"uint64"}],"name":"TimeSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"Withdrawn","type":"event"},{"inputs":[],"name":"MAX_DURATION","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_START_TIME","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"maxAmount","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"claim","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"claimedAmounts","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"endTime","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"merkleRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"operator","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_merkleRoot","type":"bytes32"}],"name":"setMerkleRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_startTime","type":"uint256"},{"internalType":"uint256","name":"_duration","type":"uint256"}],"name":"setTime","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"startTime","outputs":[{"internalType":"uint64","name":"","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"token","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalClaimed","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]Contract Creation Code
0x60e0346100c257601f6110a138819003918201601f19168301916001600160401b038311848410176100c7578084926060946040528339810103126100c257610047816100dd565b906100606040610059602084016100dd565b92016100dd565b91600160005560c05260a052608052604051610faf90816100f2823960805181818160470152818161016c01528181610afe0152610c4f015260a0518181816101eb01528181610478015261059e015260c05181818161042901526105ea0152f35b600080fd5b634e487b7160e01b600052604160045260246000fd5b51906001600160a01b03821682036100c25756fe6080806040526004361015610098575b50361561001b57600080fd5b73eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000160361006e57005b60046040517f1a9fe9f6000000000000000000000000000000000000000000000000000000008152fd5b60003560e01c9081632eb4a7ab14610a93575080632f52ebb7146107005780633197cbb6146106d55780633ccfd60b146105c2578063570ca7351461057157806371417b321461052757806378e97925146104ff5780637cb647591461044d5780638da5cb5b146103fc57806393ad1460146103de578063a0355eca146101d2578063b1724b46146101b3578063d54ad2a1146101955763fc0c546a1461013f573861000f565b3461019057600060031936011261019057602060405173ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b600080fd5b34610190576000600319360112610190576020600254604051908152f35b346101905760006003193601126101905760206040516301e133808152f35b34610190576040600319360112610190576024356004357f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff1633036103b457811580156103a7575b61037d5742811115610324576276a700420180421161034e578111610324576003549167ffffffffffffffff80841642101580610315575b6102eb577fc9b314c8a07c5f83e76af625ee63e74d2ec57a51f82a471792a9799bda395e4093837fffffffffffffffffffffffffffffffff000000000000000000000000000000006fffffffffffffffff00000000000000006102d08560409816968794610aae565b871b1692161717806003558351928352831c166020820152a1005b60046040517f1fbde445000000000000000000000000000000000000000000000000000000008152fd5b50808460401c16421115610267565b60046040517f6f7eac26000000000000000000000000000000000000000000000000000000008152fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b60046040517f76166401000000000000000000000000000000000000000000000000000000008152fd5b506301e13380821161022f565b60046040517f27e1f1e5000000000000000000000000000000000000000000000000000000008152fd5b346101905760006003193601126101905760206040516276a7008152f35b3461019057600060031936011261019057602060405173ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346101905760206003193601126101905760043573ffffffffffffffffffffffffffffffffffffffff7f00000000000000000000000000000000000000000000000000000000000000001633036103b45780156104d5576020817f42cbc405e4dbf1b691e85b9a34b08ecfcf7a9ad9078bf4d645ccfa1fac11c10b92600155604051908152a1005b60046040517f504570e3000000000000000000000000000000000000000000000000000000008152fd5b3461019057600060031936011261019057602067ffffffffffffffff60035416604051908152f35b346101905760206003193601126101905760043573ffffffffffffffffffffffffffffffffffffffff81168091036101905760005260046020526020604060002054604051908152f35b3461019057600060031936011261019057602060405173ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000168152f35b346101905760006003193601126101905773ffffffffffffffffffffffffffffffffffffffff7f00000000000000000000000000000000000000000000000000000000000000001633036106ab5767ffffffffffffffff60035460401c164211156103245761062f610afc565b80156106815761067c816106647f7084f5476618d8e60b11ef0d7d3f06914655adb8793e28ff7f018d4c76d505d59333610c37565b60408051338152602081019290925290918291820190565b0390a1005b60046040517fdf957883000000000000000000000000000000000000000000000000000000008152fd5b60046040517f5fc483c5000000000000000000000000000000000000000000000000000000008152fd5b3461019057600060031936011261019057602067ffffffffffffffff60035460401c16604051908152f35b346101905760406003193601126101905767ffffffffffffffff806024351161019057366023602435011215610190578060243560040135116101905736602480356004013560051b813501011161019057600260005414610a355760026000556003548181168015610a0b5742106109e15760401c811642116109b75760015490811561098d573360005260046020526040600020549081600435111561096357604051903360601b6020830152600435603483015260348252816060810110906060830111176109345760608101604052805160208201206107f360206024356004013560051b0160608401610abb565b602480356004810135606085015201608083015b602480356004013560051b813501018210610924575050916000925b60608301518410156108925760808460051b84010151908181106000146108815760005260205260406000205b927fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff811461034e5760010192610823565b906000526020526040600020610850565b84036108fa57600435033360005260046020526004356040600020556108ba81600254610aae565b6002556108c78133610c37565b6040519081527fd8138f8a3f377c5259ca548e70e4c2de94f129f5a11036a15b69513cba2b426a60203392a26001600055005b60046040517f09bde339000000000000000000000000000000000000000000000000000000008152fd5b8135815260209182019101610807565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b60046040517f2c5211c6000000000000000000000000000000000000000000000000000000008152fd5b60046040517fcccc2700000000000000000000000000000000000000000000000000000000008152fd5b60046040517fecdd1c29000000000000000000000000000000000000000000000000000000008152fd5b60046040517f085de625000000000000000000000000000000000000000000000000000000008152fd5b60046040517f376aab01000000000000000000000000000000000000000000000000000000008152fd5b60646040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152fd5b34610190576000600319360112610190576020906001548152f35b9190820180921161034e57565b90601f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0910116810190811067ffffffffffffffff82111761093457604052565b7f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff1673eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee8103610b5357504790565b6020602491604051928380927f70a082310000000000000000000000000000000000000000000000000000000082523060048301525afa908115610bcd57600091610b9c575090565b906020823d8211610bc5575b81610bb560209383610abb565b81010312610bc257505190565b80fd5b3d9150610ba8565b6040513d6000823e3d90fd5b3d15610c32573d9067ffffffffffffffff82116109345760405191610c2660207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f8401160184610abb565b82523d6000602084013e565b606090565b73ffffffffffffffffffffffffffffffffffffffff907f0000000000000000000000000000000000000000000000000000000000000000821673eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee8103610cd157506000809381938293165af1610c9f610bd9565b5015610ca757565b60046040517fa0c968e7000000000000000000000000000000000000000000000000000000008152fd5b6040517fa9059cbb00000000000000000000000000000000000000000000000000000000602080830191825273ffffffffffffffffffffffffffffffffffffffff94909416602483015260448083019690965294815291939250610d36606483610abb565b60405190604082019282841067ffffffffffffffff85111761093457610d9b936040528583527f5361666545524332303a206c6f772d6c6576656c2063616c6c206661696c656486840152600080958192519082855af1610d95610bd9565b91610e57565b805180610da9575b50505050565b81849181010312610e535782015190811591821503610bc25750610dcf57808080610da3565b608490604051907f08c379a00000000000000000000000000000000000000000000000000000000082526004820152602a60248201527f5361666545524332303a204552433230206f7065726174696f6e20646964206e60448201527f6f742073756363656564000000000000000000000000000000000000000000006064820152fd5b5080fd5b91929015610ed25750815115610e6b575090565b3b15610e745790565b60646040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e74726163740000006044820152fd5b825190915015610ee55750805190602001fd5b604051907f08c379a000000000000000000000000000000000000000000000000000000000825281602080600483015282519283602484015260005b848110610f62575050507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f836000604480968601015201168101030190fd5b818101830151868201604401528593508201610f2156fea264697066735822122017a70506e995657c93978e61c095431a71b154f2464f28041471cfc3c5c4730d64736f6c63430008130033000000000000000000000000ce773990649236733466d8d00786de0686c3b6c10000000000000000000000007a39c61adbd6d4767d858da6ce2ae3253780ea2e0000000000000000000000006fbbbd8bfb1cd3986b1d05e7861a0f62f87db74b
Deployed Bytecode
0x6080806040526004361015610098575b50361561001b57600080fd5b73eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee73ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000006fbbbd8bfb1cd3986b1d05e7861a0f62f87db74b160361006e57005b60046040517f1a9fe9f6000000000000000000000000000000000000000000000000000000008152fd5b60003560e01c9081632eb4a7ab14610a93575080632f52ebb7146107005780633197cbb6146106d55780633ccfd60b146105c2578063570ca7351461057157806371417b321461052757806378e97925146104ff5780637cb647591461044d5780638da5cb5b146103fc57806393ad1460146103de578063a0355eca146101d2578063b1724b46146101b3578063d54ad2a1146101955763fc0c546a1461013f573861000f565b3461019057600060031936011261019057602060405173ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000006fbbbd8bfb1cd3986b1d05e7861a0f62f87db74b168152f35b600080fd5b34610190576000600319360112610190576020600254604051908152f35b346101905760006003193601126101905760206040516301e133808152f35b34610190576040600319360112610190576024356004357f0000000000000000000000007a39c61adbd6d4767d858da6ce2ae3253780ea2e73ffffffffffffffffffffffffffffffffffffffff1633036103b457811580156103a7575b61037d5742811115610324576276a700420180421161034e578111610324576003549167ffffffffffffffff80841642101580610315575b6102eb577fc9b314c8a07c5f83e76af625ee63e74d2ec57a51f82a471792a9799bda395e4093837fffffffffffffffffffffffffffffffff000000000000000000000000000000006fffffffffffffffff00000000000000006102d08560409816968794610aae565b871b1692161717806003558351928352831c166020820152a1005b60046040517f1fbde445000000000000000000000000000000000000000000000000000000008152fd5b50808460401c16421115610267565b60046040517f6f7eac26000000000000000000000000000000000000000000000000000000008152fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b60046040517f76166401000000000000000000000000000000000000000000000000000000008152fd5b506301e13380821161022f565b60046040517f27e1f1e5000000000000000000000000000000000000000000000000000000008152fd5b346101905760006003193601126101905760206040516276a7008152f35b3461019057600060031936011261019057602060405173ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000ce773990649236733466d8d00786de0686c3b6c1168152f35b346101905760206003193601126101905760043573ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000007a39c61adbd6d4767d858da6ce2ae3253780ea2e1633036103b45780156104d5576020817f42cbc405e4dbf1b691e85b9a34b08ecfcf7a9ad9078bf4d645ccfa1fac11c10b92600155604051908152a1005b60046040517f504570e3000000000000000000000000000000000000000000000000000000008152fd5b3461019057600060031936011261019057602067ffffffffffffffff60035416604051908152f35b346101905760206003193601126101905760043573ffffffffffffffffffffffffffffffffffffffff81168091036101905760005260046020526020604060002054604051908152f35b3461019057600060031936011261019057602060405173ffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000007a39c61adbd6d4767d858da6ce2ae3253780ea2e168152f35b346101905760006003193601126101905773ffffffffffffffffffffffffffffffffffffffff7f000000000000000000000000ce773990649236733466d8d00786de0686c3b6c11633036106ab5767ffffffffffffffff60035460401c164211156103245761062f610afc565b80156106815761067c816106647f7084f5476618d8e60b11ef0d7d3f06914655adb8793e28ff7f018d4c76d505d59333610c37565b60408051338152602081019290925290918291820190565b0390a1005b60046040517fdf957883000000000000000000000000000000000000000000000000000000008152fd5b60046040517f5fc483c5000000000000000000000000000000000000000000000000000000008152fd5b3461019057600060031936011261019057602067ffffffffffffffff60035460401c16604051908152f35b346101905760406003193601126101905767ffffffffffffffff806024351161019057366023602435011215610190578060243560040135116101905736602480356004013560051b813501011161019057600260005414610a355760026000556003548181168015610a0b5742106109e15760401c811642116109b75760015490811561098d573360005260046020526040600020549081600435111561096357604051903360601b6020830152600435603483015260348252816060810110906060830111176109345760608101604052805160208201206107f360206024356004013560051b0160608401610abb565b602480356004810135606085015201608083015b602480356004013560051b813501018210610924575050916000925b60608301518410156108925760808460051b84010151908181106000146108815760005260205260406000205b927fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff811461034e5760010192610823565b906000526020526040600020610850565b84036108fa57600435033360005260046020526004356040600020556108ba81600254610aae565b6002556108c78133610c37565b6040519081527fd8138f8a3f377c5259ca548e70e4c2de94f129f5a11036a15b69513cba2b426a60203392a26001600055005b60046040517f09bde339000000000000000000000000000000000000000000000000000000008152fd5b8135815260209182019101610807565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b60046040517f2c5211c6000000000000000000000000000000000000000000000000000000008152fd5b60046040517fcccc2700000000000000000000000000000000000000000000000000000000008152fd5b60046040517fecdd1c29000000000000000000000000000000000000000000000000000000008152fd5b60046040517f085de625000000000000000000000000000000000000000000000000000000008152fd5b60046040517f376aab01000000000000000000000000000000000000000000000000000000008152fd5b60646040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152fd5b34610190576000600319360112610190576020906001548152f35b9190820180921161034e57565b90601f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0910116810190811067ffffffffffffffff82111761093457604052565b7f0000000000000000000000006fbbbd8bfb1cd3986b1d05e7861a0f62f87db74b73ffffffffffffffffffffffffffffffffffffffff1673eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee8103610b5357504790565b6020602491604051928380927f70a082310000000000000000000000000000000000000000000000000000000082523060048301525afa908115610bcd57600091610b9c575090565b906020823d8211610bc5575b81610bb560209383610abb565b81010312610bc257505190565b80fd5b3d9150610ba8565b6040513d6000823e3d90fd5b3d15610c32573d9067ffffffffffffffff82116109345760405191610c2660207fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f8401160184610abb565b82523d6000602084013e565b606090565b73ffffffffffffffffffffffffffffffffffffffff907f0000000000000000000000006fbbbd8bfb1cd3986b1d05e7861a0f62f87db74b821673eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee8103610cd157506000809381938293165af1610c9f610bd9565b5015610ca757565b60046040517fa0c968e7000000000000000000000000000000000000000000000000000000008152fd5b6040517fa9059cbb00000000000000000000000000000000000000000000000000000000602080830191825273ffffffffffffffffffffffffffffffffffffffff94909416602483015260448083019690965294815291939250610d36606483610abb565b60405190604082019282841067ffffffffffffffff85111761093457610d9b936040528583527f5361666545524332303a206c6f772d6c6576656c2063616c6c206661696c656486840152600080958192519082855af1610d95610bd9565b91610e57565b805180610da9575b50505050565b81849181010312610e535782015190811591821503610bc25750610dcf57808080610da3565b608490604051907f08c379a00000000000000000000000000000000000000000000000000000000082526004820152602a60248201527f5361666545524332303a204552433230206f7065726174696f6e20646964206e60448201527f6f742073756363656564000000000000000000000000000000000000000000006064820152fd5b5080fd5b91929015610ed25750815115610e6b575090565b3b15610e745790565b60646040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601d60248201527f416464726573733a2063616c6c20746f206e6f6e2d636f6e74726163740000006044820152fd5b825190915015610ee55750805190602001fd5b604051907f08c379a000000000000000000000000000000000000000000000000000000000825281602080600483015282519283602484015260005b848110610f62575050507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f836000604480968601015201168101030190fd5b818101830151868201604401528593508201610f2156fea264697066735822122017a70506e995657c93978e61c095431a71b154f2464f28041471cfc3c5c4730d64736f6c63430008130033
Loading...
Loading
Loading...
Loading
Loading...
Loading
Net Worth in USD
$1,242.61
Net Worth in ETH
0.420386
Token Allocations
VSN
100.00%
Multichain Portfolio | 35 Chains
| Chain | Token | Portfolio % | Price | Amount | Value |
|---|---|---|---|---|---|
| ARB | 100.00% | $0.062985 | 19,728.66 | $1,242.61 |
Loading...
Loading
Loading...
Loading
Loading...
Loading
[ Download: CSV Export ]
[ 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.