Reproducible Wilson-Quotient Computation with Progression Doubling and Reduced Factorials.

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24417040
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Reproducible Wilson-Quotient Computation with Progression Doubling and Reduced Factorials.

Marco Gericke
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Reproducible Wilson-Quotient Computation with Progression Doubling and Reduced Factorials.

Marco Gericke
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon