Abstract
# Fractal Geometric Analysis of the Goldbach Comet via the Fractal Correction Engine **Authors:** Adam L McEvoy **Date:** March 21, 2026 **Keywords:** Goldbach conjecture, fractal dimension, Hardy-Littlewood, prime pairs, number theory, spectral analysis, curvature, golden ratio, Hurst exponent --- ## Abstract I present the first fractal geometric analysis of the Goldbach comet --- the scatter plot of Goldbach pair counts $g(n)$ for even integers $n$ --- using the Fractal Correction Engine (FCE), a computational framework based on $\pi$-normalized curvature, multi-scale Gaussian decomposition, and Riemann zeta-inspired weighting. Applied to all even integers in $[4, 100{,}000]$, we characterize the comet's fractal structure (Higuchi $D_H = 2.0000$, box-counting $D_{BC} = 1.6614$), establish its near-random temporal dynamics (Hurst $H = 0.5236$), and identify statistically significant golden ratio dominance in prime pair spacings ($\varphi$-correlation $= 0.5396$, $p = 0.002$). We construct an enhanced ensemble predictor that achieves a mean absolute error (MAE) of 32.82, outperforming the classical Hardy-Littlewood asymptotic formula (MAE $= 158.84$) by a factor of $4.84\times$. The dominant prediction strategy exploits modular arithmetic structure ($n \bmod 6$), capturing multiplicative patterns invisible to the continuous Hardy-Littlewood approximation. Spectral analysis reveals a dominant period of 3 (reflecting the mod-6 structure) and near-zero correlation with Riemann zeta zeros at this scale. We do not claim to prove the Goldbach conjecture; rather, we demonstrate that the Goldbach comet possesses rich, predictable internal structure beyond what classical analytic number theory captures. --- ## 1. Introduction ### 1.1 The Goldbach Conjecture The Goldbach conjecture (1742) states that every even integer $n > 2$ can be expressed as the sum of two prime numbers. Despite nearly three centuries of effort, this remains one of the oldest unsolved problems in mathematics. The strongest partial result is Chen's theorem (1966), which proves every sufficiently large even integer is the sum of a prime and a semiprime. Computational verification has confirmed the conjecture up to $4 \times 10^{18}$ (Oliveira e Silva et al., 2014). For each even $n$, we define the Goldbach function: $$g(n) = \#\{(p, q) : p + q = n,\; p \leq q,\; p, q \text{ prime}\}$$ The plot of $(n, g(n))$ for even $n$ produces a distinctive scatter pattern known as the **Goldbach comet** --- a structured cloud whose density increases with $n$ in a manner governed by prime distribution. ### 1.2 The Hardy-Littlewood Prediction Hardy and Littlewood (1923) conjectured an asymptotic formula for $g(n)$ based on the circle method: $$g(n) \sim C_2 \cdot S(n) \cdot \frac{n}{\ln^2 n}$$ where $C_2 \approx 0.6602$ is the twin prime constant: $$C_2 = 2 \prod_{p > 2} \left(1 - \frac{1}{(p-1)^2}\right) \approx 0.6601618158$$ and $S(n)$ is the singular series: $$S(n) = \prod_{\substack{p \mid n \\ p > 2}} \frac{p - 1}{p - 2}$$ This formula provides a smooth approximation to the comet's overall trend but fails to capture its fine arithmetic structure, particularly the systematic residuals that depend on the modular properties of $n$. ### 1.3 Motivation While the Hardy-Littlewood formula captures the leading-order behavior of $g(n)$, the residuals $r(n) = g(n) - \text{HL}(n)$ display rich structure that has not been systematically characterized using modern tools from fractal geometry and signal processing. This work asks: 1. What is the fractal dimension of the Goldbach comet?2. Does $g(n)$ exhibit long-range dependence or memory?3. Can fractal-geometric methods predict $g(n)$ more accurately than Hardy-Littlewood?4. What spectral structure underlies the comet? I address these questions using the Fractal Correction Engine (FCE), a computational framework originally developed for trajectory analysis in dynamical systems. This paper constitutes the third in a trilogy connecting Riemann zeta structure, computational complexity, and additive prime theory through the FCE framework. --- ## 2. The Fractal Correction Engine (FCE) ### 2.1 Overview The Fractal Correction Engine is a signal analysis and prediction framework that operates on discrete sequences through three core mechanisms: 1. **$\pi$-normalized curvature analysis** --- measuring local geometric complexity relative to a canonical semicircular arc2. **Multi-scale Gaussian decomposition** --- separating structure at $\pi$-scaled resolution levels3. **Zeta-weighted correction** --- combining detail levels with Riemann zeta-inspired weights The FCE treats any discrete sequence $f(x_1), f(x_2), \ldots, f(x_N)$ as a geometric trajectory and applies differential-geometric tools to characterize and predict its behavior. ### 2.2 Discrete Curvature For a discrete sequence $f$, the curvature at point $i$ is computed via finite differences: $$\kappa(i) = \frac{|f''(i)|}{(1 + (f'(i))^2)^{3/2}}$$ where $f'(i)$ and $f''(i)$ are the first and second discrete derivatives computed via `numpy.gradient` (central differences). The denominator normalizes for slope, ensuring curvature measures intrinsic bending rather than steepness. ### 2.3 $\pi$-Normalized Curvature The curvature is normalized by $\pi$ to produce a dimensionless measure: $$\kappa_{\text{norm}}(i) = \frac{\kappa(i)}{\pi}$$ This normalization has geometric meaning:- $\kappa_{\text{norm}} = 1$: the trajectory bends as tightly as a semicircular arc- $\kappa_{\text{norm}} \to 0$: the trajectory is locally straight- $\kappa_{\text{norm}} > 1$: the trajectory bends more sharply than a semicircle The radius of curvature is the reciprocal: $$r(i) = \frac{1}{\kappa(i) + \epsilon}$$ where $\epsilon = 10^{-30}$ prevents division by zero. To avoid numerical overflow when $\kappa \to 0$ (near-straight segments), the radius is clamped: $$r(i) = \min\left(\frac{1}{\kappa(i) + \epsilon},\; N\right)$$ where $N$ is the sequence length. ### 2.4 Multi-Scale Gaussian Decomposition The FCE decomposes the input sequence at $\pi$-scaled resolution levels using Gaussian convolution. For $n_s$ scales (default $n_s = 5$), the smoothing widths are: $$\sigma_k = \pi \cdot 2^k, \quad k = 0, 1, \ldots, n_s - 1$$ At each scale, the sequence is convolved with a normalized Gaussian kernel: $$G_{\sigma}(x) = \frac{1}{\sqrt{2\pi}\,\sigma} \exp\!\left(-\frac{x^2}{2\sigma^2}\right)$$ The smoothed versions are $S_k = G_{\sigma_k} * f$, and the detail levels capture the structure between consecutive scales: $$D_k = S_{k-1} - S_k, \quad k = 1, \ldots, n_s - 1$$ with $S_0 = f$ (the original sequence). Each $D_k$ isolates oscillatory structure at spatial frequencies corresponding to the scale $\sigma_k$. ### 2.5 The FCE Correction Formula The core FCE correction combines curvature, multi-scale details, and Riemann zeta-inspired weighting: $$f_{\text{corrected}}(i) = f(i) + \alpha \cdot \pi \cdot r(i) \cdot \sum_{k=1}^{n_s} \frac{D_k(i)}{k^{3/2}}$$ where:- $\alpha = 0.01$ is the correction strength- $\pi$ is the normalization constant- $r(i)$ is the clamped radius of curvature- $D_k(i)$ is the $k$-th detail level at point $i$- $k^{-3/2}$ provides zeta-inspired weighting (cf. $\zeta(3/2) = \sum k^{-3/2}$), giving more weight to finer scales The correction is larger where the sequence is locally straight ($r$ large) and rich in multi-scale detail ($D_k$ large), and smaller where the sequence already curves sharply ($r$ small). ### 2.6 Fractal Path Extraction The FCE extracts a "fractal path" from an observed sequence through iterative refinement: $$\hat{f}^{(0)} = \text{FCE}(f)$$ $$\hat{f}^{(t+1)} = \hat{f}^{(t)} + \frac{1}{2}\,\text{FCE}\!\left(f - \hat{f}^{(t)}\right), \quad t = 0, 1, 2$$ After 3 iterations, the path match is evaluated via:- **Pearson correlation** $\rho(\hat{f}, f)$: measures shape similarity- **Hausdorff-like distance** $d_H = \max|f - \hat{f}| / \text{std}(f)$: measures maximum deviation ### 2.7 Configuration Parameters The FCE is governed by the following parameters: | Parameter | Symbol | Default | Description ||-----------|--------|---------|-------------|| Correction strength | $\alpha$ | 0.01 | Amplitude of correction term || Decay timescale | $\tau$ | 50.0 | Exponential decay in extrapolation || Oscillation frequency | $\omega$ | 0.1 | Frequency for oscillatory predictions || Number of scales | $n_s$ | 5 | Multi-scale decomposition depth || Prediction horizon | $H_p$ | 500 | Forward prediction range || Higuchi max lag | $k_{\max}$ | 200 | Maximum lag for Higuchi FD | --- ## 3. Methods ### 3.1 Computational Pipeline The analysis follows a 7-stage pipeline executed with parallelism across $\lfloor C/2 \rfloor$ workers, where $C$ is the number of CPU cores: 1. **Prime Sieve** --- Sieve of Eratosthenes up to $n_{\max}$2. **Goldbach Comet Computation** --- parallel enumeration of $g(n)$ for all even $n \in [4, n_{\max}]$3. **FCE Fractal Analysis** --- curvature, fractal dimensions, predictions, waveform decomposition4. **Spectral Analysis** --- FFT, Lomb-Scargle, power-law fitting, zeta-zero correlation5. **Statistical Validation** --- bootstrap CIs, permutation tests, OEIS verification6. **Visualization** --- 16 diagnostic plots7. **Report Generation** --- JSON and text summaries System health is monitored continuously via CPU temperature and memory pressure sensors, with automatic worker throttling above 85$^\circ$C and dynamic reduction of bootstrap/permutation counts above 85% memory usage. ### 3.2 Goldbach Pair Counting For each even $n$, pairs are counted by testing all primes $p \leq n/2$: $$g(n) = \sum_{\substack{p \leq n/2 \\ p \text{ prime}}} \mathbb{1}[n - p \text{ is prime}]$$ where $\mathbb{1}[\cdot]$ is the indicator function. Prime testing uses $O(1)$ lookup via a boolean sieve array. The computation is parallelized by distributing chunks of even numbers across workers. The Hardy-Littlewood predi