Conjectured lower bound reportedly broken, ETH-based security assumptions may need revisiting
IgorCarron · x · 2026-10-27
Complexity theorists are discussing a new result that appears to break a conjectured lower bound. @rebelcrayon notes it resembles the O(n log n) multiplication breakthrough but with bigger consequences: multiplication could only shave the log n factor, whereas breaching ETH leaves a long way to fall — and many cryptographic security assumptions would need to be revisited. Igor Carron's repost hints at a string of results falling. Details of the underlying paper remain unconfirmed.
Related event: Claims That ETH Has Been Refuted Stir theoretical CS Community(9 posts)→
More from Research
- Cohere releases CulturalRiddles, expert-built multilingual Arabic-dialect QA dataset — CohereLabsCommunity · 2026-10-27
- KlingAI study: visual memory boosts consistency in long-video generation but can lock in outdated appearances — Yuzhuo Chen · 2026-10-27
- 68M encoder beats 435M DeBERTa: per-option scoring wins for closed-set tool decisions — Tardelli Ronan Coelho Stekel · 2026-10-27
- Tsinghua's AV-FABLE benchmark shows AV-LLMs near-chance at long-video deepfake forensics — Tsinghua · 2026-10-27
- CausalAlign aligns video generation to 3D dynamics, boosting geometric consistency over 20% — Kai Zhu · 2026-10-27
- Claude Code + Codex re-tested 8 famous research findings overnight — only 1 held up — beglen · 2026-10-27