Thanks for quick response. I believe Xpoint + Stride could solve puzzle 130 much faster than bsgs even if Stride drops the performance of Xpoint. Hopefully you find a way and make some time to implement it for Xpoint.

By the way one of comments above was about Stride combination with Vanity, another guy was talking about it. In my opinion there is no relation between a prime number and vanity search based on the address characters. Multiple hashes happens from private key to generate an address. There is no reason for address to have a correlation with private key in terms of Stride and prime number. Those hashes kill any relation. The only point of having Stride is working with public key to target the X array. Using Stride in any other mode is useless and waste of time. Someone might get lucky using Stride and find the key but based on mathematics, there is no relation.