>>>>> "Ken" == Ken Williams <[EMAIL PROTECTED]> writes:
Ken> As with any hashing algorithm, you need to deal with
Ken> collisions. The chances of having two URIs with the same MD5
Ken> are slim, but definitely nonzero. Apply the pigeonhole
Ken> principle.
Ken> MD5 is pretty commonly used for this kind of thing, but in my
Ken> opinion it shouldn't be unless you're prepared to deal with
Ken> collisions. It seems like there's nothing wrong with your
Ken> plan of translating to FFCs, except that the names will be
Ken> long - but who cares?
Seeing as how MD5 generates a 128-bit checksum your chances of
collision are *reaaallly* slim. If you're that paranoid about the
possibilities, use Digest::SHA1 which produces a 160-bit checksum.
--
Fletch | "If you find my answers frightening, __`'/|
[EMAIL PROTECTED] | Vincent, you should cease askin' \ o.O'
678 443-6239(w) | scary questions." -- Jules =(___)=
| U
