How the BlockChain works


SUBMITTED BY: Newton

DATE: Nov. 4, 2017, 5:04 p.m.

FORMAT: Text only

SIZE: 2.7 kB

HITS: 1290

  1. If you are completely new to Bitcoin, you may find my second answer more accessible, which is a less technical description.
  2. As you said, the blockchain is a log of all transactions that were ever verified on the Bitcoin network.
  3. The transactions are collected in blocks, which are found approximately every ten minutes in a random process called mining. As transactions transfer ownership of Bitcoin balances, each of these blocks represents an update of the user's balances on the network.
  4. By following the blockchain from the Genesis Block and applying all transactions that were validated in each block in the correct order, you arrive at the current status quo.
  5. Each block header contains:
  6. Bitcoin Block Data [Illustration by Matthäus Wander (Wikimedia)]
  7. Timestamp:
  8. The time when the block was found.
  9. Reference to Parent (Prev_Hash):
  10. This is a hash of the previous block header which ties each block to its parent, and therefore by induction to all previous blocks. This chain of references is the eponymic concept for the blockchain.
  11. Merkle Root (Tx_Root):
  12. The Merkle Root is a reduced representation of the set of transactions that is confirmed with this block. The transactions themselves are provided independently forming the body of the block. There must be at least one transaction: The Coinbase. The Coinbase is a special transaction that may create new bitcoins and collects the transactions fees. Other transactions are optional.
  13. Target:
  14. The target corresponds to the difficulty of finding a new block. It is updated every 2016 blocks when the difficulty reset occurs.
  15. Nonce:
  16. An arbitrarily picked number to conveniently add entropy to a block header without rebuilding the Merkle tree.
  17. The block's own hash:
  18. All of the above header items (i.e. all except the transaction data) get hashed into the block hash, which for one is proof that the other parts of the header have not been changed, and then is used as a reference by the succeeding block.
  19. As many miners compete to find the next block, often there will be more than one valid next block discovered. This is resolved as soon as one of the two forks progresses to a greater length, at which any client that receives the newest block knows to discard the shorter fork. These discarded blocks are referred to as extinct blocks (sometimes also referred to as orphaned blocks, although their complete ancestry is known).
  20. When a transaction is submitted to the network, it is passed on peer to peer by all clients. Upon discovery miners will put it on their list of transactions that they want to verify and update the Merkle Root.
  21. On Blockchain.info you can track a transaction either by requesting the page directly with the transaction hash

comments powered by Disqus