Lucas Prime Criterion: Verification Code and Data

Read full text
Authors: D. J. Schwartzkopff
Cited by: 0

Abstract

Supplementary code and data for the paper "The Lucas Prime Criterion: A Deterministic Test for Primality of Lucas Numbers". This repository contains Python and CUDA implementations for verifying the criterion, along with pre-computed verification results for primes p < 100,000. The criterion enables verification that L_5466311 (1,142,281 digits) is prime in 14.31 GPU-hours.

Fields of Study & Subjects

Analytic Number Theory Research Cryptography and Residue Arithmetic Advanced Mathematical Theories and Applications

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
29 January 2026