In theory, modular traversal is bijective and randomized. So, generally speaking, if the target keys are randomly distributed across the keyspace, modular traversal can be as efficient as linear traversal. But, for clustered targets like in the 2^69 puzzle, modular traversal is not efficient because the targets were clustered near the starting point (within a small range of the keyspace).

just my 2cents.