I’ve produced a short and much elementary proof of P=NP (without an efficient algorithm presented). I sent it to a reputable CS journal and insofar there were no errors noticed by the editor.
Here is an updated version of my proof with some errors corrected:
In more details (and some errors corrected):
Yet a small error corrected:
Changed execution model to have “disk” to verify input/output:
Yet error corrected:
Report if you found any errors in comments.
I also sent it to developers of automatic proof verification softwares.