It doesn't matter what our target is, even or odd you just need to correctly guess the last 2 hex characters and then you can use the script I posted above to divide your key by 1024, but first you'd need to subtract n/4 from the result on 1024 - index.
Try it yourself and you will see, even if we guess the last 2 chars incorrectly, there is a way to again calculate p/1024 no matter what. God willing I should be able to figure that out, it's complicated I know but once it's solved you realize how easy it was.
Spent a lot of time, but I haven't gotten the correct result.
How come?, here put this on scalar_1 =
0x00000000000000000000000000000000003aab07a231499b94e9412cb6d34334
Scalar_2 =
0x0000000000000000000000000000000000000000000000000000000000000034
Start range = 1024, end range = 1025, the result is :
3fffffffffffffffffffffffffffffffaeabc5e46dbab46156d9d1f37f3b4521
Then subtract n/4 from above =
3fffffffffffffffffffffffffffffffaeabb739abd2280eeff497a3340d9050
Result =
0000000000000000000000000000000000000eaac1e88c5266e53a504b2db4d1
Multiplied by 1024 =
00000000000000000000000000000000003aab07a231499b94e9412cb6d34400
You are not supposed to get the exact result, but if you add and subtract to your target public key like adding 1k G, sub 1k G, and have those 2k keys saved, when you multiply by 1024 you should see a match.
Bro, you've completely confused everyone here.