Products
Features
YouTube Video Summarizer
Summarize YouTube videos
Web & PDF Highlighter
Highlight web pages & PDFs
Chat with PDF
Ask any PDF questions with AI
Ask AI Clone
Chat with your highlights & memories
Audio Transcriber
Transcribe audio files to text
Glasp Reader
Read and highlight articles
Kindle Highlight Export
Export your Kindle highlights
Idea Hatch
Hatch ideas from your highlights
Integrations
Obsidian Plugin
Notion Integration
Pocket Integration
Instapaper Integration
Medium Integration
Readwise Integration
Snipd Integration
Hypothesis Integration
Apps & Extensions
Chrome Extension
Safari Extension
Edge Add-ons
Firefox Add-ons
iOS App
Android App
Discover
Discover
Ideas
Discover new ideas and insights
Articles
Curated articles and insights
Books
Book recommendations by great minds
Posts
Essays and notes from readers
Quotes
Inspiring quotes collection
Videos
Curated videos and summaries
Explore Glasp
Glasp Newsletter
Weekly insights and updates
Glasp Talk
Interview series with great minds
Glasp Blog
Latest news and articles
Glasp Use Cases
Learn how others use Glasp
Build & Support
Glasp API
Access Glasp's API for developers
MCP Connector
Connect Glasp to Claude & ChatGPT
Community
Glasp Reddit Community
Students
Student discount and benefits
FAQs
Frequently Asked Questions
AboutPricing
DashboardLog inSign up

How secure is 256 bit security?

3.0M views
•
July 8, 2017
by
3Blue1Brown
YouTube video player
How secure is 256 bit security?

TL;DR

Breaking cryptographic security requires guessing a specific string of 256 bits, which is nearly impossible due to the vast number of possible combinations.

Transcript

In the main video on cryptocurrencies, I made two references to situations where in order to break a given piece of security, you would have to guess a specific string of 256 bits. One of these was in the context of digital signatures, and the other in the context of a cryptographic hash function. For example, if you want to find a message whose ... Read More

Key Insights

  • 🫦 Breaking cryptographic security involves guessing a specific 256-bit string, which is practically impossible due to the immense number of possible combinations.
  • 🏃 A GPU-packed computer can run a billion hashes per second, but even with billions of such machines, the chances of finding the correct guess are still minuscule.
  • 🤙 Bitcoin mining utilizes specialized hardware called ASICs, which are much more efficient for hashing than GPUs.
  • 🤩 The scale of cryptographic security is hard to comprehend, with comparisons made to Google's servers, the number of people on Earth, stars in the Milky Way, and the age of the universe.
  • 💨 Achieving successful guesses in breaking cryptographic security requires computational power way beyond what currently exists in the world.
  • 🖐️ Cryptographic security plays a vital role in the protection of digital transactions and information.
  • ❓ The development of specialized hardware like ASICs highlights the continuous advancements in cryptocurrency mining technology.

Install to Summarize YouTube Videos and Get Transcripts

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Questions & Answers

Q: How many guesses are needed to break cryptographic security with a 256-bit string?

Breaking a 256-bit cryptographic security requires an average of 2 to the power of 256 guesses, an unimaginably large number that is practically impossible to achieve.

Q: How efficient is a GPU-packed computer in running cryptographic hash functions?

A GPU-packed computer can run approximately 4 billion hashes per second, but even with billions of these machines combined, the chances of finding the correct guess are still extremely low.

Q: What is the significance of application-specific integrated circuits in Bitcoin mining?

Application-specific integrated circuits (ASICs) are specialized hardware designed solely for Bitcoin mining and can perform hashing much more efficiently than GPUs, resulting in significant speed and energy benefits.

Q: How does the scale of cryptographic security relate to the number of stars in the Milky Way?

If we imagine 4 billion copies of the Milky Way, each with its own personal kilo-Google and half the people having their own kilo-Google, it provides a visualization of the vast scale and improbable odds of breaking cryptographic security.

Key Insights:

  • Breaking cryptographic security involves guessing a specific 256-bit string, which is practically impossible due to the immense number of possible combinations.
  • A GPU-packed computer can run a billion hashes per second, but even with billions of such machines, the chances of finding the correct guess are still minuscule.
  • Bitcoin mining utilizes specialized hardware called ASICs, which are much more efficient for hashing than GPUs.
  • The scale of cryptographic security is hard to comprehend, with comparisons made to Google's servers, the number of people on Earth, stars in the Milky Way, and the age of the universe.
  • Achieving successful guesses in breaking cryptographic security requires computational power way beyond what currently exists in the world.
  • Cryptographic security plays a vital role in the protection of digital transactions and information.
  • The development of specialized hardware like ASICs highlights the continuous advancements in cryptocurrency mining technology.
  • Understanding the immense scale of cryptographic security helps appreciate the level of protection it provides for sensitive data.

Summary & Key Takeaways

  • Breaking cryptographic security involves guessing a specific string of 256 bits, requiring 2 to the power of 256 guesses on average.

  • A GPU-packed computer can run 4 billion hashes per second, but even with 4 billion machines, the chances of finding the correct guess are 1 in 4 billion.

  • Bitcoin mining utilizes specialized hardware called application-specific integrated circuits, which are about 1000 times more efficient than GPUs for hashing.


Read in Other Languages (beta)

English

Share This Summary 📚

Summarize YouTube Videos and Get Video Transcripts with 1-Click

Download browser extensions on:

Try YouTube Summary with ChatGPT & Claude or YouTube Transcript Generator

Explore More Summaries from 3Blue1Brown 📚

Large Language Models explained briefly thumbnail
Large Language Models explained briefly
3Blue1Brown
What Is Gradient Descent and How Do Neural Networks Learn? thumbnail
What Is Gradient Descent and How Do Neural Networks Learn?
3Blue1Brown
Binomial distributions | Probabilities of probabilities, part 1 thumbnail
Binomial distributions | Probabilities of probabilities, part 1
3Blue1Brown
What Is a Determinant and Why Is It Important in Linear Algebra? thumbnail
What Is a Determinant and Why Is It Important in Linear Algebra?
3Blue1Brown
Change of basis | Chapter 13, Essence of linear algebra thumbnail
Change of basis | Chapter 13, Essence of linear algebra
3Blue1Brown
This open problem taught me what topology is thumbnail
This open problem taught me what topology is
3Blue1Brown

Summarize YouTube Videos and Get Video Transcripts with 1-Click

Download browser extensions on:

Try YouTube Summary with ChatGPT & Claude or YouTube Transcript Generator

Apps & Extensions

  • Chrome Extension
  • Safari Extension
  • Edge Add-ons
  • Firefox Add-ons
  • iOS App
  • Android App

Key Features

  • YouTube Video Summarizer
  • Web & PDF Summarizer
  • Web & PDF Highlighter
  • Chat with PDF
  • Ask AI Clone
  • Audio Transcriber
  • Glasp Reader
  • Kindle Highlight Export
  • Idea Hatch

Integrations

  • Obsidian Plugin
  • Notion Integration
  • Pocket Integration
  • Instapaper Integration
  • Medium Integration
  • Readwise Integration
  • Snipd Integration
  • Hypothesis Integration

More Features

  • APIs
  • MCP Connector
  • Blog & Post
  • Embed Links
  • Image Highlight
  • Personality Test
  • Quote Shots

Company

  • About us
  • Blog
  • Community
  • FAQs
  • Job Board
  • Newsletter
  • Pricing
Terms

•

Privacy

•

Guidelines

© 2026 Glasp Inc. All rights reserved.