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.<p>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.

  • 情报分类：技术价值
  • 命中依据：多项式计算提速，有技术价值
  • 来源：Hacker News 新项目
  • 原作者：thomasahle
  • 发布时间：2026/9/9 16:53:58