First screen, captured 2 hours ago. Hover to scroll the page, or open the video.

The Exponential Time Hypothesis Is False [pdf]

What HN thinks

Half the thread is celebrating, the other half is correcting each other's complexity-class Venn diagrams.

Huge result, but not P=NP
Many see refuting ETH as a major theoretical breakthrough, while stressing that subexponential is still far above polynomial and P vs NP remains open.
Doesn't transfer to all NP
Several point to the paper's note that 2^o(n) bounds don't survive general polynomial reductions, so it doesn't prove NP is subexponential or NP != EXP, correcting others who claimed so.
Little practical impact
Commenters note real-world SAT instances are already far easier than worst-case, so the algorithm is mostly theoretical; hopes for sub-quadratic attention are wishful.

Consensus: Most agree the result is significant and nudges odds slightly toward P=NP, but it does not resolve P vs NP and likely has little immediate practical use.

Summarised by Claude from the comment thread 1 hour ago.

Points: 221
Comments: 95
Best rank: #2
Posted: 2026-10-26 by vok
Category: Science

computational-complexity exponential-time-hypothesis sat algorithms openai theoretical-computer-science

All captures:

Full page

Captured 2 hours ago. Click for the whole screenshot.

Looks similar

Screenshot of github.com: PaperPilot – Zero-Cloud, Pure-Rust PDF Engine with WASM and MCP

PaperPilot – Zero-Cloud, Pure-Rust PDF Engine with WASM and MCP (github.com)

221 points by vardhan1237 21 hours ago | 77 comments

GitHub repository for PaperPilot, a local, zero-cloud pure-Rust PDF engine and AI document copilot with WASM builds and an MCP server.

rust pdf webassembly mcp

Screenshot of github.com: Type Server Protocol

Type Server Protocol (github.com)

185 points by adamnemecek 6 hours ago | 135 comments

GitHub-hosted specification document for Microsoft's Type Server Protocol, a JSON-RPC protocol built on LSP conventions for querying Python type analysis data.

type-server-protocol pylance python language-server-protocol

Screenshot of github.com: Parsing EDIFACT in Python with syntax trees

Parsing EDIFACT in Python with syntax trees (github.com)

19 points by alexprengere 4 days ago | 7 comments

GitHub repository for Edison, an MIT-licensed Python library from Amadeus that parses EDIFACT messages using syntax trees converted to state machines.

edifact python parsing syntax-trees

Screenshot of github.com: Show HN: Hob - Open-source, on device alternative to Claude Cowork and ChatGPT

Show HN: Hob - Open-source, on device alternative to Claude Cowork and ChatGPT (github.com)

107 points by pancomplex 9 hours ago | 25 comments

GitHub repository for Hob, an MIT-licensed desktop app for Mac, Windows and Linux that runs open-weight LLMs locally as an offline alternative to Claude and ChatGPT.

local-llm llama-cpp electron gemma

Screenshot of github.com: Show HN: HTML visualization of a PDF file's internal structure

Show HN: HTML visualization of a PDF file's internal structure (github.com)

417 points by desgeeko 1 year ago | 53 comments

Documentation page in the pdfsyntax GitHub repo describing a browse feature that renders a PDF file's internal structure as navigable HTML.

pdf pdfsyntax python file-formats

Screenshot of github.com: Five Qwen3.8-27B models match Fable 5 Using GVS5H Harness

Five Qwen3.8-27B models match Fable 5 Using GVS5H Harness (github.com)

160 points by rzk 1 day ago | 56 comments

GitHub repo with code and paper for GVS5H, a training-free self-orchestration harness letting Qwen3.8-27B instances match Claude Fable 5 on hard LiveCodeBench problems.

multi-agent-orchestration qwen livecodebench llm-benchmarks