Algorithm published in a white paper roughly two years before 2025 that computes civil dates from an epoch without any ifs, while loops, or memory lookups — only bit shifts, multiplications and magic constants exploiting integer overflow/underflow. Adopted in recent versions of GCC, Linux, and .NET 7, delivering about 4× speedup over the if-and-lookup-heavy .NET 6 implementation. Wójtowicz uses it as his headline example of rephrasing a problem (Zeller's March-starts-year trick + Euclidean a-functions + bit-shift division) so the CPU can solve it without branches.