<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: statusfailed</title><link>https://news.ycombinator.com/user?id=statusfailed</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 25 Apr 2026 19:05:32 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=statusfailed" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Ral: A shell grounded in programming language theory]]></title><description><![CDATA[
<p>Article URL: <a href="https://lambdabetaeta.github.io/ral/">https://lambdabetaeta.github.io/ral/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47791442">https://news.ycombinator.com/item?id=47791442</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Thu, 16 Apr 2026 11:17:26 +0000</pubDate><link>https://lambdabetaeta.github.io/ral/</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=47791442</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47791442</guid></item><item><title><![CDATA[New comment by statusfailed in "Automatic Textbook Formalization"]]></title><description><![CDATA[
<p>I am a huge fan of mm0, the thesis[0] is so brilliantly written, and MMC is such a great step towards the kind of verified computing I really want to be doing<p>[0]: <a href="https://digama0.github.io/mm0/thesis.pdf" rel="nofollow">https://digama0.github.io/mm0/thesis.pdf</a></p>
]]></description><pubDate>Sat, 04 Apr 2026 02:39:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=47635111</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=47635111</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47635111</guid></item><item><title><![CDATA[New comment by statusfailed in "RISC-V Is Sloooow"]]></title><description><![CDATA[
<p>The Milk-V Jupiter 2 (coming out in April) is RV23 too</p>
]]></description><pubDate>Tue, 10 Mar 2026 23:29:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=47330102</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=47330102</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47330102</guid></item><item><title><![CDATA[New comment by statusfailed in "Vim-pencil: Rethinking Vim as a tool for writing"]]></title><description><![CDATA[
<p>Ahh I thought I was the only one! One line per sentence makes the diffs so much nicer too, maybe we need git hooks to reject multiple sentences per line?</p>
]]></description><pubDate>Mon, 16 Feb 2026 13:52:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=47034933</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=47034933</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47034933</guid></item><item><title><![CDATA[New comment by statusfailed in "Using an engineering notebook"]]></title><description><![CDATA[
<p>I didn't find note-taking particularly useful until I started keeping everything in a single notebook with dated pages.
This worked a lot better than (for example) trying to organise notes by category - it's often easier to remember <i>when</i> you were working on something than <i>how you categorised it</i>, and once you know roughly when, you can find it by binary search</p>
]]></description><pubDate>Thu, 12 Feb 2026 09:54:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=46986832</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=46986832</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46986832</guid></item><item><title><![CDATA[Explosive GEMM: arbitrarily large FP error can be incurred in the GEMM operation]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/statusfailed/explosive-gemm">https://github.com/statusfailed/explosive-gemm</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46353850">https://news.ycombinator.com/item?id=46353850</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 22 Dec 2025 13:07:55 +0000</pubDate><link>https://github.com/statusfailed/explosive-gemm</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=46353850</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46353850</guid></item><item><title><![CDATA[New comment by statusfailed in "The universal weight subspace hypothesis"]]></title><description><![CDATA[
<p>I saw a similar (I think!) paper "Grassmannian Optimization Drives Generalization in Overparameterized DNN" at OPT-ML at neurips last week[0]<p>This is a little outside my area, but I think the relevant part of that abstract is "Gradient-based optimization follows horizontal lifts across low-dimensional subspaces in the Grassmannian Gr(r, p), where r  p is the rank of the Hessian at the optimum"<p>I think this question is super interesting though: why can massively overparametrised models can still generalise?<p>[0]: <a href="https://opt-ml.org/papers/2025/paper90.pdf" rel="nofollow">https://opt-ml.org/papers/2025/paper90.pdf</a></p>
]]></description><pubDate>Tue, 09 Dec 2025 10:29:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=46203390</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=46203390</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46203390</guid></item><item><title><![CDATA[New comment by statusfailed in "AI documentation you can talk to, for every repo"]]></title><description><![CDATA[
<p>Which repos worked well? I've had the same experience as op- unhelpful diagrams and bad information hierarchy. But I'm curious to see examples of where it's produced good output!</p>
]]></description><pubDate>Tue, 11 Nov 2025 10:52:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=45885997</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=45885997</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45885997</guid></item><item><title><![CDATA[New comment by statusfailed in "Categorical Foundations for Cute Layouts"]]></title><description><![CDATA[
<p>Really nice! Had a quick read, here's my quick summary:<p>- Arrays are typed `S : D` with shape S and strides D<p>- Each of `S` and `D` is a <i>nested</i> tuple (instead of the flat tuples one typically sees in a tensor framework)<p>- Together `S` and `D` define the <i>layout</i> of a tensor<p>- Not every layout is "tractable", but the tractable ones form a nice category<p>A really good exposition, my only criticism is that it's quite front-heavy- it would be nice to see a detailed example like in 2.3.8 earlier in the document; there is a lot of detail presented early that doesn't seem necessary to understand the core ideas.<p>Last comment: I suspect there is a connection to strictification[0], would love to know more if the authors see this!<p>[0]: in the sense i mean here: <a href="https://arxiv.org/pdf/2201.11738v3" rel="nofollow">https://arxiv.org/pdf/2201.11738v3</a></p>
]]></description><pubDate>Tue, 23 Sep 2025 07:57:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=45344093</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=45344093</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45344093</guid></item><item><title><![CDATA[New comment by statusfailed in "Ask HN: Who is hiring? (August 2025)"]]></title><description><![CDATA[
<p>Hellas.AI | Remote | Full Time or Contract | <a href="https://hellas.ai" rel="nofollow">https://hellas.ai</a><p>Hellas.AI is building a compiler for categorical deep learning to power decentralised, serverless AI.<p>We're looking for an experienced Rust engineer. You must have demonstrated:<p>* Experience in designing and implementing BFT consensus protocols
* Ability to engage with academic literature on distributed systems
* Understanding of ZK proofs and proof aggregation (you don't need to design these, but you should know how to use them)<p>Nice-to-have: interest or experience in:<p>* Deep Learning / ML / AI, GPU programming
* Compilers and array programming languages
* Category Theory and string diagrams<p>If you have project(s) demonstrating your experience in one or more of these areas, get in touch!<p>Our process is simple: we read code you've written and research you've published, then interview you about it. We don't do tedious coding tests.<p>Email us at hello@hellas.ai</p>
]]></description><pubDate>Mon, 04 Aug 2025 09:31:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=44783595</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=44783595</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44783595</guid></item><item><title><![CDATA[New comment by statusfailed in "Algebraic Semantics for Machine Knitting"]]></title><description><![CDATA[
<p>I've been hoping for a nice concrete example of braided monoidal categories for ages, who knew that the best one was string diagrams that represent <i>actual string</i>! Great post!<p>@the author - I assume you're aware that morphisms in symmetric monoidal categories can be represented using cospans of hypergraphs - do you know if there's a similar combinatorial representation for braided monoidal categories?</p>
]]></description><pubDate>Wed, 23 Apr 2025 12:16:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=43771208</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=43771208</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43771208</guid></item><item><title><![CDATA[New comment by statusfailed in "Catgrad: A categorical deep learning compiler"]]></title><description><![CDATA[
<p>(author here) the goals of catgrad are a bit different to JAX - first of all, the "autodiff" algorithm is really a general approach to composing <i>optics</i>, of which autodiff is just a special case. Among other things, this means you can "plug your own language" into the syntax library to get a "free" autodiff algorithm.
Second, catgrad itself is more like an IR right now - we're using it at hellas.ai to serve as a serverless runtime for models.<p>More philosophically, the motto is "write programs as morphisms directly".
Rather than writing a term in some type theory which you then (maybe) give a categorical semantics, why not just work directly in a category?<p>Long term, the goal is to have a compiler which is a stack of categories with functors as compiler passes. The idea being that in contrast to typical compilers where you are "stuck" at a given abstraction level, this would allow you to view your code at various levels of abstractions.
So for example, you could write a program, then write an x86-specific optimization for one function which you can then prove correct with respect to the more abstract program specification.</p>
]]></description><pubDate>Wed, 05 Feb 2025 20:58:38 +0000</pubDate><link>https://news.ycombinator.com/item?id=42955026</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=42955026</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42955026</guid></item><item><title><![CDATA[New comment by statusfailed in "Ask HN: Who is hiring? (January 2025)"]]></title><description><![CDATA[
<p>Hellas.AI | Remote | Full Time or Contract | <a href="https://hellas.ai" rel="nofollow">https://hellas.ai</a><p>Hellas.AI is building a compiler for categorical deep learning to power decentralised, serverless AI.
If you're interested in any of the following, get in touch:<p>* Category Theory and string diagrams<p>* Compilers and array programming languages<p>* Deep Learning/ML/AI and/or GPU programming (e.g. CUDA/
WGSL)<p>* Building and deploying distributed systems<p>* Peer-to-peer software and blockchain<p>If you have project(s) demonstrating your experience in one or more of these areas, get in touch!<p>Our process is simple: we read code you've written and research you've published, then interview you about it.
We don't do tedious coding tests.<p>Some experience of Rust or a functional language (Haskell, OCaml, any Lisp) is preferred.<p>Email us at hello@hellas.ai</p>
]]></description><pubDate>Thu, 02 Jan 2025 22:02:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=42579416</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=42579416</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42579416</guid></item><item><title><![CDATA[Sled: An Embedded Database in Rust]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/spacejam/sled">https://github.com/spacejam/sled</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42407298">https://news.ycombinator.com/item?id=42407298</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 13 Dec 2024 09:54:53 +0000</pubDate><link>https://github.com/spacejam/sled</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=42407298</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42407298</guid></item><item><title><![CDATA[New comment by statusfailed in "Mozilla fixes Firefox zero-day actively exploited in attacks"]]></title><description><![CDATA[
<p>Seems bad. "An attacker was able to achieve code execution in the content process by exploiting a use-after-free in Animation timelines. We have had reports of this vulnerability being exploited in the wild."<p>See:<p>- NVD page for CVE-2024-9680: <a href="https://nvd.nist.gov/vuln/detail/CVE-2024-9680" rel="nofollow">https://nvd.nist.gov/vuln/detail/CVE-2024-9680</a><p>- Mozilla security advisory: <a href="https://www.mozilla.org/en-US/security/advisories/mfsa2024-51/" rel="nofollow">https://www.mozilla.org/en-US/security/advisories/mfsa2024-5...</a></p>
]]></description><pubDate>Thu, 10 Oct 2024 07:22:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=41796426</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=41796426</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41796426</guid></item><item><title><![CDATA[New comment by statusfailed in "Were RNNs All We Needed?"]]></title><description><![CDATA[
<p>I only had a quick look, but it looks like they tweaked the state update so the model can be run with parallel scan instead of having to do it sequentially.</p>
]]></description><pubDate>Thu, 03 Oct 2024 18:01:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=41733138</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=41733138</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41733138</guid></item><item><title><![CDATA[ConsiStory: Training-Free Consistent Text-to-Image Generation]]></title><description><![CDATA[
<p>Article URL: <a href="https://research.nvidia.com/labs/par/consistory/">https://research.nvidia.com/labs/par/consistory/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41489183">https://news.ycombinator.com/item?id=41489183</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 09 Sep 2024 15:03:51 +0000</pubDate><link>https://research.nvidia.com/labs/par/consistory/</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=41489183</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41489183</guid></item><item><title><![CDATA[New comment by statusfailed in "Why AI Infrastructure Startups Are Insanely Hard to Build"]]></title><description><![CDATA[
<p>I'd love to know what your use case is that makes those things important to you - and what kind of benchmarks and cleaning tasks do you need to run?<p>Also, what kind of evaluations for quality of reasoning do you use?</p>
]]></description><pubDate>Wed, 03 Jul 2024 08:36:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=40863966</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=40863966</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40863966</guid></item><item><title><![CDATA[New comment by statusfailed in "Sending emails to my three-year-old"]]></title><description><![CDATA[
<p>This lets other family members send emails too, and has an interface everyone is familiar with.</p>
]]></description><pubDate>Mon, 10 Jun 2024 17:44:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=40636071</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=40636071</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40636071</guid></item><item><title><![CDATA[New comment by statusfailed in "Launch HN: Univerbal (YC W23) – Language learning with a conversational AI tutor"]]></title><description><![CDATA[
<p>At least for chinese there are off-the-shelf word segmenters you can use like jieba[0]- I used it in gptlingo and it Just Works(TM).<p>The "show pronounciations" setting just turns on pinyin above characters - what I want is to type pinyin and enter chinese characters. Actually showing the pinyin above characters is quite distracting!<p>[0]: <a href="https://pypi.org/project/jieba/" rel="nofollow">https://pypi.org/project/jieba/</a></p>
]]></description><pubDate>Tue, 30 Jan 2024 19:22:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=39194412</link><dc:creator>statusfailed</dc:creator><comments>https://news.ycombinator.com/item?id=39194412</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39194412</guid></item></channel></rss>