Merkle Tree | Merkle Root | Blockchain
HTML-код
- Опубликовано: 4 ноя 2018
- Editing Monitors :
amzn.to/2RfKWgL
amzn.to/2Q665JW
amzn.to/2OUP21a.
Check out our website: www.telusko.com
Follow Telusko on Twitter: / navinreddy20
Follow on Facebook:
Telusko : / teluskolearn. .
Navin Reddy : / navintelusko
Follow Navin Reddy on Instagram: / navinreddy20
Subscribe to our other channel:
Navin Reddy : ruclips.net/channel/UCxmk...
Telusko Hindi :
ruclips.net/channel/UCitz...
Donation:
PayPal Id : navinreddy20
Patreon : navinreddy20
www.telusko.com/contactus Наука
At the end of the video: lecture turns into rap
hahaha
bwahaha
Your hard work is clearly visible in the concepts you are saying and the editing of the video
Wow, this 2 mins explanation really cleared all the doubts, thanks :)
Great work @Telusko this is one easy way to explain complex things...Now I have subscribed for more content from you
This is the only one i watched that really simplified the merkle tree concept. thank you!
Awesome. Now we know how a hash of a block is calculated. Key concept! Thanks!
Beautifully articulated....Thanks actually i was watching some other videos for reference i saw your video. Cool
Amazing animations to support every explanation!
Thnx sir
Earlier i was not interested in blockchain but after u uploaded the videos i like the blockchain
Nice explaination.....
Thanks for making me understand this complex subject in few minutes.
What a background music in the Introduction.....Bravo...so cool...and cool series...
short and so informative!!
Thanks for the quick explanation, great videos!
Short. Informative. Crisp. Clear and to the point
Oh man!!! You are a great teacher...💥
Wowww Mazzza aaa gya ☺️☺️
What a good Tallent /experience of teaching.
u make it so simple to understand thx so much man !
Two and half minutes and he managed to explain a complex topic in a way, which would enable a kid to understand lmfao
Like!
Great explanation in just 2 mins!!
even chatgpt would not have tell this much simpler, Thanks
Excellent explanation as always..
Enjoying Blockchain series.
Happy Diwali..
Lucid and interesting manner of describing... 👍
just amazing, now I can write 2 pages on this in my exam..😁
Thanks... easy to understand even if I am French speaker.. Your English was simple...
I really appreciate the way you explained the basic concept about blockchain. How can we implement this technology in our web application,???. Can you please explain the tools and concept in order to integrate this technology in our web application.
very clear explanation. keep going
Very clear , thank you.
fantastic video and explanation
Hi sir, can you suggest any references to explore blockchain in more detail... Thanks a lot for this video
Explanation is Amazing Bro...👌👌
Very good explanation! Thanks!
very nice explanation
You are best sir. Please keep it up.
This explanation is the best thing i've ever seen
great explanation thanks. Very easy to understand, google algorithm, make this guy rank 1 for bitcoin explained keywords
Please make more practical implementation videos on blockchain
you are the best!!! excellent explanation
Amazing! Thank you! Great Job
Very helpful, thanks!
Short and useful, thank you
amazing explanation
Sir then the root of this Merkle tree which has the combined H 1 2 .. 10 hash is the hash of the entire block? Or just the hash representing the transactions stored in the block? If the later then can you please tell me how is the hash of the entire block generated, i.e., what values are passed into the hashing algo?
Hi Navin, thank you for your Explanations all over the videos you are posting and it's really encouraging us to learn more about Block chain and other technologies. I have a question I have a question for you as I have no coding experience and currently working in an Indian W**** IT company from last 4 years. How can I get certified as a block chain Advisor/Architect. Will I get an opportunity outside as a Fresher??
U got opportunity? ,2 years over
So... What's wrong with hash(t1 + t2 + ... + tn) ? What's the advantage of Merkle tree vs. a simple block concatenation and then getting a hash of that?
Nice clear explanation
Great explanation!! thanks
Nicely explained 💥
if the od number of transaction in a block then how the pairing is happening
yes naveen reddy, my understanding is every 2 of txn's givings a uni-hashing,and then this 2 hashing becomes a single hashing like this continuous to all the hashes form together gives a hash this process is called merkle tree right...
so what is the actual purpose of merkle tree is to finding a simple way for transactions...?
beautiful explanation sir, big fan
Very amazing video sir
god bless this tutorial masters
Nice editing and bgm
Thank you so much, sir, for this wonderful series,, I have one question, sir,,,, why we combine hash of only 2 at a time why not we combine the value of H1 to H10 and then find one value. and if we do in this way as you explained, then if I want to verify the transaction T1 how can I do that because at the end I have value of Hash which is generated by combining all the hash values,,, so to check I need to combine all these values once again to verify a single transaction T1?
I think it is just like quick sort in algorithms if we directly convert all the hash keys into a single hash key it will take a lot of time to find the transaction details of last nth transaction the Merkle root will help the block to fetch the transaction detail fast and secure and it also decreases the consumption of space in some cases
@@nagasai9591 if in odd number of transactions it is repeated doesn’t it brings 2 same entries twice in the block?
So for eg is A paid B is repeated twice does he pay B twice?
I dont get it
love u bro , plz make a video on ETH, ico and its working with ETH blockchain ✌️✌️
Awesome sir thanks a lot
This man calls us aliens and it reminds me to go to mars as soon as possible
WELL DONE
Killer explanation, thank you.
Very neat explaination.. Sir can you do a video on how to use digital signature in block chain technology
research public and private key cryptography, I recommend starting with Diffie Hellman exchanges
Thanks, at last I've understood it.
But if new transaction is added to the block, the hash will change, and so the change has to be made on all the blocks. I am getting confused. Please Help.
Long time there are no further updates on this subject?
Best place to learn
nice editing
Thank you sir
Great Sir..!!
Merkle tree seems to be the best means of verification for blockchain as it's gives users hope of security. I'm glad to know that MEXC have joined the league of exchanges to published theirs.
thank you
how to combine hash values as you said
thank you.
i felt stupid after reading 5 papers, thank you! I finally understood :D
thanks a lot
What happened other video?why not uploading sir????
please post more videos on blockchain please
Sir please make a video about gate is mandatory for getting a engineering degree, is it good for all cse students????
Thank you!
Thanks!
Can u plz do a video about LAMP STACK Developer
Bro learn MEAN stack. LAMP is becoming obsolete.
wonderful
Very easy
sir, will we develop block chain using any programming language??
If yes, then what is the language we go with??
@@Telusko ok sir
Waiting for the next one
Happy Diwali Sir
excellent...!!!!
thank u sir
Great sir mashallah
sir post next lecture fast, why so late
Clearly defined
I have a doubt. One block has only one transaction hash right and one previous block hash right? How are multiple transactions stored in one block?
Sir waiting for your videos
Great
i have one doubt . what about one block of hash value changed in a blockchain due to threat . what happen next . plz post vidio about it.
not gonna lie the music are really cool
Better explanation than at Coursera
Waiting for the next video bro
Thanks man
📢📢 Libonomy’s engine Aphelion continuously improves by itself to grant the best performance at all times👌👌.
tussi great ho sir ji