Compute polynomials twice as fast
Details
- External ID
- 49623398
- Source
- HN
- Company
- —
- Product
- Compute polynomials twice as fast
- Website domain
- thomasahle.com
- Launched
- Sept. 9, 2026
- Cohort
- —
- Upvotes
- 137
- Upvotes percentile
- 0.9441786283891547
- Tags
- —
- Fetched at
- Sept. 13, 2026, 5:56 p.m.
- Updated at
- Sept. 13, 2026, 5:56 p.m.
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.
Enrichment
- Theme
- low-level systems and developer tools
- Vertical
- Horizontal
- Function
- Dev tools
- Audience
- Developer
- AI stance
- Not AI
- Project type
- Hobby / open-source project
- Normalized one-liner
- fast polynomial computation library
- Manually corrected
- False
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 — 78 launches clear the similarity bar, closest 8 shown.
Attention rank: #7 of 79 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).
Launched 313 days after the earliest competitor.
- Sostactic · hn · 2026-04-18 · 14 upvotes · similarity 0.44
- I Dedicated 4 Years to Mastering Offline Password Cracking · hn · 2026-05-21 · 268 upvotes · similarity 0.43
- polyxor · github · 2026-09-26 · 53 upvotes · similarity 0.42
- The A-C Coupling Theorem · hn · 2026-06-13 · 5 upvotes · similarity 0.40
- genpark-elliptic-curve-secp256k1-point-math-skill · github · 2026-09-28 · 7 upvotes · similarity 0.40
- genpark-shamir-secret-sharing-polynomial-recovery-skill · github · 2026-09-28 · 7 upvotes · similarity 0.40
- Fast and lightweight hash implementations (xdigest) · hn · 2026-02-19 · 5 upvotes · similarity 0.40
- zkGolf · hn · 2026-07-02 · 69 upvotes · similarity 0.39
Other launches for this product
- No other launches for this product.
Same idea, different domain
Nobody's really built a dev tools tool for Sales yet.