Address

0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25

0.000093389166906 ETH
386.28 NGN

Confirmed
Balance0.000093389166906 ETH386.28 NGN
Transactions871
Non-contract Transactions868
Internal Transactions0
Nonce838
ContractQuantityValueTransfers#
$BASED163994213500.267515407 $BSD-1
.--. . .--. .373192.82731962833972168 .--. . .--. .-1
0xShards7000000000 0xShards-1
0xpepe0.000000000000000001 70657065-2
AEROTYNE0 ATYNE-3
APOLLO1386000 APOLLO-1
Alien Life Form31791.150455690300239733 ALF-1
Amazon AI0 TITAN-2
Amphibious800000 AMPHI-1
Apple Toilet7500 iPoop-1
Ara Ara0 ARA-3
Arbitrum Classic0 ArbC-2
Armstrong3041948.007324453 ARMSTRONG-1
Asian Monetary Fund14524473.230426459071659436 AMF-1
BOBA0 BOBA-2
BOG COIN0.000000000000000001 BOG-2
BRAH0.000000013281250001 BRAH-2
BULLFROG0 BULL-3
Baby SpaceID16575863.462722175 BID-1
Bank Of Bone16000000 BBANK-1
Based Launchpad0 $BASEDP-2
Bender Save The World700000000 BSTW-1
Bestial AI0 BESTAI-3
Beta1495352.91250036795795798 BETA-1
Bitcake1442833519.331195671 BITCAKE-1
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.15000 BITCOIN-1
Bitpepe0 BITPEPE-2
Blastar 198416000000 Blastar-1
Bogdanoff0 BOGD-5
Bogdanoff Coin0 BOG-2
Bonk0 BONK-2
Boomer Coin0 BOOMER-3
Burn2Earn0.9606819677453125 bERN-3
Burning Optimus13767.70057651 BOPTIMUS-1
Butterfly Doge0 BOGE-2
CATCH0 Catch-3
CHLOE1381878.028394746 CHLOE-1
CZ HULK0.142487528 HULK-2
Camila0 CAMILA-2
ChaosGPT0 CHAOS-3
Conan Inu0.275873122777894229 CONAN-2
Coomer371797.178131871 Coomer-1
Copilot X Ai15000 XAi-1
Crab Coin7500000 CRAB-1
Crash Bandicoot0 CRASH-3
Crazy Frog0 CFROG-2
DUCK0 DUCK-3
Degen Coin0 DC-3
Dejitaru Pepe0 DPEPE-3
Derpina0 DERPINA-3
Deutsche Bank0 DB-2
Dodo579600000000 DODO-1
Doge Twitter0.437934851 Ditter-2
DogeBot5850000000 DB-1
DogeCEO75000 DEO-1
Dogina Inu0 DOGINA-2
EGGHEAD0 EGG-3
ELONCOCK470734.983641617 ELONCOCK-1
El Chapepe8000 Chapepe-1
Elonaut663211.138734575464951661 $ENAUT-1
Ethereum Doge0 ETHOGE-2
Exa Dark Sideræl Musk0 Y-3
FANTASY0 FAN-3
FELIX THE CAT0 FELIX-3
FLIED LICE0 FLICE-5
Faded261835.249956194 FADED-1
Floki XAI0 FXAI-2
Flork0 FLORK-3
Frappe Coin800000000 FRAPPE-1
Fred Flintstone7392000000 FRED-1
Fuck Shytoshi750000000000 Timerugger-1
FuckPauly0 FKPAULY-2
G3NES1S LABS0 G3NES1S-3
GAS0 GAS-2
GEN-00 BLURR-3
GOCHAN COIN0.038698952150487596 GOCHAN-3
Gatsby Inu0 GATSBY-3
Goonz0 GOONZ-3
Goonz_Dividend_Tracker0 Goonz_Dividend_Tracker-2
HARPOON952.942383262883763398 HRP-1
HI inu0 HI-3
HODL4689016382711.842614938 HODL-1
Harry Bolz0 HARRY-2
Hobbes Inu0 HINU-3
Honkler15000 HONK-1
Hush Inu7999999.2 HUSH-1
I'm down so much, I smashed my TV in front of 22 guests at my sons birthday party because of ETH price. My wife just took our crying kids and said they’re all spending the week at her mom’s house.0.05433594545000458 FKCRYPTO-2
ICY ZK0 IZK-3
INUZUKA0 INUZUKA-3
Irida9520000 IRIDA-1
It's Corn0 CORN-3
KRYPTOWALLET0.206531577 KRYPTO-2
LEGALIZE NUCLEAR BOMBS57992.197476606862478775 LEGALIZEBOMB-1
LK-99 Protocol0.252486266034978119 LK99-2
Laser Token0 LASER-3
LiteDoge16000000000 LD-1
Llama Ai4859236.33232104 Llama-1
LowClub0 LOWC-2
MEEM0 MEEM-3
Martin0 MARTIN-3
Matrix0.190300658 Matrix-2
MemeAI10722525127115.361073814130761211 mAI-1
Memes Of Production0 MOP-2
Merch0 MERCH-2
MetamorphosisAI0 MetamorphosisAI-2
MetamorphosisAI42500000000 MAI-1
MetamorphosisAI0 METAMORPHAI-2
Mia Khalifa0 MIA-2
MommyMilkers0 MM-3
Mookie The Monkey0 MOOKIE-3
MsKermit0 MSKER-2
Nav.al0 WAR-2
New World Currency0 NWC-3
No Name0 $NN-2
None Trading0 NONE-2
Obscro611027.545481138 OBRO-1
Octopus Game0.38795886383352012 OCTG-2
Okiku Kento5669408548391.931116627 Okiku-1
Okiku Kento2040346500000 OKIKU-1
One Protocol1799.655979083337540012 $ONE-1
Only Down0 Own-3
Only Retards0 OR-2
Oswald the Lucky Rabbit0 OSWLD-2
Ouka40000 OUKA-1
PEPELITO0 PELITO-2
PePeCouple1244254530.838104221 PePe Couple-1
Pepe Eat Pepe450000000 POMNOM-1
Pepe The Frog14000 OGPEPE-1
PepeBurn0 PEPEBURN-3
PepeCash0.486274545435516943 PCH-2
Piper2740341.927113942784538707 PIPER-1
Platinum Pepe750000000 $PLAT-1
Point One399837.84566575042578125 .1-1
Poocoin7920000 POO-1
Poseidon Greek God9981467.020378095213179549 Poseidon-1
Prisoner $101LP Bob0.16796875 $101LP-2
Pulse Cat34682214.8826 KISHKA-1
PulseShiba0 PUSH-3
RETARD74921798.008257061173446553 RETARD-2
Ravenous Bugblatter Beast of Traal18400 TRAAL-1
RektMoon Classic0.31840983 REKT-2
Roaches.gg35000 ROACH-1
RugMoon0 RMOON-2
RyoshiOriginalVision0 ROV-2
SALT4500000 🜮-1
SHABU INU0.433704736275178535 SHAB-4
SOBRAVE16000 #SOBRAVE-1
Samoyedcoin0 SAMO-2
Sasuke0 SASUKE-2
Sharecoin0.399931208 SCS-3
ShiBolt0 ShiBolt-4
ShibHex0.314901426233198274 SHIBHEX-2
ShibTronix0.4336640625 SHTRX-2
Shiba Optimus0 SHIBTIMUS-2
Sign62100000000 SIGN-1
SnailPepe0 SPEPE-3
Sonic The Frog13938.652 $SOFRO-1
Sonichu0 SONICHU-3
SpaceGPT40.46053308 SGPT4-3
SpaceXAI0.283890355861819057 Merlin-3
Spider Verse15000 SPIDER-1
SpongeBob0 SBOB-2
Stadia96 STADIA-1
Staking Club197001.23428876 STAKINGCLUB-1
Steve Nakamoto0 BITAPPLE-2
Sushi Inu11175 SUSHI-1
TESTEST12973746853.019904203998761469 FgjfhF-1
TESTTESTTEST751141652.639564328497218734 WOWOOWOWOW-4
THE EXORCISTS742.105627731 EXOS-1
TLIST5029529.626509755560927091 Twitter List-1
TMFNR50928599.357402322 $TMFNR-1
Tanuki Inu2198920.697047297 Tanuki-3
Teddy Green0 $TEDDY-3
Telomian Inu9341656.734122745 TIN-1
The Godfather4500000000 GODFATHER-1
The Heart Of Gold0.020560376538198152 THOG-3
The Life Of Dragons0.10677233847063812 SEIKATSU-3
The Meme3549979.369376061350601284 MEME-1
The Meme King1189042484.788390191 MELON MUSK-1
The Neuralink Pig0 GERTRUDE-3
TheTerminator1759.977116768 TERMINATOR-1
Throg0 THROG-2
Time Machine16000000 TIME-1
Tron Classic0 TrxC-2
TsukaReborn6555000 TR-1
Twitter 2.00.000000001 Twitter2.0-4
Twitter Doge0.167653245 TDoge-2
Twitter Doge0 TWOGE-3
Twoge0.019207598 TWOGE-2
UEE😭🥺💧Eu💧💧EE😭😭E EUE🥺🥺😭UUUE😭🥺💧🥺😭ue 💧 ee😭🥹💧 ue 🥹 e e e 😭. e 💧🥺😭 Uueuuue. 💧 💧ue 😭🥺 ee e 🥺🥺😭 eUEE 💧🥹💧 EEE 💧💧😭 U E 🥺😭 EE H💧🥺😭 E EUU 💧🥺😭 UUEHH 🥺 EE H 💧🥺😭 EUEH🥺💧💧💧ue e 😭😭 eeeeee💧💧💧 uu 🥺😭 hh😭🥺 uUEEE 🥺😭💧 uuuue. 💧😭🥺😭 ueeeeee 💧🥺😭💧0.03 CRY-2
UGLY PEPE800000000 UGLYPEPE-1
USD Coin0 USDC-2
Vagabond1258000000 VAGABOND-1
Valkyrie750000 VALKYRIE-1
Virtual AI0 Virtual-2
Vive la Resistance0 REVOLUTION-2
Voices of Defi0 VOC-3
Weasel513825851.604336716872515551 黄鼠狼-1
Windy70021502.17549099777450049 WD-1
Wojak Doomer0 DOOMER-2
Wrapped Arbitrum85000 WARB-1
X KILLER0 Y-3
X-GPT0 X-GPT-2
XDice Casino0 XDC-2
Yi Long Ma0 MA-5
Yi Long Ma0 MA-2
ZK Rinia0 ZKR-2
Zoomer Money517500000 ZOOMER-1
friendlend0.000000000000000001 FLEND-3
mi pinxe lo crino tcati0 TCATI-2
ok I need PRICE TO GO UP. I cant take this anymore. every day I am checking price and its dipping. every day, check price, bad price. I cant take this anymore, I have over invested, by a lot. it is what it is. but I need price to GO UP ALREADY. can devs DO SOMETHING6731040000000 PRICEGOUP-1
pepjj0.000000000000000001 PEPJJ-5
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀0 ⠀-2
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⡤⢤⣀⣤⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠀⠀⢀⣠⢶⠞⢩⣧⡨⠿⠿⢿⡝⠯⠛⠶⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⢀⣶⠟⠍⠁⢒⠿⡠⠖⠉⠉⢙⣷⠀⠀⠀⠈⠩⣲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⢤⡿⣥⡖⣲⣿⣿⣞⣁⣀⠴⢚⣿⠛⣷⡈⣆⠀⠱⡌⠉⢧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⢰⡿⢛⣶⣿⣿⣿⠋⣹⣟⣁⣴⣾⠃⢀⡏⠇⠸⡀⠀⢱⠀⢈⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⣿⡇⡘⣾⣿⣿⡇⣸⡯⠽⠟⢋⣉⠑⡞⠀⡼⢠⢧⠀⠀⡇⠈⢿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠐⡿⢰⢁⡟⠀⠉⣰⠙⡿⣷⣶⢦⡄⢰⠁⢰⠃⣸⡌⠀⢸⠃⢀⢾⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⣷⢸⢸⢧⡰⢼⣿⡀⠉⠀⠈⠀⠀⠀⢧⢇⣸⣳⠁⡰⢃⠀⣸⣿⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⢿⣿⡸⣼⡝⢦⠣⠁⠀⠀⠀⠀⠀⠀⠘⠙⠻⢥⠞⢁⠜⣰⣿⣿⡿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠈⢿⢿⣼⣇⠘⣧⡀⠀⠀⠀⠀⠀⠄⠀⠀⠀⠀⣼⣧⣾⡷⠛⢿⠓⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠸⠺⣿⣿⣇⣿⠙⢦⡀⠀⠀⠀⠀⠀⠀⢀⣼⡿⠋⠀⠀⠀⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⢀⡤⠶⠶⠿⢿⣿⡇⠀⠀⠈⠓⠤⣤⡤⠖⠊⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⡴⠋⠀⠀⠀⠀⠀⠙⠓⠤⠄⣀⡀⠀⢸⣷⣦⡤⠤⠖⠒⠒⠢⢤⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⢸⠃⠀⠀⠀⠀⠀⢀⢆⡀⠀⠂⠒⠒⠒⠻⠦⣄⡀⠀⢀⠢⠤⠤⢄⡹⣦⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⡚⠀⠀⠀⠀⠀⠀⡸⠋⠀⠀⠀⠀⠀⢀⠀⠀⠀⠈⠳⡄⠀⠀⠀⠀⠀⠈⠉⠳⣤⡀⠀⠀⠀⠀⠀⠀⠀⠀ ⢹⠀⠀⠀⠀⠀⢠⠇⠀⠀⠀⠀⠀⠀⠻⠇⠀⠀⠀⠀⠙⡄⠀⠀⠀⠀⠀⠀⠀⢬⣱⣄⠀⠀⠀⠀⠀⠀⠀ ⠀⣇⠀⠀⠀⠀⢸⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⠀⠀⠀⠀⠀⠀⠀ ⠀⠻⡄⠀⠀⠀⠀⢇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⡿⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⣷⠀⠀⠀⠀⠈⡦⣀⠀⠀⠀⠀⠀⠀⠀⣀⠠⠖⠋⠈⠳⣄⠀⠀⠀⠀⠀⠀⢠⡟⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠹⡄⠀⠀⠀⠀⢸⠈⠉⠒⠒⠒⠊⠉⠁⠀⠀⠀⠀⠀⠀⠈⠳⣆⡀⠀⢀⡴⠟⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⢥⠀⠀⠀⠀⢸⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠐⡿⠛⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⢸⡄⠀⠀⠀⢸⣧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠀⣧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠈⣷⠀⠀⠀⠀⡹⣿⡴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⠀⠀⠛⢧⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⣿⠄⠀⠀⠀⣿⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠱⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠭⠄⠀⠀⡰⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠻⡄⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠸⡆⠀⢰⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠓⢄⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⢻⣄⡎⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠢⡱⡄⠀⠀⠀ ⠀⠀⠀⠀⠀⠈⡿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠀⠀⠁⠙⡄⠀⠀ ⠀⠀⠀⠀⠀⢸⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠃⠀⠀⠀⠀⠹⡄⠀ ⠀⠀⠀⠀⢀⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠑⢦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠏⠀⠀⠀⠀⠀⠀⠹⠀ ⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠢⡀⠀⠀⠀⠀⠀⠀⠀⡞⠀⠀⠀⠀⠀⠀⠀⠀⢳ ⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠢⡀⠀⠀⠀⠀⢀⡇⠀⠀⠀⠀⠀⠀⠀⠀⢸ ⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⡄⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈ ⠀⠀⠀⠀⠘⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⡆⢀⣾⠏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⢳⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⡏⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⠀⠀⠀⠀⠈⢧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢳⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀111515151.504 BOOBS-1
𝕏 Payment 2.00 𝕏PAY2.0-2
𝕏 Payments0 𝕏PAY-2

Transactions

0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.030728800297336031 ETH171857.27 NGN127103.11 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
ERC20 Token Transfers
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
15000000 SAMO-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
0.015 ETH84241.23 NGN62044.29 NGN
ERC20 Token Transfers
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
97201071.5636322 𝕏PAY2.0-
ERC20 Token Transfers
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
64934537.97214109 𝕏PAY2.0-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.065967033841913919 ETH106591.52 NGN272858.52 NGN
ERC20 Token Transfers
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
100 USDC-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
0.02 ETH32316.60 NGN82725.72 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.489048074746286824 ETH614327.64 NGN2022842.70 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.09507194569490462 ETH119426.55 NGN393244.76 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
ERC20 Token Transfers
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
155999.999999999999999999 BOG-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.09507194569490462 ETH119426.55 NGN393244.76 NGN
ERC20 Token Transfers
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
156000 BOG-
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
0.5 ETH628085.12 NGN2068143.00 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.491393420988440677 ETH621387.44 NGN2032543.73 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
ERC20 Token Transfers
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
319724399.999999999999999999 PEPJJ-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
31652715600 PEPJJ-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
ERC20 Token Transfers
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
4000000 FLEND-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
3999999.999999999999999999 FLEND-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.325300224999322292 ETH411355.68 NGN1345534.77 NGN
ERC20 Token Transfers
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
8000000 FLEND-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
ERC20 Token Transfers
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
319724400 PEPJJ-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
31652715600 PEPJJ-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0 ETH0.00 NGN0.00 NGN
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.098334218341298408 ETH124347.71 NGN406738.45 NGN
ERC20 Token Transfers
 
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
63944880000 PEPJJ-
0x00001eD6c88C33dFbf91d10bEA764ECE0Fea2d25
 
0.098334218341298408 ETH124347.71 NGN406738.45 NGN