Auto Research demo tackles integer multiplication below n log n
swesnow · hn · 2026-10-12
A Hacker News post links to an Auto Research page (app.getsupers.com/auto-research) on the topic of "Integer multiplication below n log n".
- Breaking the presumed n log n barrier for integer multiplication has been a landmark open problem in algorithm theory.
- The link appears to showcase an automated research tool or demo applied to this specific mathematical question.
- The submission itself contains minimal text—just the link—so whether it is a paper, an AI-driven research demo, or a literature tool remains to be confirmed on the original page.
More from coding & agent
- Claude Code Pushes Urgent Security Update Across All Installations — umeshonai · 2026-10-23
- Claude cut a 2.6-hour video export to 20 minutes — but only after being told to rebuild the server — byhewar · 2026-10-23
- 3 flight-booking rules my AI agent checks that I'd never do by hand — Efistoffeles · 2026-10-23
- OpenJet claims Qwen3.8-27B coding runs 1.9x faster than llama.cpp on one RTX 3090 — JeremyCMorgan · 2026-10-23
- Building an autonomous SEO agent in Hermes with three skills: programmatic pages, Keywords Everywhere, DataForSEO — EXM7777 · 2026-10-23
- Building a sports betting AI agent with onchain execution and human approval by default: architecture and lessons — Dry-Comfortable-2678 · 2026-10-23