Never knew trade could be so challenging! Kept running back to these KZfaq videos to learn more about this your video is indeed helpful. Thanks

0:00 intro 1:47 cryptographic hash functions 20:28 hash pointers and data structures 29:23 digital signatures 39:03 public keys as identities 44:32 a simple cryptocurrency

Thank you so much for this enlightening video it has helped me greatly. Many a time new comers are indecisive on how to start when it comes to their personal investment growth. But great investors can provide proper guidance...

Fantastic ! This really exceeded my expectations. I'm very glad I signed up for this and I am really looking forward to future lectures. Thanks !

Excellent. GREAT series. So well presented. Much appreciated. Thank you.

Fantastic! I really enjoyed the whole lecture. It was very concise, clear and engaging.

Awesome. builds from ground up and provides great understanding. Thank you.

Really amazing lecture. Thanks for decentralising the knowledge.

whoa super detailed may need to see this a few times

appreciable teaching. done a really great job @profs

Excellent! thank you very much for sharing your knowledge

Very beautifully explained, thanks!

Great intro to bitcoin. Thank you for posting this.

a very well delivered and thorough introduction to the foundations of cyber-currencies. Great work!

Excellent lecture covering the key concepts very concisely

thank you. Excellent start!

thank you for the course, you're a great teacher and communicator!

Amazing Lecture prof!

Good stuff, much appreciated!

Great! So nice to see some real heavy hitting in this space! Thanks.

Your speaking is very clear. Great lecture!

This was a Master Class! Thanks, From Eric Croom Jr,

Thank you, Sir, for the accessible lecture.

Great Lecture!

Great lecture!

Thank you so much for doing these.

great lecture very well explained thanks.....

These are all entirely new concepts for me. It's difficult to grasp and make notes together at this pace!

Qestions: 14:00: "...returning as commitment: is it "hash(key) + Message" *or* "hash(key+message)"? 14:15: When the key+message was given to the verifier so he could hash it for comparsion? Great lecture!

Thanks for sharing!

Love it!!!! nice explanations

Excellent lecture. Very very good stuff

This is actually a bitcoin course that I can understand. I'm waiting for episode 2, when will it be uploaded?

16:08 "Let me just go through it "Bit-by-bit"" lol

Slide: Commitment API. The line commit(msg) := (H(key|msg), H(key)) probably needs to read commit(msg) := (H(key|msg), key).

34:43 Where exactly you draw the line that separates plausible numbers and non-plausible numbers?

Slide Commitment API: What's the purpose of the key? The only thing you publish at beginning is commitment. Message is kept secret until opening envelope. So you can easily do only com=h(msg) and publish com. Nobody can reveal msg from com. Message originator can't forge original message because he can't find msg' with the same hash h(msg)=h(msg'). Everything works without the key as well. All you need is clear hash.

THANK SIR, GOD BLESS AMERICA AND GREECE-ROMAN.

Nice ! Thanks

This is where 99% of the people in this world don't understand how bitcoin actually works. They only know the bitcoin price news....

Thank you for providing the world with this infinitely valuable and accessible resource! 100000 satoshis *****

at 23:10 are the blocks going from left to right or right to left ?

BRILLIANT

Time for a 4th rewatch? Yes.

13:45 So commit(msg) returns (com, key), where in reality this is equal to (H(key|msg), H(key)). Does this mean that the key which is to be published is actually equal to H(key)? In that case, how could it possibly be that the verification method which uses the published key(aka H(key)) could ever succeed, since it will always be doing: verify(com, H(key), msg):=H(H(key)|msg)==com bearing in mind that com=H(key|msg).

I have a thought about the identity in Privacy. When analyzing the behavior of an address to find out who that is, isn't it a good idea to use Machine Learning to run through the layers and to update the output over time? The activity of the address can be the input layer, the probability that that is Joe would be the output layer.

Are these videos available somewhere for legal download or are they only on youTube?

Can anyone answer what software I would use to calculate these commands? Com, key, msg, etc? How can I implement what I am learning in this video?

Arrow pointers under heading of 'Blockchain' and 'Detecting Tempering' should point to previous/parent block H( ). It correctly mentions previous H( ) though arrow pointer shows next H( ). Both Bitcoin and Ethereum Block Header stores parent H( ) which is previous H( ). Please correct this.

@24min: re tampering: i undertand that tampering is not possible in th middle of the block chain but what if the tampering occurs at the very end of the chain (at the most recent "link"). would that not be possible?

Are these lectures the same ones being used for Coursera's Cryptocurrency course? I'd just sign up for the course but I hear the assignments on this specific course are pretty frustrating.

At 7 mins 24 seconds, I believe speaker meant: "If hash values are same, then X and Y have to be equal".

I lost it on the meteor HAHAHAHAHAHAHAHA

colon equal ":=" means "is defined to be"

Ah, this is like being back in Uni. Reminds me of my Computer Engineering and Electronics days.

22:27 why we are not calling it next pointer instead of prev??

If last block data is tempered, how will it hamper the previous blocks?

Where can we get the lecture PPT?

very good

I heard that educational token(LEDU coin) is currently paying project creators for their work, any thought on it

Is signature the way to prove , that someone is holding certain private key? Other words do we have another API for signature saying: isTheSameSK(pk,sig1,sig2)? This is like asking: is sig1 and sig2 made by the same person ? Or i can send a msg2 to this person and ask to sign it and later verify he also signed msg1?

I would like feedback on this concept Imagine a hash being generated by number string occurring only once in space+time would that not eliminate any "collisions?"

What's the difference between the commitment and signature API's?

He looks like Tim Cook.

Thank you

anyone knows: are all coins are immutable? thanks!

What is the point of Powerpoint if you just put the words you are speaking into it?

Sir will u please post the week 1 assingment answer file

Does anyone have answers to the quiz of this course ?

More Qeustions: @23:48 - How is the data from in a tamper-evident log stored? In a key value store? Since you are not using pointers to memory you need an auxilary store right? - Does the prev H(arrow) include the prev pointer AND the data or just the data? It would make more sense to include both right?

Typing out my questions as I make my way through the video... I'll probably be posting multiple times... - When discussing the commitment API around the @14:28 mark, why do hash the 256 bit key? H(key) - Is it because we do "H(key | msg)" and theres some sort of communitive property? - Is "binding" essentially the same as saying the hash function is collision-free (impossible to find collisions)

Ummmm, cryptographic vegetables, tasty :D

Can I get slides of lecture , please?

what exactly is the commitment API ? is this kind of api an application programming interface ?

Ho boy that's how you know they're real academics ... 3 minutes in and it's an college senior-level algorithms lecture

HEllo, would it be possible to have the slides of this course?

I want to learn it

perfect

Why complaints? this is "intro" yes

Please, I want solution of exercises to chapter 1

Great work .Would like to request Blockchain sync that covers and the technical background for Peer to peer network. Covering Topics like 1. Bitcoin Peer Discovery 2. Inital Block Download 3. HeaderFirst Block Downloads. 4. Orphan Blocks and 5. Alerts Mis behvaing nodes. These are all topics that have been added to bitcoin documentation on bitcoin.org/en/developer-guide#orphan-blocks and are closely related to Stanford lecture for 4 Gen Peer-to-Peer Technology.

at 7:16 he says "that if we know X and Y have the same hash, then it's safe to assume that X and Y are different" Did he mean to say that they are the same? The formula above shows "If we know H(x)=H(y), it's safe to assume that x=y"

"relies on hairy math" best quote

What's the song used in these videos?

"Earth will be destroyed by giant meteor in next 2 seconds which... did not happen" :D great lecture

Surprised Disney has not requested a take-down of this video.

Tammm

A course for gentlemen

l

So... invest in GoofyCoin?

How rich would Satoshi be,if he mined 90% of the Bitcoin supply?

In the past several years, the use and prevalence of virtual currency have increased exponentially. The proliferation of digital assets has changed the way goods and services are exchanged and has allowed for faster and cheaper transactions. But with this new technology comes the increased risk of fraudulent activity - especially tax fraud. Recently, the Internal Revenue Service (“IRS”) has made it abundantly clear through guidance, amendments to tax forms, and even warning letters to Americans suspected of tax fraud, that it is getting very serious about virtual currency tax compliance. The IRS and the Department of Justice (the “DOJ”) appear to be poised to commence a flurry of enforcement actions against virtual currency tax fraud offenders. Likely to be entangled in these enforcement actions are virtual currency institutions and companies that regulators suspect facilitated their customers’ tax evasion. It is thus imperative for all entities in the virtual currency industry to ensure their compliance programs are equipped to detect and prevent the facilitation of virtual currency tax fraud.

Illustrations are too abstract and lack practical examples or meaningful analogies. Stopped at 27:30.

anyone else got rich from the time this came out? :D

vegetables are great...

7:42 Dude says for a collision free hash function H, when H(x) = H(y), x does not equal y. This is false. For a collision free hash function H, when H(x) = H(y), x = y. Also this "collision free" function is called an injective function if you want to learn more about it.

Am the one who Broke the code . And launch it towards Japan 1991! Dark net!.

Crypto currency step 1: Buy 25 GTX 1080tis.

He looks like Tim Cook

Now I know crypto trading is gambling cause this bloke knows everything and he doesn't look rich.