2026-10-15T18:04:21Z https://data.mendeley.com/oai

oai:data.mendeley.com/kjxmg7x9cx.2 2026-10-02T11:42:06Z

Rangan, Raghunaathan Reproducibility Package for Prime-Offset Certificates for Compositeness: Factor-Sensitive Bounds, Product-Set Collisions, and Finite Audit Mendeley Data This dataset is the reproducibility package accompanying the manuscript “Prime-Offset Certificates for Compositeness: Factor-Sensitive Bounds, Product-Set Collisions, and Finite Audit.” It reproduces the finite computer-assisted census of every composite integer N with 4 ≤ N ≤ 1,000,000, comprising 921,501 composite inputs, together with an independently rechecked large-scale stress example. The package contains two independent exact-integer C++17 implementations: a factor-bucket audit and a direct-gcd audit. Both implementations produce byte-identical per-composite depth ledgers, no unresolved cases, maximum certificate depth 11, and the same eight depth-11 maximisers. The package also contains derived frequency and record tables, a deterministic 10,000-row auxiliary sample, verification scripts, the stress-example verifier, machine-readable metadata, build and execution instructions, and SHA-256 checksums. The finite computations are logically independent of the asymptotic theorems in the accompanying manuscript. Package version 1.1, 2 October 2026. Mathematics Computational Mathematics Number Theory Dataset doi:10.17632/kjxmg7x9cx.2 oai:data.mendeley.com/kjxmg7x9cx.2 Creative Commons Attribution 4.0 International http://creativecommons.org/licenses/by/4.0 https://data.mendeley.com/datasets/kjxmg7x9cx 2026-10-02T11:42:06Z