2 ms·
> Minor nitpick, but really it only guarantees a successor. That's from the consistent hashing chapter. That uses a ring usually [0,2^p-1]. With p=160 if SHA i
by rdtsc 10y ago
> Minor nitpick, but really it only guarantees a successor.
That's from the consistent hashing chapter. That uses a ring usually [0,2^p-1]. With p=160 if SHA is the hash algorithm. Then the predecessor of 0 is then 2^p-1.
- contravariant 10y agoIn that case it's still neither well ordered, or even 'ordered' in any mathematical sense. I was merely pointing out that 'well ordered' doesn't convey whatever it was the author was trying to say.