I'm surprised there isn't more talk around their Matrix Multiplication bound: https://news.ycombinator.com/item?id=50001740
Is this of practical use, or just a proof for now?
it's a huge step theory-wise, but in practical terms it's only slightly better than the previous best which is 2.371177.
It is an example of algorithm that is theoretically faster, but not with our sizes and hardware optimisations:
Look at examples here: https://en.wikipedia.org/wiki/Galactic_algorithm