Development

Opus agents reportedly devise a faster asymptotic shortest-path algorithm

development2026-09-24science

Claim

The issue reports ten Opus agents working for 15 hours on a Lean-proven shortest-path algorithm that asymptotically improves on Dijkstra's but is not yet practical.

Reported metric: ten agents; 15 hours

Reporting date: 2026-09-24 (not necessarily the event date)

Sources

Attribution and reporting linked by this record; links do not imply independent verification.

Welcome to September 24, 2026 (theinnermostloop.substack.com)
Source linked by the September 24 issue (www.vals.ai)

Indexed from the September 24 newsletter. Linked-source claims have not been independently verified.

Knowledge graphopen in browser →

About

Claude Opus 5.5

Reported in

Welcome to September 24, 2026

Evidence for

Science is automated at the hardware level

Referenced by

Welcome to September 24, 2026

Cite or correct this record

Citation formatCitation text

Opus agents reportedly devise a faster asymptotic shortest-path algorithm
Innermost Loop KB — secondary record
Reporting date: 2026-09-24
KB permalink: https://nicholsn.github.io/innermost-loop-kb/developments/2026-09-24-opus-shortest-path
Claim: The issue reports ten Opus agents working for 15 hours on a Lean-proven shortest-path algorithm that asymptotically improves on Dijkstra's but is not yet practical.
Attributed sources:
- Welcome to September 24, 2026 — https://theinnermostloop.substack.com/p/welcome-to-september-24-2026
- Source linked by the September 24 issue — https://www.vals.ai/blogs/faster-shortest-path-algorithm
This citation does not imply independent verification of linked-source claims.

Suggest a correction — opens a GitHub draft for you to review and submit.