Crypto hardness conjectures are phrased in sharp cycle counts
geoffreyirving · x · 2026-11-21
Continuing his thread on Riemann vs P≠NP, geoffreyirving points out that in cryptography all hardness conjectures are phrased in terms of sharp cycle counts, e.g. "one can't find SHA-256 collisions in under 2^128 cycles."
More from Research
- Riemann Hypothesis Lean proof passes independent kernel checks; davidad calls it biggest surprise since GPT-5 — davidad · 2026-11-21
- "Would you please look at the data?": giffmana flags bad annotations in FineVision's coco_color — giffmana · 2026-11-21
- Vishal Sikka on reported Riemann Hypothesis proof with Claude: 'an incredible day' — vsikka · 2026-11-21
- Interpretability competition launched to test logit lenses on Thinking Machines' Inkling — benno_krojer · 2026-11-21
- NDIF hosts Thinking Machines' Inkling 2 Mini and launches a Looped Lens interpretability challenge — benno_krojer · 2026-11-21
- OpenAI's GPT-Rosalind agents surface new drug discovery lead for neurodegenerative disease — OpenAI · 2026-11-21