I want to add that having Stride with Xpoint kinda works like Pollard Kangaroo, we can try some prime numbers to find collision between -n value for sequential search and -Stride value. One of them would be wild Kangaroo, the other would be the tame one. Its all about finding good prime numbers. BSGS is not going to work for puzzle 130 even with high end CPU and 1TB RAM. This algorithm is not efficient for 130 bits, someone need to get extremely lucky.