After experimenting with cycling punctuation, and random capitalization I hit on the idea to use each word as a bit and map the original version of the word to 0 and the title-case-toggled version of the word to 1.
Then just use the text file as a "counter nonce" and count from 0 until we find a counter that hashes to the vanity prefix we want.
The advantage of this is flipping the capitalization of the first letter of each word doesn't drastically alter the visual appearance of the file (tho it may alter semantics!), and you get an easy to understand amount of entropy (number of states) to walk through.
The C version linked only supports counting up to ~4 billion but it could be easily extended. A JS version using BigInt can go unlimited.
For reference the included example text took a surprising 2 billion iterations to discover the correct 8 digit hash which is about what you'd expect from random (i.e., half the state space of 16*8 = (2*4)*8)
This is cute but it works in the opposite for me, looks very unprofessional and gives the impression you get distracted with nerdy internals instead of building product.
On the other hand, where I work we want people like that. Not every place is a CRUD slop shop with joined at the hip SPA that needs more meat for the ginder.
Research and specialized optimization roles exist
After experimenting with cycling punctuation, and random capitalization I hit on the idea to use each word as a bit and map the original version of the word to 0 and the title-case-toggled version of the word to 1.
Then just use the text file as a "counter nonce" and count from 0 until we find a counter that hashes to the vanity prefix we want.
The advantage of this is flipping the capitalization of the first letter of each word doesn't drastically alter the visual appearance of the file (tho it may alter semantics!), and you get an easy to understand amount of entropy (number of states) to walk through.
The C version linked only supports counting up to ~4 billion but it could be easily extended. A JS version using BigInt can go unlimited.
For reference the included example text took a surprising 2 billion iterations to discover the correct 8 digit hash which is about what you'd expect from random (i.e., half the state space of 16*8 = (2*4)*8)
Don't bother applying here if your github doesn't look like this:
Sadly, you won’t get any senior applicants if you’re mistaking the website for the tool.
Here, that touch is necessary for a hint of realism.
This is cute but it works in the opposite for me, looks very unprofessional and gives the impression you get distracted with nerdy internals instead of building product.
On the other hand, where I work we want people like that. Not every place is a CRUD slop shop with joined at the hip SPA that needs more meat for the ginder. Research and specialized optimization roles exist
I don't get the last one?
"scalable"
what?
Read the commit sha prefixes as English
Look at the hashes of the commits
Interesting, also this quote is as interesting as the code:
"Your job, throughout your entire life, is to disappoint as many people as it takes to avoid disappointing yourself."
That took a second to process and sink in.
Added to my shameful, neurotic HN profile.. haha, thank you!
The SHA-256 hash of this sentence begins with 0573e7473.
The SHA256 for this sentence begins with: one, eight, two, a, seven, c and nine.
Oh boy, here we go…
That's a fun way to do it! :)
The SHA-256 hash of this sentence does not.
OK, that's a cool way to fuzz the digest rather than the text :)
Nice one.
Cool! I made a multithreaded version about 10 years that works for binary files like .zip files: https://github.com/century-arcade/src/tree/master/tools/vain...
Cool! How do you handle internal checks in the files? How does overwriting 8 zeroes not break stuff?
Well it was intended/used to fill out a .zip file comment section, so those 8 zeroes were ignored anyway.
Smart!