Sergey Zheleznov
Independent researcher in number theory

Sergey Zheleznov is an independent researcher working on the binary Goldbach conjecture — the assertion that every even integer greater than two can be written as a sum of two primes. Outside mathematics, he has spent 26 years in the internet business and currently works in AI and software development.
Contact: sergey@zheleznov.com · ORCID: 0009-0004-7730-9492
About this site
This site publishes part of an ongoing research program on the binary Goldbach conjecture. The material includes partial results with explicit status labels, a Lean 4 formalization of selected statements, an analysis of the parity barrier, numerical experiments, and draft manuscripts.
Every claim on this site carries an explicit status label. The labels are:
TheoremCorollary of sourcesConditional resultConjectureEmpirical observationOpen problemRefuted
The Goldbach conjecture is not proved — neither here nor anywhere else. Nothing on this site should be read as a claimed proof.
Research
The long-term goal of the program is an unconditional proof of the conjecture: that for every even integer there exist primes with . The central obstruction is the parity barrier for representations of a fixed even integer — the boundary beyond which known sieve methods do not pass. The partial results published here include a source-derived Proposition Corollary of sources, obtained as a corollary of published work, and a theorem proved under the Siegel zero hypothesis Conditional result.
The program, its results, and its open problems are described on the research page.
Publications
Three draft manuscripts arising from the program — working texts that have not been peer reviewed — are available on the publications page.