10 Claude Opus 5.5 agents find a faster exact shortest-path algorithm and prove it.
This is a dev post classified by Jev as AI dev tools (a tool drop), kept by the Dev Radar because it carries real work, not commentary.
10 Claude Opus 5.5 agents find a faster exact shortest-path algorithm and prove it. shipped C-HD: a shortest-path algorithm with a Lean proof that it beats published bounds in a certified density range. On graphs where m≈nlog3/4nm \approx n\log^{3/4}nm≈nlog3/4n, the certified bound improves Dijkstra’s O(nlogn)O(n\log n)O(nlogn) to O(nlog11/12n)O(n\log^{11/12}n)O(nlog11/12n). Constants are huge. The unlock is the artifact: exactness + runtime target, checked by the Lean kernel. Still the right kind of agent demo: the kernel has to say yes. Proof: http://github.com/spicylemonade/c-hd-p
Posted by Md Ismail Šojal 🕷️ (56k followers) 1 h ago · 4 likes · 540 views · view the original post on X. Kept by the Dev Radar as AI dev tools. Tools mentioned: c-hd-proof.
More dev work like this
- Claude Code、Cursor 这些 AI 编程工具到底怎么工作的？ — @bkdgiffug
- holy, impressive first look at Claude Opus 5.5. — @0x0SojalSec
- Same app, just spiced up with GitHub Copilot SDK. Kayla Cinnamon and James Montemagno… — @VisualStudio
- AI agents can read your C# files. They still miss the codebase relationships. — @DanKornas
- Meet MiMo-V2.6-Flash-RL: a multimodal powerhouse that sees, hears, reads, and acts.… — @HuggingModels
- THEY FIXED OPUS 5.5’s WRITING — @kr0der
- Catch up on the #DF26 Slack keynote in 90 seconds. ⚡️ — @SlackHQ
- Sometimes all you need is a chat and a sessions bar, not all the developer tools and… — @tonbistudio
Every post is read and classified by Jev (TypeSafe): what it is, which market it belongs to, and whether the link is a real tool. 21.6k posts from 5k X accounts over the last 21 days, 2.5k tools, 12 markets. Collected every 5 minutes, fully re-ranked every hour — last update 2026-09-22 23:27 UTC. Full method.