|
|
Subscribe / Log in / New account

A new hash algorithm for Git

A new hash algorithm for Git

Posted Feb 4, 2020 5:21 UTC (Tue) by pabs (subscriber, #43278)
Parent article: A new hash algorithm for Git

I wonder what other changes should be added when changing the format of git repositories.

For example: I would like to see restic/borg style rolling chunking, for more efficient storage of large files.


to post comments

A new hash algorithm for Git

Posted Feb 5, 2020 11:54 UTC (Wed) by nix (subscriber, #2304) [Link]

Note that various git-using projects already do this: e.g. both that and slicing objects into smaller pieces (at points identified by an rsync-style rolling hash) are more or less the core of bup. (Well, that and extensive Bloom filtering to make massive repositories fast enough to use while not having to access their packfiles or indexes more than strictly necessary.)


Copyright © 2025, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds