Nicheloom

Market intelligence for builders — see what's gaining traction before it's crowded.

I computed a 109M-digit prime candidate for the EFF prize using Python

Details

External ID
46480825
Source
HN
Company
—
Product
I computed a 109M-digit prime candidate for the EFF prize using Python
Website domain
github.com
Launched
Jan. 3, 2026
Cohort
—
Upvotes
5
Upvotes percentile
0.09617918313570488
Tags
—
Fetched at
Sept. 7, 2026, 9:25 p.m.
Updated at
Sept. 7, 2026, 9:25 p.m.

Enrichment

Theme
scientific computing and deep tech tools
Vertical
Horizontal
Function
Dev tools
Audience
Developer
AI stance
Not AI
Project type
Hobby / open-source project
Normalized one-liner
large prime number computation for eff prize
Manually corrected
False

Could you build this?

No Finding and verifying giant primes (over 100M digits) requires specialized computational number theory, discrete mathematics, and distributed HPC or GPU-accelerated algorithms (like FFT-based Lucas-Lehmer or Proth tests).

What it would actually take: A viable computation pipeline requires highly optimized C/assembly libraries like GMP or specialized FFT arithmetic (such as Prime95/George Woltman's George Woltman FFT algorithms or GPU equivalents in CUDA). The core challenge is the O(N log N) arbitrary-precision arithmetic at 100M+ digit scales, requiring months of cluster compute, checkpointing, and rigorous deterministic primality verification routines.

Discussion

2 comments analyzed.

Concerns raised: 8-digit passwords can be cracked immediately, Password safety and security, Copy-paste functionality into password fields

Competitors

Other products that read as similar to this one — 52 launches clear the similarity bar, closest 8 shown.

Attention rank: #42 of 53 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).

Launched 50 days after the earliest competitor.

Other launches for this product

Same idea, different domain

Nobody's really built a dev tools tool for Sales yet.