<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: tfpgh</title><link>https://news.ycombinator.com/user?id=tfpgh</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 27 Oct 2026 14:39:43 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=tfpgh" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by tfpgh in "The Exponential Time Hypothesis Is False [pdf]"]]></title><description><![CDATA[
<p>This isn't quite true, problems in NP can still require exponential time to solve.<p>Solving an arbitrary NP problem looks like first reducing that problem to SAT and then solving the equivalent SAT problem. We know (via the Cook–Levin theorem) that any NP problem can be reduced to SAT in polynomial time, and we now know that solving SAT is subexponential in terms of the size of the SAT problem, but it's possible for the conversion to SAT to grow the problem enough that it's exponential in terms of the original problem.</p>
]]></description><pubDate>Tue, 27 Oct 2026 00:32:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=50253213</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=50253213</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50253213</guid></item><item><title><![CDATA[New comment by tfpgh in "Libre Barcode Project"]]></title><description><![CDATA[
<p>This is amazing!</p>
]]></description><pubDate>Fri, 26 Jun 2026 20:48:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=48691790</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=48691790</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48691790</guid></item><item><title><![CDATA[An interactive map of all of English Wikipedia]]></title><description><![CDATA[
<p>Article URL: <a href="https://tobypenner.com/wikigraph/">https://tobypenner.com/wikigraph/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48382861">https://news.ycombinator.com/item?id=48382861</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 03 Jun 2026 12:01:58 +0000</pubDate><link>https://tobypenner.com/wikigraph/</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=48382861</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48382861</guid></item><item><title><![CDATA[New comment by tfpgh in "Show HN: Wikigraph – an interactive visualization of all of English Wikipedia"]]></title><description><![CDATA[
<p>It's a choice. The layout isn't PCA, it's a force-directed embedding (ForceAtlas2). This acts directly on the directed graph of pages and their links, I think you would need some other representation to do PCA.<p>You could likely run ForceAtlas2 in 3D or higher and get better clustering fidelity, but that obviously makes visualization harder.</p>
]]></description><pubDate>Tue, 02 Jun 2026 22:20:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=48377125</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=48377125</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48377125</guid></item><item><title><![CDATA[Show HN: Wikigraph – an interactive visualization of all of English Wikipedia]]></title><description><![CDATA[
<p>Hi! This is a visualization I've always wanted but never quite found. It's a navigable map of the Wikipedia link graph structure, with search and shortest-path finding.<p>Offline, I parsed the May 2026 English Wikipedia full-text dump into a directed graph, used cuGraph on a GPU to run PageRank, Leiden clustering, and ForceAtlas2 for the layout. I did some post processing to get rid of lingering overlapping nodes and rendered a tiled map of raster base images (using Skia) and JSON metadata. Tiles are bundled into PMTiles. The frontend is Deck.gl.<p>Everything is hosted on Cloudflare. Search and shortest-path are served by a Rust backend in CF Containers which uses Tantivy and bidirectional BFS.<p>Happy to answer any questions!</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48370512">https://news.ycombinator.com/item?id=48370512</a></p>
<p>Points: 12</p>
<p># Comments: 2</p>
]]></description><pubDate>Tue, 02 Jun 2026 14:11:36 +0000</pubDate><link>https://tobypenner.com/wikigraph/</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=48370512</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48370512</guid></item><item><title><![CDATA[Tag, You're It [video]]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.youtube.com/watch?v=83YcsIVBEEk">https://www.youtube.com/watch?v=83YcsIVBEEk</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48027143">https://news.ycombinator.com/item?id=48027143</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 05 May 2026 19:13:22 +0000</pubDate><link>https://www.youtube.com/watch?v=83YcsIVBEEk</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=48027143</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48027143</guid></item><item><title><![CDATA[AI 2027 (2025)]]></title><description><![CDATA[
<p>Article URL: <a href="https://ai-2027.com/?">https://ai-2027.com/?</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47723661">https://news.ycombinator.com/item?id=47723661</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 10 Apr 2026 21:05:31 +0000</pubDate><link>https://ai-2027.com/?</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=47723661</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47723661</guid></item><item><title><![CDATA[Project Encore–repurpose existing medicines to treat genetic diseases]]></title><description><![CDATA[
<p>Article URL: <a href="https://docs.google.com/document/d/1dMJkuOlEPWhkpeVIbNBeo99mHNWHcRqwLHfu1KmAAX8/preview">https://docs.google.com/document/d/1dMJkuOlEPWhkpeVIbNBeo99mHNWHcRqwLHfu1KmAAX8/preview</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44800899">https://news.ycombinator.com/item?id=44800899</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 05 Aug 2025 17:11:24 +0000</pubDate><link>https://docs.google.com/document/d/1dMJkuOlEPWhkpeVIbNBeo99mHNWHcRqwLHfu1KmAAX8/preview</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=44800899</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44800899</guid></item><item><title><![CDATA[New comment by tfpgh in "I Used Arch, BTW: macOS, Day 1"]]></title><description><![CDATA[
<p>A few days of work doesn't matter over years.</p>
]]></description><pubDate>Sun, 20 Jul 2025 02:19:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=44621377</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=44621377</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44621377</guid></item><item><title><![CDATA[New comment by tfpgh in "I Used Arch, BTW: macOS, Day 1"]]></title><description><![CDATA[
<p>Did you actually read the article? Multiple times, they talk about how they're just trying to find a smooth, comfortable workflow and don't need every detail perfect (at least initially).</p>
]]></description><pubDate>Sun, 20 Jul 2025 02:14:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=44621345</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=44621345</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44621345</guid></item><item><title><![CDATA[Cats Confuse Reasoning LLM – Adversarial Triggers for Reasoning Models]]></title><description><![CDATA[
<p>Article URL: <a href="https://arxiv.org/abs/2503.01781">https://arxiv.org/abs/2503.01781</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44500428">https://news.ycombinator.com/item?id=44500428</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 08 Jul 2025 14:40:34 +0000</pubDate><link>https://arxiv.org/abs/2503.01781</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=44500428</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44500428</guid></item><item><title><![CDATA[Justice41 – Rehosting the screening tool Trump took down]]></title><description><![CDATA[
<p>Article URL: <a href="https://justice41.org/en/">https://justice41.org/en/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43825749">https://news.ycombinator.com/item?id=43825749</a></p>
<p>Points: 11</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 28 Apr 2025 20:28:58 +0000</pubDate><link>https://justice41.org/en/</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=43825749</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43825749</guid></item><item><title><![CDATA[Graphing Polar Equations in ASCII]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/tfpgh/polar_ascii">https://github.com/tfpgh/polar_ascii</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=40140119">https://news.ycombinator.com/item?id=40140119</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 24 Apr 2024 03:17:34 +0000</pubDate><link>https://github.com/tfpgh/polar_ascii</link><dc:creator>tfpgh</dc:creator><comments>https://news.ycombinator.com/item?id=40140119</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40140119</guid></item></channel></rss>