lkml.org 
[lkml]   [2003]   [Oct]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: Transparent compression in the FS
    Chris Meadors wrote:
    > On Thu, 2003-10-16 at 17:02, Jeff Garzik wrote:
    >
    >
    >>I'm curious if anyone has done any work on using multiple different
    >>checksums? For example, the cost of checksumming a single block with
    >>multiple algorithms (sha1+md5+crc32 for a crazy example), and storing
    >>each checksum (instead of just one sha1 sum), may be faster than reading
    >>the block off of disk to compare it with the incoming block. OTOH,
    >>there is still a mathematical possibility (however-more-remote) of a
    >>collission...
    >
    >
    > I don't think multiple hashes will gain any more uniqueness over just a
    > larger hash value.

    I disagree...

    But as long as the hash is smaller than the block
    > being hashed there is the possibility of two dissimilar blocks producing
    > the same hash.

    Agreed.

    Jeff



    -
    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to majordomo@vger.kernel.org
    More majordomo info at http://vger.kernel.org/majordomo-info.html
    Please read the FAQ at http://www.tux.org/lkml/

    \
     
     \ /
      Last update: 2005-03-22 13:58    [W:0.019 / U:0.608 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site