As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/p/x-rrwilliams-2114891835403633038/ # “I’ll try. ETH claims 3SAT cannot be solved in 1.000...” Ryan Williams @rrwilliams.bsky.social (@rrwilliams), X, 2026-10-27. Source: https://x.com/rrwilliams/status/2114891835403633038 ## Archived text > I'll try. ETH claims 3SAT cannot be solved in 1.000... 01^n time for some number of zeroes. They claim ETH is false, giving an algorithm that is "sub-exponential" time for 3SAT. That would be surprisingly faster than brute force, the 2^n time. > > > Quoting @sughanthans1: @rrwilliams thanks for the post ryan. > > > > i know you might be under immense work load but > > > > could you explain to someone who is reasonably intelligent but have not researched this field - what are the implications of these findings? Archived 2026-10-28 via fxtwitter (unofficial). Counts: 56,076 views, 475 likes, 28 reposts, 16 replies (at fetch time) ## Cited in - 2026-10-26: [OpenAI claims ETH is false](https://postcutoff.com/e/2026-10-26-openai-eth-false-subexponential-sat-claim/)