One experienced user of this forum said: "The key is the input of the hash function to build up a fast internal hash table. The key is hashed again to perform the lookup.".
If I hash a data such as a 262144-bytes seed (as SMhasher does) is passed through a hash function to build up a fast internal hash table, can the secondary lookups include different data such as a counter appended to the seed again? I mean if some bytes can be appended to the seed to be hashed and reuse the same internal hash table again, not having to rebuild it again.
H is the hash, S is the seed, 01, 02, 03 the counter, all hashed sequentially. The H(S) hashed first should build the internal hash table for subsequent lookups.