Steeemit Crypto Academy || Season 3, Week 4 || Root Hash and Merkle Tree || Home Work Task Submitted to @pelon53

Hello to all of crypto academy student, it is with great thank as I was able to be a participant the s3w4 assignment post of professor @pelon53, I have been able to assimilate the written post by the professor and I have also made research on the given assignment which is ROOT HASH AND MERKLE TREE, I was able to give back what I have learned in my own understand, I stand corrected in any way I might have come short of information..

HASH:-

Hash are code used to represent information or data of any length, they are of fixed lengths with alphanumeric characters, they are functions that mathematically convert a block of smaller or larger information, which is summarized in a single hash. The blockchain technology keeps tracks of transaction saved with the help of hash, so hash are not to be underrated as they are unrepeatable, irreversible and efficient.

To generate a hash of a particular word using SHA256 which is one of the cryptographic algorithm used to generate hash code among others which are SHA1, SHA512 and MD5, For a clearer understanding to generate the hash code for steem using the SHA256 algorithm.
Cick the SHA256 , input the word steem and click generate this hash code will be given

D78A2745ED4B1959A3CCA09A7364FEA0AE6300FF41463E15D6DD52B1B0FE454D

Note:- if any of the input character is change to an uppercase or a number is added or few words are added, it will automatically generate a different hash.

Explain in detail the hash rate.

To understand hash rate, a brief understanding of mining will be needed, in mining, solving of complex computational problems are required by miners to find a new hash, several attempts are made to create a new hash, when this hash is created the block is closed and added to the blockchain. After done with this process of mining, newly created crypto are awarded to miners each time a new block is mined.

The hash rate, therefore, As more miner mines, the computational power per second used in mining is known as the hash rate, the processing of lots of data in a single second can be done with the help of a machine with high hash power and are highly efficient, hash rate can be measured in unit of hash per second, that is H/S. Hash rate is important because of its security, it accesses the strength of the blockchain with its standard of measurement.

The proof of work blockchain(Bitcoin) are mined through solving complex computational problem, so the total combination of computational power used in mining and processing transaction is referred to as hash rate.

Make the following Merkle Tree:
Transaction (tree leaves): Steem1; Steem2; Steem3; Steem4; Steem5; Steem6; Steem7; Steem8.
I made it to the Root Hash. And put every hash generated using SHA-256 , show screenshots.
Tell the steps to follow to verify if Steem6 is included in the Markle Tree.

SHEET

• Steem1
  

7760E25BCB80ADF1DD92DB339BF5790A59E90CD54EFA072F1250DCE13FA97045

• Steem2
  

FE00506E91CF52BC4B35321E6B978D1A7349397B19C6C1C01E095971FDEC9741

• Steem3
  

A9418332E0C351D6A50C835AA9E57D514F0573C231D491E97726DB8A5844F2DC

• Steem4
  

22F4EC8E20C9CCAF2C313B23F18981B1C73BF39081BCD739E5D998A95A46AB30

• Steem5
  

2A3C87336683AB0DDFA56AFEFC740E6C13A02FEA0A43D6797343B26D7AF0C57B

• Steem6
  

A7BAA6DE0C0658E9E3681966E542BACD116529F5AE9A2D9126CDB1C1D5BC1278

• Steem7
  

D441688DDA7F9285E8811728DD9A3955CF74F0A3C7600C1589D0F1D3B48FFAC7

• Steem8
  

F2E38ED4FF662087B6E9BEAFA4158EBC488B995732057BDA019A6A77FFB5F9F5

BRANCHES

• Steem1Steem2
  

A5568957014F6AC3866923C7DE20D375E706B8D8C9F453636E90B9965ABEC62B

• Steem3Steem4
  

18D25196DB699F6AB9222B7302EB8A6F6EBFADEC703C07DD5DB8D9455913A499

• Steem5Steem6
  

D118E137F92A0DBEA138B6BF70C7714153A7BC393CD0272A44BD94864645224B

• Steem7Steem8
  

A81D57BA11AEDFA9EFBBA42F6523D75D1EFA50B22C5E3557A21CEFFE87DDFC4A

BRANCHES

• Steem1Steem2Steem3Steem4
  

8A248C05E69C4F1AA403AD18A7F445FF500C42483DA425CE0C980CDB2FD1AD9B

• Steem5Steem6Steem7Steem8
  

8B0935AEAB3F51BFA2B0750703EE2387E2B20EB19B0D24227E180C03A851AF17

ROOT HASH

• Steem1Steem2steem3Steem4Steem5Steem6Steem7Steem8
  

9C2FC83F36D59B8ED5033D2BCC417728583C8DAA0AA9868FD374BE3619D6E4F9
^{Root hash}

MERKLE TREE

(Steem1Steem2steem3Steem4Steem5Steem6Steem7Steem8)

Tell the steps to follow to verify if Steem6 is included in the Markle Tree.

Merkle tree is a data structure which encodes blockchain data more efficiently and securely, it forms a group or set of data, merging together to create another data with different hash until it reaches the hash root which can generate all the previous hash. It is also referred to as the binary hash tree.

HASH ROOT

The summary of a larger or smaller amount of information in a single hash is known as the hash root, it comprises of all the hashes of each set of data or information in a merkle tree

The hash root has been greatly reliable in the contribution to the block chain, it evaluate data that are received whether they are reliable or not, to verify if steem 6 is included in the merkle tree, since Steem5 is the nearest to Steem6, then we move to the Steem7Steem8 branch, and then to the branch, Steem1Steem2Steem3Steem4, and then lastly to the root hash.

Using the SHA-256; you must place each complete hash in the Merkle Tree.
Transaction (tree leaves): SCA1; SCA2; SCA3; SCA4; SCA5; SCA6; SCA7; SCA8. Explain each step, show screenshots.
If the number of leaves on the tree is odd, what should you do? Explain.

SHEEET

• SCA1
  

13E0A04BB0E669E1C638DBE3A704743F99F162B25245E4D8C064D35BA38FA8C8

• SCA2
  

27849353A9C8CC4E948EB6E5748EDD79CB83513D8C0ADAF3E8C83D3792C9149B

• SCA3
  

67E872F952C105C35E0BCE130536D061F4999DCA5593754BA9BA7BE59B8E7C0D

• SCA4
  

491928A32BAE70A12FA251412BBFD7C9999F317BA6BF577C283C724225270A43

• SCA5
  

99C078C39CDE7F47799E0E8691460A9F3E83E78D498EA989308FCFCC58907B19

• SCA6
  

7A648D887B124DB14E96E23BA92783E7F26D00957C19B9B8229632C2C1873729

• SCA7
  

7E0BBD6BA4BA9896F9911AF46B06DD2C47535F9C80B29D693FDF6B9319D0D68E

• SCA8
  

562ABCEEB497E1FE7AE275A883FD5EF9D92A05F5C19D82ABAA0DC1571B7DF3AD

BRANCHES

• SCA1SCA2
  

91B09BBA815748166FB36413342C7E4E7E809F4BAC538C0418841A4476B527EF

• SCA3SCA4
  

B49B48697A3ACBC5E3D2E36B6EE49C44020D88E664C5C1AA7A7CF34058177379

• SCA5SCA6
  

F026924CD1285FF92C2A2DE9B9313027EB67273A82375C939348C887F6B52F77

• SCA7SCA8
  

AA55EC5A6B11393B289C4B2B6916172ACC2941C5C978FB1D7BF02696BAB323A4

BRANCHES

• SCA1SCA2SCA3SCA4
  

F50DC120CBF6C46923037F6D7F41D4153ECC9AB7430DDA662C142DB1FFE483F7

• SCA5SCA6SCA7SCA8
  

A3D8CA8494CC426ABD5E1FC5FA0FEAE4F2B2ECE4C4CECDCA05E19EB66542533F

ROOT HASH

• SCA1SCA2SCA3SCA4SCA5SCA6SCA7SCA8
  

CB40CA6DB72DD507CF9118963F94B7740822258E74AFB0FD45D89DB35D24B386

MERKLE TREE

(SCA1SCA2SCA3SCA4SCA5SCA6SCA7SCA8)

If the number of leaves on the tree is odd, what should you do? Explain.

if the number of the leaves on the tree is odd, the last leaf will be duplicated to enable the production of a branch, so that the root hash will be generated, for example, if the leaves are SCA1-7 , the SCA7 will be repeated to produce a branch hash of SCA7SCA7, and the tree will be in accordance as it would have been if the leaves were even.

CONCLUSION

Hash is a function that convert input data into code in alphanumeric characters, this enable security in the transfer of information between two connecting nodes in the blockchain network and it convert information of either small or large into an encrypted code generating the same meaning, it manages data information in the blockchain technology making it a good function to the network.

Mining involves solving of complex computational problem to generate a new block thereby transactions are verified and new crypto and generated, when mining, energy consumed during this process by computers when generating a block or blocks of transaction, the rate of energy consumption measured per second is known as hash rate.

The class further more explained the use of hash root, the root of all hashes in a merkle tree, the data structure used in arrangements of transaction hash is known as the merkle tree.

Regards:-

@pelon53