Published January 29, 2026
| Version v1
Software
Open
Lucas Prime Criterion: Verification Code and Data
Description
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.
Notes
Extended verification to p < 150,000 (13,803 primes) confirmed zero counterexamples. Detailed per-prime results for p < 100,000 are included in verification_results_100k.csv.
Files
DATA_NOTE.txt
Files
(424.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d86cb956448e173e31437c6d6fa520bf
|
780 Bytes | Preview Download |
|
md5:50e952dfcbd947c91bc933260b3ef2d1
|
1.1 kB | Download |
|
md5:f07ea59b8946919d375e3c0a88112f6c
|
43.2 kB | Download |
|
md5:eae799896d91c1ef2cdce683c96b624d
|
2.7 kB | Preview Download |
|
md5:9895c1c80e0543b1dbddfd53c330f347
|
357.4 kB | Preview Download |
|
md5:506e3bb6566eb0db158144d176ef266f
|
9.2 kB | Download |
|
md5:3ba31093f18925ef8baca98f595c7939
|
10.4 kB | Download |
Additional details
Related works
- Is supplement to
- Journal article: 10.1080/10586458.2026.XXXXXXX (DOI)