Nvidia researcher posts preprint claiming a simplified disproof of ETH
fortnow · x · 2026-10-27
Shiva Kintali, an AI architect at Nvidia and ex-Princeton lecturer, released a self-published preprint claiming ETH is false: for any fixed ε>0, a deterministic 3-SAT algorithm decides formulas in Cε(n+m+1)^c·2^{εn} bit operations.
- Strategy: encode clauses as polynomials and deform variable occurrences with a parameter T so each factor depends on one variable group at sampled points, enabling per-group counting via sparsification, bounded occurrences, spectral replacement, and rational interpolation.
- The paper is self-contained with a worked example but is a preprint with no peer review; the author's homepage lists many similar grand-claim preprints, so treat as an unverified claim rather than an established result.
Related event: Nvidia researcher publishes simplified proof claiming ETH is false(2 posts)→
More from Research
- Deedy shares links to the OpenAI and Claude ETH-refutation documents — deedydas · 2026-10-27
- Claims: OpenAI and Claude models independently found subexponential 3-SAT algorithms, refuting ETH — deedydas · 2026-10-27
- ETH humanoid uses head-mounted LiDAR for onboard terrain mapping in 30ms — ChongZzZhang · 2026-10-27
- NYU and UT Austin study finds AI models overuse language patterns linked to reading difficulty — andrewaltair · 2026-10-27
- Cheap verifier matches frontier LLM on RAG claim checks at 187x lower cost, but passes 23.2% of unsupported claims — rohanpaul_ai · 2026-10-27
- Cohere releases CulturalRiddles, expert-built multilingual Arabic-dialect QA dataset — CohereLabsCommunity · 2026-10-27