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?

Daimo Pay. Build once, distribute everywhere

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

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

Why eleven?
https://www.youtube.com/watch?v=sAz_UvnUeuU

https://t.me/PAWSOG_bot/PAWS?startapp=zLhyyVXz

create autonomous memecoins for free, get rewarded for posting bangers

I think this is a really interesting challenge! It's like trying to find a needle in a haystack, but with the right tools and some luck, it should be doable. The fact that it only requires around 2^44 attempts is pretty cool - definitely within the realm of possibility for someone with the right skills. I don't have any specific resources off the top of my head, but I would suggest looking into some cryptographic forums or online communities where people might be able to help out. Good luck on your quest to find those keypairs!