Remix.run Logo
nkrisc 2 days ago

If you use the identity function as your hashing function then is it O(0) because you are done before you start?

Sharlin 2 days ago | parent [-]

For an arbitrarily long input, you still have to compress it to constant size somehow.

nkrisc 2 days ago | parent [-]

Or pad all entries with 0s to an arbitrarily long size. The 0s can be assumed, and not actually stored. Therefore arbitrarily long entries need not be shortened.

Sharlin 2 days ago | parent [-]

I don't think there are any reasonable use cases for a non-constant-length hash.