Oddbean new post about | logout
▲ ▼
Lux | 9 months ago (raw) | root | parent | reply | flag +2 
 Using Rana or something else?
▲ ▼
Lux | 9 months ago (raw) | root | parent | reply | flag +1 
 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
▲ ▼
Jameson Lopp | 9 months ago (raw) | root | parent | reply | flag +3 
 I'm using https://github.com/Eriner/vanity-npub
▲ ▼
James Lewis | 9 months ago (raw) | root | parent | reply | flag +2 
 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?
▲ ▼
Jameson Lopp | 9 months ago (raw) | root | parent | reply | flag 
 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.
▲ ▼
James Lewis | 9 months ago (raw) | root | parent | reply | flag 
 250kHz! That is way slower than I was expecting... couple months is right. It'd be $25-50 in electricity too.
▲ ▼
mleku | 9 months ago (raw) | root | parent | reply | flag 
 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