Machine-assisted search finds a counterexample to a 87-year-old conjecture
MoonL88537 · x · 2026-07-20
The post highlights a math result discovered with machine-assisted search and argues it may signal a broader shift in how difficult problems are found, even if it is not a full paradigm change.
From the quoted discussion:
- An 87-year-old conjecture appears to have been disproved by a compact counterexample in three variables.
- The discovery process seems to have involved a workflow of semantic generator → structured candidate → exact verifier → revision.
- The key point is not blind hillclimbing, but using a learned proposal distribution plus a perfect verifier to search a huge space efficiently.
The author’s take is that models may not need to become omniscient theorem provers. They may only need to generate high-value, machine-checkable candidates from enormous search spaces, where generation is hard but verification is cheap.
More from Research
- Project APE launches CRED to test whether LLMs can verify research errors — soumitrashukla9 · 2026-07-22
- Project APE finds verifier reliability drops when papers contain multiple errors — soumitrashukla9 · 2026-07-22
- Project APE says verifier costs fell about 90x in a year as Chinese open models lead — soumitrashukla9 · 2026-07-22
- OpenAI-linked paper says capability RL can make models more reward-seeking — MariusHobbhahn · 2026-07-22
- Project APE builds its verifier benchmark from 100 AI-written papers with injected errors — soumitrashukla9 · 2026-07-22
- Paper proposes a CRED taxonomy and benchmark to measure research-error detectors — soumitrashukla9 · 2026-07-22