1. A computer-implemented method, comprising: selecting, by a computer system, a partitioning function that identifies a pattern that is expected to occur a predetermined number of times within a data block, wherein the data block corresponds to a file in a filesystem; processing a plurality of segments of the data block, using the partitioning function, to identify a set of chunk boundaries, wherein the partitioning function takes as input a segment s i consisting of m consecutive bytes, wherein segment s i starts at the i th byte of the data block; generating a chunk for each portion of the data block between two consecutive chunk boundaries; generating one or more Manifests, wherein each Manifest includes a Content Object Hash (COH) value for each partitioned chunk; storing, by the computer system, each Manifest and the corresponding partitioned chunk in a storage repository, wherein two partitioned chunks with a common COH value are stored once in the storage repository; and determining that the file in the filesystem has been modified, and in response, the computer-implemented method further comprising: determining a portion of the file that has been modified; determining a nameless Content Object affected by the modification to the file based on the COH value; generating one or more new nameless Content Objects that include the modification to the file and are to replace the affected Content Object; storing the one or more nameless Content Objects in the storage repository; and updating, in one or more Manifests of a Manifest hierarchy, COH values corresponding to the modified portion of the file to replace the affected Content Object with the new nameless Content Objects, at the modified portion of the file, to achieve data deduping across multiple files.