cbloom rants

In this series I described how to build a patcher that can make very good (near minimal size) "coarse grain" patches, and run near...

In the real world, a lot of the issues for making a very fast patcher are in the practical matters of parallelism and file IO, so let's ...

We have a scheme to cut our file into content-defined chunks . So let's use that to make a patcher. For each file, we can construct...

Just for my own entertainment, a brief aside to prove some facts we used in the last post. After drawing N random numbers in [0,1] , t...

The alternative to rsync-style patch generation is to use content-defined chunking (CDC). There's enough to say about CDC that I'll...

rsync is not a patcher; it is a method for transmitting differences of data over a network connection. You can however build a patcher (&qu...

Let's go through some options for rolling hashes. By "rolling hash" I mean a hash that works on a finite window of bytes, and...

I will descibe in this series the patcher that I wrote which is able to find "perfect" patches at full IO-bound speed; eg. 5 GB/s...

This is an attempt to survey possible reasonable options for float to int casts for data compression. As mentioned in the previous post ...

When attempting to encode and compress delta values that are larger than 1 byte, and then feeding them to a back-end compressor which inher...