On 9/5/2013 2:41 PM, David Given wrote:
I think, without a mathematical proof, that maintaining the ability to take prefixes of an encoded name will require us to use a dictionary that fits into a precise number of bits. Truncating the dictionary to 2^10 entries would be the simplest approach, but this means that our three words no longer encode exactly 32 bits --- we only get 30 bits, which is 7 hex characters. Four words gets us 40 bits, which is 10 hex characters. We don't get anything in between.
Maybe borrow an idea from old-school telephone numbers and use a word (or two) followed by digits? If words are 10 bits, then word-word-[five decimal digits] could encode 36 bits. Alternately, word-word-[four hex digits] would also give 36 bits.
-- Edward _______________________________________________ fossil-users mailing list fossil-users@lists.fossil-scm.org http://lists.fossil-scm.org:8080/cgi-bin/mailman/listinfo/fossil-users
