We extend the study in \cite{koppl19hash} by providing a variant, where buckets are implicitly represented as parts of a meta-bucket, which stores a bit vector for the beginning of a bucket inside the meta-bucket. This improves the average load-factor per bucket, which can become skewed if the maximal allowed bucket size is too small with respect to the input size.