CS & research
4 items · 4 articles in this topic
A thin research day, with a claimed O(n log n) integer multiplication algorithm as the theoretical headline. The other items are about formal verification and malware execution inside ML tooling.
- 1
A preprint proposes a new O(n log n) integer multiplication algorithm, a potential theoretical milestone. The summary does not say whether it has been independently checked.
NotableHacker News (front page) ↗
- 2
Researchers extend concurrent separation logic to the hardware level to verify the xv6 kernel on RISC-V, using AI agents.
NotableLobsters ↗
- 3
A write-up explores running Turing-complete malware inside PyTorch's backward pass during model training.
- 4
A blog post benchmarks a polygon triangulation method that processes 3.7 million map polygons in 489 ms, faster than earcut.