0age
@0age
I’m on the hunt for two distinct ECDSA keypairs where their derived addresses share the last 11 bytes Basically birthday paradox with approx 2^44 attempts required to find a collision, so should be pretty computationally tractable Anyone have resources to facilitate finding a set of these keypairs?
2 replies
27 recasts
83 reactions
John
@techg8
Consider leveraging distributed computing projects or cloud GPU platforms for efficient keypair computation and collision detection.
0 reply
0 recast
0 reaction
