Skip to content
DraconiticResearch
Search Sources API
203,952 studies31 sourcesUpdated 49 min ago
PreprintCC BY 4.0Zenodo

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

  • Borros Arneth1
  1. 1Philipps University of Marburg
Open at sourcePDFDOICite

Abstract

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.

Related

  1. A Candidate Proof Architecture for Binary Goldbach: Quartic Sieve Reassembly, the Liouville Parity Obstruction, Quantitative Dual Reserve, and the Remaining Signed Prime-Correlation Theorem
    Borros Arneth
    ZenodoPreprintCC BY 4.0Full textZenodo
  2. A Candidate Proof Architecture for Binary Goldbach: Signed Möbius–Prime Correlations, Quartic Sieve Reassembly, Balanced Type-II Dispersion, and the Remaining Parity-Separation Theorem
    Borros Arneth
    ZenodoPreprintCC BY 4.0Full textZenodo
  3. Fine mapping of yll prioritizes aberrantly spliced Glyma.10G090700 (GmPAO7) as the strongest candidate in a soybean yellow-leaf lethal mutant
    Lei Chen, Jinwei Feng, Jie Ning +14
    BMC Plant BiologyPeer-reviewedCC BY 4.0Full textPlant biologyPMC
  4. New Bounds on the Aperiodic Hamming Correlation of Wide-Gap Frequency-Hopping Sequence Sets
    Entropy (Basel, Switzerland)Peer-reviewedCC BYFull textEurope PMC
  5. Determining low-ℓ p-mode frequency shifts in Sun-like stars: Enhancing the cross-correlation technique with filters
    Samarth G. Kashyap, Laurent Gizon, Jesper Schou +1
    arXivPreprintCC BY 4.0Full textSolar & stellar physicsComputational physicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{arneth2026current,
  title = {{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}},
  author = {Borros Arneth},
  howpublished = {Zenodo},
  year = {2026},
  month = oct,
  doi = {10.5281/zenodo.23413272},
  url = {https://zenodo.org/records/23413272},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - 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
AU  - Borros Arneth
PY  - 2026
DA  - 2026/10/16
PB  - Zenodo
DO  - 10.5281/zenodo.23413272
UR  - https://zenodo.org/records/23413272
AB  - 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.
ER  -