I've recently been looking into incremental hash functions (namely, LtHash). My purpose is to check set membership using a hash of particular element (incremental hashing allows that). The problem is that reference implementation and ports produce 2KB hash as a default size. it seems huge to me, my goal is to hash small inputs (up to 16bytes), and ideally I'd like to have < 32b hash as a result. While reading the original paper I can't wrap my head around what's required for this. I don't mind some number of collisions (<100), but I'd like to understand at least an approximate parameters/process for this. I'm not sure birthday paradox formula can be applied here.
What are my options? Thank you