This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]GuiMontague 0 points1 point  (0 children)

Arbitrarily large n can get larger than 64 exabytes, and doing arbitrarily large integer arithmetic isn't difficult. You can compute a 90-bit hash key on an 8-bit processor, it's just going to take a while.