A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2506.13242/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications — mentioned by ogogmadhttps://news.ycombinator.com/item?id=45635810urn:hackerpapers:mention:2506.13242:45635810Sun, 19 Oct 2025 17:05:53 GMT<p>No, your claim about matrix multiplication is false. Google&#x27;s new algorithm can be applied recursively to 4x4 block matrices (over the field of complex numbers). This results in an asymptotically faster algorithm for nxn matrix multiplication than Strassen&#x27;s. Earlier results on 4x4 matrices by Winograd and others did not extend to block matrices.. Google&#x27;s result has more recently been generalised: https://arxiv.org/abs/2506.13242</p><p><a href="https://hackerpaper.kaipfister.de/p/2506.13242/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.SC