No AI summary available for this article.
Why It Matters
A few years ago my coauthor and I was wondering if we could reduce the number of multiplications used for hashing algorithms.
Provenance
Discovered via Hacker News and published by thomasahle.com.
Key Claims
Original description
A few years ago my coauthor and I was wondering if we could reduce the number of multiplications used for hashing algorithms. We had a construction and a 100 page proof, but we were not 100% sure it was correct. Now we have a full Lean proof, so we decided to publish it. I made this website to make it easy for anyone how has polynomials to evaluate to see how it would be done using our method, as well as a number of previous approaches by Knuth and others.
Discovered via Hacker News
Community-ranked links and discussion from the HN front page.
Publisher: thomasahle.com
ID: 49623398 · Indexed about 2 hours ago