https://hackerpaper.kaipfister.de/p/2504.08009/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=50067752urn:hackerpapers:mention:2504.08009:50067752Tue, 13 Oct 2026 06:51:38 GMT<p>Replace the complex numbers with a finite field and O(1) arithmetic stops being an unrealistic assumption, as you can actually perform the required operations in constant time on a real computer. You can&#x27;t do that for infinitely-precise complex numbers, but you&#x27;ll never be able to provide an infinitely-precise complex number as the input anyway. If you start with finite-precision numbers (e.g. 64-bit floats) you can do all operations in a finite-field representation (e.g. the Ozaki scheme II is an actually practical implementation of that idea for matrix multiplication…</p><p><a href="https://hackerpaper.kaipfister.de/p/2504.08009/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.MShttps://news.ycombinator.com/item?id=43884582urn:hackerpapers:submission:2504.08009:43884582Sun, 04 May 2025 04:54:14 GMT<p>Ozaki Scheme II: A GEMM-oriented emulation of FP matrix multiplication using INT</p><p></p><p>2 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2504.08009/">Paper and source history</a>. A submission is not an endorsement.</p>cs.MS