The recently proposed o(n log n) integer multiplication algorithm [pdf]

	The recently proposed o(n log n) integer multiplication algorithm [pdf](web.maths.unsw.edu.au)
	302 points by craigcitro 3 days ago \| 283 comments
	tl;dr: Summary not available
	HN Discussion: ↑Formalized Lean proofs of the result already exist, extending the paper's claims ↑Discomfort with researchers relying on LLMs to understand papers they can't parse themselves ↑AI-written papers are becoming inaccessible to humans, only understandable by other AIs •Clarifying the technical significance: o(n log n) is a meaningful improvement over known O(n log n) ~Questioning practical impact and expressing emotional reckoning with AI's role in math research