AI Science Tracker

Claude discovers algorithms that refute the 3SUM and APSP time-complexity hypotheses

Anthropic; Columbia University; Massachusetts Institute of Technology · 5 Oct 2026 · computer science

Discovery

Claude discovers algorithms that refute the 3SUM and APSP time-complexity hypotheses

Alman and Vassilevska Williams present deterministic algorithms for 3SUM on polynomial-size integers in O(n^1.9992) time and all-pairs shortest paths on directed graphs with polynomially bounded integer weights in O(n^2.9995) time, the first polynomial improvements over the textbook exponents. The single underlying technique computes selected entries of thin matrix products more efficiently, and known reductions yield the main algorithmic consequences. The paper says an internal Anthropic Claude research model discovered the algorithm autonomously; the human authors then understood, simplified, strengthened and extended it. One paper-level theoretical-computer-science result is counted.

Technology: Internal Anthropic Claude research model (specific model version undisclosed)

Family Claude: profile · models page

Publication: Preprint · Test context: prospective or independent check. Catalog categories, not an evidence grade.

Result, AI contribution and limits

Evidence context (descriptions follow the cited sources; test type is a catalog classification):

  • Publication status: Preprint
  • Test type: prospective or independent check
  • Tested: Alman and Vassilevska Williams present deterministic algorithms for 3SUM on polynomial-size integers in O(n^1.9992) time and all-pairs shortest paths on directed graphs with polynomially bounded integer weights in O(n^2.9995) time, the first polynomial improvements over the textbook exponents.
  • Still unknown: This is an arXiv preprint as of the checked record. The stated time bounds are for polynomially bounded integer inputs; real-valued variants use Las Vegas randomization and different bounds. Lean certification covers the explicitly enumerated theorems, not every statement or presentation detail in the 76-page paper. The authors take responsibility for the paper and developed important extensions/consequences after the initial AI-discovered algorithm.
  • AI role: The paper states that Claude was tasked with checking and improving cryptographic constructions but instead developed the new thin-matrix-product algorithm, first for average-case and then worst-case problems, in a 16-million-output-token session with no human input. The authors subsequently worked to understand, simplify, strengthen and extend the algorithm. Anthropic later used an internal model to Lean-certify specified main results.

Evidence sources: https://arxiv.org/abs/2610.06783

Source checked · editorial details

The source page was checked against this entry. Independent confirmation is not assessed by this label.

Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.

Review scope and date are not recorded; source checked does not establish full-text review.

Editorial assessment: Impact 4/5 · Validation 4/5 · Novelty 3/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.

Follow-up and relationships

No follow-up recorded; this is not a claim that no follow-up exists.

Follow-up review scope and date are not recorded.

No source-supported relationships recorded.

Open in the full catalog for filters, charts and related discoveries.