The great trinomial hunt

Paul Zimmermann; Richard P. Brent

The great trinomial hunt

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1005.1967 v1 pith:6MZPY4XP submitted 2010-05-11 math.NT cs.DM

Richard P. Brent , Paul Zimmermann This is my paper · ORCID

classification math.NTcs.DM

keywords mersennesearchdegreegreatprimetrinomialscompletecurrently

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We describe a search for primitive trinomials of high degree and its interaction with the Great Internet Mersenne prime search (GIMPS). The search is complete for trinomials whose degree is the exponent of a Mersenne prime, for all 47 currently known Mersenne primes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

An efficient construction of Raz's two-source randomness extractor with improved parameters
cs.CR 2025-06 conditional novelty 7.0 of 10

A quasi-linear-time version of Raz's two-source extractor with reduced entropy requirements, quantum-proof variants, and an open-source implementation.

Pith tools