The length of the longest common prefix of two bit strings is smaller that the length of the longest common prefix of their fuzzbuzz hash.
The algorithm rely on a Merkle-tree that use a bitwiseas a hash function and then serialize the tree using a top-down depth-first traversal algorithm.
For instance, let's pickbit string. We can construct the following Merkle tree:
Then we can serialize it the tree without the leafs, using top-down depth-first traversal.
Here is the same tree, with the index of each bit between parens:
That result is the following bitstring:
At last, we suffix that bitstring with the original bitstring: