Among the less niche ones: - UMASH: https://github.com/backtrace-labs/umash https://github.com/backtrace-labs/umash Fast hash functions don't usually come with

Among the less niche ones: - UMASH: https://github.com/backtrace-labs/umash https://github.com/backtrace-labs/umash Fast hash functions don't usually come with collision bounds, and crypto hashes try too hard for my needs. With umash, we get speed that's comparable to regular hash functions, and a 128 bit output such that hardware failure is more likely than collisions. - poireau: https://github.com/backtrace-labs/poireau https://github.com/backtrace-labs/poireau existing heap profilers are more intrusive (first, you have to replace the allocator), and, in long-lived servers, any long-lived allocation is cause for concern, regardless of reachability. A flamegraph compatible output is also useful for visualisation. - CSM: https://github.com/pkhuong/csm https://github.com/pkhuong/csm Testing an SLO-type property that's expected to hold, e.g., 99% of the time, quickly becomes an annoying exercise in balancing test duration and false alarms. CSM implements a statistically valid dynamic stopping criterion, so the tests only run for as long as needed to be confident that the SLO holds or doesn't hold. - Reciprocal: https://github.com/pkhuong/reciprocal https://github.com/pkhuong/reciprocal existing runtime div-by-mul libraries in Rust (and most other languages) are branchy, making their runtime behaviour too hard to characterise for my tastes.