<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: porridgeraisin</title><link>https://news.ycombinator.com/user?id=porridgeraisin</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 17 Aug 2026 23:55:26 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=porridgeraisin" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by porridgeraisin in "A third world engineer responds to “RISC-V: They should have known better”"]]></title><description><![CDATA[
<p>I dont know about the social aspects since I don't live there, but as far as AI goes, it's not just HN. There is no place where you get balanced takes that match the work that we actually do day to day. I suspect part of this is accelerated by the media practices of the hyperscalers like anthropic and openai - they make doomerism super profitable for publishers. One of the most natural emergent counterweights to doomerism is over-skepticism. That is my theory for why it is the way it is. The remaining over-hype is a counterweight to this over-skepticism (I'm not talking about altman hyping his business, I mean the general tech people going around bashing sutton and lecun and mentioning "AGI")<p>Even publications, semianalysis is the only major, decent one in my experience (excluding personal blogs).<p>Everything is low SNR for AI - have you seen ICML/ICLR/NeurIPS recently?? There is almost no point even going except for meeting people which we do by scheduling talks back and forth every few months anyways.<p>I also find IRL, then a carefully curated twitter timeline with the politics toggle on the settings page set to off, are the only ways to get high SNR information about AI.<p>I also feel it's topic-based. On general systems engineering, think databases, OS, architecture, webtech, the SNR on this site is generally amazing. But these days those articles are fewer than before. For example, 2 years back when every other article was about sqlite and postgres, while it was a very unidimensional few months, you could learn a lot from here.</p>
]]></description><pubDate>Mon, 17 Aug 2026 16:05:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=49333239</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49333239</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49333239</guid></item><item><title><![CDATA[New comment by porridgeraisin in "How Go detects struct copies with sync.noCopy"]]></title><description><![CDATA[
<p>Yep. But with go 1.22/1.23 and later this is changing. It's becoming a hell of a mess like many other big languages. I think it was two consecutive releases back in 2024 where they added for ... range and generics? That was when I gave up.<p>Sad that the one language that managed to occupy that nice spot in language design space for an extended period of time, isn't doing so anymore.<p>Of course, you can actively restrict yourself to standard go, but not needing to do that was the whole point.</p>
]]></description><pubDate>Mon, 17 Aug 2026 14:50:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=49332012</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49332012</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49332012</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Tell HN: GitHub Is Experiencing Degraded Performance"]]></title><description><![CDATA[
<p>Clones, repo browsing etc are all working.<p>/pull/:id/changes is not working, but /pull/:id.diff _is_. It seems parts of the API is also ok? some gh commands I tried worked.<p>Files changed works on the mobile app somehow. I guess a particular api version or something is down.<p>Anyway if someone needs files changed and merge status, check the mobile app. Past actions are also loading on that.<p>[Android, India]</p>
]]></description><pubDate>Mon, 17 Aug 2026 14:24:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=49331526</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49331526</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49331526</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Anthropic's 'watermark' text adulteration in Claude is a perversion of writing"]]></title><description><![CDATA[
<p>> try me<p>Good luck explaining that one</p>
]]></description><pubDate>Mon, 17 Aug 2026 12:17:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49329651</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49329651</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49329651</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Linear algebra done right"]]></title><description><![CDATA[
<p>The nature of textbooks is that each one is better suited for a certain profile of reader. It depends a lot on the way the reader has learnt to learn things until that point in their life.<p>If you liked 3B1B's style, you will prefer strang over axler. Axler and treil to a greater extent focus on bringing out the abstract elegance and the kind of rigour a math major enjoys. Strang's book also has videos accompanying - on MIT OCW.<p>B&V VMLS on your list is interesting - they focus a lot on real-world instantiations of the concepts and have you code up things in the (excellent) exercises. Depending on your goals, you can do only this, or strang and then this. Definitely look at the exercises in any case though.</p>
]]></description><pubDate>Mon, 17 Aug 2026 10:15:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=49328693</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49328693</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49328693</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Stripe will reportedly acquire OpenRouter for $7B+"]]></title><description><![CDATA[
<p>Both are in the business of putting a single API key in front of a fragmented ecosystem and charging a convenience fee. This middleman business is naturally coalescing.<p>The nature of the ecosystem also means that pricing is closely tied to "procurement" which could be routing, limits, whatever at a company level.<p>If stripe wants to be _the_ one that charges that fee, they either have to continuously try to ensure that all the different middlenen use stripe (most of them do!) but even better is to acquire the largest middleman.<p>You don't want someone else who happens to do all the routing+limits+policies, end up not using stripe. They already have this hold in existing stripe financial products where they apply all the policies, and everything goes through them.<p>It is also an easy deal from an investor point of view.</p>
]]></description><pubDate>Sun, 16 Aug 2026 22:06:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49324200</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49324200</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49324200</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Show HN: Laptop is the last place your secrets are still in plaintext"]]></title><description><![CDATA[
<p>Yes, you can even have it tpm-backed.<p>echo -n "sk-proj-12345..." | systemd-creds encrypt --with-key=tpm2 --name=openai_key - openai.cred<p>And then at runtime export OPENAI_API_KEY=$(sudo systemd-creds decrypt openai.cred)</p>
]]></description><pubDate>Sun, 16 Aug 2026 08:26:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=49318056</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49318056</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49318056</guid></item><item><title><![CDATA[What happens when an LLM never sees material beyond fifth grade?]]></title><description><![CDATA[
<p>Article URL: <a href="https://littlelearner-ll.github.io/">https://littlelearner-ll.github.io/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49317760">https://news.ycombinator.com/item?id=49317760</a></p>
<p>Points: 243</p>
<p># Comments: 208</p>
]]></description><pubDate>Sun, 16 Aug 2026 07:37:53 +0000</pubDate><link>https://littlelearner-ll.github.io/</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49317760</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49317760</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Why tech bosses keep sharing their manifestos about AI"]]></title><description><![CDATA[
<p>I wouldn't call reuters opinion free. They are bad enough to be bbc-tier I'd say. Better for sure though.</p>
]]></description><pubDate>Sat, 15 Aug 2026 23:23:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=49315234</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49315234</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49315234</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Auto-research with codex: How I achieved a 232x Faster Kernel"]]></title><description><![CDATA[
<p>It's a straightforward "prompting" + single evolutionary algorithm technique, The paper looks like well, a paper, but the actual thing is simple.</p>
]]></description><pubDate>Sat, 15 Aug 2026 14:18:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=49310803</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49310803</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49310803</guid></item><item><title><![CDATA[New comment by porridgeraisin in "GenRec: Towards LLM-Native Recommendation at Netflix"]]></title><description><![CDATA[
<p>In this setting, they are essentially using it as a feature extractor.<p>As for moving to this versus your bespoke feature extractor, _given_ that your existing features and their compositions are not antithetical to their language representation, an LLM will be an equal or better feature extractor. But for example, considering the basic feature genre, if your collaborative filter has learnt features that smartly recommending a show with one text feature "sci-fi" to people whose preferences have the text feature "comedy" because of learned behaviour despite the text, then you have to verbalise this feature "scifi,laugh track" or maybe providing samples of the subtitles of the show or add a "frequently co-watched with" section (which contains comedy shows) to the prompt, to effectively get an LLM to do the same thing (or many other ways to induce a hybrid embedding)<p>In many cases, people have almost entirely verbalizable features and feature compositions in their existing systems even if it may not exactly be optimal. So it's a good idea to try out LLMs there.<p>Composition mentioned everywhere above is crucial. Provided you can verbalise your important features, LLMs can perform very strong deductions and compositions out of the box above and beyond our own feature interactions that we use with say xgboost setups. And it's dynamic in the sense that it gives you a foundation model you don't have to retrain to use new (verbalizable) interactions.</p>
]]></description><pubDate>Sat, 15 Aug 2026 14:13:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=49310759</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49310759</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49310759</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Auto-research with codex: How I achieved a 232x Faster Kernel"]]></title><description><![CDATA[
<p>They are easily verifiable and hill-climbable.<p>Because pre-LLMs humans partially "autogenerated" kernels through hyperparameter search and in some sense eating the code complexity in return for performance, and thus built tools for the same automatic verifiability that is useful for LLMs.<p>In some other tasks, we never built the same level of automatic verifiability since the level of automation in creation being much lower meant it's not giving you as much of a marginal benefit. We prefer code readability and simplicity and such in say, web services, because, say, the database IO time is going to dominate. Here getting an LLM to write a cromulent C# web service is more difficult since it's not easy to automatically verify whether code is cromulent or not. So if you put up LLMs to it, you end up with slop (which works).<p>OTOH, in kernel design, you give it access to every perf counter, every observable possible and have it optimise all of them. And all are verifiable/hill-climbable and you generally don't give a crap if the code is readable or reusable.</p>
]]></description><pubDate>Sat, 15 Aug 2026 13:26:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=49310358</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49310358</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49310358</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Auto-research with codex: How I achieved a 232x Faster Kernel"]]></title><description><![CDATA[
<p>This is the way. Checkout the technique mentioned in the alphaevolve paper and see if it works well for your setting.</p>
]]></description><pubDate>Sat, 15 Aug 2026 13:21:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=49310315</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49310315</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49310315</guid></item><item><title><![CDATA[Nvidia Secures TSMC A16 Node for Next-Generation "Feynman" GPUs]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.techpowerup.com/351607/nvidia-secures-tsmc-a16-node-for-next-generation-feynman-gpus">https://www.techpowerup.com/351607/nvidia-secures-tsmc-a16-node-for-next-generation-feynman-gpus</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49309227">https://news.ycombinator.com/item?id=49309227</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 15 Aug 2026 09:55:06 +0000</pubDate><link>https://www.techpowerup.com/351607/nvidia-secures-tsmc-a16-node-for-next-generation-feynman-gpus</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49309227</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49309227</guid></item><item><title><![CDATA[New findings throw light on enduring Sun mysteries]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.bbc.com/news/articles/c934wqpd74xo">https://www.bbc.com/news/articles/c934wqpd74xo</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49308570">https://news.ycombinator.com/item?id=49308570</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 15 Aug 2026 07:34:47 +0000</pubDate><link>https://www.bbc.com/news/articles/c934wqpd74xo</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49308570</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49308570</guid></item><item><title><![CDATA[New comment by porridgeraisin in "NP-overrated"]]></title><description><![CDATA[
<p>Oh yeah, forgot about those.</p>
]]></description><pubDate>Fri, 14 Aug 2026 10:45:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49296976</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49296976</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49296976</guid></item><item><title><![CDATA[New comment by porridgeraisin in "NP-Overrated"]]></title><description><![CDATA[
<p>No doubt.</p>
]]></description><pubDate>Thu, 13 Aug 2026 21:04:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=49291840</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49291840</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49291840</guid></item><item><title><![CDATA[New comment by porridgeraisin in "NP-overrated"]]></title><description><![CDATA[
<p>> NP-hard problems are solvable in theory but it's hopelessly expensive in practice. It's basically proven that no good algorithms exist. At least that's what I took away.<p>You took away the wrong thing. The theory tells you that no good algorithm exists for _all_ possible inputs. This means you have to try to limit yourself to a subset of the problem space, and use heuristics to move all the remaining pathological cases (if any) to a corner you then monitor and ensure doesn't occur in practice too often.<p>Package managers are designed the way they are _because_ of the inherent NP-hardness, not _despite_ it as this article conveys.<p>In the formal models of dependency resolution, the three core conditions are: 1) Root package is included, 2) Dependency closure (everything required is present)
3) Version uniqueness (at most one version per package name)<p>NPM, yarn etc drop 3) which makes it not NP hard.<p>Go limits itself to minimum version selection which admits a linear time solution.<p>Cargo allows multiple major versions, thus reducing most cases of 3), and then relies on heuristics to prune and reduce the pathological cases to be relatively rare. There have been cases of real world trees that had issues, but then you add a heuristic that catches that type, and then eventually it becomes super rare. This style of design is adopted because of the known NP-hardness. We don't go around looking for algorithms to solve the general case, and we simplify the problem where possible knowing the benefit we get in return, or we watch and shift around the pathological cases to a rare corner, all because of knowing it is NP hard.<p>Amazon's SMT solvers and similar all use in principle similar tricks - only passing simplified encodings, portfolio solving i.e Promise.any(multiple solvers with same problem), timeouts + fallback, etc.<p>Another common example is the MIPs used by food delivery and other gig platform companies where the complexity of the solver is intentionally and aggressively slashed using as many tricks as possible.</p>
]]></description><pubDate>Thu, 13 Aug 2026 21:00:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=49291797</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49291797</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49291797</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Accelerating GPT-5.6 Sol Ultrafast"]]></title><description><![CDATA[
<p>Cerebras is a large plate sized chip. It has 50GB of SRAM, and few hundred K simple cores that can access that SRAM really fast. I don't know semiconductors well, but I understand that the same manufacturing technique that makes this huge chip possible, on the flip-side limits inter-chip communcation bandwidth. In cerebras, it is 150 GB/s (compared to nvlink's 2TB/s or groq's similar).<p>One way large models are served on a bunch of cerebras chips is by essentially distributing layers' weights across chips. Few layers's weights per chip - as many as the KV cache + activations + weights will allow. You use pipelining to hide the latency of the inter-chip 150 GB/s link.<p>On GPUs, you amortize the cost of loading weights from HBM to SRAM across multiple users - thereby making it cheaper _per_ user. But here, there is no such amortization. The weights are already there. It is the activations that stream through.<p>You _could_ do batching/continuous batching, but that would just service more users at lower token/s each without any amortization of fixed cost, due to fixed cost (loading weights) being non-existent.</p>
]]></description><pubDate>Thu, 13 Aug 2026 20:33:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=49291477</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49291477</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49291477</guid></item><item><title><![CDATA[New comment by porridgeraisin in "Previewing Ultrafast mode: GPT‑5.6 Sol at up to 14X the speed"]]></title><description><![CDATA[
<p>> Powered by cerebras<p>> Launching first in the OpenAI API to a select group of customers with expanded access to more businesses as capacity grows.</p>
]]></description><pubDate>Thu, 13 Aug 2026 17:51:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=49289564</link><dc:creator>porridgeraisin</dc:creator><comments>https://news.ycombinator.com/item?id=49289564</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49289564</guid></item></channel></rss>