Sorry, If I manage to solve any puzzle I will give all the information at the moment I do not have a good economic position for it.
Anyone could add x quantity to the puzzle key, generating a different public key and camouflage the puzzle with it, and by giving them information I would be solving the puzzle without knowing it.
then simply subtract that same amount from the camouflaged public key and go back to the puzzle and solve it.
Well, if that is really the problem, here is the private key for that public key:
priv key HEX: 0x155d735095df3f8c24ee33e4dfe955da
priv key DEC: 28399010381067550399127235982780880346
pub key: 0343b7d69e8372746596980d678d6cdecbffb2927916b3dbd3bc3d27bf5366b166
As you can see, I won't solve any puzzle with the info you provide; I only want to test if your script works or not.
But if you decide not to test it with me, that's OK.
Cheers.
With a known private key, each person can reduce the key to any size. Here is an example:
115 bit
pub key: 02903740144e9f301f62362813dec638747153d4f18467f32286d09b9b4412768b
priv key: 0x5735095df3f8c24ee33e4dfe955da
85 bit
pub key: 02f50518c0b808dff5bd75f10e146d33677dccbfd18370e64be0c4cc36abc9675f
priv key: 0x1f3f8c24ee33e4dfe955da
40 bit
pub key: 03a0f8f7d72f6199bb09762c8500ed22eba5253f9661f752db338bbf5eeefb1852
priv key: 0xe4dfe955da
By revealing the private key, you will not know whether the method works or not.
You are right, I didn't even think about it. On the other hand, I understand his point. I can make another pub key and see if he's willing to test his method with me or not.