The Jacobi Sum Primality Test

Executive summary

Almost polynomial, and for decades the only general proving method

The Jacobi sum test generalises Fermat's test to characters of higher order. Working in cyclotomic extensions of ℤ/nℤ, it verifies congruences involving Jacobi sums that must hold when n is prime. Passing them constrains the residue of n modulo a large auxiliary integer to a small set, and a final trial division stage eliminates the remaining candidates. The running time is (log n)^{O(log log log n)} — not polynomial, but the triple logarithm makes it behave as though it were.

Learning objectives

Explain the role of the auxiliary integers s and t.
Describe how characters of order q generalise the Fermat test.
Outline the structure of the basic test and the final stage.
Compare the Jacobi sum test with ECPP on cost and certification.

Section 01The construction

Choose a squarefree t whose prime divisors q satisfy: q − 1 divides t. Set s to be the product of all such primes q. The key requirement is

s² > n

which is achievable with t remarkably small — the highly composite structure means s grows very rapidly with t. That disparity is the source of the near-polynomial running time.

Why s can be so large for small t

The primes q with q − 1 dividing a highly composite t are numerous, and their product s grows super-exponentially in t. A t of a few thousand yields an s with hundreds of digits, so the number of conditions to check grows only slowly as n grows.

Section 02Characters and the basic test

For a prime power q^k dividing t, work in the cyclotomic ring ℤ[ζ_q^k] reduced modulo n. Characters of order q^k and their Jacobi sums satisfy congruences that follow from n being prime.

Stage 01Set upChoose t and s with s² > n; verify gcd(n, st) = 1.
Stage 02Test each pairFor each prime power dividing t and each prime dividing s, verify the Jacobi sum congruence in the appropriate cyclotomic extension.
Stage 03Extract the conditionPassing tests establish that every prime factor of n is congruent to a power of n modulo s.
Stage 04Final stageTest the candidate residues nⁱ mod s for i = 1, …, t−1; if none divides n, then n is prime.

The final stage is a genuine trial division

After all the cyclotomic machinery, the conclusion rests on checking at most t − 1 candidate divisors. That stage is elementary, cheap, and is what converts the accumulated congruence conditions into a proof.

Section 03Comparison with ECPP

Jacobi sum test versus elliptic curve proving
Aspect	Jacobi sum (APR-CL)	ECPP
Running time	(log n)^{O(log log log n)}, deterministic in practice	Heuristically O(log^4+ε n), randomised
Certificate	None short — the proof is the computation	Short and independently verifiable
Implementation	Intricate cyclotomic arithmetic, but a fixed procedure	Requires CM curve construction and point counting
Sweet spot	A few hundred to a few thousand digits, where it is often fastest	Large numbers, and anywhere a certificate is required
Failure mode	Runs to completion	May need to retry with different curves

No certificate is a real limitation

A Jacobi sum proof cannot be handed to a third party for cheap verification — re-running the whole computation is the only check. Where a result must be independently verifiable, ECPP is the appropriate choice even when it is slower.

ReferenceFrequently asked questions

Why is the running time not polynomial?

Because the number of auxiliary primes, and hence the number of conditions to verify, grows slightly faster than any fixed power of log n. The growth involves a triple logarithm, which for any conceivable input behaves like a constant — so the distinction is theoretical rather than practical.

Is the test deterministic?

The core is deterministic. Some implementations randomise the search for suitable characters to improve speed, but the conclusion does not depend on chance, and the test always terminates with a definite answer.

Why did the Cohen-Lenstra refinement matter?

The original APR formulation was theoretically important but impractical. The reformulation using Jacobi sums rather than Gauss sums reduced the arithmetic to manageable size and made the test implementable — which is what turned a theoretical advance into the standard proving method for over a decade.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review The Jacobi Sum Primality Test. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat The Jacobi Sum Primality Test as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—test, jacobi, section, primality, characters—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying The Jacobi Sum Primality Test?