Address

0xA420872a164644469C6a5dA5C1B2740FD3f13667

0.52275803531399892 ETH

Confirmed
Balance0.52275803531399892 ETH
Transactions661
Non-contract Transactions650
Internal Transactions0
Nonce907
ContractQuantityValueTransfers#
# StakeEther.net1.7 Visit StakeEther.net to claim rewards1
$ getETH.org1.4 Visit getETH.org to claim rewards1
$1 CAR0 $1CAR3
$SPIKE Coin0 $SPIKE2
0xOpen0 0xO3
ARCADE300000 ARCADE1
Abattoir of Zir0.000009258 DIABLO2
Akira Inu442178001.390862593115867066 AKIRA1
Akira Inu38813.423548245 AKINU2
Anita Max Wynn0 WYNN2
Any.trade0 ATRADE2
Apollo Inu455.010701249 APOLLO3
ApuToken0 APU2
Arsha Finance129.831781593 $ARSHA2
Astaghfirullah0 Astaghfirullah2
Astaghfirullah0 Astaghfirullah2
Auditus Pad166.378228406859810301 AUDIT1
BABYTROLL0 BABYTROLL3
BENANCE0 BENANCE2
BLING ELON0 BLINGLON2
BOBO0 BOBO2
BRCLauncher0 BRC3
Bear Inu126115.329141788107680767 Bear2
Biao Classic0.00087823786723581 BIAOC3
Bitcoin: A Peer-to-Peer Electronic Cash System Satoshi Nakamoto [email protected] www.bitcoin.org Abstract. A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone. 1. Introduction Commerce on the Internet has come to rely almost exclusively on financial institutions serving as trusted third parties to process electronic payments. While the system works well enough for most transactions, it still suffers from the inherent weaknesses of the trust based model Completely non-reversible transactions are not really possible, since financial institutions cannot avoid mediating disputes. The cost of mediation increases transaction costs, limiting the minimum practical transaction size and cutting off the possibility for small casual transactions, and there is a broader cost in the loss of ability to make non-reversible payments for nonreversible services. With the possibility of reversal, the need for trust spreads. Merchants must be wary of their customers, hassling them for more information than they would otherwise need. A certain percentage of fraud is accepted as unavoidable. These costs and payment uncertainties can be avoided in person by using physical currency, but no mechanism exists to make payment over a communications channel without a trusted party What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers. In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes. 2. Transactions We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding these to the end of the coin. A payee can verify the signatures to verify the chain of ownership. The problem of course is the payee can't verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the company running the mint, with every transaction having to go through them, just like a bank We need a way for the payee to know that the previous owners did not sign any earlier transactions. For our purposes, the earliest transaction is the one that counts, so we don't care about later attempts to double-spend. The only way to confirm the absence of a transaction is to be aware of all transactions. In the mint based model, the mint was aware of all transactions and decided which arrived first. To accomplish this without a trusted party, transactions must be publicly announced [1], and we need a system for participants to agree on a single history of the order in which they were received. The payee needs proof that at the time of each transaction, the majority of nodes agreed it was the first received. 3. Timestamp Server The solution we propose begins with a timestamp server. A timestamp server works by taking a hash of a block of items to be timestamped and widely publishing the hash, such as in a newspaper or Usenet post [2-5]. The timestamp proves that the data must have existed at the time, obviously, in order to get into the hash. Each timestamp includes the previous timestamp in its hash, forming a chain, with each additional timestamp reinforcing the ones before it 4. Proof-of-Work To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a proof of-work system similar to Adam Back's Hashcash [6], rather than newspaper or Usenet posts. The proof-of-work involves scanning for a value that when hashed, such as with SHA-256, the hash begins with a number of zero bits. The average work required is exponential in the number of zero bits required and can be verified by executing a single hash. For our timestamp network, we implement the proof-of-work by incrementing a nonce in the block until a value is found that gives the block's hash the required zero bits. Once the CPU effort has been expended to make it satisfy the proof-of-work, the block cannot be changed without redoing the work. As later blocks are chained after it, the work to change the block would include redoing all the blocks after it. The proof-of-work also solves the problem of determining representation in majority decision making. If the majority were based on one-IP-address-one-vote, it could be subverted by anyone able to allocate many IPs. Proof-of-work is essentially one-CPU-one-vote. The majority decision is represented by the longest chain, which has the greatest proof-of-work effort invested in it. If a majority of CPU power is controlled by honest nodes, the honest chain will grow the fastest and outpace any competing chains. To modify a past block, an attacker would have to redo the proof-of-work of the block and all blocks after it and then catch up with and surpass the work of the honest nodes. We will show later that the probability of a slower attacker catching up diminishes exponentially as subsequent blocks are added. To compensate for increasing hardware speed and varying interest in running nodes over time the proof-of-work difficulty is determined by a moving average targeting an average number of blocks per hour. If they're generated too fast, the difficulty increases. 5. Network The steps to run the network are as follows: 1) New transactions are broadcast to all nodes 2) Each node collects new transactions into a block. 3) Each node works on finding a difficult proof-of-work for its block 4) When a node finds a proof-of-work, it broadcasts the block to all nodes. 5) Nodes accept the block only if all transactions in it are valid and not already spent 6) Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash. Nodes always consider the longest chain to be the correct one and will keep working on extending it. If two nodes broadcast different versions of the next block simultaneously, some nodes may receive one or the other first. In that case, they work on the first one they received, but save the other branch in case it becomes longer. The tie will be broken when the next proof of-work is found and one branch becomes longer; the nodes that were working on the other branch will then switch to the longer one. New transaction broadcasts do not necessarily need to reach all nodes. As long as they reach many nodes, they will get into a block before long. Block broadcasts are also tolerant of dropped messages. If a node does not receive a block, it will request it when it receives the next block and realizes it missed one. 6. Incentive By convention, the first transaction in a block is a special transaction that starts a new coin owned by the creator of the block. This adds an incentive for nodes to support the network, and provides a way to initially distribute coins into circulation, since there is no central authority to issue them a way to initially distribute coins into circulation, since there is no central authority to issue them. The steady addition of a constant of amount of new coins is analogous to gold miners expending resources to add gold to circulation. In our case, it is CPU time and electricity that is expended. The incentive can also be funded with transaction fees. If the output value of a transaction is less than its input value, the difference is a transaction fee that is added to the incentive value of the block containing the transaction. Once a predetermined number of coins have entered circulation, the incentive can transition entirely to transaction fees and be completely inflation free. The incentive may help encourage nodes to stay honest. If a greedy attacker is able to assemble more CPU power than all the honest nodes, he would have to choose between using it to defraud people by stealing back his payments, or using it to generate new ins. He ought to find it more profitable to play by the rules, such rules that favour him with more new coins than everyone else combined, than to undermine the system and the validity of his own wealth. 7. Reclaiming Disk Space Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree [7][2][5], with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored. A block header with no transactions would be about 80 bytes. If we suppose blocks are generated every 10 minutes, 80 bytes * 6 * 24 * 365 = 4.2MB per year. With computer systems typically selling with 2GB of RAM as of 2008, and Moore's Law predicting current growth of 1.2GB per year, storage should not be a problem even if the block headers must be kept in memory. 8. Simplified Payment Verification It is possible to verify payments without running a full network node. A user only needs to keep a copy of the block headers of the longest proof-of-work chain, which he can get by querying network nodes until he's convinced he has the longest chain, and obtain the Merkle branch linking the transaction to the block it's timestamped in. He can't check the transaction for himself, but by linking it to a place in the chain, he can see that a network node has accepted it, and blocks added after it further confirm the network has accepted it. As such, the verification is reliable as long as honest nodes control the network, but is more vulnerable if the network is overpowered by an attacker. While network nodes can verify transactions for themselves, the simplified method can be fooled by an attacker's fabricated transactions for as long as the attacker can continue to overpower the network. One strategy to protect against this would be to accept alerts from network nodes when they detect an invalid block, prompting the user's software to download the full block and alerted transactions to confirm the inconsistency. Businesses that receive frequent payments will probably still want to run their own nodes for more independent security and quicker verification 9. Combining and Splitting Value Although it would be possible to handle coins individually, it would be unwieldy to make a separate transaction for every cent in a transfer. To allow value to be split and combined, transactions contain multiple inputs and outputs. Normally there will be either a single input from a larger previous transaction or multiple inputs combining smaller amounts, and at most two outputs: one for the payment, and one returning the change, if any, back to the sender. It should be noted that fan-out, where a transaction depends on several transactions, and those transactions depend on many more, is not a problem here. There is never the need to extract a complete standalone copy of a transaction's history. 10. Privacy The traditional banking model achieves a level of privacy by limiting access to information to the parties involved and the trusted third party. The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous. The public can see that someone is sending an amount to someone else, but without information linking the transaction to anyone. This is similar to the level of information released by stock exchanges, where the time and size of individual trades, the tape, is made public, but without telling who the parties were. As an additional firewall, a new key pair should be used for each transaction to keep them from being linked to a common owner. Some linking is still unavoidable with multi-input transactions, which necessarily reveal that their inputs were owned by the same owner. The risk is that if the owner of a key is revealed, linking could reveal other transactions that belonged to the same owner. 11. Calculations We consider the scenario of an attacker trying to generate an alternate chain faster than the honest chain. Even if this is accomplished, it does not throw the system open to arbitrary changes, such as creating value out of thin air or taking money that never belonged to the not going to accept an invalid transaction as payment, and honest nodes will never accept a block attacker. Nodes are containing them. An attacker can only try to change one of his own transactions to take back money he recently spent. The race between the honest chain and an attacker chain can be characterized as a Binomial Random Walk.12366.949593200637096397 BITCOIN1
Burts AI0 BURTS2
CYBER ELON204.281530329 CYBERELON2
Catopia1760000000 Cats1
Changpeng Zhao0.000000002 CZ2
Chief Troll Officer0 CTO2
ChowDAO0 CHOW3
Clarus the Dogcow0 DOGCOW2
Clay0 CLAY2
Cryptter2786927497.158741352601041891 Cryptter1
Cz Inu143745.968892815 CZU1
DEV SMASHED HIS KEYBOARD0 hixokdkekjcjdksicndnaiaihsbznnxnxnduje2
DarkMatter0 DMT6
Deflation12364.789802804 DEFLATION1
Diamond0 DIAMOND2
Dispersion0 DPS2
DogTag0 DTAG2
Dogepper0 DOGEPPER2
Dogereum0 dETH2
Domain Money2439.047991392 DOMAINMONEY2
Dripe Coin0 DRIPE3
Edison0 EDISON2
Fanatico0 FCO3
Flokitama276000000000000000000 Flokitama1
FomoSwap0.092353480485931969 FOMOSWAP1
Free CZ2074246.484073568 PRISON1
Free Cz2400555.054896780332908987 FREECZ1
FreeCZ200529.075866126 FREECZ1
Froge0 FROGE2
Fubuki Token10040.650912231263314741 FUBUKI2
Fuse Token0 FUSE2
Fusion Systems10862159.214460218 FUSION1
GRIMJA111041340327246.803491681 GRIMJA2
GRIMSHIB Token125994.888346493 GRIMSHIB3
GrimDoge277860.057545213 GD2
Grimace Coin0 GRIMACE3
Grimace Coin9219721.458351469 GRIM1
Grimace Coin0 GRIM5
Grok by Grōk.com0 Grōk2
Holdenomics0 ʜᴏʟᴅᴇɴᴏᴍɪᴄꜱ1
HostileZoneOfficial0 Htz6
HotHoneyBun382959338.95384949383188524 HHB1
InFi0 8FI3
InFi_DividendTracker0 InFi_DividendTracker2
James Bond0 BOND2
Je Maple syrup0 Syrup3
Jesus0 RAPTOR2
JustAnEgg3954054053.07 EGG1
Kabochan0 KABO2
Kanpai0 KPAI3
Kennedy240 RFKJR2
KingShib180000000000 KingShib1
KongFu0 KONGFU2
KongTama4622063693.894880657 KongTama1
Let's Go Brandon0 LGB9
MANEKI-NEKO9395.523498003087917195 NEKO2
MCREFI_DividendTracker0 MCREFI_DividendTracker2
MEME KONG0 MKONG4
MLG0 MLG2
MOONSHOT0 MOON3
Magneto0 Magneto3
McDoge0 MCDOGE6
McDogenalds DAO39925840218486.288458212 MDD3
McKong0 McKong2
McReFi0 MCREFI3
McShib316316485236230531.454217125 McShib2
McShiba0 McShib3
Media Matters150000 MEDIA1
Meishu715543.39555746 MEISHU1
Mercury Inu348437.226112829 HAM2
MetaPaco1.99465814292413234 MPAC2
Monster Truck0 MONSTER2
NFL41357102.241492539 NFL1
NeoCortexAI24582053.911471959 nCORAI1
Neuro Farms0 NEUROFARMS3
Neuro_DividendTracker0 Neuro_DividendTracker2
New BobCoin0 BOB2
NinetiesCup0 JAZZCUP3
NoFace0 NOFACE2
Not Gonna Lie0 NGL3
ONERING0 RING2
Ordible0 ORB3
PAWS0 PAWS3
PINKMAN0 PINKMAN3
Pandorabox0 PBOX3
Paragons DAO Token0 PDT2
Pepe0.000000000117086205 PEPE2
Pochi Inu0 POCHI3
QSTAR0.000000001 Q*2
ROKO0.00000000197017508 ROKO2
Robin Hood ERC30765012.176013297 RobinHood2
Ron Desantis122944961.101339914 DESANTIS1
SAINT0 SAINT2
SAM0 SAM3
SELENA INU76458369356.711259635 SELENA3
Sadge0 SADGE2
Sam Altman10337298.964426734 SAM1
Sam Altman0 ALTMAN2
Samsung Toshiba Nakamichi Motorola15862269.591778356 SATOSHI1
Satoshi Nakamoto6976443.877288862 SATOSHI1
Scuti7500000 SCUTI1
Shazam AI0 $SHAZAM2
ShibaHub0 ShibaHub2
Shibafia545622.818286682 SHIBAFIA2
Shibafia4590437189.339173434807658711 SMAFIA1
Shinigami44800.962003363 EYES1
Shinjurai44887.469470974 SHINJURAI2
Shinjurai Inu9085637893.73195765 $SHJRI1
Shinshib617095563272276950539.950674717 SHINSHIB1
Shumo.io78.679029474 SHUMO5
SpyBot0 $SPY3
Squid Grok0 SquidGrok1
Stax Protocol0 STAX2
StudioAi0 SAI2
SuperMarioPorsche911inu0.000515362614512012 SILKROAD2
THE BOY WHO SAVED CRYPTO2273334 SMINEM3
TIDEPOD255672.30047843 TIDE1
TRIFARM_DividendTracker0 TRIFARM_DividendTracker2
Tatsutama8895890737.649601707 Tatsutama1
The Balkan Dwarf0.000000002437831352 Kekec2
The God of Pumps0 ZENDOR2
The Godfather0 GODFATHER3
The Holy Bible0 HolyBible3
ThunderVerse0 THUNDER2
Tiger King Inu2630908970.437495162546161702 TigerKing1
Tiger King Inu0 TKINU4
Tigger0 TIGG3
TriFarm Seed Capital0 TRIFARM3
Troll 2.00 TROLL2.02
Trollolol0 TROLL2
VERTEX0 VTX2
Vader0 VADER2
Vitalik Buterin73664957.340745755 VB1
Vitalik Buterin4220396.590129636 VB1
WARIO254925.56975514 WAR1
Washer35928.015807201 WASH1
Wen Lunch0 LUNCH2
What The Fuck0 WTF2
Wiggum0 WIGGUM2
Wrapped Ether0 anyETH2
Wrapped Ether0 WETH5
X0 X2
XMOSTAR0 XMO3
Xunie0 XUNIE2
YUMA INU0 YUMA2
Yi He57160210.176365094 HE1
YoloSwap0.418054701303220042 YOLOSWAP1
iToken93313626935.25033655277656241 iToken1
porkwifhat0 porkwifhat1
sonic coin0 SONIC2
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡇⠀⠀⠀⠀⠔⡆⢿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡃⠀⠀⠈⠀⠀⠁⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢰⠁⠀⠀⠀⠀⠀⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⢀⡠⣼⡆⡄⢀⠃⠀⢸⠀⡀⡇⠂⠤⣀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⢠⠊⠁⠀⣼⠡⠇⢻⠀⢠⠸⡄⡇⢹⠀⠀⠈⢳⡀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⢀⠀⢀⢢⡇⢦⠀⣸⡀⢰⠀⣷⣷⠈⣇⠀⠀⢸⠇⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠈⣆⣼⡿⠤⣼⣠⣏⣇⣼⣶⣹⣾⠧⠼⢦⣀⡿⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⡠⠞⠁⠀⠀⠀⠀⠙⠹⢿⠋⠁⠀⠀⠀⠀⠉⠣⡀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⣠⠎⠀⠀⠀⠀⠀⠀⠀⠀⣠⣿⡀⠀⠀⠀⠀⠀⠀⠀⠈⢢⢄⠀⠀⠀ ⠀⠀⢀⣾⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⡗⠀⠀⠀⠀⠀⠀⠀⠀⢸⠈⢢⠀⠀ ⠀⢠⠃⢿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⡏⠉⣁⠀⠀⠀⠀⠀⠀⠀⠀⢸⠄⠀⢡⠀ ⠀⣼⠀⠸⡇⠀⠀⠀⠀⠀⠀⠀⠀⣼⠐⣦⢹⣆⠀⠀⠀⠀⠀⠀⠀⣼⠀⠀⠀⡄ ⠀⣿⠀⠀⢷⠀⠀⠀⠀⠀⢀⡀⢀⡏⠀⣿⠀⡏⠑⠀⠀⠀⠀⠀⠀⣼⠀⠀⠀⠃ ⠀⢹⡆⠀⠸⡄⠀⠀⠀⠀⠀⠀⠙⣷⠀⣗⢠⡿⠛⠁⠀⠀⠀⠀⢈⡇⠀⠀⢀⠀ ⠀⠀⢿⠀⠀⢿⠀⠀⠀⠀⠀⠀⠀⠙⣷⣿⡿⠁⠀⠀⠀⠀⠀⠀⢸⡇⠀⢀⡎⠀ ⠀⠀⠘⣇⠀⠘⣇⠀⠀⠀⠀⠀⠀⠀⣿⣽⡇⠀⠀⠀⠀⠀⠀⢰⡿⠀⢀⡞⠀⠀ ⠀⠀⠀⠹⡇⠀⠸⣆⡀⠀⠀⠀⠀⠀⣿⣿⡆⠀⠀⠀⠀⠀⢰⣿⠃⠀⣼⠃⠀⠀ ⠀⠀⠀⠀⢿⣦⠀⠹⣆⠀⠀⠀⣀⣤⣿⣿⣷⣄⠀⠀⣀⣴⣿⡧⣀⣼⡏⠀⠀⠀ ⠀⠀⠀⠀⠸⣿⣷⣿⣿⣷⣶⣿⣿⣿⣿⣿⣿⣿⣶⣶⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠁⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⡿⢹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢠⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢁⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⢻⣿⣿⣿⠏⣿⣿⣿⡟⠻⣿⣻⣿⡇⢰⠇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣷⣼⣿⣿⣿⠀⣿⣿⣿⡇⠀⢹⣿⣿⣠⣿⠀⠀⠀⠀ ⠀⠀⠀⠀⢀⣿⣿⡇⣿⣿⣿⣿⣿⣿⣿⠀⢿⣿⣿⣇⣀⢸⣿⣿⣯⠇⠀⠀⠀⠀ ⠀⠀⠀⠀⠈⢻⣿⠇⣿⣿⣿⣿⣿⣿⡇⠀⠸⣿⣿⣿⣯⢸⣿⡷⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⡾⡏⠀⣿⣿⣿⣿⣿⣿⠁⠀⠀⢻⣿⠿⠃⠐⢻⡇⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠈⠀⠁⠀⢸⡏⠁⠀⠹⣿⠀⠀⠀⠘⡇⠀⠀⠀⢨⡇⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠇⠀⠀⠀⠻⠀⠀⠀⠀⢷⠀⠀⠀⢸⠁⠀⠀⠀⠀⠀⠀ ⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠚⠓⠒⠒⣒⣒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒0 PUSSY2
⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧0 ₿2
⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬛️⬛️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️0 Ξ2
以太坊0 以太币2
ContractTokensTransfers#
StakeEther.net1 Airdrop of ID 01
getETH.org1 Airdrop of ID 01
0xD4416b13d2b3a9aBae7AcD5D6C2BbDBE256864011

Transactions

0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
52853.774286739849785564 XUNIE
ERC20 Token Transfers
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
5296313854258.86048673 porkwifhat
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0.2 ETH
ERC20 Token Transfers
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
52853.774286739849785564 XUNIE
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
184169177776.377306464510611022 FROGE
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
1189479.279700290311035797 hixokdkekjcjdksicndnaiaihsbznnxnxnduje
ERC20 Token Transfers
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
1.7 Visit StakeEther.net to claim rewards
ERC1155 Token Transfers
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
1 Airdrop of ID 0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
10318286.16655373 DOGCOW
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0.2 ETH
ERC20 Token Transfers
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
10318286.16655373 DOGCOW
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
1347183.836546694 TROLL
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0.15 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0.05 ETH
ERC20 Token Transfers
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
1347183.836546694 TROLL
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
11432249111.282751122 以太币
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0.2 ETH
ERC20 Token Transfers
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
11432249111.282751122 以太币
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
8810547104.575720452521658822 TIGG
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
463713005.503985286974824148 TIGG
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH
 
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0.09132214 ETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
 
0 ETH