3 ms·

> decimal: 49894920630459842177293598641814316632 This 128-bits can also be represented in, let's say base-50K, by using five words chosen from a 50,000 word d

> decimal: 49894920630459842177293598641814316632 This 128-bits can also be represented in, let's say base-50K, by using five words chosen from a 50,000 word dictionary. If you also make "this", "This" and "THIS" separate, then you can get away with a 17K word dictionary. Depending on the language, if you use roots and then vary morphology based number, tense, etc., then the number of root words (and the choice you have in making them simple) can be reduced. Such "pass phrases" can be easier to remember, transcribe, etc. (Also you will get random, humorous, offensive, etc., phrases...)

strags 7y ago
I recently needed to encode a 32-bit value into something easy for QA folks to remember and report. I opted for 3 words out of an 11-bit (2048 entry) dictionary of commonly used words. How to build the dictionary? Well, in order to determine the most commonly used English words, I downloaded a bunch of free texts from Project Gutenberg, and did some simple filtering - nothing less than 5 letters, no duplication of singular + plural, etc... A valuable lesson that I learned during this process is that when your corpus includes older english texts, you should always give your final list a visual once-over and apply some judicious manual filtering. I'm looking at you, "The Adventures of Tom Sawyer". (And, to a lesser extent, Moby Dick).
- Dylan16807 7y ago
  In most cases if you need a short list it's better to use something like the diceware or EFF lists than to make your own from scratch.
  - edoceo 7y ago
    Here is one: https://gist.github.com/fogleman/c4a1f69f34c7e8a00da8 https://gist.github.com/fogleman/c4a1f69f34c7e8a00da8
  - cyphar 7y ago
    Or use the BIP39 lists since they also encode 2048 bits. If you just use BIP39 you also get a checksum. RFC 1751[1] is the "standardised" option but IMHO the wordlist they use is far too easy to misread (though this is because the words are all less than 4 characters). [1]: https://tools.ietf.org/html/rfc1751 https://tools.ietf.org/html/rfc1751
- ratboy666 7y ago
  I like this. Hacked together a quick implementation in javascript (using quickjs as the interpreter): https://github.com/ratboy666/qjs-3word https://github.com/ratboy666/qjs-3word

strags 7y ago

I recently needed to encode a 32-bit value into something easy for QA folks to remember and report. I opted for 3 words out of an 11-bit (2048 entry) dictionary of commonly used words. How to build the dictionary? Well, in order to determine the most commonly used English words, I downloaded a bunch of free texts from Project Gutenberg, and did some simple filtering - nothing less than 5 letters, no duplication of singular + plural, etc... A valuable lesson that I learned during this process is that when your corpus includes older english texts, you should always give your final list a visual once-over and apply some judicious manual filtering. I'm looking at you, "The Adventures of Tom Sawyer". (And, to a lesser extent, Moby Dick).

Dylan16807 7y ago
In most cases if you need a short list it's better to use something like the diceware or EFF lists than to make your own from scratch.
- edoceo 7y ago
  Here is one: https://gist.github.com/fogleman/c4a1f69f34c7e8a00da8 https://gist.github.com/fogleman/c4a1f69f34c7e8a00da8
- cyphar 7y ago
  Or use the BIP39 lists since they also encode 2048 bits. If you just use BIP39 you also get a checksum. RFC 1751[1] is the "standardised" option but IMHO the wordlist they use is far too easy to misread (though this is because the words are all less than 4 characters). [1]: https://tools.ietf.org/html/rfc1751 https://tools.ietf.org/html/rfc1751
ratboy666 7y ago
I like this. Hacked together a quick implementation in javascript (using quickjs as the interpreter): https://github.com/ratboy666/qjs-3word https://github.com/ratboy666/qjs-3word