Oddbean new post about login | logout Currently attempting to mine an 8 character vanity npub prefix. 4 billion guesses down...
Using Rana or something else?
If so, I forked it and made edits that will email you all mined vanities. Could set as a background process and wait lol. https://github.com/Spl0itable/rana
I'm using https://github.com/Eriner/vanity-npub
There's a trillion possibilities for 8 characters of bech 32. How many CPU cycles are be needed to check one? I'm assuming there's not a better method than brute force, right?
Depends on the CPU. One of my machines can do a quarter million guesses per second so it could easily take a couple months. Just hoping I get lucky.
250kHz! That is way slower than I was expecting... couple months is right. It'd be $25-50 in electricity too.
i wrote one of these: https://github.com/mleku/vainstr there isn't currently any acceleration or AVX implementation to speed up deriving public keys so yes it's one of the most compute intensive operations you can do on a CPU short of long division i wouldn't know exactly how many instructions are required, probably some poking around with a disassembler could reveal this
how would you migrate nsecs?
There's no easy way to do that, but it's not for my personal use anyway.
Mine is a shorter vanity npub, currently mining a LN pubkey
I did a 7-character one in about 24 hours, so maybe it won't be that bad.
Any guide about vanity Bitcoin addresses?
Don't do it. Bitcoin addresses are disposable for a reason.
2^64 ?
SUCCESS! It only required 200,000,000,000 guesses. 🫠 nostr:nevent1qqsx9c7x8fs660qvqqa4cr3nqed5ek6n3h2qfu00yclqjsp689x57vqpz3mhxue69uhhyetvv9ujuerpd46hxtnfdupzpaegm8nwwpyrtrnsjv84efjtp9mhpkvfenvxs487vx8d48y28qgxqvzqqqqqqyvh6uf3
I also did this
🫵👋