<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: reuben364</title><link>https://news.ycombinator.com/user?id=reuben364</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 19 Nov 2026 20:53:59 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=reuben364" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by reuben364 in "The Web Is More Than Enough"]]></title><description><![CDATA[
<p>I had Claude do a raymarched game with rust-gpu (initially Futhark) + webgpu + wasm.
It definitely ran terribly, but it was surprisingly good at modeling with SDFs<p><a href="https://github.com/badly-drawn-wizards/wizard-vibes" rel="nofollow">https://github.com/badly-drawn-wizards/wizard-vibes</a></p>
]]></description><pubDate>Mon, 09 Nov 2026 20:02:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=50431107</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=50431107</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50431107</guid></item><item><title><![CDATA[New comment by reuben364 in "Show HN: Prove your code produced your claims without making reviewers rerun it"]]></title><description><![CDATA[
<p>Found in the docs:<p><a href="https://kveritas.org/docs/benchmarks" rel="nofollow">https://kveritas.org/docs/benchmarks</a> - What a verifier learns:<p>> "A run of committed code, on attested hardware at time T, reading a model with hash m and a dataset with hash d, produced score S.” If d is a public benchmark, they also confirm it is the real benchmark, without you exposing it. The score is also cross-checked by the compute-cost certificate, which confirms the evaluation consumed the compute a real forward pass over the data requires.<p>They should really put that front and center. Still not a complete enough description, but something at least.</p>
]]></description><pubDate>Mon, 31 Aug 2026 07:06:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=49506547</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=49506547</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49506547</guid></item><item><title><![CDATA[New comment by reuben364 in "Unlawful by design: Exposing the human rights costs of generative AI"]]></title><description><![CDATA[
<p>The quote you gave seems reasonable on it's own. ICE and Palantir comes to mind as exactly the kind of thing one would want to avoid. Could you elaborate on what particularly you find lacking in that quote?</p>
]]></description><pubDate>Mon, 01 Jun 2026 08:47:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=48354188</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=48354188</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48354188</guid></item><item><title><![CDATA[New comment by reuben364 in "Ask HN: COBOL devs, how are AI coding affecting your work?"]]></title><description><![CDATA[
<p>I find that at the granularity you need to work with current LLMs to get a good enough output, while verifying its correctness is more effort than writing code directly. The usefulness of LLMs to me is to point me in a direction that I can then manually verify and implement.</p>
]]></description><pubDate>Mon, 19 Jan 2026 16:19:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=46680726</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=46680726</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46680726</guid></item><item><title><![CDATA[New comment by reuben364 in "A Brutal Look at Balanced Parentheses, Computing Machines, and Pushdown Automata"]]></title><description><![CDATA[
<p>I was surprised to not see a connection made to free groups in the article.<p>EDIT: The wikipedia article that is.</p>
]]></description><pubDate>Fri, 14 Nov 2025 10:09:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=45925535</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=45925535</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45925535</guid></item><item><title><![CDATA[New comment by reuben364 in "Ask HN: What Are You Working On? (Nov 2025)"]]></title><description><![CDATA[
<p>I'm working on formalizing <a href="https://arxiv.org/pdf/2508.18475" rel="nofollow">https://arxiv.org/pdf/2508.18475</a> (A convex polyhedron without Rupert's property) in Lean4<p>I'm only on lemma 11 at this point, and up until that point the paper has been fairly easy to formalize (modulo my unfamiliarity with mathlib).<p>The repo is here <a href="https://github.com/badly-drawn-wizards/noperthedron" rel="nofollow">https://github.com/badly-drawn-wizards/noperthedron</a></p>
]]></description><pubDate>Mon, 10 Nov 2025 09:28:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=45874174</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=45874174</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45874174</guid></item><item><title><![CDATA[New comment by reuben364 in "Binding Application in Idris"]]></title><description><![CDATA[
<p>I'm wondering whether such syntax is subsumed by something like Lean 4 macros. I believe Lean 4 already treats binders specially in its syntax for macro hygiene reasons, but I'm not confident in that assertion.</p>
]]></description><pubDate>Mon, 14 Jul 2025 09:38:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=44558081</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=44558081</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44558081</guid></item><item><title><![CDATA[New comment by reuben364 in "Show HN: Lambduck, a Functional Programming Brainfuck"]]></title><description><![CDATA[
<p>Since the de Bruijn indices are limited (and presumably still Turing complete), I wonder how limited you can make them and still be Turing complete.</p>
]]></description><pubDate>Fri, 06 Jun 2025 15:02:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=44201618</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=44201618</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44201618</guid></item><item><title><![CDATA[New comment by reuben364 in "The Lisp in the Cellar: Dependent types that live upstairs [pdf]"]]></title><description><![CDATA[
<p>I just wrote redef to emphasize that I'm not shadowing the original definition.<p><pre><code>    def a := 1
    def f x := a * x
    -- at this point f 1 evaluates to 1
    redef a := 2
    -- at this point f 1 evaluates to 2
</code></pre>
But with dependent types, types can depend on prior values (in the previous example the type of x depends on the value t in the most direct way possible, as the type of x is t). If you redefine values, the subsequent definitions may not type-check anymore.</p>
]]></description><pubDate>Tue, 20 May 2025 19:59:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=44045309</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=44045309</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44045309</guid></item><item><title><![CDATA[New comment by reuben364 in "The Lisp in the Cellar: Dependent types that live upstairs [pdf]"]]></title><description><![CDATA[
<p>Thinking out aloud here.<p>One pattern that I have frequently used in EMACS elisp is that redefining a top-level value overwrites that value rather than shadowing it. Basically hot reloading. This doesn't work in a dependently typed context as the type of subsequent definitions can depend on values of earlier definitions.<p><pre><code>    def t := string
    def x: t := "asdf"
    redef t := int
</code></pre>
redefining t here would cause x to fail to type check. So the only options are to either shadow the variable t, or have redefinitions type-check all terms whose types depend on the value being redefined.<p>Excluding the type-level debugging they mention, I think a lean style language-server is a better approach. Otherwise you are basically using an append-only ed to edit your environment rather than a vi.</p>
]]></description><pubDate>Tue, 20 May 2025 15:46:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=44042917</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=44042917</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44042917</guid></item><item><title><![CDATA[New comment by reuben364 in "Lemma for the Fundamental Theorem of Galois Theory"]]></title><description><![CDATA[
<p>There is a large library of mathematics formalized in lean called mathlib. There are graphs for the module dependencies, but I haven't seen any at the level of definitions (including lemmas and theorems).</p>
]]></description><pubDate>Sat, 15 Mar 2025 22:12:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=43375474</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=43375474</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43375474</guid></item><item><title><![CDATA[New comment by reuben364 in "YouTube DRM added on ALL videos with TV (TVHTML5) clients"]]></title><description><![CDATA[
<p>It matters for anti-circumvention, where they can go after people that make tools that allow you to make personal copies.</p>
]]></description><pubDate>Tue, 11 Mar 2025 10:05:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=43330892</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=43330892</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43330892</guid></item><item><title><![CDATA[New comment by reuben364 in "Everything Is Just Functions: 1 week with David Beazley and SICP"]]></title><description><![CDATA[
<p>Not sure of details to make it a mathematical foundation but:<p>A category can be defined in terms of its morphisms without mentioning objects and a topos has predicates as morphisms into the subobject classifier.</p>
]]></description><pubDate>Mon, 18 Nov 2024 11:08:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=42171390</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=42171390</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42171390</guid></item><item><title><![CDATA[New comment by reuben364 in "Coroutines and effects"]]></title><description><![CDATA[
<p>That'd almost be partial functions with extra steps. Take the Klesili category with the Maybe Monad,and you get partial functions.<p>Unless you are manually matching on the the Maybe, and thus observing the timeout, then that isn't the case. You'd probably also want a nondetermism effect which cannot handle unless you specifically build your timeouts to be deterministic, which I think Lean 4 does, but you can't go from partial to total with it afaik.</p>
]]></description><pubDate>Tue, 23 Apr 2024 11:50:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=40130817</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=40130817</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40130817</guid></item><item><title><![CDATA[New comment by reuben364 in "Coroutines and effects"]]></title><description><![CDATA[
<p>a function will return to it's call site (or diverge), a handler doesn't necessarily have to resume from where it was invoked. There is also (sort of) dynamic scoping, where you don't have to thread the handlers through calls.</p>
]]></description><pubDate>Mon, 22 Apr 2024 10:45:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=40113057</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=40113057</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40113057</guid></item><item><title><![CDATA[New comment by reuben364 in "Data structures as topological spaces (2002) [pdf]"]]></title><description><![CDATA[
<p>I'm left confused as to what the gluing in the rule replacement is. Must the boundary of a rule match on both sides? Also what examples there would be of what an example would of having topology that is not induced from a graph if it is at all possible.</p>
]]></description><pubDate>Fri, 16 Feb 2024 14:06:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=39397157</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=39397157</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39397157</guid></item><item><title><![CDATA[New comment by reuben364 in "How I'm able to take notes in mathematics lectures using LaTeX and Vim (2019)"]]></title><description><![CDATA[
<p>I didn't expect Lean 4 in this context.</p>
]]></description><pubDate>Mon, 05 Feb 2024 13:20:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=39260939</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=39260939</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39260939</guid></item><item><title><![CDATA[New comment by reuben364 in "How to do things if you're not that smart and don't have any talent"]]></title><description><![CDATA[
<p>At first glance that does seem to match my temperament. I love this quote as I have recently discovered it working for me<p><pre><code>  If you want to think clearly, be calm and be smart; schedule a Micro Nervous Breakdown at least once a day.</code></pre>
not sure if that is healthy though.<p>I guess with regards to mental health DSM type issues vs other issues, it is difficult to untangle for me. It may not be an actual disorder, but it certainly causes me distress. It's like being a science enthusiast that can't move past reading pop-sci articles (but wants to).</p>
]]></description><pubDate>Tue, 30 Jan 2024 13:46:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=39190023</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=39190023</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39190023</guid></item><item><title><![CDATA[New comment by reuben364 in "How to do things if you're not that smart and don't have any talent"]]></title><description><![CDATA[
<p>On medication for ADHD, it helps in the short term, but I still struggle to commit to working on things in the long term. I either get bored or forget or find a new shiny.<p>My job involves static analysis and I have an interest in PLT, so I've found some papers (Abstracting Abstract Machines) that I'll read through and get a rough idea. But to truly understand things I have to implement the ideas, but the scope of what I want to do expands so fast that I get demotivated and eventually move on.<p>Categories for the working mathematician, Software Foundations, contributing to mathlib are all things that I sort of start working towards and cannot force myself to get to any meaningful conclusion. At the same time starting so many things is how I slowly accumulated the foundations necessary to even approach these things.<p>It doesn't help that I also have PDA autism, which leads any sort of structure I try to impose on myself eventually becoming too stressful. I feel like I've reached the extent that modern medicine (I'm just short of max dosage of XR Ritalin) and therapy I can afford can help me.</p>
]]></description><pubDate>Tue, 30 Jan 2024 13:08:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=39189655</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=39189655</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39189655</guid></item><item><title><![CDATA[New comment by reuben364 in "We Could Fix Everything, We Just Don't"]]></title><description><![CDATA[
<p>Don't get me wrong, I agree, but aren't all solutions to problems situated in reality conterfactual to some degree. To the extent of my knowledge, isn't it all deterministic. To enact a stategy is to presume a free agent, individual or collective, acts according to that strategy. The act of communicating that strategy is in essence to convince those interests align with the outcome to act accordingly. We deal with imperfect information, it could be possible that someone, or a small group can unilaterally disseminate a strategy that drives wider cooperation, but those are probably unknown unknowns far too complicated to decipher by any cooperating party.<p>Of course this isn't it. Warp drives and luxury space communism seem to be something we could only stumble into.</p>
]]></description><pubDate>Tue, 02 Jan 2024 15:24:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=38842548</link><dc:creator>reuben364</dc:creator><comments>https://news.ycombinator.com/item?id=38842548</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38842548</guid></item></channel></rss>