STEEMCRYPTOACADEMY SEASON3/WEEK4/ HOME-WORK POST FOR PELON53

36adcfb0480a02581f6fd4c63a71d0e4.jpg
source

Explain in detail the hash rate

Hash-rate can be used to accessing the strength of a block-chain network, to be specific the security of the blockchain, with my all-round accessment I came to realize that blockchain can't work without hashes and blocks, the more different machines used torolly assists different miners to know their next block it will be very hard for the network to be disrupted because the higher the hash-rate the greather it becomes difficult for hackers to gain access.

No matter how deplomatic hackers can be it's very different to access blockchain hashes simple because blockchain seems to be very deligent and it has a system at which it operates this particular one is called longest chain rule groups of individual who are saddled with the responsibility of controlling enough hash-rate can block and notify a transaction in this process reversal is very much possible.

So many up and downs will come to fruition thereby bringing the efficacy of the blockchain to disreput, if a hash-rate is reduced the the blockchain will be in trouble because along the process it will be very vonurable.

Hash-rate FAQs

We have some acronyms which stands for different things for example we have the 89 EH/s, this signifies exahashes in a single seconds this means that we have quiltillions hashes in a single seconds, this signifies that miner's accumulates quiltillions of hashes in a single seconds, this is massive.

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.

Screenshot_20210721-220511~2.png

Hash

7760E25BCB80ADF1DD92DB339BF5790A59E90CD54EFA072F1250DCE13FA97045

Screenshot_20210721-221515~2.png

Hash

FE00506E91CF52BC4B35321E6B978D1A7349397B19C6C1C01E095971FDEC9741

Screenshot_20210721-221856~2.png

Hash

A9418332E0C351D6A50C835AA9E57D514F0573C231D491E97726DB8A5844F2DC

Screenshot_20210721-222124~2.png

Hash

22F4EC8E20C9CCAF2C313B23F18981B1C73BF39081BCD739E5D998A95A46AB30

Screenshot_20210721-222340~2.png

Hash

2A3C87336683AB0DDFA56AFEFC740E6C13A02FEA0A43D6797343B26D7AF0C57B

Screenshot_20210721-222548~2.png

Hash

A7BAA6DE0C0658E9E3681966E542BACD116529F5AE9A2D9126CDB1C1D5BC1278

Screenshot_20210721-222831~2.png

Hash

D441688DDA7F9285E8811728DD9A3955CF74F0A3C7600C1589D0F1D3B48FFAC7

Screenshot_20210721-223057~2.png

Hash

F2E38ED4FF662087B6E9BEAFA4158EBC488B995732057BDA019A6A77FFB5F9F5

  • Now we can proceed to generate the Merkel Tree branches hash

Screenshot_20210721-224056~2.png

Hash

A5568957014F6AC3866923C7DE20D375E706B8D8C9F453636E90B9965ABEC62B

Screenshot_20210721-224804~2.png

Hash

18D25196DB699F6AB9222B7302EB8A6F6EBFADEC703C07DD5DB8D9455913A499

Screenshot_20210721-225148~2.png

Hash

D118E137F92A0DBEA138B6BF70C7714153A7BC393CD0272A44BD94864645224B

Screenshot_20210721-225351~2.png

Hash

A81D57BA11AEDFA9EFBBA42F6523D75D1EFA50B22C5E3557A21CEFFE87DDFC4A

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

Here I weill generate in the Markle Tree is the higher branches making use of Steem1, Steem2, Steem3

Screenshot_20210721-230925~2.png

Hash

C733190E4604D4FFC4D7B587FB1E14785893FA594CC8EA18E41EF9DF5850A36A

Screenshot_20210721-231423~2.png

Hash

8B0935AEAB3F51BFA2B0750703EE2387E2B20EB19B0D24227E180C03A851AF17

Here I will generate the Markle tree, I will generate the Root Hash also known as the Merkle root

Screenshot_20210721-232812~2.png

Hash

9C2FC83F36D59B8ED5033D2BCC417728583C8DAA0AA9868FD374BE3619D6E4F9

In this phase now you can combine the root hashes together, the second level branches too, the branches and leaves will thus create our Merkle Tree

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.

Here what we will do first is to generate Merkle tree leaves.

Screenshot_20210722-130045~2.png

Hash

13E0A04BB0E669E1C638DBE3A704743F99F162B25245E4D8C064D35BA38FA8C8

Screenshot_20210722-130430~2.png

Hash

27849353A9C8CC4E948EB6E5748EDD79CB83513D8C0ADAF3E8C83D3792C9149B

Screenshot_20210722-130726~2.png

Hash

67E872F952C105C35E0BCE130536D061F4999DCA5593754BA9BA7BE59B8E7C0D

Screenshot_20210722-131049~2.png

Hash

491928A32BAE70A12FA251412BBFD7C9999F317BA6BF577C283C724225270A43

Screenshot_20210722-131252~2.png

Hash

99C078C39CDE7F47799E0E8691460A9F3E83E78D498EA989308FCFCC58907B19

Screenshot_20210722-131506~2.png

Hash

7A648D887B124DB14E96E23BA92783E7F26D00957C19B9B8229632C2C1873729

Screenshot_20210722-131742~2.png

Hash

7E0BBD6BA4BA9896F9911AF46B06DD2C47535F9C80B29D693FDF6B9319D0D68E

Screenshot_20210722-132301~2.png

Hash

562ABCEEB497E1FE7AE275A883FD5EF9D92A05F5C19D82ABAA0DC1571B7DF3AD

At this phase I will try and develop Merkel Tree branches

Screenshot_20210722-133123~2.png

Hash

91B09BBA815748166FB36413342C7E4E7E809F4BAC538C0418841A4476B527EF

Screenshot_20210722-133437~2.png

Hash

B49B48697A3ACBC5E3D2E36B6EE49C44020D88E664C5C1AA7A7CF34058177379

Screenshot_20210722-133754~2.png

Hash

F026924CD1285FF92C2A2DE9B9313027EB67273A82375C939348C887F6B52F77

Screenshot_20210722-133948~2.png

Hash

AA55EC5A6B11393B289C4B2B6916172ACC2941C5C978FB1D7BF02696BAB323A4

The next step is to generate Merkel Tree in the higher level branches

Screenshot_20210722-134442~2.png

Hash

F50DC120CBF6C46923037F6D7F41D4153ECC9AB7430DDA662C142DB1FFE483F7

Screenshot_20210722-134654~2.png

Hash

A3D8CA8494CC426ABD5E1FC5FA0FEAE4F2B2ECE4C4CECDCA05E19EB66542533F

At this phase I will generate the root hash of the Merkel Tree

Screenshot_20210722-135156~2.png

Hash

CB40CA6DB72DD507CF9118963F94B7740822258E74AFB0FD45D89DB35D24B386

creating the Merkel Tree is possible now what we should do now is to sum up the various hashes we have officially created, from the ones I have been creating I'm sure you see the hashes clearly

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

If the number of the leaves on the trees appears to be odd it will be very difficult to calculate the root hash since it is divided in such a way that it appears to be even whether you are looking for the root hash, or the parent hash for me what should be done here is to create another branch that will be equivalent to making sure that the parent/root hash is balanced

Let's say for example you are asked to generate a root hash of SCA1;SCA2;SCA3;SCA4;SCA5. This particular one is odd so what you need to do is to add SCA5; again in order to balance up since it must be even

Conclusion

From my assignment you will understand that Hash-rate is basically used to access the strength of blockchain network and security, blockchain itself cannot operate or function without blocks

It will be very difficult for blockchain to be disrupted because the higher the hash-rate the higher it becomes for hackers to gain access to the blockchain

Miners in the blockchain accumulates lots of hashes in a single seconds, quiltillions of hashes within a shorter possible time frame seconds to be precise

Merkle tree constitutes of leaves, hashes, and root hash and it is very simple for it to be generated you can use SHA-256, to generate anything you feel like generating

Many thanks to you professor @pelon53 I really enjoyed your fantastic lecture and I learnt alot hopefully I will explore more of your lectures

Cc:@pelon53

Sort:  
Loading...

Coin Marketplace

STEEM 0.30
TRX 0.12
JST 0.033
BTC 63642.15
ETH 3126.93
USDT 1.00
SBD 3.87