When I read "absurdly fast", I expected to see some benchmarks against an equivalent SIMD implementation in C or at least a similar library in another language.<p>Please consider adding such benchmarks so that we can assess how fast this library really is when compared to other more established libraries.
I wonder if one could do a Rust version of <a href="https://github.com/ekmett/rts" rel="nofollow">https://github.com/ekmett/rts</a> ? It's a SPMD-on-SIMD exploratory hack, with SOA and masked branching, built on C++ templates.<p>Core is <a href="https://github.com/ekmett/rts/blob/master/src/rts/varying.hpp" rel="nofollow">https://github.com/ekmett/rts/blob/master/src/rts/varying.hp...</a> and <a href="https://github.com/ekmett/rts/blob/master/src/rts/vec.hpp" rel="nofollow">https://github.com/ekmett/rts/blob/master/src/rts/vec.hpp</a> .
For better or worse I have a very big soft spot for things in programming that go fast, even moreso for things that go <i>really fast</i>.<p>I look forward to learning more Rust so I can get an excuse to use this.
How do these numbers stack up to equivalent algorithms in C and Fortran?<p>Are we going to see a RustBLAS soon? Something open-source that could go up against MKL for performance would be really amazing.
Superlatives are problematic because for instance "fast" is relative to something and that something might change over time.<p>Superlatives are usually challenged and you will require proof. The proof itself can also be challenged. Suddenly you are spending a lot of time.<p>I would rather say: "SIMD math library" rather than "Fast library".
I don't see absurdly fast anything in this post. Are there any benchmarks that would support the statement "absurdly fast numerical calculations"?