<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Zig-Zag Numberlink is NP-Complete · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1410.5845/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Wed, 04 Nov 2026 05:35:47 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1410.5845/feed.xml" rel="self" type="application/rss+xml" /><item><title>Zig-Zag Numberlink is NP-Complete — mentioned by zzyzek</title><link>https://news.ycombinator.com/item?id=50360569</link><guid isPermaLink="false">urn:hackerpapers:mention:1410.5845:50360569</guid><pubDate>Wed, 04 Nov 2026 01:39:50 GMT</pubDate><description>&lt;p&gt;At the time I posted this submission, the proof was `sorry` and `axiom` free but had 154 `native_decide`s. The proof is enumeration heavy and so for efficiencies sake, the `native_decide`s were used to speed up proof compilation. Since the submission here, I&amp;#x27;ve had Claude remove the `native_decide`s and optimize the proof so that it now compiles with the three standard axioms only (`propext`, `Classical.choice` and `Quot.sound`). I&amp;#x27;ve also submitted it to the Palomar registry, which can be seen at: https://palomar-registry.org/entry?id=PALOMAR-2026-11-04-000002&amp;amp;version=1 GitHub repo can be…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1410.5845/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
