So you want to create a data set with entropy = 1 . Think of this in terms of a hash function , You want to create a hash which only has an address space of 33

So you want to create a data set with entropy = 1 . Think of this in terms of a hash function , You want to create a hash which only has an address space of 33 bits. Something in terms of H(Alice) = 0x12321 {H is a function which generates 0x12321 to store the data of alice) Doesn't this sound like perfect hashing with limited memory. I don't really think that this can be done with such memory constraints. Even now we cannot produce a perfect hash function that uses 1 bit / key. The theoretical best we can do is 1.44 bit / key. And the practical best we have done till now is 2.5 bits per key. [1] This may just be possible without the memory constraint that is , you answer N number of questions which uniquely identify you. (where N > 48 ) [1] http://en.wikipedia.org/wiki/Perfect_hash_function#Minimal_perfect_hash_function http://en.wikipedia.org/wiki/Perfect_hash_function#Minimal_p...