A new hash algorithm for Git
I don't understand the practical attack vector for breaking SHA1s in Git. Not only are objects checksummed by SHA1, they also encode the <i>length</i>. Finding a SHA1 collision is plausible, but finding a SHA1 collision that both lets you do something Nefarious, <i>and</i> is the length you need, seems really really unlikely