4 ms·
Optimization (for any attribute) is left as an exercise for the reader. #!/bin/bash while true ; do W1=`shuf -n 1 /usr/share/dict/words` W2=`shuf -
by SquibblesRedux 5y ago
Optimization (for any attribute) is left as an exercise for the reader.
#!/bin/bash
while true ; do
W1=`shuf -n 1 /usr/share/dict/words`
W2=`shuf -n 1 /usr/share/dict/words`
W3=`shuf -n 1 /usr/share/dict/words`
W4=`shuf -n 1 /usr/share/dict/words`
W5=`shuf -n 1 /usr/share/dict/words`
SHA=`echo "$W1 $W2 $W3 $W4 $W5" | sha256sum | egrep 8888`
if [ "$SHA" != "" ] ; then
echo "$SHA $W1 $W2 $W3 $W4 $W5"
fi
done
Sample output:
00b6b668465deadabf11d7296e7de33780643e23c967e255888884f34ecc41de - frigorifical psittaceous goodeniaceous oostegite handsomeish
b3096654fa38ca318888b2c4eea4a9d93b9e49b02c54f390d2f06ca74d9e8edb - refuser skepful assumptive hypostatic toothleted
ef3a7d3b25a8cffe730b888800884ddde96ea7e58608c8bd714b5db7a5caf3fb - coenobioid graticulation astrognosy remica swarthily
c8888957c0105b6ea64b24853ec6c1a34828c0552c2776b6a4bd35d6129c3b87 - barbarously withinside underwing autocratic punkah
5ca89be465ab472eea785ab950ea28ce03457a09d1fecd2bc75b88888c269e5d - Malay persuade truantlike binodose suppose
20bdbfcdb6345888814555c2d0abeaa2f2b7c81506a661c99f7c2675688d4917 - dorsimedian seasonably cuckoo eyewinker hyperthyroidization
337675d56afb73835c58888f509de783a9385e3f249784d50b9a3e50c6a68a77 - squamous calp choosingly velum forborne
e08888a15d449e8c2dab2283d53adfa5b1bfc7fe99ccd0fd7bbe45a4ce9b0bdb - equipartition creatininemia treaclewort Menobranchus undisturbedness
- puzzlingcaptcha 5y ago>left as an exercise for the reader so do we start with markov chain generators or jump straight to gpt-3?
- LeoPanthera 5y agoYou only have to run shuf once: shuf -rn 5 /usr/share/dict/words | tr '\n' ' '
- 0xbadcafebee 5y agoI found it hilarious that none of the dicts packaged by Debian/Ubuntu include the word "cafe", but they do have "subprehensile".
- SquibblesRedux 5y agoBecause some people don't know... http://mj.ucw.cz/geek/ http://mj.ucw.cz/geek/ For more information: https://en.wikipedia.org/wiki/Geek_Code https://en.wikipedia.org/wiki/Geek_Code