What do we do?
We get as close to the ceiling of performance in C++ as possible. More specifically, what we do, is take a given problem, map it to a given hardware target, such that it will execute as efficiently as possible, given the target problem space.
The Method
Every library published here was built the same way: identify that which can be moved to compile time, then what can be moved to "initialization time", then, finally, design the algorithm in such a way that it maps to the target hardware as efficiently as possible. The benchmark is the proof. All of the libraries listed below are ready to be downloaded in their respective benchmark harnesses to be run by you.
Track Record
-
void-numerics
Numeric utilities library. Against std, jeaiii, and strtoll/strtoull across the full platform matrix: … wins, … ties, … losses. Published to the Microsoft vcpkg registry. -
Jsonifier
JSON parser and serializer. Against simdjson and Glaze across the full platform matrix: … wins, … ties, … losses. Published to the Microsoft vcpkg registry. -
Digit-Counting Algorithm
Novel direct-lookup approach for counting digits in unsigned 64-bit integers. Against Lemire digit-count across the full platform matrix: … wins, … ties, … losses.