Compute polynomials twice as fast
Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.
Want to reach these readers? Sponsor an issue.
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.
HN · launched Sep 9, 2026 · 137 upvotes (top 6%) · 0 views
Niche: specialized algorithms and computing libraries · 230 launches, 4 in the last 7 days ▼ -73% · Explore this niche →
Category and tags
- Horizontal
- Dev tools
- Developer
- Not AI
- Hobby / open-source project
Visit website ↗ Source listing ↗
More like this: all 230 launches in specialized algorithms and computing libraries →
Could you build this?
No The underlying value is a novel mathematical discovery and Lean-verified formal proof reducing polynomial multiplications, representing advanced theoretical computer science and algebraic research.
What it would actually take: Requires original research in algebraic complexity theory to invent rational coefficient preprocessing schedules that cut multiplication bounds down to floor(n/2)+1. Implementation involves constructing a symbolic algebra compiler (e.g., in SymPy or Rust) that computes optimal evaluation graphs over arbitrary finite fields and real/complex fields, validated by interactive theorem provers like Lean. This is fundamental research requiring a PhD-level mathematician or theoretical computer scientist.
Discussion
No comments on this launch.
Competitors
Other products that read as similar to this one : 147 launches clear the similarity bar, closest 8 shown.
Attention rank: #9 of 148 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).
Launched 313 days after the earliest competitor.
- matrix-multiplication-all-fields · github · 2026-10-07 · 27 upvotes · similarity 0.47
- diophantine-z-q · github · 2026-11-04 · 59 upvotes · similarity 0.47
- Sostactic · hn · 2026-04-18 · 14 upvotes · similarity 0.45
- advanced-hash-calculator · github · 2026-11-10 · 102 upvotes · similarity 0.45
- I Dedicated 4 Years to Mastering Offline Password Cracking · hn · 2026-05-21 · 268 upvotes · similarity 0.44
- TheoremSmith: Mass-Producing Hard Proof Problems to Train LLMs · hn · 2026-11-10 · 10 upvotes · similarity 0.44
- polyxor · github · 2026-09-26 · 53 upvotes · similarity 0.44
- utreexo-utreexo · github · 2026-11-06 · 29 upvotes · similarity 0.43
The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.