Data corruption and Merkle trees

[@ajiteshsingh3764]

I'm glad someone is exploring and explaining new concepts with real world examples in this race of youtubers who are just creating repetitive content. Hats off to you.

[@iamnessta]

i searched for like this explanation in several youtube videos and i didn't find such a good explanation like this . thank you

[@batman28996]

You have the best System Design channel on YT, Thanks man.

[@maheshgs8192]

Very interesting!! Thanks for sharing your knowledge:)

[@uchennanwanyanwu2777]

There's something so interesting about the way you teach that makes me understand these concepts. Please can you make these videos often, maybe weekly. I am depending on them for my interview

[@rajarsiroy9277]

Great Explanation !!!!

[@pradeeshbm5558]

Beautyful explanation 👏👏👏👏

[@ArpitJoshi1]

Your videos are very intuitive and super easy to understand.

[@architpatel1]

Great 👍

[@dheerajsheetal]

Explained in very simple way. Thanks a lot for the video really helpful.

[@ivanbogatyrev2388]

Awesome

[@akibhasan737]

Wow & Subscribed.

[@nalamda3682]

Awesome Awesome, first time I am watching a real use of algorithm, that also too neatly explained. Man you are super awesome.

[@sauravgupta6166]

Brilliant Sir!

[@dataguy7013]

Very nice video Naren. I like how you give a practical example. Keep it up.

[@mohajeramir]

You explained it really well. Much appreciated!

[@maheshkumartangella5516]

Excellent Video man

[@reetmon2418]

Excellent video - you are the man!

[@ypucandeleteit]

I liked it alot. Thank you for your work and very good explanations

[@boombasach]

Throughly enjoyed. Also now make sense why chunking plays such important role in G-Drive design

[@mockingbird3809]

Excellent explanation on the entire KZbin. Thank you so much

[@subhamchowdhury6607]

Excellent

[@SandeepOnYoutube]

I was searching for a video on merkle tree and I got this great one..

[@shettyyogesh1982]

Good job, keep making more videos !!

[@rimitamitra7587]

This video was very informative. Thank you and keep up the good work 👍

[@ilzammulkhaq8648]

interesting topic for my undergraduate thesis

[@Jennn]

Omg I finally Get It!!! Thank You Thank You! I am seeing a new use case in the wild not talked about with win 11

[@10clicks-freesoftwareengin51]

Good One!

[@syin5028]

Great Video! Thank you!

[@vijendrakhemnar]

Bravo !!! You explained the concept so well ! Keep it up! Subscribed :)

[@florianb2572]

Awesome man! That's exactly what i needed : Use cases. I just wish i could also have a use case with blokchain but i get it anyway so great video!

[@chaitrakeshav]

Concise and effective! Thank you :)

[@BabaJorda]

Very good explanation. Thank you. A question.. why the need to build the tree? Couldn't it be done comparing the hashes of the chunks from the server?

[@RAHULTHAKUR-ij5xu]

Thanks shadow man, it was very helpful

[@LucasOliveira-cs6hz]

Video muito bom obrigado!

[@mohammadkhalafIraqi]

Awesome man!

[@kdakan]

In the case of torrent systems, the root hash value can also be used to identify a different file under the same name, or a different version of the file, so when you search for a file name, it will list several files with the same name but with different root hashes, and the user can choose to download the version he/she chooses (which is still guesswork..)

[@vladimirrotariu8519]

Thank you, Narendra! :)

[@AbhaySingh-nr3er]

this guy is a legend !!

[@bodicherlamaheshbabu2411]

Thanks a lot bro....got a good intuition and understand......

[@subee128]

Thanks

[@abhishekkumarjha5503]

You just earned yourself a subscriber :)

[@ibrahimshaikh3642]

Good one. please create same for hyper log log

[@sachinkalkur]

Can you please also provide the links/research-papers/blogs you used to study these concepts.

[@johnyepthomi892]

Shadow man 😂 caught me off guard …

[@alexd7466]

You've missed the most obvious example: tar, rar and zip files. It was used already decades ago to check the integrity of tape backups.

[@anikethjain4520]

How does it handle hash collisions ? the hash of a corrupted chunk can be the same as the hash of a valid one

[@amanpervaiz2843]

Gold.

[@jinalpatel9154]

Nice explanation. I have one question like here client side have some software and it is possible to compare tree and all that. How this could be used with Web Application that allow download of large file even if we consider file size is 1 GB then too.

[@gauravkhurana420]

Bhaiya , not only root hash is present in torrent file , i think complete Merkel tree has to present so as to check corrupted nodes and reduce the bandwidth.Because root node only verifies whether file is corrupted or not.

[@ravitejavankam2977]

Can you make a video on adding columns to a MySQL table having billions of rows efficiently in production

[@vickyvivek3286]

#totorialssystemdesign why should we build the tree? Why can't we transfer only the hashes of the leaf nodes and retry those file parts where there is a mismatch? You mentioned that sending the whole tree itself over the network is insignificant and hence sending only the hash of the leaf nodes in a list also must be insignificant. This way we don't need to wait till the entire file gets downloaded but retry as soon as there is a mismatch in the hash of that file part. Offset of the file parts can be used to uniquely identify them.

[@HoD999x]

why do we need the tree? why isn't a merkle list (the trees lowest level) enough?

[@kumarc4853]

can we verify if the shadow is of Guru NArendra with Merkel Trees?

[@zcjsword]

Thanks for the good work. Hah, I found a real world example of putting a leetcode programming problem in good use: leetcode.com/problems/same-tree/

[@jayprakashpatidar5641]

Sir what if merkel tree gets currupted while transmitting it on network?

[@venjan21]

I think Merkle tree itself is hashed and has will be compared.

[@anubhavujjawal1661]

Why can't we just use a HashMap which stores hashes of different blocks of data using the index of the block instead of using Merkle tree? I think it might be because verification if the file is corrupted and which parts of the file is corrupted can be done faster in Merkel tree than in HashMap.

[@yurisich]

If your merkle root matches the one you got from your peer, no more work is needed. With each fragment hashed, comparisons take O(n) time.

[@sumonmal009]

THIS COMMENT IS FOR MY PERSONAL REFERENCE. TO UNDERSTAND PROPERLY WATCH THE FULL VIDEO -------------------------------------------------------------------------------------------------------------------------------------------------------------------------- req 0:31 solution idea 1:08 4:41 7:15 11:23

[@InfiniteCubes]

Can u make Gmail system design video?

[@kumarc4853]

Salute to the Merkel Master from a Merkel Dummy. Excellent content!

[@bharath_v]

Good One!