Data and Code Supplement for: The Quaternary Reinterpretation Heuristic (Quad2Dec) for Generating Strong Prime Candidates

This repository contains the complete replication data, computational source code, and preprint manuscript for the "Quaternary Reinterpretation Heuristic (Quad2Dec)" prime candidate generation framework. ### AbstractThe Quad2Dec heuristic projects a known prime p to base 4, then deterministically reinterprets the resulting literal digit string as a base-10 integer n. While structurally simple, this mapping algebraically guarantees that all generated candidates for p > 5 are inherently coprime to 30, effortlessly filtering out multiples of 2, 3, and 5 with zero computational overhead. Empirical analysis tracking the first 1,000,000 primes demonstrates a persistent, bounded performance advantage ranging from 2.55x to 2.97x over the random baseline density predicted by the Prime Number Theorem (PNT). ### Repository Contents1. **Manuscript (PDF):** The complete compiled LaTeX article detailing the mathematical proofs, algorithmic implementations, and empirical analysis.2. **Dataset (XLSX):** Comprehensive binned interval density data tracking candidate success frequencies across 10 independent macro-blocks up to the 1,000,000th prime threshold.3. **Source Code (PY):** Python pipeline containing the base-conversion functions, verification filters, and benchmarking automation loops. ### Data UseThis bundle is provided openly to assist computational number theorists, cryptographers, and algebraic researchers seeking to evaluate, extend, or benchmark deterministic digit-bias mappings in prime-generation environments.