If you're going to sort the hashes then might as well make a jump table of the f... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		zamadatix on March 2, 2020 \| parent \| context \| favorite \| on: A journey to searching Have I Been Pwned database ... If you're going to sort the hashes then might as well make a jump table of the first n bits and a binary search from there.

thedance on March 2, 2020 [–]

Why do you even need the jump table? If the hash function is working you should get quite close just by dead reckoning.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact