Here is how you can find half of your public key, it's not straight forward method but I bet many of you didn't know about it.
First we need to extract 1 and half of our public key then we can subtract our p which is 1 from it's 1.5 to get it's 0.5 half. Though we could just divide it by 2 without all this trouble, this is a hint to make you dive deeper in to this vast ocean of numbers and equations.
Target pub:
03219b4f9cef6c60007659c79c45b0533b3cc9d916ce29dbff133b40caa2e96db8
Target priv:
0x800000000000
Our multiplier inverse or not doesn't matter, +n will give you +n result and vice versa.
Scalar : aka n/2+1 half n +1 or 1 and half of n.
7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a2
If you multiply our target pub with scalar above, you will get this :
Pub2 :
02161c6cbee1483deaf6f9b395c817eb019228cda5afac5857295ba10959dffc96
Priv :
0xc00000000000
Now if we subtract target from pub2, we will get :
Pub3, half of target :
0313d1ffc481509beee68f17d8ff41c2590f4c85f15268605087eda8bab4e218da
Priv :
0x400000000000
We didn't even use division, *chop chop and good luck diving.😅
* = hurry! Get to work.
Now, if it were possible to calculate an even target pub or an odd one, then 130 puzzle could be solved in a few hours.
Yeah absolutely 1 hours 4 minutes, but he's doin nothing with random speculation ahaha, see.
just computing use 50% brain and computing power, not 100% brain enough.
To install the `sympy` module on Windows, type CMD in the search bar and open Command Prompt and type
pip install mpmath, first and then pip install sympy.
put ice dll and secp256k1.py in the same folder where you have the script.
Thanks, I did what you said and learned a few things about python commands, after a few errors now it says module secp256k1 has no attribute 'pub2upub' even though I correctly pasted the upub in it's place. I went to secp256k1.py and there was no mention of pub2upub. Lol this thing burned more energy than a week of dealing with EC math.
Now, if it were possible to calculate an even target pub or an odd one, then 130 puzzle could be solved in a few hours.
But there is a way to make sure that the correct results are in your files and your tool had all the incorrect and correct keys.
Here is how, you know some keys can be divided by 2 a few times in a row, so when you divide a key you need to divide it by 2 at least 4 times, subtract 1 from all and do the same with all the keys. This should occupy less than 1 GB of storage/ RAM, and it should solve the low bit range keys in minutes, but I don't know why nobody is trying it.🤔
just remember bro, what are you doing in right now it's already done with someone who was not in this forum, believe me or not, u just need develop it no being amateur with code flying inside.
just ensure the progress and don't be a jerk about someone idea.