integer-mult-kappa
Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks
Get picks like this daily. The day's top launches, AI/tech news, and a weekly opportunity spotlight — straight to your inbox.
This is 1 of 255 launches in specialized algorithms and computing libraries — see how it stacks up on momentum and crowding →
1036 other launches read as similar to this one →
Details
- External ID
- 1409903797
- Source
- GITHUB
- Company
- —
- Product
- integer-mult-kappa
- Website domain
- github.com
- Launched
- Oct. 8, 2026
- Cohort
- —
- Upvotes
- 27
- Upvotes percentile
- 0.54
- Tags
- algorithms, arithmetic-complexity, certificates, complexity-theory, computational-complexity, fast-fourier-transform, fine-grained-complexity, formal-verification, integer-multiplication, interval-arithmetic, lean4, mathematics, multitape-turing-machine, number-theoretic-transform, open-problems, theoretical-computer-science
Enrichment
- Niche
- specialized algorithms and computing libraries
- Vertical
- Horizontal
- Function
- Dev tools
- Audience
- Developer
- AI stance
- Not AI
- Project type
- Hobby / open-source project
- Normalized one-liner
- conditional witness verifier for integer multiplication bounds
- Manually corrected
- False
Could you build this?
No This involves advanced computational complexity theory, formal arithmetic bounds, and mathematical proofs building upon unsolved or cutting-edge theoretical computer science conjectures.
What it would actually take: Requires deep expertise in algorithmic number theory, Fourier transforms, and Boolean circuit complexity. Implementation requires formal mathematical verification systems (like Lean 4 or Coq) and custom high-precision interval arithmetic libraries to rigorously bound multiplicative constants across astronomical ranges.
Competitors
Other products that read as similar to this one — 1036 launches clear the similarity bar, closest 8 shown.
Attention rank: #421 of 1037 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).
Launched 338 days after the earliest competitor.
- integer-mult-bounds · github · 2026-10-07 · 182 upvotes · similarity 0.81
- Algebruh · hn · 2026-08-08 · 14 upvotes · similarity 0.57
- numberwang · github · 2026-09-15 · 83 upvotes · similarity 0.55
- fourier-transform-below-nlogn · github · 2026-10-08 · 15 upvotes · similarity 0.54
- DAGraph · hn · 2026-05-13 · 6 upvotes · similarity 0.53
- matrix-multiplication-all-fields · github · 2026-10-07 · 27 upvotes · similarity 0.52
- FastLanes based integer compression in Zig · hn · 2025-12-01 · 12 upvotes · similarity 0.52
- writ · github · 2026-09-21 · 9 upvotes · similarity 0.51
Other launches for this product
- No other launches for this product.