A developer optimizing a floating-point library sought to eliminate a performance-hindering conditional branch required when extracting the lowest set bit of a float. The standard bit-twiddling approach required this branch to correctly handle powers of two, which slowed down execution and risked branch misprediction. Unable to manually derive a branchless mathematical formula, the author utilized superoptimization to automatically generate the most efficient sequence of instructions.