Doing cache oblivious blocking can make a huge 1000x perf difference over naive matrix multiply. And C isn't needed for most of it. I've some pretty cute seque

Doing cache oblivious blocking can make a huge 1000x perf difference over naive matrix multiply. And C isn't needed for most of it. I've some pretty cute sequential dgemm code written in mostly Haskell that's robustly within 5x of openblas dgemm. And I've not tuned it much / at all!