I was excited to review and potentially implement ssdeep for some "fuzzy-hashing" in a project I was working on.So I read the the paper, then the papers referenced by it, then anything else I could find on it... nobody said why the rolling-hash algorithm works, where it came from, whether it is optimal or can be improved upon!I’ll give you a brief overview of ssdeep (context-triggered-piecewise-hash) then jump into a bitwise visualization to assist in explaining how and why it works.