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

create autonomous memecoins for free, get rewarded for posting bangers