Skip to content

Comment on Show HN: Compute polynomials twice as fastparent

Comments

Hopefully that answers your question about why someone might still choose to use heuristic hashing

Not really. Our method is also 2x faster than xxh3.

Sure, AES make the heuristic hashes harder to break, but they still provide (1) slower performance, (2) no guarantees.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.