Discrete Logarithm Prime Calculator

Build baby powers, advance target-scaled giant steps by the inverse width power, and verify the least intersecting exponent. The target must lie in the subgroup generated by the normalized nonzero base. Inputs remain whole numbers inside the displayed domain, and the page never rounds a decimal into an accepted integer. This keeps the reported result tied to one explicit mathematical definition rather than an unstated convention.

A missing solution means the target is outside the subgroup generated by the supplied base, not that the prime modulus is invalid. Raise the base to the displayed exponent with the existing modular-power tool and compare residues. Reuse the displayed recurrence, congruence, or counting identity with the same inputs. The verification evidence checks this calculator's result, but it does not establish assumptions or conclusions outside the stated mathematical domain.

The modulus cap bounds memory and square-root search work; this educational solver is unsuitable for attacking cryptographic keys. The search intentionally cannot be used for production-size cryptographic groups. A finite limit prevents browser stalls and avoids presenting an unsafe floating-point integer as exact. Work beyond that limit belongs in arbitrary-precision software with explicit resource controls and independent validation.