What question did this study set out to answer?

The research aims to verify the Goldbach conjecture by examining even numbers and their decompositions into prime pairs.

February 2, 2026Open Access

Goldbach Conjecture via Universal Structure

Key Points

The research aims to verify the Goldbach conjecture by examining even numbers and their decompositions into prime pairs.
Utilized a verification scale to confirm evidence from 495,001 even numbers.
Analyzed distinct pairs of primes representing every even number within the range of 10,000 to 1,000,000.
Developed a database containing detailed records of findings, including pair types and primes.
Achieved a 100% pass rate for verified even numbers in the specified range.
Identified 92 minimum Goldbach pairs at n=10,000 and a maximum of 13,648 pairs at n=1,000,000.
Confirmed 42 distinct INDS pair types, indicating a rich diversity in prime representations.

Abstract

Key Evidence Verification Scale: 495, 001 / 495, 000 even numbers verified (range: 10, 000 to 1, 000, 000) — 100% pass rate. Minimum Pairs: Minimum Goldbach pairs found: 92 (at n=10, 000). No even number had fewer than 92 decompositions. Maximum Pairs: 13, 648 pairs at n 1, 000, 000. INDS Pair Types: 42 distinct pair types verified with thousands of occurrences each, covering all digital root classes. INDS-Dirichlet Threshold: N₀ = 152 — below which finite verification completes the proof. Grand Identity: D (1/2) + D (2/3) = D (1/3) = 2. 2830118286 (Verified exact to machine precision). 2. Database Contents Total: 2, 056 records across 9 tables (80 KB lightweight SQLite). Table Records Contents constants 6, , , , , LUCASTOTAL axioms 6 All 6 Universal Structure axioms — ALL VERIFIED lucas 12 L (1) =1 through L (12) =322, Total = 840 goldbach 1, 981 Sampled verification from 10, 000 to 1, 000, 000 indsₜypes 42 All 42 INDS digital root pair types phidensity 5 Phi-Density Theorem at 5 scales — ALL EXACT grandᵢdentity 1 D (1/2) + D (2/3) = D (1/3) — VERIFIED summary 6 Key metrics metadata 3 Build info 3. Document Updates File: IEEEGoldbachUniversalStructurefinal. pdf (6 pages, 300 KB) Section: Abstract Changes: Added INDS-Dirichlet Theorem, 495, 001 verified integers, minimum G (n) =92, and evidence database details. Section: Introduction Changes: Updated section numbering: Section VII: Analytical Tools Section VIII: Computational Validation Section: IV. 3 (Table 1) Changes: Replaced old estimates with exact database values. G (10K) =127 G (50K) =450. . . G (1M) =5, 402 (with bounds and ratios 1. 56 -- 1. 63) Section: VII. 3 (Theorem 8) Changes: INDS Covering updated: 42 types (previously 21), at least 4 per class. Proof references Table V. Section: VII. 5 (Theorem 10) Changes: INDS-Dirichlet: Tightened from 2 to 4 minimum types, lowering threshold from N₀=152 to N₀=48. Section: VIII (New) Changes: Full Computational Validation added. Evidence database description. Goldbach growth by range (Table III). INDS type distribution (Table IV). Consolidated summary (Table V). Section: Conclusion Changes: Added items 4-6: INDS-Dirichlet Theorem, evidence database, and a strengthened final statement. 4. Validation Summary Key data from the evidence database now included in the paper: 495, 001 even numbers verified, all with G (n) 92. Minimum pairs by range: 10K, 100K) 127 [100K, 500K) 808 [500K, 1M 3, 010 42 INDS types with ~55, 000 occurrences each, uniformly distributed. INDS-Dirichlet threshold lowered to N₀ = 48.

Goldbach Conjecture via Universal Structure

Key Points

Abstract

Cite This Study