<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: BenoitP</title><link>https://news.ycombinator.com/user?id=BenoitP</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 16 Apr 2026 06:39:28 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=BenoitP" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by BenoitP in "UpDown: Efficient Manycore based on Many Threading & Scalable Memory Parallelism"]]></title><description><![CDATA[
<p>Yet another manycore proposal, but I feel each time we're getting closer. Bandwidth is one of the few dimensions still growing, and there's something to unlock by shaping computation by this firehose of bits.<p>However it seems the software part is always a blocker, and these architecture only address well a handful of program types.<p>Is this time different? I think it is. The paradigm here is about small threads that yield very often, and we have that way of programming: Erlang, Go, Java's virtual threads.</p>
]]></description><pubDate>Tue, 14 Apr 2026 07:31:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=47762432</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47762432</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47762432</guid></item><item><title><![CDATA[Full System Cost of a Resilient and Carbon Neutral Electricity System [pdf]]]></title><description><![CDATA[
<p>Article URL: <a href="https://unece.org/sites/default/files/2025-09/GECES-21_2025_INF.2%20-%20Understanding%20the%20Full%20System%20Cost%20of%20the%20Electricity%20System.pdf">https://unece.org/sites/default/files/2025-09/GECES-21_2025_INF.2%20-%20Understanding%20the%20Full%20System%20Cost%20of%20the%20Electricity%20System.pdf</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47678127">https://news.ycombinator.com/item?id=47678127</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 07 Apr 2026 16:49:54 +0000</pubDate><link>https://unece.org/sites/default/files/2025-09/GECES-21_2025_INF.2%20-%20Understanding%20the%20Full%20System%20Cost%20of%20the%20Electricity%20System.pdf</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47678127</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47678127</guid></item><item><title><![CDATA[New comment by BenoitP in "Has electricity decoupled from natural gas prices in Germany?"]]></title><description><![CDATA[
<p>LCOE is good for marginal cost (eg: one more solar panel), but fails dramatically at evaluating systemic costs.<p>A nuclear reactor moves the entire market down, including the costs to the consumer when he buys solar energy.<p>Here is a UN document explaining it: <a href="https://unece.org/sites/default/files/2025-09/GECES-21_2025_INF.2%20-%20Understanding%20the%20Full%20System%20Cost%20of%20the%20Electricity%20System.pdf" rel="nofollow">https://unece.org/sites/default/files/2025-09/GECES-21_2025_...</a></p>
]]></description><pubDate>Tue, 07 Apr 2026 16:44:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=47678055</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47678055</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47678055</guid></item><item><title><![CDATA[New comment by BenoitP in "Jax's true calling: Ray-Marching renderers on WebGL"]]></title><description><![CDATA[
<p>JAX is designed from the start to fit well with systolic arrays (TPUs, Nvidia's tensor cores, etc), which are extremely energy-efficient. WebGL won't be the tool that connects it on the web, but the generation after WebGPU will.</p>
]]></description><pubDate>Thu, 02 Apr 2026 07:24:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=47611091</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47611091</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47611091</guid></item><item><title><![CDATA[New comment by BenoitP in "Jax's true calling: Ray-Marching renderers on WebGL"]]></title><description><![CDATA[
<p>I believe we could get there eventually. For example for collision there is work to make it differentiable (or use a local surrogate at the collision point):
<a href="https://arxiv.org/abs/2207.00669" rel="nofollow">https://arxiv.org/abs/2207.00669</a><p>The robotics will need to connect vision with motors with haptics with 3D modelling. And to propagate gradient seamlessly. For calibrating torque with the the elastic deformation of the material for example. After all matter is not discreet at small scales (staying above the atomic scale)<p>All this will require all modules to be compatible with differentiability. It'll be expensive at first, but I'm sure some optimizations can get us close to the discreet case.<p>Also even for meshes there is a lot to gain with trying to go the continuous way:<p><a href="https://www.cs.cmu.edu/~kmcrane/Projects/DDG/" rel="nofollow">https://www.cs.cmu.edu/~kmcrane/Projects/DDG/</a></p>
]]></description><pubDate>Thu, 02 Apr 2026 07:19:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=47611052</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47611052</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47611052</guid></item><item><title><![CDATA[New comment by BenoitP in "Jax's true calling: Ray-Marching renderers on WebGL"]]></title><description><![CDATA[
<p>Yeah :)<p>I had a lot of fun writing the article! And it is only half a joke<p>My intuition for so-called world models is that we'll have to plug modules, each responsible for a domain (text, video, sound, robot-haptics, physical modelling) It'll require to plug modules in a way that will allow the gradient to propagate. A differentiable architecture. And JAX seems well placed for this by making function manipulation a first citizen. Looking at your testimony comforts me in this view</p>
]]></description><pubDate>Thu, 02 Apr 2026 07:07:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=47610964</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47610964</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47610964</guid></item><item><title><![CDATA[New comment by BenoitP in "Jax's true calling: Ray-Marching renderers on WebGL"]]></title><description><![CDATA[
<p>Damn, I should have spent more time QA-ing that post. I'll try to patch it.<p>You did not miss much though: it just rotates the scene.</p>
]]></description><pubDate>Thu, 02 Apr 2026 06:58:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=47610885</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47610885</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47610885</guid></item><item><title><![CDATA[Jax's true calling: Ray-Marching renderers on WebGL]]></title><description><![CDATA[
<p>Article URL: <a href="https://benoit.paris/posts/jax-ray-marcher/">https://benoit.paris/posts/jax-ray-marcher/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47605494">https://news.ycombinator.com/item?id=47605494</a></p>
<p>Points: 91</p>
<p># Comments: 14</p>
]]></description><pubDate>Wed, 01 Apr 2026 19:36:07 +0000</pubDate><link>https://benoit.paris/posts/jax-ray-marcher/</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47605494</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47605494</guid></item><item><title><![CDATA[New comment by BenoitP in "TurboQuant: Redefining AI efficiency with extreme compression"]]></title><description><![CDATA[
<p>It is AI generated. Or was written by someone a bit far from the technical advances IMHO. The Johnson-Lindenstrauss Lemma is a very specific and powerful concept, when in the article the QLJ explanation is vacuous. A knowledgeable human would not have left the reader wanting for how that relates to the Lemma.</p>
]]></description><pubDate>Wed, 25 Mar 2026 08:02:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=47514583</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47514583</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47514583</guid></item><item><title><![CDATA[New comment by BenoitP in "Executing programs inside transformers with exponentially faster inference"]]></title><description><![CDATA[
<p>> the whole process remains differentiable: we can even propagate gradients through the computation itself. That makes this fundamentally different from an external tool. It becomes a trainable computational substrate that can be integrated directly into a larger model.<p>IMHO the key point at which this technique has an unfair advantage vs a traditional interpreter is here.<p>How disruptive is it to have differentiability? To me it would mean that some tweaking-around can happen in an LLM-program at train-time; like changing a constant, or switching from a function call to another function. Can we gradient-descent effectively inside this huge space? How different is it from tool-calling from a pool of learned programs (think github but for LLM programs written in classic languages)?</p>
]]></description><pubDate>Fri, 13 Mar 2026 13:24:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=47364138</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47364138</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47364138</guid></item><item><title><![CDATA[New comment by BenoitP in "Avoiding Trigonometry (2013)"]]></title><description><![CDATA[
<p>> He's still computing cross(z, d) and dot(z, d) separately. that looks like a code smell to me. with quaternions ...<p>Fair point, but I think you misspelled Projective Geometric Algebra</p>
]]></description><pubDate>Thu, 12 Mar 2026 17:55:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=47354707</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47354707</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47354707</guid></item><item><title><![CDATA[New comment by BenoitP in "New accounts on HN more likely to use em-dashes"]]></title><description><![CDATA[
<p>But the newer commenters most probably could be younger</p>
]]></description><pubDate>Sun, 01 Mar 2026 06:55:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=47204342</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47204342</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47204342</guid></item><item><title><![CDATA[New comment by BenoitP in "Sub-$200 Lidar could reshuffle auto sensor economics"]]></title><description><![CDATA[
<p>> laser pulses<p>> phased-array<p>I'm not well versed into RF physics. I had the feeling that light-wave coherency in lasers had to be created at a single source (or amplified as it passes by). That's the first time I hear about phased-array lasers.<p>Can someone knowledgeable chime in on this?</p>
]]></description><pubDate>Mon, 23 Feb 2026 08:18:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=47119503</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=47119503</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47119503</guid></item><item><title><![CDATA[New comment by BenoitP in "Introduction to PostgreSQL Indexes"]]></title><description><![CDATA[
<p>A hard problem, especially wrt to transactions on a moving target.<p>From memory, handful of projects just dedicated to this dimension of databases: Noria, Materialize, Apache Flink, GCP's Continuous Queries, Apache Spark Streaming Tables, Delta Tables, ClickHouse streaming tables, TimescaleDB, ksqlDB, StreamSQL; and dozens more probably. IIRC, since this is about postgres, there is recently created extension trying to deal with this: pg_ivm</p>
]]></description><pubDate>Sun, 25 Jan 2026 15:19:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=46754783</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=46754783</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46754783</guid></item><item><title><![CDATA[New comment by BenoitP in "Ask HN: How did you learn to code?"]]></title><description><![CDATA[
<p>On the brand new and shiny 486 running dos and windows 3.1 that my father bought, on the qbasic language. With only a paper book as reference. No llm, no stackoverflow, no pageranked search engine, no internet, and not even Ctrl+F. In these days when you had a bug, you could chew on it for days.</p>
]]></description><pubDate>Thu, 01 Jan 2026 08:22:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=46452267</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=46452267</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46452267</guid></item><item><title><![CDATA[New comment by BenoitP in "Easily Dealing with Any-Dimensional Planes"]]></title><description><![CDATA[
<p>Of note is that once you've got planes, you can define points as intersections of n hyperplanes.<p>In 2D, 2 intersecting hyperplanes (=lines here) will define a point.<p>But what if these lines are parallel? Well you just got the "point at infinity" abstraction for free. And if you defined operators on points as intersections of lines they will also work with the points at infinity.<p>All this being nicely described under Projective Geometric Algebra: <a href="https://projectivegeometricalgebra.org/projgeomalg.pdf" rel="nofollow">https://projectivegeometricalgebra.org/projgeomalg.pdf</a><p>Also: with a few modifications you get conformal geometry as well; with everything being defined as intersections of spheres. After all, what is a plane but a sphere that has its center at infinity?</p>
]]></description><pubDate>Tue, 30 Dec 2025 13:34:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=46433180</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=46433180</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46433180</guid></item><item><title><![CDATA[New comment by BenoitP in "Removed rust to gain speed"]]></title><description><![CDATA[
<p>Most programs should be written in GCd languages, but not this.<p>Except in a few cases, GCs introduce small stop-the-world pauses. Even at 15ms pauses, it'd still be very noticeable.</p>
]]></description><pubDate>Sun, 07 Dec 2025 08:15:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=46180094</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=46180094</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46180094</guid></item><item><title><![CDATA[New comment by BenoitP in "Language models are injective and hence invertible"]]></title><description><![CDATA[
<p>> > Just intuitively, in such a high dimensional space, two random vectors are basically orthogonal.<p>> What's the intuition here? Law of large numbers?<p>Yep, the large number being the number of dimensions.<p>As you add another dimension to a random point on a unit sphere, you create another new way for this point to be far away from a starting neighbor. Increase the dimensions a lot and then all random neighbors are on the equator from the starting neighbor. The equator being a 'hyperplane' (just like a 2D plane in 3D) of dimension n-1, the normal of which is the starting neighbor, intersected with the unit sphere (thus becoming a n-2 dimensional 'variety', or shape, embedded in the original n dimensional space; like the earth's equator is 1 dimensional object).<p>The mathematical name for this is 'concentration of measure' [1]<p>It feels weird to think about it, but there's also a unit change in here. Paris is about 1/8 of the circle far away from the north pole (8 such angle segments of freedom). On a circle. But if that's the definition of location of Paris, on the 3D earth there would be an infinity of Paris. There is only one though. Now if we take into account longitude, we have Montreal, Vancouver, Tokyo, etc ; each 1/8 away (and now we have 64 solid angle segments of freedom)<p>[1] <a href="https://www.johndcook.com/blog/2017/07/13/concentration_of_measure/" rel="nofollow">https://www.johndcook.com/blog/2017/07/13/concentration_of_m...</a></p>
]]></description><pubDate>Thu, 30 Oct 2025 13:49:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=45760016</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=45760016</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45760016</guid></item><item><title><![CDATA[New comment by BenoitP in "Comprehension debt: A ticking time bomb of LLM-generated code"]]></title><description><![CDATA[
<p>> "theory building"<p>Strongly agree with your comment. I wonder now if this "theory building" can have a grammar, and be expressed in code; be versioned, etc. Sort of like a 5th-generation language (the 4th-generation being the SQL-likes where you let the execution plan be chosen by the runtime).<p>The closest I can think of:<p>* UML<p>* Functional analysis (ie structured text about various stakeholders)<p>* Database schemas<p>* Diagrams</p>
]]></description><pubDate>Tue, 30 Sep 2025 12:30:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=45424622</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=45424622</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45424622</guid></item><item><title><![CDATA[New comment by BenoitP in "Adventures in State Space [video]"]]></title><description><![CDATA[
<p>A bit late to the discussion, but this has deep connections. As a programmer, your job is provide business invariants using complexity management techniques. And checking that your state space is small is a tool with gigantic payoff.<p>Maintaining a small state space it why we want to let it crash. Each program instruction can potentially multiply the number of states possible. Erlang even has this whole "Let It Crash" philosophy as a guideline [1].<p>Maintaining a small state space is how you tame concurrent programs, where adding one thread can cartesian-product your state space. But there are tools like TLA+ which can help you build proofs over this state space. And build invariants that your threads can use safely. Hre is a visualizer of that state space [2]. Notice any resemblance to the graphs you just saw in the video?<p>Programming sometimes feel like this "Rush Hour" puzzle.<p>[1] <a href="https://wiki.c2.com/?LetItCrash" rel="nofollow">https://wiki.c2.com/?LetItCrash</a>
[2] <a href="https://prob.hhu.de/w/index.php?title=State_space_visualization_examples" rel="nofollow">https://prob.hhu.de/w/index.php?title=State_space_visualizat...</a></p>
]]></description><pubDate>Thu, 28 Aug 2025 12:37:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=45051415</link><dc:creator>BenoitP</dc:creator><comments>https://news.ycombinator.com/item?id=45051415</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45051415</guid></item></channel></rss>