Based on the published rsync algorithm (pdf<http://cs.anu.edu.au/techreports/1996/TR-CS-96-05.pdf>), it appears to filter definitely different blocks from possibly unchanged blocks using weak hashing, then applying strong hashing to double-check the rest of the file for true differences. MD4 and MD5 do experience collisions, so isn't rsync fast at the risk of being inaccurate? If I can prove that the strong algorithms rsync uses have collisions, can you prove that rsync avoids corner cases where a file block was changed but even the strong hash algorithm misses it?
Have recent versions of rsync considered using a more robust implementation of file change monitoring, like Dropbox <https://www.dropbox.com/help/8/en> does? It looks fast on my machine. -- Cheers, Andrew Pennebaker www.yellosoft.us
-- Please use reply-all for most replies to avoid omitting the mailing list. To unsubscribe or change options: https://lists.samba.org/mailman/listinfo/rsync Before posting, read: http://www.catb.org/~esr/faqs/smart-questions.html
