Ethereum Explorer
Blocks
Status
Address
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0.
011
288
810
726
641
81
ETH
Confirmed
Balance
0.
011
288
810
726
641
81
ETH
Transactions
661
Non-contract Transactions
650
Internal Transactions
0
Nonce
917
ERC20 Tokens
178
Contract
Quantity
Value
Transfers
#
# StakeEther.net
1.
7
Visit StakeEther.net to claim rewards
1
$ getETH.org
1.
4
Visit getETH.org to claim rewards
1
$1 CAR
0 $1CAR
3
$SPIKE Coin
0 $SPIKE
2
0xOpen
0 0xO
3
ARCADE
300
000
ARCADE
1
Abattoir of Zir
0.
000
009
258
DIABLO
2
Akira Inu
442
178
001
.
390
862
593
115
867
066
AKIRA
1
Akira Inu
38
815
.
663
507
312
AKINU
2
Anita Max Wynn
0 WYNN
2
Any.trade
0 ATRADE
2
Apollo Inu
455.
039
746
122
APOLLO
3
ApuToken
0 APU
2
Arsha Finance
129.
831
781
593
$ARSHA
2
Astaghfirullah
0 Astaghfirullah
2
Astaghfirullah
0 Astaghfirullah
2
Auditus Pad
166.
378
228
406
859
810
301
AUDIT
1
BABYTROLL
0 BABYTROLL
3
BENANCE
0 BENANCE
2
BLING ELON
0 BLINGLON
2
BOBO
0 BOBO
2
BRCLauncher
0 BRC
3
Bear Inu
126
115
.
329
141
788
107
680
767
Bear
2
Biao Classic
0.
000
878
237
867
235
81
BIAOC
3
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.
12
366
.
949
593
200
637
096
397
BITCOIN
1
Burts AI
0 BURTS
2
CYBER ELON
204.
281
530
329
CYBERELON
2
Catopia
1
760
000
000
Cats
1
Changpeng Zhao
0.
000
000
002
CZ
2
Chief Troll Officer
0 CTO
2
ChowDAO
0 CHOW
3
Clarus the Dogcow
0 DOGCOW
2
Clay
0 CLAY
2
Cryptter
2
786
927
497
.
158
741
352
601
041
891
Cryptter
1
Cz Inu
143
745
.
968
892
815
CZU
1
DEV SMASHED HIS KEYBOARD
0 hixokdkekjcjdksicndnaiaihsbznnxnxnduje
2
DarkMatter
0 DMT
6
Deflation
12
364
.
789
802
804
DEFLATION
1
Diamond
0 DIAMOND
2
Dispersion
0 DPS
2
DogTag
0 DTAG
2
Dogepper
0 DOGEPPER
2
Dogereum
0 dETH
2
Domain Money
2
439
.
047
991
392
DOMAINMONEY
2
Dripe Coin
0 DRIPE
3
Edison
0 EDISON
2
Fanatico
0 FCO
3
Flokitama
276
000
000
000
000
000
000
Flokitama
1
FomoSwap
0.
092
353
480
485
931
969
FOMOSWAP
1
Free CZ
2
074
246
.
484
073
568
PRISON
1
Free Cz
2
400
555
.
054
896
780
332
908
987
FREECZ
1
FreeCZ
200
529
.
075
866
126
FREECZ
1
Froge
0 FROGE
2
Fubuki Token
10
040
.
650
912
231
263
314
741
FUBUKI
2
Fuse Token
0 FUSE
2
Fusion Systems
10
862
159
.
214
460
218
FUSION
1
GRIMJA
111
041
340
327
246
.
803
491
681
GRIMJA
2
GRIMSHIB Token
125
994
.
888
346
493
GRIMSHIB
3
GrimDoge
277
860
.
057
545
213
GD
2
Grimace Coin
0 GRIMACE
3
Grimace Coin
9
219
721
.
458
351
469
GRIM
1
Grimace Coin
0 GRIM
5
Grok by Grōk.com
0 Grōk
2
Holdenomics
0 ʜᴏʟᴅᴇɴᴏᴍɪᴄꜱ
1
HostileZoneOfficial
0 Htz
6
HotHoneyBun
382
959
338
.
953
849
493
831
885
24
HHB
1
InFi
0 8FI
3
InFi_DividendTracker
0 InFi_DividendTracker
2
James Bond
0 BOND
2
Je Maple syrup
0 Syrup
3
Jesus
0 RAPTOR
2
JustAnEgg
3
954
054
053
.
07
EGG
1
Kabochan
0 KABO
2
Kanpai
0 KPAI
3
Kennedy24
0 RFKJR
2
KingShib
180
000
000
000
KingShib
1
KongFu
0 KONGFU
2
KongTama
4
622
063
693
.
894
880
657
KongTama
1
Let's Go Brandon
0 LGB
9
MANEKI-NEKO
9
395
.
523
498
003
087
917
195
NEKO
2
MCREFI_DividendTracker
0 MCREFI_DividendTracker
2
MEME KONG
0 MKONG
4
MLG
0 MLG
2
MOONSHOT
0 MOON
3
Magneto
0 Magneto
3
McDoge
0 MCDOGE
6
McDogenalds DAO
39
925
840
218
486
.
288
458
212
MDD
3
McKong
0 McKong
2
McReFi
0 MCREFI
3
McShib
316
316
485
236
230
531
.
454
217
125
McShib
2
McShiba
0 McShib
3
Media Matters
150
000
MEDIA
1
Meishu
715
543
.
395
557
46
MEISHU
1
Mercury Inu
348
437
.
226
112
829
HAM
2
MetaPaco
1.
994
658
142
924
132
34
MPAC
2
Monster Truck
0 MONSTER
2
NFL
41
357
102
.
241
492
539
NFL
1
NeoCortexAI
24
582
053
.
911
471
959
nCORAI
1
Neuro Farms
0 NEUROFARMS
3
Neuro_DividendTracker
0 Neuro_DividendTracker
2
New BobCoin
0 BOB
2
NinetiesCup
0 JAZZCUP
3
NoFace
0 NOFACE
2
Not Gonna Lie
0 NGL
3
ONERING
0 RING
2
Ordible
0 ORB
3
PAWS
0 PAWS
3
PINKMAN
0 PINKMAN
3
Pandorabox
0 PBOX
3
Paragons DAO Token
0 PDT
2
Pepe
0.
000
000
000
117
086
205
PEPE
2
Pochi Inu
0 POCHI
3
QSTAR
0.
000
000
001
Q*
2
ROKO
0.
000
000
001
970
175
08
ROKO
2
Robin Hood ERC
30
765
012
.
176
013
297
RobinHood
2
Ron Desantis
122
944
961
.
101
339
914
DESANTIS
1
SAINT
0 SAINT
2
SAM
0 SAM
3
SELENA INU
76
458
369
356
.
711
259
635
SELENA
3
Sadge
0 SADGE
2
Sam Altman
10
337
298
.
964
426
734
SAM
1
Sam Altman
0 ALTMAN
2
Samsung Toshiba Nakamichi Motorola
15
862
269
.
591
778
356
SATOSHI
1
Satoshi Nakamoto
6
976
443
.
877
288
862
SATOSHI
1
Scuti
7
500
000
SCUTI
1
Shazam AI
0 $SHAZAM
2
ShibaHub
0 ShibaHub
2
Shibafia
545
622
.
818
286
682
SHIBAFIA
2
Shibafia
4
590
437
189
.
339
173
434
807
658
711
SMAFIA
1
Shinigami
44
800
.
962
003
363
EYES
1
Shinjurai
44
887
.
469
470
974
SHINJURAI
2
Shinjurai Inu
9
085
637
893
.
731
957
65
$SHJRI
1
Shinshib
617
095
563
272
276
950
539
.
950
674
717
SHINSHIB
1
Shumo.io
78.
679
029
474
SHUMO
5
SpyBot
0 $SPY
3
Squid Grok
0 SquidGrok
1
Stax Protocol
0 STAX
2
StudioAi
0 SAI
2
SuperMarioPorsche911inu
0.
000
515
362
614
512
012
SILKROAD
2
THE BOY WHO SAVED CRYPTO
2
273
334
SMINEM
3
TIDEPOD
255
672
.
300
478
43
TIDE
1
TRIFARM_DividendTracker
0 TRIFARM_DividendTracker
2
Tatsutama
8
895
890
737
.
649
601
707
Tatsutama
1
The Balkan Dwarf
0.
000
000
002
437
831
352
Kekec
2
The God of Pumps
0 ZENDOR
2
The Godfather
0 GODFATHER
3
The Holy Bible
0 HolyBible
3
ThunderVerse
0 THUNDER
2
Tiger King Inu
2
630
908
970
.
437
495
162
546
161
702
TigerKing
1
Tiger King Inu
0 TKINU
4
Tigger
0 TIGG
3
TriFarm Seed Capital
0 TRIFARM
3
Troll 2.0
0 TROLL2.0
2
Trollolol
0 TROLL
2
VERTEX
0 VTX
2
Vader
0 VADER
2
Vitalik Buterin
73
664
957
.
340
745
755
VB
1
Vitalik Buterin
4
220
396
.
590
129
636
VB
1
WARIO
254
925
.
569
755
14
WAR
1
Washer
35
928
.
015
807
201
WASH
1
Wen Lunch
0 LUNCH
2
What The Fuck
0 WTF
2
Wiggum
0 WIGGUM
2
Wrapped Ether
0 anyETH
2
Wrapped Ether
0 WETH
5
X
0 X
2
XMOSTAR
0 XMO
3
Xunie
0 XUNIE
2
YUMA INU
0 YUMA
2
Yi He
57
160
210
.
176
365
094
HE
1
YoloSwap
0.
418
054
701
303
220
042
YOLOSWAP
1
iToken
93
313
626
935
.
250
336
552
776
562
41
iToken
1
porkwifhat
0 porkwifhat
1
sonic coin
0 SONIC
2
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡇⠀⠀⠀⠀⠔⡆⢿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡃⠀⠀⠈⠀⠀⠁⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢰⠁⠀⠀⠀⠀⠀⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⢀⡠⣼⡆⡄⢀⠃⠀⢸⠀⡀⡇⠂⠤⣀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⢠⠊⠁⠀⣼⠡⠇⢻⠀⢠⠸⡄⡇⢹⠀⠀⠈⢳⡀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⢀⠀⢀⢢⡇⢦⠀⣸⡀⢰⠀⣷⣷⠈⣇⠀⠀⢸⠇⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠈⣆⣼⡿⠤⣼⣠⣏⣇⣼⣶⣹⣾⠧⠼⢦⣀⡿⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⡠⠞⠁⠀⠀⠀⠀⠙⠹⢿⠋⠁⠀⠀⠀⠀⠉⠣⡀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⣠⠎⠀⠀⠀⠀⠀⠀⠀⠀⣠⣿⡀⠀⠀⠀⠀⠀⠀⠀⠈⢢⢄⠀⠀⠀ ⠀⠀⢀⣾⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⡗⠀⠀⠀⠀⠀⠀⠀⠀⢸⠈⢢⠀⠀ ⠀⢠⠃⢿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⡏⠉⣁⠀⠀⠀⠀⠀⠀⠀⠀⢸⠄⠀⢡⠀ ⠀⣼⠀⠸⡇⠀⠀⠀⠀⠀⠀⠀⠀⣼⠐⣦⢹⣆⠀⠀⠀⠀⠀⠀⠀⣼⠀⠀⠀⡄ ⠀⣿⠀⠀⢷⠀⠀⠀⠀⠀⢀⡀⢀⡏⠀⣿⠀⡏⠑⠀⠀⠀⠀⠀⠀⣼⠀⠀⠀⠃ ⠀⢹⡆⠀⠸⡄⠀⠀⠀⠀⠀⠀⠙⣷⠀⣗⢠⡿⠛⠁⠀⠀⠀⠀⢈⡇⠀⠀⢀⠀ ⠀⠀⢿⠀⠀⢿⠀⠀⠀⠀⠀⠀⠀⠙⣷⣿⡿⠁⠀⠀⠀⠀⠀⠀⢸⡇⠀⢀⡎⠀ ⠀⠀⠘⣇⠀⠘⣇⠀⠀⠀⠀⠀⠀⠀⣿⣽⡇⠀⠀⠀⠀⠀⠀⢰⡿⠀⢀⡞⠀⠀ ⠀⠀⠀⠹⡇⠀⠸⣆⡀⠀⠀⠀⠀⠀⣿⣿⡆⠀⠀⠀⠀⠀⢰⣿⠃⠀⣼⠃⠀⠀ ⠀⠀⠀⠀⢿⣦⠀⠹⣆⠀⠀⠀⣀⣤⣿⣿⣷⣄⠀⠀⣀⣴⣿⡧⣀⣼⡏⠀⠀⠀ ⠀⠀⠀⠀⠸⣿⣷⣿⣿⣷⣶⣿⣿⣿⣿⣿⣿⣿⣶⣶⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠁⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⡿⢹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢠⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢁⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⢻⣿⣿⣿⠏⣿⣿⣿⡟⠻⣿⣻⣿⡇⢰⠇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣷⣼⣿⣿⣿⠀⣿⣿⣿⡇⠀⢹⣿⣿⣠⣿⠀⠀⠀⠀ ⠀⠀⠀⠀⢀⣿⣿⡇⣿⣿⣿⣿⣿⣿⣿⠀⢿⣿⣿⣇⣀⢸⣿⣿⣯⠇⠀⠀⠀⠀ ⠀⠀⠀⠀⠈⢻⣿⠇⣿⣿⣿⣿⣿⣿⡇⠀⠸⣿⣿⣿⣯⢸⣿⡷⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⡾⡏⠀⣿⣿⣿⣿⣿⣿⠁⠀⠀⢻⣿⠿⠃⠐⢻⡇⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠈⠀⠁⠀⢸⡏⠁⠀⠹⣿⠀⠀⠀⠘⡇⠀⠀⠀⢨⡇⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠇⠀⠀⠀⠻⠀⠀⠀⠀⢷⠀⠀⠀⢸⠁⠀⠀⠀⠀⠀⠀ ⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠚⠓⠒⠒⣒⣒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒
0 PUSSY
2
⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧
0 ₿
2
⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬛️⬛️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️
0 Ξ
2
以太坊
0 以太币
2
ERC1155 Tokens
3
Contract
Tokens
Transfers
#
StakeEther.net
1 Airdrop
of ID
0
1
getETH.org
1 Airdrop
of ID
0
1
0xD4416b13d2b3a9aBae7AcD5D6C2BbDBE25686401
1
Transactions
All
Address on input side
Address on output side
Non-contract
Internal
# StakeEther.net (ERC20)
$ getETH.org (ERC20)
$1 CAR (ERC20)
$SPIKE Coin (ERC20)
0xOpen (ERC20)
ARCADE (ERC20)
Abattoir of Zir (ERC20)
Akira Inu (ERC20)
Akira Inu (ERC20)
Anita Max Wynn (ERC20)
Any.trade (ERC20)
Apollo Inu (ERC20)
ApuToken (ERC20)
Arsha Finance (ERC20)
Astaghfirullah (ERC20)
Astaghfirullah (ERC20)
Auditus Pad (ERC20)
BABYTROLL (ERC20)
BENANCE (ERC20)
BLING ELON (ERC20)
BOBO (ERC20)
BRCLauncher (ERC20)
Bear Inu (ERC20)
Biao Classic (ERC20)
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. (ERC20)
Burts AI (ERC20)
CYBER ELON (ERC20)
Catopia (ERC20)
Changpeng Zhao (ERC20)
Chief Troll Officer (ERC20)
ChowDAO (ERC20)
Clarus the Dogcow (ERC20)
Clay (ERC20)
Cryptter (ERC20)
Cz Inu (ERC20)
DEV SMASHED HIS KEYBOARD (ERC20)
DarkMatter (ERC20)
Deflation (ERC20)
Diamond (ERC20)
Dispersion (ERC20)
DogTag (ERC20)
Dogepper (ERC20)
Dogereum (ERC20)
Domain Money (ERC20)
Dripe Coin (ERC20)
Edison (ERC20)
Fanatico (ERC20)
Flokitama (ERC20)
FomoSwap (ERC20)
Free CZ (ERC20)
Free Cz (ERC20)
FreeCZ (ERC20)
Froge (ERC20)
Fubuki Token (ERC20)
Fuse Token (ERC20)
Fusion Systems (ERC20)
GRIMJA (ERC20)
GRIMSHIB Token (ERC20)
GrimDoge (ERC20)
Grimace Coin (ERC20)
Grimace Coin (ERC20)
Grimace Coin (ERC20)
Grok by Grōk.com (ERC20)
Holdenomics (ERC20)
HostileZoneOfficial (ERC20)
HotHoneyBun (ERC20)
InFi (ERC20)
InFi_DividendTracker (ERC20)
James Bond (ERC20)
Je Maple syrup (ERC20)
Jesus (ERC20)
JustAnEgg (ERC20)
Kabochan (ERC20)
Kanpai (ERC20)
Kennedy24 (ERC20)
KingShib (ERC20)
KongFu (ERC20)
KongTama (ERC20)
Let's Go Brandon (ERC20)
MANEKI-NEKO (ERC20)
MCREFI_DividendTracker (ERC20)
MEME KONG (ERC20)
MLG (ERC20)
MOONSHOT (ERC20)
Magneto (ERC20)
McDoge (ERC20)
McDogenalds DAO (ERC20)
McKong (ERC20)
McReFi (ERC20)
McShib (ERC20)
McShiba (ERC20)
Media Matters (ERC20)
Meishu (ERC20)
Mercury Inu (ERC20)
MetaPaco (ERC20)
Monster Truck (ERC20)
NFL (ERC20)
NeoCortexAI (ERC20)
Neuro Farms (ERC20)
Neuro_DividendTracker (ERC20)
New BobCoin (ERC20)
NinetiesCup (ERC20)
NoFace (ERC20)
Not Gonna Lie (ERC20)
ONERING (ERC20)
Ordible (ERC20)
PAWS (ERC20)
PINKMAN (ERC20)
Pandorabox (ERC20)
Paragons DAO Token (ERC20)
Pepe (ERC20)
Pochi Inu (ERC20)
QSTAR (ERC20)
ROKO (ERC20)
Robin Hood ERC (ERC20)
Ron Desantis (ERC20)
SAINT (ERC20)
SAM (ERC20)
SELENA INU (ERC20)
Sadge (ERC20)
Sam Altman (ERC20)
Sam Altman (ERC20)
Samsung Toshiba Nakamichi Motorola (ERC20)
Satoshi Nakamoto (ERC20)
Scuti (ERC20)
Shazam AI (ERC20)
ShibaHub (ERC20)
Shibafia (ERC20)
Shibafia (ERC20)
Shinigami (ERC20)
Shinjurai (ERC20)
Shinjurai Inu (ERC20)
Shinshib (ERC20)
Shumo.io (ERC20)
SpyBot (ERC20)
Squid Grok (ERC20)
Stax Protocol (ERC20)
StudioAi (ERC20)
SuperMarioPorsche911inu (ERC20)
THE BOY WHO SAVED CRYPTO (ERC20)
TIDEPOD (ERC20)
TRIFARM_DividendTracker (ERC20)
Tatsutama (ERC20)
The Balkan Dwarf (ERC20)
The God of Pumps (ERC20)
The Godfather (ERC20)
The Holy Bible (ERC20)
ThunderVerse (ERC20)
Tiger King Inu (ERC20)
Tiger King Inu (ERC20)
Tigger (ERC20)
TriFarm Seed Capital (ERC20)
Troll 2.0 (ERC20)
Trollolol (ERC20)
VERTEX (ERC20)
Vader (ERC20)
Vitalik Buterin (ERC20)
Vitalik Buterin (ERC20)
WARIO (ERC20)
Washer (ERC20)
Wen Lunch (ERC20)
What The Fuck (ERC20)
Wiggum (ERC20)
Wrapped Ether (ERC20)
Wrapped Ether (ERC20)
X (ERC20)
XMOSTAR (ERC20)
Xunie (ERC20)
YUMA INU (ERC20)
Yi He (ERC20)
YoloSwap (ERC20)
iToken (ERC20)
porkwifhat (ERC20)
sonic coin (ERC20)
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡇⠀⠀⠀⠀⠔⡆⢿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡃⠀⠀⠈⠀⠀⠁⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢰⠁⠀⠀⠀⠀⠀⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⢀⡠⣼⡆⡄⢀⠃⠀⢸⠀⡀⡇⠂⠤⣀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⢠⠊⠁⠀⣼⠡⠇⢻⠀⢠⠸⡄⡇⢹⠀⠀⠈⢳⡀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⢀⠀⢀⢢⡇⢦⠀⣸⡀⢰⠀⣷⣷⠈⣇⠀⠀⢸⠇⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠈⣆⣼⡿⠤⣼⣠⣏⣇⣼⣶⣹⣾⠧⠼⢦⣀⡿⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⡠⠞⠁⠀⠀⠀⠀⠙⠹⢿⠋⠁⠀⠀⠀⠀⠉⠣⡀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⣠⠎⠀⠀⠀⠀⠀⠀⠀⠀⣠⣿⡀⠀⠀⠀⠀⠀⠀⠀⠈⢢⢄⠀⠀⠀ ⠀⠀⢀⣾⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⡗⠀⠀⠀⠀⠀⠀⠀⠀⢸⠈⢢⠀⠀ ⠀⢠⠃⢿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⡏⠉⣁⠀⠀⠀⠀⠀⠀⠀⠀⢸⠄⠀⢡⠀ ⠀⣼⠀⠸⡇⠀⠀⠀⠀⠀⠀⠀⠀⣼⠐⣦⢹⣆⠀⠀⠀⠀⠀⠀⠀⣼⠀⠀⠀⡄ ⠀⣿⠀⠀⢷⠀⠀⠀⠀⠀⢀⡀⢀⡏⠀⣿⠀⡏⠑⠀⠀⠀⠀⠀⠀⣼⠀⠀⠀⠃ ⠀⢹⡆⠀⠸⡄⠀⠀⠀⠀⠀⠀⠙⣷⠀⣗⢠⡿⠛⠁⠀⠀⠀⠀⢈⡇⠀⠀⢀⠀ ⠀⠀⢿⠀⠀⢿⠀⠀⠀⠀⠀⠀⠀⠙⣷⣿⡿⠁⠀⠀⠀⠀⠀⠀⢸⡇⠀⢀⡎⠀ ⠀⠀⠘⣇⠀⠘⣇⠀⠀⠀⠀⠀⠀⠀⣿⣽⡇⠀⠀⠀⠀⠀⠀⢰⡿⠀⢀⡞⠀⠀ ⠀⠀⠀⠹⡇⠀⠸⣆⡀⠀⠀⠀⠀⠀⣿⣿⡆⠀⠀⠀⠀⠀⢰⣿⠃⠀⣼⠃⠀⠀ ⠀⠀⠀⠀⢿⣦⠀⠹⣆⠀⠀⠀⣀⣤⣿⣿⣷⣄⠀⠀⣀⣴⣿⡧⣀⣼⡏⠀⠀⠀ ⠀⠀⠀⠀⠸⣿⣷⣿⣿⣷⣶⣿⣿⣿⣿⣿⣿⣿⣶⣶⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠁⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⡿⢹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢠⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢁⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠀⡇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⢻⣿⣿⣿⠏⣿⣿⣿⡟⠻⣿⣻⣿⡇⢰⠇⠀⠀⠀ ⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣷⣼⣿⣿⣿⠀⣿⣿⣿⡇⠀⢹⣿⣿⣠⣿⠀⠀⠀⠀ ⠀⠀⠀⠀⢀⣿⣿⡇⣿⣿⣿⣿⣿⣿⣿⠀⢿⣿⣿⣇⣀⢸⣿⣿⣯⠇⠀⠀⠀⠀ ⠀⠀⠀⠀⠈⢻⣿⠇⣿⣿⣿⣿⣿⣿⡇⠀⠸⣿⣿⣿⣯⢸⣿⡷⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⡾⡏⠀⣿⣿⣿⣿⣿⣿⠁⠀⠀⢻⣿⠿⠃⠐⢻⡇⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠈⠀⠁⠀⢸⡏⠁⠀⠹⣿⠀⠀⠀⠘⡇⠀⠀⠀⢨⡇⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠇⠀⠀⠀⠻⠀⠀⠀⠀⢷⠀⠀⠀⢸⠁⠀⠀⠀⠀⠀⠀ ⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠚⠓⠒⠒⣒⣒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒⠒ (ERC20)
⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧🟧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 ⠀⠀⠀⠀⠀🟧🟧⠀⠀⠀🟧🟧 (ERC20)
⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬛️⬛️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬛️⬛️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ ⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️⬜️ (ERC20)
以太坊 (ERC20)
StakeEther.net (ERC1155)
getETH.org (ERC1155)
0xD4416b13d2b3a9aBae7AcD5D6C2BbDBE25686401 (ERC1155)
Previous
1
2
3
4
...
27
Next
0xa5555c2ba3263f9b0a7f7342d98d70c15b3273696c80f80f9d2b2031893a0366
mined
123 days 13 hours ago
0x791ac947
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x7a250d5630B4cF539739dF2C5dAcb4c659F2488D
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0xf9973c9f45517C096B03Fb6ae9A9222992E6AdEd
4
783
.
959
588
654
DPS
0xf9973c9f45517C096B03Fb6ae9A9222992E6AdEd
0x7a250d5630B4cF539739dF2C5dAcb4c659F2488D
1.
258
606
204
018
255
465
WETH
0x375ec1bccf5954d36960f1663b97378bdd692f769de8b5f7494ebd5299a5be4e
mined
123 days 13 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x77b5F866D22fED4Ed342f8f8d58995a21825FF7A
0 ETH
0x47c84a507c0ed1621e034397dc251a4f897fb669c4666506caa4ae47536ee5e6
mined
123 days 13 hours ago
0x75713a08
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x8D991cf25Db977Ad2d4da61C48373a69E4CD514d
9
500
SAM
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x36dBEB900f4E302853a1A66218d620Fe863157Cb
180
500
SAM
0x36dBEB900f4E302853a1A66218d620Fe863157Cb
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
055
702
872
982
601
164
WETH
0x488461f80704c4c4d81be2f1f3abe8d2afc6511a13e3456d7b574b7470b97abd
mined
123 days 14 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x2105465Ab589B74747B01AfdAF606d058Fb082BE
0 ETH
0x8d42452702cc5e7bb3bf0de2b8f89e195d7d4842b83789e8d6c5f8a35744e5a7
mined
123 days 14 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
1
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0xf05b4d24ffc067ff75f1b799e09C5bADB6693989
0.
099
502
487
562
189
054
WETH
0xf05b4d24ffc067ff75f1b799e09C5bADB6693989
0xA420872a164644469C6a5dA5C1B2740FD3f13667
1
189
479
.
279
700
290
311
035
797
hixokdkekjcjdksicndnaiaihsbznnxnxnduje
0x949486e6b6443e9424af4954a3cc4c693f4f871a76ac1f7c7c8a4f94172cd02b
mined
123 days 17 hours ago
0x75713a08
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x5B9AaaaA167283822dA083A4F7C645154B33078C
282
090
.
919
298
527
VTX
0x5B9AaaaA167283822dA083A4F7C645154B33078C
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
236
638
380
815
871
659
WETH
0xe9ba6f9321817f9a97d84c33bafe2bf963e93263aaac4384e4edddc7617bb091
mined
123 days 17 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0xe11C3952092038332Ba3d9176B1d1CB85424A870
0 ETH
0x547f34c858fb0a4111bf49d1e7fa9419fd46beca373989f8183e257c976d7f97
mined
123 days 17 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
211
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0x5B9AaaaA167283822dA083A4F7C645154B33078C
0.
199
004
975
124
378
109
WETH
0x5B9AaaaA167283822dA083A4F7C645154B33078C
0xA420872a164644469C6a5dA5C1B2740FD3f13667
331
871
.
669
762
972
VTX
0xd8e8404c364abbb1ed751a6802b42eb4d5389b56614109907f99d0aaf97dbfd1
mined
123 days 20 hours ago
0x75713a08
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0 ETH
ERC20 Token Transfers
0x98270324df15B507662f20Ce63AA6fb34d538297
0x976CE8EeE4DbE22EA6C8816BA0b957dC174b552C
210
000
₿
0x976CE8EeE4DbE22EA6C8816BA0b957dC174b552C
0x7a250d5630B4cF539739dF2C5dAcb4c659F2488D
0.
044
716
192
703
604
466
WETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x976CE8EeE4DbE22EA6C8816BA0b957dC174b552C
344
400
₿
0x976CE8EeE4DbE22EA6C8816BA0b957dC174b552C
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
069
036
094
266
550
363
WETH
0xbc08c5ac4c21cfd7aea33c567f25a984ecc24f168345f016730913554b7194df
mined
123 days 20 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x98270324df15B507662f20Ce63AA6fb34d538297
0 ETH
0x5daa1ae283d2e742f684a6696f82b62d92747ff47b24803cd11a5cb94c209e1d
mined
123 days 20 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
2
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0x976CE8EeE4DbE22EA6C8816BA0b957dC174b552C
0.
025
075
225
677
031
094
WETH
0x976CE8EeE4DbE22EA6C8816BA0b957dC174b552C
0x98270324df15B507662f20Ce63AA6fb34d538297
75
600
₿
0x976CE8EeE4DbE22EA6C8816BA0b957dC174b552C
0xA420872a164644469C6a5dA5C1B2740FD3f13667
344
400
₿
0x933e0298a1ae19f44a9bc1bc9d81f50b4fd311d07ed05e57a251be7a90ea6d75
mined
123 days 21 hours ago
0x75713a08
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x63b15Cb2EfBa16058f1e6B32D362cD17567967f5
348
725
.
856
962
458
EDISON
0x63b15Cb2EfBa16058f1e6B32D362cD17567967f5
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
092
470
548
934
922
778
WETH
0x62a39d3a31d4c7ae6db53e7f34b077ce05790ef8d9c5ee54e4bad16aefa428e8
mined
123 days 21 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x97Ac59be9765facA04C363e0b2292ac13e293084
0 ETH
0x2b38cd63bda9b02de1bd923439592c38b8a121fd356f880573384a872eac6a15
mined
123 days 21 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
2
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0x1A3775507c1632218e48A9d09aBe6a6AfeC046aC
0.
149
584
373
094
786
218
WETH
0x1A3775507c1632218e48A9d09aBe6a6AfeC046aC
0x97Ac59be9765facA04C363e0b2292ac13e293084
2
500
000
SCUTI
0x1A3775507c1632218e48A9d09aBe6a6AfeC046aC
0xA420872a164644469C6a5dA5C1B2740FD3f13667
7
500
000
SCUTI
0x5413a847da463b7fd84735bd7d9dbedb59f110a2ffb84214cb2a4eed5039d7f2
mined
123 days 22 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x5891F457278aD7BB081A777cB6E0077D3574cf15
0 ETH
0x7fee444e188aee26950df881b9d5cd34eed872b64cb4ec15693371a501387fc8
mined
123 days 22 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
1
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0x63b15Cb2EfBa16058f1e6B32D362cD17567967f5
0.
099
502
487
562
189
054
WETH
0x63b15Cb2EfBa16058f1e6B32D362cD17567967f5
0xA420872a164644469C6a5dA5C1B2740FD3f13667
348
725
.
856
962
458
EDISON
0x3fc61bde111f72abaa57fc1c32fb7bcd22555dbe2f417e446ed213322cde50ae
mined
123 days 22 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0xe50fc9Cd16261bdAF8cc0eD6BeACf26f27481CA6
0 ETH
0x41786fe0824c03edcfc3e238ef6e599d1833cb28e0f8eacdc82ae3569cbf5510
mined
123 days 22 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
1
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0x587Bb2D610f0fF87ac575339Fcf5802d4123090A
0.
099
502
487
562
189
054
WETH
0x587Bb2D610f0fF87ac575339Fcf5802d4123090A
0xe50fc9Cd16261bdAF8cc0eD6BeACf26f27481CA6
124.
896
866
694
DEFLATION
0x587Bb2D610f0fF87ac575339Fcf5802d4123090A
0xA420872a164644469C6a5dA5C1B2740FD3f13667
12
364
.
789
802
804
DEFLATION
0x618efd7c5d19f55bc2a78fbe1654813480004b85f077a3b4e2daece205c66e8d
mined
123 days 22 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x890727BB957B03b3Fc8Fb597B885AF13f3Fd12B1
0 ETH
0xa755c63101b0a5403fce293fd5822145686f5d918f8550fad91258a69db2fca4
mined
123 days 22 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
2
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0xEDa5f992d26F8Dfc4bd65A20cba59F8E3dD28a4d
0.
199
004
975
124
378
109
WETH
0xEDa5f992d26F8Dfc4bd65A20cba59F8E3dD28a4d
0x890727BB957B03b3Fc8Fb597B885AF13f3Fd12B1
760
269
.
708
602
225
nCORAI
0xEDa5f992d26F8Dfc4bd65A20cba59F8E3dD28a4d
0xA420872a164644469C6a5dA5C1B2740FD3f13667
24
582
053
.
911
471
959
nCORAI
0xb5ee90414fe8d816ff2411a1ea66eb2cf0a6c2f6f30cdaadfcd1ba07418bb143
mined
123 days 22 hours ago
0x75713a08
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0 ETH
ERC20 Token Transfers
0xf9A2907a60B660F041f28358505C93DC775396E6
0x5c26170D9ee4DF473cc155bF3DcE554E265CD94F
2
354
701
.
86
BURTS
0x5c26170D9ee4DF473cc155bF3DcE554E265CD94F
0x7a250d5630B4cF539739dF2C5dAcb4c659F2488D
0.
000
382
052
647
926
803
WETH
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x5c26170D9ee4DF473cc155bF3DcE554E265CD94F
297
389
120
.
448
995
481
BURTS
0x5c26170D9ee4DF473cc155bF3DcE554E265CD94F
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
046
472
320
449
727
985
WETH
0xd79b161a395593891ee7d5ec87fe7ea7fc786867ecd64e8a368dc8283d5f702a
mined
123 days 22 hours ago
0x095ea7b3
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0xf9A2907a60B660F041f28358505C93DC775396E6
0 ETH
0x0721db2c5bf49f5aa43c0ad43eb5d784cab3c608756bab8289a3ea109f338aa0
mined
123 days 22 hours ago
0x0162e2d0
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
05
ETH
ERC20 Token Transfers
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0x5c26170D9ee4DF473cc155bF3DcE554E265CD94F
0.
049
751
243
781
094
527
WETH
0x5c26170D9ee4DF473cc155bF3DcE554E265CD94F
0xA420872a164644469C6a5dA5C1B2740FD3f13667
306
586
722
.
112
366
475
BURTS
0x2acf70376fb041d87e34f4ba7ac30e58bd282cfbe5d7ec749ec0214134c6aecb
mined
123 days 23 hours ago
0x75713a08
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0xf0440F95f63AAfd5FF064836aFEAAC6be756d58e
123
895
525
.
705
858
371
603
985
124
MONSTER
0xf0440F95f63AAfd5FF064836aFEAAC6be756d58e
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
015
718
092
721
968
571
WETH
0x5597d9f1f37f20d28ee39b339650293bd5b4a8201f4905ac946827532eb8cbd4
mined
123 days 23 hours ago
0x75713a08
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0 ETH
ERC20 Token Transfers
0xA420872a164644469C6a5dA5C1B2740FD3f13667
0xC71D4e4D01B61c52F4141ceE0273ff4d00EA02F7
37
316
788
.
918
084
758
162
010
128
Grōk
0xC71D4e4D01B61c52F4141ceE0273ff4d00EA02F7
0x3328F7f4A1D1C57c35df56bBf0c9dCAFCA309C49
0.
104
275
467
111
589
829
WETH
Previous
1
2
3
4
...
27
Next