Dor_Elbaz
Joined 1 year ago
Joined 1 year ago
It’s currently being submitted to the ECCC and arXiv for formal review. I’ve also reached out to a few experts (including Scott Aaronson) and am actively seeking feedback.
I’d be thrilled to hear any comments or critiques you might have — peer review begins with open dialogue. Thanks for asking.
The model assumes infinite parallelism and zero overhead, isolating only the total amount of “logical work” an algorithm must perform. Even in this idealized setting, I prove that for all sufficiently large n, any correct algorithm solving SAT must perform Ω(2ⁿ) total work. Then, using a simulation lemma, I show that this lower bound implies SAT ∉ P, and therefore P ≠ NP.
The argument avoids known barriers like relativization, natural proofs, and algebrization. It’s formal, self-contained, and includes two appendices: one for cross-validation against known results, and one FAQ addressing common objections.
Here is Version 3 of the paper, incorporating all revisions and reviewer feedback so far: https://zenodo.org/records/15263845
I’d be thrilled to hear what you think — and grateful for any feedback, critiques, or questions.
— Dor Elbaz
Instead, I’ve focused on making the argument as rigorous and transparent as possible, including formal proofs, a detailed appendix cross-validating the claims, and a public release for community scrutiny. I’m actively reaching out to experts in the field and submitting the work to appropriate venues.
If it becomes necessary to route through institutional channels — for example, to access formal peer review or academic endorsement — I’ll consider that step as well. For now, I’m hoping the merit of the argument will invite critical engagement on its own.