<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: MJGrzymek</title><link>https://news.ycombinator.com/user?id=MJGrzymek</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 08 Apr 2026 04:49:28 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=MJGrzymek" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by MJGrzymek in "A Formal Proof of Complexity Bounds on Diophantine Equations"]]></title><description><![CDATA[
<p>I was just thinking about how it's an underrated open problem which pairs of (number of variables, degree) are undecidable for MRDP.<p>Correct me if I'm wrong but I think it's guaranteed to have a finite answer, as a list of the minimal undecidable pairs. You can even throw in maximum absolute value of coefficients, though if you limit all three things that's decidable by being finite.</p>
]]></description><pubDate>Sat, 24 May 2025 05:31:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=44078976</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=44078976</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44078976</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Show HN: MMORPG prototype inspired by World of Warcraft"]]></title><description><![CDATA[
<p>I get net::ERR_CERT_COMMON_NAME_INVALID on everwilds.io (chrome android)</p>
]]></description><pubDate>Mon, 12 May 2025 17:39:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=43965574</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43965574</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43965574</guid></item><item><title><![CDATA[New comment by MJGrzymek in "DeepSeek-Prover-V2"]]></title><description><![CDATA[
<p>That's surprising to learn.<p>I'm surprised those even use actual lean code instead of like raw type theory.</p>
]]></description><pubDate>Thu, 01 May 2025 01:25:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=43852732</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43852732</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43852732</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Ask HN: Will employers care less about math contests as AI gets better at them?"]]></title><description><![CDATA[
<p>They shouldn't - they never wanted people to solve these math problems on the job, they're using the ability to solve them as a proxy for other abilities, which will likely fall to AI later.</p>
]]></description><pubDate>Tue, 29 Apr 2025 15:01:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=43833615</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43833615</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43833615</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Programming languages should have a tree traversal primitive"]]></title><description><![CDATA[
<p>sticking to dfs, there is still a difference between pre-order/in-order/post-order</p>
]]></description><pubDate>Tue, 29 Apr 2025 12:33:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=43831734</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43831734</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43831734</guid></item><item><title><![CDATA[Reputation Is Lazily Evaluated]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.lesswrong.com/posts/EQJfdqSaMcJyR5k73/habryka-s-shortform-feed?commentId=rzB5wieXwqqtZ4piw">https://www.lesswrong.com/posts/EQJfdqSaMcJyR5k73/habryka-s-shortform-feed?commentId=rzB5wieXwqqtZ4piw</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43800995">https://news.ycombinator.com/item?id=43800995</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 26 Apr 2025 04:42:09 +0000</pubDate><link>https://www.lesswrong.com/posts/EQJfdqSaMcJyR5k73/habryka-s-shortform-feed?commentId=rzB5wieXwqqtZ4piw</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43800995</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43800995</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Are We AI Math Yet?"]]></title><description><![CDATA[
<p>The (self-posting) author here.<p>I follow some math professors, so I linked their relevant stuff, but I was surprised how little quality commentary I could find. Please link if I missed something.</p>
]]></description><pubDate>Sat, 26 Apr 2025 02:37:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=43800432</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43800432</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43800432</guid></item><item><title><![CDATA[Are We AI Math Yet?]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.areweaimathyet.com/">https://www.areweaimathyet.com/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43800419">https://news.ycombinator.com/item?id=43800419</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 26 Apr 2025 02:34:35 +0000</pubDate><link>https://www.areweaimathyet.com/</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43800419</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43800419</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Four Years of Jai (2024)"]]></title><description><![CDATA[
<p>Not sure about the implicit behavior. In C++, you can write a lot of code using vector and map that would require manual memory management in C. It's as if the heap wasn't there.<p>Feels like there is a beneficial property in there.</p>
]]></description><pubDate>Fri, 18 Apr 2025 16:30:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=43729593</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43729593</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43729593</guid></item><item><title><![CDATA[New comment by MJGrzymek in "OpenAI in Talks to Buy Windsurf for About $3B"]]></title><description><![CDATA[
<p>I don't get it, surely they can build it for less than $3B, and why would they need the Windsurf brand?</p>
]]></description><pubDate>Wed, 16 Apr 2025 19:14:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=43709245</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43709245</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43709245</guid></item><item><title><![CDATA[New comment by MJGrzymek in "JSX over the Wire"]]></title><description><![CDATA[
<p>Reading the linked article <a href="https://htmx.org/essays/how-did-rest-come-to-mean-the-opposite-of-rest/" rel="nofollow">https://htmx.org/essays/how-did-rest-come-to-mean-the-opposi...</a> , does this mean Next.js is the real REST?<p>I still can't get over how the "API" in "REST API" apparently originally meant "a website".</p>
]]></description><pubDate>Wed, 16 Apr 2025 12:33:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=43704601</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43704601</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43704601</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Show HN: I made a faster, mobile-friendly interface for Wiktionary"]]></title><description><![CDATA[
<p>I'm a potential user in the wiktionary frontend market cause I'm addicted to checking pronunciations but it seems the support is not great, for example searching "dog" there is no IPA.</p>
]]></description><pubDate>Sat, 12 Apr 2025 14:25:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=43664661</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43664661</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43664661</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Show HN: I made PeanoScript, an educational TypeScript-like theorem prover"]]></title><description><![CDATA[
<p>You can also see my post on reddit where I answer some questions <a href="https://www.reddit.com/r/ProgrammingLanguages/comments/1jfxjn3/i_made_peanoscript_a_typescriptlike_theorem_prover/" rel="nofollow">https://www.reddit.com/r/ProgrammingLanguages/comments/1jfxj...</a></p>
]]></description><pubDate>Sat, 22 Mar 2025 19:49:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=43448132</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43448132</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43448132</guid></item><item><title><![CDATA[Show HN: I made PeanoScript, an educational TypeScript-like theorem prover]]></title><description><![CDATA[
<p>Hi HN, I made this with the idea that many people are somewhat familiar with TypeScript and first-order logic, so combining them could be a nice introduction to automated theorem proving. My CS freshman logic class woefully lacked an interactive code environment<p>It's completely web-based so you can go ahead and try the interactive tutorial <a href="https://peanoscript.mjgrzymek.com/tutorial" rel="nofollow">https://peanoscript.mjgrzymek.com/tutorial</a> . Everything is explained on its own terms, so it should be readable if you just know programming.<p>If you already know this kind of stuff and want a tldr, there is also a reference <a href="https://peanoscript.mjgrzymek.com/reference" rel="nofollow">https://peanoscript.mjgrzymek.com/reference</a> and playground <a href="https://peanoscript.mjgrzymek.com/playground" rel="nofollow">https://peanoscript.mjgrzymek.com/playground</a><p>The code is out on GitHub <a href="https://github.com/mjgrzymek/PeanoScript" rel="nofollow">https://github.com/mjgrzymek/PeanoScript</a><p>Have fun!</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43445747">https://news.ycombinator.com/item?id=43445747</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 22 Mar 2025 14:15:57 +0000</pubDate><link>https://peanoscript.mjgrzymek.com/tutorial</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43445747</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43445747</guid></item><item><title><![CDATA[New comment by MJGrzymek in "NIST selects HQC as fifth algorithm for post-quantum encryption"]]></title><description><![CDATA[
<p>Isn't that trivial in a sense? Encrypt with layer 1, then use that encrypted channel to send layer 2 (and so on). Not sure about the performance.<p>Signal has a post about using pre and post-quantum together: <a href="https://signal.org/blog/pqxdh/" rel="nofollow">https://signal.org/blog/pqxdh/</a><p>> The essence of our protocol upgrade from X3DH to PQXDH is to compute a shared secret, data known only to the parties involved in a private communication session, using both the elliptic curve key agreement protocol X25519 and the post-quantum key encapsulation mechanism CRYSTALS-Kyber. We then combine these two shared secrets together so that any attacker must break both X25519 and CRYSTALS-Kyber to compute the same shared secret.</p>
]]></description><pubDate>Tue, 11 Mar 2025 18:51:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=43335791</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43335791</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43335791</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Vine: A programming language based on Interaction Nets"]]></title><description><![CDATA[
<p>This is something I never got through my annual rechecking of the interaction nets wiki page, cause isn't the lambda calculus also fundamentally parallel? Are nets even more?</p>
]]></description><pubDate>Sun, 23 Feb 2025 01:52:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=43145472</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43145472</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43145472</guid></item><item><title><![CDATA[New comment by MJGrzymek in "Parsing JSON in 500 lines of Rust"]]></title><description><![CDATA[
<p>I got log in page on first click but it went away after closing it and opening again.</p>
]]></description><pubDate>Wed, 19 Feb 2025 14:10:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=43102330</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=43102330</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43102330</guid></item><item><title><![CDATA[Pushing CSS:has() to its limits – highlightable parentheses, variable bindings]]></title><description><![CDATA[
<p>Article URL: <a href="https://blog.mjgrzymek.com/blog/css-has">https://blog.mjgrzymek.com/blog/css-has</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=40350183">https://news.ycombinator.com/item?id=40350183</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 14 May 2024 00:21:22 +0000</pubDate><link>https://blog.mjgrzymek.com/blog/css-has</link><dc:creator>MJGrzymek</dc:creator><comments>https://news.ycombinator.com/item?id=40350183</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40350183</guid></item></channel></rss>