Home Creators Posts Import Register Favorites Logout
haven't archived this post yet. have a subscription? use the importer!

Content

Hey everyone,

As promised, here is the supplement to yesterday's video.  No charge, of course, since this is an add-on to a different main project.  I had a lot of fun putting this together, let me know what you think!

Also, I'm going to do a Q&A session, where you can answer questions here: http://3b1b.co/questions.  For you, the patrons, I'm of course happy answer any questions anytime, but this will be a time to sit down and actually record some answers.

-Grant

Files

Previews only

How secure is 256 bit security?

Supplement to the cryptocurrency video: How hard is it to find a 256-bit digital signature or hash just by guessing and checking? What kind of computer would that take? Cryptocurrency video: https://youtu.be/bBC-nXj3Ng4 Thread for Q&A questions: http://3b1b.co/questions Follow on twitter to hear when/how I put out answers: https://twitter.com/3blue1brown ------------------ 3blue1brown is a channel about animating math, in all senses of the word animate. And you know the drill with YouTube, if you want to stay posted on new videos, subscribe, and click the bell to receive notifications (if you're into that). If you are new to this channel and want to see more, a good place to start is this playlist: http://3b1b.co/recommended Various social media stuffs: Website: https://www.3blue1brown.com Twitter: https://twitter.com/3Blue1Brown Patreon: https://patreon.com/3blue1brown Facebook: https://www.facebook.com/3blue1brown Reddit: https://www.reddit.com/r/3Blue1Brown

Comments

Christopher Burke

I want kilo-google to become an actual measure of computation :) Only problem is, the abbreviation (kg) might be confusing :)

Anonymous

Wonderful video -- very cool. One minor fix: If you're randomly guessing, you'll on _average_ find an answer in 2^255 guesses, not 2^256. You have to on average search 50% of the address space. For certainty, of course, you need 100% or 2^256. Saved you one galaxy!

Anonymous

If (and I assume this to be true) a cryptographic hash is truly "random", then every hash is independent of whatever hashes you have tried earlier, so you'll (almost always) end up with hash collisions for some hashes, while other hashes will never occur within those 2^256 guesses. It would then follow a geometric distribution, which has an expected average of 2^256 (1/p) guesses.

Anonymous

I want to build a blockchain application to see how this works inside.. Thanks for sharing the video.

Jesse Thompson

Another fun image that is frequently used to drive home the magnitude of 2^256 is this one: <a href="https://miguelmoreno.net/wp-content/uploads/2013/05/fYFBsqp.jpg" rel="nofollow noopener" target="_blank">https://miguelmoreno.net/wp-content/uploads/2013/05/fYFBsqp.jpg</a> But it is worth considering certain points, such as RIPEMD-160 addresses only having 160 unique bits of entropy prior to first spend (per best practice), and lack of any rigorous mathematical proof that the combination of hash functions that produce addresses do not leak further entropy anywhere. ;)

Anonymous

Would love to see a Cryptocurrency 2.0 on the changes since 2008, the nuances left out and the possible future of Cryptocurrencies/BTC. Merkl Trees, Shnorr Signatures, Segregated Witness, OP codes, Smart Contracts, etc.