Ben Joffe has introduced a new algorithm for floor division of 64-bit integers, which rounds results toward negative infinity. This method is designed for scenarios where the divisor is known at compile time, addressing the lack of native support for this operation in languages like C, C++, Go, and Swift.

The proposed algorithm demonstrates a 10–20% increase in throughput on ARM architectures for most 64-bit divisors compared to existing methods, while maintaining similar or lower latency. For positive 64-bit divisors, throughput improves by approximately 5–10% in 80% of cases, and by 60% for negative divisors.

While the algorithm is optimized for 64-bit operations, it can be adapted for 32-bit, 16-bit, and 8-bit ranges. The author notes that for smaller bit-widths, the Robison algorithm remains a viable alternative. The implementation is provided under the MIT License.

The author highlights that standard integer division in many programming languages uses truncation toward zero, which often produces incorrect results for negative values in applications like timestamp processing. The new approach ensures accurate floor division across the full signed 64-bit range.