News for hackers. Stuff that matters.
Re:Show HN: Matrix Multiplication with Half the Multiplications by pk-protect-ai on Friday March 15, 2024 @12:18PM (#39717424)
> By scaling the numbers first by taking the log, multiplication becomes addition and addition becomes x + log1p(exp(y - x)).

Isn't this the same approach as in GF(2^x), which has been in use for decades? The only limitation that comes to mind is the field size.

Re:Show HN: Matrix Multiplication with Half the Multiplications by jhj on Friday March 15, 2024 @05:21PM (#39720860)
Finite field log/antilog lookup tables are used for efficient-ish multiplication, similar to addition/subtraction tables used for logarithmic number systems.