{"ok":true,"trend":{"id":1294560,"platform":"hn","region":"global","key":"integer multiplication below n log n","title":"Integer multiplication below n log n","url":"https://github.com/openai/math/tree/main/preprints/Integer-multiplication-below-n-log-n-September-23-2026","first_seen":"2026-10-07T00:05:39.940250Z","last_seen":"2026-10-07T05:20:39.724310Z","last_rank":14,"peak_rank":14,"last_volume":88,"peak_volume":88,"seen_count":22,"score":0.526875,"category_hint":null,"section":null,"category":null,"summary":"A preprint titled 'Integer multiplication below n log n', dated September 23, 2026, has been published in OpenAI's public mathematics repository on GitHub. The claim touches a foundational problem in theoretical computer science: whether integers can be multiplied faster than the long-standing n log n bound achieved by Harvey and van der Hoeven in 2019. If the result holds up to peer review, it would mark a new milestone in algorithmic complexity theory.","why":"It challenges a major open problem in computer science, with the claimed speedup coming from an unusual source and circulating on Hacker News.","tone":"neutral","entities":["OpenAI","Hacker News","Harvey","van der Hoeven"],"summarized_at":"2026-10-07T06:08:20.142523Z","meta":{"lang":"en","link":"https://github.com/openai/math/tree/main/preprints/Integer-multiplication-below-n-log-n-September-23-2026","hn_id":"49985524","comments":59},"nw":null,"promo":null,"kind":null,"importance":null,"hidden":false,"hide_reason":null,"judged_at":null,"title_en":"New preprint claims integer multiplication below n log n","timeline":[{"captured_at":"2026-10-07T00:05:39.940250Z","rank":26,"volume":7},{"captured_at":"2026-10-07T00:20:39.775960Z","rank":22,"volume":19},{"captured_at":"2026-10-07T00:35:39.778960Z","rank":20,"volume":26},{"captured_at":"2026-10-07T00:50:39.779530Z","rank":20,"volume":35},{"captured_at":"2026-10-07T01:05:39.702786Z","rank":20,"volume":39},{"captured_at":"2026-10-07T01:20:39.787564Z","rank":20,"volume":45},{"captured_at":"2026-10-07T01:35:39.725716Z","rank":21,"volume":50},{"captured_at":"2026-10-07T01:50:39.725064Z","rank":21,"volume":56},{"captured_at":"2026-10-07T02:05:39.945181Z","rank":21,"volume":60},{"captured_at":"2026-10-07T02:20:39.765079Z","rank":19,"volume":66},{"captured_at":"2026-10-07T02:35:39.952290Z","rank":16,"volume":68},{"captured_at":"2026-10-07T02:50:39.729468Z","rank":17,"volume":69},{"captured_at":"2026-10-07T03:05:39.894007Z","rank":18,"volume":70},{"captured_at":"2026-10-07T03:20:39.763031Z","rank":19,"volume":71},{"captured_at":"2026-10-07T03:35:39.704743Z","rank":17,"volume":72},{"captured_at":"2026-10-07T03:50:39.964262Z","rank":17,"volume":72},{"captured_at":"2026-10-07T04:05:39.877734Z","rank":16,"volume":75},{"captured_at":"2026-10-07T04:20:39.765736Z","rank":15,"volume":78},{"captured_at":"2026-10-07T04:35:39.827068Z","rank":15,"volume":81},{"captured_at":"2026-10-07T04:50:39.715985Z","rank":15,"volume":85},{"captured_at":"2026-10-07T05:05:39.984229Z","rank":14,"volume":86},{"captured_at":"2026-10-07T05:20:39.724310Z","rank":14,"volume":88}],"posts":[{"platform":"hn","url":"https://news.ycombinator.com/item?id=49985524","author":"E-Reverance","title":"Integer multiplication below n log n","snippet":null,"posted_at":"2026-10-06T23:14:52Z","likes":88}],"elsewhere":[],"window":"7d"}}