FPF Prime
Ferguson Prime Formula (FPF) — the fastest prime computation API available. Instantly predict the nth prime for any n (including n = 10^200) with mathematically proven error bounds. No other API offers this capability at any scale. Key features: • Instant nth prime prediction — any n, microseconds, proven error bounds • Batch primality testing — 100 numbers in one call • Prime fingerprint —…
1 subscribers
8.4/10 popularity
104 ms avg latency
67% success rate
7 endpoints
The in-depth APIMemo review for this API hasn't been published yet —
the data below comes straight from the public marketplace listing.
FPF Prime endpoints
| Method | Endpoint | Description |
|---|---|---|
| GET |
Health Check /health |
Returns service status and cache statistics. Use to verify the API is reachable. |
| GET |
Predict Nth Prime /predict/{n} |
Estimate the nth prime for any n — including n up to 10²⁰⁰ — in microseconds using the Ferguson Prime Formula |
| GET |
Primality Test /is-prime/{n} |
Deterministic Miller-Rabin primality test. Returns true or false with no false positives. |
| GET |
Prime Fingerprint /fingerprint/{n} |
Full prime profile: twin, cousin, sexy, safe, Sophie Germain, Mersenne classification, and Cramér gap merit score. |
| GET |
Prime Factorization /factor/{n} |
Prime factorization via Pollard's rho algorithm. Demonstrates RSA key strength. Supports numbers up to 10⁶⁰ on the Pro tier. |
| GET |
Gap Statistics /gap-stats |
Cramér merit score, prime gap histogram, and Hardy-Littlewood twin prime estimate over a configurable range. |
| POST |
Batch Primality Test /batch/is-prime |
Test up to 100 numbers for primality in a single request. Returns a result for each input number. |
FPF Prime pricing
| Plan | Price | Rate limit | Quotas |
|---|---|---|---|
| BASIC | Free | 2 / second |
|
| PRO Recommended | $19 / month | 5 / second |
|
| ULTRA | $79 / month | 10 / second |
|
