Reproducible Wilson-Quotient Computation with Progression Doubling and Reduced Factorials.
Year: 2026
Type: preprint
Abstract: We describe an implementation and benchmark study of Wilson-quotient computation using consecutive-value polynomial doubling and residue-dependent factorial reconstruction. The mathematical algorithms are established: the progression engine implements Bostan–Gaudry–Schost ideas, and the sixth-factorial route specialises a known cyclotomic reconstruction. We give the interpolation invariant, unit conditions over the non-field ring Z/p²Z, and precision requirements before division by p. Five archived matched cases show speed ratios of 2.63–4.75 against the implementation’s streamed baseline, with two or three repetitions per method. A separate sixth-factorial comparison uses a different baseline and is reported independently. During manuscript preparation, a full-integer reference using CPython rather than FLINT agreed for all 2,260 odd primes through 19,993, including 1,124 eligible sixth-factorial cases. The large-prime record remains the bounded 17-prime interval (20,000,000,000,000, 20,000,000,000,398], with no new Wilson prime reported. The contribution is a fully specified implementation study and auditable computational record, not a new asymptotic algorithm, a state-of-the-art performance claim or evidence for a physical prime lattice.
Author: Gericke, Marco
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7237344301
Cites:
Cited by:
Related to:
