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.
Should still be possible to resolve the "endian" issue with the existing word generation algorithm. However, as someone pointed out, a 3 or 4 word (or even all the words) "memorable key" could be pre-computed in Fossil and stored in a SQLite table, then a prefix of the memorable key could be matched the same way Fossil matches prefixes of hash keys.
_______________________________________________ fossil-users mailing list fossil-users@lists.fossil-scm.org http://lists.fossil-scm.org:8080/cgi-bin/mailman/listinfo/fossil-users
