Dear fellow fossil-users ? As we all know, SHA1 and its successor algorithms are specifically designed to make collisions not just improbable, but very very very improbable.
However, there are a lot of fossil users doing lots and lots of commits and other stuff that involves lots and lots of SHA1 calculations, so we could look at fossil not just as being a DVCS, but also as a kind of SHA1 collision search engine :-) Just for the sake of my curiosity; is there any fossil user out there who has encountered a SHA1 collision ? Does fossil contain code to cope with such a situation ? ( Yes, I know that there are a couple of dedicated machines out there burning lots of CPU-cycles in search of such a collision, but maybe they can't find it just because they look too hard :-) ) Cheers, JvK _______________________________________________ fossil-users mailing list fossil-users@lists.fossil-scm.org http://lists.fossil-scm.org:8080/cgi-bin/mailman/listinfo/fossil-users
