Here, I give you 2 which are really close to each other, lets go.😉
03b4f75b9205bdcfcf269e604e27066ea422f11e7c1cf50dee6d6b005510e4deaf
02f92b4119e2ecdc2924ff6983f65c3b5af9ed036ce5a6469f3462965840e3daef
The difference between the two public keys is 6.
If I had more time I would find the sum. Once you know the difference and sum then you can solve for the private keys individually. Simple algebra really.
Can you please explain this part how it works?
"Once you know the difference and sum then you can solve for the private keys individually. Simple algebra really."
Also, can somebody explain to me about which mode of searching for private keys is more efficient?
I mean is it more efficient to search sequentially each possible binary (of private key), the address (sequentially), the rmd160, the Xpoint or what else?
Is there any research paper about this?