 As Pearson noted, a change to any bit in the string causes his algorithm to create a completely different hash (0-255).In the code above, following every completion of the inner loop, the first byte of the string is effectively incremented by one (without modifying the string itself).Every time that simple change to the first byte of the data is made, a different Pearson hash, , is generated.