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?

Just the database to store 2^44 * 20 bytes is 350 TB. Will be expensive.

Real World Ethereum 🌎 
building /daimo ✳️ 

Could cut in half by just storing the last 11 bytes, but when you put it that way…

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

decentralized networking, wallet enthusiast 

Yeah plus could still parallelize the search that way…