explainer · HACKER NEWS RECOMMENDATION
How Quantum Computers Break Encryption | Shor's Algorithm Explained
minutephysics · 3 HN recommenders · 3 recommendation months
Recommended by 3 Hacker News commenters across 3 months (2019–2023).
SignalTube analysis
Among 4 other explainer videos tagged Quantum computing, the mean is 2.5 distinct HN recommenders. This video has 3 distinct HN recommenders, about 1.2× that mean. Recommendations span 3 distinct months; the peer average is 2.5 months. This is a data-derived comparison, not a human review or quality rating.
100% of its 3 labeled comments are marked as recommendations or strong recommendations. HN mention years are 2019–2023; those years describe discussion history, not upload date. Its verified runtime is 17 minutes 31 seconds. YouTube lists its publication date as 2019-05-01.
- Channel / speaker
- minutephysics
- Verified runtime
- 17m 31s
- YouTube upload date
- 2019-05-01
- Hacker News mention years
- 2019–2023
SAME TOPIC AND FORMAT
Compare with related videos
The comparison cohort uses other explainer videos in Quantum computing. “Shared recommenders” counts HN users who recommended both videos in the source graph.
| Video | HN recommenders | Recommendation months | Positive label share | Shared recommenders | Runtime | Upload date |
|---|---|---|---|---|---|---|
| How Quantum Computers Break Encryption | Shor's Algorithm ExplainedCurrent video | 3 | 3 | 100% | — | 17m 31s | 2019-05-01 |
| The Mathematics of Quantum Computers | Infinite Seriesexplainer · PBS Infinite Series | 4 | 4 | 80% | No recorded overlap | 12m 35s | 2017-02-16 |
| Hacking at Quantum Speed with Shor's Algorithm | Infinite Seriesexplainer · PBS Infinite Series | 3 | 3 | 75% | No recorded overlap | 16m 36s | 2017-04-28 |
| Quantum Computing Expert Explains One Concept in 5 Levels of Difficulty | WIREDexplainer · WIRED | 2 | 2 | 33% | No recorded overlap | 19m 27s | 2018-06-25 |
THREE SOURCE-BASED CONTEXT POINTS
Why Hacker News recommends it
Each note combines the dataset’s stance label and short rationale; comment bodies are not reproduced. Open the HN source for the original discussion.
The archive classifies this as a recommendation in “Quantum Computing 101”. Its short rationale: Good explanation of Shor's algorithm.
The archive classifies this as a recommendation in “What makes quantum computing so hard to explain?”. Its short rationale: Walks through quantum factoring that classical computers cannot match.
The archive classifies this as a recommendation in “Quantum supremacy: the gloves are off”. Its short rationale: Really good explanation of Shor's algorithm and quantum computing.