Well, it's amazing that even you wrote it yourself, you don't realize what your saying. As you can clearly see on your own example "0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b" and "0330210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b" have different privet keys, which is what I wrote, Now do you understand?
BTW, there are no privet keys 'with a minus sign "-"!'
There is a chain of lols in this page and previous one.
Don't let the looks of private keys deceive you.
This is N
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141
Now in order to find the inverse of your private key, just subtract it from N and you will have negative x coordinate of your private key. You should know whenever you generate an address, you are actually generating 4 addresses which you could use, but only can control 2 addresses with your key unless you subtract the key from N to obtain -n of your private key.
In ECC, those large private keys are just negative numbers, till you reach the middle range, meaning half of all private keys are negatives, the other half are positives.
So, as I said earlier, in order to subtract a private key from your public key, it's best to switch x coordinate and also switching the x coordinate of the result because it would be -n and as you did yesterday, subtracting something from a -n key will actually add the 2 keys together, also adding to a -n key as I said will subtract from the +n version of your key.
You should use another calculator which shows, accepts public keys with 02 and 03, this way you won't get confused as to whether you are adding or subtracting.
Just stop lol. Read what he said. You can’t subtract a private key, a private key, from a public key. Yes, you have to convert the private key to a public key before subtracting it from another public key.
All those programs you are calling sissy, do math like you are doing.
You can just multiply G by any number in one go, adding or subtracting and I'm not talking about under the hood as you like to say, but manually you can just add 2 private keys directly to have a resulting public key, though you don't have to manually convert a private key into a public key and then try math operations on them.
Also, do kangaroo and BSGS do any division? If they are not, then they are useless, if they do then again they are useless because by dividing properly, you should find a key in a much much shorter period of time.
However I'm guessing kangaroo might do division but ECC doesn't bend so easily.
So If I have to start from a range on BSGS according to your mathematical calculations, which key is the closest that you almost thought could have hit puzzle 125... lets search within that range on BSGS. then we can all share some funds together too.
The closest one is 03ed01ff219ed5c1afc12d991a82e3063ddcee1fd53b46f7cad52a0d87a7112aed, it should be searched for in the 124 range.
This key you call the closest one could have a size half the 2^124.
I might be wrong but somehow I can say with 50% certainty that #125 starts with 0x1c. If I'm right it could help a lot in further lowering the bit range, this has taken me more than 45 days and I am still not sure.
Maybe, maybe one way to figure out if we are subtracting too much from #125, would be to start subtracting a bigger key and keep reducing it's size very carefully till we see a -n key as a result, though because of this mod thingy it is extremely difficult to determine if the result is -n or not.
Chop chop guys, the rich and wealthy are about to use their silicon wares and grab our loot, we need to step up our game.😉
cuz the address looks like its in that range it starts with same 7 digits with 66 puzzle and same 8 first digits of hash160...
, of course if it is in that range im not sure im asking you guys ? 
