On 07/09/13 23:43, David Given wrote:
OTOH, thinking about the actual use case for these, I'm not sure there's
going to be that many situations where someone needs to remember an
entire unambiguous hash. The main use case I'm thinking of here, which
is where someone from work comes over to my
On 2013-09-06 20:11, Ross Berteig wrote:
ba-ba-ba-ba
12345678di-ku-poo-wa
74a95e62vu-che-roo-si
da39a3ee5e6b4b0d3255bfef95601890afd80709
ghi-le-clo-phoo-roo-to-no-cy-ki-py-frau-
phau-bly-sa-fa-bla-chau-gha-bau-ce
I like this, but...
At least in
On 05/09/13 22:41, 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
On 9/5/2013 1:39 PM, Doug Franklin wrote:
These are going to get long, fast, as someone else already noted.
However, in the past I've seen algorithms to generate random words
that are still pronounceable, one character at a time. The trouble
here is likely to be the comparative lack of vowels.
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,
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,
On 5 September 2013 17:41, David Given d...@cowlark.com wrote:
(The alternative is a 2^11 word dictionary, which means coming up with
another 422 suitable words from somewhere, which I don't think is
feasible. The author claims the current dictionary took 300 hours to
compile.)
There's an
On 9/5/2013 11:32 PM, Edward Berner wrote:
On 9/5/2013 1:39 PM, Doug Franklin wrote:
These are going to get long, fast, as someone else already noted.
However, in the past I've seen algorithms to generate random words
that are still pronounceable, one character at a time. The trouble
here is
On 2013-09-06 20:11, Ross Berteig wrote:
ba-ba-ba-ba
12345678di-ku-poo-wa
74a95e62vu-che-roo-si
da39a3ee5e6b4b0d3255bfef95601890afd80709
ghi-le-clo-phoo-roo-to-no-cy-ki-py-frau-
Thus said David Given on Wed, 04 Sep 2013 22:07:32 +0100:
Based on various conversations in the past I have been working on a
semi-interesting features: using mnemonic encoding to turn ticket
hashes into something that humans can remember.
What about using the ICAO alphabet? It be
On Thu, Sep 5, 2013 at 12:27 PM, David Given d...@cowlark.com wrote:
Out of interest, when do people using Fossil actually use hashes to
refer to things? It's fairly common to use the hash in git to refer to a
specific checkin, for example, but I've never found an urge to do that
in Fossil.
On Thu, Sep 5, 2013 at 6:27 AM, David Given d...@cowlark.com wrote:
playing with the encoder I see that:
12345678 = CRASH CHAPTER CASINO
123456 = ROVER TRIBAL EGO
1234 = JAMES ACTIVE
12 = ALCOHOL
I think the above doesn't really work for an application like Fossil. I
think
Richard Hipp wrote:
[...]
I think the above doesn't really work for an application like Fossil. I
think that a prefix of the SHA1 hash should encode to a prefix of the
mnemonic, and the other way arround too - a prefix of the mnemonic
should decode back to a prefix of the original hash.
[...]
Can tickets be tagged? A quick browse of the tickets page and I conclude
the answer is probably no. If tickets could be tagged similar to the
timeline then tags could be used to give tickets a sync friendly short name
which could be used in the ticket listings and when discussing the tickets.
The
On 9/5/2013 3:27 AM, David Given wrote:
Out of interest, when do people using Fossil actually use hashes to
refer to things? It's fairly common to use the hash in git to refer to a
specific checkin, for example, but I've never found an urge to do that
in Fossil.
Personally I use them almost
On Thu, Sep 5, 2013 at 5:52 PM, Matt Welland estifo...@gmail.com wrote:
Can tickets be tagged? A quick browse of the tickets page and I conclude
the answer is probably no. If tickets could be tagged similar to the
timeline then tags could be used to give tickets a sync friendly short name
On 9/5/2013 6:55 AM, Richard Hipp wrote:
On Thu, Sep 5, 2013 at 6:27 AM, David Given d...@cowlark.com
mailto:d...@cowlark.com wrote:
playing with the encoder I see that:
12345678 = CRASH CHAPTER CASINO
123456 = ROVER TRIBAL EGO
1234 = JAMES ACTIVE
12 = ALCOHOL
On 9/5/2013 11:18 AM, Stephan Beal wrote:
i'm not 100% sure my query is right (i'm no SQL guru), but in the mail
fossil repo we seem to have only 14 collisions (across 21k blobs) at 6
digits:
So ran this query over my current project's repo, which has only 2254
blobs, for a range of
On Thu, Sep 5, 2013 at 10:39 PM, Doug Franklin
nutdriverle...@comcast.netwrote:
These are going to get long, fast, as someone else already noted. However,
in the past I've seen algorithms to generate random words that are
still pronounceable, one character at a time. The trouble here is
On Thu, Sep 5, 2013 at 11:52 AM, Matt Welland estifo...@gmail.com wrote:
Can tickets be tagged? A quick browse of the tickets page and I conclude
the answer is probably no. If tickets could be tagged similar to the
timeline then tags could be used to give tickets a sync friendly short name
On 2013-09-05 13:43, Ross Berteig wrote:
First off, as you mentioned a few posts ago, you've got to get it
examining the bits in the same order and chunks regardless of the
endianness of the host. At that point, it seems like prefixing ought
to start working as expected.
I'm not convinced
On 05/09/13 15:21, David Given wrote:
Richard Hipp wrote:
[...]
HHH - WORD - HH
HH -WORD-WORD - H
- WORD-WORD-WORD -
[...]
I'll have a go tonight and see what happens --- the encoder/decoder is
wrong and needs to be rewritten anyway.
After
On Thu, Sep 5, 2013 at 11:41 PM, David Given d...@cowlark.com wrote:
I don't think seven hex characters is unique enough, based on the stats
other people have figured out. Could someone do the collision check on
the NetBSD repository, if they have a copy? (It's not worth checking
out, as it's
Based on various conversations in the past I have been working on a
semi-interesting features: using mnemonic encoding to turn ticket hashes
into something that humans can remember.
This uses a built-in dictionary to convert a hex hash (e.g. '74a95e62')
into a series of words ('TOAST MOZART
24 matches
Mail list logo
