Address 0xc52f91c0DbD6F7170F1f4E9F4e5F3FBe73057bC8

Balance
0.000027462506995728 ETH
Transactions
628
Non-contract Transactions
605
Nonce
560
Unconfirmed transactions
0
Tokens
$hart0.0483 $HART
ERC20 Tokens (179)
A Next-Generation Smart Contract and Decentralized Application Platform Satoshi Nakamoto's development of Bitcoin in 2009 has often been hailed as a radical development in money and currency, being the first example of a digital asset which simultaneously has no backing or *intrinsic value(opens in a new tab)* and no centralized issuer or controller. However, another, arguably more important, part of the Bitcoin experiment is the underlying blockchain technology as a tool of distributed consensus, and attention is rapidly starting to shift to this other aspect of Bitcoin. Commonly cited alternative applications of blockchain technology include using on-blockchain digital assets to represent custom currencies and financial instruments (*colored coins(opens in a new tab)*), the ownership of an underlying physical device (*smart property(opens in a new tab)*), non-fungible assets such as domain names (*Namecoin(opens in a new tab)*), as well as more complex applications involving having digital assets being directly controlled by a piece of code implementing arbitrary rules (*smart contracts(opens in a new tab)*) or even blockchain-based *decentralized autonomous organizations(opens in a new tab)* (DAOs). What Ethereum intends to provide is a blockchain with a built-in fully fledged Turing-complete programming language that can be used to create *contracts* that can be used to encode arbitrary state transition functions, allowing users to create any of the systems described above, as well as many others that we have not yet imagined, simply by writing up the logic in a few lines of code. Introduction to Bitcoin and Existing Concepts History The concept of decentralized digital currency, as well as alternative applications like property registries, has been around for decades. The anonymous e-cash protocols of the 1980s and the 1990s, mostly reliant on a cryptographic primitive known as Chaumian blinding, provided a currency with a high degree of privacy, but the protocols largely failed to gain traction because of their reliance on a centralized intermediary. In 1998, Wei Dai's b-money(opens in a new tab) became the first proposal to introduce the idea of creating money through solving computational puzzles as well as decentralized consensus, but the proposal was scant on details as to how decentralized consensus could actually be implemented. In 2005, Hal Finney introduced a concept of *reusable proofs of work(opens in a new tab)*, a system which uses ideas from b-money together with Adam Back's computationally difficult Hashcash puzzles to create a concept for a cryptocurrency, but once again fell short of the ideal by relying on trusted computing as a backend. In 2009, a decentralized currency was for the first time implemented in practice by Satoshi Nakamoto, combining established primitives for managing ownership through public key cryptography with a consensus algorithm for keeping track of who owns coins, known as *proof-of-work*. The mechanism behind proof-of-work was a breakthrough in the space because it simultaneously solved two problems. First, it provided a simple and moderately effective consensus algorithm, allowing nodes in the network to collectively agree on a set of canonical updates to the state of the Bitcoin ledger. Second, it provided a mechanism for allowing free entry into the consensus process, solving the political problem of deciding who gets to influence the consensus, while simultaneously preventing sybil attacks. It does this by substituting a formal barrier to participation, such as the requirement to be registered as a unique entity on a particular list, with an economic barrier - the weight of a single node in the consensus voting process is directly proportional to the computing power that the node brings. Since then, an alternative approach has been proposed called proof-of-stake, calculating the weight of a node as being proportional to its currency holdings and not computational resources; the discussion of the relative merits of the two approaches is beyond the scope of this paper but it should be noted that both approaches can be used to serve as the backbone of a cryptocurrency. Bitcoin As A State Transition System From a technical standpoint, the ledger of a cryptocurrency such as Bitcoin can be thought of as a state transition system, where there is a *state* consisting of the ownership status of all existing bitcoins and a *state transition function* that takes a state and a transaction and outputs a new state which is the result. In a standard banking system, for example, the state is a balance sheet, a transaction is a request to move $X from A to B, and the state transition function reduces the value in A's account by $X and increases the value in B's account by $X. If A's account has less than $X in the first place, the state transition function returns an error. Hence, one can formally define: The *state* in Bitcoin is the collection of all coins (technically, Üunspent transaction outputs* or UTXO) that have been minted and not yet spent, with each UTXO having a denomination and an owner (defined by a 20-byte address which is essentially a cryptographic public keyfn1). A transaction contains one or more inputs, with each input containing a reference to an existing UTXO and a cryptographic signature produced by the private key associated with the owner's address, and one or more outputs, with each output containing a new UTXO to be added to the state. The state transition function APPLY(S,TX) -> S' can be defined roughly as follows: For each input in TX: If the referenced UTXO is not in S, return an error. If the provided signature does not match the owner of the UTXO, return an error. If the sum of the denominations of all input UTXO is less than the sum of the denominations of all output UTXO, return an error. Return S with all input UTXO removed and all output UTXO added. The first half of the first step prevents transaction senders from spending coins that do not exist, the second half of the first step prevents transaction senders from spending other people's coins, and the second step enforces conservation of value. In order to use this for payment, the protocol is as follows. Suppose Alice wants to send 11.7 BTC to Bob. First, Alice will look for a set of available UTXO that she owns that totals up to at least 11.7 BTC. Realistically, Alice will not be able to get exactly 11.7 BTC; say that the smallest she can get is 6+4+2=12. She then creates a transaction with those three inputs and two outputs. The first output will be 11.7 BTC with Bob's address as its owner, and the second output will be the remaining 0.3 BTC *change*, with the owner being Alice herself0.7426 GENESIS
A Next-Generation Smart Contract and Decentralized Application Platform Satoshi Nakamoto's development of Bitcoin in 2009 has often been hailed as a radical development in money and currency, being the first example of a digital asset which simultaneously has no backing or *intrinsic value(opens in a new tab)* and no centralized issuer or controller. However, another, arguably more important, part of the Bitcoin experiment is the underlying blockchain technology as a tool of distributed consensus, and attention is rapidly starting to shift to this other aspect of Bitcoin. Commonly cited alternative applications of blockchain technology include using on-blockchain digital assets to represent custom currencies and financial instruments (*colored coins(opens in a new tab)*), the ownership of an underlying physical device (*smart property(opens in a new tab)*), non-fungible assets such as domain names (*Namecoin(opens in a new tab)Ü), as well as more complex applications involving having digital assets being directly controlled by a piece of code implementing arbitrary rules (*smart contracts(opens in a new tab)*) or even blockchain-based *decentralized autonomous organizations(opens in a new tab)* (DAOs). What Ethereum intends to provide is a blockchain with a built-in fully fledged Turing-complete programming language that can be used to create *contracts* that can be used to encode arbitrary state transition functions, allowing users to create any of the systems described above, as well as many others that we have not yet imagined, simply by writing up the logic in a few lines of code.0.5661 GENESIS
Bitcoin As A State Transition System From a technical standpoint, the ledger of a cryptocurrency such as Bitcoin can be thought of as a state transition system, where there is a *state* consisting of the ownership status of all existing bitcoins and a *state transition function* that takes a state and a transaction and outputs a new state which is the result. In a standard banking system, for example, the state is a balance sheet, a transaction is a request to move $X from A to B, and the state transition function reduces the value in A's account by $X and increases the value in B's account by $X. If A's account has less than $X in the first place, the state transition function returns an error. Hence, one can formally define: The *state* in Bitcoin is the collection of all coins (technically, *unspent transaction outputs* or UTXO) that have been minted and not yet spent, with each UTXO having a denomination and an owner (defined by a 20-byte address which is essentially a cryptographic public keyfn1). A transaction contains one or more inputs, with each input containing a reference to an existing UTXO and a cryptographic signature produced by the private key associated with the owner's address, and one or more outputs, with each output containing a new UTXO to be added to the state. The state transition function APPLY(S,TX) -> S' can be defined roughly as follows: For each input in TX: If the referenced UTXO is not in S, return an error. If the provided signature does not match the owner of the UTXO, return an error. If the sum of the denominations of all input UTXO is less than the sum of the denominations of all output UTXO, return an error. Return S with all input UTXO removed and all output UTXO added The first half of the first step prevents transaction senders from spending coins that do not exist, the second half of the first step prevents transaction senders from spending other people's coins, and the second step enforces conservation of value. In order to use this for payment, the protocol is as follows. Suppose Alice wants to send 11.7 BTC to Bob. First, Alice will look for a set of available UTXO that she owns that totals up to at least 11.7 BTC. Realistically, Alice will not be able to get exactly 11.7 BTC; say that the smallest she can get is 6+4+2=12. She then creates a transaction with those three inputs and two outputs. The first output will be 11.7 BTC with Bob's address as its owner, and the second output will be the remaining 0.3 BTC *change*, with the owner being Alice herself. Mining If we had access to a trustworthy centralized service, this system would be trivial to implement; it could simply be coded exactly as described, using a centralized server's hard drive to keep track of the state. However, with Bitcoin we are trying to build a decentralized currency system, so we will need to combine the state transaction system with a consensus system in order to ensure that everyone agrees on the order of transactions. Bitcoin's decentralized consensus process requires nodes in the network to continuously attempt to produce packages of transactions called *blocks*. The network is intended to produce roughly one block every ten minutes, with each block containing a timestamp, a nonce, a reference to (ie. hash of) the previous block and a list of all of the transactions that have taken place since the previous block. Over time, this creates a persistent, ever-growing, *blockchain* that constantly updates to represent the latest state of the Bitcoin ledger. The algorithm for checking if a block is valid, expressed in this paradigm, is as follows: Check if the previous block referenced by the block exists and is valid. Check that the timestamp of the block is greater than that of the previous blockfn2 and less than 2 hours into the future Check that the proof-of-work on the block is valid. Let S[0] be the state at the end of the previous block. Suppose TX is the block's transaction list with n transactions. For all i in 0...n-1, set S[i+1] = APPLY(S[i],TX[i]) If any application returns an error, exit and return false. Return true, and register S[n] as the state at the end of this block. Essentially, each transaction in the block must provide a valid state transition from what was the canonical state before the transaction was executed to some new state. Note that the state is not encoded in the block in any way; it is purely an abstraction to be remembered by the validating node and can only be (securely) computed for any block by starting from the genesis state and sequentially applying every transaction in every block. Additionally, note that the order in which the miner includes transactions into the block matters; if there are two transactions A and B in a block such that B spends a UTXO created by A, then the block will be valid if A comes before B but not otherwise. The one validity condition present in the above list that is not found in other systems is the requirement for *proof-of-work*. The precise condition is that the double-SHA256 hash of every block, treated as a 256-bit number, must be less than a dynamically adjusted target, which as of the time of this writing is approximately 2187. The purpose of this is to make block creation computationally *hard*, thereby preventing sybil attackers from remaking the entire blockchain in their favor. Because SHA256 is designed to be a completely unpredictable pseudorandom function, the only way to create a valid block is simply trial and error, repeatedly incrementing the nonce and seeing if the new hash matches. At the current target of ~2187, the network must make an average of ~269 tries before a valid block is found; in general, the target is recalibrated by the network every 2016 blocks so that on average a new block is produced by some node in the network every ten minutes. In order to compensate miners for this computational work, the miner of every block is entitled to include a transaction giving themselves 25 BTC out of nowhere. Additionally, if any transaction has a higher total denomination in its inputs than in its outputs, the difference also goes to the miner as a *transaction fee*. Incidentally, this is also the only mechanism by which BTC are issued; the genesis state contained no coins at all. In order to better understand the purpose of mining, let us examine what happens in the event of a malicious attacker. Since Bitcoin's underlying cryptography is known to be secure, the attacker will target the one part of the Bitcoin system that is not protected by cryptography directly: the order of transactions. The attacker's strategy is simple: Send 100 BTC to a merchant in exchange for some product (preferably a rapid-delivery digital good) ait for the delivery of the product Produce another transaction sending the same 100 BTC to himself Try to convince the network that his transaction to himself was the one that came first. Once step (1) has taken place, after a few minutes some miner will include the transaction in a block, say block number 270000. After about one hour, five more blocks will have been added to the chain after that block, with each of those blocks indirectly pointing to the transaction and thus *confirming* it. At this point, the merchant will accept the payment as finalized and deliver the product; since we are assuming this is a digital good, delivery is instant. Now, the attacker creates another transaction sending the 100 BTC to himself. If the attacker simply releases it into the wild, the transaction will not be processed; miners will attempt to run APPLY(S,TX) and notice that TX consumes a UTXO which is no longer in the state. So instead, the attacker creates a *fork* of the blockchain, starting by mining another version of block 270000 pointing to the same block 269999 as a parent but with the new transaction in place of the old one. Because the block data is different, this requires redoing the proof-of-work. Furthermore, the attacker's new version of block 270000 has a different hash, so the original blocks 270001 to 270005 do not *point* to it; thus, the original chain and the attacker's new chain are completely separate. The rule is that in a fork the longest blockchain is taken to be the truth, and so legitimate miners will work on the 270005 chain while the attacker alone is working on the 270000 chain. In order for the attacker to make his blockchain the longest, he would need to have more computational power than the rest of the network combined in order to catch up (hence, *51% attack*).354481.7076 GENESIS
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠿⠿⠿⢿⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⡿⠛⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⢻⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡓⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⠟⠀⠀⠀⠀⠀⢀⣀⣀⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⡀⠀⠀⢄⠛⠉⠈⠀⠀⠉⠀⠀⠀⠀⠀⢀⣤⣶⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⠛⢿⣿⡗⠀⠀⠀⠀⠐⠋⠉⠿⠋⠏⠀⠀⠀⠀⠋⣶⠋⣶⣶⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⡏⡏⣄⣿⣦⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠨⢿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣧⠀⠈⣿⣿⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣸⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⠂⢻⣿⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢶⣦⣤⣴⡇⠀⠀⢀⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣶⣦⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠁⠁⠀⠀⠀⣾⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣆⠀⠀⠀⠀⠀⠀⠀⢀⣀⣤⣴⣤⣤⣦⣤⡀⣰⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⣤⣤⣐⣿⠋⢹⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣶⣤⡀⠀⠀⠀⠀⠀⣀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠉⢿⣿⣧⣿⣿⡿⠛⠁⠀⠉⠁⠀⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⠀⠈⠁⠀⠀⠀⠀⠀⠀⠀⠀⢠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⠀⠀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿0.9721 ELON

Transactions on this address

Tx hashBlockMinedFrom
ToValueTxn Fee
0x51d2d6…9e23f56624149056Fri, Jan 2, 2026 7:31 PM0xc52f91…73057bC80x6aD9a3…1E45cd64
0 eth
0 ETH
0.000053616301818912 eth
0.000053616301818912 ETH
0x0acb14…d6d0ca8524149056Fri, Jan 2, 2026 7:31 PM0x1B3dA9…d4D4CD040xc52f91…73057bC8
0.00004709192008164 eth
0.00004709192008164 ETH
0.000006866670636 eth
0.000006866670636 ETH
0x9899a3…682afe7d23742620Thu, Nov 6, 2025 8:26 PM0xc52f91…73057bC80xB1bEAD…9f602236
0.00316084271307965 eth
0.00316084271307965 ETH
0.000039808747104 eth
0.000039808747104 ETH
0xcde446…0187acfc23742559Thu, Nov 6, 2025 8:14 PM0xc52f91…73057bC8
Info
From 0xc52f91…73057bC8 to 0xCb04b7…9277D9D93574067695.2596555 STANK
From 0xc52f91…73057bC8 to 0x97Dc3E…7fdB66d3353832701830.70593 STANK
From 0x97Dc3E…7fdB66d3 to 0x80a64c…1FCd5d9e0.00143379736406849 WETH
0x80a64c…1FCd5d9e
0 eth
0 ETH
0.000632363469631504 eth
0.000632363469631504 ETH
0x2ccc2b…937c1b7f23742556Thu, Nov 6, 2025 8:14 PM0x4eFe69…34B583Da0xc52f91…73057bC8
0.002430068539095664 eth
0.002430068539095664 ETH
0.000043238721078 eth
0.000043238721078 ETH
0x040f6f…28ad6adf23570899Mon, Oct 13, 2025 7:33 PM0xc52f91…73057bC80x4eFe69…34B583Da
0.000165952341409662 eth
0.000165952341409662 ETH
0.000020343990303 eth
0.000020343990303 ETH
0xb462f9…82e4f9d323570894Mon, Oct 13, 2025 7:32 PM0xc52f91…73057bC8
Info
From 0xc52f91…73057bC8 to 0x8316b4…d9C0BB698109.864477756 SHIBA
From 0xc52f91…73057bC8 to 0xB1bEAD…9f602236802876.58329788 SHIBA
0x8316b4…d9C0BB69
0 eth
0 ETH
0.00007703298749601 eth
0.00007703298749601 ETH
0x00c174…762dc78c23570890Mon, Oct 13, 2025 7:31 PM0xcE6b61…8202D9820xc52f91…73057bC8
0.000256728201681039 eth
0.000256728201681039 ETH
0.000040962428871 eth
0.000040962428871 ETH
0xfd631b…e6e4fc8d23570860Mon, Oct 13, 2025 7:25 PM0xc52f91…73057bC80xc52f91…73057bC8
0.000009737032911633 eth
0.000009737032911633 ETH
0.000035221744131 eth
0.000035221744131 ETH
0x2358dd…731a065023570816Mon, Oct 13, 2025 7:16 PM0xc52f91…73057bC80xCb04b7…9277D9D9
0 eth
0 ETH
0.000163526835643275 eth
0.000163526835643275 ETH
0xbfcaad…4515324d23570816Mon, Oct 13, 2025 7:16 PM0x4838B1…0BAD5f970xc52f91…73057bC8
0.000034746274402257 eth
0.000034746274402257 ETH
0.000009794139873 eth
0.000009794139873 ETH
0xd2312c…4f0ec98823570790Mon, Oct 13, 2025 7:11 PM0xc52f91…73057bC80xCb04b7…9277D9D9
0 eth
0 ETH
0.000046262308435725 eth
0.000046262308435725 ETH
0xf1a5ea…b419636623570784Mon, Oct 13, 2025 7:10 PM0x887398…d999D3940xc52f91…73057bC8
0.000009244622877 eth
0.000009244622877 ETH
0.000019795356021 eth
0.000019795356021 ETH
0xf4f77a…95f3291a23570779Mon, Oct 13, 2025 7:09 PM0xC559C0…91b9E9970xc52f91…73057bC8
0.000014663980821 eth
0.000014663980821 ETH
0.0000199989405 eth
0.0000199989405 ETH
0x6d6ac4…fcc3acab23570774Mon, Oct 13, 2025 7:08 PM0x2814fC…1f86F5950xc52f91…73057bC8
0.000012254133192 eth
0.000012254133192 ETH
0.000018603866841 eth
0.000018603866841 ETH
0x6c4a67…c464e47e23570769Mon, Oct 13, 2025 7:07 PM0x3Cc833…1750a65e0xc52f91…73057bC8
0.000063059541825 eth
0.000063059541825 ETH
0.000019094452692 eth
0.000019094452692 ETH
0x4fea26…cfb1adce23570766Mon, Oct 13, 2025 7:06 PM0x12F8dB…D820198e0xc52f91…73057bC8
0.000047907433484376 eth
0.000047907433484376 ETH
0.000019095954591 eth
0.000019095954591 ETH
0x97cebe…df5a35ed21746411Fri, Jan 31, 2025 6:51 PM0xc52f91…73057bC80x887398…d999D394
0.009174590847043937 eth
0.009174590847043937 ETH
0.000196571855718 eth
0.000196571855718 ETH
0x59bec5…cf3e9edb21746373Fri, Jan 31, 2025 6:43 PM0xc52f91…73057bC80x6aD9a3…1E45cd64
0 eth
0 ETH
0.000555965362718064 eth
0.000555965362718064 ETH
0xd4f21f…c39dd15621746368Fri, Jan 31, 2025 6:42 PM0x4eFe69…34B583Da0xc52f91…73057bC8
0.01 eth
0.01 ETH
0.000223118111853 eth
0.000223118111853 ETH
Page 1 of 32Last