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
29 recasts
160 reactions
✳️ dcposch on daimo
@dcposch.eth
Just the database to store 2^44 * 20 bytes is 350 TB. Will be expensive.
1 reply
0 recast
0 reaction
0age
@0age
Could cut in half by just storing the last 11 bytes, but when you put it that way…
1 reply
0 recast
0 reaction
raquo
@raquo.eth
and once you have ~200TB of bytes, finding matching pairs in the dataset is RAM-expensive, better off just picking a handful of starting pairs that fit into GPU memory and grinding until you find a match to one of those
1 reply
0 recast
0 reaction
