i am no mathshamster. but how long would it take to find a vanity address with four letters at 15 kh/s? days or weeks?
@fydel What's the format? base32? `32possible characters ^ 4 characters` = ` at most 1048576 combinations` So, I'd say within `1048576 / 15000 = 69.905066667 seconds`
thanks. but hmm. it's running for 24h now and no address found.
Checked 1034491303 at rate 13551,6
wait, what is the base
i dont know.
some letters are not in the set
check Duck32.java
I think these are the valid characters `qpzry9x8gf2tvdw0s3jn54khce6mua7l` ~`0123456789abcdefghijklmnopqrstuv`~
yeah, was looking at that
the top string is the valid ones
started it like this: bazel-bin/VanityGen love true true
ha! no love for me. :cry:
@fydel so these are valid characters `qpzry9x8gf2tvdw0s3jn54khce6mua7l` so yeah, if you're searching for invalid, it'll never find them
okay. thanks for the help.
@fydel here's a slightly more usable layout in alphabetical order `023456789acdefghjklmnpqrstuvwxyz`
thank you
hamster!
@Fireduck hates the characters `1bio`
fair enough :slightly_smiling_face: :hamster:
leet love
hamster is valid
awesome
hamster, fydel, m0use, r0dent, wheel
:smile:
@fydel `hamster` will probably take you < `19.884107852` hours `fydel` will take < `0.5` hours
nice. thanks doable.
if you could, let me know the actual time.
found "fydel" after 6-7 minutes with "true true" setting.
Checked 6252906 at rate 23998,4
There are a lot of features I could add.
Like not letting people specify "true true" because that doesn't actually work
adding multiple search terms, because the expensive part is getting the string, not looking at the string
As for the character selection, I just blindly copied what bech32 was doing
but couldn't understand the bech32 code so didn't copy the actual method there
regex searches to help scammers match prefix and suffix (and some bit in the middle)
ha
and being able to work on a list of regexes too