Rolling hash · Lablypedia

A few hash functions allow a rolling hash to be computed very quickly—the new hash value is rapidly calculated given only the old hash value, the old value removed from the window, and the new value added to the window—similar to the way a moving average function can be computed much more quickly than other low-pass filters; and similar to the way a Zobrist hash can be rapidly updated from the old hash value.

One of the main applications is the Rabin–Karp string search algorithm, which uses the rolling hash described below. Another popular application is the rsync program, which uses a checksum based on Mark Adler's adler-32 as its rolling hash. Low Bandwidth Network Filesystem (LBFS) uses a Rabin fingerprint as its rolling hash. FastCDC (Fast Content-Defined Chunking) uses a compute-efficient Gear fingerprint as its rolling hash.

At best, rolling hash values are pairwise independent or strongly universal. They cannot be 3-wise independent, for example.

Polynomial rolling hash

The Rabin–Karp string search algorithm is often explained using a rolling hash function that only uses multiplications and additions:

H = c_{1} a^{k - 1} + c_{2} a^{k - 2} + c_{3} a^{k - 3} + . . . + c_{k} a^{0}

where $a$ is a constant, and $c_{1}, . . ., c_{k}$ are the input characters (but this function is not a Rabin fingerprint, see below).

In order to avoid manipulating huge $H$ values, all math is done modulo $n$ . The choice of $a$ and $n$ is critical to get good hashing; in particular, the modulus $n$ is typically a prime number. See linear congruential generator for more discussion.

Removing and adding characters simply involves adding or subtracting the first or last term. Shifting all characters by one position to the left requires multiplying the entire sum $H$ by $a$ . Shifting all characters by one position to the right requires dividing the entire sum $H$ by $a$ . Note that in modulo arithmetic, $a$ can be chosen to have a multiplicative inverse $a^{- 1}$ by which $H$ can be multiplied to get the result of the division without actually performing a division.

6 more chapters are free with a Lably account.

Rabin fingerprint

The Rabin fingerprint is another hash, which also interprets the input as a polynomial, but over the Galois field GF(2). Instead of seeing the input as a polynomial of bytes, it is seen as a polynomial of bits, and all arithmetic is done in GF(2) (similarly to CRC32). The hash is the result of the division of that polynomial by an irreducible polynomial over GF(2). It is possible to update a Rabin fingerprint using only the entering and the leaving byte, making it effectively a rolling hash.

Because it shares the same author as the Rabin–Karp string search algorithm, which is often explained with another, simpler rolling hash, and because this simpler rolling hash is also a polynomial, both rolling hashes are often mistaken for each other. The backup software restic uses a Rabin fingerprint for splitting files, with blob size varying between 512KiB and 8MiB.

Cyclic polynomial

Hashing by cyclic polynomial—sometimes called Buzhash—is also simple and it has the benefit of avoiding multiplications, using barrel shifts instead. It is a form of tabulation hashing: it presumes that there is some hash function $h$ from characters to integers in the interval $[0, 2^{L})$ . This hash function might be simply an array or a hash table mapping characters to random integers. Let the function $s$ be a cyclic binary rotation (or circular shift): it rotates the bits by 1 to the left, pushing the latest bit in the first position. E.g., $s (101) = 011$ . Let $\oplus$ be the bitwise exclusive or. The hash values are defined as

H = s^{k - 1} (h (c_{1})) \oplus s^{k - 2} (h (c_{2})) \oplus \dots \oplus s (h (c_{k - 1})) \oplus h (c_{k}),

where the multiplications by powers of two can be implemented by binary shifts. The result is a number in $[0, 2^{L})$ .

Computing the hash values in a rolling fashion is done as follows. Let $H$ be the previous hash value. Rotate $H$ once: $H \leftarrow s (H)$ . If $c_{1}$ is the character to be removed, rotate it $k$ times: $s^{k} (h (c_{1}))$ . Then simply set

H \leftarrow s (H) \oplus s^{k} (h (c_{1})) \oplus h (c_{k + 1}),

where $c_{k + 1}$ is the new character.

Hashing by cyclic polynomials is strongly universal or pairwise independent: simply keep the first $L - k + 1$ bits. That is, take the result $H$ and dismiss any $k - 1$ consecutive bits. In practice, this can be achieved by an integer division $H \to H \div 2^{k - 1}$ .

Content-based slicing using a rolling hash

One of the interesting use cases of the rolling hash function is that it can create dynamic, content-based chunks of a stream or file. This is especially useful when it is required to send only the changed chunks of a large file over a network: a simple byte addition at the front of the file would normally cause all fixed size windows to become updated, while in reality, only the first "chunk" has been modified.

A simple approach to making dynamic chunks is to calculate a rolling hash, and if the hash value matches an arbitrary pattern (e.g. all zeroes) in the lower N bits (with a probability of $\frac{1}{2^{n}}$ , given the hash has a uniform probability distribution) then it’s chosen to be a chunk boundary. Each chunk will thus have an average size of $2^{n}$ bytes. This approach ensures that unmodified data (more than a window size away from the changes) will have the same boundaries.

Once the boundaries are known, the chunks need to be compared by cryptographic hash value to detect changes. The backup software Borg uses the Buzhash algorithm with a customizable chunk size range for splitting file streams.

Such content-defined chunking is often used for data deduplication.

Content-based slicing using moving sum

Several programs, including gzip (with the --rsyncable option) and rsyncrypto, do content-based slicing based on this specific (unweighted) moving sum:

S (n) = \sum_{i = n - 8195}^{n} c_{i},

H (n) = S (n) \mod 4096,

where

$S (n)$ is the sum of 8196 consecutive bytes ending with byte $n$ (requires 21 bits of storage),
$c_{i}$ is byte $i$ of the file,
$H (n)$ is a "hash value" consisting of the bottom 12 bits of $S (n)$ .

Shifting the window by one byte simply involves adding the new character to the sum and subtracting the oldest character (no longer in the window) from the sum.

For every $n$ where $H (n) == 0$ , these programs cut the file between $n$ and $n + 1$ . This approach will ensure that any change in the file will only affect its current and possibly the next chunk, but no other chunk.

Gear fingerprint and content-based chunking algorithm FastCDC

Chunking is a technique to divide a data stream into a set of blocks, also called chunks. Content-defined chunking (CDC) is a chunking technique in which the division of the data stream is not based on fixed chunk size, as in fixed-size chunking, but on its content.

The Content-Defined Chunking algorithm needs to compute the hash value of a data stream byte by byte and split the data stream into chunks when the hash value meets a predefined value. However, comparing a string byte-by-byte will introduce the heavy computation overhead. FastCDC proposes a new and efficient Content-Defined Chunking approach. It uses a fast rolling Gear hash algorithm, skipping the minimum length, normalizing the chunk-size distribution, and last but not the least, rolling two bytes each time to speed up the CDC algorithm, which can achieve about 10X higher throughput than Rabin-based CDC approach.

The basic version pseudocode is provided as follows:

<b id="mwow">algorithm</b> FastCDC <b id="mwpA">input:</b> data buffer <i id="mwpQ">src</i>, data length <i id="mwpg">n</i>, <b id="mwpw">output:</b> cut point <i id="mwqA">i</i> <i id="mwqQ">MinSize</i> <span typeof="mw:Entity" id="mwqg">←</span> 2KB // split minimum chunk size is 2 KB <i id="mwqw">MaxSize</i> <span typeof="mw:Entity" id="mwrA">←</span> 64KB // split maximum chunk size is 64 KB <i id="mwrQ">Mask</i> <span typeof="mw:Entity" id="mwrg">←</span> <i id="mwrw">0x0000d93003530000LL</i> <i id="mwsA">fp</i> <span typeof="mw:Entity" id="mwsQ">←</span> <i id="mwsg">0</i> <i id="mwsw">i</i> <span typeof="mw:Entity" id="mwtA">←</span> <i id="mwtQ">0</i> // buffer size is less than minimum chunk size <b id="mwtg">if</b> <i id="mwtw">n</i> ≤ <i id="mwuA">MinSize</i> <b id="mwuQ">then</b> <b id="mwug">return</b> <i id="mwuw">n</i> <b id="mwvA">if</b> <i id="mwvQ">n</i> ≥ <i id="mwvg">MaxSize</i> <b id="mwvw">then</b> <i id="mwwA">n</i> <span typeof="mw:Entity" id="mwwQ">←</span> <i id="mwwg">MaxSize</i> // Skip the first <i id="mwww">MinSize</i> bytes, and kickstart the hash <b id="mwxA">while</b> <i id="mwxQ">i</i> < <i id="mwxg">MinSize</i> <b id="mwxw">do</b> <i id="mwyA">fp</i> <span typeof="mw:Entity" id="mwyQ">←</span> (<i id="mwyg">fp</i> << 1 ) + <i id="mwyw">Gear</i>[<i id="mwzA">src</i>[<i id="mwzQ">i</i>]] <i id="mwzg">i</i> <span typeof="mw:Entity" id="mwzw">←</span> <i id="mw0A">i</i> + 1 <b id="mw0Q">while</b> <i id="mw0g">i</i> < <i id="mw0w">n</i> <b id="mw1A">do</b> <i id="mw1Q">fp</i> <span typeof="mw:Entity" id="mw1g">←</span> (<i id="mw1w">fp</i> << 1 ) + <i id="mw2A">Gear</i>[<i id="mw2Q">src</i>[<i id="mw2g">i</i>]] <b id="mw2w">if</b> !(<i id="mw3A">fp</i> & <i id="mw3Q">Mask</i>) <b id="mw3g">then</b> <b id="mw3w">return</b> <i id="mw4A">i</i> <i id="mw4Q">i</i> <span typeof="mw:Entity" id="mw4g">←</span> <i id="mw4w">i</i> + 1 <b id="mw5A">return</b> <i id="mw5Q">i</i>

Where Gear array is a pre-calculated hashing array. Here FastCDC uses Gear hashing algorithm which can calculate the rolling hashing results quickly and keep the uniform distribution of the hashing results as Rabin. Compared with the traditional Rabin hashing algorithm, it achieves a much faster speed. Experiments suggest that it can generate nearly the same chunk size distribution in the much shorter time (about 1/10 of rabin-based chunking ) when segmenting the data stream.

Computational complexity

All rolling hash functions can be computed in time linear in the number of characters and updated in constant time when characters are shifted by one position. In particular, computing the Rabin-Karp rolling hash of a string of length $k$ requires $O (k)$ modular arithmetic operations, and hashing by cyclic polynomials requires $O (k)$ bitwise exclusive ors and circular shifts.