Combinatorial optimization problems are at the root of many industrial processes and solving them is key to a more sustainable and efficient future. Ising machines can solve certain combinatorial optimization problems, but their efficiency could be improved with multi-spin flips. Researchers have now tackled this difficult problem by developing a merge algorithm that disguises a multi-spin flip as a simpler, single-spin flip. This technology provides optimal solutions to hard computational problems in a shorter time.