That "unique" claim will be false unless it can be proved that the hash function can never give the same result for two people's distinct bits of DNA, and that can't be one unless the number of hash codes is at least the same as the number of possible DNA patterns - so the hash code will have to be something of the order of 16 Megabytes long.
May have to be substanially longer since the hash tries to bucket the values, if there were HashBuckets=DNAPatterns, it's likely we would have collisions. Or just use the DNA value.