Crypto Academy / Season 3 / Week 4- Homework Post for Professor //@pelon53// - Topic: Root Hash And Merkle Tree
Hello Steemians how are you I hope you will be fine. Alhamdulilah I am also fine with the grace of God. I am very thankful to Professor:@pelon53 for this wonderful lecture. so lets start.
Explain in detail the hash rate?
A hash rate is a unit that measures the processing power of a bitcoin network.The hash rate is simply described as a measure of the computing power. Algorithms of hash functions are required to extract cryptocurrencies in the cryptos ecosystem. This calculation is performed by high power supercomputers. The hash rate is measured in hashes per second. Powerful computers are not all the same, some perform their work faster and some perform their work slow. It means that their power rating are very different from each others. Another name for Hashrate is hashing power with SI prefix hour/second. Hash rat is an important factor in extracting cryptocurrencies to evaluate the performance of blockchain networks. High hash rates are very important in extracting cryptocurrencies, especially for bitcoin miners, because a miner has a higher hash rate, the speed at which miners solve complex hash and reward algorithms for blockchain extraction. , And find the location for the hash and find the next part.
Sometimes prefixes lie Mega , Giga , Tera , Peta , and Exa are included in the S.I unit. High host, this means faster miner performance and thus more data processing per second. It is worth noting that the use of computers with high hash rates can increase the speed of transaction processing in blockchain mining and thus increase the extraction cost. Depends on the cryptocurrency extraction and the type of device or device extracting it. Because different cryptocurrencies do not have the same hash rate. Different currencies do not have the same extraction rate. When the same powerful computer is used to run them, at the same time, you will find that one hash has a higher hash rate than another. Having a high hash rate is very important especially for Bitcoin miners.
Make the following Merkle Tree: Transaction (tree leaves): Steem1; Steem2; Steem3; STEEM4; Steem5; Steem6; Steem7; Steem8?
To create a Merkle Tree for the transaction above, I will do this task by generating SHA-256 for all the leaves. For doing this , I will use SHA-256
After creating the hashes for the leaves, the next step is to generate the branches. Now we will perfomr to generate the Merkel Tree branches hash:
After generating the branches now i will generate in the Merkel Tree is the higher branches:
After generating in the Merkel Tree is the higher branches now i we will generate root hash:
Now we will combine all of these to make Merkle Tree:
The zoom level is very low therefore, i am also showing you screenshort by dividing them into two parts:
Screenshort of both parts:
Tell The Steps To Follow To Verify IF Steem6 IS INCLUDED IN THE MERKLE TREE?
First of all generate the hash of the leaf on one side, which is Steem5
Now we generate Steem5Steem6:
Now we will generate Steem5Steem6 and Steem7Steem8
Now we will combine all parts which is Steem1Steem2Steem3Steem4Steem5Steem6Steem7Steem8 to generate 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?
To create the Merkle tree, i will use this SHA-256
After creating the hashes for the leaves, the next step is to generate the branches.
Now we will generate second level branches:
After creating the second level branches, the next step is to generate the root hash.
Now we will create the Merkle tree to combine all inputs:
Due to low zoom level i am also showing two screenshort by doing zoom in:
If the number of leaves on the tree is odd, what should you do? Explain?
If the number of leaves on the Merkel Tree is odd then we cannot calculate the hash root. In below figure
The last leaf must be doubled to get parent hash.
The above tree have seven leaves as you can see this. We can make the last leaf double by creating new SCA7. We can combine last leaves SCA7 and it will be show SCA7SCA7. As its parent hash and from there we can go to higher level branches and then root the hash.
Hashing is one of the pillars of blockchain. In addition to the security that this operating system provides, miners are rewarded every time they verify hash values by examining complex mathematical problems. In this lecture i have learned more about the importance of hash roots and hastages in the blockchain system. We also found that the cascading system used to manage information in the blockchain is called the Merkel Tree, and its key is to maintain the security and reliability of the data in the blockchain.
Each subject block and transaction data has its own hash, and there are many transactions in a block, so calculating transaction data to manage it is just as complicated. These figures are arranged in a pattern of trees that are known as. Merkel tree, easy and fast deals on blockchain. However, due to the fast trading process in mining, miners who use computing systems with higher hash rates also receive more rewards.
Again thanks to Professor @pelon53 for this wonderful lecture.