Blockchain data records are linked to each other using hash pointers. Hash pointers point to the location of the previous data block and it even contains the message about the content of the block. The pointer allows the programmer to locate the data block and read its content. Inside the block all the transaction messages are organized in the form of a tree known as the Merkle Tree. These trees summarize all the transactions in a block and provides a very efficient process to verify the transactions. Merkle trees are constructed by using hash nodes until there is only one hash node left. The last hash node is called the Root or Merkle Root. Merkle trees use double-SHA 256.

1 Research Scope and Methodology

2 Market Overview

3 Market Dynamics

4 Industry Analysis

5 Competitive Insights

6 Blockchain Application in Healthcare: Opportunity and Use Case Analysis

7 Company Profiles