Show HN: Compute Polynomials Twice as Fast https://ift.tt/ZnAt9Wu

Show HN: Compute Polynomials Twice as Fast 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. https://ift.tt/WIynqc2 September 9, 2026 at 01:53AM