The 20 shuffled copies are drawn in order from the one generator as before, then each greedy search
runs on a worker of its own and reads only its copy, so the nulls are the serial loop's bit for bit.
Measured on 4nwv (CPU-only): the analysis was ~3.9 s on the main thread, most of it these searches.
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>