Empirical Verification of Goldbach Conjecture Beyond 4×10^18 Using Amanollahi Methodology

This dataset and accompanying code provide an empirical verification of the Goldbach Conjecture beyond the Oliveira e Silva record (4 × 10^18). Using the Amanollahi Methodology, a memory-efficient center-out deterministic search combined with 64-bit Miller-Rabin primality testing, we verified one million consecutive even integers beyond 4 × 10^18. The dataset includes each verified even number and its corresponding Goldbach partition. All computations were performed on standard hardware (Google Colab; 2 CPU cores, ~2 GB RAM). This work demonstrates that large-scale verification of isolated regions of the Goldbach domain is feasible without high-performance computing clusters. The source code and dataset are provided for reproducibility and further exploration in computational number theory.