Published October 16, 2026 | Version v1

The Current Strongest Candidate Proof Chain for Binary Goldbach: Exact FEEL Reassembly, Signed Nonzero-Frequency Routing, Zero-Mode Reduction, Rough-Prime Switching, and the Residual Truncated Titchmarsh Correlation

  • 1. ROR icon Philipps University of Marburg
  • 2. ROR icon Justus-Liebig-Universität Gießen

Description

We give a stand-alone account of the current strongest PIHR–Goldbach candidate proof chain for the binary Goldbach conjecture after the Final End-to-End Identity and Error Ledger (FEEL) audit of Gold-38. The purpose of the present paper is not to announce an unconditional proof. Rather, we identify which parts of the candidate architecture can be reduced to exact identities or to published analytic estimates, correct several bookkeeping ambiguities exposed by the FEEL audit, and isolate the narrowest surviving analytic interface.

Files

Gold-39.pdf

Files (498.6 kB)

Name Size
md5:51ac8846813083cf0b69e6d06a88f6d2
498.6 kB Preview Download