https://hackerpaper.kaipfister.de/p/1907.03858/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=29916382urn:hackerpapers:mention:1907.03858:29916382Thu, 13 Jan 2022 03:15:04 GMT<p>The author claims to have a proof that NP = coNP = PSPACE along the following lines: first they describe their favorite axiomatic logical system, then they claim to have a method to compress quasipolynomial-sized proofs in this system to polynomial-sized proofs. If their claimed proof worked, it would be a breakthrough the likes of which math has never seen before - NP = coNP means that every easily stated puzzle with no solution has a short proof of unsolvability (NP = coNP is widely believed to be false). Looking at some of the previous papers (such as [1]) building towards the proof (which…</p><p><a href="https://hackerpaper.kaipfister.de/p/1907.03858/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LOhttps://news.ycombinator.com/item?id=20546155urn:hackerpapers:submission:1907.03858:20546155Sun, 28 Jul 2019 06:32:46 GMT<p>Proof Compression and NP versus Pspace. Part 2</p><p></p><p>1 point; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1907.03858/">Paper and source history</a>. A submission is not an endorsement.</p>cs.LO