don't need dictionary's keys - hash table?

[Fredrik Lundh]

kdotsky at gmail.com wrote:

> Will the hash function always generate unique keys?

no.  hash() is designed for dictionaries (hash tables), not for use as a 
cryptographic hash.

depending on your application, a bloom filter might be a good enough:

     http://en.wikipedia.org/wiki/Bloom_filter

(see the links section for a Python implementation)

</F>