Transaction
b74fa020fba08591b6a6b3428ba89c0ec8d7a73a65ddd70d2a0cee37272f5b43
Timestamp (utc)
2018-06-27 10:20:11
Fees Collected
0.00051936 BSV
Version
1
Confirmations
487,170
Size Stats
1,653 B
Hex
038efa1204dc64335b0868000000010000000d2f6e6f64655374726174756d2fDecoded
úÜd3[h
/nodeStratum/1 Input
Total Input:
1.5625 BSV
- #0CoinbaseNewly minted coins1.5625 BSV
3 Outputs
Total Output:
1.56301936 BSV
- #2OP_RETURN0.00000000 BSVj* N {"bitcoin":"Bitcoin: A Peer-to-Peer Electronic Cash System\n Satoshi Nakamoto\n satoshin@gmx.com\n www.bitcoincash.org\n Abstract. A purely peer-to-peer version of electronic cash would allow online\n payments to be sent directly from one party to another without going through a\n financial institution. Digital signatures provide part of the solution, but the main\n benefits are lost if a trusted third party is still required to prevent doN uble-spending.\n We propose a solution to the double-spending problem using a peer-to-peer network.\n The network timestamps transactions by hashing them into an ongoing chain of\n hash-based proof-of-work, forming a record that cannot be changed without redoing\n the proof-of-work. The longest chain not only serves as proof of the sequence of\n events witnessed, but proof that it came from the largest pool of CPU power. As\n long as a majority of CPNª U power is controlled by nodes that are not cooperating to\n attack the network, they'll generate the longest chain and outpace attackers. The\n network itself requires minimal structure. Messages are broadcast on a best effort\n basis, and nodes can leave and rejoin the network at will, accepting the longest\n proof-of-work chain as proof of what happened while they were gone."}https://whatsonchain.com/tx/b74fa020fba08591b6a6b3428ba89c0ec8d7a73a65ddd70d2a0cee37272f5b43